#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p
const CanonicalForm CFMap CFMap int &both_non_zero int n
int64vec * iv64Add(int64vec *a, int64vec *b)
static short rVar(const ring r)
#define rVar(r) (r->N)
int64vec * nextw64(int64vec *currw, int64vec *targw, int64 nexttvec0, int64 nexttvec1)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
intvec * ivSub(intvec *a, intvec *b)
int64vec * getNthRow64(intvec *v, int n)
int64vec * leadExp64(poly p)
static int pLength(poly a)
Rational abs(const Rational &a)
int invEpsOk64(ideal I, intvec *targm, int pertdeg, int64 inveps64)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
const CanonicalForm CFMap CFMap & N
BOOLEAN rComplete(ring r, int force)
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffse...
for(int i=0;i< R->ExpL_Size;i++) Print("%09lx "
static long pTotaldegree(poly p)
ideal init64(ideal G, int64vec *currw64)
ring rCopy0(const ring r, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
int64vec * iv64Sub(int64vec *a, int64vec *b)
ideal idInterRed(ideal G)
void getTaun64(ideal G, intvec *targm, int pertdeg, int64vec **v64, int64 &i64)
ideal kInterRedOld(ideal F, ideal Q)
int iv64Size(int64vec *v)
matrix matIdLift(ideal Gomega, ideal M)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL ...
int64 gcd64(int64 a, int64 b)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
void rChangeCurrRing(ring r)
INLINE_THIS void Init(int l=0)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void rSetWeightVec(ring r, int64 *wv)
intvec * getNthRow(intvec *v, int n)
BOOLEAN noPolysWithMoreThanTwoTerms(ideal Gw)
const Variable & v
< [in] a sqrfree bivariate poly
int getMaxPosOfNthRow(intvec *v, int n)
matrix id_Module2formatedMatrix(ideal mod, int rows, int cols, const ring R)
BOOLEAN currwOnBorder64(ideal G, int64vec *currw64)
#define pGetExpV(p, e)
Gets a copy of (resp. set) the exponent vector, where e is assumed to point to (r->N +1)*sizeof(long)...
int64vec * rGetGlobalOrderMatrix(ring r)
ideal idLift(ideal mod, ideal submod, ideal *rest, BOOLEAN goodShape, BOOLEAN isSB, BOOLEAN divide, matrix *unit)
void gett64(intvec *listw, int64vec *currw64, int64vec *targw64, int64 &tvec0, int64 &tvec1)
intvec * int64VecToIntVec(int64vec *source)
static int64 scalarProduct64(int64vec *a, int64vec *b)
poly getNthPolyOfId(ideal I, int n)
#define IMATELEM(M, I, J)
void idDelete(ideal *h)
delete an ideal
int64 getInvEps64(ideal G, intvec *targm, int pertdeg)