![]() |
My Project
|
#include "kernel/mod2.h"
#include "kernel/GBEngine/kutil.h"
#include "misc/options.h"
#include "kernel/polys.h"
#include "kernel/ideals.h"
#include "kernel/GBEngine/kstd1.h"
#include "kernel/GBEngine/khstd.h"
#include "polys/kbuckets.h"
#include "polys/prCopy.h"
#include "polys/weight.h"
#include "misc/intvec.h"
#include "polys/nc/nc.h"
#include "polys/shiftop.h"
Go to the source code of this file.
Macros | |
#define | GCD_SBA 1 |
#define | PLURAL_INTERNAL_DECLARATIONS 1 |
#define | STDZ_EXHANGE_DURING_REDUCTION 0 |
#define | DEBUGF50 0 |
#define | DEBUGF51 0 |
#define | F5C 1 |
#define | F5CTAILRED 1 |
#define | SBA_INTERRED_START 0 |
#define | SBA_TAIL_RED 1 |
#define | SBA_PRODUCT_CRITERION 0 |
#define | SBA_PRINT_ZERO_REDUCTIONS 0 |
#define | SBA_PRINT_REDUCTION_STEPS 0 |
#define | SBA_PRINT_OPERATIONS 0 |
#define | SBA_PRINT_SIZE_G 0 |
#define | SBA_PRINT_SIZE_SYZ 0 |
#define | SBA_PRINT_PRODUCT_CRITERION 0 |
Functions | |
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 | kFindDivisibleByInT_Z (const kStrategy strat, const LObject *L, const int start) |
static int | kFindDivisibleByInS_Z (const kStrategy strat, LObject *L) |
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 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 | kFindDivisibleByInS_noCF (const kStrategy strat, int *max_ind, LObject *L) |
int | kFindNextDivisibleByInS (const kStrategy strat, int start, int max_ind, LObject *L) |
static long | ind_fact_2 (long arg) |
poly | kFindZeroPoly (poly input_p, ring leadRing, ring tailRing) |
int | redRing_Z (LObject *h, kStrategy strat) |
static int | redRing_Z_S (LObject *h, kStrategy strat) |
int | redRing (LObject *h, kStrategy strat) |
static int | redRing_S (LObject *h, kStrategy strat) |
int | redHomog (LObject *h, kStrategy strat) |
KINLINE int | ksReducePolyTailSig (LObject *PR, TObject *PW, LObject *Red, kStrategy strat) |
int | redSig (LObject *h, kStrategy strat) |
int | redSigRing (LObject *h, kStrategy strat) |
poly | redtailSba (LObject *L, int pos, kStrategy strat, BOOLEAN withT, BOOLEAN normalize) |
int | redLazy (LObject *h, kStrategy strat) |
int | redHoney (LObject *h, kStrategy strat) |
poly | redNF (poly h, int &max_ind, int nonorm, kStrategy strat) |
poly | redNFBound (poly h, int &max_ind, int nonorm, kStrategy strat, int bound) |
void | kDebugPrint (kStrategy strat) |
ideal | bba (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
ideal | sba (ideal F0, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
poly | kNF2 (ideal F, ideal Q, poly q, kStrategy strat, int lazyReduce) |
poly | kNF2Bound (ideal F, ideal Q, poly q, int bound, kStrategy strat, int lazyReduce) |
ideal | kNF2 (ideal F, ideal Q, ideal q, kStrategy strat, int lazyReduce) |
ideal | kNF2Bound (ideal F, ideal Q, ideal q, int bound, kStrategy strat, int lazyReduce) |
void | f5c (kStrategy strat, int &olddeg, int &minimcnt, int &hilbeledeg, int &hilbcount, int &srmax, int &lrmax, int &reduc, ideal Q, intvec *w, intvec *hilb) |
ideal | bbaShift (ideal F, ideal Q, intvec *w, intvec *hilb, kStrategy strat) |
ideal | rightgb (ideal F, ideal Q) |
int | redFirstShift (LObject *h, kStrategy strat) |
Variables | |
VAR int(* | test_PosInT )(const TSet T, const int tl, LObject &h) |
VAR int(* | test_PosInL )(const LSet set, const int length, LObject *L, const kStrategy strat) |
Definition at line 2642 of file kstd2.cc.
Definition at line 4608 of file kstd2.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.
void kDebugPrint | ( | kStrategy | strat | ) |
Definition at line 11560 of file kutil.cc.
return -1 if no divisor is found number of first divisor in S, otherwise
Definition at line 421 of file kstd2.cc.
Definition at line 276 of file kstd2.cc.
poly kFindZeroPoly | ( | poly | input_p, |
ring | leadRing, | ||
ring | tailRing | ||
) |
Definition at line 569 of file kstd2.cc.
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 1305 of file kstd2.cc.
tests if T[0] divides the leading monomial of L, returns -1 if not
Definition at line 4988 of file kstd2.cc.
Definition at line 1121 of file kstd2.cc.
poly redNF | ( | poly | h, |
int & | max_ind, | ||
int | nonorm, | ||
kStrategy | strat | ||
) |
Definition at line 2325 of file kstd2.cc.
poly redNFBound | ( | poly | h, |
int & | max_ind, | ||
int | nonorm, | ||
kStrategy | strat, | ||
int | bound | ||
) |
Definition at line 954 of file kstd2.cc.
Definition at line 683 of file kstd2.cc.
Definition at line 841 of file kstd2.cc.
Definition at line 1761 of file kstd2.cc.
ideal rightgb | ( | ideal | F, |
ideal | Q | ||
) |
Definition at line 4972 of file kstd2.cc.
Definition at line 3001 of file kstd2.cc.