Changeset 9bb5457 in git for libpolys/coeffs/rmodulo2m.cc
- Timestamp:
- May 27, 2011, 2:56:51 PM (13 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 2c7f28850c274452c6d4f324225864e2331412ed
- Parents:
- 7af488ec51790060979537b35a03fb345e053f90
- git-author:
- Hans Schoenemann <hannes@mathematik.uni-kl.de>2011-05-27 14:56:51+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:39:06+01:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/coeffs/rmodulo2m.cc
r7af488e r9bb5457 53 53 54 54 r->ringtype = 1; 55 55 56 56 /* next cast may yield an overflow as mod2mMask is an unsigned long */ 57 57 r->ch = (int)r->mod2mMask + 1; … … 110 110 * Give the smallest k, such that a * x = k = b * y has a solution 111 111 */ 112 number nr2mLcm(number a, number b, const coeffs r)112 number nr2mLcm(number a, number b, const coeffs) 113 113 { 114 114 NATNUMBER res = 0; … … 133 133 * a solution. 134 134 */ 135 number nr2mGcd(number a, number b, const coeffs r)135 number nr2mGcd(number a, number b, const coeffs) 136 136 { 137 137 NATNUMBER res = 0; … … 240 240 } 241 241 242 BOOLEAN nr2mIsUnit(number a, const coeffs r)242 BOOLEAN nr2mIsUnit(number a, const coeffs) 243 243 { 244 244 return ((NATNUMBER)a % 2 == 1); 245 245 } 246 246 247 number nr2mGetUnit(number k, const coeffs r)247 number nr2mGetUnit(number k, const coeffs) 248 248 { 249 249 if (k == NULL) return (number)1; … … 253 253 } 254 254 255 BOOLEAN nr2mIsZero(number a, const coeffs r)255 BOOLEAN nr2mIsZero(number a, const coeffs) 256 256 { 257 257 return 0 == (NATNUMBER)a; 258 258 } 259 259 260 BOOLEAN nr2mIsOne(number a, const coeffs r)260 BOOLEAN nr2mIsOne(number a, const coeffs) 261 261 { 262 262 return 1 == (NATNUMBER)a; … … 268 268 } 269 269 270 BOOLEAN nr2mEqual(number a, number b, const coeffs r)270 BOOLEAN nr2mEqual(number a, number b, const coeffs) 271 271 { 272 272 return (a == b); … … 310 310 } 311 311 312 int nr2mDivComp(number as, number bs, const coeffs r)312 int nr2mDivComp(number as, number bs, const coeffs) 313 313 { 314 314 NATNUMBER a = (NATNUMBER)as; … … 474 474 NATNUMBER g = 1; 475 475 NATNUMBER b_div = (NATNUMBER)b; 476 if (b_div < 0) b_div = -b_div; // b_div now represents |b| 476 if (b_div < 0) b_div = -b_div; // b_div now represents |b|, BUT b_div is unsigned! 477 477 NATNUMBER rr = 0; 478 478 while ((g < r->mod2mMask ) && (b_div > 0) && (b_div % 2 == 0)) … … 532 532 } 533 533 534 number nr2mMapMachineInt(number from, const coeffs src, const coeffs dst)534 number nr2mMapMachineInt(number from, const coeffs /*src*/, const coeffs dst) 535 535 { 536 536 NATNUMBER i = ((NATNUMBER)from) % dst->mod2mMask ; … … 538 538 } 539 539 540 number nr2mMapZp(number from, const coeffs src, const coeffs dst)540 number nr2mMapZp(number from, const coeffs /*src*/, const coeffs dst) 541 541 { 542 542 NATNUMBER j = (NATNUMBER)1; … … 549 549 } 550 550 551 number nr2mMapQ(number from, const coeffs src, const coeffs dst)551 number nr2mMapQ(number from, const coeffs /*src*/, const coeffs dst) 552 552 { 553 553 int_number erg = (int_number)omAllocBin(gmp_nrz_bin); … … 566 566 } 567 567 568 number nr2mMapGMP(number from, const coeffs src, const coeffs dst)568 number nr2mMapGMP(number from, const coeffs /*src*/, const coeffs dst) 569 569 { 570 570 int_number erg = (int_number)omAllocBin(gmp_nrz_bin); … … 659 659 660 660 #ifdef LDEBUG 661 BOOLEAN nr2mDBTest (number a, const char * f, const int l, const coeffs r)662 { 663 if ((NATNUMBER)a < 0) return FALSE;661 BOOLEAN nr2mDBTest (number a, const char *, const int, const coeffs r) 662 { 663 //if ((NATNUMBER)a < 0) return FALSE; // is unsigned! 664 664 if (((NATNUMBER)a & r->mod2mMask) != (NATNUMBER)a) return FALSE; 665 665 return TRUE;
Note: See TracChangeset
for help on using the changeset viewer.