polybori::AddEliminationDegree< SizeType > | |
polybori::append_indexed_divisor< DDType, IdxType > | Defines multiplication (with assignment) with the idx-th variable |
CCacheTypes::binary_cache_tag | |
polybori::binary_composition< BinaryOp, FirstOp, SecondOp > | Compose a binary function with two default constructable unary functions |
BinaryOp | |
binder1st | |
binder2nd | |
generic_hash_tags::bkdr_tag | |
CCacheTypes::block_degree | |
CCacheTypes::block_dlex_lead | |
block_dlex_tag | Marker for block deg-lex ordering |
block_dp_asc_tag | Marker for ascending block deg-rev-lex ordering |
BlockDegLexOrder | This class defines ordering related functions |
BlockDegRevLexAscOrder | This class defines ordering related functions |
polybori::groebner::BlockOrderHelper | |
BooleConstant | This class wraps a bool value, which was not converted to a boolean polynomial or monomial yet |
BooleEnv | This class is just a wrapper accessing global structures |
BooleExponent | This class is just a wrapper for using variables for storing indices as interim data structure for BooleMonomial |
BooleMonomial | This class is just a wrapper for using variables from cudd's decicion diagram |
BoolePolynomial | This class wraps the underlying decicion diagram type and defines the necessary operations |
BoolePolyRing | This class adds order-related functionality to BooleRing |
BooleRing | This class is just a wrapper for reinterpreting decicion diagram managers as Boolean polynomial rings |
BooleSet | |
BooleVariable | This class is just a wrapper for using variables from cudd's decicion diagram |
polybori::bounded_restricted_term< NaviType, DescendingProperty > | |
CAbstractStackBase< NavigatorType > | |
cached_block_deg< NavigatorType > | |
cached_deg< NavigatorType > | |
CacheManager< CacheType > | |
polybori::CAuxTypes | This struct contains auxiliary type definitions |
CBlockDegreeCache< TagType, DDType > | |
CBlockTermStack< NavigatorType, DescendingProperty, BaseType > | |
CCacheManagement< CacheType, ArgumentLength > | This template class forms the base for CCommutativeCacheManagement and CacheManager. It is an interface defining find and insert on decision diagram cache |
CCacheManBase | This template forms the base for CCacheManagement. It implements routines for finding and inserting results into the cache |
CCacheManBase< ManagerType, CacheType, 0 > | |
CCacheManBase< ManagerType, CacheType, 1 > | |
CCacheManBase< ManagerType, CacheType, 2 > | |
CCacheManBase< ManagerType, CacheType, 3 > | |
CCacheTypes | |
CCommutativeCacheManagement< CacheType > | |
polybori::CCompareEnums | This struct contains type definitions and enumerations to be used for comparisons |
CCuddCore | This class prepares the CUDD's raw decision diagram manager structure for the use with instrinsive pointers |
CCuddDDBase< DiagramType > | This template class defines a C++ interface to CUDD's decision diagram structure |
CCuddFirstIter | This class defines an iterator over the first minimal term of a given ZDD node |
CCuddGetNode | This class defines a functional, which generates a new decision * diagram node wrt. a given indes and two nodes |
CCuddInterface | This class defines a C++ interface to CUDD's decicion diagram manager |
CCuddLastIter | This class defines an iterator over the last minimal term of a given ZDD node |
CCuddLikeMgrStorage< MgrType > | |
CCuddNavigator | This class defines an iterator for navigating through then and else branches of ZDDs |
CCuddZDD | This class defines a C++ interface to CUDD's zero-suppressed decision diagram structure |
CDDInterface< CuddLikeZDD > | |
CDDInterfaceBase< DDType > | This is the common base for the specialized template class CDDInterface |
CDDManager | This specialization of the template class CDDManager gives an interface to Cudd's ZDD manager reference |
CDDManager< CCuddInterface & > | |
CDDManager< CCuddInterface > | |
CDDManager< Cudd & > | |
CDDManager< Cudd > | |
CDDManagerBase< CuddLikeManType, StorageType > | This specialization of the template class CDDManager gives an interface to Cudd-like ZDD manager (StorageType = CuddLikeManType) or a reference of the latter (StorageType = CuddLikeManType&) |
CDDOperation | Generic class containing decision diagram operations |
CDDOperations< DDType, MonomType > | |
CDegreeArgumentCache< TagType, DDType > | |
CDegreeCache< TagType, DDType > | |
CDegStackBase | |
CDegStackBase< NavigatorType, invalid_tag, BlockProperty, BaseType > | |
CDegStackBase< NavigatorType, valid_tag, BlockProperty, BaseType > | |
CDegStackCore< NavigatorType, invalid_tag, Category, BaseType > | For pure degree stacks |
CDegStackCore< NavigatorType, valid_tag, Category, BaseType > | For block stacks |
CDegTermStack< NavigatorType, DescendingProperty, BlockProperty, BaseType > | |
CDelayedTermIter< TermType, AppendOp, TerminalValueOp, DegIterBase > | This class defines extend a given PolyBoRi degree iterator |
CDynamicOrder< OrderType > | This class initialize the interface for orderings of CDynamicOrderBase |
CDynamicOrderBase | This class initialize the interface for runtime-switchable orderings |
polybori::CErrorEnums | This struct contains type definitions and enumerations to be used for error codes |
CErrorInfo | |
CExpGenerator< ExpType > | |
CExpIter< NaviType, ExpType > | |
CGenericIter< OrderType, NaviType, RefType > | |
CGenericIter< OrderType, NaviType, BooleMonomial > | |
CGenericOrderedIter< OrderType, NavigatorType, MonomType > | |
CGenericOrderedIter< OrderType, NavigatorType, BooleExponent > | |
ChainCriterion | Assumes that divisibility condition is fullfilled |
ChainVariableCriterion | |
change | Accessing .change() |
polybori::change_assign< RhsType, LhsType > | Accessing .changeAssign() |
polybori::change_assign< void, pbori_traits< void >::idx_type > | |
polybori::change_idx< RhsType, LhsType > | |
CIdxPath< IdxType, SeparatorType > | This template class defines a storage type for monomial indices and customizable "pretty" printing |
CIdxVariable< IdxType, VarNameLit, VarHeadLit, VarTailLit > | This template class defines a storage type for one monomial index and customizable "pretty" printing |
CIndexCacheHandle< NaviType > | |
CIndexHandle< NaviType > | This class defines an uses an navigator-like type for storing integer values from 0 upto nmax (number of currently active ring variables) |
CLiteralCodes | This template class defines enumerative codes for the string literals defined by the CStringLiterals class |
CommutativeCacheManager< CacheType > | |
polybori::constant_binder1st< BinaryFunction, ConstantOp > | |
polybori::constant_binder2nd< BinaryFunction, ConstantOp > | |
polybori::constant_binder_base< BindType, BinaryFunction, ValueType, ConstantOp > | |
CCacheTypes::contained_deg2 | |
CCacheTypes::contained_variables | |
COrderBase | This class defines ordering related functions |
COrderedIter< NavigatorType, MonomType > | |
polybori::COrderEnums | This struct contains type definitions and enumerations to be used for order codes |
COrderProperties< OrderType > | This class determins ordering dependent properties |
count_tags< CCacheTypes::divisorsof_fixedpath > | |
count_tags< CCacheTypes::has_factor_x_plus_y > | |
count_tags< CCacheTypes::left_equals_right_x_branch_and_r_has_fac_x > | |
count_tags< CCacheTypes::testwise_ternary > | |
CPrintOperation< ValueType, LiteralType, StreamType > | This template prints a string literal to stream as operation |
CRestrictedIter< Iterator, RestrictOp, IsValidTest > | |
CStackSelector< OrderType, NaviType, BaseType > | |
CStringLiteral< LitCode > | This template class defines string literals corresponding to the codes enumerated in the class CLiteralCodes |
CTermGenerator< TermType > | |
CTermGenerator< BooleMonomial > | |
CTermGeneratorBase | |
CTermGeneratorBase< TermType, type_tag< BooleExponent > > | |
CTermGeneratorBase< TermType, type_tag< BooleMonomial > > | |
CTermGeneratorBase< TermType, type_tag< CTypes::deg_type > > | |
CTermGeneratorBase< TermType, type_tag< CTypes::size_type > > | |
CTermIter< StackType, TermGeneratorType > | This class defines an iterator for the monomials in a Boolean polynomial |
CTermStack< NavigatorType, Category, BaseType > | This class defines an iterator for the monomials in a Boolean polynomial |
CTermStackBase< NavigatorType, BaseType > | This class defines an iterator for the monomials in a Boolean polynomial |
polybori::CTypes | This struct contains type definitions to be used in library classes |
polybori::cudd_error_traits< ErrorNumber > | |
cudd_tag_number< Counted, Offset > | |
CVariableIter< Iterator, VariableType > | This template class defines an iterator for monomial types |
CVariableNames | |
CWrappedStack< StackType > | |
polybori::dd_add_assign< DDType > | Defines addition operation with assignment for decision diagrams |
dd_operations< CTypes::dd_type::navigator > | |
polybori::default_binder1st< BinaryFunction > | |
polybori::default_binder2nd< BinaryFunction > | |
polybori::default_binder_base< BindType, BinaryFunction, ValueType > | |
polybori::default_value< ValueType > | |
DegLexOrder | This class defines ordering related functions |
polybori::groebner::DegOrderHelper | |
CCacheTypes::degree | |
DegRevLexAscOrder | This class defines ordering related functions |
generic_hash_tags::dek_tag | |
CCacheTypes::divide | |
CCacheTypes::divisorsof | |
CCacheTypes::divisorsof_fixedpath | |
generic_hash_tags::djb_tag | |
CCacheTypes::dlex_lead | |
dlex_tag | Marker for deg-lex ordering |
CCacheTypes::dp_asc_lead | |
dp_asc_tag | Marker for ascending deg-rev-lex ordering |
polybori::dummy_data_type< DummyType > | |
polybori::dummy_iterator | An iterator which virtually does nothing |
easy_equality_property | Defines generic base for properties |
generic_hash_tags::elf_tag | |
polybori::EliminationDegreeAdder< ExponentVectorType > | |
polybori::equality_property< ValidityTag > | |
CCacheTypes::exist_abstract | |
polybori::groebner::GBTypes | |
polybori::generate_index_map< Type > | |
generic_hash< VectorType, HashType, AlgTag, BitMask > | |
generic_hash_tags | |
generic_sequence_hash< Iterator, HashType, AlgTag, BitMask > | |
get_base | Declaration, which can be used to define base classes for inheritance of classes in advance |
polybori::get_node< DDType > | |
CCacheTypes::graded_part | |
GroebnerStrategy | |
handle_else< NavigatorType > | |
polybori::handle_error< ErrorNumber > | |
polybori::handle_error< 0 > | |
CCacheTypes::has_factor_x | |
CCacheTypes::has_factor_x_plus_one | |
CCacheTypes::has_factor_x_plus_y | |
polybori::hashes< Type > | |
HasTRepOrExtendedProductCriterion | |
polybori::groebner::IJPairData | |
CCacheTypes::include_divisors | |
increment_count_tags< BaseTag > | |
insert | Accessing .insert() |
polybori::insert_assign< RhsType, LhsType > | Accessing .insertAssign() |
polybori::insert_assign< void, pbori_traits< void >::idx_type > | |
polybori::insert_second_to_list< ListType, RhsType, LhsType > | Insert second argument to a given list |
polybori::inserts< RhsType, LhsType > | Accessing .insert() |
polybori::inserts< void, pbori_traits< void >::idx_type > | |
polybori::integral_constant< IntType, INTCONST, ResultType > | Integral_constant<int_type, NUM>()() returns NUM of int_type, instead of possibly arguments. integral_constant<int_type, NUM, other_type>()() returns conversion of NUM of int_type to other_type |
polybori::internal_tag | This class marks an internal part of a procedure |
CCacheTypes::interpolate | |
CCacheTypes::interpolate_smallest_lex | |
polybori::invalid_tag | This class shows, whether a property of an order is invalid |
CCacheTypes::is_rewriteable | |
polybori::is_same_type< Type1, Type2 > | This class tests whether two types equal |
polybori::is_same_type< Type, Type > | |
polybori::groebner::IsEcart0Predicate | |
iterator_facade | |
generic_hash_tags::js_tag | |
CCacheTypes::left_equals_right_x_branch_and_r_has_fac_x | |
LessCombinedManySizesInStrat | |
LessEcartThenLessWeightedLengthInStrat | |
LessUsedTailVariablesThenLessWeightedLengthInStrat | |
LessWeightedLengthInStrat | |
LessWeightedLengthInStratModified | |
polybori::lex_compare_predicate< LhsType, RhsType, BinaryPredicate > | Defines lexicographic comparison functor |
lex_tag | Marker for lex ordering |
polybori::groebner::LexBucket | |
polybori::groebner::LexHelper | |
LexOrder | This class defines ordering related functions |
polybori::groebner::LexOrderGreaterComparer | |
polybori::groebner::LiteralFactorization | |
CCacheTypes::ll_red_nf | |
polybori::lm_hashes< Type > | |
polybori::groebner::LMLessCompare | |
polybori::groebner::LMLessComparePS | |
polybori::manager_traits< CuddLike > | |
polybori::manager_traits< Cudd * > | |
polybori::manager_traits< Cudd > | |
polybori::manager_traits< DdManager * > | |
CCacheTypes::map_every_x_to_x_plus_one | |
polybori::mapped_new_node< MapType, VariableType, TermType, NodeType > | |
CCacheTypes::mapping | |
polybori::maximum_iteration< ValueType > | Returns maximun of given argument and previous calls |
polybori::mgrcore_traits< Cudd > | |
CCacheTypes::minimal_elements | |
CCacheTypes::minimal_mod | |
CCacheTypes::mod_varset | |
MonomialHasher | |
CCacheTypes::multiplesof | |
CCacheTypes::multiply_recursive | |
polybori::navigates< DDType > | |
polybori::navigator_tag | For iterator_category |
CCacheTypes::no_cache | |
CCacheTypes::no_cache_tag | |
NoData | |
polybori::on_same_type< Type1, Type2, ThenType, ElseType > | This class switches betweem two types, depending on equality of types |
polybori::on_same_type< Type, Type, ThenType, ElseType > | |
order_traits< OrderType > | |
polybori::groebner::PairData | |
polybori::groebner::PairE | |
polybori::groebner::PairECompare | |
polybori::groebner::PairLS | |
polybori::groebner::PairLSCompare | |
PairManager | |
PairStatusSet | |
pbori_base< CCacheManBase< CCuddInterface, CacheType, ArgumentLength > > | |
pbori_base< CCacheManBase< Cudd, CacheType, ArgumentLength > > | |
pbori_base< CExpIter< NaviType, ExpType > > | |
pbori_base< CGenericIter< OrderType, NaviType, RefType > > | |
polybori::pbori_binary_traits< FirstType, SecondType > | This class contains property definitions related to two types to be used in polybori classes |
polybori::pbori_binary_traits< OnlyType, OnlyType > | |
pbori_hash | For information on hashes, see http://www.partow.net/programming/hashfunctions/ We did not use his implementation, because it is CPLed, but all algorithms used here are prior arts (published before Arash Partow) |
polybori::pbori_traits< ValueType > | This class contains property definitions to be used in polybori classes |
polybori::pbori_traits< dummy_iterator > | |
polybori::pbori_traits< int > | |
polybori::pbori_traits< long int > | |
polybori::pbori_traits< std::set< ValueType > > | |
polybori::pbori_traits< std::vector< ValueType > > | |
polybori::pbori_traits< unsigned int > | |
polybori::pbori_traits< void > | |
polybori::PBoRiError | This class is used for polybori's exception handling |
polybori::PBoRiGenericError< ErrorCode > | This template class is used for polybori's exception handling |
polybori::PBoRiOutIter< DataType, RhsType, BinOp > | This template class defines an output iterator which interprets assignments of indices as a change of given data wrt. a given binary operation |
generic_hash_tags::pjw_tag | |
CCacheTypes::plug_1 | |
polybori::groebner::PolyEntry | |
polybori::groebner::PolynomialSugar | |
polybori::groebner::PolyPairData | |
project_ith | Project to the second of all given arguments |
project_ith | Is the identity functional or projection to first argument |
project_ith | Project to the third of all given arguments |
project_ith | Virtually does nothing with the given arguments |
polybori::project_ith< 0, NLEN > | |
polybori::project_ith< 1, NLEN > | |
polybori::project_ith< 2, NLEN > | |
polybori::project_ith< 3, NLEN > | |
property_owner | Defines generic base for properties |
polybori::groebner::PSCompareByEl | |
polybori::push_back< ListType, ValueType > | Accessing .push_back() |
polybori::remove_assign< RhsType, LhsType > | Accessing .removeAssign() |
polybori::remove_assign< void, pbori_traits< void >::idx_type > | |
polybori::removes< RhsType, LhsType > | Accessing .remove() |
polybori::removes< void, pbori_traits< void >::idx_type > | |
reversed_iteration | Interchanges operator++ and operator-- of a given iterator |
polybori::reversed_iteration_adaptor< BiIterator > | |
generic_hash_tags::sdbm_tag | |
SetBitUInt | |
ShorterEliminationLength | |
ShorterEliminationLengthModified | |
simple_identity | |
simple_increment | |
generic_hash_tags::simple_tag | |
polybori::sizes_less< ListType > | A functional for size comparisons |
polybori::groebner::SlimgbReduction< variant > | |
polybori::subset0_assign< RhsType, LhsType > | Accessing .subset1Assign() |
polybori::subset1_assign< RhsType, LhsType > | Accessing .subset1Assign() |
polybori::symmetric_composition< BinaryOp, UnaryOperation > | Compose a binary function with a default constructable unary function for both arguments |
CCacheTypes::ternary_cache_tag | |
CCacheTypes::testwise_ternary | |
polybori::times_indexed_var< DDType, IdxType > | Defines multiplication operation with the idx-th variable |
polybori::type_tag< Type > | This class marks a given type |
CCacheTypes::unary_cache_tag | |
CCacheTypes::union_xor | |
polybori::unite_assign< RhsType, LhsType > | Accessing .uniteAssign() |
CCacheTypes::used_variables | |
polybori::valid_tag | This class shows, whether a property of an order is valid |
polybori::variable_name< ManagerType, IdxType, VarNameType > | Defines generic access to variable names |
polybori::groebner::VariablePairData | |
polybori::zdd_traits< CCuddZDD > | |
polybori::zdd_traits< ZDD > | |
ZeroFunction | |
CCacheTypes::zeros | |