SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
#include <Tableau.h>
Public Member Functions | |
LearnedBound ()=delete | |
LearnedBound (const LearnedBound &)=delete | |
LearnedBound (LearnedBound &&_toMove) | |
LearnedBound (const Value< T1 > &_limit, const Bound< T1, T2 > *_newBound, typename Bound< T1, T2 >::BoundSet::const_iterator _nextWeakerBound, std::vector< const Bound< T1, T2 > * > &&_premise) | |
~LearnedBound () | |
Data Fields | |
const Bound< T1, T2 > * | newBound |
Value< T1 > | newLimit |
Bound< T1, T2 >::BoundSet::const_iterator | nextWeakerBound |
std::vector< const Bound< T1, T2 > * > | premise |
|
delete |
|
delete |
|
inline |
|
inline |
|
inline |
const Bound<T1, T2>* smtrat::lra::Tableau< Settings, T1, T2 >::LearnedBound::newBound |
Value<T1> smtrat::lra::Tableau< Settings, T1, T2 >::LearnedBound::newLimit |
Bound<T1, T2>::BoundSet::const_iterator smtrat::lra::Tableau< Settings, T1, T2 >::LearnedBound::nextWeakerBound |
std::vector< const Bound<T1, T2>*> smtrat::lra::Tableau< Settings, T1, T2 >::LearnedBound::premise |