23 for (j=(R->N); j; j--)
26 for (j=(R->N); j; j--)
32 for (k=(R->N); k>j; k--)
51 for (k=(R->N); k>j; k--)
57 for (k=j-1; k!=0 ; k--)
77 for (j=R->real_var_end; j>=R->real_var_start; j--)
80 for (j=R->real_var_end; j>=R->real_var_start; j--)
86 for (k=(R->N); k>j; k--)
87 for (k=R->real_var_end; k>j; k--)
93 for (k=j-1; k>=R->real_var_start; k--)
106 for (k=R->real_var_end; k>j; k--)
112 for (k=j-1; k>=R->real_var_start; k--)
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
Compatiblity layer for legacy polynomial operations (over currRing)
#define pGetComp(p)
Component.
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
BOOLEAN pCompareChain(poly p, poly p1, poly p2, poly lcm, const ring R)
Returns TRUE if.
BOOLEAN pCompareChainPart(poly p, poly p1, poly p2, poly lcm, const ring R)