<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>PolyBoRi: Todo List</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li class="current"><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1><a class="anchor" name="todo">Todo List </a></h1><a class="anchor" name="_todo000001"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1BooleMonomial.html#7f8db3627c0fcdb60bafe6e6f25bfc3a">polybori::BooleMonomial::deg</a> () const </dt>
<dd>optimal, if stored, else much too complicated, as it will probably use cache lookups </dd>
</dl>
<p>
<a class="anchor" name="_todo000002"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1BoolePolynomial.html#3b8240639fafff00bcd61e0696207041">polybori::BoolePolynomial::monom_type</a> </dt>
<dd>A more sophisticated treatment for monomials is needed. </dd>
</dl>
<p>
<a class="anchor" name="_todo000013"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1BoolePolynomial.html#7314af89d9bb81dd3a1d6758c43b99e0">polybori::BoolePolynomial::deg</a> () const </dt>
<dd>: This is currently just brute force + caching, more efficient search may be needed. </dd>
</dl>
<p>
<a class="anchor" name="_todo000004"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1BooleSet.html#d1cb5c78fb852256d68fd8877ce2cfe1">polybori::BooleSet::subset0Assign</a> (idx_type idx) </dt>
<dd>Do we really nee the assign variante here at high level? </dd>
</dl>
<p>
<a class="anchor" name="_todo000003"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1BooleSet.html#c8925578ba356d31d257a040e917b06a">polybori::BooleSet::BooleSet</a> (navigator navi, const ring_type &ring) </dt>
<dd>temporarily deactivated, as it slow downs procedures like term_accumulate, needs check, what happens to inlinings etc. in this case </dd>
</dl>
<p>
<a class="anchor" name="_todo000005"></a> <dl>
<dt>Class <a class="el" href="classpolybori_1_1CDDInterface.html">polybori::CDDInterface< CuddLikeZDD ></a> </dt>
<dd>Generalize it </dd>
</dl>
<p>
<a class="anchor" name="_todo000006"></a> <dl>
<dt>Class <a class="el" href="classpolybori_1_1CDDManagerBase.html">polybori::CDDManagerBase< CuddLikeManType, StorageType ></a> </dt>
<dd>This may need clean up and/or generalization </dd>
</dl>
<p>
<a class="anchor" name="_todo000018"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1groebner_1_1ChainCriterion.html#9cf3e33da0390995b0096c2706c13b11">polybori::groebner::ChainCriterion::strat</a> </dt>
<dd>: connect via vars </dd>
</dl>
<p>
<a class="anchor" name="_todo000016"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1groebner_1_1GroebnerStrategy.html#2c903085439bbea28330820673fa1bca">polybori::groebner::GroebnerStrategy::propagate_step</a> (const PolyEntry &e, std::set< int > others) </dt>
<dd>: should take the one with smallest lm </dd>
</dl>
<p>
<a class="anchor" name="_todo000019"></a> <dl>
<dt>Class <a class="el" href="classpolybori_1_1groebner_1_1LessWeightedLengthInStratModified.html">polybori::groebner::LessWeightedLengthInStratModified</a> </dt>
<dd>: in many cases, indices should be precalculated </dd>
</dl>
<p>
<a class="anchor" name="_todo000025"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1groebner_1_1PairECompare.html#7f00113cb4f2b6c82350a747aac6aaef">polybori::groebner::PairECompare::operator()</a> (const PairE &l, const PairE &r) </dt>
<dd>lm comparison </dd>
</dl>
<p>
<a class="anchor" name="_todo000024"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1groebner_1_1PairLSCompare.html#76d72f7d5cc9bf1d27cb9aaa690e6475">polybori::groebner::PairLSCompare::operator()</a> (const PairLS &l, const PairLS &r) </dt>
<dd>lm comparison </dd>
</dl>
<p>
<a class="anchor" name="_todo000015"></a> <dl>
<dt>Member <a class="el" href="classpolybori_1_1groebner_1_1PairManager.html#7e9c6246f309fb4de103f49e99095463">polybori::groebner::PairManager::cleanTopByChainCriterion</a> () </dt>
<dd>implement this </dd>
</dl>
<p>
<a class="anchor" name="_todo000007"></a> <dl>
<dt>File <a class="el" href="generic__hash_8h.html">generic_hash.h</a> </dt>
<dd>Check which algorithms are really useful for us, maybe these are public domain anyway.<p>
</dd>
</dl>
<p>
<a class="anchor" name="_todo000023"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori_1_1groebner.html#6906a6e027060fb221852fa7ad2c7ca8">polybori::groebner::add_up_monomials</a> (const std::vector< Monomial > &vec) </dt>
<dd>activate and make save, when used </dd>
</dl>
<p>
<a class="anchor" name="_todo000009"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori.html#220b46f13d6e432df1cd40432dddbabb">polybori::cudd_generate_divisors</a> (const ManagerType &mgr, ReverseIterator start, ReverseIterator finish) </dt>
<dd>Next line needs generalization </dd>
</dl>
<p>
<a class="anchor" name="_todo000008"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori.html#704e9319a84420bbfed328e77d3ee460">polybori::get_mgr_core</a> (const CCuddInterface &mgr) </dt>
<dd>merge with extract_manager </dd>
</dl>
<p>
<a class="anchor" name="_todo000010"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori.html#e49cee209098fb6dd51dbd9f5af13c21">polybori::pboriCuddZddUnionXor</a> (MgrType zdd, NodeType P, NodeType Q) </dt>
<dd>This is still Cudd-like style, should be rewritten with PolyBoRi's cache wrapper, which would the dependency on cuddInt.h </dd>
</dl>
<p>
<a class="anchor" name="_todo000011"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori.html#7bc1eb21cf1b279d6e84f83e71b1df26">polybori::lower_term_accumulate</a> (NaviType navi, LowerIterator lstart, LowerIterator lfinish, ValueType init) </dt>
<dd>Maybe recursive caching is efficient here. </dd>
</dl>
<p>
<a class="anchor" name="_todo000012"></a> <dl>
<dt>Member <a class="el" href="namespacepolybori.html#f09e5c66739e9dcc9918291a334e9b59">polybori::term_accumulate</a> (InputIterator first, InputIterator last, ValueType init) </dt>
<dd>: check correct manager </dd>
</dl>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Sep 9 14:31:00 2009 for PolyBoRi by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
a24e1a39141f9b4ca49bd1e2e23a54ba
>
files
>
1025
