1 #ifndef SINGULARWISHLIST_H 2 #define SINGULARWISHLIST_H 18 int i=r->VarL_Size - 1;
19 unsigned long divmask = r->divmask;
22 if (r->VarL_LowIndex >= 0)
24 i += r->VarL_LowIndex;
30 (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
37 while (i>=r->VarL_LowIndex);
43 la = a->exp[r->VarL_Offset[
i]];
44 lb = b->exp[r->VarL_Offset[
i]];
46 (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
80 k=(*h)->nrows*(*h)->ncols;
BOOLEAN p_DebugLmDivisibleByNoComp(poly a, poly b, ring r)
#define omFreeSize(addr, size)
static BOOLEAN _p_LeadmonomDivisibleByNoComp(poly a, poly b, const ring r)
#define p_LmCheckPolyRing1(p, r)
#define pIfThen1(cond, check)
#define omFreeBin(addr, bin)
static BOOLEAN p_LeadmonomDivisibleBy(poly a, poly b, const ring r)
p_LmDivisibleBy checks also the divisibility of coefficients
void idShallowDelete(ideal *h)
id_ShallowDelete deletes the monomials of the polynomials stored inside of it