1#ifndef SINGULARWISHLIST_H
2#define SINGULARWISHLIST_H
9 int i=r->VarL_Size - 1;
10 unsigned long divmask = r->divmask;
13 if (r->VarL_LowIndex >= 0)
15 i += r->VarL_LowIndex;
21 (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
28 while (
i>=r->VarL_LowIndex);
34 la = a->exp[r->VarL_Offset[
i]];
35 lb =
b->exp[r->VarL_Offset[
i]];
37 (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
71 k=(*h)->nrows*(*h)->ncols;
91 for (
int j=0;
j<
i;
j++)
#define pIfThen1(cond, check)
#define p_LmCheckPolyRing1(p, r)
#define omFreeSize(addr, size)
#define omFreeBin(addr, bin)
BOOLEAN p_DebugLmDivisibleByNoComp(poly a, poly b, ring r)
static int rBlocks(const ring r)
static BOOLEAN _p_LeadmonomDivisibleByNoComp(poly a, poly b, const ring r)
static void idShallowDelete(ideal *h)
id_ShallowDelete deletes the monomials of the polynomials stored inside of it
void id_Write(const ideal I, const ring r)
static void deleteOrdering(ring r)
void z_Write(number p, ring r)
static BOOLEAN p_LeadmonomDivisibleBy(poly a, poly b, const ring r)
p_LmDivisibleBy checks also the divisibility of coefficients