Changeset 7447d8 in git for kernel/ffields.cc
- Timestamp:
- Jul 27, 2005, 5:48:29 PM (19 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 0b5a8b964a0f8ffcf71b80e540492fabe3f379ce
- Parents:
- 7adb161bdb6d1b153d8380ad71f162acf6914d8f
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/ffields.cc
r7adb161 r7447d8 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ffields.cc,v 1. 2 2005-07-27 09:46:20Singular Exp $ */4 /* $Id: ffields.cc,v 1.3 2005-07-27 15:48:28 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: finite fields with a none-prime number of elements (via tables) … … 123 123 BOOLEAN nfDBTest (number a, char *f, int l) 124 124 { 125 if ((( int)a<0) || ((int)a>nfCharQ))126 { 127 Print("wrong %d in %s:%d\n",(int) a,f,l);125 if (((long)a<0L) || ((long)a>(long)nfCharQ)) 126 { 127 Print("wrong %d in %s:%d\n",(int)((long)a),f,l); 128 128 return FALSE; 129 129 } … … 163 163 nfTest(b); 164 164 #endif 165 if ((( int)a == nfCharQ) || ((int)b ==nfCharQ))165 if (((long)a == (long)nfCharQ) || ((long)b == (long)nfCharQ)) 166 166 return (number)nfCharQ; 167 167 /*else*/ 168 int i=(int) a+(int)b;168 int i=(int)((long)a+(long)b); 169 169 if (i>=nfCharQ1) i-=nfCharQ1; 170 170 #ifdef LDEBUG … … 213 213 nfTest(n); 214 214 #endif 215 if( nfCharQ == (int)n) return -1;216 return (int) n;215 if((long)nfCharQ == (long)n) return -1; 216 return (int)((long)n); 217 217 } 218 218 … … 236 236 nfTest(b); 237 237 #endif 238 if ( nfCharQ == (int)a) return b;239 if ( nfCharQ == (int)b) return a;240 intzb,zab,r;241 if (( int)a >= (int)b)242 { 243 zb = ( int)b;244 zab = ( int)a-(int)b;238 if ((long)nfCharQ == (long)a) return b; 239 if ((long)nfCharQ == (long)b) return a; 240 long zb,zab,r; 241 if ((long)a >= (long)b) 242 { 243 zb = (long)b; 244 zab = (long)a-(long)b; 245 245 } 246 246 else 247 247 { 248 zb = ( int)a;249 zab = ( int)b-(int)a;248 zb = (long)a; 249 zab = (long)b-(long)a; 250 250 } 251 251 #ifdef LDEBUG 252 252 nfTest((number)zab); 253 253 #endif 254 if (nfPlus1Table[zab]==nfCharQ) r= nfCharQ; /*if z^(a-b)+1 =0*/254 if (nfPlus1Table[zab]==nfCharQ) r=(long)nfCharQ; /*if z^(a-b)+1 =0*/ 255 255 else 256 256 { 257 r= zb+ nfPlus1Table[zab];258 if(r>= nfCharQ1) r-=nfCharQ1;257 r= zb+(long)nfPlus1Table[zab]; 258 if(r>=(long)nfCharQ1) r-=(long)nfCharQ1; 259 259 } 260 260 #ifdef LDEBUG … … 281 281 nfTest(a); 282 282 #endif 283 return nfCharQ == (int)a;283 return (long)nfCharQ == (long)a; 284 284 } 285 285 … … 292 292 nfTest(a); 293 293 #endif 294 return 0 == (int)a;294 return 0L == (long)a; 295 295 } 296 296 … … 303 303 nfTest(a); 304 304 #endif 305 if (0 == (int)a) return FALSE; /* special handling of char 2*/306 return nfM1 == (int)a;305 if (0L == (long)a) return FALSE; /* special handling of char 2*/ 306 return (long)nfM1 == (long)a; 307 307 } 308 308 … … 315 315 nfTest(b); 316 316 #endif 317 if (( int)b==nfCharQ)317 if ((long)b==(long)nfCharQ) 318 318 { 319 319 WerrorS("div. by 0"); 320 return (number) nfCharQ;321 } 322 #ifdef LDEBUG 323 nfTest(a); 324 #endif 325 if (( int)a==nfCharQ)326 return (number) nfCharQ;320 return (number)((long)nfCharQ); 321 } 322 #ifdef LDEBUG 323 nfTest(a); 324 #endif 325 if ((long)a==(long)nfCharQ) 326 return (number)((long)nfCharQ); 327 327 /*else*/ 328 int s = (int)a - (int)b;329 if (s < 0 )330 s += nfCharQ1;328 long s = (long)a - (long)b; 329 if (s < 0L) 330 s += (long)nfCharQ1; 331 331 #ifdef LDEBUG 332 332 nfTest((number)s); … … 343 343 nfTest(c); 344 344 #endif 345 if (( int)c==nfCharQ)345 if ((long)c==(long)nfCharQ) 346 346 { 347 347 WerrorS("div. 1/0"); 348 return (number) nfCharQ;349 } 350 #ifdef LDEBUG 351 nfTest(((number)( nfCharQ1-(int)c)));352 #endif 353 return (number)( nfCharQ1-(int)c);348 return (number)((long)nfCharQ); 349 } 350 #ifdef LDEBUG 351 nfTest(((number)((long)nfCharQ1-(long)c))); 352 #endif 353 return (number)((long)nfCharQ1-(long)c); 354 354 } 355 355 … … 363 363 nfTest(c); 364 364 #endif 365 if ( nfCharQ == (int)c) return c;366 int i=(int)c+nfM1;367 if (i>= nfCharQ1) i-=nfCharQ1;365 if ((long)nfCharQ == (long)c) return c; 366 long i=(long)c+(long)nfM1; 367 if (i>=(long)nfCharQ1) i-=(long)nfCharQ1; 368 368 #ifdef LDEBUG 369 369 nfTest((number)i); … … 381 381 nfTest(b); 382 382 #endif 383 return ( int)a != (int)b;383 return (long)a != (long)b; 384 384 } 385 385 … … 393 393 nfTest(b); 394 394 #endif 395 return ( int)a == (int)b;395 return (long)a == (long)b; 396 396 } 397 397 … … 404 404 nfTest(a); 405 405 #endif 406 if (( int)a==nfCharQ) StringAppendS("0");407 else if (( int)a==0) StringAppendS("1");406 if ((long)a==(long)nfCharQ) StringAppendS("0"); 407 else if ((long)a==0L) StringAppendS("1"); 408 408 else if (nfIsMOne(a)) StringAppendS("-1"); 409 409 else 410 410 { 411 411 StringAppendS(nfParameter); 412 if (( int)a!=1)412 if ((long)a!=1L) 413 413 { 414 414 if(currRing->ShortOut==0) StringAppendS("^"); 415 StringAppend("%d",(int) a);415 StringAppend("%d",(int)((long)a)); 416 416 } 417 417 } … … 427 427 #endif 428 428 char *s; 429 if ((( int)a==nfCharQ) || ((int)a==0)) return NULL;430 else if (( int)a==1)429 if (((long)a==(long)nfCharQ) || ((long)a==0L)) return NULL; 430 else if ((long)a==1L) 431 431 { 432 432 return omStrDup(nfParameter); … … 435 435 { 436 436 s=(char *)omAlloc(4+strlen(nfParameter)); 437 sprintf(s,"%s%d",nfParameter,(int) a);437 sprintf(s,"%s%d",nfParameter,(int)((long)a)); 438 438 } 439 439 return s; … … 450 450 { 451 451 //*result=nfInit(1); 452 *result = (number)0 ;452 *result = (number)0L; 453 453 } 454 454 else if (i==1) … … 688 688 number nfMapP(number c) 689 689 { 690 return nfInit((int) c);690 return nfInit((int)((long)c)); 691 691 } 692 692
Note: See TracChangeset
for help on using the changeset viewer.