 boost | |
  python | |
   converter | |
    object_manager_traits< polybori::dict > | |
    object_manager_traits< polybori::tuple > | |
    object_manager_traits< polybori::object > | |
 polybori | |
  groebner | |
   BitMask | This class defines a bit mask and related operations |
   BitMask< 0 > | |
   BitMask< sizeof(unsigned long)*8 > | |
   BlockOrderHelper | This class defines BlockOrderHelper |
   BoundedDivisorsOf | This class defines defines a function for computing a bounded variant of MononmialSet's divisorsOf |
   CacheManager | |
   ChainCriterion | This class defines ChainCriterion |
   ChainVariableCriterion | This class defines ChainVariableCriterion |
   CheckChainCriterion | This class defines CheckChainCriterion |
   CountCriterion | This class defines CountCriterion |
   DegOrderHelper | This class defines DegOrderHelper |
   ExpGreater | This class defines ExpGreater |
   ExpLexLess | This class defines ExpLexLess |
   FGLMStrategy | |
   GetNthPoly | |
   GBTypes | |
   GroebnerOptions | This class defines options settings for GroebnerStrategy |
   GroebnerStrategy | This class defines GroebnerStrategy |
   HasTRepOrExtendedProductCriterion | This class defines HasTRepOrExtendedProductCriterion |
   IJPairData | This class defines IJPairData |
   IsEcart0Predicate | This class defines IsEcart0Predicate |
   IsVariableOfIndex | |
   LargerDegreeComparer | This class defines LargerDegreeComparer |
   LeadingTerms | This class defines LeadingTerms |
   LeadingTerms00 | This class defines LeadingTerms00 |
   LeadingTerms11 | This class defines LeadingTerms11 |
   LessCombinedManySizesInStrat | This class defines LessCombinedManySizesInStrat |
   LessEcartThenLessWeightedLengthInStrat | This class defines LessEcartThenLessWeightedLengthInStrat |
   LessUsedTailVariablesThenLessWeightedLengthInStrat | This class defines LessUsedTailVariablesThenLessWeightedLengthInStrat |
   LessWeightedLengthInStrat | This class defines LessWeightedLengthInStrat |
   LessWeightedLengthInStratModified | This class defines LessWeightedLengthInStratModified |
   LexBucket | |
   LexHelper | This class defines LexHelper |
   LexOrderGreaterComparer | This class defines LexOrderGreaterComparer |
   LiteralFactorization | |
   LiteralFactorizationIterator | This class defines LiteralFactorizationIterator |
   LLReduction | This class defines LLReduction |
   LLReductor | This class defines LLReductor |
   LMLessCompare | This class defines LMLessCompare |
   LMLessComparePS | This class defines LMLessComparePS |
   Long64From32BitsPairBase | This class defines an auxiliary class for Long64From32BitsPair |
   Long64From32BitsPairBase< High, Low, 4 > | |
   Long64From32BitsPairBase< High, Low, 8 > | |
   Long64From32BitsPair | This class defines Long64From32BitsPair |
   MatrixMonomialOrderTables | This class defines MatrixMonomialOrderTables |
   MinimalLeadingTerms | This class defines MinimalLeadingTerms |
   MonomialHasher | This class defines MonomialHasher |
   MonomialPlusOneTerms | This class defines MonomialPlusOneTerms |
   MonomialTerms | This class defines MonomialTerms |
   NBitsUsed | This class defines NBitsUsed whose value attribute computes the actual number of used bits at compile time |
   NBitsUsed< 0 > | |
   NextSpoly | This class computes the next spoly for a generator pair |
   PairData | This class defines PairData |
   PairE | This class defines PairE |
   PairECompare | This class defines PairECompare |
   PairLS | This class defines PairLS |
   PairLSCompare | This class defines PairLSCompare |
   PairManager | This class defines PairManager |
   PairManagerWithStrategy | This class extends PairManager with a reference to a strategy |
   PairManagerFacade | This class defines a facade for a given Strategy, which |
   PairStatusSet | This class defines PairStatusSet |
   PolyEntry | This class defines PolyEntry |
   PolyEntryBase | This class defines the base of PolyEntry |
   PolyEntryIndices | This class defines PolyEntryIndices |
   PolyEntryPtrLmLess | This class compares pointers to PolyEntry by their leading monomials |
   PolyEntryReference | This class defines PolyEntryReference |
   PolyEntryVector | |
   PolyFromPolyEntry | This class defines an operator which extracts the Polynomial from a PolyEntry |
   PolyMonomialPairComparerLess | This class defines PolyMonomialPairComparerLess |
   PolyMonomialPairComparerLexLess | This class defines PolyMonomialPairComparerLexLess |
   PolynomialSugar | This class defines PolynomialSugar |
   PolyPairData | This class defines PolyPairData |
   PSCompareByEl | This class defines PSCompareByEl |
   PseudoLongLong | This class defines PseudoLongLong |
   PseudoLongProduct | This class defines a delayed product of longs and comparison with LongLong Constant |
   RankingVector | This class defines RankingVector |
   RedTailNth | |
   ReductionOptions | This class defines option values for the ReductionStrategy |
   ReductionStrategy | This class defines ReductionStrategy |
   ReductionTerms | This class defines term for ReductionStrategy |
   RelatedTerms | This class finds those terms in a given set which are related to given terms |
   RelatedTermsBase | This class deals as a base of RelatedTerns |
   SetAssociatedMinimal | This class set the attribute minimal of a given index to a valued selected by the template parameter Value |
   SetBitUInt | This class defines SetBitUInt |
   ShorterEliminationLength | This class defines ShorterEliminationLength |
   ShorterEliminationLengthModified | This class defines ShorterEliminationLengthModified |
   SlimgbReduction | This class defines SlimgbReduction |
   TermsFacade | This class defines TermsFacade |
   TimesConstantImplication | |
   TimesVariableSubstitution | |
   VariablePairData | This class defines VariablePairData |
   ZeroFunction | This class defines ZeroFunction |
   FGLMNoLinearCombinationException | |
  BlockDegLexOrder | This class defines ordering related functions |
  BlockDegRevLexAscOrder | This class defines ordering related functions |
  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 |
  CDDOperations | |
  BooleMonomial | This class is just a wrapper for using variables from cudd's decicion diagram |
  CIndirectIter | |
  COrderedIter | |
  CDelayedTermIter | |
  CGenericIter | |
  CExpIter | |
  BoolePolynomial | This class wraps the underlying decicion diagram type and defines the necessary operations |
  BoolePolyRing | This class reinterprets decicion diagram managers as Boolean polynomial rings, adds an ordering and variable names |
  CReverseIter | |
  BooleSet | |
  BooleSetSequence | This class converts a BooleSet to a sequence-like structure |
  BooleVariable | This class is just a wrapper for using variables from cudd's decicion diagram |
  CacheManager | |
  CommutativeCacheManager | |
  CCacheTypes | |
   binary_cache_tag | |
   block_degree | |
   contained_deg2 | |
   contained_variables | |
   degree | |
   divide | |
   divisorsof | |
   divisorsof_fixedpath | |
   exist_abstract | |
   graded_part | |
   has_factor_x | |
   has_factor_x_plus_one | |
   has_factor_x_plus_y | |
   include_divisors | |
   interpolate | |
   interpolate_smallest_lex | |
   is_rewriteable | |
   lead_tag | |
   left_equals_right_x_branch_and_r_has_fac_x | |
   lex_lead | |
   ll_red_nf | |
   map_every_x_to_x_plus_one | |
   mapping | |
   minimal_elements | |
   minimal_mod | |
   mod_varset | |
   multiplesof | |
   multiply_recursive | |
   no_cache | |
   no_cache_tag | |
   plug_1 | |
   ternary_cache_tag | |
   testwise_ternary | |
   unary_cache_tag | |
   union_xor | |
   used_variables | |
   zeros | |
  count_tags | |
  count_tags< CCacheTypes::divisorsof_fixedpath > | |
  increment_count_tags | |
  count_tags< CCacheTypes::testwise_ternary > | |
  count_tags< CCacheTypes::left_equals_right_x_branch_and_r_has_fac_x > | |
  count_tags< CCacheTypes::has_factor_x_plus_y > | |
  cudd_tag_number | |
  CCuddLikeMgrStorage | |
  CCacheManBase | This template forms the base for CCacheManagement. It implements routines for finding and inserting results into the cache |
  pbori_base< CCacheManBase< CCuddInterface, CacheType, ArgumentLength > > | |
  pbori_base< CCacheManBase< BoolePolyRing, CacheType, ArgumentLength > > | |
  pbori_base< CCacheManBase< boost::intrusive_ptr< CCuddCore >, CacheType, ArgumentLength > > | |
  CCacheManBase< ManagerType, CacheType, 0 > | |
  CCacheManBase< ManagerType, CacheType, 1 > | |
  CCacheManBase< ManagerType, CacheType, 2 > | |
  CCacheManBase< ManagerType, CacheType, 3 > | |
  CCacheManagement | This template class forms the base for CCommutativeCacheManagement and CacheManager. It is an interface defining find and insert on decision diagram cache |
  CCommutativeCacheManagement | |
  CIndexHandle | This class defines an uses an navigator-like type for storing integer values from 0 upto nmax (number of currently active ring variables) |
  CIndexCacheHandle | |
  CDegreeCache | |
  CBoundedDegreeCache | |
  CBlockDegreeCache | |
  CDegreeArgumentCache | |
  CCheckedIdx | This class defines CCheckedIdx |
  CExtrusivePtr | This template class defines a reimplementation of the interface from boost:intrusive_ptr, but with an additional data field |
  CWeakPtr | Forward declaration of friend |
  CWeakPtrFacade | This class defines CWeakPtrFacade |
  invalid_tag | This class shows, whether a property of an order is invalid |
  valid_tag | This class shows, whether a property of an order is valid |
  invert_tag | Changes valid_tag -> invalid_tag and vice versa |
  invert_tag< valid_tag > | |
  invert_tag< invalid_tag > | |
  and_tag | And_tag<valid_tag, valid_tag> -> valid_tag, otherwise invalid_tag |
  and_tag< valid_tag, valid_tag > | |
  navigator_tag | For iterator_category |
  equality_property | |
  pbori_traits | This class contains property definitions to be used in polybori classes |
  pbori_traits< void > | |
  pbori_traits< int > | |
  pbori_traits< unsigned int > | |
  pbori_traits< long int > | |
  pbori_traits< std::set< ValueType > > | |
  pbori_traits< std::vector< ValueType > > | |
  pbori_binary_traits | This class contains property definitions related to two types to be used in polybori classes |
  pbori_binary_traits< OnlyType, OnlyType > | |
  manager_traits | |
  cudd_error_traits | |
  TransformedSequence | This class converts a sequence-like structure when iterating |
  DegLexOrder | This class defines ordering related functions |
  DegRevLexAscOrder | This class defines ordering related functions |
  CApplyNodeFacade | This template class defines a facade as a C++ interface for applying C-style functions to C-style structs, which represent decision diagrams. It is used to wrapp functions calls to raw pointers of the nodes and the context to an C++-style object |
  CCuddDDFacade | This template class defines a facade for decision diagrams |
  CNodeCounter | This class defines CNodeCounter |
  Interpreter | |
  DerefProxy | |
  dict | |
  tuple | |
  object | |
  CErrorInfo | |
  PBoRiError | This class is used for polybori's exception handling |
  PBoRiGenericError | This template class is used for polybori's exception handling |
  CFactoryBase | This base class CFactoryBase is used for currying other constructors with a BoolePolyRing |
  MonomialFactory | This base class MonomialFactory is used for currying monomial constructors with a BoolePolyRing |
  PolynomialFactory | This base class PolynomialFactory is used for currying polynomial constructors with a BoolePolyRing |
  SetFactory | This base class SetFactory is used for currying set constructors with a BoolePolyRing |
  VariableIndexException | |
  VariableBlock | This class defines a VariableBlock |
  VariableFactory | This base class VariableFactory is used for currying variable constructors with a BoolePolyRing |
  handle_else | |
  CCuddFirstIter | This class defines an iterator over the first minimal term of a given ZDD node |
  CCuddLastIter | This class defines an iterator over the last minimal term of a given ZDD node |
  CCuddNavigator | This class defines an iterator for navigating through then and else branches of ZDDs |
  CExpGenerator | |
  pbori_base< CExpIter< NaviType, ExpType > > | |
  pbori_base< CGenericIter< OrderType, NaviType, RefType > > | |
  pbori_base< CReverseIter< OrderType, NaviType, RefType > > | |
  CAbstractStackBase | |
  CWrappedStack | |
  CGenericOrderedIter | |
  CGenericOrderedIter< OrderType, NavigatorType, BooleExponent > | |
  CStackSelector | |
  CTermGeneratorBase__ | |
  CTermGeneratorBase__< TermType, type_tag< BooleExponent > > | |
  CTermGeneratorBase__< TermType, type_tag< CTypes::size_type > > | |
  CTermGeneratorBase__< TermType, type_tag< CTypes::deg_type > > | |
  CTermGeneratorBase__< TermType, type_tag< BooleMonomial > > | |
  CTermGeneratorBase | |
  CTermGenerator | |
  CTermGenerator< BooleMonomial > | |
  CTermIter | This class defines an iterator for the monomials in a Boolean polynomial |
  cached_deg | |
  cached_block_deg | |
  CTermStackBase | This class defines an iterator for the monomials in a Boolean polynomial |
  CTermStack | This class defines an iterator for the monomials in a Boolean polynomial |
  CReverseTermStack | This class defines an iterator for the monomials in a Boolean polynomial in reversed lexicographicxal order |
  CDegStackCore | |
  CDegStackCore< NavigatorType, invalid_tag, Category, BaseType > | For pure degree stacks |
  CDegStackCore< NavigatorType, valid_tag, Category, BaseType > | For block stacks |
  CDegStackBase | |
  CDegStackBase< NavigatorType, valid_tag, BlockProperty, BaseType > | |
  CDegStackBase< NavigatorType, invalid_tag, BlockProperty, BaseType > | |
  CDegTermStack | |
  CBlockTermStack | |
  CVariableIter | This template class defines an iterator for monomial types |
  PBoRiOutIter | This template class defines an output iterator which interprets assignments of indices as a change of given data wrt. a given binary operation |
  UnaryOperatorTraits | |
  UnaryOperatorTraits< ResultType(*)(ArgType)> | |
  TransformedIterator | This class defines the iterator of Trnasformed sequence |
  LexOrder | This class defines ordering related functions |
  CLiteralCodes | This template class defines enumerative codes for the string literals defined by the CStringLiterals class |
  CStringLiteral | This template class defines string literals corresponding to the codes enumerated in the class CLiteralCodes |
  CBlockOrderingFacade | This class implements block orderings for COrderingFacade. OrderType must inherit from COrderingFacade<OrderType> |
  COrderingBase | |
  COrderingFacade | This class initialize the interface for orderings of CDynamicOrderBase for a given OrderType. OrderType must inherit from COrderingFacade<OrderType> |
  COrderingTagsBase | |
  CDegreeOrderingTags | |
  CBlockDegreeOrderingTags | |
  COrderingTags | This tempalte class is base for classes which define ordering tags and properties |
  COrderingTags< lex_tag > | |
  COrderingTags< dlex_tag > | |
  COrderingTags< dp_asc_tag > | |
  COrderingTags< block_dlex_tag > | |
  COrderingTags< block_dp_asc_tag > | |
  lex_tag | Marker for lex ordering |
  dlex_tag | Marker for deg-lex ordering |
  dp_asc_tag | Marker for ascending deg-rev-lex ordering |
  block_tag | Marker for block orderings |
  order_traits_code | |
  order_traits_code< lex_tag > | |
  order_traits_code< dlex_tag > | |
  order_traits_code< dp_asc_tag > | |
  order_traits_code< block_dlex_tag > | |
  order_traits_code< block_dp_asc_tag > | |
  order_traits | |
  order_traits< block_tag< BaseOrderTag > > | |
  lex_compare_predicate | Defines lexicographic comparison functor |
  COrderEnums | This struct contains type definitions and enumerations to be used for order codes |
  CErrorEnums | This struct contains type definitions and enumerations to be used for error codes |
  CCompareEnums | This struct contains type definitions and enumerations to be used for comparisons |
  CAuxTypes | This struct contains auxiliary type definitions |
  CTypes | This struct contains type definitions to be used in library classes |
  CCallbackFacade | Variant for constant non-void member functions |
  CCallbackFacade< Type, void, ArgType > | Specialized variant for constant void member functions |
  CCallbackWrapper | This template class defines a functional, which wraps operator .*, which is the callback of a dynamic member function wrt. a given object |
  CCuddCore | This class prepares the CUDD's raw decision diagram manager structure for the use with instrinsive pointers |
  CCuddInterface | This class defines a C++ interface to CUDD's decicion diagram manager |
  CMemberFunctionTraits | This template class defines related types for member function pointer |
  CMemberFunctionTraitsBase | Axuiliary class |
  CMemberFunctionTraits< ResultType(Type::*)()> | |
  CMemberFunctionTraits< ResultType(Type::*)() const > | |
  CMemberFunctionTraits< ResultType(Type::*)(ArgType)> | |
  CMemberFunctionTraits< ResultType(Type::*)(ArgType) const > | |
  MemberFunctionOperator | |
  CVariableNames | |
  WeakRingPtr | This class defines WeakRingPtr |
  dd_operations | |
  dd_operations< CCuddNavigator > | |
  push_back | Accessing .push_back() |
  change_idx | |
  change_assign | Accessing .changeAssign() |
  change_assign< void, pbori_traits< void >::idx_type > | |
  subset1_assign | Accessing .subset1Assign() |
  subset0_assign | Accessing .subset1Assign() |
  unite_assign | Accessing .uniteAssign() |
  project_ith | Accessing ith of n arguments (ITH = 0 returns default value of first type) |
  project_ith< 0, NLEN > | |
  project_ith< 1, NLEN > | |
  project_ith< 2, NLEN > | |
  project_ith< 3, NLEN > | |
  dummy_iterator | An iterator which virtually does nothing |
  pbori_traits< dummy_iterator > | |
  integral_constant | 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 |
  binary_composition | Compose a binary function with two default constructable unary functions |
  symmetric_composition | Compose a binary function with a default constructable unary function for both arguments |
  maximum_iteration | Returns maximun of given argument and previous calls |
  dd_add_assign | Defines addition operation with assignment for decision diagrams |
  times_indexed_var | Defines multiplication operation with the idx-th variable |
  append_indexed_divisor | Defines multiplication (with assignment) with the idx-th variable |
  inserts | Accessing .insert() |
  inserts< void, pbori_traits< void >::idx_type > | |
  insert_assign | Accessing .insertAssign() |
  insert_assign< void, pbori_traits< void >::idx_type > | |
  removes | Accessing .remove() |
  removes< void, pbori_traits< void >::idx_type > | |
  remove_assign | Accessing .removeAssign() |
  remove_assign< void, pbori_traits< void >::idx_type > | |
  insert_second_to_list | Insert second argument to a given list |
  is_same_type | This class tests whether two types equal |
  is_same_type< Type, Type > | |
  is_valid | |
  on_same_type | This class switches betweem two types, depending on equality of types |
  on_same_type< Type, Type, ThenType, ElseType > | |
  internal_tag | This class marks an internal part of a procedure |
  type_tag | This class marks a given type |
  hashes | |
  generate_index_map | |
  sizes_less | A functional for size comparisons |
  reversed_iteration_adaptor | |
  navigates | |
  default_value | |
  constant_binder_base | |
  constant_binder2nd | |
  constant_binder1st | |
  default_binder_base | |
  default_binder2nd | |
  default_binder1st | |
  variable_name | Defines generic access to variable names |
  mapped_new_node | |
  pbori_base | |
  get_node | |
  generic_iteration | |
  dummy_data_type | |
  bounded_restricted_term | |
  EliminationDegreeAdder | |
  AddEliminationDegree | |
 CDDOperation | Generic class containing decision diagram operations |
 change | Accessing .change() |
 easy_equality_property | Defines generic base for properties |
 get_base | Declaration, which can be used to define base classes for inheritance of classes in advance |
 insert | Accessing .insert() |
 property_owner | Defines generic base for properties |
 reversed_iteration | Interchanges operator++ and operator– of a given iterator |