
Omega trees for computing ect of task sets. More...
#include <unary.hh>
Public Member Functions | |
| OmegaTree (Region &r, const TaskViewArray< TaskView > &t) | |
| Initialize tree for tasks t. | |
| void | insert (int i) |
| Insert task with index i. | |
| void | remove (int i) |
| Remove task with index i. | |
| int | ect (void) const |
| Return earliest completion time of all tasks. | |
| int | ect (int i) const |
| Return earliest completion time of all tasks but i. | |
Omega trees for computing ect of task sets.
| Gecode::Int::Unary::OmegaTree< TaskView >::OmegaTree | ( | Region & | r, |
| const TaskViewArray< TaskView > & | t | ||
| ) |
| void Gecode::Int::Unary::OmegaTree< TaskView >::insert | ( | int | i | ) | [inline] |
| void Gecode::Int::Unary::OmegaTree< TaskView >::remove | ( | int | i | ) | [inline] |
| int Gecode::Int::Unary::OmegaTree< TaskView >::ect | ( | void | ) | const [inline] |
| int Gecode::Int::Unary::OmegaTree< TaskView >::ect | ( | int | i | ) | const [inline] |