343 else if(
p_Cmp( m,hc,r ) < 0 ||
p_Cmp( m,wc,r ) < 0 )
358 poly multiplicant =
p_MDivide( m,stdJ->m[k],r );
419 pNext( nf ) = nfhard;
427 while( C.inc( carry ) );
435 not_finished =
FALSE;
452 }
while( not_finished );
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
static int p_Cmp(poly p1, poly p2, ring r)
static poly p_Mult_mm(poly p, poly m, const ring r)
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
void p_Norm(poly p1, const ring r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
static poly p_Copy(poly p, const ring r)
returns a copy of p
static poly normalFormHC(poly f, poly hc, const ring r)
int isMultiple(poly f, poly m, const ring r)
static void p_Delete(poly *p, const ring r)
static BOOLEAN isWell(const ring r)
void delete_monomial(poly, const ring)
static int isLeadMonomial(poly m, ideal stdJ, const ring r)
static void setExp(poly m, int *r, const ring s)
static poly normalFormZ(poly f, poly Z, const ring r)
poly p_MDivide(poly a, poly b, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
void insert_node(poly, poly, const ring)