1887{
1888 int olddeg = 0;
1889 int reduc = 0;
1890 int red_result = 1;
1891 int hilbeledeg=1,hilbcount=0;
1895 {
1898 }
1899
1901
1907 else
1911
1912
1914 {
1920 }
1923
1924#ifdef HAVE_TAIL_RING
1928#endif
1929
1931 {
1933 }
1934
1935
1936
1937
1938 while (strat->
Ll >= 0)
1939 {
1940 #ifdef KDEBUG
1942 #endif
1944 {
1945 while (strat->
Ll >= 0)
1948 }
1950 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg))
1951 {
1952
1953
1954
1955
1956
1957 while ((strat->
Ll >= 0)
1958 && (strat->
L[strat->
Ll].p1!=
NULL) && (strat->
L[strat->
Ll].p2!=
NULL)
1959 && (strat->
L[strat->
Ll].ecart+strat->
L[strat->
Ll].GetpFDeg()>
Kstd1_deg)
1960 )
1961 {
1963
1964
1965
1966
1967 }
1968 if (strat->
Ll<0)
break;
1970 }
1971 strat->
P = strat->
L[strat->
Ll];
1974
1976 {
1977
1980 else
1984
1987 {
1989
1991 }
1992
1997 }
1998 else if (strat->
P.p1 ==
NULL)
1999 {
2000
2003 }
2004
2005
2006 if (!strat->
P.IsNull())
2007 {
2008
2010 message(strat->
P.ecart+strat->
P.GetpFDeg(),&olddeg,&reduc,strat, red_result);
2011
2012 red_result = strat->
red(&strat->
P,strat);
2013 }
2014
2015
2016 if (! strat->
P.IsNull())
2017 {
2019
2021
2023 strat->
P.pCleardenom();
2024 else
2026
2027 strat->
P.p =
redtail(&(strat->
P),strat->
sl,strat);
2028 if (strat->
P.p==
NULL)
2029 {
2030 WerrorS(
"exponent overflow - wrong ordering");
2032 }
2033
2036
2038
2039 if ((strat->
P.p->next==
NULL)
2041 strat->
P.pCleardenom();
2042
2043 strat->
P.SetShortExpVector();
2045
2048 else
2050
2052 posInS(strat,strat->
sl,strat->
P.p, strat->
P.ecart),
2054
2056 {
2058 khCheck(
Q,
w,hilb,hilbeledeg,hilbcount,strat);
2059 else
2061 }
2062
2063
2065
2066#ifdef KDEBUG
2067
2069#endif
2070 }
2072 {
2075 {
2076
2077
2078
2079
2080
2081
2082
2083
2084
2086 }
2087 }
2089 }
2090
2093
2095
2097 {
2100 else
2102 }
2107
2108
2109
2110
2111
2112
2113
2114
2115
2121 return (strat->
Shdl);
2122}
KINLINE poly kNoetherTail()
long scMult0Int(ideal S, ideal Q)
void khCheckLocInhom(ideal Q, intvec *w, intvec *hilb, int &count, kStrategy strat)
void khCheck(ideal Q, intvec *w, intvec *hilb, int &eledeg, int &count, kStrategy strat)
void ksCreateSpoly(LObject *Pair, poly spNoether, int use_buckets, ring tailRing, poly m1, poly m2, TObject **R)
void missingAxis(int *last, kStrategy strat)
void reorderL(kStrategy strat)
int posInL10(const LSet set, const int length, LObject *p, const kStrategy strat)
static BOOLEAN kMoraUseBucket(kStrategy strat)
void updateL(kStrategy strat)
void message(int i, int *reduc, int *olddeg, kStrategy strat, int red_result)
void initBuchMora(ideal F, ideal Q, kStrategy strat)
BOOLEAN kTest_TS(kStrategy strat)
void enterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
void initHilbCrit(ideal, ideal, intvec **hilb, kStrategy strat)
BOOLEAN kStratChangeTailRing(kStrategy strat, LObject *L, TObject *T, unsigned long expbound)
void exitBuchMora(kStrategy strat)
int posInS(const kStrategy strat, const int length, const poly p, const int ecart_p)
BOOLEAN kCheckSpolyCreation(LObject *L, kStrategy strat, poly &m1, poly &m2)
void updateResult(ideal r, ideal Q, kStrategy strat)
void superenterpairs(poly h, int k, int ecart, int pos, kStrategy strat, int atR)
void deleteInL(LSet set, int *length, int j, kStrategy strat)
void kStratInitChangeTailRing(kStrategy strat)
void messageSets(kStrategy strat)
void messageStat(int hilbcount, kStrategy strat)
void finalReduceByMon(kStrategy strat)
used for GB over ZZ: final reduction by constant elements background: any known constant element of i...
void cancelunit(LObject *L, BOOLEAN inNF)
static void kDeleteLcm(LObject *P)
#define TEST_OPT_MULTBOUND
BOOLEAN rHasMixedOrdering(const ring r)