38 namespace Gecode {
namespace Int {
namespace Unary {
41 template<
class ManTask>
45 sort<typename TaskTraits<ManTask>::TaskViewFwd,
STO_LCT,
true>(f);
50 for (
int i=0;
i<f.
size();
i++) {
52 if (o.
ect() > f[
i].lct())
59 template<
class OptTask>
63 sort<typename TaskTraits<OptTask>::TaskViewFwd,
STO_LCT,
true>(f);
68 bool to_purge =
false;
70 for (
int i=0;
i<f.
size();
i++) {
73 }
else if (f[
i].mandatory()) {
75 if (ol.
ect() > f[
i].lct())
Omega-lambda trees for computing ect of task sets.
int size(void) const
Return size of array (number of elements)
int lect(void) const
Return earliest completion time of all tasks excluding lambda tasks.
Base-class for propagators.
void linsert(int i)
Insert task with index i to lambda.
void insert(int i)
Insert task with index i.
void oinsert(int i)
Insert task with index i to omega.
#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.
int p
Number of positive literals for node type.
Omega trees for computing ect of task sets.
Gecode::IntArgs i(4, 1, 2, 3, 4)
Execution has resulted in failure.
int ect(void) const
Return earliest completion time of all tasks.
ExecStatus overload(Space &home, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Sort by latest completion times.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
int responsible(void) const
Return responsible task.
int ect(void) const
Return earliest completion time of all tasks.
void lremove(int i)
Remove task with index i from lambda.
Gecode toplevel namespace
bool optional(const BoolVarArgs &m)