Go to the source code of this file.
|
void | out_cf (const char *s1, const CanonicalForm &f, const char *s2) |
|
static void | conv_RecPP (const CanonicalForm &f, int *exp, sBucket_pt result, ring r) |
|
static void | convRecTrP (const CanonicalForm &f, int *exp, poly &result, int offs, const ring r) |
|
static number | convFactoryNSingAN (const CanonicalForm &f, const ring r) |
|
poly | convFactoryPSingP (const CanonicalForm &f, const ring r) |
|
static void | convPhalf (poly p, int l, poly &p1, poly &p2) |
|
static poly | convPunhalf (poly p1, poly p2) |
|
static CanonicalForm | convSingPFactoryP_intern (poly p, int l, BOOLEAN &setChar, const ring r) |
|
CanonicalForm | convSingPFactoryP (poly p, const ring r) |
|
int | convFactoryISingI (const CanonicalForm &f) |
|
CanonicalForm | convSingAPFactoryAP (poly p, const Variable &a, const ring r) |
|
static void | convRecAP_R (const CanonicalForm &f, int *exp, poly &result, int par_start, int var_start, const ring r) |
|
poly | convFactoryAPSingAP_R (const CanonicalForm &f, int par_start, int var_start, const ring r) |
|
poly | convFactoryAPSingAP (const CanonicalForm &f, const ring r) |
|
CanonicalForm | convSingAFactoryA (poly p, const Variable &a, const ring r) |
|
poly | convFactoryASingA (const CanonicalForm &f, const ring r) |
|
CanonicalForm | convSingTrPFactoryP (poly p, const ring r) |
|
BOOLEAN | convSingTrP (poly p, const ring r) |
|
poly | convFactoryPSingTrP (const CanonicalForm &f, const ring r) |
|
◆ MIN_CONV_LEN
◆ TRANSEXT_PRIVATES
#define TRANSEXT_PRIVATES |
◆ conv_RecPP()
Definition at line 54 of file clapconv.cc.
57 if ( !
f.inCoeffDomain() )
69 number n=r->cf->convFactoryNSingN(
f, r->cf);
static void conv_RecPP(const CanonicalForm &f, int *exp, sBucket_pt result, ring r)
class to iterate through CanonicalForm's
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
gmp_float exp(const gmp_float &a)
static void p_SetExpV(poly p, int *ev, const ring r)
static poly p_Init(const ring r, omBin bin)
void sBucket_Merge_m(sBucket_pt bucket, poly p)
◆ convFactoryAPSingAP()
Definition at line 184 of file clapconv.cc.
poly convFactoryAPSingAP_R(const CanonicalForm &f, int par_start, int var_start, const ring r)
static int rPar(const ring r)
(r->cf->P)
◆ convFactoryAPSingAP_R()
Definition at line 173 of file clapconv.cc.
175 if (
f.isZero())
return NULL;
static void convRecAP_R(const CanonicalForm &f, int *exp, poly &result, int par_start, int var_start, const ring r)
#define omFreeSize(addr, size)
static short rVar(const ring r)
#define rVar(r) (r->N)
◆ convFactoryASingA()
Definition at line 284 of file clapconv.cc.
296 poly t=
p_Init (r->cf->extRing);
305 if( r->cf->extRing !=
NULL )
306 if (r->cf->extRing->qideal->m[0]!=
NULL)
308 poly
l=r->cf->extRing->qideal->m[0];
static number convFactoryNSingAN(const CanonicalForm &f, const ring r)
poly p_PolyDiv(poly &p, const poly divisor, const BOOLEAN needResult, const ring r)
assumes that p and divisor are univariate polynomials in r, mentioning the same variable; assumes div...
static poly p_Add_q(poly p, poly q, const ring r)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
◆ convFactoryISingI()
Definition at line 142 of file clapconv.cc.
144 if (!
f.isImm())
WerrorS(
"int overflow in det");
void WerrorS(const char *s)
◆ convFactoryNSingAN()
Definition at line 275 of file clapconv.cc.
number n_convFactoryNSingN(const CanonicalForm n, const coeffs r)
◆ convFactoryPSingP()
Definition at line 40 of file clapconv.cc.
42 if (
f.isZero())
return NULL;
sBucket_pt sBucketCreate(const ring r)
void sBucketDestroyMerge(sBucket_pt bucket, poly *p, int *length)
◆ convFactoryPSingTrP()
Definition at line 366 of file clapconv.cc.
368 if (
f.isZero())
return NULL;
static void convRecTrP(const CanonicalForm &f, int *exp, poly &result, int offs, const ring r)
◆ convPhalf()
static void convPhalf |
( |
poly |
p, |
|
|
int |
l, |
|
|
poly & |
p1, |
|
|
poly & |
p2 |
|
) |
| |
|
inlinestatic |
◆ convPunhalf()
static poly convPunhalf |
( |
poly |
p1, |
|
|
poly |
p2 |
|
) |
| |
|
inlinestatic |
◆ convRecAP_R()
static void convRecAP_R |
( |
const CanonicalForm & |
f, |
|
|
int * |
exp, |
|
|
poly & |
result, |
|
|
int |
par_start, |
|
|
int |
var_start, |
|
|
const ring |
r |
|
) |
| |
|
static |
Definition at line 189 of file clapconv.cc.
192 if ( !
f.inCoeffDomain() )
215 for (
i = 1;
i <= var_start;
i++ )
221 for (
i = par_start+1;
i <= var_start+
rPar(r);
i++ )
poly convFactoryASingA(const CanonicalForm &f, const ring r)
static long p_AddExp(poly p, int v, long ee, ring r)
static void p_Setm(poly p, const ring r)
◆ convRecTrP()
Definition at line 378 of file clapconv.cc.
381 if (
f.level() > offs )
386 exp[
l-offs] =
i.exp();
395 for (
int i =
rVar(r);
i>0;
i-- )
poly convFactoryPSingP(const CanonicalForm &f, const ring r)
number ntInit(long i, const coeffs cf)
◆ convSingAFactoryA()
Definition at line 232 of file clapconv.cc.
253 mpz_init_set( dummy, (
p_GetCoeff(
p,r->cf->extRing )->z) );
267 if ( (e =
p_GetExp(
p, 1, r->cf->extRing )) != 0 )
static const int SW_RATIONAL
set to 1 for computations over Q
static FORCE_INLINE long n_Int(number &n, const coeffs r)
conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 ....
CanonicalForm FACTORY_PUBLIC make_cf(const mpz_ptr n)
static BOOLEAN rField_is_Zp_a(const ring r)
◆ convSingAPFactoryAP()
Definition at line 148 of file clapconv.cc.
159 for (
int i = 1;
i <= n;
i++ )
const CanonicalForm CFMap CFMap & N
CanonicalForm convSingAFactoryA(poly p, const Variable &a, const ring r)
factory's class for variables
◆ convSingPFactoryP()
Definition at line 136 of file clapconv.cc.
static CanonicalForm convSingPFactoryP_intern(poly p, int l, BOOLEAN &setChar, const ring r)
static unsigned pLength(poly a)
◆ convSingPFactoryP_intern()
Definition at line 103 of file clapconv.cc.
125 for (
int i = 1;
i <=n;
i++ )
static void convPhalf(poly p, int l, poly &p1, poly &p2)
static poly convPunhalf(poly p1, poly p2)
◆ convSingTrP()
Definition at line 352 of file clapconv.cc.
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
static BOOLEAN p_IsConstant(const poly p, const ring r)
◆ convSingTrPFactoryP()
Definition at line 316 of file clapconv.cc.
328 WerrorS(
"conversion error: denominator!= 1");
341 for (
int i = n;
i > 0;
i-- )
CanonicalForm convSingPFactoryP(poly p, const ring r)
◆ out_cf()
Definition at line 99 of file cf_factor.cc.
102 if (
f.isZero()) printf(
"+0");
104 else if (!
f.inBaseDomain() )
110 if (
i.coeff().isOne())
113 if (e==0) printf(
"1");
116 printf(
"%c",
'a'+
l-1);
117 if (e!=1) printf(
"^%d",e);
125 printf(
"*%c",
'a'+
l-1);
126 if (e!=1) printf(
"^%d",e);
153 if (
l<0) printf(
"%ld",
l);
154 else printf(
"+%ld",
l);
164 char *
str =
new char[mpz_sizeinbase(
m, 10 ) + 2];
165 str = mpz_get_str(
str, 10,
m );
174 char *
str =
new char[mpz_sizeinbase(
m, 10 ) + 2];
175 str = mpz_get_str(
str, 10,
m );
177 puts(
str);putchar(
'/');
181 str =
new char[mpz_sizeinbase(
m, 10 ) + 2];
182 str = mpz_get_str(
str, 10,
m );
198 if (
f.inExtension()) printf(
"E(%d)",
f.level());
#define GaloisFieldDomain
void out_cf(const char *s1, const CanonicalForm &f, const char *s2)
cf_algorithm.cc - simple mathematical algorithms.
void FACTORY_PUBLIC gmp_numerator(const CanonicalForm &f, mpz_ptr result)
void FACTORY_PUBLIC gmp_denominator(const CanonicalForm &f, mpz_ptr result)
static long imm2int(const InternalCF *const imm)