Go to the source code of this file.
◆ btest()
Definition at line 81 of file freealgebra.cc.
82{
85 {
86 poly
p=(poly)
h->Data();
90 }
92}
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 (...
◆ freeAlgebra()
Definition at line 12 of file freealgebra.cc.
13{
17 {
18 ring r=(ring)args->
Data();
20 if (d<2)
21 {
24 }
27 {
29 else if ((r->block0[
i]==1)&&(r->block1[
i]==r->N))
i++;
30 else
31 {
32 WerrorS(
"only for rings with a global ordering of one block");
34 }
35 }
38 {
39 WerrorS(
"only for rings with a global ordering of one block");
40
42 }
43 int ncGenCount = 0;
50 }
52}
void WerrorS(const char *s)
static BOOLEAN freeAlgebra(leftv res, leftv args)
static BOOLEAN rHasLocalOrMixedOrdering(const ring r)
◆ freealgebra()
Definition at line 160 of file freealgebra.cc.
161{
162#ifdef HAVE_SHIFTBBA
167
168 p->iiAddCproc(
"freealgebra.so",
"stest",
TRUE,
stest);
169 p->iiAddCproc(
"freealgebra.so",
"btest",
TRUE,
btest);
170#endif
172}
static BOOLEAN lpUfnarovskiGraph(leftv res, leftv h)
static BOOLEAN lpVarAt(leftv res, leftv h)
static BOOLEAN btest(leftv res, leftv h)
static BOOLEAN lpLmDivides(leftv res, leftv h)
static BOOLEAN stest(leftv res, leftv args)
ring freeAlgebra(ring r, int d, int ncGenCount)
create the letterplace ring corresponding to r up to degree d
◆ lpLmDivides()
Definition at line 94 of file freealgebra.cc.
95{
99 {
100 poly
p=(poly)
h->Data();
101 poly q=(poly)
h->next->Data();
105 }
107 {
108 ideal I=(ideal)
h->Data();
109 poly q=(poly)
h->next->Data();
113 }
115}
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
BOOLEAN p_LPDivisibleBy(poly a, poly b, const ring r)
◆ lpUfnarovskiGraph()
Definition at line 131 of file freealgebra.cc.
132{
135 {
136 ideal I = (ideal)
h->Data();
138
139 ideal standardWords;
141
147 li->
m[1].
data=standardWords;
148
150
153 }
155}
INLINE_THIS void Init(int l=0)
intvec * lp_ufnarovskiGraph(ideal G, ideal &standardWords)
◆ lpVarAt()
Definition at line 117 of file freealgebra.cc.
118{
121 {
122 poly
p=(poly)
h->Data();
123 int pos=(int)((
long)(
h->next->Data()));
127 }
129}
poly p_LPVarAt(poly p, int pos, const ring r)
◆ stest()
Definition at line 54 of file freealgebra.cc.
55{
58 {
59 poly
p=(poly)args->
CopyD();
61 int sh=(int)((
long)(args->
Data()));
62 if (sh<0)
63 {
64 WerrorS(
"negative shift for pLPshift");
66 }
69 {
70 WerrorS(
"pLPshift: too big shift requested\n");
72 }
77 }
79}
void p_LPshift(poly p, int sh, const ring ri)