Changeset 493225 in git
- Timestamp:
- Dec 8, 2009, 7:11:06 PM (13 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 32c11ff616c40bb7c3d5c756479b0507e505f330
- Parents:
- 42660f97810c6af10af57af395d99b9a04bb8dad
- Files:
-
- 30 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/scanner.cc
r42660f r493225 1328 1328 #ifdef OM_TRACK 1329 1329 #ifndef NDEBUG 1330 omPrintUsedTrackAddrs(stdout, 1 );1330 omPrintUsedTrackAddrs(stdout, 10); 1331 1331 #endif 1332 1332 #endif -
Singular/subexpr.cc
r42660f r493225 692 692 StringSetS((char*) (typed ? "bigint(" : "")); 693 693 number nl=(number)d; 694 nlWrite(nl );694 nlWrite(nl,NULL); 695 695 s = StringAppendS((char*) (typed ? ")" : "")); 696 696 return omStrDup(s); -
factory/fac_multivar.cc
r42660f r493225 157 157 { 158 158 find_good_prime(i.coeff(),start); 159 if (0==cf_getSmallPrime(start)) return; 159 160 if((i.exp()!=0) && ((i.exp() % cf_getSmallPrime(start))==0)) 160 161 { … … 171 172 if (f.inZ()) 172 173 { 173 while((f!=0) && (mod(f,cf_getSmallPrime(start))==0)) 174 if (0==cf_getSmallPrime(start)) return; 175 while((!f.isZero()) && (mod(f,cf_getSmallPrime(start))==0)) 174 176 { 175 177 start++; 178 if (0==cf_getSmallPrime(start)) return; 176 179 } 177 180 } … … 266 269 int p=cf_getSmallPrime(i); 267 270 //printf("found:p=%d (%d)\n",p,i); 268 if ((i==0)||(i!=prime_number)) 271 if (p==0) 272 { 273 printf("out of primes - switch ot non-NTL\n"); 274 // non-NTL stuff 275 b = coeffBound( U, getZFacModulus().getp() ); 276 if ( getZFacModulus().getpk() > b.getpk() ) 277 b = getZFacModulus(); 278 } 279 else if (((i==0)||(i!=prime_number))) 269 280 { 270 281 b = coeffBound( U, p ); 271 282 prime_number=i; 272 283 } 273 modpk bb=coeffBound(U0,p); 274 if (bb.getk() > b.getk() ) b=bb; 275 bb=coeffBound(arg,p); 276 if (bb.getk() > b.getk() ) b=bb; 284 if (p!=0) 285 { 286 modpk bb=coeffBound(U0,p); 287 if (bb.getk() > b.getk() ) b=bb; 288 bb=coeffBound(arg,p); 289 if (bb.getk() > b.getk() ) b=bb; 290 } 277 291 } 278 292 #else -
kernel/ffields.cc
r42660f r493225 21 21 static int nfCharQ1=0; /* q-1 */ 22 22 CARDINAL *nfPlus1Table=NULL; /* the table i=log(z^i) -> log(z^i+1) */ 23 char * nfParameter; /* the name of the primitive element */24 23 /* the q's from the table 'fftable' */ 25 24 unsigned short fftable[]={ … … 381 380 * write via StringAppend 382 381 */ 383 void nfWrite (number &a )382 void nfWrite (number &a, const ring r) 384 383 { 385 384 #ifdef LDEBUG … … 391 390 else 392 391 { 393 StringAppendS( nfParameter);392 StringAppendS(r->parameter[0]); 394 393 if ((long)a!=1L) 395 394 { 396 if( currRing->ShortOut==0) StringAppendS("^");395 if(r->ShortOut==0) StringAppendS("^"); 397 396 StringAppend("%d",(int)((long)a)); 398 397 } … … 409 408 #endif 410 409 char *s; 410 char *nfParameter=currRing->parameter[0]; 411 411 if (((long)a==(long)nfCharQ) || ((long)a==0L)) return NULL; 412 412 else if ((long)a==1L) … … 488 488 *a = nfDiv(z,n); 489 489 } 490 char *nfParameter=currRing->parameter[0]; 490 491 if (strncmp(s,nfParameter,strlen(nfParameter))==0) 491 492 { … … 547 548 j++; 548 549 if (nfMinPoly[j]!=0) 549 StringAppend("%d*%s^%d",nfMinPoly[j], nfParameter,i);550 StringAppend("%d*%s^%d",nfMinPoly[j],currRing->parameter[0],i); 550 551 i--; 551 552 if(i<0) break; … … 583 584 { 584 585 //Print("GF(%d)\n",c); 585 nfParameter=param[0];586 586 if ((c==nfCharQ)||(c==-nfCharQ)) 587 587 /*this field is already set*/ return; -
kernel/ffields.h
r42660f r493225 28 28 BOOLEAN nfGreater (number a, number b); 29 29 BOOLEAN nfEqual (number a, number b); 30 void nfWrite (number &a );30 void nfWrite (number &a, const ring r); 31 31 const char * nfRead (const char *s, number *a); 32 32 #ifdef LDEBUG -
kernel/gnumpc.cc
r42660f r493225 455 455 * write a floating point number 456 456 */ 457 void ngcWrite (number &a )457 void ngcWrite (number &a, const ring r) 458 458 { 459 459 if (a==NULL) -
kernel/gnumpc.h
r42660f r493225 29 29 number ngc_Copy(number a, ring r); 30 30 const char * ngcRead (const char *s, number *a); 31 void ngcWrite(number &a );31 void ngcWrite(number &a, const ring r); 32 32 number ngcRePart(number a); 33 33 number ngcImPart(number a); -
kernel/gnumpfl.cc
r42660f r493225 470 470 * write a floating point number 471 471 */ 472 void ngfWrite (number &a )472 void ngfWrite (number &a, const ring r) 473 473 { 474 474 char *out; -
kernel/gnumpfl.h
r42660f r493225 28 28 number ngf_Copy(number a, ring r); 29 29 const char * ngfRead (const char *s, number *a); 30 void ngfWrite(number &a );30 void ngfWrite(number &a, const ring r); 31 31 32 32 #ifdef LDEBUG -
kernel/kspoly.cc
r42660f r493225 25 25 int create_count = 0; 26 26 // define this if reductions are reported on TEST_OPT_DEBUG 27 //#define TEST_OPT_DEBUG_RED27 #define TEST_OPT_DEBUG_RED 28 28 #endif 29 29 -
kernel/longalg.cc
r42660f r493225 54 54 void (*nacNormalize)(number &a); 55 55 static number (*nacNeg)(number a); 56 static void (*nacWrite)(number &a); 56 #define nacWrite(A) n_Write(A,nacRing) 57 57 number (*nacCopy)(number a); 58 58 static number (*nacInvers)(number a); … … 135 135 nacIsZero = nacRing->cf->nIsZero; 136 136 nacRead = nacRing->cf->nRead; 137 nacWrite = nacRing->cf->nWrite;138 137 nacGreaterZero = nacRing->cf->nGreaterZero; 139 138 nacIsOne = nacRing->cf->nIsOne; … … 413 412 *writes a polynomial number 414 413 */ 415 void napWrite(napoly p,const BOOLEAN has_denom) 416 { 414 void napWrite(napoly p,const BOOLEAN has_denom, const ring r) 415 { 416 ring nacring=r->algring; 417 417 if (p==NULL) 418 418 StringAppendS("0"); 419 else if (p_LmIsConstant(p,nac Ring))419 else if (p_LmIsConstant(p,nacring)) 420 420 { 421 421 BOOLEAN kl=FALSE; 422 422 if (has_denom) 423 423 { 424 number den=nac Ring->cf->cfGetDenom(pGetCoeff(p), nacRing);425 kl=!n_IsOne(den,nac Ring);426 n_Delete(&den, nac Ring);424 number den=nacring->cf->cfGetDenom(pGetCoeff(p),nacring ); 425 kl=!n_IsOne(den,nacring); 426 n_Delete(&den, nacring); 427 427 } 428 428 if (kl) StringAppendS("("); 429 429 //StringAppendS("-1"); 430 n acWrite(pGetCoeff(p));430 n_Write(pGetCoeff(p),nacring); 431 431 if (kl) StringAppendS(")"); 432 432 } … … 437 437 { 438 438 BOOLEAN wroteCoeff=FALSE; 439 if ((p_LmIsConstant(p,nac Ring))440 || ((!n acIsOne(pGetCoeff(p)))441 && (!n acIsMOne(pGetCoeff(p)))))439 if ((p_LmIsConstant(p,nacring)) 440 || ((!n_IsOne(pGetCoeff(p),nacring)) 441 && (!n_IsMOne(pGetCoeff(p),nacring)))) 442 442 { 443 n acWrite(pGetCoeff(p));444 wroteCoeff=( currRing->ShortOut==0);443 n_Write(pGetCoeff(p),nacring); 444 wroteCoeff=(r->ShortOut==0); 445 445 } 446 else if (n acIsMOne(pGetCoeff(p)))446 else if (n_IsMOne(pGetCoeff(p),nacring)) 447 447 { 448 448 StringAppendS("-"); 449 449 } 450 450 int i; 451 for (i = 0; i < naNumbOfPar; i++)451 for (i = 0; i < r->P; i++) 452 452 { 453 int e=p_GetExp(p,i+1,nac Ring);453 int e=p_GetExp(p,i+1,nacring); 454 454 if (e > 0) 455 455 { … … 457 457 StringAppendS("*"); 458 458 else 459 wroteCoeff=( currRing->ShortOut==0);460 StringAppendS( naParNames[i]);459 wroteCoeff=(r->ShortOut==0); 460 StringAppendS(r->parameter[i]); 461 461 if (e > 1) 462 462 { 463 if ( currRing->ShortOut == 0)463 if (r->ShortOut == 0) 464 464 StringAppendS("^"); 465 465 StringAppend("%d", e); … … 470 470 if (p==NULL) 471 471 break; 472 if (n acGreaterZero(pGetCoeff(p)))472 if (n_GreaterZero(pGetCoeff(p),nacring)) 473 473 StringAppendS("+"); 474 474 } … … 1510 1510 * writes a number 1511 1511 */ 1512 void naWrite(number &phn )1512 void naWrite(number &phn, const ring r) 1513 1513 { 1514 1514 lnumber ph = (lnumber)phn; … … 1519 1519 phn->s = 0; 1520 1520 BOOLEAN has_denom=(ph->n!=NULL); 1521 napWrite(ph->z,has_denom/*(ph->n!=NULL)*/ );1521 napWrite(ph->z,has_denom/*(ph->n!=NULL)*/,r); 1522 1522 if (has_denom/*(ph->n!=NULL)*/) 1523 1523 { 1524 1524 StringAppendS("/"); 1525 napWrite(ph->n,TRUE );1525 napWrite(ph->n,TRUE,r); 1526 1526 } 1527 1527 } -
kernel/longalg.h
r42660f r493225 54 54 number naLcm(number a, number b, const ring r); 55 55 const char * naRead(const char * s, number * p); 56 void naWrite(number &p );56 void naWrite(number &p, const ring r); 57 57 char * naName(number n); 58 58 nMapFunc naSetMap(const ring src, const ring dst); … … 79 79 #define nanumber lnumber 80 80 napoly napRemainder(napoly f, const napoly g); 81 void napWrite(napoly l,const BOOLEAN denom=TRUE);81 //void napWrite(napoly l,const BOOLEAN denom=TRUE); 82 82 number naGetDenom(number &n, const ring r); 83 83 number naGetNumerator(number &n, const ring r); -
kernel/longrat.h
r42660f r493225 79 79 void nlPower(number x, int exp, number *lu); 80 80 const char * nlRead (const char *s, number *a); 81 void nlWrite(number &a );81 void nlWrite(number &a, const ring r); 82 82 int nlModP(number n, int p); 83 83 int nlSize(number n); -
kernel/longrat0.cc
r42660f r493225 108 108 * write a rational number 109 109 */ 110 void nlWrite (number &a )110 void nlWrite (number &a, const ring r) 111 111 { 112 112 char *s,*z; … … 124 124 { 125 125 nlNormalize(a); 126 nlWrite(a );126 nlWrite(a,r); 127 127 return; 128 128 } -
kernel/modulop.cc
r42660f r493225 218 218 } 219 219 220 void npWrite (number &a )221 { 222 if ((long)a > (npPrimeM >>1)) StringAppend("-%d",(int)(npPrimeM-((long)a)));223 else StringAppend("%d",(int)((long)a));220 void npWrite (number &a, const ring r) 221 { 222 if ((long)a>(((long)r->ch) >>1)) StringAppend("-%d",(int)(((long)r->ch)-((long)a))); 223 else StringAppend("%d",(int)((long)a)); 224 224 } 225 225 -
kernel/modulop.h
r42660f r493225 41 41 BOOLEAN npGreater (number a, number b); 42 42 BOOLEAN npEqual (number a, number b); 43 void npWrite (number &a );43 void npWrite (number &a, const ring r); 44 44 const char * npRead (const char *s, number *a); 45 45 #ifdef LDEBUG -
kernel/numbers.cc
r42660f r493225 59 59 BOOLEAN (*nIsMOne)(number a); 60 60 BOOLEAN (*nGreaterZero)(number a); 61 void (*nWrite)(number &a);62 61 const char* (*nRead)(const char *s,number *a); 63 62 void (*nPower)(number a, int i, number * result); … … 232 231 nIsMOne = r->cf->nIsMOne; 233 232 nGreaterZero = r->cf->nGreaterZero; 234 nWrite = r->cf->nWrite;235 233 nRead = r->cf->nRead; 236 234 nPower = r->cf->nPower; … … 336 334 n->nIsMOne = naIsMOne; 337 335 n->nGreaterZero= naGreaterZero; 338 n-> nWrite= naWrite;336 n->cfWrite = naWrite; 339 337 n->nRead = naRead; 340 338 n->nPower = naPower; … … 375 373 n->nIsMOne = nr2mIsMOne; 376 374 n->nGreaterZero = nr2mGreaterZero; 377 n-> nWrite = nr2mWrite;375 n->cfWrite = nr2mWrite; 378 376 n->nRead = nr2mRead; 379 377 n->nPower = nr2mPower; … … 418 416 n->nIsMOne = nrnIsMOne; 419 417 n->nGreaterZero = nrnGreaterZero; 420 n-> nWrite = nrnWrite;418 n->cfWrite = nrnWrite; 421 419 n->nRead = nrnRead; 422 420 n->nPower = nrnPower; … … 459 457 n->nIsMOne = nrzIsMOne; 460 458 n->nGreaterZero = nrzGreaterZero; 461 n-> nWrite = nrzWrite;459 n->cfWrite = nrzWrite; 462 460 n->nRead = nrzRead; 463 461 n->nPower = nrzPower; … … 498 496 n->nIsMOne = nlIsMOne; 499 497 n->nGreaterZero = nlGreaterZero; 500 n-> nWrite = nlWrite;498 n->cfWrite = nlWrite; 501 499 n->nRead = nlRead; 502 500 n->nPower = nlPower; … … 531 529 n->nIsMOne = npIsMOne; 532 530 n->nGreaterZero = npGreaterZero; 533 n-> nWrite = npWrite;531 n->cfWrite = npWrite; 534 532 n->nRead = npRead; 535 533 n->nPower = npPower; … … 573 571 n->nIsMOne = nfIsMOne; 574 572 n->nGreaterZero = nfGreaterZero; 575 n-> nWrite = nfWrite;573 n->cfWrite = nfWrite; 576 574 n->nRead = nfRead; 577 575 n->nPower = nfPower; … … 603 601 n->nIsMOne = nrIsMOne; 604 602 n->nGreaterZero = nrGreaterZero; 605 n-> nWrite = nrWrite;603 n->cfWrite = nrWrite; 606 604 n->nRead = nrRead; 607 605 n->nPower = nrPower; … … 633 631 n->nIsMOne = ngfIsMOne; 634 632 n->nGreaterZero = ngfGreaterZero; 635 n-> nWrite = ngfWrite;633 n->cfWrite = ngfWrite; 636 634 n->nRead = ngfRead; 637 635 n->nPower = ngfPower; … … 664 662 n->nIsMOne = ngcIsMOne; 665 663 n->nGreaterZero = ngcGreaterZero; 666 n-> nWrite = ngcWrite;664 n->cfWrite = ngcWrite; 667 665 n->nRead = ngcRead; 668 666 n->nPower = ngcPower; -
kernel/numbers.h
r42660f r493225 24 24 #define n_IsMOne(n, r) (r)->cf->nIsMOne(n) 25 25 #define n_GreaterZero(n, r) (r)->cf->nGreaterZero(n) 26 #define n_Write(n, r) (r)->cf-> nWrite(n)26 #define n_Write(n, r) (r)->cf->cfWrite(n,r) 27 27 #define n_Normalize(n, r) (r)->cf->nNormalize(n) 28 28 #define n_Gcd(a, b, r) (r)->cf->nGcd(a,b,r) … … 65 65 extern number (*nRePart)(number a); 66 66 extern number (*nImPart)(number a); 67 extern void (*nWrite)(number &a); 67 #define nWrite(A) n_Write(A,currRing) 68 68 extern const char * (*nRead)(const char * s, number * a); 69 69 extern void (*nNormalize)(number &a); -
kernel/pp_Mult_nn__T.cc
r42660f r493225 33 33 #ifndef HAVE_ZERODIVISORS 34 34 p_AllocBin(pNext(q), bin, r); 35 q = pNext(q);35 pIter(q); 36 36 number nc = pGetCoeff(p); 37 37 pSetCoeff0(q, n_Mult(n, nc, r)); … … 43 43 { 44 44 p_AllocBin(pNext(q), bin, r); 45 q = pNext(q);45 pIter(q); 46 46 pSetCoeff0(q, tmp); 47 47 p_MemCopy(q->exp, p->exp, length); -
kernel/rintegers.cc
r42660f r493225 314 314 #endif 315 315 316 void nrzWrite (number &a )316 void nrzWrite (number &a, const ring r) 317 317 { 318 318 char *s,*z; -
kernel/rintegers.h
r42660f r493225 43 43 number nrzExtGcd (number a, number b, number *s, number *t); 44 44 nMapFunc nrzSetMap (const ring src, const ring dst); 45 void nrzWrite (number &a );45 void nrzWrite (number &a, const ring r); 46 46 const char * nrzRead (const char *s, number *a); 47 47 char * nrzName (number n); -
kernel/rmodulo2m.cc
r42660f r493225 536 536 #endif 537 537 538 void nr2mWrite (number &a) 539 { 540 ring r=currRing; 538 void nr2mWrite (number &a, const ring r) 539 { 541 540 if ((NATNUMBER)a > (r->nr2mModul >>1)) 542 541 StringAppend("-%d",(int)(r->nr2mModul -((NATNUMBER)a))); -
kernel/rmodulo2m.h
r42660f r493225 39 39 number nr2mExtGcd (number a, number b, number *s, number *t); 40 40 nMapFunc nr2mSetMap (const ring src, const ring dst); 41 void nr2mWrite (number &a );41 void nr2mWrite (number &a, const ring r); 42 42 const char * nr2mRead (const char *s, number *a); 43 43 char * nr2mName (number n); -
kernel/rmodulon.cc
r42660f r493225 527 527 #endif 528 528 529 void nrnWrite (number &a)530 {531 char *s,*z;532 if (a==NULL)533 {534 StringAppendS("o");535 }536 else537 {538 int l=mpz_sizeinbase((int_number) a, 10);539 if (a->s<2) l=si_max(l,mpz_sizeinbase((int_number) a,10));540 l+=2;541 s=(char*)omAlloc(l);542 z=mpz_get_str(s,10,(int_number) a);543 StringAppendS(z);544 omFreeSize((ADDRESS)s,l);545 }546 }547 548 529 /*2 549 530 * extracts a long integer from s, returns the rest (COPY FROM longrat0.cc) -
kernel/rmodulon.h
r42660f r493225 44 44 number nrnExtGcd (number a, number b, number *s, number *t); 45 45 nMapFunc nrnSetMap (const ring src, const ring dst); 46 void nrnWrite (number &a); 46 #define nrnWrite nrzWrite 47 47 const char * nrnRead (const char *s, number *a); 48 48 char * nrnName (number n); -
kernel/shortfl.cc
r42660f r493225 186 186 } 187 187 188 void nrWrite (number &a )188 void nrWrite (number &a, const ring r) 189 189 { 190 190 StringAppend("%9.3e", nf(a).F()); -
kernel/shortfl.h
r42660f r493225 25 25 BOOLEAN nrGreater (number a, number b); 26 26 BOOLEAN nrEqual (number a, number b); 27 void nrWrite (number &a );27 void nrWrite (number &a, const ring r); 28 28 const char * nrRead (const char *s, number *a); 29 29 int nrGetChar(); -
kernel/structs.h
r42660f r493225 291 291 number (*nRePart)(number a); 292 292 number (*nImPart)(number a); 293 void (* nWrite)(number &a);293 void (*cfWrite)(number &a, const ring r); 294 294 const char * (*nRead)(const char * s, number * a); 295 295 void (*nNormalize)(number &a); -
omalloc/omDebugTrack.c
r42660f r493225 603 603 omAssume(d_addr->track > 0); 604 604 if (max_frames <= 0) return; 605 if (! (d_addr->flags & OM_FUSED)) return; 605 606 606 607 if (max_frames > OM_MAX_KEPT_FRAMES) max_frames = OM_MAX_KEPT_FRAMES; -
omalloc/omDefaultConfig.h
r42660f r493225 184 184 and free time of addr (track >= 5) */ 185 185 #ifndef OM_MAX_KEPT_FRAMES 186 #define OM_MAX_KEPT_FRAMES 5186 #define OM_MAX_KEPT_FRAMES 10 187 187 #endif 188 188
Note: See TracChangeset
for help on using the changeset viewer.