120{
123 unsigned long count =
v[0].comp;
125 {
127 }
128 const poly q =
p_New(r);
131 const unsigned long q_not_sev = ~p_GetShortExpVector(q, r);
132 for(
unsigned long i = 1;
i <
count;
i++)
133 {
136 {
137 continue;
138 }
146 return q;
147 }
150}
static FORCE_INLINE number n_InpNeg(number n, const coeffs r)
in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
static FORCE_INLINE void n_InpMult(number &a, number b, const coeffs r)
multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
const Variable & v
< [in] a sqrfree bivariate poly
#define p_SetCoeff0(p, n, r)
#define p_MemSum_LengthGeneral(r, s1, s2, length)
static void p_MemAdd_NegWeightAdjust(poly p, const ring r)
static void p_ExpVectorDiff(poly pr, poly p1, poly p2, const ring r)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static void p_Setm(poly p, const ring r)
static poly p_New(const ring, omBin bin)
static BOOLEAN _p_LmDivisibleByNoComp(poly a, poly b, const ring r)
return: FALSE, if there exists i, such that a->exp[i] > b->exp[i] TRUE, otherwise (1) Consider long v...
static void p_LmFree(poly p, ring)
int status int void size_t count