My Project
|
#include <string.h>
#include "omalloc/omalloc.h"
#include "omalloc/omallocClass.h"
#include "misc/mylimits.h"
#include "kernel/polys.h"
#include "polys/operations/pShallowCopyDelete.h"
#include "kernel/structs.h"
#include "kernel/GBEngine/kstd1.h"
#include "kernel/GBEngine/kInline.h"
#include "kernel/GBEngine/shiftgb.h"
Go to the source code of this file.
Data Structures | |
struct | denominator_list_s |
class | sTObject |
class | sLObject |
class | skStrategy |
Macros | |
#define | HAVE_TAIL_RING |
#define | setmax 128 |
#define | setmaxL ((4096-12)/sizeof(LObject)) |
#define | setmaxLinc ((4096)/sizeof(LObject)) |
#define | setmaxT ((4096-12)/sizeof(TObject)) |
#define | setmaxTinc ((4096)/sizeof(TObject)) |
#define | RED_CANONICALIZE 200 |
#define | REDNF_CANONICALIZE 60 |
#define | REDTAIL_CANONICALIZE 100 |
#define | KINLINE |
#define | NO_KINLINE 1 |
#define | ALLOW_PROD_CRIT(A) (!(A)->no_prod_crit) |
Typedefs | |
typedef int * | intset |
typedef int64 | wlen_type |
typedef wlen_type * | wlen_set |
typedef class sTObject | TObject |
typedef class sLObject | LObject |
typedef TObject * | TSet |
typedef LObject * | LSet |
typedef denominator_list_s * | denominator_list |
Functions | |
void | deleteHC (poly *p, int *e, int *l, kStrategy strat) |
void | deleteHC (LObject *L, kStrategy strat, BOOLEAN fromNext=FALSE) |
void | deleteInS (int i, kStrategy strat) |
void | cleanT (kStrategy strat) |
static LSet | initL (int nr=setmaxL) |
void | deleteInL (LSet set, int *length, int j, kStrategy strat) |
void | enterL (LSet *set, int *length, int *LSetmax, LObject p, int at) |
void | enterSBba (LObject &p, int atS, kStrategy strat, int atR=-1) |
void | enterSBbaShift (LObject &p, int atS, kStrategy strat, int atR=-1) |
void | enterSSba (LObject &p, int atS, kStrategy strat, int atR=-1) |
void | initEcartPairBba (LObject *Lp, poly f, poly g, int ecartF, int ecartG) |
void | initEcartPairMora (LObject *Lp, poly f, poly g, int ecartF, int ecartG) |
int | posInS (const kStrategy strat, const int length, const poly p, const int ecart_p) |
int | posInSMonFirst (const kStrategy strat, const int length, const poly p) |
int | posInIdealMonFirst (const ideal F, const poly p, int start=0, int end=-1) |
int | posInT0 (const TSet set, const int length, LObject &p) |
int | posInT1 (const TSet set, const int length, LObject &p) |
int | posInT2 (const TSet set, const int length, LObject &p) |
int | posInT11 (const TSet set, const int length, LObject &p) |
int | posInTSig (const TSet set, const int length, LObject &p) |
int | posInT110 (const TSet set, const int length, LObject &p) |
int | posInT13 (const TSet set, const int length, LObject &p) |
int | posInT15 (const TSet set, const int length, LObject &p) |
int | posInT17 (const TSet set, const int length, LObject &p) |
int | posInT17_c (const TSet set, const int length, LObject &p) |
int | posInT19 (const TSet set, const int length, LObject &p) |
int | posInT_EcartpLength (const TSet set, const int length, LObject &p) |
int | posInT_EcartFDegpLength (const TSet set, const int length, LObject &p) |
int | posInT_FDegpLength (const TSet set, const int length, LObject &p) |
int | posInT_pLength (const TSet set, const int length, LObject &p) |
void | reorderS (int *suc, kStrategy strat) |
int | posInLF5C (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInLSig (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInLSigRing (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInSyz (const kStrategy strat, const poly sig) |
int | posInL0 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL11 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL11Ring (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInLF5CRing (const LSet set, int start, const int length, LObject *L, const kStrategy strat) |
int | posInL11Ringls (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL13 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL15 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL15Ring (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL17 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL10 (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL10Ring (const LSet set, const int length, LObject *L, const kStrategy strat) |
int | posInL110 (const LSet set, const int length, LObject *L, const kStrategy strat) |
KINLINE poly | redtailBba (poly p, int end_pos, kStrategy strat, BOOLEAN normalize=FALSE) |
KINLINE poly | redtailBbaBound (poly p, int end_pos, kStrategy strat, int bound, BOOLEAN normalize=FALSE) |
KINLINE poly | redtailBba_Ring (poly p, int end_pos, kStrategy strat) |
KINLINE poly | redtailBba_Z (poly p, int end_pos, kStrategy strat) |
poly | redtailBba_NF (poly p, kStrategy strat) |
poly | redtailBba_Ring (LObject *L, int end_pos, kStrategy strat) |
poly | redtailBba_Z (LObject *L, int end_pos, kStrategy strat) |
void | redtailBbaAlsoLC_Z (LObject *L, int end_pos, kStrategy strat) |
poly | redtailBba (LObject *L, int end_pos, kStrategy strat, BOOLEAN withT=FALSE, BOOLEAN normalize=FALSE) |
poly | redtailBbaBound (LObject *L, int end_pos, kStrategy strat, int bound, BOOLEAN withT=FALSE, BOOLEAN normalize=FALSE) |
poly | redtailSba (LObject *L, int end_pos, kStrategy strat, BOOLEAN withT=FALSE, BOOLEAN normalize=FALSE) |
poly | redtailBba (TObject *T, int end_pos, kStrategy strat) |
poly | redtail (poly p, int end_pos, kStrategy strat) |
poly | redtail (LObject *L, int end_pos, kStrategy strat) |
poly | redNF (poly h, int &max_ind, int nonorm, kStrategy strat) |
int | redNF0 (LObject *P, kStrategy strat) |
poly | redNFTail (poly h, const int sl, kStrategy strat) |
int | redHoney (LObject *h, kStrategy strat) |
int | redHoneyM (LObject *h, kStrategy strat) |
int | redLiftstd (LObject *h, kStrategy strat) |
int | redRing (LObject *h, kStrategy strat) |
int | redRing_Z (LObject *h, kStrategy strat) |
int | redRiloc (LObject *h, kStrategy strat) |
void | enterExtendedSpoly (poly h, kStrategy strat) |
void | enterExtendedSpolySig (poly h, poly hSig, kStrategy strat) |
void | superenterpairs (poly h, int k, int ecart, int pos, kStrategy strat, int atR=-1) |
void | superenterpairsSig (poly h, poly hSig, int hFrom, int k, int ecart, int pos, kStrategy strat, int atR=-1) |
int | redLazy (LObject *h, kStrategy strat) |
int | redHomog (LObject *h, kStrategy strat) |
int | redSig (LObject *h, kStrategy strat) |
int | redSigRing (LObject *h, kStrategy strat) |
void | enterpairsSig (poly h, poly hSig, int from, int k, int ec, int pos, kStrategy strat, int atR=-1) |
void | enterpairs (poly h, int k, int ec, int pos, kStrategy strat, int atR=-1) |
void | entersets (LObject h) |
void | pairs () |
BOOLEAN | sbaCheckGcdPair (LObject *h, kStrategy strat) |
void | message (int i, int *reduc, int *olddeg, kStrategy strat, int red_result) |
void | messageStat (int hilbcount, kStrategy strat) |
void | messageStatSBA (int hilbcount, kStrategy strat) |
void | messageSets (kStrategy strat) |
void | initEcartNormal (TObject *h) |
void | initEcartBBA (TObject *h) |
void | initS (ideal F, ideal Q, kStrategy strat) |
void | initSL (ideal F, ideal Q, kStrategy strat) |
void | initSLSba (ideal F, ideal Q, kStrategy strat) |
void | initSyzRules (kStrategy strat) |
void | updateS (BOOLEAN toT, kStrategy strat) |
void | enterSyz (LObject &p, kStrategy strat, int atT) |
void | enterT (LObject &p, kStrategy strat, int atT=-1) |
void | replaceInLAndSAndT (LObject &p, int tj, kStrategy strat) |
void | enterT_strong (LObject &p, kStrategy strat, int atT=-1) |
void | cancelunit (LObject *p, BOOLEAN inNF=FALSE) |
void | HEckeTest (poly pp, kStrategy strat) |
void | initBuchMoraCrit (kStrategy strat) |
void | initSbaCrit (kStrategy strat) |
void | initHilbCrit (ideal F, ideal Q, intvec **hilb, kStrategy strat) |
void | initBuchMoraPos (kStrategy strat) |
void | initBuchMoraPosRing (kStrategy strat) |
void | initSbaPos (kStrategy strat) |
void | initBuchMora (ideal F, ideal Q, kStrategy strat) |
void | initSbaBuchMora (ideal F, ideal Q, kStrategy strat) |
void | exitBuchMora (kStrategy strat) |
void | exitSba (kStrategy strat) |
void | updateResult (ideal r, ideal Q, kStrategy strat) |
void | completeReduce (kStrategy strat, BOOLEAN withT=FALSE) |
void | kFreeStrat (kStrategy strat) |
void | enterOnePairNormal (int i, poly p, int ecart, int isFromQ, kStrategy strat, int atR) |
void | chainCritNormal (poly p, int ecart, kStrategy strat) |
void | chainCritOpt_1 (poly, int, kStrategy strat) |
void | chainCritSig (poly p, int ecart, kStrategy strat) |
BOOLEAN | homogTest (polyset F, int Fmax) |
BOOLEAN | newHEdge (kStrategy strat) |
BOOLEAN | syzCriterion (poly sig, unsigned long not_sevSig, kStrategy strat) |
BOOLEAN | syzCriterionInc (poly sig, unsigned long not_sevSig, kStrategy strat) |
KINLINE BOOLEAN | arriRewDummy (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start) |
BOOLEAN | arriRewCriterion (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start) |
BOOLEAN | arriRewCriterionPre (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start) |
BOOLEAN | faugereRewCriterion (poly sig, unsigned long not_sevSig, poly lm, kStrategy strat, int start) |
BOOLEAN | findMinLMPair (poly sig, unsigned long not_sevSig, kStrategy strat, int start) |
int | kFindInT (poly p, TSet T, int tlength) |
returns index of p in TSet, or -1 if not found More... | |
int | kFindInTShift (poly p, TSet T, int tlength) |
int | kFindDivisibleByInT (const kStrategy strat, const LObject *L, const int start=0) |
return -1 if no divisor is found number of first divisor in T, otherwise More... | |
int | kFindDivisibleByInT_Z (const kStrategy strat, const LObject *L, const int start=0) |
int | kFindSameLMInT_Z (const kStrategy strat, const LObject *L, const int start=0) |
int | kTestDivisibleByT0_Z (const kStrategy strat, const LObject *L) |
tests if T[0] divides the leading monomial of L, returns -1 if not More... | |
int | kFindDivisibleByInS (const kStrategy strat, int *max_ind, LObject *L) |
return -1 if no divisor is found number of first divisor in S, otherwise More... | |
int | kFindNextDivisibleByInS (const kStrategy strat, int start, int max_ind, LObject *L) |
TObject * | kFindDivisibleByInS_T (kStrategy strat, int end_pos, LObject *L, TObject *T, long ecart=LONG_MAX) |
KINLINE TSet | initT () |
KINLINE TObject ** | initR () |
KINLINE unsigned long * | initsevT () |
KINLINE poly | k_LmInit_currRing_2_tailRing (poly p, ring tailRing, omBin bin) |
KINLINE poly | k_LmInit_tailRing_2_currRing (poly p, ring tailRing, omBin bin) |
KINLINE poly | k_LmShallowCopyDelete_currRing_2_tailRing (poly p, ring tailRing, omBin bin) |
KINLINE poly | k_LmShallowCopyDelete_tailRing_2_currRing (poly p, ring tailRing, omBin bin) |
KINLINE poly | k_LmInit_currRing_2_tailRing (poly p, ring tailRing) |
KINLINE poly | k_LmInit_tailRing_2_currRing (poly p, ring tailRing) |
KINLINE poly | k_LmShallowCopyDelete_currRing_2_tailRing (poly p, ring tailRing) |
KINLINE poly | k_LmShallowCopyDelete_tailRing_2_currRing (poly p, ring tailRing) |
KINLINE BOOLEAN | k_GetLeadTerms (const poly p1, const poly p2, const ring p_r, poly &m1, poly &m2, const ring m_r) |
KINLINE void | k_GetStrongLeadTerms (const poly p1, const poly p2, const ring leadRing, poly &m1, poly &m2, poly &lcm, const ring taiRing) |
BOOLEAN | kTest (kStrategy strat) |
BOOLEAN | kTest_TS (kStrategy strat) |
BOOLEAN | kTest_L (LObject *L, kStrategy strat, BOOLEAN testp=FALSE, int lpos=-1, TSet T=NULL, int tlength=-1) |
BOOLEAN | kTest_T (TObject *T, kStrategy strat, int tpos=-1, char TN='?') |
BOOLEAN | kTest_S (kStrategy strat) |
poly | kFindZeroPoly (poly input_p, ring leadRing, ring tailRing) |
ideal | bba (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
ideal | sba (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
poly | kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce) |
ideal | kNF2 (ideal F, ideal Q, ideal q, kStrategy strat, int lazyReduce) |
poly | kNF2Bound (ideal F, ideal Q, poly q, int bound, kStrategy strat, int lazyReduce) |
ideal | kNF2Bound (ideal F, ideal Q, ideal q, int bound, kStrategy strat, int lazyReduce) |
void | initBba (kStrategy strat) |
void | initSba (ideal F, kStrategy strat) |
void | f5c (kStrategy strat, int &olddeg, int &minimcnt, int &hilbeledeg, int &hilbcount, int &srmax, int &lrmax, int &reduc, ideal Q, intvec *w, intvec *hilb) |
int | ksReducePoly (LObject *PR, TObject *PW, poly spNoether=NULL, number *coef=NULL, poly *mon=NULL, kStrategy strat=NULL, BOOLEAN redtail=FALSE) |
int | ksReducePolyZ (LObject *PR, TObject *PW, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolyLC (LObject *PR, TObject *PW, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolyGCD (LObject *PR, TObject *PW, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolyBound (LObject *PR, TObject *PW, int bound, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolySig (LObject *PR, TObject *PW, long idx, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolySigRing (LObject *PR, TObject *PW, long idx, poly spNoether=NULL, number *coef=NULL, kStrategy strat=NULL) |
int | ksReducePolyTail (LObject *PR, TObject *PW, poly Current, poly spNoether=NULL) |
KINLINE int | ksReducePolyTail (LObject *PR, TObject *PW, LObject *Red) |
void | ksCreateSpoly (LObject *Pair, poly spNoether=NULL, int use_buckets=0, ring tailRing=currRing, poly m1=NULL, poly m2=NULL, TObject **R=NULL) |
poly | ksCreateShortSpoly (poly p1, poly p2, ring tailRing) |
KINLINE poly | ksOldSpolyRed (poly p1, poly p2, poly spNoether=NULL) |
KINLINE poly | ksOldSpolyRedNew (poly p1, poly p2, poly spNoether=NULL) |
KINLINE poly | ksOldCreateSpoly (poly p1, poly p2, poly spNoether=NULL, ring r=currRing) |
KINLINE void | ksOldSpolyTail (poly p1, poly q, poly q2, poly spNoether, ring r=currRing) |
BOOLEAN | kCheckSpolyCreation (LObject *L, kStrategy strat, poly &m1, poly &m2) |
BOOLEAN | kCheckStrongCreation (int atR, poly m1, int atS, poly m2, kStrategy strat) |
poly | preIntegerCheck (ideal F, ideal Q) |
used for GB over ZZ: look for constant and monomial elements in the ideal background: any known constant element of ideal suppresses intermediate coefficient swell More... | |
void | postReduceByMon (LObject *h, kStrategy strat) |
used for GB over ZZ: intermediate reduction by monomial elements background: any known constant element of ideal suppresses intermediate coefficient swell More... | |
void | postReduceByMonSig (LObject *h, kStrategy strat) |
void | finalReduceByMon (kStrategy strat) |
used for GB over ZZ: final reduction by constant elements background: any known constant element of ideal suppresses intermediate coefficient swell and beautifies output More... | |
BOOLEAN | kStratChangeTailRing (kStrategy strat, LObject *L=NULL, TObject *T=NULL, unsigned long new_expbound=0) |
void | kStratInitChangeTailRing (kStrategy strat) |
void | kDebugPrint (kStrategy strat) |
Output some debug info about a given strategy. More... | |
ring | sbaRing (kStrategy strat, const ring r=currRing, BOOLEAN complete=TRUE, int sgn=1) |
KINLINE void | clearS (poly p, unsigned long p_sev, int *at, int *k, kStrategy strat) |
static int | kFindInL1 (const poly p, const kStrategy strat) |
void | enterTShift (LObject p, kStrategy strat, int atT=-1) |
BOOLEAN | enterOnePairShift (poly q, poly p, int ecart, int isFromQ, kStrategy strat, int atR, int ecartq, int qisFromQ, int shiftcount, int ifromS) |
void | enterpairsShift (poly h, int k, int ecart, int pos, kStrategy strat, int atR) |
void | superenterpairsShift (poly h, int k, int ecart, int pos, kStrategy strat, int atR) |
poly | redtailBbaShift (LObject *L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize) |
int | redFirstShift (LObject *h, kStrategy strat) |
ideal | bbaShift (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
static void | kDeleteLcm (LObject *P) |
void | initenterpairs (poly h, int k, int ecart, int isFromQ, kStrategy strat, int atR=-1) |
Variables | |
EXTERN_VAR denominator_list | DENOMINATOR_LIST |
EXTERN_VAR int | strat_nr |
EXTERN_VAR int | HCord |
EXTERN_VAR int(* | test_PosInT )(const TSet T, const int tl, LObject &h) |
EXTERN_VAR int(* | test_PosInL )(const LSet set, const int length, LObject *L, const kStrategy strat) |
struct denominator_list_s |
Data Fields | ||
---|---|---|
number | n | |
denominator_list | next |
typedef denominator_list_s* denominator_list |
BOOLEAN arriRewCriterion | ( | poly | sig, |
unsigned long | not_sevSig, | ||
poly | lm, | ||
kStrategy | strat, | ||
int | start | ||
) |
Definition at line 6664 of file kutil.cc.
BOOLEAN arriRewCriterionPre | ( | poly | sig, |
unsigned long | not_sevSig, | ||
poly | lm, | ||
kStrategy | strat, | ||
int | start | ||
) |
Definition at line 6689 of file kutil.cc.
Definition at line 2642 of file kstd2.cc.
Definition at line 4608 of file kstd2.cc.
Definition at line 373 of file kutil.cc.
void chainCritNormal | ( | poly | p, |
int | ecart, | ||
kStrategy | strat | ||
) |
Definition at line 3217 of file kutil.cc.
void chainCritOpt_1 | ( | poly | , |
int | , | ||
kStrategy | strat | ||
) |
void chainCritSig | ( | poly | p, |
int | ecart, | ||
kStrategy | strat | ||
) |
Definition at line 3474 of file kutil.cc.
void cleanT | ( | kStrategy | strat | ) |
Definition at line 565 of file kutil.cc.
Definition at line 10340 of file kutil.cc.
Definition at line 294 of file kutil.cc.
void deleteHC | ( | poly * | p, |
int * | e, | ||
int * | l, | ||
kStrategy | strat | ||
) |
Definition at line 1215 of file kutil.cc.
void deleteInS | ( | int | i, |
kStrategy | strat | ||
) |
Definition at line 1139 of file kutil.cc.
void enterExtendedSpoly | ( | poly | h, |
kStrategy | strat | ||
) |
Definition at line 4249 of file kutil.cc.
void enterExtendedSpolySig | ( | poly | h, |
poly | hSig, | ||
kStrategy | strat | ||
) |
Definition at line 4333 of file kutil.cc.
void enterOnePairNormal | ( | int | i, |
poly | p, | ||
int | ecart, | ||
int | isFromQ, | ||
kStrategy | strat, | ||
int | atR | ||
) |
Definition at line 1952 of file kutil.cc.
BOOLEAN enterOnePairShift | ( | poly | q, |
poly | p, | ||
int | ecart, | ||
int | isFromQ, | ||
kStrategy | strat, | ||
int | atR, | ||
int | ecartq, | ||
int | qisFromQ, | ||
int | shiftcount, | ||
int | ifromS | ||
) |
Definition at line 12234 of file kutil.cc.
void enterpairs | ( | poly | h, |
int | k, | ||
int | ec, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR = -1 |
||
) |
void enterpairsShift | ( | poly | h, |
int | k, | ||
int | ecart, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR | ||
) |
Definition at line 13028 of file kutil.cc.
void enterpairsSig | ( | poly | h, |
poly | hSig, | ||
int | from, | ||
int | k, | ||
int | ec, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR = -1 |
||
) |
Definition at line 8829 of file kutil.cc.
Definition at line 8929 of file kutil.cc.
void entersets | ( | LObject | h | ) |
Definition at line 8952 of file kutil.cc.
Definition at line 9380 of file kutil.cc.
Definition at line 9178 of file kutil.cc.
Definition at line 9278 of file kutil.cc.
Definition at line 13058 of file kutil.cc.
void exitBuchMora | ( | kStrategy | strat | ) |
void exitSba | ( | kStrategy | strat | ) |
Definition at line 10088 of file kutil.cc.
void f5c | ( | kStrategy | strat, |
int & | olddeg, | ||
int & | minimcnt, | ||
int & | hilbeledeg, | ||
int & | hilbcount, | ||
int & | srmax, | ||
int & | lrmax, | ||
int & | reduc, | ||
ideal | Q, | ||
intvec * | w, | ||
intvec * | hilb | ||
) |
Definition at line 4296 of file kstd2.cc.
BOOLEAN faugereRewCriterion | ( | poly | sig, |
unsigned long | not_sevSig, | ||
poly | lm, | ||
kStrategy | strat, | ||
int | start | ||
) |
Definition at line 6605 of file kutil.cc.
void finalReduceByMon | ( | kStrategy | strat | ) |
used for GB over ZZ: final reduction by constant elements background: any known constant element of ideal suppresses intermediate coefficient swell and beautifies output
Definition at line 10928 of file kutil.cc.
void HEckeTest | ( | poly | pp, |
kStrategy | strat | ||
) |
void initBba | ( | kStrategy | strat | ) |
Definition at line 1689 of file kstd1.cc.
void initBuchMora | ( | ideal | F, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 9800 of file kutil.cc.
void initBuchMoraCrit | ( | kStrategy | strat | ) |
Definition at line 9476 of file kutil.cc.
void initBuchMoraPos | ( | kStrategy | strat | ) |
Definition at line 9627 of file kutil.cc.
void initBuchMoraPosRing | ( | kStrategy | strat | ) |
Definition at line 9713 of file kutil.cc.
void initEcartBBA | ( | TObject * | h | ) |
void initEcartNormal | ( | TObject * | h | ) |
void initEcartPairBba | ( | LObject * | Lp, |
poly | f, | ||
poly | g, | ||
int | ecartF, | ||
int | ecartG | ||
) |
void initEcartPairMora | ( | LObject * | Lp, |
poly | f, | ||
poly | g, | ||
int | ecartF, | ||
int | ecartG | ||
) |
void initenterpairs | ( | poly | h, |
int | k, | ||
int | ecart, | ||
int | isFromQ, | ||
kStrategy | strat, | ||
int | atR = -1 |
||
) |
Definition at line 3822 of file kutil.cc.
void initS | ( | ideal | F, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 7635 of file kutil.cc.
void initSba | ( | ideal | F, |
kStrategy | strat | ||
) |
Definition at line 1747 of file kstd1.cc.
void initSbaBuchMora | ( | ideal | F, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 10013 of file kutil.cc.
void initSbaCrit | ( | kStrategy | strat | ) |
Definition at line 9541 of file kutil.cc.
void initSbaPos | ( | kStrategy | strat | ) |
Definition at line 9911 of file kutil.cc.
KINLINE unsigned long * initsevT | ( | ) |
void initSL | ( | ideal | F, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 7729 of file kutil.cc.
void initSLSba | ( | ideal | F, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 7826 of file kutil.cc.
void initSyzRules | ( | kStrategy | strat | ) |
Definition at line 7976 of file kutil.cc.
KINLINE BOOLEAN k_GetLeadTerms | ( | const poly | p1, |
const poly | p2, | ||
const ring | p_r, | ||
poly & | m1, | ||
poly & | m2, | ||
const ring | m_r | ||
) |
Definition at line 1018 of file kInline.h.
KINLINE void k_GetStrongLeadTerms | ( | const poly | p1, |
const poly | p2, | ||
const ring | leadRing, | ||
poly & | m1, | ||
poly & | m2, | ||
poly & | lcm, | ||
const ring | taiRing | ||
) |
Definition at line 1061 of file kInline.h.
KINLINE poly k_LmInit_currRing_2_tailRing | ( | poly | p, |
ring | tailRing | ||
) |
KINLINE poly k_LmInit_tailRing_2_currRing | ( | poly | p, |
ring | tailRing | ||
) |
Definition at line 996 of file kInline.h.
KINLINE poly k_LmShallowCopyDelete_currRing_2_tailRing | ( | poly | p, |
ring | tailRing | ||
) |
Definition at line 1001 of file kInline.h.
KINLINE poly k_LmShallowCopyDelete_tailRing_2_currRing | ( | poly | p, |
ring | tailRing | ||
) |
Definition at line 1006 of file kInline.h.
Definition at line 10534 of file kutil.cc.
void kDebugPrint | ( | kStrategy | strat | ) |
Output some debug info about a given strategy.
Definition at line 11560 of file kutil.cc.
|
inlinestatic |
return -1 if no divisor is found number of first divisor in S, otherwise
Definition at line 421 of file kstd2.cc.
TObject * kFindDivisibleByInS_T | ( | kStrategy | strat, |
int | end_pos, | ||
LObject * | L, | ||
TObject * | T, | ||
long | ecart = LONG_MAX |
||
) |
Definition at line 6740 of file kutil.cc.
return -1 if no divisor is found number of first divisor in T, otherwise
Definition at line 321 of file kstd2.cc.
Definition at line 213 of file kstd2.cc.
int kFindInT | ( | poly | p, |
TSet | T, | ||
int | tlength | ||
) |
int kFindInTShift | ( | poly | p, |
TSet | T, | ||
int | tlength | ||
) |
poly kFindZeroPoly | ( | poly | input_p, |
ring | leadRing, | ||
ring | tailRing | ||
) |
Definition at line 569 of file kstd2.cc.
void kFreeStrat | ( | kStrategy | strat | ) |
ideal kNF2 | ( | ideal | F, |
ideal | Q, | ||
ideal | q, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 4123 of file kstd2.cc.
poly kNF2 | ( | ideal | F, |
ideal | Q, | ||
poly | q, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 3967 of file kstd2.cc.
ideal kNF2Bound | ( | ideal | F, |
ideal | Q, | ||
ideal | q, | ||
int | bound, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 4208 of file kstd2.cc.
poly kNF2Bound | ( | ideal | F, |
ideal | Q, | ||
poly | q, | ||
int | bound, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 4049 of file kstd2.cc.
poly ksCreateShortSpoly | ( | poly | p1, |
poly | p2, | ||
ring | tailRing | ||
) |
Definition at line 1453 of file kspoly.cc.
void ksCreateSpoly | ( | LObject * | Pair, |
poly | spNoether = NULL , |
||
int | use_buckets = 0 , |
||
ring | tailRing = currRing , |
||
poly | m1 = NULL , |
||
poly | m2 = NULL , |
||
TObject ** | R = NULL |
||
) |
Definition at line 1208 of file kspoly.cc.
Definition at line 1196 of file kInline.h.
Definition at line 1176 of file kInline.h.
Definition at line 1206 of file kInline.h.
int ksReducePoly | ( | LObject * | PR, |
TObject * | PW, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
poly * | mon = NULL , |
||
kStrategy | strat = NULL , |
||
BOOLEAN | redtail = FALSE |
||
) |
Definition at line 189 of file kspoly.cc.
int ksReducePolyBound | ( | LObject * | PR, |
TObject * | PW, | ||
int | bound, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
Definition at line 595 of file kspoly.cc.
int ksReducePolyGCD | ( | LObject * | PR, |
TObject * | PW, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
int ksReducePolyLC | ( | LObject * | PR, |
TObject * | PW, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
Definition at line 481 of file kspoly.cc.
int ksReducePolySig | ( | LObject * | PR, |
TObject * | PW, | ||
long | idx, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
Definition at line 742 of file kspoly.cc.
int ksReducePolySigRing | ( | LObject * | PR, |
TObject * | PW, | ||
long | idx, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
Definition at line 948 of file kspoly.cc.
Definition at line 1357 of file kspoly.cc.
int ksReducePolyZ | ( | LObject * | PR, |
TObject * | PW, | ||
poly | spNoether = NULL , |
||
number * | coef = NULL , |
||
kStrategy | strat = NULL |
||
) |
BOOLEAN kStratChangeTailRing | ( | kStrategy | strat, |
LObject * | L = NULL , |
||
TObject * | T = NULL , |
||
unsigned long | new_expbound = 0 |
||
) |
Definition at line 11021 of file kutil.cc.
void kStratInitChangeTailRing | ( | kStrategy | strat | ) |
Definition at line 11114 of file kutil.cc.
Definition at line 1012 of file kutil.cc.
BOOLEAN kTest_L | ( | LObject * | L, |
kStrategy | strat, | ||
BOOLEAN | testp = FALSE , |
||
int | lpos = -1 , |
||
TSet | T = NULL , |
||
int | tlength = -1 |
||
) |
Definition at line 926 of file kutil.cc.
Definition at line 801 of file kutil.cc.
Definition at line 1073 of file kutil.cc.
tests if T[0] divides the leading monomial of L, returns -1 if not
Definition at line 146 of file kstd2.cc.
void message | ( | int | i, |
int * | reduc, | ||
int * | olddeg, | ||
kStrategy | strat, | ||
int | red_result | ||
) |
void messageSets | ( | kStrategy | strat | ) |
void messageStat | ( | int | hilbcount, |
kStrategy | strat | ||
) |
Definition at line 7553 of file kutil.cc.
void messageStatSBA | ( | int | hilbcount, |
kStrategy | strat | ||
) |
Definition at line 7566 of file kutil.cc.
Definition at line 10462 of file kutil.cc.
void pairs | ( | ) |
Definition at line 4863 of file kutil.cc.
Definition at line 1365 of file kstd1.cc.
Definition at line 6093 of file kutil.cc.
Definition at line 5946 of file kutil.cc.
Definition at line 6294 of file kutil.cc.
int posInLF5CRing | ( | const LSet | set, |
int | start, | ||
const int | length, | ||
LObject * | L, | ||
const kStrategy | strat | ||
) |
Definition at line 5728 of file kutil.cc.
Definition at line 4685 of file kutil.cc.
Definition at line 4786 of file kutil.cc.
Definition at line 4975 of file kutil.cc.
Definition at line 5053 of file kutil.cc.
Definition at line 5210 of file kutil.cc.
Definition at line 5306 of file kutil.cc.
Definition at line 5414 of file kutil.cc.
Definition at line 5542 of file kutil.cc.
Definition at line 11435 of file kutil.cc.
Definition at line 11489 of file kutil.cc.
used for GB over ZZ: intermediate reduction by monomial elements background: any known constant element of ideal suppresses intermediate coefficient swell
Definition at line 10763 of file kutil.cc.
Definition at line 10839 of file kutil.cc.
poly preIntegerCheck | ( | ideal | F, |
ideal | Q | ||
) |
used for GB over ZZ: look for constant and monomial elements in the ideal background: any known constant element of ideal suppresses intermediate coefficient swell
Definition at line 10596 of file kutil.cc.
Definition at line 4988 of file kstd2.cc.
Definition at line 1121 of file kstd2.cc.
Definition at line 2088 of file kstd2.cc.
TEST_OPT_REDTHROUGH &&
Definition at line 1881 of file kstd2.cc.
Definition at line 167 of file kLiftstd.cc.
poly redNF | ( | poly | h, |
int & | max_ind, | ||
int | nonorm, | ||
kStrategy | strat | ||
) |
Definition at line 2325 of file kstd2.cc.
Definition at line 387 of file kstd1.cc.
Definition at line 954 of file kstd2.cc.
Definition at line 683 of file kstd2.cc.
Definition at line 1343 of file kstd2.cc.
Definition at line 1511 of file kstd2.cc.
Definition at line 6883 of file kutil.cc.
poly redtail | ( | poly | p, |
int | end_pos, | ||
kStrategy | strat | ||
) |
poly redtailBba | ( | LObject * | L, |
int | end_pos, | ||
kStrategy | strat, | ||
BOOLEAN | withT = FALSE , |
||
BOOLEAN | normalize = FALSE |
||
) |
Definition at line 6959 of file kutil.cc.
poly redtailBba_NF | ( | poly | p, |
kStrategy | strat | ||
) |
Definition at line 7423 of file kutil.cc.
Definition at line 7317 of file kutil.cc.
Definition at line 7188 of file kutil.cc.
poly redtailBbaBound | ( | LObject * | L, |
int | end_pos, | ||
kStrategy | strat, | ||
int | bound, | ||
BOOLEAN | withT = FALSE , |
||
BOOLEAN | normalize = FALSE |
||
) |
Definition at line 7072 of file kutil.cc.
Definition at line 13081 of file kutil.cc.
poly redtailSba | ( | LObject * | L, |
int | end_pos, | ||
kStrategy | strat, | ||
BOOLEAN | withT = FALSE , |
||
BOOLEAN | normalize = FALSE |
||
) |
Definition at line 1761 of file kstd2.cc.
void reorderS | ( | int * | suc, |
kStrategy | strat | ||
) |
Definition at line 4632 of file kutil.cc.
Definition at line 9087 of file kutil.cc.
Definition at line 3001 of file kstd2.cc.
Definition at line 1700 of file kutil.cc.
Definition at line 11142 of file kutil.cc.
void superenterpairs | ( | poly | h, |
int | k, | ||
int | ecart, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR = -1 |
||
) |
Definition at line 4478 of file kutil.cc.
void superenterpairsShift | ( | poly | h, |
int | k, | ||
int | ecart, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR | ||
) |
void superenterpairsSig | ( | poly | h, |
poly | hSig, | ||
int | hFrom, | ||
int | k, | ||
int | ecart, | ||
int | pos, | ||
kStrategy | strat, | ||
int | atR = -1 |
||
) |
Definition at line 4491 of file kutil.cc.
Definition at line 6521 of file kutil.cc.
Definition at line 6556 of file kutil.cc.
void updateResult | ( | ideal | r, |
ideal | Q, | ||
kStrategy | strat | ||
) |
Definition at line 10128 of file kutil.cc.
Definition at line 8594 of file kutil.cc.
EXTERN_VAR denominator_list DENOMINATOR_LIST |
EXTERN_VAR int HCord |
EXTERN_VAR int strat_nr |