52 poly* potences=(poly*)
omAlloc((d_max+1)*
sizeof(poly));
57 potences[
i]=
pp_Mult_qq(potences[i-1],inner_multi,r);
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
void kBucketInit(kBucket_pt bucket, poly lm, int length)
STATIC_INST_VAR ideal zero_ideal
gmp_float exp(const gmp_float &a)
static short rVar(const ring r)
#define rVar(r) (r->N)
void bit_reduce(poly &f, ring r)
void kBucketDestroy(kBucket_pt *bucket_pt)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
static int max(int a, int b)
poly uni_subst_bits(poly outer_uni, poly inner_multi, ring r)
static poly pp_Mult_qq(poly p, poly q, const ring r)
static poly p_Mult_nn(poly p, number n, const ring r)
static void p_Delete(poly *p, const ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent : VarOffset encodes the position in p->exp
static void p_Setm(poly p, const ring r)
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
poly p_ISet(long i, const ring r)
returns the poly representing the integer i
void kBucket_Add_q(kBucket_pt bucket, poly q, int *l)
Add to Bucket a poly ,i.e. Bpoly == q+Bpoly.