#include "groebner_alg.h"
#include "nf.h"
#include <algorithm>
#include <set>
#include "dlex4data.h"
#include "lp4data.h"
#include "dp_asc4data.h"
#include "CacheManager.h"
Classes | |
class | polybori::groebner::ChainCriterion |
assumes that divisibility condition is fullfilled More... | |
class | polybori::groebner::ChainVariableCriterion |
class | polybori::groebner::HasTRepOrExtendedProductCriterion |
class | polybori::groebner::SetBitUInt |
class | polybori::groebner::ZeroFunction |
class | polybori::groebner::ShorterEliminationLength |
class | polybori::groebner::ShorterEliminationLengthModified |
Namespaces | |
namespace | polybori |
namespace | polybori::groebner |
Defines | |
#define | DANGEROUS_FIXED_PATH 1 |
#define | HAVE_DLEX4_DATA 1 |
#define | HAVE_LP4_DATA 1 |
#define | HAVE_DP_ASC4_DATA 1 |
#define | EXP_FOR_PAIRS |
Typedefs | |
typedef polybori::CacheManager < CCacheTypes::divisorsof > | polybori::groebner::fixed_divisors_cache_type |
Functions | |
template<class CacheMgr > | |
MonomialSet | polybori::groebner::mod_var_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
MonomialSet | polybori::groebner::mod_var_set (const MonomialSet &as, const MonomialSet &vs) |
MonomialSet | polybori::groebner::mod_deg2_set (const MonomialSet &as, const MonomialSet &vs) |
template<class CacheMgr > | |
MonomialSet | polybori::groebner::mod_deg2_set (const CacheMgr &cache_mgr, MonomialSet::navigator a, MonomialSet::navigator v) |
MonomialSet | polybori::groebner::contained_variables_cudd_style (const MonomialSet &m) |
MonomialSet | polybori::groebner::contained_deg2_cudd_style (const MonomialSet &m) |
Polynomial | polybori::groebner::reduce_by_monom (const Polynomial &p, const Monomial &m) |
Polynomial | polybori::groebner::reduce_by_binom (const Polynomial &p, const Polynomial &binom) |
Polynomial | polybori::groebner::reduce_complete (const Polynomial &p, const Polynomial &reductor) |
Polynomial | polybori::groebner::reduce_complete (const Polynomial &p, const PolyEntry &reductor, wlen_type &len) |
bool | polybori::groebner::should_propagate (const PolyEntry &e) |
MonomialSet | polybori::groebner::minimal_elements_internal (const MonomialSet &s) |
MonomialSet | polybori::groebner::minimal_elements_internal2 (MonomialSet s) |
std::vector< Exponent > | polybori::groebner::minimal_elements_internal3 (MonomialSet s) |
MonomialSet | polybori::groebner::minimal_elements (const MonomialSet &s) |
template<class value_type , class initializer , class set_bit > | |
value_type | polybori::groebner::p2code (Polynomial p, const std::vector< char > &ring_2_0123, int max_vars) |
Polynomial | polybori::groebner::translate_indices (const Polynomial &p, const std::vector< idx_type > &table) |
bool | polybori::groebner::polynomial_in_one_block (const Polynomial p) |
MonomialSet | polybori::groebner::minimal_elements_cudd_style_unary (MonomialSet m) |
MonomialSet | polybori::groebner::minimal_elements_cudd_style (MonomialSet m) |
template<class MgrType > | |
MonomialSet | polybori::groebner::recursively_insert (const MgrType &mgr, MonomialSet::navigator p, idx_type idx, MonomialSet::navigator m) |
MonomialSet | polybori::groebner::recursively_insert (MonomialSet::navigator p, idx_type idx, MonomialSet mset) |
void | polybori::groebner::addPolynomialToReductor (Polynomial &p, MonomialSet &m) |
template<class CacheMgr > | |
Polynomial | polybori::groebner::map_every_x_to_x_plus_one (const CacheMgr &cache_mgr, MonomialSet::navigator nav) |
Polynomial | polybori::groebner::map_every_x_to_x_plus_one (Polynomial p) |
Polynomial | polybori::groebner::red_tail_in_last_block (const GroebnerStrategy &strat, Polynomial p) |
Polynomial | polybori::groebner::mult_fast_sim (const std::vector< Polynomial > &vec) |
std::vector< Polynomial > | polybori::groebner::full_implication_gb (const Polynomial &p, CacheManager &cache, GroebnerStrategy &strat_param) |
#define DANGEROUS_FIXED_PATH 1 |
#define EXP_FOR_PAIRS |
#define HAVE_DLEX4_DATA 1 |
#define HAVE_DP_ASC4_DATA 1 |
#define HAVE_LP4_DATA 1 |