#include <IbexConstraint.h>

Public Member Functions | |
| virtual void | forward (const Space &space) const =0 |
| virtual void | backward (Space &space) const =0 |
| virtual | ~Constraint () |
| virtual void | accept_printer (const OperatorPrinter &p) const =0 |
| virtual bool | is_equality () const =0 |
| Env & | get_env () const |
| int | get_env_num () const |
| const char * | get_name () const |
Public Attributes | |
| hash_map< int, int > | adj |
Constraint example : sin(x+y)^2 >= z-1.
| virtual ibex::Constraint::~Constraint | ( | ) | [inline, virtual] |
Delete this instance.
| virtual void ibex::Constraint::forward | ( | const Space & | space | ) | const [pure virtual] |
Forward evaluation.
Implemented in ibex::ArithConstraint, ibex::NotIn, and ibex::AtMostNVector.
| virtual void ibex::Constraint::backward | ( | Space & | space | ) | const [pure virtual] |
Backward evaluation.
Implemented in ibex::ArithConstraint, ibex::Equality, ibex::Inequality, ibex::NotIn, and ibex::AtMostNVector.
| virtual void ibex::Constraint::accept_printer | ( | const OperatorPrinter & | p | ) | const [pure virtual] |
Return a string representation of the constraint.
Implemented in ibex::Equality, ibex::Inequality, ibex::NotIn, and ibex::AtMostNVector.
| virtual bool ibex::Constraint::is_equality | ( | ) | const [pure virtual] |
Return true if the constraint is an equality.
Implemented in ibex::ArithConstraint, ibex::Equality, ibex::Inequality, ibex::NotIn, and ibex::AtMostNVector.
| Env& ibex::Constraint::get_env | ( | ) | const [inline] |
Return the environment of the constraint.
| int ibex::Constraint::get_env_num | ( | ) | const [inline] |
Return the constraint number in its environment, -1 if the constraint does not belong to any environment.
| const char* ibex::Constraint::get_name | ( | ) | const [inline] |
Return the name of the constraint in its environment, NULL if the constraint does not belong to any environment.
| hash_map<int,int> ibex::Constraint::adj |
Adjacency of the constraint. adj[x] equals n if variable whose key is x appears n times in the expression of the constraint. (n>1 means that the variable is multi-incident).
1.5.5