Changeset a9c298 in git for kernel/syz2.cc
- Timestamp:
- Nov 20, 2013, 4:54:25 PM (10 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 0de0509972719531e2a4b51ec9fd0e44a66fd2fd
- Parents:
- e4014563a82388c4b39dfa37db24cbe159b24a35
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-11-20 16:54:25+01:00
- git-committer:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2013-11-20 16:54:42+01:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/syz2.cc
re40145 ra9c298 88 88 while ((l>0) && ((syzstr->resPairs[index])[l-1].lcm==NULL)) l--; 89 89 rr = l-1; 90 while ((rr>=0) && (((syzstr->resPairs[index])[rr].p==NULL) || 90 while ((rr>=0) && (((syzstr->resPairs[index])[rr].p==NULL) || 91 91 ((syzstr->resPairs[index])[rr].order>actdeg))) rr--; 92 r2 = rr+1; 92 r2 = rr+1; 93 93 while ((rr>=0) && ((syzstr->resPairs[index])[rr].order==actdeg) 94 94 && ((syzstr->resPairs[index])[rr].syzind<0)) … … 123 123 if (tcp!=NULL) 124 124 { 125 while ((tcp!=NULL) && 125 while ((tcp!=NULL) && 126 126 ((tcp->first_poly!=i)||(tcp->second_poly!=r1))) tcp = tcp->next; 127 127 } … … 134 134 j = 0; 135 135 while (j<i) 136 { 136 { 137 137 if (nP->m[j]!=NULL) 138 138 { … … 175 175 while ((ti<l) && (((syzstr->resPairs[index])[ti].ind1!=j)|| 176 176 ((syzstr->resPairs[index])[ti].ind2!=i))) ti++; 177 if (ti<l) 177 if (ti<l) 178 178 { 179 179 #ifdef SHOW_SPRFL … … 571 571 while (kk>=0) 572 572 { 573 if (toGo==0) 573 if (toGo==0) 574 574 { 575 575 while (kk>=0) … … 617 617 q = kBucketGetLm(syzstr->bucket); 618 618 j = 0; 619 while (j<kres) 619 while (j<kres) 620 620 { 621 if ((redset[j].p!=NULL) && (pLmDivisibleBy(redset[j].p,q)) 621 if ((redset[j].p!=NULL) && (pLmDivisibleBy(redset[j].p,q)) 622 622 && ((redset[j].ind1!=tso.ind1) || (redset[j].ind2!=tso.ind2))) 623 623 { … … 761 761 i = 0; 762 762 delete spl1; 763 spl1 = ivStrip(spl2); 763 spl1 = ivStrip(spl2); 764 764 delete spl2; 765 765 if (spl1!=NULL) … … 768 768 kk = (*spl1)[i]-1; 769 769 } 770 } 770 } 771 771 #endif 772 772 #ifdef USE_HEURISTIC2 … … 918 918 for (i=1;i<=syzstr->length;i++) 919 919 { 920 if (!idIs0(syzstr->orderedRes[i])) 920 if (!idIs0(syzstr->orderedRes[i])) 921 921 { 922 922 toreor = syzstr->orderedRes[i]; … … 931 931 toreor->m[j] = NULL; 932 932 } 933 m = 0; 933 m = 0; 934 934 for (j=0;j<togo;j++) 935 935 { … … 952 952 953 953 /*2 954 * the CoCoA-algorithm for free resolutions, using a formula 954 * the CoCoA-algorithm for free resolutions, using a formula 955 955 * for remaining pairs based on Hilbert-functions 956 956 */ … … 972 972 return syzstr; 973 973 } 974 974 975 975 // Creare dp,S ring and change to it 976 976 syzstr->syRing = rAssure_dp_C(origR); … … 1087 1087 kBucketDestroy(&(syzstr->bucket)); 1088 1088 kBucketDestroy(&(syzstr->syz_bucket)); 1089 if (origR != syzstr->syRing) 1089 if (origR != syzstr->syRing) 1090 1090 rChangeCurrRing(origR); 1091 1091 else
Note: See TracChangeset
for help on using the changeset viewer.