|
PolyBoRi
|
Namespaces | ||
| namespace | groebner | |
Classes | ||
| class | BlockDegLexOrder | |
| This class defines ordering related functions. More... | ||
| class | BlockDegRevLexAscOrder | |
| This class defines ordering related functions. More... | ||
| class | BooleConstant | |
| This class wraps a bool value, which was not converted to a boolean polynomial or monomial yet. More... | ||
| class | BooleEnv | |
| This class is just a wrapper accessing global structures. More... | ||
| class | BooleExponent | |
| This class is just a wrapper for using variables for storing indices as interim data structure for BooleMonomial. More... | ||
| class | BooleMonomial | |
This class is just a wrapper for using variables from cudd's decicion diagram. More... | ||
| class | BoolePolynomial | |
| This class wraps the underlying decicion diagram type and defines the necessary operations. More... | ||
| class | BoolePolyRing | |
| This class adds order-related functionality to BooleRing. More... | ||
| class | BooleSet | |
| class | BooleVariable | |
This class is just a wrapper for using variables from cudd's decicion diagram. More... | ||
| class | handle_else | |
| class | CCacheTypes | |
| struct | count_tags< CCacheTypes::divisorsof_fixedpath > | |
| struct | increment_count_tags | |
| class | count_tags< CCacheTypes::testwise_ternary > | |
| class | count_tags< CCacheTypes::left_equals_right_x_branch_and_r_has_fac_x > | |
| class | count_tags< CCacheTypes::has_factor_x_plus_y > | |
| class | cudd_tag_number | |
| class | CCuddLikeMgrStorage | |
| struct | pbori_base< CCacheManBase< Cudd, CacheType, ArgumentLength > > | |
| struct | pbori_base< CCacheManBase< CCuddInterface, CacheType, ArgumentLength > > | |
| class | CCacheManBase< ManagerType, CacheType, 0 > | |
| class | CCacheManBase< ManagerType, CacheType, 1 > | |
| class | CCacheManBase< ManagerType, CacheType, 2 > | |
| class | CCacheManBase< ManagerType, CacheType, 3 > | |
| class | CCacheManagement | |
| This template class forms the base for CCommutativeCacheManagement and CacheManager. It is an interface defining find and insert on decision diagram cache. More... | ||
| class | CCommutativeCacheManagement | |
| class | CCuddCore | |
| This class prepares the CUDD's raw decision diagram manager structure for the use with instrinsive pointers. More... | ||
| class | CCuddFirstIter | |
| This class defines an iterator over the first minimal term of a given ZDD node. More... | ||
| class | CCuddGetNode | |
| This class defines a functional, which generates a new decision * diagram node wrt. a given indes and two nodes. More... | ||
| class | CCuddLastIter | |
| This class defines an iterator over the last minimal term of a given ZDD node. More... | ||
| class | CCuddDDBase | |
This template class defines a C++ interface to CUDD's decision diagram structure. More... | ||
| class | CCuddZDD | |
This class defines a C++ interface to CUDD's zero-suppressed decision diagram structure. More... | ||
| class | CDDInterfaceBase | |
| This is the common base for the specialized template class CDDInterface. More... | ||
| class | CDDInterface | |
| class | CDDManagerBase | |
| 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&). More... | ||
| class | CDDManager< Cudd & > | |
| class | CDDManager< Cudd > | |
| class | CDDManager< CCuddInterface & > | |
| class | CDDManager< CCuddInterface > | |
| class | CDDOperations | |
| class | CIndexHandle | |
| This class defines an uses an navigator-like type for storing integer values from 0 upto nmax (number of currently active ring variables). More... | ||
| class | CIndexCacheHandle | |
| class | CDegreeCache | |
| class | CBlockDegreeCache | |
| class | CDegreeArgumentCache | |
| class | CDelayedTermIter | |
| This class defines extend a given PolyBoRi degree iterator. More... | ||
| class | CErrorInfo | |
| class | CExpGenerator | |
| struct | pbori_base< CExpIter< NaviType, ExpType > > | |
| class | CExpIter | |
| class | CIdxPath | |
| class | CLiteralCodes | |
| This template class defines enumerative codes for the string literals defined by the CStringLiterals class. More... | ||
| class | COrderProperties | |
| This class determins ordering dependent properties. More... | ||
| class | CPrintOperation | |
| This template prints a string literal to stream as operation. More... | ||
| class | CTermGeneratorBase< TermType, type_tag< BooleExponent > > | |
| class | CTermGeneratorBase< TermType, type_tag< CTypes::size_type > > | |
| class | CTermGenerator | |
| class | NoData | |
| class | CTermGeneratorBase< TermType, type_tag< BooleMonomial > > | |
| class | CTermGenerator< BooleMonomial > | |
| class | CVariableIter | |
| This template class defines an iterator for monomial types. More... | ||
| class | CVariableNames | |
| class | DegLexOrder | |
| This class defines ordering related functions. More... | ||
| class | DegRevLexAscOrder | |
| This class defines ordering related functions. More... | ||
| class | LexOrder | |
| This class defines ordering related functions. More... | ||
| class | lex_tag | |
| Marker for lex ordering. More... | ||
| class | dlex_tag | |
| Marker for deg-lex ordering. More... | ||
| class | dp_asc_tag | |
| Marker for ascending deg-rev-lex ordering. More... | ||
| class | block_dlex_tag | |
| Marker for block deg-lex ordering. More... | ||
| class | block_dp_asc_tag | |
| Marker for ascending block deg-rev-lex ordering. More... | ||
| class | order_traits | |
| class | dd_operations< CTypes::dd_type::navigator > | |
| class | COrderEnums | |
| This struct contains type definitions and enumerations to be used for order codes. More... | ||
| class | CErrorEnums | |
| This struct contains type definitions and enumerations to be used for error codes. More... | ||
| class | CCompareEnums | |
| This struct contains type definitions and enumerations to be used for comparisons. More... | ||
| class | CAuxTypes | |
| This struct contains auxiliary type definitions. More... | ||
| class | CTypes | |
| This struct contains type definitions to be used in library classes. More... | ||
| class | dummy_data_type | |
| class | generic_iteration< LexOrder, Iterator > | |
| class | generic_iteration< DegLexOrder, Iterator > | |
| class | generic_iteration< DegRevLexAscOrder, Iterator > | |
| class | bounded_restricted_term | |
| class | pbori_traits | |
| This class contains property definitions to be used in polybori classes. More... | ||
| class | pbori_traits< void > | |
| class | pbori_traits< int > | |
| class | pbori_traits< unsigned int > | |
| class | pbori_traits< long int > | |
| class | pbori_traits< std::set< ValueType > > | |
| class | pbori_traits< std::vector< ValueType > > | |
| class | pbori_binary_traits< OnlyType, OnlyType > | |
| class | pbori_binary_traits | |
| This class contains property definitions related to two types to be used in polybori classes. More... | ||
| struct | manager_traits< Cudd > | |
| struct | manager_traits< Cudd * > | |
| struct | manager_traits< DdManager * > | |
| struct | manager_traits | |
| struct | mgrcore_traits< Cudd > | |
| struct | zdd_traits< ZDD > | |
| struct | zdd_traits< CCuddZDD > | |
| struct | cudd_error_traits | |
| class | PBoRiError | |
| This class is used for polybori's exception handling. More... | ||
| class | PBoRiOutIter | |
| This template class defines an output iterator which interprets assignments of indices as a change of given data wrt. a given binary operation. More... | ||
| class | EliminationDegreeAdder | |
| class | AddEliminationDegree | |
Functions | ||
| CTypes::ostream_type & | operator<< (CTypes::ostream_type &os, const BooleConstant &rhs) | |
| Stream output operator. | ||
| template<class RHSType > | ||
| BooleExponent | operator+ (const BooleExponent &lhs, const RHSType &rhs) | |
| Multiplication of monomials. | ||
| template<class RHSType > | ||
| BooleExponent | operator- (const BooleExponent &lhs, const RHSType &rhs) | |
| Division of monomials. | ||
| BooleExponent::bool_type | operator< (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Less than comparision. | ||
| BooleExponent::bool_type | operator> (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Greater than comparision. | ||
| BooleExponent::bool_type | operator<= (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Less or equal than comparision. | ||
| BooleExponent::bool_type | operator>= (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Greater or equal than comparision. | ||
| BooleExponent | GCD (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Compute the greatest common divisor of two monomials. | ||
| BooleExponent | LCM (const BooleExponent &lhs, const BooleExponent &rhs) | |
| Compute the greatest common divisor of two monomials. | ||
| BooleExponent::ostream_type & | operator<< (BooleExponent::ostream_type &os, const BooleExponent &rhs) | |
| Stream output operator. | ||
| BooleMonomial | operator* (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Multiplication of monomials. | ||
| BooleMonomial | operator* (const BooleMonomial &lhs, const BooleVariable &rhs) | |
| Multiplication of monomials. | ||
| BoolePolynomial | operator* (const BooleMonomial &lhs, BooleConstant rhs) | |
| Multiplication of monomials. | ||
| BoolePolynomial | operator* (BooleConstant lhs, const BooleMonomial &rhs) | |
| Multiplication of monomials. | ||
| BooleMonomial | operator/ (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Division of monomials. | ||
| BooleMonomial | operator/ (const BooleMonomial &lhs, const BooleVariable &rhs) | |
| Division of monomials. | ||
| BooleMonomial::bool_type | operator< (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Less than comparision. | ||
| BooleMonomial::bool_type | operator> (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Greater than comparision. | ||
| BooleMonomial::bool_type | operator<= (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Less or equal than comparision. | ||
| BooleMonomial::bool_type | operator>= (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Greater or equal than comparision. | ||
| BooleMonomial | GCD (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Compute the greatest common divisor of two monomials. | ||
| BooleMonomial | LCM (const BooleMonomial &lhs, const BooleMonomial &rhs) | |
| Compute the greatest common divisor of two monomials. | ||
| BooleMonomial::bool_type | greater_variable (BooleMonomial::idx_type lhs, BooleMonomial::idx_type rhs) | |
| Checks whether BooleVariable(lhs) > BooleVariable(rhs) | ||
| BoolePolynomial | operator* (const BooleVariable &lhs, const BooleConstant &rhs) | |
| Multiplication of variables by a 0 or 1. | ||
| BoolePolynomial | operator* (const BooleConstant &lhs, const BooleVariable &rhs) | |
| Multiplication of 0 or 1 by a Variable. | ||
| BoolePolynomial | operator* (const BooleVariable &lhs, const BoolePolynomial &rhs) | |
| Multiplication of variables by a polynomial. | ||
| BooleMonomial | operator* (const BooleVariable &lhs, const BooleMonomial &rhs) | |
| Multiplication of variables by a monomial. | ||
| BoolePolynomial & | operator*= (BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Multiplication of a polynomial by a variable with assignment. | ||
| BooleMonomial | operator* (const BooleVariable &lhs, const BooleVariable &rhs) | |
| Multiplication of monomials by a polynomial. | ||
| BoolePolynomial | operator* (const BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Multiplication of a polynomial by a variable. | ||
| BoolePolynomial & | operator/= (BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Division of a polynomial by a variable (forcing monomial variant) | ||
| BoolePolynomial | operator/ (const BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Division of a polynomial by a variable (forcing monomial variant) | ||
| BoolePolynomial | operator% (const BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Remainder of division of a polynomial by a variable. | ||
| BoolePolynomial & | operator%= (BoolePolynomial &lhs, const BooleVariable &rhs) | |
| Remainder of division of a polynomial by a variable (with assignment) | ||
| BoolePolynomial | operator+ (const BoolePolynomial &lhs, const BoolePolynomial &rhs) | |
| Addition operation. | ||
| BoolePolynomial | operator+ (const BoolePolynomial &lhs, BooleConstant rhs) | |
| Addition operation. | ||
| BoolePolynomial | operator+ (BooleConstant lhs, const BoolePolynomial &rhs) | |
| Addition operation. | ||
| template<class RHSType > | ||
| BoolePolynomial | operator- (const BoolePolynomial &lhs, const RHSType &rhs) | |
| Subtraction operation. | ||
| BoolePolynomial | operator- (const BooleConstant &lhs, const BoolePolynomial &rhs) | |
| Subtraction operation with constant right-hand-side. | ||
| BoolePolynomial | operator* (const BoolePolynomial &lhs, const BoolePolynomial &rhs) | |
| BoolePolynomial | operator* (const BoolePolynomial &lhs, const BooleMonomial &rhs) | |
| BoolePolynomial | operator* (const BoolePolynomial &lhs, const BooleExponent &rhs) | |
| BoolePolynomial | operator* (const BoolePolynomial &lhs, const BooleConstant &rhs) | |
| BoolePolynomial | operator* (const BooleMonomial &lhs, const BoolePolynomial &rhs) | |
| BoolePolynomial | operator* (const BooleExponent &lhs, const BoolePolynomial &rhs) | |
| BoolePolynomial | operator* (const BooleConstant &lhs, const BoolePolynomial &rhs) | |
| template<class RHSType > | ||
| BoolePolynomial | operator/ (const BoolePolynomial &lhs, const RHSType &rhs) | |
| Division by monomial (skipping remainder) | ||
| template<class RHSType > | ||
| BoolePolynomial | operator% (const BoolePolynomial &lhs, const RHSType &rhs) | |
| Modulus monomial (division remainder) | ||
| BoolePolynomial::bool_type | operator== (BoolePolynomial::bool_type lhs, const BoolePolynomial &rhs) | |
| Equality check (with constant lhs) | ||
| BoolePolynomial::bool_type | operator!= (BoolePolynomial::bool_type lhs, const BoolePolynomial &rhs) | |
| Nonquality check (with constant lhs) | ||
| BoolePolynomial::ostream_type & | operator<< (BoolePolynomial::ostream_type &, const BoolePolynomial &) | |
| Stream output operator. | ||
| BooleSet::ostream_type & | operator<< (BooleSet::ostream_type &os, const BooleSet &bset) | |
| Stream output operator. | ||
| BoolePolynomial | operator/ (const BooleVariable &lhs, const BooleVariable &rhs) | |
| Cudd * | extract_manager (const Cudd &mgr) | |
| CCuddInterface::mgrcore_ptr | extract_manager (const CCuddInterface &mgr) | |
| template<class MgrType > | ||
| const MgrType & | extract_manager (const MgrType &mgr) | |
| Cudd & | get_manager (Cudd *mgr) | |
| template<class MgrType > | ||
| const MgrType & | get_manager (const MgrType &mgr) | |
| template<class DDType > | ||
| CDDInterface< DDType > ::ostream_type & | operator<< (typename CDDInterface< DDType >::ostream_type &os, const CDDInterface< DDType > &dd) | |
| Stream output operator. | ||
| ZDD | fetch_diagram (const Cudd &mgr, const ZDD &rhs) | |
| template<class MgrType , class DDType > | ||
| const DDType & | fetch_diagram (const MgrType &mgr, const DDType &rhs) | |
| Cudd & | fetch_manager (const Cudd &mgr) | |
| template<class MgrType > | ||
| const MgrType & | fetch_manager (const MgrType &mgr) | |
| template<class IdxType , class SeparatorType > | ||
| CIdxPath< IdxType, SeparatorType >::ostream_type & | operator<< (typename CIdxPath< IdxType, SeparatorType >::ostream_type &os, const CIdxPath< IdxType, SeparatorType > &storage) | |
| Stream output operator. | ||
| template<class NaviType , class TermType , class TernaryOperator , class TerminalOperator > | ||
| TermType | dd_backward_transform (NaviType navi, TermType init, TernaryOperator newNode, TerminalOperator terminate) | |
| Function templates for transforming decision diagrams. | ||
| template<class NaviType , class TermType , class OutIterator , class ThenBinaryOperator , class ElseBinaryOperator , class TerminalOperator > | ||
| OutIterator | dd_transform (NaviType navi, TermType init, OutIterator result, ThenBinaryOperator then_binop, ElseBinaryOperator else_binop, TerminalOperator terminate) | |
| Function templates for transforming decision diagrams. | ||
| template<class NaviType , class TermType , class OutIterator , class ThenBinaryOperator , class ElseBinaryOperator , class TerminalOperator , class FirstTermOp > | ||
| OutIterator | dd_transform (NaviType navi, TermType init, OutIterator result, ThenBinaryOperator then_binop, ElseBinaryOperator else_binop, TerminalOperator terminate, FirstTermOp terminate_first) | |
| template<class NaviType , class TermType , class OutIterator , class ThenBinaryOperator , class ElseBinaryOperator > | ||
| void | dd_transform (const NaviType &navi, const TermType &init, const OutIterator &result, const ThenBinaryOperator &then_binop, const ElseBinaryOperator &else_binop) | |
| Function templates for transforming decision diagrams. | ||
| template<class NaviType , class TermType , class OutIterator , class ThenBinaryOperator > | ||
| void | dd_transform (const NaviType &navi, const TermType &init, const OutIterator &result, const ThenBinaryOperator &then_binop) | |
| Function templates for transforming decision diagrams. | ||
| template<class InputIterator , class OutputIterator , class FirstFunction , class UnaryFunction > | ||
| OutputIterator | special_first_transform (InputIterator first, InputIterator last, OutputIterator result, UnaryFunction op, FirstFunction firstop) | |
| template<class InputIterator , class Intermediate , class OutputIterator > | ||
| OutputIterator | reversed_inter_copy (InputIterator start, InputIterator finish, Intermediate &inter, OutputIterator output) | |
| Function templates doing a reversed copy using intermediate storage. | ||
| template<class NaviType > | ||
| bool | dd_on_path (NaviType navi) | |
| template<class NaviType , class OrderedIterator > | ||
| bool | dd_owns_term_of_indices (NaviType navi, OrderedIterator start, OrderedIterator finish) | |
| template<class NaviType , class OrderedIterator , class NodeOperation > | ||
| NaviType | dd_intersect_some_index (NaviType navi, OrderedIterator start, OrderedIterator finish, NodeOperation newNode) | |
| template<class NaviType > | ||
| void | dd_print (NaviType navi) | |
| Function templates for debugging, prints dd indices and reference counts. | ||
| template<class IteratorType , class SizeType > | ||
| SizeType | limited_distance (IteratorType start, IteratorType finish, SizeType limit) | |
| template<class NaviType , class DDType > | ||
| DDType | dd_minimal_elements (NaviType navi, DDType dd, DDType &multiples) | |
| template<class MgrType > | ||
| const MgrType & | get_mgr_core (const MgrType &rhs) | |
| Cudd * | get_mgr_core (const Cudd &rhs) | |
| CCuddInterface::mgrcore_ptr | get_mgr_core (const CCuddInterface &mgr) | |
| template<class ManagerType , class ReverseIterator , class MultReverseIterator > | ||
| manager_traits< ManagerType > ::dd_base | cudd_generate_multiples (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish, MultReverseIterator multStart, MultReverseIterator multFinish) | |
| temporarily (needs to be more generic) | ||
| template<class ManagerType , class ReverseIterator > | ||
| manager_traits< ManagerType > ::dd_base | cudd_generate_divisors (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish) | |
| temporarily (needs to be more generic) | ||
| template<class Iterator , class SizeType > | ||
| Iterator | bounded_max_element (Iterator start, Iterator finish, SizeType bound) | |
| template<class LhsType , class RhsType , class BinaryPredicate > | ||
| CTypes::comp_type | generic_compare_3way (const LhsType &lhs, const RhsType &rhs, BinaryPredicate comp) | |
| defines lexicographic comparison for variable indices | ||
| template<class IteratorLike , class ForwardIteratorTag > | ||
| IteratorLike | increment_iteratorlike (IteratorLike iter, ForwardIteratorTag) | |
| template<class IteratorLike > | ||
| IteratorLike | increment_iteratorlike (IteratorLike iter, navigator_tag) | |
| template<class IteratorLike > | ||
| IteratorLike | increment_iteratorlike (IteratorLike iter) | |
| DdNode * | pboriCuddZddUnionXor__ (DdManager *, DdNode *, DdNode *) | |
| template<class MgrType , class NodeType > | ||
| NodeType | pboriCuddZddUnionXor (MgrType zdd, NodeType P, NodeType Q) | |
| template<class MgrType , class NodeType > | ||
| NodeType | pboriCudd_zddUnionXor (MgrType dd, NodeType P, NodeType Q) | |
| template<class NaviType > | ||
| bool | dd_is_singleton (NaviType navi) | |
| template<class NaviType , class BooleConstant > | ||
| BooleConstant | dd_pair_check (NaviType navi, BooleConstant allowSingleton) | |
| template<class NaviType > | ||
| bool | dd_is_singleton_or_pair (NaviType navi) | |
| template<class NaviType > | ||
| bool | dd_is_pair (NaviType navi) | |
| template<class SetType > | ||
| void | combine_sizes (const SetType &bset, double &init) | |
| template<class SetType > | ||
| void | combine_sizes (const SetType &bset, typename SetType::size_type &init) | |
| template<class SizeType , class IdxType , class NaviType , class SetType > | ||
| SizeType & | count_index (SizeType &size, IdxType idx, NaviType navi, const SetType &init) | |
| template<class SizeType , class IdxType , class SetType > | ||
| SizeType & | count_index (SizeType &size, IdxType idx, const SetType &bset) | |
| void | inc_ref (DdNode *node) | |
| template<class NaviType > | ||
| void | inc_ref (const NaviType &navi) | |
| void | dec_ref (DdNode *node) | |
| template<class NaviType > | ||
| void | dec_ref (const NaviType &navi) | |
| DdNode * | do_get_node (DdNode *node) | |
| template<class NaviType > | ||
| DdNode * | do_get_node (const NaviType &navi) | |
| template<class MgrType > | ||
| void | recursive_dec_ref (const MgrType &mgr, DdNode *node) | |
| template<class MgrType , class NaviType > | ||
| void | recursive_dec_ref (const MgrType &mgr, const NaviType &navi) | |
| template<class NaviType , class ReverseIterator , class DDOperations > | ||
| NaviType | indexed_term_multiples (NaviType navi, ReverseIterator idxStart, ReverseIterator idxFinish, const DDOperations &apply) | |
| template<class NaviType > | ||
| bool | is_reducible_by (NaviType first, NaviType second) | |
| template<class NaviType , class ReverseIterator , class DDOperations > | ||
| NaviType | minimal_of_two_terms (NaviType navi, NaviType &multiples, ReverseIterator idxStart, ReverseIterator idxFinish, const DDOperations &apply) | |
| template<class NaviType , class SizeType , class ReverseIterator , class DDOperations > | ||
| NaviType | prepend_multiples_wrt_indices (NaviType navi, SizeType minIdx, ReverseIterator start, ReverseIterator finish, const DDOperations &apply) | |
| template<class FunctionType , class ManagerType , class NodeType > | ||
| void | apply_assign_cudd_function (FunctionType func, ManagerType &mgr, NodeType &first, const NodeType &second) | |
| template<class FunctionType , class ManagerType , class ResultType , class NodeType > | ||
| void | apply_replacing_cudd_function (FunctionType func, ManagerType &mgr, ResultType &newNode, const NodeType &first, const NodeType &second) | |
| template<class FunctionType , class ManagerType , class NodeType > | ||
| NodeType | apply_cudd_function (FunctionType func, ManagerType &mgr, const NodeType &first, const NodeType &second) | |
| template<class NaviType , class DDType2 , class ReverseIterator , class DDOperations > | ||
| NaviType | dd_minimal_elements (NaviType navi, DDType2 &multiples, ReverseIterator idxStart, ReverseIterator idxEnd, const DDOperations &apply) | |
| BoolePolynomial | spoly (const BoolePolynomial &first, const BoolePolynomial &second) | |
| template<class NaviType , class LowerIterator , class ValueType > | ||
| ValueType | lower_term_accumulate (NaviType navi, LowerIterator lstart, LowerIterator lfinish, ValueType init) | |
| template<class UpperIterator , class NaviType , class ValueType > | ||
| ValueType | upper_term_accumulate (UpperIterator ustart, UpperIterator ufinish, NaviType navi, ValueType init) | |
| template<class UpperIterator , class NaviType , class LowerIterator , class ValueType > | ||
| ValueType | term_accumulate (UpperIterator ustart, UpperIterator ufinish, NaviType navi, LowerIterator lstart, LowerIterator lfinish, ValueType init) | |
| template<class InputIterator , class ValueType > | ||
| ValueType | term_accumulate (InputIterator first, InputIterator last, ValueType init) | |
| template<class CacheType , class NaviType , class SetType > | ||
| SetType | dd_mapping (const CacheType &cache, NaviType navi, NaviType map, SetType init) | |
| template<class PolyType , class MapType > | ||
| PolyType | apply_mapping (const PolyType &poly, const MapType &map) | |
| template<class MonomType , class PolyType > | ||
| PolyType | generate_mapping (MonomType &fromVars, MonomType &toVars, PolyType init) | |
| template<class PolyType , class MonomType > | ||
| PolyType | mapping (PolyType poly, MonomType fromVars, MonomType toVars) | |
| template<class ValueType > | ||
| void | pbori_shared_ptr_postclean (const boost::shared_ptr< ValueType > &, const boost::shared_ptr< ValueType > &) | |
| template<class DDType , class OutputType > | ||
| OutputType | dd_last_lexicographical_term (const DDType &dd, type_tag< OutputType >) | |
| Get last term (wrt. lexicographical order). | ||
| template<class HashType , class NaviType > | ||
| void | stable_hash_range (HashType &seed, NaviType navi) | |
| template<class NaviType > | ||
| std::size_t | stable_hash_range (NaviType navi) | |
| template<class HashType > | ||
| void | finalize_term_hash (HashType &seed) | |
| template<class HashType , class NaviType > | ||
| void | stable_first_hash_range (HashType &seed, NaviType navi) | |
| template<class NaviType > | ||
| std::size_t | stable_first_hash_range (NaviType navi) | |
| template<class HashType , class Iterator > | ||
| void | stable_term_hash (HashType &seed, Iterator start, Iterator finish) | |
| template<class Iterator > | ||
| std::size_t | stable_term_hash (Iterator start, Iterator finish) | |
| template<class Iterator > | ||
| Iterator::value_type | index_vector_hash (Iterator start, Iterator finish) | |
| template<class DegreeCacher , class NaviType > | ||
| NaviType::size_type | dd_cached_degree (const DegreeCacher &cache, NaviType navi) | |
| template<class DegreeCacher , class NaviType , class SizeType > | ||
| NaviType::size_type | dd_cached_degree (const DegreeCacher &cache, NaviType navi, SizeType bound) | |
| template<class Iterator , class NameGenerator , class Separator , class EmptySetType , class OStreamType > | ||
| void | dd_print_term (Iterator start, Iterator finish, const NameGenerator &get_name, const Separator &sep, const EmptySetType &emptyset, OStreamType &os) | |
| template<class TermType , class NameGenerator , class Separator , class EmptySetType , class OStreamType > | ||
| void | dd_print_term (const TermType &term, const NameGenerator &get_name, const Separator &sep, const EmptySetType &emptyset, OStreamType &os) | |
| template<class Iterator , class NameGenerator , class Separator , class InnerSeparator , class EmptySetType , class OStreamType > | ||
| void | dd_print_terms (Iterator start, Iterator finish, const NameGenerator &get_name, const Separator &sep, const InnerSeparator &innersep, const EmptySetType &emptyset, OStreamType &os) | |
| template<class CacheType , class NaviType , class PolyType > | ||
| PolyType | dd_multiply_recursively (const CacheType &cache_mgr, NaviType firstNavi, NaviType secondNavi, PolyType init) | |
| template<class CacheType , class NaviType , class PolyType , class MonomTag > | ||
| PolyType | dd_multiply_recursively (const CacheType &cache_mgr, NaviType monomNavi, NaviType navi, PolyType init, MonomTag monom_tag) | |
| template<class DDGenerator , class Iterator , class NaviType , class PolyType > | ||
| PolyType | dd_multiply_recursively_exp (const DDGenerator &ddgen, Iterator start, Iterator finish, NaviType navi, PolyType init) | |
| template<class DegCacheMgr , class NaviType , class SizeType > | ||
| bool | max_degree_on_then (const DegCacheMgr °_mgr, NaviType navi, SizeType degree, valid_tag is_descending) | |
| template<class DegCacheMgr , class NaviType , class SizeType > | ||
| bool | max_degree_on_then (const DegCacheMgr °_mgr, NaviType navi, SizeType degree, invalid_tag non_descending) | |
| template<class CacheType , class DegCacheMgr , class NaviType , class TermType , class SizeType , class DescendingProperty > | ||
| TermType | dd_recursive_degree_lead (const CacheType &cache_mgr, const DegCacheMgr °_mgr, NaviType navi, TermType init, SizeType degree, DescendingProperty prop) | |
| template<class CacheType , class DegCacheMgr , class NaviType , class TermType , class DescendingProperty > | ||
| TermType | dd_recursive_degree_lead (const CacheType &cache_mgr, const DegCacheMgr °_mgr, NaviType navi, TermType init, DescendingProperty prop) | |
| template<class CacheType , class DegCacheMgr , class NaviType , class TermType , class SizeType , class DescendingProperty > | ||
| TermType & | dd_recursive_degree_leadexp (const CacheType &cache_mgr, const DegCacheMgr °_mgr, NaviType navi, TermType &result, SizeType degree, DescendingProperty prop) | |
| template<class CacheType , class DegCacheMgr , class NaviType , class TermType , class DescendingProperty > | ||
| TermType & | dd_recursive_degree_leadexp (const CacheType &cache_mgr, const DegCacheMgr °_mgr, NaviType navi, TermType &result, DescendingProperty prop) | |
| template<class CacheType , class NaviType , class TermType > | ||
| TermType | dd_existential_abstraction (const CacheType &cache_mgr, NaviType varsNavi, NaviType navi, TermType init) | |
| template<class CacheType , class NaviType , class PolyType > | ||
| PolyType | dd_divide_recursively (const CacheType &cache_mgr, NaviType navi, NaviType monomNavi, PolyType init) | |
| template<class DDGenerator , class Iterator , class NaviType , class PolyType > | ||
| PolyType | dd_divide_recursively_exp (const DDGenerator &ddgen, NaviType navi, Iterator start, Iterator finish, PolyType init) | |
| template<class CacheType , class NaviType , class MonomType > | ||
| MonomType | cached_used_vars (const CacheType &cache, NaviType navi, MonomType lItemLeft" align="right" valign="top">MonomType | |