Classes |
class | BitMask< 0 > |
class | BitMask |
| This class defines a bit mask and related operations. More...
|
class | BitMask< sizeof(unsigned long)*8 > |
class | BlockOrderHelper |
| This class defines BlockOrderHelper. More...
|
class | BoundedDivisorsOf |
| This class defines defines a function for computing a bounded variant of MononmialSet's divisorsOf . More...
|
class | CacheManager |
class | ChainCriterion |
| This class defines ChainCriterion. More...
|
class | ChainVariableCriterion |
| This class defines ChainVariableCriterion. More...
|
class | CheckChainCriterion |
| This class defines CheckChainCriterion. More...
|
class | CountCriterion |
| This class defines CountCriterion. More...
|
class | DegOrderHelper |
| This class defines DegOrderHelper. More...
|
class | ExpGreater |
| This class defines ExpGreater. More...
|
class | ExpLexLess |
| This class defines ExpLexLess. More...
|
class | FGLMStrategy |
class | GetNthPoly |
class | GBTypes |
class | GroebnerOptions |
| This class defines options settings for GroebnerStrategy . More...
|
class | GroebnerStrategy |
| This class defines GroebnerStrategy. More...
|
class | HasTRepOrExtendedProductCriterion |
| This class defines HasTRepOrExtendedProductCriterion. More...
|
class | IJPairData |
| This class defines IJPairData. More...
|
class | IsEcart0Predicate |
| This class defines IsEcart0Predicate. More...
|
class | IsVariableOfIndex |
class | LargerDegreeComparer |
| This class defines LargerDegreeComparer. More...
|
class | LeadingTerms |
| This class defines LeadingTerms. More...
|
class | LeadingTerms00 |
| This class defines LeadingTerms00. More...
|
class | LeadingTerms11 |
| This class defines LeadingTerms11. More...
|
class | LessCombinedManySizesInStrat |
| This class defines LessCombinedManySizesInStrat. More...
|
class | LessEcartThenLessWeightedLengthInStrat |
| This class defines LessEcartThenLessWeightedLengthInStrat. More...
|
class | LessUsedTailVariablesThenLessWeightedLengthInStrat |
| This class defines LessUsedTailVariablesThenLessWeightedLengthInStrat. More...
|
class | LessWeightedLengthInStrat |
| This class defines LessWeightedLengthInStrat. More...
|
class | LessWeightedLengthInStratModified |
| This class defines LessWeightedLengthInStratModified. More...
|
class | LexBucket |
class | LexHelper |
| This class defines LexHelper. More...
|
class | LexOrderGreaterComparer |
| This class defines LexOrderGreaterComparer. More...
|
class | LiteralFactorization |
class | LiteralFactorizationIterator |
| This class defines LiteralFactorizationIterator. More...
|
class | LLReduction |
| This class defines LLReduction. More...
|
class | LLReductor |
| This class defines LLReductor. More...
|
class | LMLessCompare |
| This class defines LMLessCompare. More...
|
class | LMLessComparePS |
| This class defines LMLessComparePS. More...
|
class | Long64From32BitsPairBase< High, Low, 4 > |
class | Long64From32BitsPairBase< High, Low, 8 > |
class | Long64From32BitsPair |
| This class defines Long64From32BitsPair. More...
|
class | MatrixMonomialOrderTables |
| This class defines MatrixMonomialOrderTables. More...
|
class | MinimalLeadingTerms |
| This class defines MinimalLeadingTerms. More...
|
class | MonomialHasher |
| This class defines MonomialHasher. More...
|
class | MonomialPlusOneTerms |
| This class defines MonomialPlusOneTerms. More...
|
class | MonomialTerms |
| This class defines MonomialTerms. More...
|
class | NBitsUsed |
| This class defines NBitsUsed whose value attribute computes the actual number of used bits at compile time. More...
|
class | NBitsUsed< 0 > |
class | NextSpoly |
| This class computes the next spoly for a generator pair. More...
|
class | PairData |
| This class defines PairData. More...
|
class | PairE |
| This class defines PairE. More...
|
class | PairECompare |
| This class defines PairECompare. More...
|
class | PairLS |
| This class defines PairLS. More...
|
class | PairLSCompare |
| This class defines PairLSCompare. More...
|
class | PairManager |
| This class defines PairManager. More...
|
class | PairManagerWithStrategy |
| This class extends PairManager with a reference to a strategy. More...
|
class | PairManagerFacade |
| This class defines a facade for a given Strategy, which. More...
|
class | PairStatusSet |
| This class defines PairStatusSet. More...
|
class | PolyEntry |
| This class defines PolyEntry. More...
|
class | PolyEntryBase |
| This class defines the base of PolyEntry . More...
|
class | PolyEntryIndices |
| This class defines PolyEntryIndices. More...
|
class | PolyEntryPtrLmLess |
| This class compares pointers to PolyEntry by their leading monomials. More...
|
class | PolyEntryReference |
| This class defines PolyEntryReference . More...
|
class | PolyEntryVector |
class | PolyFromPolyEntry |
| This class defines an operator which extracts the Polynomial from a PolyEntry. More...
|
class | PolyMonomialPairComparerLess |
| This class defines PolyMonomialPairComparerLess. More...
|
class | PolyMonomialPairComparerLexLess |
| This class defines PolyMonomialPairComparerLexLess. More...
|
class | PolynomialSugar |
| This class defines PolynomialSugar. More...
|
class | PolyPairData |
| This class defines PolyPairData. More...
|
class | PSCompareByEl |
| This class defines PSCompareByEl. More...
|
class | PseudoLongLong |
| This class defines PseudoLongLong. More...
|
class | PseudoLongProduct |
| This class defines a delayed product of longs and comparison with LongLong Constant. More...
|
class | RankingVector |
| This class defines RankingVector. More...
|
class | RedTailNth |
class | ReductionOptions |
| This class defines option values for the ReductionStrategy. More...
|
class | ReductionStrategy |
| This class defines ReductionStrategy. More...
|
class | ReductionTerms |
| This class defines term for ReductionStrategy . More...
|
class | RelatedTerms |
| This class finds those terms in a given set which are related to given terms. More...
|
class | RelatedTermsBase |
| This class deals as a base of RelatedTerns . More...
|
class | SetAssociatedMinimal |
| This class set the attribute minimal of a given index to a valued selected by the template parameter Value . More...
|
class | SetBitUInt |
| This class defines SetBitUInt. More...
|
class | ShorterEliminationLength |
| This class defines ShorterEliminationLength. More...
|
class | ShorterEliminationLengthModified |
| This class defines ShorterEliminationLengthModified. More...
|
class | SlimgbReduction |
| This class defines SlimgbReduction. More...
|
class | TermsFacade |
| This class defines TermsFacade. More...
|
class | TimesConstantImplication |
class | TimesVariableSubstitution |
class | VariablePairData |
| This class defines VariablePairData. More...
|
class | ZeroFunction |
| This class defines ZeroFunction. More...
|
class | FGLMNoLinearCombinationException |
Typedefs |
typedef std::vector< Polynomial > | poly_vec |
typedef polybori::CacheManager
< CCacheTypes::divisorsof_fixedpath > | fixed_divisors_cache_type |
typedef polybori::BoolePolynomial | Polynomial |
typedef polybori::BooleMonomial | Monomial |
typedef polybori::BooleVariable | Variable |
typedef polybori::BooleExponent | Exponent |
typedef std::vector< Polynomial > | PolynomialVector |
typedef long | wlen_type |
typedef long | len_type |
typedef int | deg_type |
typedef polybori::CTypes::idx_type | idx_type |
typedef polybori::BooleSet | MonomialSet |
typedef SlimgbReduction
< SLIMGB_SIMPLEST > | slimgb_reduction_type |
typedef boost::shared_ptr
< PairData > | pair_data_ptr |
typedef PairE | Pair |
typedef Monomial::idx_map_type | lm2Index_map_type |
typedef Exponent::idx_map_type | exp2Index_map_type |
typedef boost::minstd_rand | base_generator_type |
typedef boost::uniform_smallint | distribution_type |
typedef
boost::variate_generator
< base_generator_type
&, distribution_type > | bool_gen_type |
typedef
LessWeightedLengthInStratModified | StratComparerForSelect |
Enumerations |
enum | { VARIABLE_PAIR,
IJ_PAIR,
DELAYED_PAIR
} |
Functions |
MonomialSet | add_up_lex_sorted_monomials (const BoolePolyRing &ring, std::vector< Monomial > &vec, int start, int end) |
MonomialSet | add_up_lex_sorted_exponents (const BoolePolyRing &ring, std::vector< Exponent > &vec, int start, int end) |
Polynomial | add_up_exponents (const std::vector< Exponent > &vec, const Polynomial &init) |
Polynomial | unite_polynomials (const std::vector< Polynomial > &res_vec, int start, int end, Polynomial init) |
Polynomial | unite_polynomials (const std::vector< Polynomial > &res_vec, Polynomial init) |
template<class T > |
Polynomial | add_up_generic (const std::vector< T > &res_vec, int start, int end, Polynomial init) |
template<class T > |
Polynomial | add_up_generic (const std::vector< T > &res_vec, Polynomial init) |
Polynomial | add_up_monomials (const std::vector< Monomial > &vec, const Polynomial &init) |
Polynomial | add_up_polynomials (const std::vector< Polynomial > &vec, const Polynomial &init) |
template<class idx_type1 , class idx_type2 > |
void | set_up_translation_vectors (std::vector< idx_type1 > &ring_2_0123, std::vector< idx_type2 > &back_2_ring, const Exponent &used_variables) |
Polynomial | translate_indices (const Polynomial &p, const std::vector< idx_type > &table) |
MonomialSet | contained_variables_cudd_style (const MonomialSet &m) |
MonomialSet | contained_deg2_cudd_style (const MonomialSet &m) |
std::vector< idx_type > | contained_variables (const MonomialSet &m) |
void | draw_matrix (mzd_t *mat, const char *filename) |
MonomialSet | do_fixed_path_divisors (const fixed_divisors_cache_type &cache_mgr, MonomialSet::navigator a_nav, MonomialSet::navigator m_nav, MonomialSet::navigator n_nav) |
MonomialSet | do_fixed_path_divisors (MonomialSet a, MonomialSet m, MonomialSet n) |
MonomialSet | fixed_path_divisors (MonomialSet a, Monomial m, Monomial n) |
Polynomial | map_every_x_to_x_plus_one (Polynomial p) |
MonomialSet | mod_var_set (const MonomialSet &as, const MonomialSet &vs) |
void | groebner (GroebnerStrategy &strat) |
Polynomial | reduce_by_binom (const Polynomial &p, const Polynomial &binom) |
Polynomial | reduce_by_monom (const Polynomial &p, const Monomial &m) |
| assumes that divisibility condition is fullfilled
|
Polynomial | reduce_complete (const Polynomial &p, const Polynomial &reductor) |
Polynomial | mult_fast_sim (const std::vector< Polynomial > &vec, const BoolePolyRing &ring) |
std::vector< Polynomial > | full_implication_gb (const Polynomial &p, CacheManager &cache, GroebnerStrategy &strat) |
Polynomial | reduce_complete (const Polynomial &p, const PolyEntry &reductor, wlen_type &len) |
MonomialSet | recursively_insert (MonomialSet::navigator p, idx_type idx, MonomialSet mset) |
Polynomial | cancel_monomial_in_tail (const Polynomial &p, const Monomial &m) |
Polynomial | reduce_by_binom_in_tail (const Polynomial &p, const Polynomial &binom) |
bool | extended_product_criterion (const PolyEntry &m, const PolyEntry &m2) |
MonomialSet | variety_lex_leading_terms (const MonomialSet &points, const Monomial &variables) |
Polynomial | interpolate (MonomialSet to_zero, MonomialSet to_one) |
Polynomial | interpolate_smallest_lex (MonomialSet to_zero, MonomialSet to_one) |
MonomialSet | zeros (Polynomial p, MonomialSet candidates) |
MonomialSet | include_divisors (const MonomialSet &m) |
MonomialSet | nf_lex_points (const Polynomial &f, const MonomialSet &p) |
std::vector< Polynomial > | variety_lex_groebner_basis (const MonomialSet &points, const Monomial &variables) |
wlen_type | wlen_literal_exceptioned (const PolyEntry &e) |
Polynomial | without_prior_part (Polynomial p, idx_type tail_start) |
int | select_largest_degree (const ReductionStrategy &strat, const Monomial &m) |
std::vector< Polynomial > | easy_linear_factors (const Polynomial &p) |
deg_type | common_literal_factors_deg (const LiteralFactorization &a, const LiteralFactorization &b) |
Polynomial | multiply_with_literal_factors (const LiteralFactorization &lf, Polynomial p) |
template<bool have_redsb, bool single_call_for_noredsb, bool fast_multiplication> |
Polynomial | ll_red_nf_generic (const Polynomial &, const BooleSet &) |
template<bool fast> |
Polynomial | multiply (const Polynomial &p, const Polynomial &q) |
template<bool have_redsb, bool single_call_for_noredsb, bool fast_multiplication> |
Polynomial | ll_red_nf_generic (const Polynomial &p, MonomialSet::navigator r_nav) |
Polynomial | ll_red_nf (const Polynomial &p, const BooleSet &reductors) |
Polynomial | ll_red_nf_noredsb (const Polynomial &p, const BooleSet &reductors) |
Polynomial | ll_red_nf_noredsb_single_recursive_call (const Polynomial &p, const BooleSet &reductors) |
MonomialSet | mod_mon_set (const MonomialSet &as, const MonomialSet &vs) |
MonomialSet | mod_deg2_set (const MonomialSet &as, const MonomialSet &vs) |
MonomialSet | minimal_elements_internal (const MonomialSet &s) |
MonomialSet | minimal_elements_internal2 (MonomialSet s) |
std::vector< Exponent > | minimal_elements_internal3 (MonomialSet s) |
MonomialSet | minimal_elements (const MonomialSet &s) |
MonomialSet | minimal_elements_cudd_style_unary (MonomialSet m) |
MonomialSet | do_minimal_elements_cudd_style (MonomialSet m, MonomialSet mod) |
MonomialSet | minimal_elements_cudd_style (MonomialSet m) |
MonomialSet | minimal_elements_multiplied_monoms (MonomialSet m, Monomial lm) |
std::vector< Monomial > | minimal_elements_multiplied (MonomialSet m, Monomial lm) |
MonomialSet | minimal_elements_divided (MonomialSet m, Monomial lm, MonomialSet mod) |
void | minimal_elements_divided (MonomialSet m, Monomial lm, MonomialSet mod, std::vector< Exponent > &result) |
int | select_no_deg_growth (const ReductionStrategy &strat, const Monomial &m) |
std::vector< Polynomial > | parallel_reduce (std::vector< Polynomial > inp, GroebnerStrategy &strat, int average_steps, double delay_f) |
Polynomial | nf3 (const ReductionStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_short (const ReductionStrategy &strat, Polynomial p) |
Polynomial | plug_1 (const Polynomial &p, const MonomialSet &m_plus_ones) |
Polynomial | cheap_reductions (const ReductionStrategy &strat, Polynomial p) |
Polynomial | nf3_lexbuckets (const GroebnerStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_no_deg_growth (const ReductionStrategy &strat, Polynomial p, Monomial rest_lead) |
Polynomial | nf3_degree_order (const ReductionStrategy &strat, Polynomial p, Monomial lead) |
bool | should_propagate (const PolyEntry &e) |
bool | is_rewriteable (const Polynomial &p, const MonomialSet &leading_terms) |
template<class RhsType > |
bool | operator> (PseudoLongProduct lhs, const RhsType &rhs) |
MonomialSet | random_set (const Monomial &variables, unsigned int len) |
void | set_random_seed (unsigned int seed) |
Polynomial | red_tail_general (const ReductionStrategy &strat, Polynomial p) |
template<class Helper > |
Polynomial | red_tail_generic (const ReductionStrategy &strat, Polynomial p) |
Polynomial | red_tail (const ReductionStrategy &strat, Polynomial p) |
Polynomial | red_tail_short (const ReductionStrategy &strat, Polynomial p) |
Polynomial | red_tail_in_last_block (const GroebnerStrategy &strat, Polynomial p) |
bool | irreducible_lead (Monomial lm, const ReductionStrategy &strat) |
template<class value_type , class initializer , class set_bit > |
value_type | p2code (Polynomial p, const std::vector< char > &ring_2_0123, int max_vars) |
unsigned int | p2code_4 (Polynomial p, const std::vector< char > &ring_2_0123) |
unsigned int | get_table_entry4 (const BoolePolyRing &ring, int p_code, int pos) |
Monomial | code_2_m_4 (const BoolePolyRing &ring, unsigned int code, const std::vector< idx_type > &back_2_ring) |
Polynomial | code_2_poly_4 (const BoolePolyRing &ring, unsigned int code, const std::vector< idx_type > &back_2_ring) |
bool | have_ordering_for_tables (const int order_code) |
bool | have_ordering_for_tables (const BoolePolyRing &ring) |
bool | have_base_ordering_for_tables (const BoolePolyRing &ring) |
void | transpose_window_to_row (mzd_t *transposed_vec, mzd_t *window) |
void | clear_mat (mzd_t *mat) |
template<class CacheMgr > |
MonomialSet | mod_var_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
template<class CacheMgr > |
MonomialSet | mod_deg2_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
template<class MgrType > |
MonomialSet | recursively_insert (const MgrType &mgr, MonomialSet::navigator p, idx_type idx, MonomialSet::navigator m) |
template<class CacheMgr > |
Polynomial | map_every_x_to_x_plus_one (const CacheMgr &cache_mgr, MonomialSet::navigator nav) |
Polynomial | reduce_by_small_entry (const Polynomial &poly, const PolyEntry &entry) |
int | steps (int size) |
MonomialSet | gen_random_subset (const BoolePolyRing &ring, const std::vector< Monomial > &vec, bool_gen_type &bit_gen) |
MonomialSet | random_interpolation (const MonomialSet &as_set, const std::vector< Monomial > &as_vector, bool_gen_type &bit_gen) |
bool | maps_to_one (const std::pair< const polybori::groebner::idx_type, int > v) |
bool | maps_to_zero (const std::pair< const polybori::groebner::idx_type, int > v) |
int | sum_size (const MonomialSet &s1, const MonomialSet &s2) |
Polynomial | do_plug_1 (const Polynomial &p, const MonomialSet &m_plus_ones) |
Polynomial | plug_1_top (const Polynomial &p, const MonomialSet &m_plus_ones) |
Polynomial | do_is_rewriteable (const Polynomial &p, const MonomialSet &leading_terms) |
MonomialSet | random_set_using_generator (const Monomial &variables, unsigned int len, bool_gen_type &bit_gen) |
Variables |
const unsigned short | dlex4var_data [][7] |
const unsigned short | dp_asc4var_data [][7] |
const unsigned short | lp4var_data [][7] |
const int | SLIMGB_SIMPLEST = 0 |
const int | FARE_WORSE = 10 |