11 template<
typename PolynomialGetter>
14 const PolynomialGetter*
mPG;
18 bool operator()(std::size_t lhs, std::size_t rhs)
const {
25 template<
typename PolynomialGetter>
31 std::set<std::size_t, PolynomialComparator<PolynomialGetter>>
mQueue;
auto insert(std::size_t id)
std::set< std::size_t, PolynomialComparator< PolynomialGetter > > mQueue
friend std::ostream & operator<<(std::ostream &os, const PolynomialLiftingQueue< PG > &plq)
void disable(std::size_t id)
void restore(std::size_t id)
PolynomialLiftingQueue(const PolynomialGetter *pg, std::size_t level)
auto erase(std::size_t id)
PolynomialComparator< PolynomialGetter > mComparator
std::ostream & operator<<(std::ostream &os, const SampleIteratorQueue< I, C > &siq)
carl::UnivariatePolynomial< Poly > UPoly
Class to create the formulas for axioms.
PolynomialComparator(const PolynomialGetter *pg, std::size_t level)
const PolynomialGetter * mPG
bool operator()(std::size_t lhs, std::size_t rhs) const