Todo List

Member BooleMonomial::deg () const
optimal, if stored, else much too complicated, as it will probably use cache lookups

Member BoolePolynomial::deg () const
: This is currently just brute force + caching, more efficient search may be needed.

Member BoolePolynomial::monom_type
A more sophisticated treatment for monomials is needed.

Member BooleSet::BooleSet (navigator navi, const ring_type &ring)
temporarily deactivated, as it slow downs procedures like term_accumulate, needs check, what happens to inlinings etc. in this case

Member BooleSet::subset0Assign (idx_type idx)
Do we really nee the assign variante here at high level?

Class CDDInterface< CuddLikeZDD >
Generalize it

Class CDDManagerBase< CuddLikeManType, StorageType >
This may need clean up and/or generalization

Member ChainCriterion::strat
: connect via vars

Member cudd_generate_divisors
Next line needs generalization

File generic_hash.h

Check which algorithms are really useful for us, maybe these are public domain anyway.

Member get_mgr_core
merge with extract_manager

Member GroebnerStrategy::propagate_step (const PolyEntry &e, std::set< int > others)
: should take the one with smallest lm

Class LessWeightedLengthInStratModified
: in many cases, indices should be precalculated

Member lower_term_accumulate
Maybe recursive caching is efficient here.

Member PairManager::cleanTopByChainCriterion ()
implement this

Member polybori::groebner::add_up_monomials (const std::vector< Monomial > &vec)
activate and make save, when used

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::PolynomialSugar::eliminationLength () const
optimize that using length optimization

Member term_accumulate
: check correct manager

Generated on 23 Dec 2009 for PolyBoRi by  doxygen 1.6.1