40 namespace Gecode {
namespace Int {
namespace Unary {
42 template<
class TaskView>
51 while (q.
left() > 1) {
52 if (ol.
ect() >
t[j].lct())
Omega-lambda trees for computing ect of task sets.
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
bool lempty(void) const
Whether has responsible task.
Gecode::IntArgs i(4, 1, 2, 3, 4)
Execution has resulted in failure.
int task(void) const
Return current task position.
int ect(void) const
Return earliest completion time of all tasks.
Allows to iterate over task views according to a specified order.
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
int responsible(void) const
Return responsible task.
Post propagator for SetVar SetOpType SetVar SetRelType r
Post propagator for f(x \diamond_{\mathit{op}} y) \sim_r z \f$ void rel(Home home
void lremove(int i)
Remove task with index i from lambda.
void shift(int i)
Shift task with index i from omega to lambda.
ExecStatus edgefinding(Space &home, TaskViewArray< TaskView > &t)
Gecode toplevel namespace
int left(void) const
How many tasks are left to be iterated.