Changeset d4cb43b in git for Singular/syz2.cc
- Timestamp:
- Jan 30, 2002, 3:33:07 PM (22 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- c658ed43f0faca30bee15dba7bad146606a58727
- Parents:
- 70981176bc24302d6a91e9beb7523f2aec93937a
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/syz2.cc
r7098117 rd4cb43b 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: syz2.cc,v 1.2 3 2001-08-27 14:47:42Singular Exp $ */4 /* $Id: syz2.cc,v 1.24 2002-01-30 14:33:06 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: resolutions … … 82 82 while ((l>0) && ((syzstr->resPairs[index])[l-1].lcm==NULL)) l--; 83 83 rr = l-1; 84 while ((rr>=0) && (((syzstr->resPairs[index])[rr].p==NULL) || 84 while ((rr>=0) && (((syzstr->resPairs[index])[rr].p==NULL) || 85 85 ((syzstr->resPairs[index])[rr].order>actdeg))) rr--; 86 r2 = rr+1; 86 r2 = rr+1; 87 87 while ((rr>=0) && ((syzstr->resPairs[index])[rr].order==actdeg) 88 88 && ((syzstr->resPairs[index])[rr].syzind<0)) … … 117 117 if (tcp!=NULL) 118 118 { 119 while ((tcp!=NULL) && 119 while ((tcp!=NULL) && 120 120 ((tcp->first_poly!=i)||(tcp->second_poly!=r1))) tcp = tcp->next; 121 121 } … … 128 128 j = 0; 129 129 while (j<i) 130 { 130 { 131 131 if (nP->m[j]!=NULL) 132 132 { … … 169 169 while ((ti<l) && (((syzstr->resPairs[index])[ti].ind1!=j)|| 170 170 ((syzstr->resPairs[index])[ti].ind2!=i))) ti++; 171 if (ti<l) 171 if (ti<l) 172 172 { 173 173 #ifdef SHOW_SPRFL … … 292 292 { 293 293 SObject tso; 294 memset(&tso,0,sizeof(tso)); 294 295 int l=(*syzstr->Tl)[index]; 295 296 … … 566 567 while (kk>=0) 567 568 { 568 if (toGo==0) 569 if (toGo==0) 569 570 { 570 571 while (kk>=0) … … 612 613 q = kBucketGetLm(syzstr->bucket); 613 614 j = 0; 614 while (j<kres) 615 while (j<kres) 615 616 { 616 if ((redset[j].p!=NULL) && (pLmDivisibleBy(redset[j].p,q)) 617 if ((redset[j].p!=NULL) && (pLmDivisibleBy(redset[j].p,q)) 617 618 && ((redset[j].ind1!=tso.ind1) || (redset[j].ind2!=tso.ind2))) 618 619 { … … 756 757 i = 0; 757 758 delete spl1; 758 spl1 = ivStrip(spl2); 759 spl1 = ivStrip(spl2); 759 760 delete spl2; 760 761 if (spl1!=NULL) … … 763 764 kk = (*spl1)[i]-1; 764 765 } 765 } 766 } 766 767 #endif 767 768 #ifdef USE_HEURISTIC2 … … 914 915 for (i=1;i<=syzstr->length;i++) 915 916 { 916 if (!idIs0(syzstr->orderedRes[i])) 917 if (!idIs0(syzstr->orderedRes[i])) 917 918 { 918 919 toreor = syzstr->orderedRes[i]; … … 927 928 toreor->m[j] = NULL; 928 929 } 929 m = 0; 930 m = 0; 930 931 for (j=0;j<togo;j++) 931 932 { … … 948 949 949 950 /*2 950 * the CoCoA-algorithm for free resolutions, using a formula 951 * the CoCoA-algorithm for free resolutions, using a formula 951 952 * for remaining pairs based on Hilbert-functions 952 953 */ … … 968 969 return syzstr; 969 970 } 970 971 971 972 // Creare dp,S ring and change to it 972 973 syzstr->syRing = rCurrRingAssure_dp_C(); … … 1082 1083 kBucketDestroy(&(syzstr->bucket)); 1083 1084 kBucketDestroy(&(syzstr->syz_bucket)); 1084 if (origR != syzstr->syRing) 1085 if (origR != syzstr->syRing) 1085 1086 rChangeCurrRing(origR); 1086 1087 else
Note: See TracChangeset
for help on using the changeset viewer.