40 namespace Gecode {
namespace Int {
namespace Unary {
60 for ( ; (e->type() ==
Event::LRT) && (e->time() == time); e++)
61 if (t[e->idx()].mandatory()) {
62 tasks.
set(static_cast<unsigned int>(e->idx()));
67 for ( ; (e->type() ==
Event::LCT) && (e->time() == time); e++)
68 tasks.
clear(static_cast<unsigned int>(e->idx()));
71 for ( ; (e->type() ==
Event::EST) && (e->time() == time); e++)
72 tasks.
set(static_cast<unsigned int>(e->idx()));
75 for ( ; (e->type() ==
Event::ZRO) && (e->time() == time); e++)
82 for ( ; (e->type() ==
Event::ERT) && (e->time() == time); e++)
83 if (t[e->idx()].mandatory()) {
84 tasks.
clear(static_cast<unsigned int>(e->idx()));
89 }
else if (t[e->idx()].optional() && !free) {
97 if (t[j.val()].mandatory())
Zero-length task start time.
ExecStatus ES_SUBSUMED(Propagator &p)
void clear(unsigned int i)
Clear bit i.
ExecStatus timetabling(Space &home, Propagator &p, TaskArray< Task > &t)
Perform time-tabling propagation.
Base-class for propagators.
Earliest required time of task.
Value iterator for values in a bitset.
int p
Number of positive literals for node type.
Time-tabling event for task.
Execution has resulted in failure.
void set(unsigned int i)
Set bit i.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Latest completion time of task.
bool assigned(View x, int v)
Whether x is assigned to value v.
Propagation has not computed fixpoint.
Latest required time of task.
static Event * events(Region &r, const TaskArray< Task > &t, bool &assigned)
Allocate from r and initialize event array with tasks t.
Gecode toplevel namespace
int size(void) const
Return size of array (number of elements)
Earliest start time of task.