 |
My Project
UNKNOWN_GIT_VERSION
|
Go to the source code of this file.
|
static BOOLEAN | kMoraUseBucket (kStrategy strat) |
|
static void | kOptimizeLDeg (pLDegProc ldeg, kStrategy strat) |
|
static int | doRed (LObject *h, TObject *with, BOOLEAN intoT, kStrategy strat, bool redMoraNF) |
|
int | redEcart (LObject *h, kStrategy strat) |
|
int | redRiloc (LObject *h, kStrategy strat) |
|
int | redFirst (LObject *h, kStrategy strat) |
|
static poly | redMoraNF (poly h, kStrategy strat, int flag) |
|
static poly | redMoraNFRing (poly h, kStrategy strat, int flag) |
|
void | reorderL (kStrategy strat) |
|
void | reorderT (kStrategy strat) |
|
void | missingAxis (int *last, kStrategy strat) |
|
BOOLEAN | hasPurePower (const poly p, int last, int *length, kStrategy strat) |
|
BOOLEAN | hasPurePower (LObject *L, int last, int *length, kStrategy strat) |
|
int | posInL10 (const LSet set, const int length, LObject *p, const kStrategy strat) |
|
void | updateL (kStrategy strat) |
|
void | updateLHC (kStrategy strat) |
|
void | updateT (kStrategy strat) |
|
void | firstUpdate (kStrategy strat) |
|
void | enterSMora (LObject &p, int atS, kStrategy strat, int atR=-1) |
|
void | enterSMoraNF (LObject &p, int atS, kStrategy strat, int atR=-1) |
|
void | initBba (kStrategy strat) |
|
void | initSba (ideal F, kStrategy strat) |
|
void | initMora (ideal F, kStrategy strat) |
|
void | kDebugPrint (kStrategy strat) |
|
ideal | mora (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
|
poly | kNF1 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce) |
|
ideal | kNF1 (ideal F, ideal Q, ideal q, kStrategy strat, int lazyReduce) |
|
long | kModDeg (poly p, ring r) |
|
long | kHomModDeg (poly p, ring r) |
|
ideal | kStd (ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp) |
|
ideal | kSba (ideal F, ideal Q, tHomog h, intvec **w, int sbaOrder, int arri, intvec *hilb, int syzComp, int newIdeal, intvec *vw) |
|
ideal | kStdShift (ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, int uptodeg, int lV) |
|
ideal | kMin_std (ideal F, ideal Q, tHomog h, intvec **w, ideal &M, intvec *hilb, int syzComp, int reduced) |
|
poly | kNF (ideal F, ideal Q, poly p, int syzComp, int lazyReduce) |
|
poly | kNFBound (ideal F, ideal Q, poly p, int bound, int syzComp, int lazyReduce) |
|
ideal | kNF (ideal F, ideal Q, ideal p, int syzComp, int lazyReduce) |
|
ideal | kNFBound (ideal F, ideal Q, ideal p, int bound, int syzComp, int lazyReduce) |
|
poly | k_NF (ideal F, ideal Q, poly p, int syzComp, int lazyReduce, const ring _currRing) |
| NOTE: this is just a wrapper which sets currRing for the actual kNF call. More...
|
|
ideal | kInterRedOld (ideal F, ideal Q) |
|
ideal | kInterRedBba (ideal F, ideal Q, int &need_retry) |
|
ideal | kInterRed (ideal F, ideal Q) |
|
◆ MORA_USE_BUCKETS
◆ PRE_INTEGER_CHECK
#define PRE_INTEGER_CHECK 0 |
◆ doRed()
Definition at line 118 of file kstd1.cc.
145 if (ret < 0)
return ret;
◆ enterSMora()
◆ enterSMoraNF()
◆ firstUpdate()
Definition at line 1205 of file kstd1.cc.
1220 for (
i=strat->
Ll;
i>=0;
i--)
1222 strat->
L[
i].SetpFDeg();
1224 for (
i=strat->
tl;
i>=0;
i--)
1226 strat->
T[
i].SetpFDeg();
◆ hasPurePower() [1/2]
◆ hasPurePower() [2/2]
◆ initBba()
◆ initMora()
◆ initSba()
◆ k_NF()
poly k_NF |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
poly |
p, |
|
|
int |
syzComp, |
|
|
int |
lazyReduce, |
|
|
const ring |
_currRing |
|
) |
| |
NOTE: this is just a wrapper which sets currRing for the actual kNF call.
Definition at line 3015 of file kstd1.cc.
3019 poly ret =
kNF(F,
Q,
p, syzComp, lazyReduce);
◆ kDebugPrint()
Definition at line 11619 of file kutil.cc.
11626 else Print(
"%p\n",(
void*)strat->
red);
11645 #ifdef HAVE_MORE_POS_IN_T
11683 PrintS(
"initEcartPair: ");
11687 Print(
"homog=%d, LazyDegree=%d, LazyPass=%d, ak=%d,\n",
11689 Print(
"honey=%d, sugarCrit=%d, Gebauer=%d, noTailReduction=%d, use_buckets=%d\n",
11695 Print(
"posInLDependsOnLength=%d\n",
11727 PrintS(
"currRing->pFDeg: ");
11742 PrintS(
"ecartWeights: ");
11749 #ifndef SING_NDEBUG
◆ kHomModDeg()
long kHomModDeg |
( |
poly |
p, |
|
|
ring |
r |
|
) |
| |
Definition at line 2074 of file kstd1.cc.
2079 for (
i=r->N;
i>0;
i--)
2084 return j+(*kModW)[
i-1];
◆ kInterRed()
ideal kInterRed |
( |
ideal |
F, |
|
|
ideal |
Q |
|
) |
| |
Definition at line 3380 of file kstd1.cc.
3426 while (need_retry && (counter>0))
3432 int new_elems=
idElem(res1);
3433 counter -= (new_elems >= elems);
3436 if (
idElem(res1)<=1) need_retry=0;
◆ kInterRedBba()
ideal kInterRedBba |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
int & |
need_retry |
|
) |
| |
Definition at line 3120 of file kstd1.cc.
3177 withT = ! strat->
homog;
3182 #ifdef HAVE_TAIL_RING
3187 while (strat->
Ll >= 0)
3194 strat->
P = strat->
L[strat->
Ll];
3197 if (strat->
P.p1 ==
NULL)
3203 if (strat->
P.p ==
NULL && strat->
P.t_p ==
NULL)
3211 &olddeg,&reduc,strat, red_result);
3214 red_result = strat->
red(&strat->
P,strat);
3218 if (red_result == 1)
3224 strat->
P.GetP(strat->
lmBin);
3226 int pos=
posInS(strat,strat->
sl,strat->
P.p,strat->
P.ecart);
3233 strat->
P.pCleardenom();
3237 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3238 strat->
P.pCleardenom();
3246 strat->
P.p =
redtailBba(&(strat->
P),pos-1,strat, withT);
3258 strat->
enterS(strat->
P, pos, strat, strat->
tl);
3266 for(;ii<=strat->
sl;ii++)
3269 memset(&
h,0,
sizeof(
h));
3271 h.p=strat->
S[ii]; strat->
S[ii]=
NULL;
3273 h.sev=strat->
sevS[ii];
3277 if (strat->
T[jj].p==
h.p)
3279 strat->
T[jj].p=
NULL;
3282 memmove(&(strat->
T[jj]),&(strat->
T[jj+1]),
3283 (strat->
tl-jj)*
sizeof(strat->
T[jj]));
3284 memmove(&(strat->
sevT[jj]),&(strat->
sevT[jj+1]),
3285 (strat->
tl-jj)*
sizeof(strat->
sevT[jj]));
3292 int lpos=strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
3297 Print(
"move S[%d] -> L[%d]: ",ii,pos);
3305 for(ii=pos+1;ii<=strat->
sl;ii++) strat->
fromQ[ii]=0;
3322 memset(&(strat->
P), 0,
sizeof(strat->
P));
3343 #ifdef HAVE_TAIL_RING
◆ kInterRedOld()
ideal kInterRedOld |
( |
ideal |
F, |
|
|
ideal |
Q |
|
) |
| |
◆ kMin_std()
ideal kMin_std |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
tHomog |
h, |
|
|
intvec ** |
w, |
|
|
ideal & |
M, |
|
|
intvec * |
hilb, |
|
|
int |
syzComp, |
|
|
int |
reduced |
|
) |
| |
Definition at line 2673 of file kstd1.cc.
2679 return idInit(1,F->rank);
2714 strat->
minim=(reduced % 2)+1;
2763 r=
mora(F,
Q,*
w,hilb,strat);
2770 r=
bba(F,
Q,*
w,hilb,strat);
2788 if ((delete_w)&&(temp_w!=
NULL))
delete temp_w;
2796 else if (strat->
M==
NULL)
2799 WarnS(
"no minimal generating set computed");
◆ kModDeg()
long kModDeg |
( |
poly |
p, |
|
|
ring |
r |
|
) |
| |
Definition at line 2064 of file kstd1.cc.
2071 return o+(*kModW)[
i-1];
◆ kMoraUseBucket()
Definition at line 3456 of file kstd1.cc.
3458 #ifdef MORA_USE_BUCKETS
◆ kNF() [1/2]
ideal kNF |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
ideal |
p, |
|
|
int |
syzComp, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kNF() [2/2]
poly kNF |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
poly |
p, |
|
|
int |
syzComp, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kNF1() [1/2]
ideal kNF1 |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
ideal |
q, |
|
|
kStrategy |
strat, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kNF1() [2/2]
poly kNF1 |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
poly |
q, |
|
|
kStrategy |
strat, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kNFBound() [1/2]
ideal kNFBound |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
ideal |
p, |
|
|
int |
bound, |
|
|
int |
syzComp, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kNFBound() [2/2]
poly kNFBound |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
poly |
p, |
|
|
int |
bound, |
|
|
int |
syzComp, |
|
|
int |
lazyReduce |
|
) |
| |
◆ kOptimizeLDeg()
◆ kSba()
ideal kSba |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
tHomog |
h, |
|
|
intvec ** |
w, |
|
|
int |
sbaOrder, |
|
|
int |
arri, |
|
|
intvec * |
hilb, |
|
|
int |
syzComp, |
|
|
int |
newIdeal, |
|
|
intvec * |
vw |
|
) |
| |
Definition at line 2268 of file kstd1.cc.
2272 return idInit(1,F->rank);
2372 r=
mora(F,
Q,*
w,hilb,strat);
2380 r=
sba(F,
Q,*
w,hilb,strat);
2408 bool sigdrop =
TRUE;
2410 int totalsbaruns = 1,blockedreductions = 20,blockred = 0,loops = 0;
2411 while(sigdrop && (loops < totalsbaruns || totalsbaruns == -1)
2412 && (blockred <= blockedreductions))
2523 r=
mora(F,
Q,*
w,hilb,strat);
2530 r=
sba(r,
Q,*
w,hilb,strat);
2555 if(sigdrop || blockred > blockedreductions)
2557 r =
kStd(r,
Q,
h,
w, hilb, syzComp, newIdeal, vw);
◆ kStd()
Definition at line 2087 of file kstd1.cc.
2091 return idInit(1,F->rank);
2172 #if PRE_INTEGER_CHECK
2227 r=
mora(FCopy,
Q,*
w,hilb,strat);
2229 r=
bba(FCopy,
Q,*
w,hilb,strat);
2246 r=
mora(F,
Q,*
w,hilb,strat);
2248 r=
bba(F,
Q,*
w,hilb,strat);
◆ kStdShift()
ideal kStdShift |
( |
ideal |
F, |
|
|
ideal |
Q, |
|
|
tHomog |
h, |
|
|
intvec ** |
w, |
|
|
intvec * |
hilb, |
|
|
int |
syzComp, |
|
|
int |
newIdeal, |
|
|
intvec * |
vw, |
|
|
int |
uptodeg, |
|
|
int |
lV |
|
) |
| |
Definition at line 2564 of file kstd1.cc.
2639 WerrorS(
"No local ordering possible for shift algebra");
◆ missingAxis()
void missingAxis |
( |
int * |
last, |
|
|
kStrategy |
strat |
|
) |
| |
◆ mora()
Definition at line 1516 of file kstd1.cc.
1521 int hilbeledeg=1,hilbcount=0;
1564 #ifdef HAVE_TAIL_RING
1578 while (strat->
Ll >= 0)
1585 while (strat->
Ll >= 0)
1590 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1597 while ((strat->
Ll >= 0)
1598 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1599 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1608 if (strat->
Ll<0)
break;
1611 strat->
P = strat->
L[strat->
Ll];
1638 else if (strat->
P.p1 ==
NULL)
1646 if (!strat->
P.IsNull())
1650 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
1652 red_result = strat->
red(&strat->
P,strat);
1656 if (! strat->
P.IsNull())
1663 strat->
P.pCleardenom();
1667 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
1668 if (strat->
P.p==
NULL)
1670 WerrorS(
"expoent overflow - wrong ordering");
1679 if ((strat->
P.p->next==
NULL)
1681 strat->
P.pCleardenom();
1691 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
1697 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
1707 memset(&strat->
P,0,
sizeof(strat->
P));
1762 return (strat->
Shdl);
◆ posInL10()
Definition at line 1008 of file kstd1.cc.
1015 int op=
p->GetpFDeg() +
p->ecart;
1023 && (set[
j].GetpFDeg()+set[
j].ecart >= op))
◆ redEcart()
Definition at line 168 of file kstd1.cc.
175 d =
h->GetpFDeg()+
h->ecart;
177 h->SetShortExpVector();
187 ei = strat->
T[
j].ecart;
190 if (ei >
h->ecart && ii < strat->tl)
192 li = strat->
T[
j].length;
202 if (
i > strat->
tl)
break;
203 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
204 strat->
T[
i].length < li))
211 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
212 strat->
T[
i].length < li))
217 ei = strat->
T[
i].ecart;
218 if (ei <= h->ecart)
break;
219 li = strat->
T[
i].length;
237 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
266 h->SetShortExpVector();
271 h->ecart = d-
h->GetpFDeg();
273 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
277 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
284 if (strat->
honey)
h->SetLength();
294 d =
h->GetpFDeg()+
h->ecart;
301 && ((d >= reddeg) || (pass > strat->
LazyPass)))
307 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
329 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
334 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
◆ redFirst()
Definition at line 530 of file kstd1.cc.
532 if (
h->IsNull())
return 0;
541 d =
h->GetpFDeg() +
h->ecart;
544 h->SetShortExpVector();
550 h->SetDegStuffReturnLDeg(strat->
LDegLast);
581 h->SetShortExpVector();
594 h->SetDegStuffReturnLDeg(strat->
LDegLast);
604 if (strat->
T[
j].ecart <=
h->ecart)
605 h->ecart = d -
h->GetpFDeg();
607 h->ecart = d -
h->GetpFDeg() + strat->
T[
j].ecart -
h->ecart;
609 d =
h->GetpFDeg() +
h->ecart;
612 d =
h->SetDegStuffReturnLDeg(strat->
LDegLast);
621 && ((d >= reddeg) || (pass > strat->
LazyPass)))
626 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
644 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
649 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
◆ redMoraNF()
static poly redMoraNF |
( |
poly |
h, |
|
|
kStrategy |
strat, |
|
|
int |
flag |
|
) |
| |
|
static |
Definition at line 664 of file kstd1.cc.
670 int o =
H.SetpFDeg();
674 unsigned long not_sev = ~
H.sev;
691 int ei = strat->
T[
j].ecart;
692 int li = strat->
T[
j].length;
703 if (
j > strat->
tl)
break;
704 if (ei <=
H.ecart)
break;
705 if (((strat->
T[
j].ecart < ei)
706 || ((strat->
T[
j].ecart == ei)
707 && (strat->
T[
j].length < li)))
715 ei = strat->
T[
j].ecart;
716 li = strat->
T[
j].length;
◆ redMoraNFRing()
static poly redMoraNFRing |
( |
poly |
h, |
|
|
kStrategy |
strat, |
|
|
int |
flag |
|
) |
| |
|
static |
Definition at line 764 of file kstd1.cc.
770 int o =
H.SetpFDeg();
774 unsigned long not_sev = ~
H.sev;
792 int ei = strat->
T[
j].ecart;
793 int li = strat->
T[
j].length;
804 if (
j > strat->
tl)
break;
805 if (ei <=
H.ecart)
break;
806 if (((strat->
T[
j].ecart < ei)
807 || ((strat->
T[
j].ecart == ei)
808 && (strat->
T[
j].length < li)))
817 ei = strat->
T[
j].ecart;
818 li = strat->
T[
j].length;
◆ redRiloc()
Definition at line 344 of file kstd1.cc.
351 d =
h->GetpFDeg()+
h->ecart;
353 h->SetShortExpVector();
372 if (
h->GetLmTailRing() ==
NULL)
381 ei = strat->
T[
j].ecart;
383 if (ei >
h->ecart && ii < strat->tl)
385 li = strat->
T[
j].length;
395 if (
i > strat->
tl)
break;
396 if ((strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
397 strat->
T[
i].length < li))
406 if (strat->
T[
i].ecart < ei || (strat->
T[
i].ecart == ei &&
407 strat->
T[
i].length < li))
412 ei = strat->
T[
i].ecart;
413 if (ei <= h->ecart)
break;
414 li = strat->
T[
i].length;
432 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
433 if (at <= strat->Ll &&
pLmCmp(
h->p, strat->
L[strat->
Ll].p) != 0 && !
nEqual(
h->p->coef, strat->
L[strat->
Ll].p->coef))
462 h->SetShortExpVector();
467 h->ecart = d-
h->GetpFDeg();
469 h->ecart = d-
h->GetpFDeg()+ei-
h->ecart;
473 h->ecart =
h->pLDeg(strat->
LDegLast) -
h->GetpFDeg();
476 d =
h->GetpFDeg()+
h->ecart;
483 && ((d >= reddeg) || (pass > strat->
LazyPass)))
489 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
511 if (
h->pTotalDeg()+
h->ecart >= (
int)strat->
tailRing->bitmask)
516 at = strat->
posInL(strat->
L,strat->
Ll,
h,strat);
◆ reorderL()
Definition at line 869 of file kstd1.cc.
874 for (
i=1;
i<=strat->
Ll;
i++)
876 at = strat->
posInL(strat->
L,
i-1,&(strat->
L[
i]),strat);
880 for (
j=
i-1;
j>=at;
j--) strat->
L[
j+1] = strat->
L[
j];
◆ reorderT()
Definition at line 889 of file kstd1.cc.
896 for (
i=1;
i<=strat->
tl;
i++)
898 if (strat->
T[
i-1].length > strat->
T[
i].length)
901 sev = strat->
sevT[
i];
907 if (strat->
T[
i].length > strat->
T[at].length)
break;
909 for (
j =
i-1;
j>at;
j--)
911 strat->
T[
j+1]=strat->
T[
j];
913 strat->
R[strat->
T[
j+1].i_r] = &(strat->
T[
j+1]);
916 strat->
sevT[at+1] = sev;
917 strat->
R[
p.i_r] = &(strat->
T[at+1]);
◆ updateL()
Definition at line 1041 of file kstd1.cc.
1051 p=strat->
L[strat->
Ll];
1052 strat->
L[strat->
Ll]=strat->
L[
j];
1085 strat->
L[
j].SetLmCurrRing();
1097 p=strat->
L[strat->
Ll];
1098 strat->
L[strat->
Ll]=strat->
L[
j];
◆ updateLHC()
Definition at line 1112 of file kstd1.cc.
1117 while (i <= strat->Ll)
1150 if (! strat->
L[
i].IsNull())
1152 strat->
L[
i].SetLmCurrRing();
1153 strat->
L[
i].SetpFDeg();
1155 = strat->
L[
i].pLDeg(strat->
LDegLast) - strat->
L[
i].GetpFDeg();
1162 if (strat->
L[
i].IsNull())
◆ updateT()
Definition at line 1179 of file kstd1.cc.
1184 while (i <= strat->tl)
1192 if (
p.p != strat->
T[
i].p)
◆ kHomW
◆ kModW
◆ kOptions
Initial value:
Definition at line 44 of file kstd1.cc.
◆ validOpts
void kEcartWeights(poly *s, int sl, short *eweight, const ring R)
BOOLEAN rHasGlobalOrdering(const ring r)
void updateL(kStrategy strat)
void kStratInitChangeTailRing(kStrategy strat)
static ideal nc_GB(const ideal F, const ideal Q, const intvec *w, const intvec *hilb, kStrategy strat, const ring r)
int idElem(const ideal F)
count non-zero elements
long pLDeg1(poly p, int *l, const ring r)
void deleteHC(LObject *L, kStrategy strat, BOOLEAN fromNext)
#define pIsConstant(p)
like above, except that Comp might be != 0
void initBuchMoraCrit(kStrategy strat)
int redRiloc(LObject *h, kStrategy strat)
#define pGetComp(p)
Component.
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
int posInT17_c(const TSet set, const int length, LObject &p)
poly kNF2(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
void pNorm(poly p, const ring R=currRing)
void cleanT(kStrategy strat)
void pRestoreDegProcs(ring r, pFDegProc old_FDeg, pLDegProc old_lDeg)
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
long pLDeg0c(poly p, int *l, const ring r)
int redEcart(LObject *h, kStrategy strat)
#define idDelete(H)
delete an ideal
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
void enterT_strong(LObject &p, kStrategy strat, int atT)
void khCheck(ideal Q, intvec *w, intvec *hilb, int &eledeg, int &count, kStrategy strat)
int kFindDivisibleByInS(const kStrategy strat, int *max_ind, LObject *L)
return -1 if no divisor is found number of first divisor in S, otherwise
void rDebugPrint(const ring r)
int posInL0(const LSet set, const int length, LObject *p, const kStrategy)
long pLDeg0(poly p, int *l, const ring r)
void rChangeCurrRing(ring r)
#define TEST_OPT_DEGBOUND
int posInL17_c(const LSet set, const int length, LObject *p, const kStrategy)
BOOLEAN arriRewCriterion(poly, unsigned long, poly, kStrategy strat, int start=0)
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
static BOOLEAN idHomIdeal(ideal id, ideal Q=NULL)
void reorderL(kStrategy strat)
long pLDeg1_Totaldegree(poly p, int *l, const ring r)
int posInT_EcartFDegpLength(const TSet set, const int length, LObject &p)
poly kNF1(ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce)
poly redtail(LObject *L, int end_pos, kStrategy strat)
int posInT17(const TSet set, const int length, LObject &p)
int posInT110Ring(const TSet set, const int length, LObject &p)
static void kOptimizeLDeg(pLDegProc ldeg, kStrategy strat)
int(* posInLOld)(const LSet Ls, const int Ll, LObject *Lo, const kStrategy strat)
void(* chainCrit)(poly p, int ecart, kStrategy strat)
KINLINE unsigned long * initsevT()
#define TEST_OPT_MULTBOUND
void updateResult(ideal r, ideal Q, kStrategy strat)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void khCheckLocInhom(ideal Q, intvec *w, intvec *hilb, int &count, kStrategy strat)
void superenterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
long totaldegreeWecart(poly p, ring r)
int posInT110(const TSet set, const int length, LObject &p)
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
static BOOLEAN length(leftv result, leftv arg)
#define __p_GetComp(p, r)
void updateS(BOOLEAN toT, kStrategy strat)
long pLDeg1c_Deg(poly p, int *l, const ring r)
ideal kInterRedOld(ideal F, ideal Q)
void p_wrp(poly p, ring lmRing, ring tailRing)
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
long pLDeg1c_WFirstTotalDegree(poly p, int *l, const ring r)
ideal bbaShift(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat, int uptodeg, int lV)
int posInT_EcartpLength(const TSet set, const int length, LObject &p)
void postReduceByMon(LObject *h, kStrategy strat)
used for GB over ZZ: intermediate reduction by monomial elements background: any known constant eleme...
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
int posInT_FDegpLength(const TSet set, const int length, LObject &p)
poly p_KillSquares(const poly p, const short iFirstAltVar, const short iLastAltVar, const ring r)
int posInT17_cRing(const TSet set, const int length, LObject &p)
static BOOLEAN kMoraUseBucket(kStrategy strat)
long pLDegb(poly p, int *l, const ring r)
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
BOOLEAN hasPurePower(const poly p, int last, int *length, kStrategy strat)
int posInT19(const TSet set, const int length, LObject &p)
BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int)
ideal mora(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static int rGetCurrSyzLimit(const ring r)
static unsigned pLength(poly a)
BOOLEAN newHEdge(kStrategy strat)
void chainCritOpt_1(poly, int, kStrategy strat)
long p_WFirstTotalDegree(poly p, const ring r)
static poly redMoraNF(poly h, kStrategy strat, int flag)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
int(* red2)(LObject *L, kStrategy strat)
void initEcartPairBba(LObject *Lp, poly, poly, int, int)
static short rVar(const ring r)
#define rVar(r) (r->N)
int posInLSpecial(const LSet set, const int length, LObject *p, const kStrategy)
static long p_MinComp(poly p, ring lmRing, ring tailRing)
#define TEST_OPT_INTSTRATEGY
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
int ksReducePoly(LObject *PR, TObject *PW, poly spNoether, number *coef, kStrategy strat)
void firstUpdate(kStrategy strat)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
poly kNF2Bound(ideal F, ideal Q, poly q, int bound, kStrategy strat, int lazyReduce)
int redRing(LObject *h, kStrategy strat)
char posInLDependsOnLength
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
void reorderT(kStrategy strat)
int posInT2(const TSet set, const int length, LObject &p)
#define TEST_OPT_NOT_BUCKETS
void initEcartNormal(TObject *h)
void PrintS(const char *s)
#define omFreeSize(addr, size)
long pLDeg1_WFirstTotalDegree(poly p, int *l, const ring r)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
void finalReduceByMon(kStrategy strat)
used for GB over ZZ: final reduction by constant elements background: any known constant element of i...
int redEcart(LObject *h, kStrategy strat)
int posInT_pLength(const TSet set, const int length, LObject &p)
static short scaFirstAltVar(ring r)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static BOOLEAN rField_is_Ring(const ring r)
long kModDeg(poly p, ring r)
int posInTrg0(const TSet set, const int length, LObject &p)
void completeReduce(kStrategy strat, BOOLEAN withT)
int posInL11Ringls(const LSet set, const int length, LObject *p, const kStrategy)
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
KINLINE poly kNoetherTail()
void exitBuchMora(kStrategy strat)
void enterSSba(LObject &p, int atS, kStrategy strat, int atR)
int redFirst(LObject *h, kStrategy strat)
pFDegProc pOrigFDeg_TailRing
int posInL17Ring(const LSet set, const int length, LObject *p, const kStrategy)
static void p_LmDelete(poly p, const ring r)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
int posInL10(const LSet set, const int length, LObject *p, const kStrategy strat)
int kFindDivisibleByInT(const kStrategy strat, const LObject *L, const int start)
return -1 if no divisor is found number of first divisor in T, otherwise
long pLDeg1c_Totaldegree(poly p, int *l, const ring r)
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
#define TEST_OPT_STAIRCASEBOUND
int posInL11Ring(const LSet set, const int length, LObject *p, const kStrategy)
BOOLEAN(* rewCrit1)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
pShallowCopyDeleteProc pGetShallowCopyDeleteProc(ring, ring)
long pLDeg1c(poly p, int *l, const ring r)
void initBuchMoraPos(kStrategy strat)
void updateT(kStrategy strat)
KINLINE BOOLEAN arriRewDummy(poly, unsigned long, poly, kStrategy, int)
void messageStat(int hilbcount, kStrategy strat)
int posInL15Ring(const LSet set, const int length, LObject *p, const kStrategy)
long p_WDegree(poly p, const ring r)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
#define TEST_OPT_RETURN_SB
void kDebugPrint(kStrategy strat)
static poly redMoraNFRing(poly h, kStrategy strat, int flag)
int posInT13(const TSet set, const int length, LObject &p)
int posInL13(const LSet set, const int length, LObject *p, const kStrategy)
int posInL110Ring(const LSet set, const int length, LObject *p, const kStrategy)
poly preIntegerCheck(const ideal Forig, const ideal Q)
used for GB over ZZ: look for constant and monomial elements in the ideal background: any known const...
pLDegProc pOrigLDeg_TailRing
BOOLEAN(* rewCrit2)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
int redSig(LObject *h, kStrategy strat)
void initBba(kStrategy strat)
int p_IsPurePower(const poly p, const ring r)
return i, if head depends only on var(i)
long p_Deg(poly a, const ring r)
int posInL11(const LSet set, const int length, LObject *p, const kStrategy)
int posInL17_cRing(const LSet set, const int length, LObject *p, const kStrategy)
static void p_Delete(poly *p, const ring r)
static BOOLEAN rField_is_numeric(const ring r)
int posInL17(const LSet set, const int length, LObject *p, const kStrategy)
long maxdegreeWecart(poly p, int *l, ring r)
int posInT15Ring(const TSet set, const int length, LObject &p)
BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly, kStrategy strat, int start=0)
KINLINE poly redtailBba(poly p, int pos, kStrategy strat, BOOLEAN normalize)
void initBuchMoraPosRing(kStrategy strat)
void chainCritNormal(poly p, int ecart, kStrategy strat)
static int si_max(const int a, const int b)
static CanonicalForm bound(const CFMatrix &M)
#define pSetmComp(p)
TODO:
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
void pSetDegProcs(ring r, pFDegProc new_FDeg, pLDegProc new_lDeg)
long pLDeg1_Deg(poly p, int *l, const ring r)
int posInL110(const LSet set, const int length, LObject *p, const kStrategy)
void(* initEcartPair)(LObject *h, poly f, poly g, int ecartF, int ecartG)
void Werror(const char *fmt,...)
static short scaLastAltVar(ring r)
ideal idInit(int idsize, int rank)
initialise an ideal / module
#define pp_Test(p, lmRing, tailRing)
static BOOLEAN idHomModule(ideal m, ideal Q, intvec **w)
void initMora(ideal F, kStrategy strat)
ideal id_KillSquares(const ideal id, const short iFirstAltVar, const short iLastAltVar, const ring r, const bool bSkipZeroes)
void WerrorS(const char *s)
static BOOLEAN rField_has_simple_inverse(const ring r)
void HEckeTest(poly pp, kStrategy strat)
static FORCE_INLINE BOOLEAN n_DivBy(number a, number b, const coeffs r)
test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z:...
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
ideal SCAQuotient(const ring r)
int posInT1(const TSet set, const int length, LObject &p)
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
int posInLrg0(const LSet set, const int length, LObject *p, const kStrategy)
long p_WTotaldegree(poly p, const ring r)
BOOLEAN(* rewCrit3)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
int redFirst(LObject *h, kStrategy strat)
int posInT11Ring(const TSet set, const int length, LObject &p)
char completeReduce_retry
int posInL15(const LSet set, const int length, LObject *p, const kStrategy)
static int doRed(LObject *h, TObject *with, BOOLEAN intoT, kStrategy strat, bool redMoraNF)
void cancelunit(LObject *L, BOOLEAN inNF)
#define TEST_OPT_REDTHROUGH
static long p_Totaldegree(poly p, const ring r)
int posInT17Ring(const TSet set, const int length, LObject &p)
void enterL(LSet *set, int *length, int *LSetmax, LObject p, int at)
int redLazy(LObject *h, kStrategy strat)
#define idSimpleAdd(A, B)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void(* initEcart)(TObject *L)
ideal bba(ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
static BOOLEAN rIsSyzIndexRing(const ring r)
ideal sba(ideal F0, ideal Q, intvec *w, intvec *hilb, kStrategy strat)
int(* red)(LObject *L, kStrategy strat)
long kHomModDeg(poly p, ring r)
void initEcartBBA(TObject *h)
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
#define pCopy(p)
return a copy of the poly
#define SI_RESTORE_OPT1(A)
int(* posInT)(const TSet T, const int tl, LObject &h)
int posInT15(const TSet set, const int length, LObject &p)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
int posInT0(const TSet, const int length, LObject &)
static void kDeleteLcm(LObject *P)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
void initEcartPairMora(LObject *Lp, poly, poly, int ecartF, int ecartG)
BOOLEAN rHasMixedOrdering(const ring r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
void enterOnePairNormal(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR=-1)
ideal kInterRed(ideal F, ideal Q)
static bool rIsSCA(const ring r)
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
KINLINE TObject ** initR()
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
int redHoney(LObject *h, kStrategy strat)
static FORCE_INLINE BOOLEAN n_IsUnit(number n, const coeffs r)
TRUE iff n has a multiplicative inverse in the given coeff field/ring r.
void missingAxis(int *last, kStrategy strat)
void enterT(LObject &p, kStrategy strat, int atT)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
int posInT11(const TSet set, const int length, LObject &p)
int redSigRing(LObject *h, kStrategy strat)
void(* enterOnePair)(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR)
int redHomog(LObject *h, kStrategy strat)
int scMult0Int(ideal S, ideal Q, const ring tailRing)
#define OPT_NOTREGULARITY
ideal kInterRedBba(ideal F, ideal Q, int &need_retry)
omError_t omTestMemory(int check_level)
void updateLHC(kStrategy strat)
void initS(ideal F, ideal Q, kStrategy strat)