40 namespace Gecode {
namespace Int {
namespace Cumulative {
47 bool operator ()(
const Task& t1,
const Task& t2)
const;
53 return t1.c() > t2.c();
57 template<
class Task,
class Cap>
81 for ( ; (e->type() ==
Event::LRT) && (e->time() == time); e++)
82 if (
t[e->idx()].mandatory()) {
83 tasks.
set(
static_cast<unsigned int>(e->idx()));
84 ccur +=
t[e->idx()].c();
87 for ( ; (e->type() ==
Event::LCT) && (e->time() == time); e++)
88 tasks.
clear(
static_cast<unsigned int>(e->idx()));
90 for ( ; (e->type() ==
Event::EST) && (e->time() == time); e++)
91 tasks.
set(
static_cast<unsigned int>(e->idx()));
93 for ( ; (e->type() ==
Event::ZRO) && (e->time() == time); e++) {
94 ccur -=
t[e->idx()].c();
95 if (ccur < cmin) cmin=ccur;
98 ccur +=
t[e->idx()].c();
104 for ( ; (e->type() ==
Event::ERT) && (e->time() == time); e++)
105 if (
t[e->idx()].mandatory()) {
106 tasks.
clear(
static_cast<unsigned int>(e->idx()));
107 ccur -=
t[e->idx()].c();
108 if (ccur < cmin) cmin=ccur;
112 }
else if (
t[e->idx()].optional() && (
t[e->idx()].c() > ccur)) {
118 j() && (
t[j.val()].c() > ccur); ++j)
120 if (
t[j.val()].mandatory())