#include <IbexCell.h>
Inherits hash_map.
Public Member Functions | |
| template<typename T> | |
| T & | get () |
| ~Cell () | |
| bool | root () |
Public Attributes | |
| Space & | space |
| const int | last_split_var |
This representation includes default data (current domains, global space, last split variable) and data related to user-defined operators. A different cell is associated to each node and cell construction/ inheritance can be controlled (see ibex::Backtrackable).
The cell on its own contains the minimum of information associated to the actual search space. Besides the current box (the search space), this minimum information includes, e.g., the number of the last bisected variable (other fields might be added with future releases).
The amount of information contained in a cell can be arbitrarly augmented thanks to the "data registration" technique (see ibex::Operator::require()).
| ibex::Cell::~Cell | ( | ) | [inline] |
Delete this instance.
| T& ibex::Cell::get | ( | ) | [inline] |
Retreive backtrackable data from this cell. The data is identified by its classname.
| bool ibex::Cell::root | ( | ) | [inline] |
Return true if this cell is the root cell.
The global space (including domains of epr, upr and syb).
| const int ibex::Cell::last_split_var |
The last split variable (undefined if this cell is the root).
1.5.5