Changeset ceaa04 in git
- Timestamp:
- Nov 24, 2009, 3:22:44 PM (14 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 38f763ebc0e6bb2edf001bab9337f25e3968589e
- Parents:
- d4f1b95bd0e770f9604f2584ed80d773a7b2977b
- Location:
- factory
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
factory/NTLconvert.cc
rd4f1b95 rceaa04 288 288 // Compute the canonicalform coefficient by coefficient, 289 289 // bigone summarizes the result. 290 for (int j=0;j< deg(poly)+1;j++)290 for (int j=0;j<=deg(poly);j++) 291 291 { 292 292 if (coeff(poly,j)!=0) … … 318 318 // Compute the canonicalform coefficient by coefficient, 319 319 // bigone summarizes the result. 320 for (int j=0;j< deg(poly)+1;j++)320 for (int j=0;j<=deg(poly);j++) 321 321 { 322 322 if (coeff(poly,j)!=0) … … 387 387 // the only possible coefficients are zero 388 388 // and one yielding the following simplified loop 389 for (int j=0;j< deg(poly)+1;j++)389 for (int j=0;j<=deg(poly);j++) 390 390 { 391 391 if (coeff(poly,j)!=0) bigone+=power(x,j); … … 519 519 polynom=e[i].a; 520 520 exponent=e[i].b; 521 for (int j=0;j< deg(polynom)+1;j++)521 for (int j=0;j<=deg(polynom);j++) 522 522 { 523 523 if (coeff(polynom,j)!=0) … … 825 825 exponent=e[i].b; 826 826 827 for (int j=0;j< deg(polynom)+1;j++)827 for (int j=0;j<=deg(polynom);j++) 828 828 { 829 829 if (IsOne(coeff(polynom,j))) … … 869 869 exponent=e[i].b; 870 870 871 for (int j=0;j< deg(polynom)+1;j++)871 for (int j=0;j<=deg(polynom);j++) 872 872 { 873 873 if (IsOne(coeff(polynom,j))) … … 959 959 exponent=e[i].b; 960 960 961 for (int j=0;j< deg(polynom)+1;j++)961 for (int j=0;j<=deg(polynom);j++) 962 962 { 963 963 if (IsOne(coeff(polynom,j))) … … 1074 1074 { 1075 1075 CanonicalForm bigone= 0; 1076 for (int j=0;j< deg(f)+1;j++)1076 for (int j=0;j<=deg(f);j++) 1077 1077 { 1078 1078 if (IsOne(coeff(f,j))) -
factory/cf_factor.cc
rd4f1b95 rceaa04 193 193 while(j>0) { t*=tt; j--; } 194 194 } 195 if ( (f-t)!=0) { printf("problem:\n");out_cf("factor:",f," has problems\n");}195 if (!(f-t).isZero()) { printf("problem:\n");out_cf("factor:",f," has problems\n");} 196 196 } 197 197 //#endif
Note: See TracChangeset
for help on using the changeset viewer.