40 namespace Gecode {
namespace Int {
namespace Unary {
42 template<
class TaskView>
51 while (q.
left() > 1) {
52 if (ol.
ect() > t[j].lct())
57 while (!ol.
lempty() && (ol.
lect() > t[j].lct())) {
Omega-lambda trees for computing ect of task sets.
int left(void) const
How many tasks are left to be iterated.
bool lempty(void) const
Whether has responsible task.
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Gecode::IntArgs i(4, 1, 2, 3, 4)
Execution has resulted in failure.
Allows to iterate over task views according to a specified order.
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
int responsible(void) const
Return responsible task.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
int task(void) const
Return current task position.
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)
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
int ect(void) const
Return earliest completion time of all tasks.