SMT-RAT  24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
Public Member Functions | Private Attributes
smtrat::cad::PolynomialComparator< PolynomialGetter > Struct Template Reference

#include <PolynomialLiftingQueue.h>

Public Member Functions

 PolynomialComparator (const PolynomialGetter *pg, std::size_t level)
 
bool operator() (std::size_t lhs, std::size_t rhs) const
 

Private Attributes

const PolynomialGetter * mPG
 
std::size_t mLevel
 

Detailed Description

template<typename PolynomialGetter>
struct smtrat::cad::PolynomialComparator< PolynomialGetter >

Definition at line 12 of file PolynomialLiftingQueue.h.

Constructor & Destructor Documentation

◆ PolynomialComparator()

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

Definition at line 17 of file PolynomialLiftingQueue.h.

Member Function Documentation

◆ operator()()

template<typename PolynomialGetter >
bool smtrat::cad::PolynomialComparator< PolynomialGetter >::operator() ( std::size_t  lhs,
std::size_t  rhs 
) const
inline

Definition at line 18 of file PolynomialLiftingQueue.h.

Field Documentation

◆ mLevel

template<typename PolynomialGetter >
std::size_t smtrat::cad::PolynomialComparator< PolynomialGetter >::mLevel
private

Definition at line 15 of file PolynomialLiftingQueue.h.

◆ mPG

template<typename PolynomialGetter >
const PolynomialGetter* smtrat::cad::PolynomialComparator< PolynomialGetter >::mPG
private

Definition at line 14 of file PolynomialLiftingQueue.h.

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