5#if !defined(__CYGWIN__) || defined(STATIC_VERSION)
18 ring r=(ring)args->
Data();
29 else if ((r->block0[
i]==1)&&(r->block1[
i]==r->N))
i++;
32 WerrorS(
"only for rings with a global ordering of one block");
39 WerrorS(
"only for rings with a global ordering of one block");
59 poly
p=(poly)args->
CopyD();
61 int sh=(int)((
long)(args->
Data()));
64 WerrorS(
"negative shift for pLPshift");
70 WerrorS(
"pLPshift: too big shift requested\n");
86 poly
p=(poly)
h->Data();
100 poly
p=(poly)
h->Data();
101 poly q=(poly)
h->next->Data();
108 ideal I=(ideal)
h->Data();
109 poly q=(poly)
h->next->Data();
122 poly
p=(poly)
h->Data();
123 int pos=(int)((
long)(
h->next->Data()));
136 ideal I = (ideal)
h->Data();
147 li->
m[1].
data=standardWords;
168 p->iiAddCproc(
"freealgebra.so",
"stest",
TRUE,
stest);
169 p->iiAddCproc(
"freealgebra.so",
"btest",
TRUE,
btest);
INLINE_THIS void Init(int l=0)
void WerrorS(const char *s)
static BOOLEAN lpUfnarovskiGraph(leftv res, leftv h)
static BOOLEAN freeAlgebra(leftv res, leftv args)
static BOOLEAN lpVarAt(leftv res, leftv h)
int SI_MOD_INIT freealgebra(SModulFunctions *p)
static BOOLEAN btest(leftv res, leftv h)
static BOOLEAN lpLmDivides(leftv res, leftv h)
static BOOLEAN stest(leftv res, leftv args)
intvec * lp_ufnarovskiGraph(ideal G, ideal &standardWords)
BOOLEAN iiCheckTypes(leftv args, const short *type_list, int report)
check a list of arguemys against a given field of types return TRUE if the types match return FALSE (...
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static BOOLEAN rHasLocalOrMixedOrdering(const ring r)
void p_LPshift(poly p, int sh, const ring ri)
BOOLEAN p_LPDivisibleBy(poly a, poly b, const ring r)
ring freeAlgebra(ring r, int d, int ncGenCount)
create the letterplace ring corresponding to r up to degree d
poly p_LPVarAt(poly p, int pos, const ring r)