Changeset 2f3764 in git
- Timestamp:
- Feb 23, 2012, 5:17:24 PM (11 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 9a78ebefab412005398f3ada5901ac617d94e649
- Parents:
- 02fe5fbd39da06e8eb01f3f24ef8e94a6334fcce
- git-author:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-23 17:17:24+01:00
- git-committer:
- Oleksandr Motsak <motsak@mathematik.uni-kl.de>2012-02-23 20:35:10+01:00
- Location:
- libpolys
- Files:
-
- 25 edited
Legend:
- Unmodified
- Added
- Removed
-
libpolys/coeffs/coeffs.h
r02fe5f r2f3764 113 113 114 114 /// init with an integer 115 number (*cfInit)( inti,const coeffs r);115 number (*cfInit)(long i,const coeffs r); 116 116 117 117 /// init with a GMP integer … … 404 404 405 405 /// a number representing i in the given coeff field/ring r 406 static inline number n_Init( inti, const coeffs r)406 static inline number n_Init(long i, const coeffs r) 407 407 { assume(r != NULL); assume(r->cfInit!=NULL); return r->cfInit(i,r); } 408 408 -
libpolys/coeffs/ffields.cc
r02fe5f r2f3764 160 160 * int -> number 161 161 */ 162 number nfInit ( inti, const coeffs r)162 number nfInit (long i, const coeffs r) 163 163 { 164 164 assume( r->m_nfPlus1Table != NULL ); -
libpolys/coeffs/ffields.h
r02fe5f r2f3764 14 14 BOOLEAN nfGreaterZero (number k, const coeffs r); 15 15 number nfMult (number a, number b, const coeffs r); 16 number nfInit ( inti, const coeffs r);16 number nfInit (long i, const coeffs r); 17 17 number nfPar (int i, const coeffs r); 18 18 int nfParDeg (number n, const coeffs r); -
libpolys/coeffs/gnumpc.cc
r02fe5f r2f3764 52 52 * n := i 53 53 */ 54 number ngcInit ( inti, const coeffs r)54 number ngcInit (long i, const coeffs r) 55 55 { 56 56 assume( getCoeffType(r) == ID ); -
libpolys/coeffs/gnumpc.h
r02fe5f r2f3764 27 27 BOOLEAN ngcIsMOne(number a, const coeffs r); 28 28 BOOLEAN ngcIsZero(number za, const coeffs r); 29 number ngcInit( inti, const coeffs r);29 number ngcInit(long i, const coeffs r); 30 30 int ngcInt(number &n, const coeffs r); 31 31 number ngcNeg(number za, const coeffs r); -
libpolys/coeffs/gnumpfl.cc
r02fe5f r2f3764 40 40 * n := i 41 41 */ 42 number ngfInit ( inti, const coeffs r)42 number ngfInit (long i, const coeffs r) 43 43 { 44 44 assume( getCoeffType(r) == ID ); -
libpolys/coeffs/gnumpfl.h
r02fe5f r2f3764 26 26 BOOLEAN ngfIsMOne(number a, const coeffs r); 27 27 BOOLEAN ngfIsZero(number za, const coeffs r); 28 number ngfInit( inti, const coeffs r);28 number ngfInit(long i, const coeffs r); 29 29 int ngfInt(number &n, const coeffs r); 30 30 number ngfNeg(number za, const coeffs r); -
libpolys/coeffs/longrat.cc
r02fe5f r2f3764 2226 2226 2227 2227 // declare immedate routines 2228 number nlRInit ( inti);2228 number nlRInit (long i); 2229 2229 BOOLEAN _nlEqual_aNoImm_OR_bNoImm(number a, number b); 2230 2230 number _nlCopy_NoImm(number a); … … 2259 2259 } 2260 2260 2261 LINLINE number nlInit ( inti, const coeffs r)2261 LINLINE number nlInit (long i, const coeffs r) 2262 2262 { 2263 2263 number n; -
libpolys/coeffs/longrat.h
r02fe5f r2f3764 45 45 46 46 LINLINE BOOLEAN nlEqual(number a, number b, const coeffs r); 47 LINLINE number nlInit( inti, const coeffs r);47 LINLINE number nlInit(long i, const coeffs r); 48 48 number nlRInit (long i); 49 49 LINLINE BOOLEAN nlIsOne(number a, const coeffs r); -
libpolys/coeffs/modulop.cc
r02fe5f r2f3764 83 83 * create a number from int 84 84 */ 85 number npInit ( inti, const coeffs r)85 number npInit (long i, const coeffs r) 86 86 { 87 87 long ii=i; -
libpolys/coeffs/modulop.h
r02fe5f r2f3764 28 28 BOOLEAN npGreaterZero (number k, const coeffs r); 29 29 number npMult (number a, number b, const coeffs r); 30 number npInit ( inti, const coeffs r);30 number npInit (long i, const coeffs r); 31 31 int npInt (number &n, const coeffs r); 32 32 number npAdd (number a, number b,const coeffs r); -
libpolys/coeffs/rintegers.cc
r02fe5f r2f3764 90 90 * create a number from int 91 91 */ 92 number nrzInit ( inti, const coeffs)92 number nrzInit (long i, const coeffs) 93 93 { 94 94 int_number erg = (int_number) omAllocBin(gmp_nrz_bin); -
libpolys/coeffs/rintegers.h
r02fe5f r2f3764 20 20 BOOLEAN nrzGreaterZero (number k, const coeffs r); 21 21 number nrzMult (number a, number b, const coeffs r); 22 number nrzInit ( inti, const coeffs r);22 number nrzInit (long i, const coeffs r); 23 23 int nrzInt (number &n, const coeffs r); 24 24 number nrzAdd (number a, number b, const coeffs r); -
libpolys/coeffs/rmodulo2m.cc
r02fe5f r2f3764 201 201 * create a number from int 202 202 */ 203 number nr2mInit( inti, const coeffs r)203 number nr2mInit(long i, const coeffs r) 204 204 { 205 205 if (i == 0) return (number)(NATNUMBER)i; -
libpolys/coeffs/rmodulo2m.h
r02fe5f r2f3764 22 22 BOOLEAN nr2mGreaterZero (number k, const coeffs r); 23 23 number nr2mMult (number a, number b, const coeffs r); 24 number nr2mInit ( inti, const coeffs r);24 number nr2mInit (long i, const coeffs r); 25 25 int nr2mInt (number &n, const coeffs r); 26 26 number nr2mAdd (number a, number b, const coeffs r); -
libpolys/coeffs/rmodulon.cc
r02fe5f r2f3764 100 100 * create a number from int 101 101 */ 102 number nrnInit( inti, const coeffs r)102 number nrnInit(long i, const coeffs r) 103 103 { 104 104 int_number erg = (int_number) omAllocBin(gmp_nrz_bin); -
libpolys/coeffs/rmodulon.h
r02fe5f r2f3764 22 22 BOOLEAN nrnGreaterZero (number k, const coeffs r); 23 23 number nrnMult (number a, number b, const coeffs r); 24 number nrnInit ( inti, const coeffs r);24 number nrnInit (long i, const coeffs r); 25 25 int nrnInt (number &n, const coeffs r); 26 26 number nrnAdd (number a, number b, const coeffs r); -
libpolys/coeffs/shortfl.cc
r02fe5f r2f3764 71 71 * create a number from int 72 72 */ 73 number nrInit ( inti, const coeffs r)73 number nrInit (long i, const coeffs r) 74 74 { 75 75 assume( getCoeffType(r) == ID ); -
libpolys/coeffs/shortfl.h
r02fe5f r2f3764 21 21 BOOLEAN nrGreaterZero (number k, const coeffs r); 22 22 number nrMult (number a, number b, const coeffs r); 23 number nrInit ( inti, const coeffs r);23 number nrInit (long i, const coeffs r); 24 24 int nrInt (number &n, const coeffs r); 25 25 number nrAdd (number a, number b, const coeffs r); -
libpolys/polys/ext_fields/algext.cc
r02fe5f r2f3764 82 82 BOOLEAN naIsMOne(number a, const coeffs cf); 83 83 BOOLEAN naIsZero(number a, const coeffs cf); 84 number naInit( inti, const coeffs cf);84 number naInit(long i, const coeffs cf); 85 85 int naInt(number &a, const coeffs cf); 86 86 number naNeg(number a, const coeffs cf); … … 253 253 254 254 255 number naInit( inti, const coeffs cf)255 number naInit(long i, const coeffs cf) 256 256 { 257 257 if (i == 0) return NULL; -
libpolys/polys/ext_fields/algext.h
r02fe5f r2f3764 53 53 BOOLEAN naIsMOne(number a, const coeffs cf); 54 54 BOOLEAN naIsZero(number a, const coeffs cf); 55 number naInit( inti, const coeffs cf);55 number naInit(long i, const coeffs cf); 56 56 int naInt(number &a, const coeffs cf); 57 57 number naNeg(number a, const coeffs cf); -
libpolys/polys/ext_fields/transext.cc
r02fe5f r2f3764 100 100 BOOLEAN ntIsMOne(number a, const coeffs cf); 101 101 BOOLEAN ntIsZero(number a, const coeffs cf); 102 number ntInit( inti, const coeffs cf);102 number ntInit(long i, const coeffs cf); 103 103 int ntInt(number &a, const coeffs cf); 104 104 number ntNeg(number a, const coeffs cf); … … 336 336 337 337 338 number ntInit( inti, const coeffs cf)338 number ntInit(long i, const coeffs cf) 339 339 { 340 340 if (i == 0) return NULL; -
libpolys/polys/ext_fields/transext.h
r02fe5f r2f3764 105 105 BOOLEAN ntIsMOne(number a, const coeffs cf); 106 106 BOOLEAN ntIsZero(number a, const coeffs cf); 107 number ntInit( inti, const coeffs cf);107 number ntInit(long i, const coeffs cf); 108 108 int ntInt(number &a, const coeffs cf); 109 109 number ntNeg(number a, const coeffs cf); -
libpolys/polys/monomials/p_polys.cc
r02fe5f r2f3764 1156 1156 * returns a polynomial representing the integer i 1157 1157 */ 1158 poly p_ISet( inti, const ring r)1158 poly p_ISet(long i, const ring r) 1159 1159 { 1160 1160 poly rc = NULL; -
libpolys/polys/monomials/p_polys.h
r02fe5f r2f3764 116 116 117 117 /// returns the poly representing the integer i 118 poly p_ISet( inti, const ring r);118 poly p_ISet(long i, const ring r); 119 119 120 120 /// returns the poly representing the number n, destroys n
Note: See TracChangeset
for help on using the changeset viewer.