38 template<
class TaskView>
47 while (q.
left() > 1) {
48 if (ol.
ect() > t[j].lct())
53 while (!ol.
lempty() && (ol.
lect() > t[j].lct())) {
Allows to iterate over task views according to a specified order.
int task(void) const
Return current task position.
int left(void) const
How many tasks are left to be iterated.
Omega-lambda trees for computing ect of task sets.
int responsible(void) const
Return responsible task.
void shift(int i)
Shift task with index i from omega to lambda.
void lremove(int i)
Remove task with index i from lambda.
bool lempty(void) const
Whether has responsible task.
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
int ect(void) const
Return earliest completion time of all tasks.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
ExecStatus edgefinding(Space &home, TaskArray< Task > &t)
Propagate by edge-finding.
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
@ ES_OK
Execution is okay.
@ ES_FAILED
Execution has resulted in failure.