![]() |
#include <kernel/mod2.h>
#include <kernel/GBEngine/kutil.h>
#include <misc/options.h>
#include <omalloc/omalloc.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 <kernel/GBEngine/shiftgb.h>
Go to the source code of this file.
Macros | |
#define | GCD_SBA 1 |
#define | PLURAL_INTERNAL_DECLARATIONS 1 |
#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 |
#define | REDTAIL_CANONICALIZE 100 |
#define | REDNF_CANONICALIZE 60 |
Functions | |
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 | kFindNextDivisibleByInS (const kStrategy strat, int start, int max_ind, LObject *L) |
poly | kFindZeroPoly (poly input_p, ring leadRing, ring tailRing) |
int | redRing (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, int uptodeg, int lV) |
ideal | freegb (ideal I, int uptodeg, int lVblock) |
int | redFirstShift (LObject *h, kStrategy strat) |
void | initBbaShift (kStrategy strat) |
Variables | |
int(* | test_PosInT )(const TSet T, const int tl, LObject &h) |
int(* | test_PosInL )(const LSet set, const int length, LObject *L, const kStrategy strat) |
#define REDNF_CANONICALIZE 60 |
#define REDTAIL_CANONICALIZE 100 |
Definition at line 1972 of file kstd2.cc.
ideal bbaShift | ( | ideal | F, |
ideal | Q, | ||
intvec * | w, | ||
intvec * | hilb, | ||
kStrategy | strat, | ||
int | uptodeg, | ||
int | lV | ||
) |
Definition at line 4017 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 3696 of file kstd2.cc.
ideal freegb | ( | ideal | I, |
int | uptodeg, | ||
int | lVblock | ||
) |
Definition at line 4371 of file kstd2.cc.
void initBbaShift | ( | kStrategy | strat | ) |
Definition at line 4532 of file kstd2.cc.
void kDebugPrint | ( | kStrategy | strat | ) |
Definition at line 11800 of file kutil.cc.
return -1 if no divisor is found number of first divisor in S, otherwise
Definition at line 197 of file kstd2.cc.
return -1 if no divisor is found number of first divisor in T, otherwise
Definition at line 88 of file kstd2.cc.
Definition at line 259 of file kstd2.cc.
Definition at line 318 of file kstd2.cc.
Definition at line 3399 of file kstd2.cc.
ideal kNF2 | ( | ideal | F, |
ideal | Q, | ||
ideal | q, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 3538 of file kstd2.cc.
Definition at line 3468 of file kstd2.cc.
ideal kNF2Bound | ( | ideal | F, |
ideal | Q, | ||
ideal | q, | ||
int | bound, | ||
kStrategy | strat, | ||
int | lazyReduce | ||
) |
Definition at line 3613 of file kstd2.cc.
Definition at line 665 of file kstd2.cc.
Definition at line 4405 of file kstd2.cc.
Definition at line 542 of file kstd2.cc.
Definition at line 1456 of file kstd2.cc.
TEST_OPT_REDTHROUGH &&
Definition at line 1296 of file kstd2.cc.
Definition at line 1660 of file kstd2.cc.
Definition at line 1816 of file kstd2.cc.
Definition at line 432 of file kstd2.cc.
Definition at line 703 of file kstd2.cc.
Definition at line 871 of file kstd2.cc.
Definition at line 1168 of file kstd2.cc.
Definition at line 2355 of file kstd2.cc.