Todo List

Member polybori::BoolePolynomial::deg () const
  : This is currently just brute force + caching, more efficient search may be needed.
Member polybori::BoolePolynomial::monom_type
  A more sophisticated treatment for monomials is needed.
Member polybori::CCuddDDFacade< RingType, DiagramType >::CCuddDDFacade (const self &from)
  NULL?
Member polybori::CCuddDDFacade< RingType, DiagramType >::cudd_generate_divisors (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish) const
  Next line needs generalization
Member polybori::cudd_generate_divisors (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish, type_tag< DDBase >)
  Next line needs generalization
Member polybori::cudd_generate_multiples (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish, MultReverseIterator multStart, MultReverseIterator multFinish, type_tag< DDBase >)
  merge with extract_manager
Member polybori::dd_recursive_degree_lead (const CacheType &cache_mgr, const DegCacheMgr &deg_mgr, NaviType navi, TermType init, SizeType degree, DescendingProperty prop)
  fix
Member polybori::DegLexOrder::lead (const poly_type &poly, deg_type bound) const
  : more accurate explanation (comments)
Member polybori::groebner::add_up_exponents (const std::vector< Exponent > &vec, const Polynomial &init)
  activate and make save, when used
Member polybori::groebner::ChainCriterion::strat
  : connect via vars
Member polybori::groebner::extended_product_criterion (const PolyEntry &m, const PolyEntry &m2)
  need GCDdeg
Class polybori::groebner::LessWeightedLengthInStratModified
  : in many cases, indices should be precalculated
Member polybori::groebner::PairECompare::operator() (const PairE &l, const PairE &r)
  lm comparison
Member polybori::groebner::PairLSCompare::operator() (const PairLS &l, const PairLS &r)
  lm comparison
Member polybori::groebner::PolyEntryIndices::insert (const PolyEntry &entry, const data_type &rhs)
  for some reason not inlinable
Member polybori::groebner::PolynomialSugar::eliminationLength () const
  optimize that using length optimization
Member polybori::groebner::ReductionStrategy::setupSetsForElement (const PolyEntry &entry)
  Check whether this is still the case! see: HeuristicQuickTestCase.test_mult6x6mit_lp HeuristicCryptoTestCase.test_ctc_Nr3_B7_n20joined_dp_asc
Member polybori::lower_term_accumulate (NaviType navi, LowerIterator lstart, LowerIterator lfinish, ValueType init)
  Maybe recursive caching is efficient here.
Member polybori::pboriCuddZddUnionXor (MgrType zdd, NodeType P, NodeType Q)
  This is still Cudd-like style, should be rewritten with PolyBoRi's cache wrapper, which would the dependency on PBORI_PREFIX(cuddInt.h)
Member polybori::term_accumulate (InputIterator first, InputIterator last, ValueType init)
  : check correct manager