#include <IbexCell.h>

Public Member Functions | |
| Backtrackable () | |
| Backtrackable (Backtrackable &father, bool side) | |
| virtual | ~Backtrackable () |
A backtrackable is a structure propagated through the search tree. It is therefore only used by pavers . Each node in the search tree has its own structure, this structure being inherited from the father node. The mechanism of inheritance can be controled thanks to the copy constructor . For the moment, control can only be made downward: there is no way of updating a node structure by aggregating children node structures when backtracking (this shall be fixed in a future version).
This class is an interface to be implemented by any operator data class associated to a cell. Backtrackable must be viewed as a metaclass, each object being a subclass whose copy is controled by the copy constructor.
| ibex::Backtrackable::Backtrackable | ( | ) | [inline] |
Create default data (for the root cell)
This constructor does nothing (empty data).
| ibex::Backtrackable::Backtrackable | ( | Backtrackable & | father, | |
| bool | side | |||
| ) | [inline] |
Create data associated to a child node.
| father | - The data associated to the father node. | |
| side | - false if the cell to be built is the left child, true if it is the right child. |
| virtual ibex::Backtrackable::~Backtrackable | ( | ) | [inline, virtual] |
Delete this instance.
1.5.5