![]() |
SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <PolynomialLiftingQueue.h>


Public Member Functions | |
| PolynomialLiftingQueue (const PolynomialGetter *pg, std::size_t level) | |
| auto | insert (std::size_t id) |
| auto | erase (std::size_t id) |
| auto | begin () const |
| auto | end () const |
| auto | size () const |
| void | disable (std::size_t id) |
| void | restore (std::size_t id) |
Private Attributes | |
| PolynomialComparator< PolynomialGetter > | mComparator |
| std::set< std::size_t, PolynomialComparator< PolynomialGetter > > | mQueue |
| carl::Bitset | mDisabled |
Friends | |
| template<typename PG > | |
| std::ostream & | operator<< (std::ostream &os, const PolynomialLiftingQueue< PG > &plq) |
Definition at line 26 of file PolynomialLiftingQueue.h.
|
inline |
Definition at line 34 of file PolynomialLiftingQueue.h.
|
inline |
Definition at line 46 of file PolynomialLiftingQueue.h.
|
inline |
|
inline |
Definition at line 49 of file PolynomialLiftingQueue.h.
|
inline |
|
inline |
|
inline |
|
inline |
Definition at line 52 of file PolynomialLiftingQueue.h.
|
friend |
Definition at line 69 of file PolynomialLiftingQueue.h.
|
private |
Definition at line 30 of file PolynomialLiftingQueue.h.
|
private |
Definition at line 32 of file PolynomialLiftingQueue.h.
|
private |
Definition at line 31 of file PolynomialLiftingQueue.h.