Changeset e803ec in git
- Timestamp:
- Jul 30, 2009, 1:49:09 PM (15 years ago)
- Branches:
- (u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
- Children:
- 6da93293a6bc47af4f1914d4fb0a58837982641d
- Parents:
- ea060104ee13bd3ee6905e6217bf3132876b9579
- Location:
- kernel
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/longalg.cc
rea0601 re803ec 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: longalg.cc,v 1.3 8 2008-08-22 11:56:55Singular Exp $ */4 /* $Id: longalg.cc,v 1.39 2009-07-30 11:49:09 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: algebraic numbers … … 439 439 if (has_denom) 440 440 { 441 number den=n acRing->cf->n_GetDenom(napGetCoeff(p), nacRing);441 number den=n_GetDenom(napGetCoeff(p), nacRing); 442 442 kl=!n_IsOne(den,nacRing); 443 443 n_Delete(&den, nacRing); … … 2463 2463 return r->cf->nInit(1); 2464 2464 } 2465 number naGetNumerator(number &n, const ring r) 2466 { 2467 if (r==currRing) naNormalize(n); 2468 lnumber x=(lnumber)n; 2469 if (x!=NULL) 2470 { 2471 lnumber rr=(lnumber)omAlloc0Bin(rnumber_bin); 2472 rr->z=nap_Copy(naGetNom0(x),r); 2473 rr->s = 2; 2474 rr->cnt=0; 2475 return (number)rr; 2476 } 2477 return NULL; 2478 } 2465 2479 2466 2480 #ifdef LDEBUG -
kernel/longalg.h
rea0601 re803ec 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: longalg.h,v 1. 8 2008-03-19 17:44:09 Singular Exp $ */6 /* $Id: longalg.h,v 1.9 2009-07-30 11:49:09 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: algebraic numbers … … 94 94 extern number (*nacInit)(int i); 95 95 extern void (*nacNormalize)(number &a); 96 extern void napWrite(napoly l,const BOOLEAN denom=TRUE); 97 extern number naGetDenom(number &n, const ring r); 96 void napWrite(napoly l,const BOOLEAN denom=TRUE); 97 number naGetDenom(number &n, const ring r); 98 number naGetNumerator(number &n, const ring r); 98 99 #endif 99 100 -
kernel/longrat.cc
rea0601 re803ec 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: longrat.cc,v 1.4 2 2009-07-16 16:01:26Singular Exp $ */4 /* $Id: longrat.cc,v 1.43 2009-07-30 11:49:09 Singular Exp $ */ 5 5 /* 6 6 * ABSTRACT: computation with long rational numbers (Hubert Grassmann) … … 1421 1421 * acces to Nominator, nlCopy(n) for integers 1422 1422 */ 1423 number nlGetN om(number &n, const ring r)1423 number nlGetNumerator(number &n, const ring r) 1424 1424 { 1425 1425 if (!(SR_HDL(n) & SR_INT)) -
kernel/longrat.h
rea0601 re803ec 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: longrat.h,v 1.1 3 2008-08-06 13:55:42Singular Exp $ */6 /* $Id: longrat.h,v 1.14 2009-07-30 11:49:09 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: computation with long rational numbers … … 84 84 int nlSize(number n); 85 85 number nlGetDenom(number &n, const ring r); 86 number nlGetN om(number &n, const ring r);86 number nlGetNumerator(number &n, const ring r); 87 87 number nlChineseRemainder(number *x, number *q,int rl); 88 88 #ifdef LDEBUG -
kernel/numbers.cc
rea0601 re803ec 2 2 * Computer Algebra System SINGULAR * 3 3 *****************************************/ 4 /* $Id: numbers.cc,v 1.2 3 2009-07-03 13:14:10 seelischExp $ */4 /* $Id: numbers.cc,v 1.24 2009-07-30 11:49:09 Singular Exp $ */ 5 5 6 6 /* … … 111 111 112 112 number ndGetDenom(number &n, const ring r) { return n_Init(1,r); } 113 number ndGetNumerator(number &a,const ring r) { return r->cf->nCopy(a); } 113 114 114 115 int ndSize(number a) { return (int)nIsZero(a)==FALSE; } … … 297 298 n->nParDeg=ndParDeg; 298 299 n->nSize = ndSize; 299 n->n_GetDenom= ndGetDenom; 300 n->cfGetDenom= ndGetDenom; 301 n->cfGetNumerator= ndGetNumerator; 300 302 n->nName = ndName; 301 303 n->nImPart=ndReturn0; … … 349 351 n->nName = naName; 350 352 n->nSize = naSize; 351 n->n_GetDenom = naGetDenom; 353 n->cfGetDenom = naGetDenom; 354 n->cfGetNumerator= naGetNumerator; 352 355 #ifdef LDEBUG 353 356 n->nDBTest = naDBTest; … … 510 513 n->cfSetMap = nlSetMap; 511 514 n->nSize = nlSize; 512 n->n_GetDenom = nlGetDenom; 515 n->cfGetDenom = nlGetDenom; 516 n->cfGetNumerator = nlGetNumerator; 513 517 #ifdef LDEBUG 514 518 n->nDBTest=nlDBTest; -
kernel/numbers.h
rea0601 re803ec 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: numbers.h,v 1.1 6 2008-12-08 17:47:35Singular Exp $ */6 /* $Id: numbers.h,v 1.17 2009-07-30 11:49:09 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT: interface to coefficient aritmetics … … 35 35 #define n_Power(a, b, res, r) (r)->cf->nPower(a,b,res) 36 36 #define n_Size(n,r) (r)->cf->nSize(n) 37 #define n_GetDenom(N,r) (r)->cf->cfGetDenom((N),r) 38 #define n_GetNumerator(N,r) (r)->cf->cfGetNumerator((N),r) 37 39 38 40 #define n_New(n, r) (r)->cf->nNew(n) … … 83 85 #define nTest(a) (1) 84 86 #define nDelete(A) (currRing)->cf->cfDelete(A,currRing) 85 #define nGetDenom(N) (currRing->cf->n_GetDenom((N),currRing)) 87 #define nGetDenom(N) (currRing->cf->cfGetDenom((N),currRing)) 88 #define nGetNumerator(N) (currRing->cf->cfGetNumerator((N),currRing)) 86 89 87 90 #define nSetMap(R) (currRing->cf->cfSetMap(R,currRing)) -
kernel/structs.h
rea0601 re803ec 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: structs.h,v 1.6 3 2009-07-28 14:15:05Singular Exp $ */6 /* $Id: structs.h,v 1.64 2009-07-30 11:49:09 Singular Exp $ */ 7 7 /* 8 8 * ABSTRACT … … 305 305 (*nGreaterZero)(number a); 306 306 void (*nPower)(number a, int i, number * result); 307 number (*n_GetDenom)(number &n, const ring r); 307 number (*cfGetDenom)(number &n, const ring r); 308 number (*cfGetNumerator)(number &n, const ring r); 308 309 number (*nGcd)(number a, number b, const ring r); 309 310 number (*nLcm)(number a, number b, const ring r);
Note: See TracChangeset
for help on using the changeset viewer.