47#define ENTER_USE_MEMMOVE
87#ifdef ENTER_USE_MYMEMMOVE
119 unsigned long _d = (
unsigned long) d;
120 unsigned long _s = (
unsigned long)
s;
128#define memmove(d,s,l) _my_memmove(d, s, l)
135#define pDivComp_EQUAL 2
136#define pDivComp_LESS 1
137#define pDivComp_GREATER -1
138#define pDivComp_INCOMP 0
151 unsigned long la,
lb;
152 unsigned long divmask =
currRing->divmask;
162 if (((
la & divmask) ^ (
lb & divmask)) != ((
lb -
la) & divmask))
169 if (((
la & divmask) ^ (
lb & divmask)) != ((
la -
lb) & divmask))
200 unsigned long la,
lb;
201 unsigned long divmask =
currRing->divmask;
211 if (((
la & divmask) ^ (
lb & divmask)) != ((
lb -
la) & divmask))
218 if (((
la & divmask) ^ (
lb & divmask)) != ((
la -
lb) & divmask))
225 if (
b) {
return -1; }
253 && (L->bucket !=
NULL))
255 for (
int i=1;
i<= (
int) L->bucket->buckets_used;
i++)
257 poly
p=L->bucket->buckets[
i];
262 L->bucket->buckets[
i]=
NULL;
263 L->bucket->buckets_length[
i]=0;
272 L->bucket->buckets_length[
i]=
pLength(L->bucket->buckets[
i]);
280 int i=L->bucket->buckets_used;
281 while ((
i>0)&&(L->bucket->buckets[
i]==
NULL))
284 L->bucket->buckets_used=
i;
299 poly
p = L->GetLmTailRing();
310 if (L->bucket !=
NULL)
342 L->ecart = L->pLDeg() - L->GetpFDeg();
352 L->ecart = L->pLDeg(strat->
LDegLast) - L->GetpFDeg();
377 ring r = L->tailRing;
378 poly
p = L->GetLmTailRing();
537 return (
unsigned long*)
omAlloc0(
maxnr*
sizeof(
unsigned long));
575 for (
j=0;
j<=strat->
tl;
j++)
579 if (strat->
T[
j].max_exp !=
NULL)
589 if (strat->
T[
j].t_p !=
NULL)
597 if (
currRing->isLPring && strat->
T[
j].shift > 0)
606 if (
p == strat->
S[
i])
608 if (strat->
T[
j].t_p !=
NULL)
610 if (p_shallow_copy_delete!=
NULL)
634 for (
j=0;
j<=strat->
tl;
j++)
638 if (strat->
T[
j].max_exp !=
NULL)
648 if (strat->
T[
j].t_p !=
NULL)
660 if (
p == strat->
S[
i])
662 if (strat->
T[
j].t_p !=
NULL)
709 if ((*
k) < 0)
return FALSE;
710 if (((p1 == (*p).p1) && (p2 == (*p).p2))
711 || ((p1 == (*p).p2) && (p2 == (*p).p1)))
724 if (
T[
i].
p ==
p)
return i;
735 if (
i >= 0)
return i;
738 while (strat !=
NULL);
763 if (
i >= 0)
return i;
766 while (strat !=
NULL);
780#define kFalseReturn(x) do { if (!x) return FALSE;} while (0)
786 for (
i=1;
i<=tailRing->N;
i++)
789 return "Lm[i] different";
792 return "Lm[0] different";
794 return "Lm.next different";
796 return "Lm.coeff different";
803 ring tailRing =
T->tailRing;
828 if (
T->t_p ==
NULL &&
i > 0)
845 if (
T->t_p !=
NULL &&
i >= 0 &&
TN ==
'T')
849 if (
T->max_exp !=
NULL)
850 return dReportError(
"%c[%d].max_exp is not NULL as it should be",
TN,
i);
854 if (
T->max_exp ==
NULL)
878 if (
T->p ==
NULL &&
i > 0)
894 if ((
i >= 0) && (
T->pLength != 0)
899 return dReportError(
"%c[%d] pLength error: has %d, specified to have %d",
904 if (
i >= 0 && (
TN ==
'T' ||
TN ==
'L'))
907 if (strat->
homog && (
T->FDeg !=
T->pFDeg()))
911 return dReportError(
"%c[%d] FDeg error: has %d, specified to have %d",
912 TN,
i ,
T->pFDeg(), d);
917 if (
i >= 0 &&
TN ==
'T')
954 if (L->bucket !=
NULL)
957 r_assume(L->bucket->bucket_ring == L->tailRing);
975 return dReportError(
"L[%d] wrong sev: has %lo, specified to have %lo",
1018 -1, strat->
T, strat->
tl));
1021 if (strat->
T !=
NULL)
1023 for (
i=0;
i<=strat->
tl;
i++)
1032 if (strat->
L !=
NULL)
1034 for (
i=0;
i<=strat->
Ll;
i++)
1037 strat->
L[
i].Next() != strat->
tail,
i,
1038 strat->
T, strat->
tl));
1049 if (strat->
S !=
NULL)
1059 for (
i=0;
i<=strat->
sl;
i++)
1061 if (strat->
S[
i] !=
NULL &&
1064 return dReportError(
"S[%d] wrong sev: has %o, specified to have %o",
1080 for (
i=0;
i<=strat->
tl;
i++)
1082 if (strat->
T[
i].i_r < 0 || strat->
T[
i].i_r > strat->
tl)
1083 return dReportError(
"strat->T[%d].i_r == %d out of bounds",
i,
1085 if (strat->
R[strat->
T[
i].i_r] != &(strat->
T[
i]))
1089 if ((strat->
S !=
NULL)&&(strat->
tl>=0))
1091 for (
i=0;
i<=strat->
sl;
i++)
1096 if (strat->
S_2_R[
i] != strat->
T[
j].i_r)
1102 #ifdef HAVE_SHIFTBBA
1107 for (
i=0;
i<=strat->
Ll;
i++)
1109 if (strat->
L[
i].p1 !=
NULL && strat->
L[
i].p2)
1111 if (strat->
L[
i].i_r1 < 0 ||
1112 strat->
L[
i].i_r1 > strat->
tl ||
1113 strat->
L[
i].T_1(strat)->p != strat->
L[
i].p1)
1115 if (strat->
L[
i].i_r2 < 0 ||
1116 strat->
L[
i].i_r2 > strat->
tl ||
1117 strat->
L[
i].T_2(strat)->p != strat->
L[
i].p2)
1122 if (strat->
L[
i].i_r1 != -1)
1124 if (strat->
L[
i].i_r2 != -1)
1127 if (strat->
L[
i].i_r != -1)
1141#ifdef ENTER_USE_MEMMOVE
1142 memmove(&(strat->
S[
i]), &(strat->
S[
i+1]), (strat->
sl -
i)*
sizeof(poly));
1148 for (
j=
i;
j<strat->
sl;
j++)
1150 strat->
S[
j] = strat->
S[
j+1];
1158#ifdef ENTER_USE_MEMMOVE
1166#ifdef ENTER_USE_MEMMOVE
1174#ifdef ENTER_USE_MEMMOVE
1177 for (
j=
i;
j<strat->
sl;
j++)
1191 && (strat->
P.p1!=
NULL))
1197 for (
int i=lv;
i>0;
i--)
1221 if (set[
j].sig!=
NULL)
1253 #ifdef HAVE_SHIFTBBA
1263#ifdef ENTER_USE_MEMMOVE
1267 for (
i=
j;
i < (*length);
i++)
1289#ifdef ENTER_USE_MEMMOVE
1306 h->FDeg =
h->pFDeg();
1307 h->ecart =
h->pLDeg() -
h->FDeg;
1314 h->FDeg =
h->pFDeg();
1321 Lp->FDeg =
Lp->pFDeg();
1328 Lp->FDeg =
Lp->pFDeg();
1375 h.ecart=0;
h.length=0;
1399 for(
j = strat->
Bl;
j>=0;
j--)
1520 h.i_r1 = -1;
h.i_r2 = -1;
1541 else strat->
P.sev=0L;
1555 poly m1, m2,
gcd,
si;
1584 for (
int j = 0;
j < strat->
sl;
j++)
1590 && !(strat->
sevS[
j] & ~sev)
1633 PrintS(
"\n--- create strong gcd poly: ");
1636 Print(
"\n strat->S[%d]: ",
i);
1659 h.i_r1 = -1;
h.i_r2 = -1;
1665 h.p1 =
p;
h.p2 = strat->
S[
i];
1685 if(
h.IsNull())
return FALSE;
1702 if(strat->
sl < 0)
return FALSE;
1704 for(
i=0;
i<strat->
sl;
i++)
1740 h->i_r1 = -1;
h->i_r2 = -1;
1762 poly m1, m2,
gcd,
si;
1810 PrintS(
"\n--- create strong gcd poly: ");
1813 Print(
"\n strat->S[%d]: ",
i);
1865 h.i_r1 = -1;
h.i_r2 = -1;
1883 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
1910 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
1923 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
1927 h.p1 =
p;
h.p2 = strat->
S[
i];
1966#ifndef HAVE_RATGRING
1968#elif defined(HAVE_RATGRING)
1985 if((!((strat->
ecartS[
i]>0)&&(ecart>0)))
2078 for(
j = strat->
Bl;
j>=0;
j--)
2177 Lp.p1 = strat->
S[
i];
2256 if((!((strat->
ecartS[
i]>0)&&(ecart>0)))
2352 for(
j = strat->
Bl;
j>=0;
j--)
2408 Lp.p1 = strat->
S[
i];
2466#ifndef HAVE_RATGRING
2468#elif defined(HAVE_RATGRING)
2498 PrintS(
"----------------\n");
2501 PrintS(
"----------------\n");
2507 Print(
"IN PAIR GENERATION - COMPARING SIGS: %d\n",
sigCmp);
2639 Lp.checked = strat->
sl+1;
2658 PrintS(
"SIGNATURE OF PAIR: ");
2662 Lp.p1 = strat->
S[
i];
2741#ifndef HAVE_RATGRING
2743#elif defined(HAVE_RATGRING)
2786 Print(
"----------------\n");
2789 Print(
"----------------\n");
2814 Print(
"IN PAIR GENERATION - COMPARING SIGS: %d\n",
sigCmp);
2846 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
3018 Lp.checked = strat->
sl+1;
3037 PrintS(
"SIGNATURE OF PAIR: ");
3041 Lp.p1 = strat->
S[
i];
3088 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
3143 Lp.p1 = strat->
S[
i];
3176 int j=strat->
Ll+strat->
Bl+1;
3184 for (
i=strat->
Bl;
i>=0;
i--)
3186 j = strat->
posInL(strat->
L,
j,&(strat->
B[
i]),strat);
3197 int j=strat->
Ll+strat->
Bl+1;
3205 for (
i=strat->
Bl;
i>=0;
i--)
3232 for (
j=0;
j<=strat->
sl;
j++)
3236 for (
i=strat->
Bl;
i>=0;
i--)
3251 for (
j=0;
j<=strat->
sl;
j++)
3255 for (
i=strat->
Bl;
i>=0;
i--)
3278 for (
j=strat->
Ll;
j>=0;
j--)
3284 if (strat->
L[
j].p == strat->
tail)
3330 for (
j=strat->
Ll;
j>=0;
j--)
3350 for(
i=
j-1;
i>=0;
i--)
3369 for (
j=strat->
Ll;
j>=0;
j--)
3371 #ifdef HAVE_SHIFTBBA
3372 if ((strat->
L[
j].p1!=
NULL) &&
3405 if (strat->
L[0].p2 == strat->
tail) strat->
L[0].p2 =
p;
3408 if (strat->
L[
j].p2 ==
p)
3414 if ((strat->
L[
i].p2 ==
p) &&
pLmEqual(strat->
L[
j].lcm,strat->
L[
i].lcm))
3428 strat->
L[
i].p2 = strat->
tail;
3445 else if (strat->
L[
j].p2 == strat->
tail)
3484 if (strat->
L[0].p2 == strat->
tail) strat->
L[0].p2 =
p;
3487 if (strat->
L[
j].p2 ==
p)
3493 if ((strat->
L[
i].p2 ==
p) &&
pLmEqual(strat->
L[
j].lcm,strat->
L[
i].lcm))
3507 strat->
L[
i].p2 = strat->
tail;
3524 else if (strat->
L[
j].p2 == strat->
tail)
3545 for (
j=0;
j<=strat->
sl;
j++)
3549 for (
i=strat->
Bl;
i>=0;
i--)
3557 Print(
"chain-crit-part: S[%d]=",
j);
3559 Print(
" divide B[%d].lcm=",
i);
3581 for (
j=strat->
Ll;
j>=0;
j--)
3587 if (strat->
L[
j].p == strat->
tail)
3591 PrintS(
"chain-crit-part: pCompareChainPart p=");
3593 Print(
" delete L[%d]",
j);
3622 Print(
"chain-crit-part: sugar B[%d].lcm=",
j);
3624 Print(
" delete B[%d]",
i);
3635 Print(
"chain-crit-part: sugar B[%d].lcm=",
i);
3637 Print(
" delete B[%d]",
j);
3657 for (
j=strat->
Ll;
j>=0;
j--)
3665 PrintS(
"chain-crit-part: sugar:pCompareChainPart p=");
3667 Print(
" delete L[%d]",
j);
3685 for(
i=
j-1;
i>=0;
i--)
3691 Print(
"chain-crit-part: equal lcm B[%d].lcm=",
j);
3693 Print(
" delete B[%d]\n",
i);
3710 for (
j=strat->
Ll;
j>=0;
j--)
3718 PrintS(
"chain-crit-part: pCompareChainPart p=");
3720 Print(
" delete L[%d]",
j);
3749 if (strat->
L[0].p2 == strat->
tail) strat->
L[0].p2 =
p;
3752 if (strat->
L[
j].p2 ==
p)
3758 if ((strat->
L[
i].p2 ==
p) &&
pLmEqual(strat->
L[
j].lcm,strat->
L[
i].lcm))
3775 strat->
L[
i].p2 = strat->
tail;
3782 PrintS(
"chain-crit-part: divisible_by p=");
3784 Print(
" delete L[%d]",
l);
3795 PrintS(
"chain-crit-part: divisible_by(2) p=");
3797 Print(
" delete L[%d]",
i);
3808 else if (strat->
L[
j].p2 == strat->
tail)
3836 for (
j=0;
j<=
k;
j++)
3849 for (
j=0;
j<=
k;
j++)
3858 for (
j=0;
j<=
k;
j++)
3871 #ifdef HAVE_RATGRING
3901 for (
j=0;
j<=
k;
j++)
3914 for (
j=0;
j<=
k;
j++)
3923 for (
j=0;
j<=
k;
j++)
4021 for (
j=0;
j<=strat->
sl;
j++)
4025 for (
i=strat->
Bl;
i>=0;
i--)
4032 PrintS(
"--- chain criterion func chainCritRing type 1\n");
4035 PrintS(
" strat->B[i].lcm:");
4040 wrp(strat->
B[
i].lcm);
4055 for (
j=strat->
Ll;
j>=0;
j--)
4068 PrintS(
"--- chain criterion func chainCritRing type 2\n");
4069 PrintS(
"strat->L[j].p:");
4100 if (strat->
L[0].p2 == strat->
tail) strat->
L[0].p2 =
p;
4103 if (strat->
L[
j].p2 ==
p)
4118 PrintS(
"--- chain criterion func chainCritRing type 3\n");
4119 PrintS(
"strat->L[j].lcm:");
4120 wrp(strat->
L[
j].lcm);
4121 PrintS(
" strat->L[i].lcm:");
4122 wrp(strat->
L[
i].lcm);
4136 strat->
L[
i].p2 = strat->
tail;
4153 else if (strat->
L[
j].p2 == strat->
tail)
4179 for (
j=0;
j<=
k;
j++)
4191 for (
j=0;
j<=
k;
j++)
4199 for (
j=0;
j<=
k;
j++)
4211 #ifdef HAVE_RATGRING
4283 PrintS(
"--- create zero spoly: ");
4367 PrintS(
"--- create zero spoly: ");
4404 strat->
enterS(strat->
P,strat->
sl+1,strat, strat->
tl+1);
4455 if ( (!strat->
fromT)
4515 if ( (!strat->
fromT)
4540 if ( (!strat->
fromT)
4565 for (
j=0;
j<=
k;
j++)
4579 for (
j=0;
j<=
k;
j++)
4642 for (;
i<=strat->
sl;
i++)
4650 sev = strat->
sevS[
i];
4655 strat->
S[
j] = strat->
S[
j-1];
4802 || ((op == o) && (
pLtCmp(set[mon],
p) == -1)))
4813 || ((op == o) && (
pLtCmp(set[
an],
p) == -1)))
4820 || ((op == o) && (
pLtCmp(set[
i],
p) == -1)))
4846 || ((op == o) && (
pLtCmp(set[
an],
p) == -1)))
4853 || ((op == o) && (
pLtCmp(set[
i],
p) == -1)))
4867 if (end<0)
return 0;
4874 for(
i=start;
i<end;
i++)
4888 || ((op == o) && (
pLtCmp(set[
an],
p) == -1)))
4895 || ((op == o) && (
pLtCmp(set[
i],
p) == -1)))
4920 if (
length==-1)
return 0;
4949 if (
length==-1)
return 0;
4977 if (
length==-1)
return 0;
4979 int o =
p.GetpFDeg();
4980 int op = set[
length].GetpFDeg();
4995 op= set[
an].GetpFDeg();
5002 op = set[
i].GetpFDeg();
5014 if (
length==-1)
return 0;
5016 int o =
p.GetpFDeg();
5017 int op = set[
length].GetpFDeg();
5031 op= set[
an].GetpFDeg();
5038 op = set[
i].GetpFDeg();
5055 if (
length==-1)
return 0;
5058 int o =
p.GetpFDeg();
5059 int op = set[
length].GetpFDeg();
5075 op = set[
an].GetpFDeg();
5078 || (( op == o) && (set[
an].length ==
p.
length)
5084 op = set[
i].GetpFDeg();
5087 || (( op == o) && (set[
i].length ==
p.
length)
5098 if (
length==-1)
return 0;
5101 int o =
p.GetpFDeg();
5102 int op = set[
length].GetpFDeg();
5117 op = set[
an].GetpFDeg();
5120 || (( op == o) && (set[
an].length ==
p.
length)
5126 op = set[
i].GetpFDeg();
5129 || (( op == o) && (set[
i].length ==
p.
length)
5145 if (
length==-1)
return 0;
5147 int o =
p.GetpFDeg();
5149 if (set[
length].GetpFDeg() <= o)
5159 if (set[
an].GetpFDeg() > o)
5164 if (set[
i].GetpFDeg() > o)
5174 if (
length==-1)
return 0;
5175 int ol =
p.GetpLength();
5189 int oo=set[
an].ecart;
5196 int oo=set[
i].ecart;
5230 if (
length==-1)
return 0;
5232 int o =
p.GetpFDeg() +
p.ecart;
5248 op = set[
an].GetpFDeg()+set[
an].ecart;
5255 op = set[
i].GetpFDeg()+set[
i].ecart;
5267 if (
length==-1)
return 0;
5269 int o =
p.GetpFDeg() +
p.ecart;
5284 op = set[
an].GetpFDeg()+set[
an].ecart;
5291 op = set[
i].GetpFDeg()+set[
i].ecart;
5328 if (
length==-1)
return 0;
5330 int o =
p.GetpFDeg() +
p.ecart;
5335 || (( op == o) && (set[
length].ecart >
p.ecart))
5336 || (( op == o) && (set[
length].ecart==
p.ecart)
5347 op = set[
an].GetpFDeg()+set[
an].ecart;
5349 || (( op == o) && (set[
an].ecart <
p.ecart))
5350 || (( op == o) && (set[
an].ecart==
p.ecart)
5356 op = set[
i].GetpFDeg()+set[
i].ecart;
5358 || (( op == o) && (set[
i].ecart <
p.ecart))
5359 || (( op == o) && (set[
i].ecart ==
p.ecart)
5370 if (
length==-1)
return 0;
5372 int o =
p.GetpFDeg() +
p.ecart;
5376 || (( op == o) && (set[
length].ecart >
p.ecart))
5377 || (( op == o) && (set[
length].ecart==
p.ecart)
5388 op = set[
an].GetpFDeg()+set[
an].ecart;
5390 || (( op == o) && (set[
an].ecart <
p.ecart))
5391 || (( op == o) && (set[
an].ecart==
p.ecart)
5397 op = set[
i].GetpFDeg()+set[
i].ecart;
5399 || (( op == o) && (set[
i].ecart <
p.ecart))
5400 || (( op == o) && (set[
i].ecart ==
p.ecart)
5416 if (
length==-1)
return 0;
5420 int o =
p.GetpFDeg() +
p.ecart;
5430 || ((op == o) && (set[
length].ecart >
p.ecart))
5431 || ((op == o) && (set[
length].ecart==
p.ecart)
5447 int op = set[
an].GetpFDeg()+set[
an].ecart;
5449 || ((op == o) && (set[
an].ecart <
p.ecart))
5450 || ((op == o) && (set[
an].ecart==
p.ecart)
5461 int op = set[
i].GetpFDeg()+set[
i].ecart;
5463 || ((op == o) && (set[
i].ecart <
p.ecart))
5464 || ((op == o) && (set[
i].ecart ==
p.ecart)
5478 if (
length==-1)
return 0;
5482 int o =
p.GetpFDeg() +
p.ecart;
5491 || ((op == o) && (set[
length].ecart >
p.ecart))
5492 || ((op == o) && (set[
length].ecart==
p.ecart)
5508 int op = set[
an].GetpFDeg()+set[
an].ecart;
5510 || ((op == o) && (set[
an].ecart <
p.ecart))
5511 || ((op == o) && (set[
an].ecart==
p.ecart)
5522 int op = set[
i].GetpFDeg()+set[
i].ecart;
5524 || ((op == o) && (set[
i].ecart <
p.ecart))
5525 || ((op == o) && (set[
i].ecart ==
p.ecart)
5545 if (
length==-1)
return 0;
5548 int op=
p.GetpFDeg();
5550 if (set[
length].ecart < o)
5552 if (set[
length].ecart == o)
5566 if (set[
an].ecart > o)
5568 if (set[
an].ecart == o)
5570 int oo=set[
an].GetpFDeg();
5578 if (set[
i].ecart > o)
5580 else if (set[
i].ecart == o)
5582 int oo=set[
i].GetpFDeg();
5604 int d=
p->GetpFDeg();
5605 int op=set[
length].GetpFDeg();
5620 op=set[
an].GetpFDeg();
5622 || ((op == d) && (
p->p1!=
NULL) && (set[
an].p1==
NULL))
5628 op=set[
i].GetpFDeg();
5630 || ((op==d) && (
p->p1!=
NULL) && (set[
i].p1==
NULL))
5753 if (set[
an].FDeg >
p->FDeg)
5757 if (set[
an].FDeg ==
p->FDeg)
5775 if (set[
i].FDeg >
p->FDeg)
5779 if (set[
i].FDeg ==
p->FDeg)
5794 if (strat->
syzl==0)
return 0;
5838 int o =
p->GetpFDeg();
5839 int op = set[
length].GetpFDeg();
5852 op = set[
an].GetpFDeg();
5859 op = set[
i].GetpFDeg();
5881 int o =
p->GetpFDeg();
5882 int op = set[
length].GetpFDeg();
5894 op = set[
an].GetpFDeg();
5901 op = set[
i].GetpFDeg();
5915 int o =
p->GetpFDeg();
5916 int op = set[
length].GetpFDeg();
5928 op = set[
an].GetpFDeg();
5935 op = set[
i].GetpFDeg();
5949 if (
length < 0)
return 0;
5959 if (set[
an].FDeg >
p->FDeg)
5963 if (set[
an].FDeg ==
p->FDeg)
5993 if (set[
i].FDeg >
p->FDeg)
5997 if (set[
i].FDeg ==
p->FDeg)
6005 if (set[
i].t_p!=
NULL)
6037 if (coeff == 0)
return -1;
6040 while (
tmp % 2 == 0)
6098 int o =
p->GetpFDeg();
6099 int op = set[
length].GetpFDeg();
6114 op = set[
an].GetpFDeg();
6117 || ((op == o) && (set[
an].length <=
p->
length)
6123 op = set[
i].GetpFDeg();
6126 || ((op == o) && (set[
i].length <=
p->
length)
6140 int o =
p->GetpFDeg();
6141 int op = set[
length].GetpFDeg();
6155 op = set[
an].GetpFDeg();
6158 || ((op == o) && (set[
an].length <=
p->
length)
6164 op = set[
i].GetpFDeg();
6167 || ((op == o) && (set[
i].length <=
p->
length)
6187 int o =
p->GetpFDeg();
6189 if (set[
length].GetpFDeg() > o)
6199 if (set[
an].GetpFDeg() >= o)
6204 if (set[
i].GetpFDeg() >= o)
6222 int o =
p->GetpFDeg() +
p->ecart;
6236 op = set[
an].GetpFDeg() + set[
an].ecart;
6243 op = set[
i].GetpFDeg() + set[
i].ecart;
6258 int o =
p->GetpFDeg() +
p->ecart;
6271 op = set[
an].GetpFDeg() + set[
an].ecart;
6278 op = set[
i].GetpFDeg() + set[
i].ecart;
6299 int o =
p->GetpFDeg() +
p->ecart;
6304 && (set[
length].ecart >
p->ecart))
6306 && (set[
length].ecart ==
p->ecart)
6316 if ((set[
an].GetpFDeg() + set[
an].ecart > o)
6317 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6318 && (set[
an].ecart >
p->ecart))
6319 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6320 && (set[
an].ecart ==
p->ecart)
6326 if ((set[
i].GetpFDeg() + set[
i].ecart > o)
6327 || ((set[
i].GetpFDeg() + set[
i].ecart == o)
6328 && (set[
i].ecart >
p->ecart))
6329 || ((set[
i].GetpFDeg() +set[
i].ecart == o)
6330 && (set[
i].ecart ==
p->ecart)
6344 int o =
p->GetpFDeg() +
p->ecart;
6348 && (set[
length].ecart >
p->ecart))
6350 && (set[
length].ecart ==
p->ecart)
6360 if ((set[
an].GetpFDeg() + set[
an].ecart > o)
6361 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6362 && (set[
an].ecart >
p->ecart))
6363 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6364 && (set[
an].ecart ==
p->ecart)
6370 if ((set[
i].GetpFDeg() + set[
i].ecart > o)
6371 || ((set[
i].GetpFDeg() + set[
i].ecart == o)
6372 && (set[
i].ecart >
p->ecart))
6373 || ((set[
i].GetpFDeg() +set[
i].ecart == o)
6374 && (set[
i].ecart ==
p->ecart)
6397 int o =
p->GetpFDeg() +
p->ecart;
6406 && (set[
length].ecart >
p->ecart))
6408 && (set[
length].ecart ==
p->ecart)
6423 if ((set[
an].GetpFDeg() + set[
an].ecart > o)
6424 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6425 && (set[
an].ecart >
p->ecart))
6426 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6427 && (set[
an].ecart ==
p->ecart)
6438 if ((set[
i].GetpFDeg() + set[
i].ecart > o)
6439 || ((set[
i].GetpFDeg() + set[
i].ecart == o)
6440 && (set[
i].ecart >
p->ecart))
6441 || ((set[
i].GetpFDeg() +set[
i].ecart == o)
6442 && (set[
i].ecart ==
p->ecart)
6462 int o =
p->GetpFDeg() +
p->ecart;
6470 && (set[
length].ecart >
p->ecart))
6472 && (set[
length].ecart ==
p->ecart)
6487 if ((set[
an].GetpFDeg() + set[
an].ecart > o)
6488 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6489 && (set[
an].ecart >
p->ecart))
6490 || ((set[
an].GetpFDeg() + set[
an].ecart == o)
6491 && (set[
an].ecart ==
p->ecart)
6502 if ((set[
i].GetpFDeg() + set[
i].ecart > o)
6503 || ((set[
i].GetpFDeg() + set[
i].ecart == o)
6504 && (set[
i].ecart >
p->ecart))
6505 || ((set[
i].GetpFDeg() +set[
i].ecart == o)
6506 && (set[
i].ecart ==
p->ecart)
6525 PrintS(
"syzygy criterion checks: ");
6528 for (
int k=0;
k<strat->
syzl;
k++)
6533 Print(
"checking with: %d / %d -- \n",
k,strat->
syzl);
6562 PrintS(
"--- syzygy criterion checks: ");
6587 Print(
"checking with: %d -- ",
k);
6612 PrintS(
"rewritten criterion checks: ");
6615 for(
int k = strat->
sl;
k>=start;
k--)
6619 PrintS(
"checking with: ");
6635 PrintS(
"ALL ELEMENTS OF S\n----------------------------------------\n");
6636 for(
int kk = 0;
kk<strat->
sl+1;
kk++)
6640 PrintS(
"------------------------------\n");
6670 for (
int ii=strat->
sl;
ii>start;
ii--)
6676 if (!(
pLmCmp(p1,p2) == 1))
6695 for (
int i=strat->
Bl;
i>-1;
i--)
6716 for (
int ii=strat->
sl;
ii>-1;
ii--)
6722 if (!(
pLmCmp(p1,p2) == 1))
6743 const unsigned long not_sev = ~L->sev;
6744 const unsigned long* sev = strat->
sevS;
6758 #if defined(PDEBUG) || defined(PDIV_DEBUG)
6778 #if defined(PDEBUG) || defined(PDIV_DEBUG)
6797 if (strat->
tl < 0 || strat->
S_2_R[
j] == -1)
6820 #if defined(PDEBUG) || defined(PDIV_DEBUG)
6834 assume(t !=
NULL && t->t_p !=
NULL && t->tailRing == r && t->p == strat->
S[
j]);
6852 #if defined(PDEBUG) || defined(PDIV_DEBUG)
6867 assume(t !=
NULL && t->t_p !=
NULL && t->tailRing == r && t->p == strat->
S[
j]);
6964 p =
h = L->GetLmTailRing();
6966 return L->GetLmCurrRing();
7001 Ln.SetShortExpVector();
7044 }
while (!
Ln.IsNull());
7069 return L->GetLmCurrRing();
7077 p =
h = L->GetLmTailRing();
7079 return L->GetLmCurrRing();
7086 Ln.pLength = L->GetpLength() - 1;
7110 Ln.SetShortExpVector();
7151 }
while (!
Ln.IsNull());
7184 return L->GetLmCurrRing();
7194 p =
h = L->GetLmTailRing();
7229 Ln.SetShortExpVector();
7263 }
while (!
Ln.IsNull());
7292 }
while (!
Ln.IsNull());
7323 p =
h = L->GetLmTailRing();
7325 return L->GetLmCurrRing();
7332 Ln.pLength = L->GetpLength() - 1;
7345 Ln.SetShortExpVector();
7357 poly
p_Ln=
Ln.GetLmCurrRing();
7371 }
while (!
Ln.IsNull());
7395 return L->GetLmCurrRing();
7429 p =
h = L->GetLmTailRing();
7431 return L->GetLmCurrRing();
7438 Ln.pLength = L->GetpLength() - 1;
7451 Ln.SetShortExpVector();
7463 poly
p_Ln=
Ln.GetLmCurrRing();
7480 }
while (!
Ln.IsNull());
7505 return L->GetLmCurrRing();
7541 if (strat->
Ll != *
reduc && strat->
Ll > 0)
7558 Print(
"product criterion:%d chain criterion:%d\n",strat->
cp,strat->
c3);
7560 #ifdef HAVE_SHIFTBBA
7562 if (strat->
cv!=0)
Print(
"shift V criterion:%d\n",strat->
cv);
7574 #ifdef HAVE_SHIFTBBA
7576 if (strat->
cv!=0)
Print(
"shift V criterion:%d\n",strat->
cv);
7591 for (
i=0;
i<=strat->
sl;
i++)
7603 for (
i=0;
i<=strat->
tl;
i++)
7608 Print(
" o:%ld e:%d l:%d",
7609 strat->
T[
i].pFDeg(),strat->
T[
i].ecart,strat->
T[
i].
length);
7614 for (
i=strat->
Ll;
i>=0;
i--)
7623 Print(
" o:%ld e:%d l:%d",
7624 strat->
L[
i].pFDeg(),strat->
L[
i].ecart,strat->
L[
i].
length);
7647 strat->
S=strat->
Shdl->m;
7681 strat->
enterS(
h,pos,strat,-1);
7682 strat->
fromQ[pos]=1;
7715 strat->
enterS(
h,pos,strat,-1);
7745 strat->
S=strat->
Shdl->m;
7779 strat->
enterS(
h,pos,strat,-1);
7780 strat->
fromQ[pos]=1;
7812 pos = strat->
posInL(strat->
L,strat->
Ll,&
h,strat);
7846 strat->
S = strat->
Shdl->m;
7888 strat->
enterS(
h,pos,strat,-1);
7889 strat->
fromQ[pos]=1;
7999 for(
i=1;
i<=strat->
sl;
i++)
8015#if defined(DEBUGF5) || defined(DEBUGF51)
8016 PrintS(
"------------- GENERATING SYZ RULES NEW ---------------\n");
8053 for (
k = 0;
k<
i;
k++)
8097 for (
k = 0;
k<strat->
sl+1;
k++)
8118 PrintS(
"Principal syzygies:\n");
8122 PrintS(
"--------------------------------\n");
8132 PrintS(
"--------------------------------\n");
8156 strat->
S=strat->
Shdl->m;
8191 strat->
enterS(
h,pos,strat, strat->
tl+1);
8193 strat->
fromQ[pos]=1;
8221 strat->
enterS(
h,pos,strat, strat->
tl+1);
8263 h.is_normalized = 0;
8270 strat->
enterS(
h,pos,strat, strat->
tl+1);
8304 strat->
S=strat->
Shdl->m;
8339 strat->
enterS(
h,pos,strat, strat->
tl+1);
8341 strat->
fromQ[pos]=1;
8369 strat->
enterS(
h,pos,strat, strat->
tl+1);
8411 h.is_normalized = 0;
8418 strat->
enterS(
h,pos,strat, strat->
tl+1);
8459 if (!
pIsVector((*p).p) && ((*p).ecart != 0))
8704 for (
i=0;
i<=strat->
sl;
i++)
8796 else {
suc=-1;
break; }
8807 for (
i=0;
i<=strat->
sl;
i++)
8855 *
sizeof(
unsigned long));
8882 strat->
Shdl->m=strat->
S;
8886#ifdef ENTER_USE_MEMMOVE
8888 (strat->
sl -
atS + 1)*
sizeof(poly));
8890 (strat->
sl -
atS + 1)*
sizeof(
int));
8892 (strat->
sl -
atS + 1)*
sizeof(
unsigned long));
8894 (strat->
sl -
atS + 1)*
sizeof(
int));
8897 (strat->
sl -
atS + 1)*
sizeof(
int));
8904 strat->
S[
i] = strat->
S[
i-1];
8919#ifdef ENTER_USE_MEMMOVE
8921 (strat->
sl -
atS + 1)*
sizeof(
int));
8978 *
sizeof(
unsigned long));
8982 *
sizeof(
unsigned long));
9010 strat->
Shdl->m=strat->
S;
9019#ifdef ENTER_USE_MEMMOVE
9021 (strat->
sl -
atS + 1)*
sizeof(poly));
9023 (strat->
sl -
atS + 1)*
sizeof(poly));
9025 (strat->
sl -
atS + 1)*
sizeof(
unsigned long));
9027 (strat->
sl -
atS + 1)*
sizeof(
int));
9029 (strat->
sl -
atS + 1)*
sizeof(
unsigned long));
9031 (strat->
sl -
atS + 1)*
sizeof(
int));
9034 (strat->
sl -
atS + 1)*
sizeof(
int));
9041 strat->
S[
i] = strat->
S[
i-1];
9058#ifdef ENTER_USE_MEMMOVE
9060 (strat->
sl -
atS + 1)*
sizeof(
int));
9071 strat->
S[
atS] =
p.p;
9095 Print(
"--- LIST S: %d ---\n",strat->
sl);
9096 for(
k=0;
k<=strat->
sl;
k++)
9100 PrintS(
"--- LIST S END ---\n");
9126 else strat->
P.sev=0;
9134 poly
tp = strat->
T[
tj].p;
9139 for (
j = 0;
j <= strat->
sl; ++
j)
9153 pos =
posInS(strat, strat->
sl,
p.p,
p.ecart);
9159 for (
i = 0;
i <= strat->
Ll; ++
i)
9183 strat->
enterS(
p, pos, strat, strat->
tl);
9222 for(
i=strat->
tl;
i>=0;
i--)
9224 if (
p.p==strat->
T[
i].p)
9226 printf(
"already in T at pos %d of %d, atT=%d\n",
i,strat->
tl,
atT);
9232#ifdef HAVE_TAIL_RING
9235 p.t_p=
p.GetLmTailRing();
9241 if (strat->
tl == strat->
tmax-1)
9245#ifdef ENTER_USE_MEMMOVE
9249 (strat->
tl-
atT+1)*
sizeof(
unsigned long));
9253#ifndef ENTER_USE_MEMMOVE
9254 strat->
T[
i] = strat->
T[
i-1];
9257 strat->
R[strat->
T[
i].i_r] = &(strat->
T[
i]);
9265 if (!(
currRing->isLPring &&
p.shift > 0))
9284 strat->
R[strat->
tl] = &(strat->
T[
atT]);
9285 strat->
T[
atT].i_r = strat->
tl;
9310 for(
i=strat->
tl;
i>=0;
i--)
9312 if (
p.p==strat->
T[
i].p)
9314 printf(
"already in T at pos %d of %d, atT=%d\n",
i,strat->
tl,
atT);
9320#ifdef HAVE_TAIL_RING
9323 p.t_p=
p.GetLmTailRing();
9329 if (strat->
tl == strat->
tmax-1)
9333#ifdef ENTER_USE_MEMMOVE
9337 (strat->
tl-
atT+1)*
sizeof(
unsigned long));
9341#ifndef ENTER_USE_MEMMOVE
9342 strat->
T[
i] = strat->
T[
i-1];
9345 strat->
R[strat->
T[
i].i_r] = &(strat->
T[
i]);
9366 strat->
R[strat->
tl] = &(strat->
T[
atT]);
9367 strat->
T[
atT].i_r = strat->
tl;
9374 for(
i=strat->
tl;
i>=0;
i--)
9407 *
sizeof(
unsigned long));
9412#ifdef ENTER_USE_MEMMOVE
9414 (strat->
syzl-
atT+1)*
sizeof(poly));
9416 (strat->
syzl-
atT+1)*
sizeof(
unsigned long));
9420#ifndef ENTER_USE_MEMMOVE
9461 PrintS(
"--- Syzygies ---\n");
9464 PrintS(
"--------------------------------\n");
9470 PrintS(
"--------------------------------\n");
9552 if (strat->
homog)
PrintS(
"ideal/module is homogeneous\n");
9553 else PrintS(
"ideal/module is not homogeneous\n");
9623 if (strat->
homog)
PrintS(
"ideal/module is homogeneous\n");
9624 else PrintS(
"ideal/module is not homogeneous\n");
10163 if ((r->m[
l]!=
NULL)
10170 if ((
Q->m[q]!=
NULL)
10194 if ((r->m[
l]!=
NULL)
10201 if ((
Q->m[q]!=
NULL)
10404 Print(
"to (tailR) S[%d]:",
i);
10419 T_j->pCleardenom();
10459 Print(
"to (-tailR) S[%d]:",
i);
10556 assume(L->i_r1 >= -1 && L->i_r1 <= strat->
tl);
10557 assume(L->i_r2 >= -1 && L->i_r2 <= strat->
tl);
10562 if ((L->i_r1 == -1) || (L->i_r2 == -1) )
10567 if ((L->i_r1>=0)&&(strat->
R[L->i_r1]!=
NULL))
p1_max = (strat->
R[L->i_r1])->max_exp;
10569 if ((L->i_r2>=0)&&(strat->
R[L->i_r2]!=
NULL))
p2_max = (strat->
R[L->i_r2])->max_exp;
10784 poly
pH =
h->GetP();
10788 for(
int i = 0;
i<=strat->
sl;
i++)
10851 h->SetLmCurrRing();
10860 poly
hSig =
h->sig;
10861 poly
pH =
h->GetP();
10865 for(
int i = 0;
i<=strat->
sl;
i++)
10934 h->SetLmCurrRing();
11075 for (
i=0;
i<=strat->
tl;
i++)
11078 p_shallow_copy_delete);
11080 for (
i=0;
i<=strat->
Ll;
i++)
11084 strat->
L[
i].ShallowCopyDelete(
new_tailRing, p_shallow_copy_delete);
11086 if ((strat->
P.t_p !=
NULL) ||
11088 strat->
P.ShallowCopyDelete(
new_tailRing, p_shallow_copy_delete);
11093 L->ShallowCopyDelete(
new_tailRing, p_shallow_copy_delete);
11102 L->max_exp =
t_l->max_exp;
11133 unsigned long l = 0;
11139 for (
i=0;
i<= strat->
Ll;
i++)
11143 for (
i=0;
i<=strat->
tl;
i++)
11173 int **wvhdl = (
int **)
omAlloc0((n+1)*
sizeof(
int*));
11174 res->wvhdl = wvhdl;
11175 for (
int i=1;
i<n;
i++)
11177 res->order[
i] = r->order[
i-1];
11178 res->block0[
i] = r->block0[
i-1];
11179 res->block1[
i] = r->block1[
i-1];
11180 res->wvhdl[
i] = r->wvhdl[
i-1];
11200 WarnS(
"error in nc_rComplete");
11221 int **wvhdl = (
int **)
omAlloc0((n+2)*
sizeof(
int*));
11222 res->wvhdl = wvhdl;
11223 for (
int i=2;
i<n+2;
i++)
11225 res->order[
i] = r->order[
i-2];
11226 res->block0[
i] = r->block0[
i-2];
11227 res->block1[
i] = r->block1[
i-2];
11228 res->wvhdl[
i] = r->wvhdl[
i-2];
11233 res->block0[0] = 1;
11235 for (
int i=0;
i<
res->N; ++
i)
11236 res->wvhdl[0][
i] = 1;
11256 WarnS(
"error in nc_rComplete");
11393#ifdef HAVE_TAIL_BIN
11420Gonnet 43.26 42.30 38.34 41.98 38.40 100.04
11422Twomat3 1.62 1.69 1.70 1.65 1.54 11.32
11423ahml 4.48 4.03 4.03 4.38 4.96 26.50
11424c7 15.02 13.98 15.16 13.24 17.31 47.89
11425c8 505.09 407.46 852.76 413.21 499.19 n/a
11426f855 12.65 9.27 14.97 8.78 14.23 33.12
11427gametwo6 11.47 11.35 14.57 11.20 12.02 35.07
11429ilias13 22.89 22.46 24.62 20.60 23.34 53.86
11430noon8 40.68 37.02 37.99 36.82 35.59 877.16
11431rcyclic_19 48.22 42.29 43.99 45.35 51.51 204.29
11432rkat9 82.37 79.46 77.20 77.63 82.54 267.92
11433schwarz_11 16.46 16.81 16.76 16.81 16.72 35.56
11434test016 16.39 14.17 14.40 13.50 14.26 34.07
11435test017 34.70 36.01 33.16 35.48 32.75 71.45
11436test042 10.76 10.99 10.27 11.57 10.45 23.04
11437test058 6.78 6.75 6.51 6.95 6.22 9.47
11438test066 10.71 10.94 10.76 10.61 10.56 19.06
11439test073 10.75 11.11 10.17 10.79 8.63 58.10
11440test086 12.23 11.81 12.88 12.24 13.37 66.68
11441test103 5.05 4.80 5.47 4.64 4.89 11.90
11442test154 12.96 11.64 13.51 12.46 14.61 36.35
11443test162 65.27 64.01 67.35 59.79 67.54 196.46
11444test164 7.50 6.50 7.68 6.70 7.96 17.13
11445virasoro 3.39 3.50 3.35 3.47 3.70 7.66
11455 if (
length==-1)
return 0;
11458 int op=
p.GetpFDeg();
11459 int ol =
p.GetpLength();
11461 if (set[
length].ecart < o)
11463 if (set[
length].ecart == o)
11477 if (set[
an].ecart > o)
11479 if (set[
an].ecart == o)
11481 int oo=set[
an].GetpFDeg();
11489 if (set[
i].ecart > o)
11491 else if (set[
i].ecart == o)
11493 int oo=set[
i].GetpFDeg();
11509 if (
length==-1)
return 0;
11511 int op=
p.GetpFDeg();
11512 int ol =
p.GetpLength();
11525 int oo=set[
an].GetpFDeg();
11532 int oo=set[
i].GetpFDeg();
11545 int ol =
p.GetpLength();
11605#ifdef HAVE_MORE_POS_IN_T
11641 printf(
"initEcartPair: ");
11645 printf(
"homog=%d, LazyDegree=%d, LazyPass=%d, ak=%d,\n",
11647 printf(
"honey=%d, sugarCrit=%d, Gebauer=%d, noTailReduction=%d, use_buckets=%d\n",
11653 printf(
"posInLDependsOnLength=%d\n",
11685 printf(
"currRing->pFDeg: ");
11700 printf(
"ecartWeights: ");
11722#ifdef HAVE_SHIFTBBA
11826 PrintS(
"\n--- create strong gcd poly: ");
11835 pNext(
gcd) =
p_Add_q(
pp_Mult_mm(
pp_mm_Mult(
pNext(
p), m1, strat->
tailRing),
m12, strat->
tailRing),
pp_Mult_mm(
pp_mm_Mult(
pNext(q), m2, strat->
tailRing),
m22, strat->
tailRing), strat->
tailRing);
11857 h.i_r1 = -1;
h.i_r2 = -1;
11891#ifdef HAVE_SHIFTBBA
11922 h.ecart=0;
h.length=0;
11954 for(
j = strat->
Bl;
j>=0;
j--)
12095 h.i_r1 = -1;
h.i_r2 = -1;
12134#ifdef HAVE_SHIFTBBA
12144#ifdef HAVE_SHIFTBBA
12208#ifdef HAVE_SHIFTBBA
12250#ifdef HAVE_SHIFTBBA
12253#ifdef CRITERION_DEBUG
12298#ifdef CRITERION_DEBUG
12306 if((!((
ecartq>0)&&(ecart>0)))
12325#ifdef CRITERION_DEBUG
12335#ifdef CRITERION_DEBUG
12360#ifdef CRITERION_DEBUG
12363 Print(
"--- chain crit using B[%d].lcm=%s\n",
j,
pString(strat->
B[
j].lcm));
12374#ifdef CRITERION_DEBUG
12377 Print(
"--- chain crit using pair to remove B[%d].lcm=%s\n",
j,
pString(strat->
B[
j].lcm));
12410#ifdef CRITERION_DEBUG
12418#ifdef CRITERION_DEBUG
12430 for(
j = strat->
Bl;
j>=0;
j--)
12439#ifdef CRITERION_DEBUG
12442 Print(
"--- chain crit using B[%d].lcm=%s\n",
j,
pString(strat->
B[
j].lcm));
12452#ifdef CRITERION_DEBUG
12455 Print(
"--- chain crit using pair to remove B[%d].lcm=%s\n",
j,
pString(strat->
B[
j].lcm));
12472#ifdef CRITERION_DEBUG
12480#ifdef CRITERION_DEBUG
12539#ifdef CRITERION_DEBUG
12579#ifdef CRITERION_DEBUG
12592#ifdef HAVE_SHIFTBBA
12622 for (
j=0;
j<=
k;
j++)
12627 poly
s = strat->
S[
j];
12638 for (
j=0;
j<=
k;
j++)
12640 poly
s = strat->
S[
j];
12658 for (
j=0;
j<=
k;
j++)
12663 poly
s = strat->
S[
j];
12674 for (
j=0;
j<=
k;
j++)
12678 poly
s = strat->
S[
j];
12708 for (
j=0;
j<=
k;
j++)
12710 poly
s = strat->
S[
j];
12718 for (
j=0;
j<=
k;
j++)
12720 poly
s = strat->
S[
j];
12765 for (
j=0;
j<=
k;
j++)
12770 poly
s = strat->
S[
j];
12787 for (
j=0;
j<=
k;
j++)
12792 poly
s = strat->
S[
j];
12800 for (
j=0;
j<=
k;
j++)
12805 poly
s = strat->
S[
j];
12860#ifdef HAVE_SHIFTBBA
12889 for (
j=0;
j<=
k;
j++)
12894 poly
s = strat->
S[
j];
12903 for (
j=0;
j<=
k;
j++)
12905 poly
s = strat->
S[
j];
12923 for (
j=0;
j<=
k;
j++)
12928 poly
s = strat->
S[
j];
12938 for (
j=0;
j<=
k;
j++)
12942 poly
s = strat->
S[
j];
12953 for (
j=0;
j<=
k;
j++)
12955 poly
s = strat->
S[
j];
12964 for (
j=0;
j<=
k;
j++)
12966 poly
s = strat->
S[
j];
12981 for (
j=0;
j<=
k;
j++)
12987 poly
s = strat->
S[
j];
13004 for (
j=0;
j<=
k;
j++)
13009 poly
s = strat->
S[
j];
13017 for (
j=0;
j<=
k;
j++)
13022 poly
s = strat->
S[
j];
13044#ifdef HAVE_SHIFTBBA
13053 if ( (!strat->
fromT)
13074#ifdef HAVE_SHIFTBBA
13097#ifdef HAVE_SHIFTBBA
13104 p =
h = L->GetLmTailRing();
13106 return L->GetLmCurrRing();
13113 Ln.pLength = L->GetpLength() - 1;
13121 while(!
Ln.IsNull())
13125 Ln.SetShortExpVector();
13155 }
while (!
Ln.IsNull());
13176 return L->GetLmCurrRing();
static int si_max(const int a, const int b)
static int si_min(const int a, const int b)
static CanonicalForm bound(const CFMatrix &M)
KINLINE poly kNoetherTail()
void(* chainCrit)(poly p, int ecart, kStrategy strat)
pFDegProc pOrigFDeg_TailRing
BOOLEAN(* rewCrit1)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
BOOLEAN(* rewCrit3)(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start)
int(* posInL)(const LSet set, const int length, LObject *L, const kStrategy strat)
KINLINE TObject * s_2_t(int i)
void(* initEcartPair)(LObject *h, poly f, poly g, int ecartF, int ecartG)
BOOLEAN(* syzCrit)(poly sig, unsigned long not_sevSig, kStrategy strat)
pShallowCopyDeleteProc p_shallow_copy_delete
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
char completeReduce_retry
void(* initEcart)(TObject *L)
KINLINE TObject * S_2_T(int i)
void(* enterOnePair)(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR)
int(* posInT)(const TSet T, const int tl, LObject &h)
int(* red)(LObject *L, kStrategy strat)
char posInLDependsOnLength
int(* posInLSba)(const LSet set, const int length, LObject *L, const kStrategy strat)
pLDegProc pOrigLDeg_TailRing
static FORCE_INLINE BOOLEAN nCoeff_is_Z(const coeffs r)
@ n_Q
rational (GMP) numbers
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...
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.
static FORCE_INLINE number n_Ann(number a, const coeffs r)
if r is a ring with zero divisors, return an annihilator!=0 of b otherwise return NULL
static FORCE_INLINE nMapFunc n_SetMap(const coeffs src, const coeffs dst)
set the mapping function pointers for translating numbers from src to dst
coeffs nInitChar(n_coeffType t, void *parameter)
one-time initialisations for new coeffs in case of an error return NULL
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE number n_Lcm(number a, number b, const coeffs r)
in Z: return the lcm of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...
static FORCE_INLINE number n_ExtGcd(number a, number b, number *s, number *t, const coeffs r)
beware that ExtGCD is only relevant for a few chosen coeff. domains and may perform something unexpec...
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static FORCE_INLINE number n_IntMod(number a, number b, const coeffs r)
for r a field, return n_Init(0,r) always: n_Div(a,b,r)*b+n_IntMod(a,b,r)==a n_IntMod(a,...
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:...
static FORCE_INLINE int n_DivComp(number a, number b, const coeffs r)
number(* nMapFunc)(number a, const coeffs src, const coeffs dst)
maps "a", which lives in src, into dst
void nKillChar(coeffs r)
undo all initialisations
const CanonicalForm int s
int comp(const CanonicalForm &A, const CanonicalForm &B)
compare polynomials
static int min(int a, int b)
static int max(int a, int b)
void scComputeHC(ideal S, ideal Q, int ak, poly &hEdge)
ideal idSyzygies(ideal h1, tHomog h, intvec **w, BOOLEAN setSyzComp, BOOLEAN setRegularity, int *deg, GbVariant alg)
#define idDelete(H)
delete an ideal
BOOLEAN idInsertPoly(ideal h1, poly h2)
insert h2 into h1 (if h2 is not the zero polynomial) return TRUE iff h2 was indeed inserted
BOOLEAN idIs0(ideal h)
returns true if h is the zero ideal
#define idPosConstant(I)
index of generator with leading term in ground ring (if any); otherwise -1
static BOOLEAN length(leftv result, leftv arg)
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
KINLINE void k_GetStrongLeadTerms(const poly p1, const poly p2, const ring leadRing, poly &m1, poly &m2, poly &lcm, const ring tailRing)
KINLINE int ksReducePolyTailLC_Z(LObject *PR, TObject *PW, LObject *Red)
KINLINE poly ksOldSpolyRed(poly p1, poly p2, poly spNoether)
KINLINE TObject ** initR()
KINLINE int ksReducePolyTail(LObject *PR, TObject *PW, LObject *Red)
KINLINE poly ksOldSpolyRedNew(poly p1, poly p2, poly spNoether)
KINLINE void clearS(poly p, unsigned long p_sev, int *at, int *k, kStrategy strat)
KINLINE BOOLEAN k_GetLeadTerms(const poly p1, const poly p2, const ring p_r, poly &m1, poly &m2, const ring m_r)
KINLINE int ksReducePolyTail_Z(LObject *PR, TObject *PW, LObject *Red)
KINLINE unsigned long * initsevT()
int redLiftstd(LObject *h, kStrategy strat)
BOOLEAN kbTest(kBucket_pt bucket)
Tests.
void kBucketDestroy(kBucket_pt *bucket_pt)
int ksCheckCoeff(number *a, number *b, const coeffs r)
BOOLEAN pCompareChainPart(poly p, poly p1, poly p2, poly lcm, const ring R)
BOOLEAN pCompareChain(poly p, poly p1, poly p2, poly lcm, const ring R)
Returns TRUE if.
poly ksCreateShortSpoly(poly p1, poly p2, ring tailRing)
long kHomModDeg(poly p, const ring r)
int posInL10(const LSet set, const int length, LObject *p, const kStrategy strat)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, intvec *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
int kFindDivisibleByInT_Z(const kStrategy strat, const LObject *L, const int start)
int redHoney(LObject *h, kStrategy strat)
int redHomog(LObject *h, kStrategy strat)
int redLazy(LObject *h, kStrategy strat)
poly redNF(poly h, int &max_ind, int nonorm, kStrategy strat)
int redRing(LObject *h, 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
void initSbaPos(kStrategy strat)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
poly redtail(LObject *L, int end_pos, kStrategy strat)
int posInL17Ring(const LSet set, const int length, LObject *p, const kStrategy)
int posInL17_cRing(const LSet set, const int length, LObject *p, const kStrategy)
int getIndexRng(long coeff)
int posInL110(const LSet set, const int length, LObject *p, const kStrategy)
int posInT17(const TSet set, const int length, LObject &p)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
int redFirst(LObject *h, kStrategy strat)
void kMergeBintoL(kStrategy strat)
static void enlargeT(TSet &T, TObject **&R, unsigned long *&sevT, int &length, const int incr)
BOOLEAN arriRewCriterionPre(poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int)
void enterSyz(LObject &p, kStrategy strat, int atT)
int posInL11Ring(const LSet set, const int length, LObject *p, const kStrategy)
int redEcart(LObject *h, kStrategy strat)
int posInT11(const TSet set, const int length, LObject &p)
void enterT(LObject &p, kStrategy strat, int atT)
int posInT1(const TSet set, const int length, LObject &p)
void enterTShift(LObject p, kStrategy strat, int atT)
int posInT110Ring(const TSet set, const int length, LObject &p)
BOOLEAN arriRewCriterion(poly, unsigned long, poly, kStrategy strat, int start=0)
void enterSSba(LObject &p, int atS, kStrategy strat, int atR)
BOOLEAN kTest(kStrategy strat)
void initenterpairsSigRing(poly h, poly hSig, int hFrom, int k, int ecart, int isFromQ, kStrategy strat, int atR=-1)
void enterSMoraNF(LObject &p, int atS, kStrategy strat, int atR=-1)
poly redtailBbaBound(LObject *L, int end_pos, kStrategy strat, int bound, BOOLEAN withT, BOOLEAN normalize)
int posInT_EcartpLength(const TSet set, const int length, LObject &p)
TObject * kFindDivisibleByInS_T(kStrategy strat, int end_pos, LObject *L, TObject *T, long ecart)
int posInT0(const TSet, const int length, LObject &)
BOOLEAN kTest_TS(kStrategy strat)
void enterOnePairNormal(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR=-1)
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
BOOLEAN kCheckStrongCreation(int atR, poly m1, int atS, poly m2, kStrategy strat)
void initenterstrongPairsShift(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR)
void enterpairsSig(poly h, poly hSig, int hFrom, int k, int ecart, int pos, kStrategy strat, int atR)
static void enterOnePairRingShift(poly q, poly p, int, int isFromQ, kStrategy strat, int atR, int, int qisFromQ, int shiftcount, int ifromS)
static const char * kTest_LmEqual(poly p, poly t_p, ring tailRing)
void enterL(LSet *set, int *length, int *LSetmax, LObject p, int at)
BOOLEAN faugereRewCriterion(poly sig, unsigned long not_sevSig, poly, kStrategy strat, int start=0)
static BOOLEAN enterOneStrongPolyAndEnterOnePairRingShift(poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS)
void clearSbatch(poly h, int k, int pos, kStrategy strat)
static int pLPDivComp(poly p, poly q)
int posInT2(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)
static BOOLEAN enterOnePairWithShifts(int q_inS, poly q, poly p, int ecartp, int p_isFromQ, kStrategy strat, int, int p_lastVblock, int q_lastVblock)
int posInT_pLength(const TSet set, const int length, LObject &p)
static intset initec(const int maxnr)
BOOLEAN kPosInLDependsOnLength(int(*pos_in_l)(const LSet set, const int length, LObject *L, const kStrategy strat))
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
int posInT13(const TSet set, const int length, LObject &p)
void redtailBbaAlsoLC_Z(LObject *L, int end_pos, kStrategy strat)
BOOLEAN syzCriterionInc(poly sig, unsigned long not_sevSig, kStrategy strat)
static void deleteHCBucket(LObject *L, kStrategy strat)
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
static BOOLEAN enterOnePairWithoutShifts(int p_inS, poly q, poly p, int ecartq, int q_isFromQ, kStrategy strat, int, int p_lastVblock, int q_shift)
void chainCritSig(poly p, int, kStrategy strat)
int posInSMonFirst(const kStrategy strat, const int length, const poly p)
void initEcartPairMora(LObject *Lp, poly, poly, int ecartF, int ecartG)
void initenterstrongPairs(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR=-1)
void superenterpairsSig(poly h, poly hSig, int hFrom, int k, int ecart, int pos, kStrategy strat, int atR)
static poly redMora(poly h, int maxIndex, kStrategy strat)
int posInL0Ring(const LSet set, const int length, LObject *p, const kStrategy)
static int pDivCompRing(poly p, poly q)
void initBuchMoraPos(kStrategy strat)
void initenterpairs(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR)
void initS(ideal F, ideal Q, kStrategy strat)
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
poly redtailBba(LObject *L, int end_pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize)
poly redtailBba_Z(LObject *L, int end_pos, kStrategy strat)
ring sbaRing(kStrategy strat, const ring r, BOOLEAN, int)
void initPairtest(kStrategy strat)
static BOOLEAN p_HasNotCF_Lift(poly p1, poly p2, const ring r)
p_HasNotCF for the IDLIFT case and syzComp==1: ignore component
int posInL0(const LSet set, const int length, LObject *p, const kStrategy)
void initSSpecial(ideal F, ideal Q, ideal P, kStrategy strat)
void chainCritOpt_1(poly, int, kStrategy strat)
int posInT11Ring(const TSet set, const int length, LObject &p)
static void enterOnePairRing(int i, poly p, int, int isFromQ, kStrategy strat, int atR)
static poly redBba(poly h, int maxIndex, kStrategy strat)
void cancelunit1(LObject *p, int *suc, int index, kStrategy strat)
void initenterpairsShift(poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR)
static void initenterstrongPairsSig(poly h, poly hSig, int k, int ecart, int isFromQ, kStrategy strat, int atR=-1)
void initenterpairsSig(poly h, poly hSig, int hFrom, int k, int ecart, int isFromQ, kStrategy strat, int atR=-1)
int posInL15(const LSet set, const int length, LObject *p, const kStrategy)
static void enlargeL(LSet *L, int *length, const int incr)
int posInT17_c(const TSet set, const int length, LObject &p)
poly redtailBbaShift(LObject *L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize)
int posInT_EcartFDegpLength(const TSet set, const int length, LObject &p)
int posInT15(const TSet set, const int length, LObject &p)
void enterT_strong(LObject &p, kStrategy strat, int atT)
void postReduceByMon(LObject *h, kStrategy strat)
used for GB over ZZ: intermediate reduction by monomial elements background: any known constant eleme...
BOOLEAN syzCriterion(poly sig, unsigned long not_sevSig, kStrategy strat)
void HEckeTest(poly pp, kStrategy strat)
int posInLSpecial(const LSet set, const int length, LObject *p, const kStrategy)
STATIC_VAR BOOLEAN sloppy_max
void enterExtendedSpolySig(poly h, poly hSig, kStrategy strat)
void enterpairsShift(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
static void enterOnePairSig(int i, poly p, poly pSig, int, int ecart, int isFromQ, kStrategy strat, int atR=-1)
BOOLEAN kTest_L(LObject *L, kStrategy strat, BOOLEAN testp, int lpos, TSet T, int tlength)
void exitBuchMora(kStrategy strat)
void messageStatSBA(int hilbcount, kStrategy strat)
void initEcartNormal(TObject *h)
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
void updateS(BOOLEAN toT, kStrategy strat)
static BOOLEAN is_shifted_p1(const poly p, const kStrategy strat)
void initSLSba(ideal F, ideal Q, kStrategy strat)
int posInL11Ringls(const LSet set, const int length, LObject *p, const kStrategy)
void enterOnePairSpecial(int i, poly p, int ecart, kStrategy strat, int atR=-1)
static int * initS_2_R(const int maxnr)
int posInL17(const LSet set, const int length, LObject *p, const kStrategy)
void initSyzRules(kStrategy strat)
int posInLSig(const LSet set, const int length, LObject *p, const kStrategy)
void initSbaBuchMora(ideal F, ideal Q, kStrategy strat)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void cleanT(kStrategy strat)
static void enterOnePairLift(int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR=-1)
int posInT110(const TSet set, const int length, LObject &p)
BOOLEAN kTest_S(kStrategy strat)
int posInSyz(const kStrategy strat, poly sig)
void replaceInLAndSAndT(LObject &p, int tj, kStrategy strat)
void reorderS(int *suc, kStrategy strat)
void enterExtendedSpoly(poly h, kStrategy strat)
int posInL15Ring(const LSet set, const int length, LObject *p, const kStrategy)
BOOLEAN kTest_T(TObject *T, kStrategy strat, int i, char TN)
void kMergeBintoLSba(kStrategy strat)
void deleteHC(LObject *L, kStrategy strat, BOOLEAN fromNext)
void updateResult(ideal r, ideal Q, kStrategy strat)
void superenterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
static BOOLEAN sugarDivisibleBy(int ecart1, int ecart2)
int posInT19(const TSet set, const int length, LObject &p)
poly redtailBba_NF(poly p, kStrategy strat)
void exitSba(kStrategy strat)
int posInT15Ring(const TSet set, const int length, LObject &p)
int posInT17Ring(const TSet set, const int length, LObject &p)
static BOOLEAN enterOneStrongPoly(int i, poly p, int, int, kStrategy strat, int atR, bool enterTstrong)
BOOLEAN enterOnePairShift(poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS)
void kDebugPrint(kStrategy strat)
Output some debug info about a given strategy.
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void kStratInitChangeTailRing(kStrategy strat)
void chainCritPart(poly p, int ecart, kStrategy strat)
void enterSMora(LObject &p, int atS, kStrategy strat, int atR=-1)
void initBuchMoraCrit(kStrategy strat)
void cleanTSbaRing(kStrategy strat)
int posInT17_cRing(const TSet set, const int length, LObject &p)
static int pDivComp(poly p, poly q)
void completeReduce(kStrategy strat, BOOLEAN withT)
int posInL17_c(const LSet set, const int length, LObject *p, const kStrategy)
void initBuchMoraPosRing(kStrategy strat)
int kFindInTShift(poly p, TSet T, int tlength)
void postReduceByMonSig(LObject *h, kStrategy strat)
static BOOLEAN enterOneStrongPolyShift(poly q, poly p, int, int, kStrategy strat, int atR, int, int, int shiftcount, int ifromS)
void messageSets(kStrategy strat)
void deleteInS(int i, kStrategy strat)
static poly redBba1(poly h, int maxIndex, kStrategy strat)
int posInT_FDegpLength(const TSet set, const int length, LObject &p)
int posInLSigRing(const LSet set, const int length, LObject *p, const kStrategy)
BOOLEAN isInPairsetL(int length, poly p1, poly p2, int *k, kStrategy strat)
BOOLEAN sbaCheckGcdPair(LObject *h, kStrategy strat)
int posInLF5CRing(const LSet set, int start, 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...
static unsigned long * initsevS(const int maxnr)
void enterpairsSpecial(poly h, int k, int ecart, int pos, kStrategy strat, int atR=-1)
void chainCritNormal(poly p, int ecart, kStrategy strat)
void initEcartBBA(TObject *h)
VAR denominator_list DENOMINATOR_LIST
static void enterOnePairSigRing(int i, poly p, poly pSig, int, int ecart, int isFromQ, kStrategy strat, int atR=-1)
void enterSBbaShift(LObject &p, int atS, kStrategy strat, int atR)
int posInL11(const LSet set, const int length, LObject *p, const kStrategy)
poly redtailBba_Ring(LObject *L, int end_pos, kStrategy strat)
int posInLF5C(const LSet, const int, LObject *, const kStrategy strat)
void initEcartPairBba(LObject *Lp, poly, poly, int, int)
void messageStat(int hilbcount, kStrategy strat)
static BOOLEAN enterOneStrongPolySig(int i, poly p, poly sig, int, int, kStrategy strat, int atR)
void chainCritRing(poly p, int, kStrategy strat)
void initSSpecialSba(ideal F, ideal Q, ideal P, kStrategy strat)
void initSL(ideal F, ideal Q, kStrategy strat)
int posInIdealMonFirst(const ideal F, const poly p, int start, int end)
void finalReduceByMon(kStrategy strat)
used for GB over ZZ: final reduction by constant elements background: any known constant element of i...
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
void initSbaCrit(kStrategy strat)
BOOLEAN newHEdge(kStrategy strat)
void cancelunit(LObject *L, BOOLEAN inNF)
denominator_list_s * denominator_list
static int kFindInL1(const poly p, const kStrategy strat)
static LSet initL(int nr=setmaxL)
static void kDeleteLcm(LObject *P)
#define ALLOW_PROD_CRIT(A)
#define REDTAIL_CANONICALIZE
static bool rIsSCA(const ring r)
poly nc_CreateShortSpoly(poly p1, poly p2, const ring r)
static nc_type & ncRingType(nc_struct *p)
poly nc_p_Bracket_qq(poly p, const poly q, const ring r)
returns [p,q], destroys p
int lcm(unsigned long *l, unsigned long *a, unsigned long *b, unsigned long p, int dega, int degb)
int dReportError(const char *fmt,...)
#define pFalseReturn(cond)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define __p_GetComp(p, r)
#define rRing_has_Comp(r)
STATIC_VAR gmp_float * diff
#define omFreeSize(addr, size)
#define omCheckBinAddrSize(addr, size)
#define omReallocSize(addr, o_size, size)
#define omRealloc0Size(addr, o_size, size)
#define omSizeWOfBin(bin_ptr)
#define TEST_OPT_INTSTRATEGY
#define TEST_OPT_INFREDTAIL
#define TEST_OPT_SUGARCRIT
#define TEST_OPT_DEGBOUND
#define TEST_OPT_NOT_SUGAR
#define TEST_OPT_CANCELUNIT
#define TEST_OPT_CONTENTSB
pShallowCopyDeleteProc pGetShallowCopyDeleteProc(ring, ring)
static int index(p_Length length, p_Ord ord)
poly p_GetMaxExpP(poly p, const ring r)
return monomial r such that GetExp(r,i) is maximum of all monomials in p; coeff == 0,...
void p_Cleardenom_n(poly ph, const ring r, number &c)
long pLDegb(poly p, int *l, const ring r)
long pLDeg1_Totaldegree(poly p, int *l, const ring r)
long p_WFirstTotalDegree(poly p, const ring r)
long pLDeg1_WFirstTotalDegree(poly p, int *l, const ring r)
void pRestoreDegProcs(ring r, pFDegProc old_FDeg, pLDegProc old_lDeg)
long pLDeg1c_WFirstTotalDegree(poly p, int *l, const ring r)
static BOOLEAN p_ExpVectorEqual(poly p1, poly p2, const ring r1, const ring r2)
long pLDeg1c_Deg(poly p, int *l, const ring r)
long pLDeg1(poly p, int *l, const ring r)
unsigned long p_GetShortExpVector(const poly p, const ring r)
long pLDeg1_Deg(poly p, int *l, const ring r)
long p_WTotaldegree(poly p, const ring r)
BOOLEAN p_OneComp(poly p, const ring r)
return TRUE if all monoms have the same component
poly p_Cleardenom(poly p, const ring r)
long pLDeg1c(poly p, int *l, const ring r)
long pLDeg1c_Totaldegree(poly p, int *l, const ring r)
long pLDeg0c(poly p, int *l, const ring r)
unsigned long p_GetMaxExpL(poly p, const ring r, unsigned long l_max)
return the maximal exponent of p in form of the maximal long var
long pLDeg0(poly p, int *l, const ring r)
poly p_Sub(poly p1, poly p2, const ring r)
void pEnlargeSet(poly **p, int l, int increment)
long p_Deg(poly a, const ring r)
void p_Lcm(const poly a, const poly b, poly m, const ring r)
static poly p_Neg(poly p, const ring r)
static int pLength(poly a)
static void p_ExpVectorSum(poly pr, poly p1, poly p2, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
static void p_LmDelete(poly p, const ring r)
static void p_ExpVectorAdd(poly p1, poly p2, const ring r)
BOOLEAN p_CheckIsFromRing(poly p, ring r)
static BOOLEAN _p_LmDivisibleByPart(poly a, const ring r_a, poly b, const ring r_b, const int start, const int end)
static long p_FDeg(const poly p, const ring r)
static unsigned long p_GetMaxExp(const unsigned long l, const ring r)
static void p_ExpVectorCopy(poly d_p, poly s_p, const ring r)
static void p_LmDelete0(poly p, const ring r)
static int p_Cmp(poly p1, poly p2, ring r)
#define __pp_Mult_nn(p, n, r)
static poly pp_mm_Mult(poly p, poly m, const ring r)
static poly pp_Mult_mm(poly p, poly m, const ring r)
static int p_LtCmpNoAbs(poly p, poly q, const ring r)
static void p_SetCompP(poly p, int i, ring r)
#define pp_Test(p, lmRing, tailRing)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static void p_Setm(poly p, const ring r)
static number p_SetCoeff(poly p, number n, ring r)
static int p_LmCmp(poly p, poly q, const ring r)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
BOOLEAN p_LmCheckIsFromRing(poly p, ring r)
static BOOLEAN p_LmDivisibleBy(poly a, poly b, const ring r)
static poly p_ShallowCopyDelete(poly p, const ring r, omBin bin)
static void p_Delete(poly *p, const ring r)
BOOLEAN p_CheckPolyRing(poly p, ring r)
static poly p_LmFreeAndNext(poly p, ring)
static poly p_Mult_mm(poly p, poly m, const ring r)
static void p_LmFree(poly p, ring)
static poly p_Copy(poly p, const ring r)
returns a copy of p
static long p_Totaldegree(poly p, const ring r)
static BOOLEAN p_LmExpVectorAddIsOk(const poly p1, const poly p2, const ring r)
void p_wrp(poly p, ring lmRing, ring tailRing)
void rChangeCurrRing(ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatibility layer for legacy polynomial operations (over currRing)
#define pLtCmpOrdSgnDiffM(p, q)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
#define pLmIsConstantComp(p)
like above, except that p must be != NULL
#define pIsConstant(p)
like above, except that Comp must be 0
#define pHasNotCF(p1, p2)
#define pLtCmpOrdSgnDiffP(p, q)
#define pGetComp(p)
Component.
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define pLmShortDivisibleBy(a, sev_a, b, not_sev_b)
Divisibility tests based on Short Exponent vectors sev_a == pGetShortExpVector(a) not_sev_b == ~ pGet...
#define pCmp(p1, p2)
pCmp: args may be NULL returns: (p2==NULL ? 1 : (p1 == NULL ? -1 : p_LmCmp(p1, p2)))
#define pLmInit(p)
like pInit, except that expvector is initialized to that of p, p must be != NULL
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
#define pGetShortExpVector(a)
returns the "Short Exponent Vector" – used to speed up divisibility tests (see polys-impl....
#define pLmDivisibleBy(a, b)
like pDivisibleBy, except that it is assumed that a!=NULL, b!=NULL
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
#define pGetExp(p, i)
Exponent.
#define pSetmComp(p)
TODO:
#define pHasNotCFRing(p1, p2)
#define pInit()
allocates a new monomial and initializes everything to 0
#define pEqualPolys(p1, p2)
#define pDivisibleBy(a, b)
returns TRUE, if leading monom of a divides leading monom of b i.e., if there exists a expvector c > ...
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
#define pLtCmpOrdSgnEqP(p, q)
#define pCopy(p)
return a copy of the poly
poly prMapR(poly src, nMapFunc nMap, ring src_r, ring dest_r)
void pLcmRat(poly a, poly b, poly m, int rat_shift)
void PrintS(const char *s)
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...
BOOLEAN nc_rComplete(const ring src, ring dest, bool bSetupQuotient)
void rKillModifiedRing(ring r)
ring rAssure_c_dp(const ring r)
ring rModifyRing(ring r, BOOLEAN omit_degree, BOOLEAN try_omit_comp, unsigned long exp_limit)
ring rCopy0(const ring r, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
void rDebugPrint(const ring r)
void rDelete(ring r)
unconditionally deletes fields in r
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static int rBlocks(const ring r)
static int rGetCurrSyzLimit(const ring r)
static BOOLEAN rField_is_Domain(const ring r)
static BOOLEAN rIsRatGRing(const ring r)
static BOOLEAN rIsLPRing(const ring r)
BOOLEAN rHasMixedOrdering(const ring r)
static BOOLEAN rIsSyzIndexRing(const ring r)
poly(* pShallowCopyDeleteProc)(poly s_p, ring source_r, ring dest_r, omBin dest_bin)
returns a poly from dest_r which is a ShallowCopy of s_p from source_r assumes that source_r->N == de...
static short rVar(const ring r)
#define rVar(r) (r->N)
BOOLEAN rHasGlobalOrdering(const ring r)
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
#define rField_is_Ring(R)
int p_mLPmaxPossibleShift(poly p, const ring r)
#define pLPCopyAndShiftLM(p, sh)
BOOLEAN _p_LPLmDivisibleByNoComp(poly a, poly b, const ring r)
int p_mFirstVblock(poly p, const ring ri)
void k_SplitFrame(poly &m1, poly &m2, int at, const ring r)
void p_mLPshift(poly m, int sh, const ring ri)
#define pLPDivisibleBy(a, b)
#define pLPLmDivisibleBy(a, b)
ideal idInit(int idsize, int rank)
initialise an ideal / module
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
ideal id_MaxIdeal(const ring r)
initialise the maximal ideal (at 0)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static int idElem(const ideal F)
number of non-zero polys in F
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
long totaldegreeWecart(poly p, ring r)
long maxdegreeWecart(poly p, int *l, ring r)
EXTERN_VAR short * ecartWeights
#define omGetStickyBinOfBin(B)
#define omMergeStickyBinIntoBin(A, B)