42 for (
int i=1; i<f.size(); i++)
43 if (f[i-1].lct() > f[i].est())
Base-class for propagators.
ExecStatus ES_SUBSUMED(Propagator &p)
Propagator p is subsumed
ExecStatus subsumed(Space &home, Propagator &p, TaskArray< Task > &t)
Check tasks t for subsumption.
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing)
@ STO_EST
Sort by earliest start times.
Gecode toplevel namespace
@ ES_OK
Execution is okay.