Changeset eb55f8a in git for libpolys/coeffs/modulop.cc
- Timestamp:
- Sep 16, 2014, 4:56:19 PM (10 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 5b45a4ff15d0998cc64c730af75c1c1f773d4a77
- Parents:
- 4ec0f01d431893a4c0997d2bdfab87cb8d37e03e
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2014-09-16 16:56:19+02:00
- git-committer:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2014-09-23 20:10:49+02:00
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/coeffs/modulop.cc
r4ec0f0 reb55f8a 54 54 BOOLEAN npGreaterZero (number k, const coeffs r) 55 55 { 56 assume( n_Test(k, r));56 n_Test(k, r); 57 57 58 58 int h = (int)((long) k); … … 70 70 number npMult (number a,number b, const coeffs r) 71 71 { 72 assume( n_Test(a, r));73 assume( n_Test(b, r));72 n_Test(a, r); 73 n_Test(b, r); 74 74 75 75 if (((long)a == 0) || ((long)b == 0)) 76 76 return (number)0; 77 77 number c = npMultM(a,b, r); 78 assume( n_Test(c, r));78 n_Test(c, r); 79 79 return c; 80 80 } … … 89 89 90 90 number c = (number)ii; 91 assume( n_Test(c, r));91 n_Test(c, r); 92 92 return c; 93 93 … … 100 100 int npInt(number &n, const coeffs r) 101 101 { 102 assume( n_Test(n, r));102 n_Test(n, r); 103 103 104 104 if ((long)n > (((long)r->ch) >>1)) return (int)((long)n -((long)r->ch)); … … 108 108 number npAdd (number a, number b, const coeffs r) 109 109 { 110 assume( n_Test(a, r));111 assume( n_Test(b, r));110 n_Test(a, r); 111 n_Test(b, r); 112 112 113 113 number c = npAddM(a,b, r); 114 114 115 assume( n_Test(c, r));115 n_Test(c, r); 116 116 117 117 return c; … … 120 120 number npSub (number a, number b, const coeffs r) 121 121 { 122 assume( n_Test(a, r));123 assume( n_Test(b, r));122 n_Test(a, r); 123 n_Test(b, r); 124 124 125 125 number c = npSubM(a,b,r); 126 126 127 assume( n_Test(c, r));127 n_Test(c, r); 128 128 129 129 return c; … … 132 132 BOOLEAN npIsZero (number a, const coeffs r) 133 133 { 134 assume( n_Test(a, r));134 n_Test(a, r); 135 135 136 136 return 0 == (long)a; … … 139 139 BOOLEAN npIsOne (number a, const coeffs r) 140 140 { 141 assume( n_Test(a, r));141 n_Test(a, r); 142 142 143 143 return 1 == (long)a; … … 146 146 BOOLEAN npIsMOne (number a, const coeffs r) 147 147 { 148 assume( n_Test(a, r));148 n_Test(a, r); 149 149 150 150 return ((r->npPminus1M == (long)a)&&((long)1!=(long)a)); … … 201 201 inline number npInversM (number c, const coeffs r) 202 202 { 203 assume( n_Test(c, r));203 n_Test(c, r); 204 204 #ifndef HAVE_DIV_MOD 205 205 number d = (number)(long)r->npExpTable[r->npPminus1M - r->npLogTable[(long)c]]; … … 213 213 number d = (number)inv; 214 214 #endif 215 assume( n_Test(d, r));215 n_Test(d, r); 216 216 return d; 217 217 … … 220 220 number npDiv (number a,number b, const coeffs r) 221 221 { 222 assume( n_Test(a, r));223 assume( n_Test(b, r));222 n_Test(a, r); 223 n_Test(b, r); 224 224 225 225 //#ifdef NV_OPS … … 247 247 #endif 248 248 249 assume( n_Test(d, r));249 n_Test(d, r); 250 250 return d; 251 251 … … 253 253 number npInvers (number c, const coeffs r) 254 254 { 255 assume( n_Test(c, r));255 n_Test(c, r); 256 256 257 257 if ((long)c==0) … … 262 262 number d = npInversM(c,r); 263 263 264 assume( n_Test(d, r));264 n_Test(d, r); 265 265 return d; 266 266 … … 269 269 number npNeg (number c, const coeffs r) 270 270 { 271 assume( n_Test(c, r));271 n_Test(c, r); 272 272 273 273 if ((long)c==0) return c; … … 275 275 #if 0 276 276 number d = npNegM(c,r); 277 assume( n_Test(d, r));277 n_Test(d, r); 278 278 return d; 279 279 #else 280 280 c = npNegM(c,r); 281 assume( n_Test(c, r));281 n_Test(c, r); 282 282 return c; 283 283 #endif … … 286 286 BOOLEAN npGreater (number a,number b, const coeffs r) 287 287 { 288 assume( n_Test(a, r));289 assume( n_Test(b, r));288 n_Test(a, r); 289 n_Test(b, r); 290 290 291 291 //return (long)a != (long)b; … … 295 295 BOOLEAN npEqual (number a,number b, const coeffs r) 296 296 { 297 assume( n_Test(a, r));298 assume( n_Test(b, r));297 n_Test(a, r); 298 n_Test(b, r); 299 299 300 300 // return (long)a == (long)b; … … 305 305 void npWrite (number &a, const coeffs r) 306 306 { 307 assume( n_Test(a, r));307 n_Test(a, r); 308 308 309 309 if ((long)a>(((long)r->ch) >>1)) StringAppend("-%d",(int)(((long)r->ch)-((long)a))); … … 314 314 void npPower (number a, int i, number * result, const coeffs r) 315 315 { 316 assume( n_Test(a, r));316 n_Test(a, r); 317 317 318 318 if (i==0) … … 379 379 } 380 380 } 381 assume( n_Test(*a, r));381 n_Test(*a, r); 382 382 return s; 383 383 }
Note: See TracChangeset
for help on using the changeset viewer.