SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
smtrat::cad::PolynomialLiftingQueue< PolynomialGetter > Class Template Reference

#include <PolynomialLiftingQueue.h>

Inheritance diagram for smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >:
Collaboration diagram for smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >:

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)
 

Detailed Description

template<typename PolynomialGetter>
class smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >

Definition at line 26 of file PolynomialLiftingQueue.h.

Constructor & Destructor Documentation

◆ PolynomialLiftingQueue()

template<typename PolynomialGetter >
smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::PolynomialLiftingQueue ( const PolynomialGetter *  pg,
std::size_t  level 
)
inline

Definition at line 34 of file PolynomialLiftingQueue.h.

Member Function Documentation

◆ begin()

template<typename PolynomialGetter >
auto smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::begin ( ) const
inline

Definition at line 46 of file PolynomialLiftingQueue.h.

◆ disable()

template<typename PolynomialGetter >
void smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::disable ( std::size_t  id)
inline

Definition at line 56 of file PolynomialLiftingQueue.h.

Here is the call graph for this function:

◆ end()

template<typename PolynomialGetter >
auto smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::end ( ) const
inline

Definition at line 49 of file PolynomialLiftingQueue.h.

◆ erase()

template<typename PolynomialGetter >
auto smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::erase ( std::size_t  id)
inline

Definition at line 42 of file PolynomialLiftingQueue.h.

Here is the caller graph for this function:

◆ insert()

template<typename PolynomialGetter >
auto smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::insert ( std::size_t  id)
inline

Definition at line 39 of file PolynomialLiftingQueue.h.

Here is the caller graph for this function:

◆ restore()

template<typename PolynomialGetter >
void smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::restore ( std::size_t  id)
inline

Definition at line 60 of file PolynomialLiftingQueue.h.

Here is the call graph for this function:

◆ size()

template<typename PolynomialGetter >
auto smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::size ( ) const
inline

Definition at line 52 of file PolynomialLiftingQueue.h.

Friends And Related Function Documentation

◆ operator<<

template<typename PolynomialGetter >
template<typename PG >
std::ostream& operator<< ( std::ostream &  os,
const PolynomialLiftingQueue< PG > &  plq 
)
friend

Definition at line 69 of file PolynomialLiftingQueue.h.

Field Documentation

◆ mComparator

template<typename PolynomialGetter >
PolynomialComparator<PolynomialGetter> smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::mComparator
private

Definition at line 30 of file PolynomialLiftingQueue.h.

◆ mDisabled

template<typename PolynomialGetter >
carl::Bitset smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::mDisabled
private

Definition at line 32 of file PolynomialLiftingQueue.h.

◆ mQueue

template<typename PolynomialGetter >
std::set<std::size_t, PolynomialComparator<PolynomialGetter> > smtrat::cad::PolynomialLiftingQueue< PolynomialGetter >::mQueue
private

Definition at line 31 of file PolynomialLiftingQueue.h.


The documentation for this class was generated from the following file: