|
static int | add_to_reductors (slimgb_alg *c, poly h, int len, int ecart, BOOLEAN simplified=FALSE) |
|
static void | multi_reduction (red_object *los, int &losl, slimgb_alg *c) |
|
static void | multi_reduce_step (find_erg &erg, red_object *r, slimgb_alg *c) |
|
static BOOLEAN | extended_product_criterion (poly p1, poly gcd1, poly p2, poly gcd2, slimgb_alg *c) |
|
static poly | gcd_of_terms (poly p, ring r) |
|
static int | tgb_pair_better_gen (const void *ap, const void *bp) |
|
static BOOLEAN | pair_better (sorted_pair_node *a, sorted_pair_node *b, slimgb_alg *c=NULL) |
|
static BOOLEAN | state_is (calc_state state, const int &i, const int &j, slimgb_alg *c) |
|
static void | super_clean_top_of_pair_list (slimgb_alg *c) |
|
static int | simple_posInS (kStrategy strat, poly p, int len, wlen_type wlen) |
|
static int * | make_connections (int from, int to, poly bound, slimgb_alg *c) |
|
static BOOLEAN | has_t_rep (const int &arg_i, const int &arg_j, slimgb_alg *state) |
|
static void | shorten_tails (slimgb_alg *c, poly monom) |
|
static poly | redNF2 (poly h, slimgb_alg *c, int &len, number &m, int n=0) |
|
static poly | redNFTail (poly h, const int sl, kStrategy strat, int len) |
|
static int | bucket_guess (kBucket *bucket) |
|
static void | simplify_poly (poly p, ring r) |
|
int | slim_nsize (number n, ring r) |
|
static BOOLEAN | monomial_root (poly m, ring r) |
|
static BOOLEAN | polynomial_root (poly h, ring r) |
|
static poly | p_Init_Special (const ring r) |
|
static poly | pOne_Special (const ring r=currRing) |
|
static wlen_type | pSLength (poly p, int l) |
|
wlen_type | kSBucketLength (kBucket *b, poly lm=NULL) |
| TODO CoefBuckets bercksichtigen. More...
|
|
static BOOLEAN | elength_is_normal_length (poly p, slimgb_alg *c) |
|
static BOOLEAN | lies_in_last_dp_block (poly p, slimgb_alg *c) |
|
static int | get_last_dp_block_start (ring r) |
|
static wlen_type | do_pELength (poly p, slimgb_alg *c, int dlm=-1) |
|
wlen_type | pELength (poly p, slimgb_alg *c, ring) |
|
wlen_type | kEBucketLength (kBucket *b, poly lm, slimgb_alg *ca) |
|
static int | pELength (poly p, slimgb_alg *c, int l) |
|
static wlen_type | pQuality (poly p, slimgb_alg *c, int l=-1) |
|
static int | pTotaldegree_full (poly p) |
|
static int | red_object_better_gen (const void *ap, const void *bp) |
|
int | tgb_pair_better_gen2 (const void *ap, const void *bp) |
|
int | kFindDivisibleByInS_easy (kStrategy strat, const red_object &obj) |
|
int | kFindDivisibleByInS_easy (kStrategy strat, poly p, long sev) |
|
static int | posInPairs (sorted_pair_node **p, int pn, sorted_pair_node *qe, slimgb_alg *c, int an=0) |
|
static BOOLEAN | ascending (int *i, int top) |
|
sorted_pair_node ** | spn_merge (sorted_pair_node **p, int pn, sorted_pair_node **q, int qn, slimgb_alg *c) |
|
static BOOLEAN | trivial_syzygie (int pos1, int pos2, poly bound, slimgb_alg *c) |
|
int | find_best (red_object *r, int l, int u, wlen_type &w, slimgb_alg *c) |
| returns position sets w as weight More...
|
|
BOOLEAN | good_has_t_rep (int i, int j, slimgb_alg *c) |
|
BOOLEAN | lenS_correct (kStrategy strat) |
|
static void | cleanS (kStrategy strat, slimgb_alg *c) |
|
static void | length_one_crit (slimgb_alg *c, int pos, int len) |
|
static void | move_forward_in_S (int old_pos, int new_pos, kStrategy strat) |
|
static void | move_backward_in_S (int old_pos, int new_pos, kStrategy strat) |
|
static void | replace_pair (int &i, int &j, slimgb_alg *c) |
|
static void | add_later (poly p, const char *prot, slimgb_alg *c) |
|
static void | clearS (poly p, unsigned long p_sev, int l, int *at, int *k, kStrategy strat) |
|
static int | iq_crit (const void *ap, const void *bp) |
|
static wlen_type | coeff_mult_size_estimate (int s1, int s2, ring r) |
|
static wlen_type | pair_weighted_length (int i, int j, slimgb_alg *c) |
|
sorted_pair_node ** | add_to_basis_ideal_quotient (poly h, slimgb_alg *c, int *ip) |
|
static poly | redTailShort (poly h, kStrategy strat) |
|
static void | line_of_extended_prod (int fixpos, slimgb_alg *c) |
|
static void | c_S_element_changed_hook (int pos, slimgb_alg *c) |
|
BOOLEAN | is_valid_ro (red_object &ro) |
|
int | terms_sort_crit (const void *a, const void *b) |
|
static void | mass_add (poly *p, int pn, slimgb_alg *c) |
|
static void | go_on (slimgb_alg *c) |
|
void | init_with_mac_poly (tgb_sparse_matrix *mat, int row, mac_poly m) |
|
poly | free_row_to_poly (tgb_sparse_matrix *mat, int row, poly *monoms, int monom_index) |
|
static int | poly_crit (const void *ap1, const void *ap2) |
|
ideal | t_rep_gb (const ring r, ideal arg_I, int syz_comp, BOOLEAN F4_mode) |
|
ideal | do_t_rep_gb (ring, ideal arg_I, int syz_comp, BOOLEAN F4_mode, int deg_pos) |
|
void | now_t_rep (const int &arg_i, const int &arg_j, slimgb_alg *c) |
|
sorted_pair_node * | top_pair (slimgb_alg *c) |
|
sorted_pair_node * | quick_pop_pair (slimgb_alg *c) |
|
void | clean_top_of_pair_list (slimgb_alg *c) |
|
void | free_sorted_pair_node (sorted_pair_node *s, const ring r) |
|
static BOOLEAN | pHasNotCFExtended (poly p1, poly p2, poly m) |
|
static wlen_type | quality_of_pos_in_strat_S (int pos, slimgb_alg *c) |
|
static wlen_type | quality_of_pos_in_strat_S_mult_high (int pos, poly high, slimgb_alg *c) |
|
static void | multi_reduction_lls_trick (red_object *los, int, slimgb_alg *c, find_erg &erg) |
|
static int | fwbw (red_object *los, int i) |
|
static void | canonicalize_region (red_object *los, int l, int u, slimgb_alg *) |
|
static void | multi_reduction_find (red_object *los, int, slimgb_alg *c, int startf, find_erg &erg) |
|
static int | multi_reduction_clear_zeroes (red_object *los, int losl, int l, int u) |
|
int | search_red_object_pos (red_object *a, int top, red_object *key) |
|
static void | sort_region_down (red_object *los, int l, int u, slimgb_alg *) |
|