Changeset e5c9e5 in git for libpolys/polys/ext_fields/transext.cc
- Timestamp:
- Mar 5, 2013, 4:43:58 PM (10 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '1d362c315e551a5b527ab0759f8839cf0e94f3a5')
- Children:
- 803cb2d20d4037b513adf020767d48f6893fc9a2
- Parents:
- 161e20729b9213f0aaa51ebeacdbd63260916ff6
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/polys/ext_fields/transext.cc
r161e20 re5c9e5 152 152 assume( _p_Test(den, ntRing,1) ); 153 153 154 if(p_IsConstant(den, ntRing) && (n_IsOne(pGetCoeff(den), nt Ring->cf)))154 if(p_IsConstant(den, ntRing) && (n_IsOne(pGetCoeff(den), ntCoeffs))) 155 155 { 156 156 Print("?/1 in %s:%d\n",f,l); … … 158 158 } 159 159 160 if( !n_GreaterZero(pGetCoeff(den), nt Ring->cf) )160 if( !n_GreaterZero(pGetCoeff(den), ntCoeffs) ) 161 161 { 162 162 Print("negative sign of DEN. of a fraction in %s:%d\n",f,l); … … 300 300 301 301 302 n_ClearDenominators(itr, g, nt Ring->cf);303 304 if( !n_GreaterZero(g, nt Ring->cf) )302 n_ClearDenominators(itr, g, ntCoeffs); 303 304 if( !n_GreaterZero(g, ntCoeffs) ) 305 305 { 306 306 NUM (f) = p_Neg(NUM (f), ntRing); // Ugly :((( 307 g = n_Neg(g, nt Ring->cf);307 g = n_Neg(g, ntCoeffs); 308 308 } 309 309 310 310 // g should be a positive integer now! 311 assume( n_GreaterZero(g, nt Ring->cf) );312 313 if( !n_IsOne(g, nt Ring->cf) )311 assume( n_GreaterZero(g, ntCoeffs) ); 312 313 if( !n_IsOne(g, ntCoeffs) ) 314 314 { 315 315 DEN (f) = p_NSet(g, ntRing); // update COM(f)??? … … 318 318 } 319 319 else 320 n_Delete(&g, nt Ring->cf);320 n_Delete(&g, ntCoeffs); 321 321 322 322 ntTest(a); … … 386 386 CPolyCoeffsEnumerator itr(NUM(f)); 387 387 388 n_ClearDenominators(itr, g, nt Ring->cf); // may return -1 :(((389 390 if( !n_GreaterZero(g, nt Ring->cf) )388 n_ClearDenominators(itr, g, ntCoeffs); // may return -1 :((( 389 390 if( !n_GreaterZero(g, ntCoeffs) ) 391 391 { 392 392 // NUM (f) = p_Neg(NUM (f), ntRing); // Ugly :((( 393 // g = n_Neg(g, nt Ring->cf);393 // g = n_Neg(g, ntCoeffs); 394 394 NUM (f) = p_Neg(NUM (f), ntRing); // Ugly :((( 395 g = n_Neg(g, nt Ring->cf);395 g = n_Neg(g, ntCoeffs); 396 396 } 397 397 398 398 // g should be a positive integer now! 399 assume( n_GreaterZero(g, nt Ring->cf) );400 401 if( !n_IsOne(g, nt Ring->cf) )402 { 403 assume( n_GreaterZero(g, nt Ring->cf) );404 assume( !n_IsOne(g, nt Ring->cf) );399 assume( n_GreaterZero(g, ntCoeffs) ); 400 401 if( !n_IsOne(g, ntCoeffs) ) 402 { 403 assume( n_GreaterZero(g, ntCoeffs) ); 404 assume( !n_IsOne(g, ntCoeffs) ); 405 405 406 406 DEN (f) = p_NSet(g, ntRing); // update COM(f)??? … … 413 413 { // common denom == 1? 414 414 NUM (result)= p_NSet(g, ntRing); // p_Copy (DEN (f), ntRing); 415 // n_Delete(&g, nt Ring->cf);415 // n_Delete(&g, ntCoeffs); 416 416 } 417 417 … … 419 419 // else 420 420 // g= p_GetAllDenom (num, ntRing); 421 // result= (fraction) ntSetMap (nt Ring->cf, cf) (g, ntRing->cf, cf);421 // result= (fraction) ntSetMap (ntCoeffs, cf) (g, ntCoeffs, cf); 422 422 423 423 ntTest((number)result); … … 533 533 if (p == NULL) return NULL; 534 534 535 fraction f = (fraction)omAlloc0Bin(fractionObjectBin); 536 537 if (nCoeff_is_Q(ntCoeffs)) 538 { 535 539 number g; 536 540 // TODO/NOTE: the following should not be necessary (due to 537 541 // Hannes!) as NUM (f) should be over Z!!! 542 // but it is not: normalize it 538 543 CPolyCoeffsEnumerator itr(p); 539 544 540 n_ClearDenominators(itr, g, nt Ring->cf);541 542 if( !n_GreaterZero(g, nt Ring->cf) )543 { 544 p = p_Neg(p, ntRing); // Ugly :(((545 g = n_Neg(g, nt Ring->cf);545 n_ClearDenominators(itr, g, ntCoeffs); 546 547 if( !n_GreaterZero(g, ntCoeffs) ) 548 { 549 p = p_Neg(p, ntRing); 550 g = n_Neg(g, ntCoeffs); 546 551 } 547 552 548 553 // g should be a positive integer now! 549 assume( n_GreaterZero(g, ntRing->cf) ); 550 551 fraction f = (fraction)omAlloc0Bin(fractionObjectBin); 552 553 if( !n_IsOne(g, ntRing->cf) ) 554 assume( n_GreaterZero(g, ntCoeffs) ); 555 556 if( !n_IsOne(g, ntCoeffs) ) 554 557 { 555 558 DEN (f) = p_NSet(g, ntRing); 556 // COM (f) ++; // update COM(f)???557 559 assume( DEN (f) != NULL ); 558 560 } 559 561 else 560 562 { 561 DEN(f) = NULL; 562 n_Delete(&g, ntRing->cf); 563 } 564 565 NUM(f) = p; 566 COM(f) = 0; 567 568 ntTest((number)f); 569 return (number)f; 563 //DEN(f) = NULL; // done by omAlloc0 564 n_Delete(&g, ntCoeffs); 565 } 566 } 567 568 NUM(f) = p; 569 COM(f) = 0; 570 571 ntTest((number)f); 572 return (number)f; 570 573 } 571 574 … … 633 636 number aa; 634 637 number bb; 635 if (bDenCoeff==NULL) aa=n_Copy(aNumCoeff,nt Ring->cf);636 else aa=n_Mult(aNumCoeff,bDenCoeff,nt Ring->cf);637 if (aDenCoeff==NULL) bb=n_Copy(bNumCoeff,nt Ring->cf);638 else bb=n_Mult(bNumCoeff,aDenCoeff,nt Ring->cf);638 if (bDenCoeff==NULL) aa=n_Copy(aNumCoeff,ntCoeffs); 639 else aa=n_Mult(aNumCoeff,bDenCoeff,ntCoeffs); 640 if (aDenCoeff==NULL) bb=n_Copy(bNumCoeff,ntCoeffs); 641 else bb=n_Mult(bNumCoeff,aDenCoeff,ntCoeffs); 639 642 BOOLEAN rr= n_Greater(aa, bb, ntCoeffs); 640 n_Delete(&aa,nt Ring->cf);641 n_Delete(&bb,nt Ring->cf);643 n_Delete(&aa,ntCoeffs); 644 n_Delete(&bb,ntCoeffs); 642 645 return rr; 643 646 } … … 849 852 fraction result = (fraction)omAlloc0Bin(fractionObjectBin); 850 853 NUM(result) = g; 851 if (!n_GreaterZero(pGetCoeff(f),nt Ring->cf))854 if (!n_GreaterZero(pGetCoeff(f),ntCoeffs)) 852 855 { 853 856 g=p_Neg(g,ntRing); … … 855 858 NUM(result) = g; 856 859 } 857 if (!p_IsConstant(f,ntRing) || !n_IsOne(pGetCoeff(f),nt Ring->cf))860 if (!p_IsConstant(f,ntRing) || !n_IsOne(pGetCoeff(f),ntCoeffs)) 858 861 { 859 862 DEN(result) = f; … … 1282 1285 definiteGcdCancellation(a, cf, FALSE); 1283 1286 if ((DEN(a)!=NULL) 1284 &&(!n_GreaterZero(pGetCoeff(DEN(a)),nt Ring->cf)))1287 &&(!n_GreaterZero(pGetCoeff(DEN(a)),ntCoeffs))) 1285 1288 { 1286 1289 NUM(a)=p_Neg(NUM(a),ntRing); … … 1450 1453 { 1451 1454 poly num_f=NUM(f); 1452 BOOLEAN neg= !n_GreaterZero(pGetCoeff(num_f),nt Ring->cf);1455 BOOLEAN neg= !n_GreaterZero(pGetCoeff(num_f),ntCoeffs); 1453 1456 if (neg) 1454 1457 {
Note: See TracChangeset
for help on using the changeset viewer.