 polybori | |
  groebner | |
   CacheManager | |
   ChainCriterion | Assumes that divisibility condition is fullfilled |
   ChainVariableCriterion | |
   HasTRepOrExtendedProductCriterion | |
   SetBitUInt | |
   ZeroFunction | |
   ShorterEliminationLength | |
   ShorterEliminationLengthModified | |
   PairStatusSet | |
   PairManager | |
   MonomialHasher | |
   GroebnerStrategy | |
   LessWeightedLengthInStrat | |
   LessWeightedLengthInStratModified | |
   LessEcartThenLessWeightedLengthInStrat | |
   LessUsedTailVariablesThenLessWeightedLengthInStrat | |
   LessCombinedManySizesInStrat | |
   GBTypes | |
   LexBucket | |
   LiteralFactorization | |
   PolynomialSugar | |
   LMLessComparePS | |
   PSCompareByEl | |
   IsEcart0Predicate | |
   LexHelper | |
   DegOrderHelper | |
   BlockOrderHelper | |
   LexOrderGreaterComparer | |
   LMLessCompare | |
   SlimgbReduction | |
   PolyEntry | |
   PairData | |
   IJPairData | |
   PolyPairData | |
   VariablePairData | |
   PairLS | |
   PairE | |
   PairLSCompare | |
   PairECompare | |
  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 |
  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 |
  CacheManager | |
  CommutativeCacheManager | |
  handle_else | |
  CCacheTypes | |
   binary_cache_tag | |
   block_degree | |
   block_dlex_lead | |
   contained_deg2 | |
   contained_variables | |
   degree | |
   divide | |
   divisorsof | |
   divisorsof_fixedpath | |
   dlex_lead | |
   dp_asc_lead | |
   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 | |
   left_equals_right_x_branch_and_r_has_fac_x | |
   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< 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 | |
  pbori_base< CCacheManBase< Cudd, CacheType, ArgumentLength > > | |
  pbori_base< CCacheManBase< CCuddInterface, 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 | |
  CCuddCore | This class prepares the CUDD's raw decision diagram manager structure for the use with instrinsive pointers |
  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 |
  CCuddNavigator | This class defines an iterator for navigating through then and else branches of ZDDs |
  CCuddDDBase | This template class defines a C++ interface to CUDD's decision diagram structure |
  CCuddZDD | This class defines a C++ interface to CUDD's zero-suppressed decision diagram structure |
  CDDInterfaceBase | This is the common base for the specialized template class CDDInterface |
  CDDInterface | |
  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&) |
  CDDManager< Cudd & > | |
  CDDManager< Cudd > | |
  CDDManager< CCuddInterface & > | |
  CDDManager< CCuddInterface > | |
  CDDOperations | |
  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 | |
  CBlockDegreeCache | |
  CDegreeArgumentCache | |
  CDelayedTermIter | This class defines extend a given PolyBoRi degree iterator |
  CErrorInfo | |
  CExpGenerator | |
  pbori_base< CExpIter< NaviType, ExpType > > | |
  CExpIter | |
  CIdxPath | |
  CIdxVariable | |
  CLiteralCodes | This template class defines enumerative codes for the string literals defined by the CStringLiterals class |
  COrderProperties | This class determins ordering dependent properties |
  CPrintOperation | This template prints a string literal to stream as operation |
  CRestrictedIter | |
  CStringLiteral | This template class defines string literals corresponding to the codes enumerated in the class CLiteralCodes |
  CTermGeneratorBase< TermType, type_tag< BooleExponent > > | |
  CTermGeneratorBase< TermType, type_tag< CTypes::size_type > > | |
  CTermGenerator | |
  NoData | |
  CTermGeneratorBase< TermType, type_tag< BooleMonomial > > | |
  CTermGenerator< BooleMonomial > | |
  CTermIter | This class defines an iterator for the monomials in a Boolean polynomial |
  CVariableIter | This template class defines an iterator for monomial types |
  CVariableNames | |
  DegLexOrder | This class defines ordering related functions |
  DegRevLexAscOrder | This class defines ordering related functions |
  LexOrder | This class defines ordering related functions |
  lex_tag | Marker for lex ordering |
  dlex_tag | Marker for deg-lex ordering |
  dp_asc_tag | Marker for ascending deg-rev-lex ordering |
  block_dlex_tag | Marker for block deg-lex ordering |
  block_dp_asc_tag | Marker for ascending block deg-rev-lex ordering |
  order_traits | |
  dd_operations< CTypes::dd_type::navigator > | |
  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 |
  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 | |
  unite_assign | Accessing .uniteAssign() |
  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< Type, Type > | |
  is_same_type | This class tests whether two types equal |
  on_same_type< Type, Type, ThenType, ElseType > | |
  on_same_type | This class switches betweem two types, depending on equality of types |
  internal_tag | This class marks an internal part of a procedure |
  type_tag | This class marks a given type |
  hashes | |
  lm_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 | |
  get_node | |
  handle_error | |
  handle_error< 0 > | |
  dummy_data_type | |
  generic_iteration< LexOrder, Iterator > | |
  generic_iteration< DegLexOrder, Iterator > | |
  generic_iteration< DegRevLexAscOrder, Iterator > | |
  bounded_restricted_term | |
  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 |
  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< OnlyType, OnlyType > | |
  pbori_binary_traits | This class contains property definitions related to two types to be used in polybori classes |
  manager_traits< Cudd > | |
  manager_traits< Cudd * > | |
  manager_traits< DdManager * > | |
  manager_traits | |
  mgrcore_traits< Cudd > | |
  zdd_traits< ZDD > | |
  zdd_traits< CCuddZDD > | |
  cudd_error_traits | |
  PBoRiError | This class is used for polybori's exception handling |
  PBoRiGenericError | This template class is used for polybori's exception handling |
  PBoRiOutIter | This template class defines an output iterator which interprets assignments of indices as a change of given data wrt. a given binary operation |
  EliminationDegreeAdder | |
  AddEliminationDegree | |
 BinaryOp | |
 binder1st | |
 binder2nd | |
 CCacheManBase | This template forms the base for CCacheManagement. It implements routines for finding and inserting results into the cache |
 CDDManager | This specialization of the template class CDDManager gives an interface to Cudd's ZDD manager reference |
 CDDManager | This specialization of the template class CDDManager gives an interface to Cudd's ZDD manager |
 CDDManager | This specialization of the template class CDDManager gives an interface to CCuddInterface's ZDD manager reference |
 CDDManager | This specialization of the template class CDDManager gives an interface to CCuddInterface's ZDD manager |
 CDDOperation | Generic class containing decision diagram operations |
 change | Accessing .change() |
 changeAssign | Accessing .change(); variante using member templates |
 CIdxPath | This template class defines a storage type for monomial indices and customizable "pretty" printing |
 CIdxVariable | This template class defines a storage type for one monomial index and customizable "pretty" printing |
 easy_equality_property | Defines generic base for properties |
 generic_hash | |
 generic_hash_tags | |
  bkdr_tag | |
  dek_tag | |
  djb_tag | |
  elf_tag | |
  js_tag | |
  pjw_tag | |
  sdbm_tag | |
  simple_tag | |
 generic_sequence_hash | |
 get_base | Declaration, which can be used to define base classes for inheritance of classes in advance |
 insert | Accessing .insert() |
 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) |
 project_ith | Virtually does nothing with the given arguments |
 project_ith | Project to the third of all given arguments |
 project_ith | Is the identity functional or projection to first argument |
 project_ith | Project to the second of all given arguments |
 property_owner | Defines generic base for properties |
 reversed_iteration | Interchanges operator++ and operator– of a given iterator |
 simple_identity | |
 simple_increment | |