Changeset 0afa07 in git
- Timestamp:
- Jul 12, 2011, 11:31:27 AM (12 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
- Children:
- 44d5adb209a6c64fd34d3985f93a7c9dc6e37179
- Parents:
- 6a7368df0618cc5b104f43cceb2a3f3b41ba9366
- git-author:
- Frank Seelisch <seelisch@mathematik.uni-kl.de>2011-07-12 11:31:27+02:00
- git-committer:
- Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:39:14+01:00
- Location:
- libpolys
- Files:
-
- 15 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/coeffs/coeffs.h
r6a7368 r0afa07 109 109 /// init with an integer 110 110 number (*cfInit)(int i,const coeffs r); 111 number (*cfPar)(int i, const coeffs r);112 int (*cfParDeg)(number n, const coeffs r);113 111 /// how complicated, (0) => 0, or positive 114 112 int (*cfSize)(number n, const coeffs r); … … 383 381 { assume(src != NULL && dst != NULL); assume(dst->cfSetMap!=NULL); return dst->cfSetMap(src,dst); } 384 382 385 static inline number n_Par(int n, const coeffs r)386 { assume(r != NULL); assume(r->cfPar!=NULL); return r->cfPar(n,r); }387 388 static inline int n_ParDeg(number n, const coeffs r)389 { assume(r != NULL); assume(r->cfParDeg!=NULL); return r->cfParDeg(n,r); }390 391 383 /// Tests whether n is a correct number: only used if LDEBUG is defined 392 384 static inline BOOLEAN n_DBTest(number n, const char *filename, const int linenumber, const coeffs r) -
libpolys/coeffs/ffields.cc
r6a7368 r0afa07 773 773 r->cfExactDiv= nfDiv; 774 774 r->cfInit = nfInit; 775 //r->cfPar = ndPar;776 //r->cfParDeg = ndParDeg;777 775 //r->cfSize = ndSize; 778 776 r->cfInt = nfInt; -
libpolys/coeffs/gnumpc.cc
r6a7368 r0afa07 38 38 #endif 39 39 40 40 /* 41 41 number ngcPar(int i, const coeffs r) 42 42 { … … 47 47 return (number)n; 48 48 } 49 */ 49 50 50 51 /*2 … … 402 403 n->cfPower = ngcPower; 403 404 n->cfSetMap = ngcSetMap; 404 n->cfPar = ngcPar;405 405 n->cfRePart = ngcRePart; 406 406 n->cfImPart = ngcImPart; … … 429 429 r->cfExactDiv= nlExactDiv; 430 430 r->cfInit = nlInit; 431 r->cfPar = ndPar;432 r->cfParDeg = ndParDeg;433 431 r->cfSize = nlSize; 434 432 r->cfInt = nlInt; -
libpolys/coeffs/longrat.cc
r6a7368 r0afa07 2563 2563 r->cfExactDiv= nlExactDiv; 2564 2564 r->cfInit = nlInit; 2565 //r->cfPar = ndPar;2566 //r->cfParDeg = ndParDeg;2567 2565 r->cfSize = nlSize; 2568 2566 r->cfInt = nlInt; -
libpolys/coeffs/modulop.cc
r6a7368 r0afa07 353 353 r->cfExactDiv= npDiv; 354 354 r->cfInit = npInit; 355 //r->cfPar = ndPar;356 //r->cfParDeg = ndParDeg;357 355 //r->cfSize = ndSize; 358 356 r->cfInt = npInt; -
libpolys/coeffs/numbers.cc
r6a7368 r0afa07 94 94 char * ndName(number, const coeffs) { return NULL; } 95 95 96 number ndPar(int, const coeffs r) { return n_Init(0,r); }97 98 96 number ndReturn0(number, const coeffs r) { return n_Init(0,r); } 99 100 int ndParDeg(number, const coeffs) { return 0; }101 97 102 98 number ndGcd(number, number, const coeffs r) { return n_Init(1,r); } … … 205 201 206 202 // default entries (different from NULL) for some routines: 207 n->cfPar = ndPar;208 n->cfParDeg=ndParDeg;209 203 n->cfSize = ndSize; 210 204 n->cfGetDenom= ndGetDenom; … … 268 262 assume(n->cfExactDiv!=NULL); 269 263 assume(n->cfInit!=NULL); 270 assume(n->cfPar!=NULL);271 assume(n->cfParDeg!=NULL);272 264 assume(n->cfSize!=NULL); 273 265 assume(n->cfInt!=NULL); -
libpolys/coeffs/numbers.h
r6a7368 r0afa07 60 60 int ndSize(number a, const coeffs r); 61 61 char * ndName(number n, const coeffs r); 62 number ndPar(int i, const coeffs r);63 int ndParDeg(number n, const coeffs r);64 62 number ndGetDenom(number &n, const coeffs r); 65 63 number ndGetNumerator(number &a,const coeffs r); -
libpolys/polys/coeffrings.h
r6a7368 r0afa07 40 40 static inline number n_Gcd(number a, number b, const ring r){ return n_Gcd(a,b, r->cf);} 41 41 static inline number n_Lcm(number a, number b, const ring r){ return n_Lcm(a,b, r->cf);} 42 static inline number n_Par(int n, const ring r){ return n_Par(n, r->cf);}43 static inline int n_ParDeg(number n, const ring r){ return n_ParDeg(n, r->cf);}44 42 45 43 #ifdef HAVE_RINGS -
libpolys/polys/ext_fields/algext.cc
r6a7368 r0afa07 61 61 number naNeg(number a, const coeffs cf); 62 62 number naInvers(number a, const coeffs cf); 63 number naPar(int i, const coeffs cf);64 63 number naAdd(number a, number b, const coeffs cf); 65 64 number naSub(number a, number b, const coeffs cf); … … 245 244 } 246 245 247 number naPar(int i, const coeffs cf)248 {249 assume(i == 1); // there is only one parameter in this extension field250 poly p = p_ISet(1, naRing); // p = 1251 p_SetExp(p, 1, 1, naRing); // p = the sole extension variable252 p_Setm(p, naRing);253 return (number)p;254 }255 256 246 number naAdd(number a, number b, const coeffs cf) 257 247 { … … 642 632 cf->cfInt = naInt; 643 633 cf->cfNeg = naNeg; 644 cf->cfPar = naPar;645 634 cf->cfAdd = naAdd; 646 635 cf->cfSub = naSub; -
libpolys/polys/ext_fields/algext.h
r6a7368 r0afa07 60 60 number naNeg(number a, const coeffs cf); 61 61 number naInvers(number a, const coeffs cf); 62 number naPar(int i, const coeffs cf);63 62 number naAdd(number a, number b, const coeffs cf); 64 63 number naSub(number a, number b, const coeffs cf); -
libpolys/polys/ext_fields/transext.cc
r6a7368 r0afa07 70 70 number ntNeg(number a, const coeffs cf); 71 71 number ntInvers(number a, const coeffs cf); 72 number ntPar(int i, const coeffs cf);73 72 number ntAdd(number a, number b, const coeffs cf); 74 73 number ntSub(number a, number b, const coeffs cf); … … 343 342 PrintS(") with\n"); 344 343 PrintS("// K: "); n_CoeffWrite(cf->extRing->cf); 345 }346 347 /* the i-th parameter */348 number ntPar(int i, const coeffs cf)349 {350 assume((1 <= i) && (i <= rVar(ntRing)));351 poly p = p_ISet(1, ntRing);352 p_SetExp(p, i, 1, ntRing);353 p_Setm(p, ntRing);354 fraction result = (fraction)omAlloc0Bin(fractionObjectBin);355 NUM(result) = p;356 DEN(result) = NULL;357 COM(result) = 0;358 return (number)result;359 344 } 360 345 … … 1072 1057 cf->cfInt = ntInt; 1073 1058 cf->cfNeg = ntNeg; 1074 cf->cfPar = ntPar;1075 1059 cf->cfAdd = ntAdd; 1076 1060 cf->cfSub = ntSub; -
libpolys/polys/ext_fields/transext.h
r6a7368 r0afa07 108 108 number ntNeg(number a, const coeffs cf); 109 109 number ntInvers(number a, const coeffs cf); 110 number ntPar(int i, const coeffs cf);111 110 number ntAdd(number a, number b, const coeffs cf); 112 111 number ntSub(number a, number b, const coeffs cf); -
libpolys/polys/monomials/p_polys.cc
r6a7368 r0afa07 2273 2273 2274 2274 number p_InitContent_a(poly ph, const ring r) 2275 // only for coefficients in K(a) anf K(a,...)2275 // only for coefficients in K(a)/<minpoly(a)> and K(t_1, t_2, ..., t_n) 2276 2276 { 2277 2277 number d=pGetCoeff(ph); 2278 int s=n_ParDeg(d,r->cf); 2279 if (s /* n_ParDeg(d)*/ <=1) return n_Copy(d,r->cf); 2278 /* old: int s=n_ParDeg(d,r->cf); new: */ 2279 int s = p_Totaldegree((poly)d, r->cf->extRing); 2280 if (s <=1) return n_Copy(d,r->cf); 2280 2281 int s2=-1; 2281 2282 number d2; … … 2289 2290 break; 2290 2291 } 2291 if ((ss=n_ParDeg(pGetCoeff(ph),r->cf))<s) 2292 /* old: if ((ss=n_ParDeg(pGetCoeff(ph),r->cf))<s) new: */ 2293 if ((ss = p_Totaldegree((poly)pGetCoeff(ph), r->cf->extRing)) < s) 2292 2294 { 2293 2295 s2=s; … … 3437 3439 { 3438 3440 number c=pGetCoeff(qq); 3439 number ee= n_Par(1,dst->cf);3441 number ee=(number)rGetVar(1, dst->cf->extRing); 3440 3442 number eee;n_Power(ee,e,&eee,dst->cf); //nfDelete(ee,dst); 3441 3443 ee=n_Mult(c,eee,dst->cf); -
libpolys/polys/monomials/ring.cc
r6a7368 r0afa07 5381 5381 } 5382 5382 5383 poly rGetVar(const int varIndex, const ring r) 5384 { 5385 poly p = p_ISet(1, r); 5386 p_SetExp(p, varIndex, 1, r); 5387 p_Setm(p, r); 5388 return p; 5389 } 5390 -
libpolys/polys/monomials/ring.h
r6a7368 r0afa07 722 722 // 723 723 724 /* return the varIndex-th ring variable as a poly; 725 varIndex starts at index 1 */ 726 poly rGetVar(const int varIndex, const ring r); 727 724 728 BOOLEAN rSetISReference(const ring r, const ideal F, const int i = 0, const int p = 0, const intvec * componentWeights = NULL); 725 729
Note: See TracChangeset
for help on using the changeset viewer.