SMT-RAT
24.02
Toolbox for Strategic and Parallel Satisfiability-Modulo-Theories Solving
|
Stores a bound, which could be an upper "<= b" or a lower bound ">= b" for a bound value b. More...
#include <Bound.h>
Data Structures | |
struct | Info |
Stores some additional information for a bound. More... | |
Public Types | |
enum | Type { LOWER , UPPER , EQUAL } |
The type of the bound: LOWER = ">=", UPPER = "<=", EQUAL "==". More... | |
typedef carl::PointerSet< Bound< T1, T2 > > | BoundSet |
A set of pointer to bounds. More... | |
Public Member Functions | |
Bound ()=delete | |
Bound (const Value< T1 > *const _limit, Variable< T1, T2 > *const _var, Type _type, const FormulaT &_constraint, Bound< T1, T2 >::Info *_boundInfo=NULL, bool _deduced=false) | |
~Bound () | |
bool | operator> (const Value< T1 > &_value) const |
bool | operator== (const Value< T1 > &_value) const |
bool | operator< (const Value< T1 > &_value) const |
bool | operator< (const Bound &_bound) const |
bool | operator> (const Bound &_bound) const |
bool | operator== (const T1 &_a) const |
bool | operator> (const T1 &_a) const |
bool | operator< (const T1 &_a) const |
bool | operator>= (const T1 &_a) const |
bool | operator<= (const T1 &_a) const |
const std::string | toString () const |
void | print (bool _withOrigins=false, std::ostream &_out=std::cout, bool _printTypebool=false) const |
bool | deduced () const |
bool | markedAsDeleted () const |
void | markAsDeleted () const |
void | unmarkAsDeleted () const |
const Value< T1 > & | limit () const |
const Value< T1 > * | pLimit () const |
bool | isInfinite () const |
Variable< T1, T2 > * | pVariable () const |
const Variable< T1, T2 > & | variable () const |
Type | type () const |
bool | isWeak () const |
bool | isUpperBound () const |
bool | isLowerBound () const |
const FormulaT & | asConstraint () const |
bool | hasNeqRepresentation () const |
const FormulaT & | neqRepresentation () const |
void | setNeqRepresentation (const FormulaT &_constraint) const |
void | resetNeqRepresentation () const |
void | boundExists () const |
void | setComplement (const Bound< T1, T2 > *_complement) const |
bool | exists () const |
const std::shared_ptr< std::vector< FormulaT > > & | pOrigins () const |
const std::vector< FormulaT > & | origins () const |
bool | isActive () const |
bool | isComplementActive () const |
bool | isUnassigned () const |
Info * | pInfo () const |
bool | isSatisfied (const T1 &_delta) const |
bool | operator>= (const Value< T1 > &v) const |
bool | operator<= (const Value< T1 > &v) const |
Private Attributes | |
bool | mDeduced |
bool | mMarkedAsDeleted |
Type | mType |
const Value< T1 > * | mLimit |
Variable< T1, T2 > *const | mVar |
FormulaT | mAsConstraint |
std::shared_ptr< std::vector< FormulaT > > | mpOrigins |
Info * | mpInfo |
Friends | |
template<typename T3 , typename T4 > | |
std::ostream & | operator<< (std::ostream &_ostream, const Bound< T3, T4 > &_bound) |
Stores a bound, which could be an upper "<= b" or a lower bound ">= b" for a bound value b.
In the case that "<= b" and ">= b" hold this bound is a so called equal bound represented by "==b".
typedef carl::PointerSet<Bound<T1, T2> > smtrat::lra::Bound< T1, T2 >::BoundSet |
enum smtrat::lra::Bound::Type |
|
delete |
smtrat::lra::Bound< T1, T2 >::Bound | ( | const Value< T1 > *const | _limit, |
Variable< T1, T2 > *const | _var, | ||
Type | _type, | ||
const FormulaT & | _constraint, | ||
Bound< T1, T2 >::Info * | _boundInfo = NULL , |
||
bool | _deduced = false |
||
) |
_limit | |
_var | |
_type | |
_constraint | |
_boundInfo | |
_deduced |
smtrat::lra::Bound< T1, T2 >::~Bound | ( | ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
bool smtrat::lra::Bound< T1, T2 >::operator< | ( | const Bound< T1, T2 > & | _bound | ) | const |
_bound |
bool smtrat::lra::Bound< T1, T2 >::operator< | ( | const T1 & | _a | ) | const |
_a |
bool smtrat::lra::Bound< T1, T2 >::operator< | ( | const Value< T1 > & | _value | ) | const |
_value |
bool smtrat::lra::Bound< T1, T2 >::operator<= | ( | const T1 & | _a | ) | const |
_a |
|
inline |
bool smtrat::lra::Bound< T1, T2 >::operator== | ( | const T1 & | _a | ) | const |
_a |
bool smtrat::lra::Bound< T1, T2 >::operator== | ( | const Value< T1 > & | _value | ) | const |
_value |
bool smtrat::lra::Bound< T1, T2 >::operator> | ( | const Bound< T1, T2 > & | _bound | ) | const |
_bound |
bool smtrat::lra::Bound< T1, T2 >::operator> | ( | const T1 & | _a | ) | const |
_a |
bool smtrat::lra::Bound< T1, T2 >::operator> | ( | const Value< T1 > & | _value | ) | const |
_value |
bool smtrat::lra::Bound< T1, T2 >::operator>= | ( | const T1 & | _a | ) | const |
_a |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
void smtrat::lra::Bound< T1, T2 >::print | ( | bool | _withOrigins = false , |
std::ostream & | _out = std::cout , |
||
bool | _printTypebool = false |
||
) | const |
_withOrigins | |
_out | |
_printTypebool |
|
inline |
|
inline |
|
inline |
|
inline |
const std::string smtrat::lra::Bound< T1, T2 >::toString | ( | ) | const |
|
inline |
|
inline |
|
inline |
|
friend |
_withOrigins | |
_out | |
_printTypebool |
|
private |
|
private |
|
private |
|
mutableprivate |
|
private |
|
private |
|
private |
|
private |