40 namespace Gecode {
namespace Int {
namespace Cumulative {
43 template<
class ManTask>
47 sort<typename TaskTraits<ManTask>::TaskViewFwd,
STO_LCT,
true>(f);
52 for (
int i=0;
i<f.
size();
i++) {
55 if (o.
env() >
static_cast<long long int>(
c)*f[
i].lct())
long long int env(void) const
Return energy envelope of all tasks.
Omega trees for computing ect of task sets.
ExecStatus overload(Space &home, int c, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i(4, 1, 2, 3, 4)
int size(void) const
Return size of array (number of elements)
Sort by latest completion times.
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
void insert(int i)
Insert task with index i.
Gecode toplevel namespace