|
int | n_inner (void) const |
| Return number of inner nodes.
|
|
int | n_nodes (void) const |
| Return number of nodes for balanced binary tree.
|
|
bool | n_leaf (int i) const |
| Whether node i is leaf.
|
|
ExtOmegaNode & | leaf (int i) |
| Return leaf for task i.
|
|
const ExtOmegaNode & | root (void) const |
| Return root node.
|
|
void | update (int i, bool l=true) |
| Update tree after leaf for task i has changed (l whether i refers to a leaf)
|
|
void | update (void) |
| Update all inner nodes of tree after leaves have been initialized.
|
|
void | init (void) |
| Initialize tree after leaves have been initialized.
|
|
| TaskTree (Region &r, const TaskViewArray< TaskView > &t) |
| Initialize tree for tasks t.
|
|
| TaskTree (Region &r, const TaskTree< TaskView, Node2 > &t) |
| Initialize tree using tree t.
|
|
static bool | n_root (int i) |
| Whether node i is index of root.
|
|
static int | n_left (int i) |
| Return index of left child of node i.
|
|
static bool | left (int i) |
| Test whether node i is a left child.
|
|
static int | n_right (int i) |
| Return index of right child of node i.
|
|
static bool | right (int i) |
| Test whether node i is a right child.
|
|
static int | n_parent (int i) |
| Return index of parent of node i.
|
|
template<class TaskView>
class Gecode::Int::Cumulative::ExtOmegaTree< TaskView >
Omega trees for computing ect of task sets.
Definition at line 594 of file cumulative.hh.