 |
My Project
UNKNOWN_GIT_VERSION
|
#include <tgb_internal.h>
Definition at line 213 of file tgb_internal.h.
◆ slimgb_alg()
slimgb_alg::slimgb_alg |
( |
ideal |
I, |
|
|
int |
syz_comp, |
|
|
BOOLEAN |
F4, |
|
|
int |
deg_pos |
|
) |
| |
Definition at line 3138 of file tgb.cc.
3151 for(hzz = 0; hzz <
IDELEMS (I); hzz++)
3155 poly t = I->m[hzz]->next;
3225 #ifdef USE_STDVECBOOL
3275 poly *array_arg = I->m;
3300 for(
i = 1;
i <
n;
i++)
◆ ~slimgb_alg()
slimgb_alg::~slimgb_alg |
( |
| ) |
|
|
virtual |
Definition at line 3326 of file tgb.cc.
3334 for(piter = 0; piter <=
pair_top; piter++)
3340 if(
s->lcm_of_lm !=
NULL)
3342 add[pos] =
s->lcm_of_lm;
3357 for(piter = 0; piter <=
pair_top; piter++)
3401 #ifndef USE_STDVECBOOL
3402 for(
int z = 1 ; z < c->
n; z++)
3412 for(
int z = 0; z < c->
n; z++)
3434 for(
i = 0;
i < c->
n;
i++)
3445 Print (
"\nNF:%i product criterion:%i, ext_product criterion:%i \n",
3454 for(
j = 0;
j < c->
n;
j++)
3484 for(
i = 0;
i < c->
n;
i++)
3489 for(
j = 0;
j < c->
n;
j++)
3491 if((c->
S->m[
j] ==
NULL) || (
i ==
j))
◆ cleanDegs()
void slimgb_alg::cleanDegs |
( |
int |
lower, |
|
|
int |
upper |
|
) |
| |
Definition at line 3756 of file tgb.cc.
3764 for(deg = lower; deg <= upper; deg++)
3767 for(
i = 0;
i <
n;
i++)
3811 new_pos = new_pos - 1;
3823 for(
i = 0;
i < this->
n; i++)
3825 for(
j = 0;
j <
i;
j++)
◆ introduceDelayedPairs()
void slimgb_alg::introduceDelayedPairs |
( |
poly * |
pa, |
|
|
int |
s |
|
) |
| |
Definition at line 3102 of file tgb.cc.
3109 for(
int i = 0;
i <
s;
i++)
◆ pTotaldegree()
unsigned long slimgb_alg::pTotaldegree |
( |
poly |
p | ) |
|
|
inline |
◆ pTotaldegree_full()
int slimgb_alg::pTotaldegree_full |
( |
poly |
p | ) |
|
|
inline |
◆ add_later
ideal slimgb_alg::add_later |
◆ apairs
◆ array_lengths
int slimgb_alg::array_lengths |
◆ average_length
int slimgb_alg::average_length |
◆ completed
◆ current_degree
int slimgb_alg::current_degree |
◆ deg_pos
◆ easy_product_crit
int slimgb_alg::easy_product_crit |
◆ eliminationProblem
BOOLEAN slimgb_alg::eliminationProblem |
◆ expandS
poly* slimgb_alg::expandS |
◆ extended_product_crit
int slimgb_alg::extended_product_crit |
◆ F4_mode
◆ F_minus
◆ gcd_of_terms
poly* slimgb_alg::gcd_of_terms |
◆ is_homog
◆ isDifficultField
BOOLEAN slimgb_alg::isDifficultField |
◆ last_index
int slimgb_alg::last_index |
◆ lastCleanedDeg
int slimgb_alg::lastCleanedDeg |
◆ lastDpBlockStart
int slimgb_alg::lastDpBlockStart |
◆ lengths
◆ max_pairs
int slimgb_alg::max_pairs |
◆ nc
◆ normal_forms
int slimgb_alg::normal_forms |
◆ pair_top
◆ Rcounter
◆ reduction_steps
unsigned int slimgb_alg::reduction_steps |
◆ short_Exps
long* slimgb_alg::short_Exps |
◆ soon_free
◆ states
char** slimgb_alg::states |
◆ strat
◆ syz_comp
array_lengths should be greater equal n;
Definition at line 263 of file tgb_internal.h.
◆ T_deg
◆ T_deg_full
int* slimgb_alg::T_deg_full |
◆ tailReductions
◆ tmp_lm
◆ tmp_pair_lm
poly* slimgb_alg::tmp_pair_lm |
◆ tmp_spn
◆ to_destroy
◆ use_noro
◆ use_noro_last_block
BOOLEAN slimgb_alg::use_noro_last_block |
◆ weighted_lengths
The documentation for this class was generated from the following files:
unsigned long pTotaldegree(poly p)
void initBuchMoraCrit(kStrategy strat)
unsigned int reduction_steps
static void simplify_poly(poly p, ring r)
void pNorm(poly p, const ring R=currRing)
void introduceDelayedPairs(poly *pa, int s)
void(* enterS)(LObject &h, int pos, kStrategy strat, int atR)
#define idDelete(H)
delete an ideal
sorted_pair_node ** apairs
void free_sorted_pair_node(sorted_pair_node *s, const ring r)
static FORCE_INLINE int n_GetChar(const coeffs r)
Return the characteristic of the coeff. domain.
#define omGetSpecBin(size)
sorted_pair_node ** tmp_spn
BOOLEAN use_noro_last_block
wlen_type * weighted_lengths
void now_t_rep(const int &arg_i, const int &arg_j, slimgb_alg *c)
int pTotaldegree_full(poly p)
static poly redNFTail(poly h, const int sl, kStrategy strat, int len)
int_pair_node * soon_free
static BOOLEAN p_LmDivisibleBy(poly a, poly b, const ring r)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static unsigned pLength(poly a)
static void move_backward_in_S(int old_pos, int new_pos, kStrategy strat)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define TEST_OPT_INTSTRATEGY
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
int tgb_pair_better_gen2(const void *ap, const void *bp)
void enterSBba(LObject &p, int atS, kStrategy strat, int atR)
void PrintS(const char *s)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static int get_last_dp_block_start(ring r)
poly p_Cleardenom(poly p, const ring r)
int extended_product_crit
void initBuchMoraPos(kStrategy strat)
static int simple_posInS(kStrategy strat, poly p, int len, wlen_type wlen)
static void p_Delete(poly *p, const ring r)
sorted_pair_node ** spn_merge(sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c)
static int si_max(const int a, const int b)
#define omUnGetSpecBin(bin_ptr)
static wlen_type pQuality(poly p, slimgb_alg *c, int l=-1)
sorted_pair_node ** add_to_basis_ideal_quotient(poly h, slimgb_alg *c, int *ip)
ideal idInit(int idsize, int rank)
initialise an ideal / module
BOOLEAN eliminationProblem
static long p_Totaldegree(poly p, const ring r)
void(* initEcart)(TObject *L)
const CanonicalForm int s
int syz_comp
array_lengths should be greater equal n;
void initEcartBBA(TObject *h)
poly_array_list * F_minus
wlen_type expected_length
static BOOLEAN rField_is_Zp(const ring r)
static BOOLEAN p_LmShortDivisibleBy(poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r)
static void move_forward_in_S(int old_pos, int new_pos, kStrategy strat)
poly_list_node * to_destroy