task.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
* Guido Tack, 2010
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Int { namespace Unary {
/*
* Mandatory fixed task
*/
forceinline
ManFixPTask::ManFixPTask(void) {}
forceinline
ManFixPTask::ManFixPTask(IntVar s, int p) : _s(s), _p(p) {}
forceinline void
ManFixPTask::init(IntVar s, int p) {
_s=s; _p=p;
}
forceinline void
ManFixPTask::init(const ManFixPTask& t) {
_s=t._s; _p=t._p;
}
forceinline int
ManFixPTask::est(void) const {
return _s.min();
}
forceinline int
ManFixPTask::ect(void) const {
return _s.min()+_p;
}
forceinline int
ManFixPTask::lst(void) const {
return _s.max();
}
forceinline int
ManFixPTask::lct(void) const {
return _s.max()+_p;
}
forceinline int
ManFixPTask::pmin(void) const {
return _p;
}
forceinline int
ManFixPTask::pmax(void) const {
return _p;
}
forceinline IntVar
ManFixPTask::st(void) const {
return _s;
}
forceinline bool
ManFixPTask::mandatory(void) const {
return true;
}
forceinline bool
ManFixPTask::excluded(void) const {
return false;
}
forceinline bool
ManFixPTask::optional(void) const {
return false;
}
forceinline bool
ManFixPTask::assigned(void) const {
return _s.assigned();
}
forceinline ModEvent
ManFixPTask::est(Space& home, int n) {
return _s.gq(home,n);
}
forceinline ModEvent
ManFixPTask::ect(Space& home, int n) {
return _s.gq(home,n-_p);
}
forceinline ModEvent
ManFixPTask::lst(Space& home, int n) {
return _s.lq(home,n);
}
forceinline ModEvent
ManFixPTask::lct(Space& home, int n) {
return _s.lq(home,n-_p);
}
forceinline ModEvent
ManFixPTask::norun(Space& home, int e, int l) {
if (e <= l) {
Iter::Ranges::Singleton r(e-_p+1,l);
return _s.minus_r(home,r,false);
} else {
return ME_INT_NONE;
}
}
forceinline ModEvent
ManFixPTask::mandatory(Space&) {
return ME_INT_NONE;
}
forceinline ModEvent
ManFixPTask::excluded(Space&) {
return ME_INT_FAILED;
}
forceinline void
ManFixPTask::update(Space& home, ManFixPTask& t) {
_s.update(home,t._s); _p=t._p;
}
forceinline void
ManFixPTask::subscribe(Space& home, Propagator& p, PropCond pc) {
_s.subscribe(home, p, pc);
}
forceinline void
ManFixPTask::cancel(Space& home, Propagator& p, PropCond pc) {
_s.cancel(home, p, pc);
}
forceinline void
ManFixPTask::reschedule(Space& home, Propagator& p, PropCond pc) {
_s.reschedule(home, p, pc);
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPTask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.pmin() << ':' << t.lct();
return os << s.str();
}
/*
* Mandatory fixed task with fixed processing, start or end time
*/
forceinline
ManFixPSETask::ManFixPSETask(void) {}
forceinline
ManFixPSETask::ManFixPSETask(TaskType t, IntVar s, int p)
: ManFixPTask(s,p), _t(t) {}
forceinline void
ManFixPSETask::init(TaskType t, IntVar s, int p) {
ManFixPTask::init(s,p); _t=t;
}
forceinline void
ManFixPSETask::init(const ManFixPSETask& t0) {
ManFixPTask::init(t0); _t = t0._t;
}
forceinline int
ManFixPSETask::est(void) const {
return (_t == TT_FIXS) ? _p : _s.min();
}
forceinline int
ManFixPSETask::ect(void) const {
switch (_t) {
case TT_FIXP: return _s.min()+_p;
case TT_FIXS: return _s.min();
case TT_FIXE: return _p;
default: GECODE_NEVER;
}
return 0;
}
forceinline int
ManFixPSETask::lst(void) const {
return (_t == TT_FIXS) ? _p : _s.max();
}
forceinline int
ManFixPSETask::lct(void) const {
switch (_t) {
case TT_FIXP: return _s.max()+_p;
case TT_FIXS: return _s.max();
case TT_FIXE: return _p;
default: GECODE_NEVER;
}
return 0;
}
forceinline int
ManFixPSETask::pmin(void) const {
switch (_t) {
case TT_FIXP: return _p;
case TT_FIXS: return _s.min()-_p;
case TT_FIXE: return _p-_s.max();
default: GECODE_NEVER;
}
return 0;
}
forceinline int
ManFixPSETask::pmax(void) const {
switch (_t) {
case TT_FIXP: return _p;
case TT_FIXS: return _s.max()-_p;
case TT_FIXE: return _p-_s.min();
default: GECODE_NEVER;
}
return 0;
}
forceinline ModEvent
ManFixPSETask::est(Space& home, int n) {
switch (_t) {
case TT_FIXE: // fall through
case TT_FIXP: return _s.gq(home,n);
case TT_FIXS: return (n <= _p) ? ME_INT_NONE : ME_INT_FAILED;
default: GECODE_NEVER;
}
return ME_INT_NONE;
}
forceinline ModEvent
ManFixPSETask::ect(Space& home, int n) {
switch (_t) {
case TT_FIXE: return (n <= _p) ? ME_INT_NONE : ME_INT_FAILED;
case TT_FIXP: return _s.gq(home,n-_p);
case TT_FIXS: return _s.gq(home,n);
default: GECODE_NEVER;
}
return ME_INT_NONE;
}
forceinline ModEvent
ManFixPSETask::lst(Space& home, int n) {
switch (_t) {
case TT_FIXE: // fall through
case TT_FIXP: return _s.lq(home,n);
case TT_FIXS: return (n >= _p) ? ME_INT_NONE : ME_INT_FAILED;
default: GECODE_NEVER;
}
return ME_INT_NONE;
}
forceinline ModEvent
ManFixPSETask::lct(Space& home, int n) {
switch (_t) {
case TT_FIXE: return (n >= _p) ? ME_INT_NONE : ME_INT_FAILED;
case TT_FIXP: return _s.lq(home,n-_p);
case TT_FIXS: return _s.lq(home,n);
default: GECODE_NEVER;
}
return ME_INT_NONE;
}
forceinline ModEvent
ManFixPSETask::norun(Space& home, int e, int l) {
if (e <= l) {
switch (_t) {
case TT_FIXP:
{
Iter::Ranges::Singleton r(e-_p+1,l);
return _s.minus_r(home,r,false);
}
case TT_FIXE:
if (e <= _p)
return _s.gr(home,l);
break;
case TT_FIXS:
if (l >= _p)
return _s.lq(home,e);
break;
default:
GECODE_NEVER;
}
return ME_INT_NONE;
} else {
return ME_INT_NONE;
}
}
forceinline void
ManFixPSETask::update(Space& home, ManFixPSETask& t) {
ManFixPTask::update(home,t); _t=t._t;
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFixPSETask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.pmin() << ':' << t.lct();
return os << s.str();
}
/*
* Mandatory flexible task
*/
forceinline
ManFlexTask::ManFlexTask(void) {}
forceinline
ManFlexTask::ManFlexTask(IntVar s, IntVar p, IntVar e)
: _s(s), _p(p), _e(e) {}
forceinline void
ManFlexTask::init(IntVar s, IntVar p, IntVar e) {
_s=s; _p=p; _e=e;
}
forceinline void
ManFlexTask::init(const ManFlexTask& t) {
_s=t._s; _p=t._p; _e=t._e;
}
forceinline int
ManFlexTask::est(void) const {
return _s.min();
}
forceinline int
ManFlexTask::ect(void) const {
return _e.min();
}
forceinline int
ManFlexTask::lst(void) const {
return _s.max();
}
forceinline int
ManFlexTask::lct(void) const {
return _e.max();
}
forceinline int
ManFlexTask::pmin(void) const {
return _p.min();
}
forceinline int
ManFlexTask::pmax(void) const {
return _p.max();
}
forceinline IntVar
ManFlexTask::st(void) const {
return _s;
}
forceinline IntVar
ManFlexTask::p(void) const {
return _p;
}
forceinline IntVar
ManFlexTask::e(void) const {
return _e;
}
forceinline bool
ManFlexTask::mandatory(void) const {
return true;
}
forceinline bool
ManFlexTask::excluded(void) const {
return false;
}
forceinline bool
ManFlexTask::optional(void) const {
return false;
}
forceinline bool
ManFlexTask::assigned(void) const {
return _s.assigned() && _p.assigned() && _e.assigned();
}
forceinline ModEvent
ManFlexTask::est(Space& home, int n) {
return _s.gq(home,n);
}
forceinline ModEvent
ManFlexTask::ect(Space& home, int n) {
return _e.gq(home,n);
}
forceinline ModEvent
ManFlexTask::lst(Space& home, int n) {
return _s.lq(home,n);
}
forceinline ModEvent
ManFlexTask::lct(Space& home, int n) {
return _e.lq(home,n);
}
forceinline ModEvent
ManFlexTask::norun(Space& home, int e, int l) {
if (e <= l) {
Iter::Ranges::Singleton sr(e-_p.min()+1,l);
if (me_failed(_s.minus_r(home,sr,false)))
return ME_INT_FAILED;
Iter::Ranges::Singleton er(e+1,_p.min()+l);
return _e.minus_r(home,er,false);
} else {
return ME_INT_NONE;
}
}
forceinline ModEvent
ManFlexTask::mandatory(Space&) {
return ME_INT_NONE;
}
forceinline ModEvent
ManFlexTask::excluded(Space&) {
return ME_INT_FAILED;
}
forceinline void
ManFlexTask::update(Space& home, ManFlexTask& t) {
_s.update(home,t._s);
_p.update(home,t._p);
_e.update(home,t._e);
}
forceinline void
ManFlexTask::subscribe(Space& home, Propagator& p, PropCond pc) {
_s.subscribe(home, p, pc);
_p.subscribe(home, p, pc);
_e.subscribe(home, p, pc);
}
forceinline void
ManFlexTask::cancel(Space& home, Propagator& p, PropCond pc) {
_s.cancel(home, p, pc);
_p.cancel(home, p, pc);
_e.cancel(home, p, pc);
}
forceinline void
ManFlexTask::reschedule(Space& home, Propagator& p, PropCond pc) {
_s.reschedule(home, p, pc);
_p.reschedule(home, p, pc);
_e.reschedule(home, p, pc);
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const ManFlexTask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.lst() << ':' << t.pmin() << ':'
<< t.pmax() << ':' << t.ect() << ':' << t.lct();
return os << s.str();
}
/*
* Optional fixed task
*/
forceinline
OptFixPTask::OptFixPTask(void) {}
forceinline
OptFixPTask::OptFixPTask(IntVar s, int p, BoolVar m) {
ManFixPTask::init(s,p); _m=m;
}
forceinline void
OptFixPTask::init(IntVar s, int p, BoolVar m) {
ManFixPTask::init(s,p); _m=m;
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPTask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.pmin() << ':' << t.lct() << ':'
<< (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
return os << s.str();
}
/*
* Optional fixed task
*/
forceinline
OptFixPSETask::OptFixPSETask(void) {}
forceinline
OptFixPSETask::OptFixPSETask(TaskType t,IntVar s,int p,BoolVar m) {
ManFixPSETask::init(t,s,p); _m=m;
}
forceinline void
OptFixPSETask::init(TaskType t, IntVar s, int p, BoolVar m) {
ManFixPSETask::init(t,s,p); _m=m;
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFixPSETask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.pmin() << ':' << t.lct() << ':'
<< (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
return os << s.str();
}
/*
* Optional flexible task
*/
forceinline
OptFlexTask::OptFlexTask(void) {}
forceinline
OptFlexTask::OptFlexTask(IntVar s, IntVar p, IntVar e, BoolVar m) {
ManFlexTask::init(s,p,e); _m=m;
}
forceinline void
OptFlexTask::init(IntVar s, IntVar p, IntVar e, BoolVar m) {
ManFlexTask::init(s,p,e); _m=m;
}
template<class Char, class Traits>
std::basic_ostream<Char,Traits>&
operator <<(std::basic_ostream<Char,Traits>& os, const OptFlexTask& t) {
std::basic_ostringstream<Char,Traits> s;
s.copyfmt(os); s.width(0);
s << t.est() << ':' << t.lst() << ':' << t.pmin() << ':'
<< t.pmax() << ':' << t.ect() << ':' << t.lct() << ':'
<< (t.mandatory() ? '1' : (t.optional() ? '?' : '0'));
return os << s.str();
}
}}}
// STATISTICS: int-var
Gecode::BoolVar
Boolean integer variables.
Definition int.hh:512
Gecode::BoolVar::width
unsigned int width(void) const
Return width of domain (distance between maximum and minimum).
Definition bool.hpp:77
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::Int::ManToOptTask< ManFixPTask >::_m
Int::BoolView _m
Definition task.hh:46
Gecode::Int::ManToOptTask::mandatory
bool mandatory(void) const
Whether task is mandatory.
Definition man-to-opt.hpp:42
Gecode::Int::ManToOptTask::optional
bool optional(void) const
Whether task can still be optional.
Definition man-to-opt.hpp:52
Gecode::Int::Unary::ManFixPSETask
Unary (mandatory) task with fixed processing, start or end time
Definition unary.hh:148
Gecode::Int::Unary::ManFixPSETask::ect
int ect(void) const
Return earliest completion time.
Definition task.hpp:188
Gecode::Int::Unary::ManFixPSETask::norun
ModEvent norun(Space &home, int e, int l)
Update such that task cannot run from e to l.
Definition task.hpp:273
Gecode::Int::Unary::ManFixPSETask::pmax
int pmax(void) const
Return maximum processing time.
Definition task.hpp:222
Gecode::Int::Unary::ManFixPSETask::pmin
int pmin(void) const
Return minimum processing time.
Definition task.hpp:212
Gecode::Int::Unary::ManFixPSETask::ManFixPSETask
ManFixPSETask(void)
Default constructor.
Definition task.hpp:170
Gecode::Int::Unary::ManFixPSETask::init
void init(TaskType t, IntVar s, int p)
Initialize task.
Definition task.hpp:175
Gecode::Int::Unary::ManFixPSETask::est
int est(void) const
Return earliest start time.
Definition task.hpp:184
Gecode::Int::Unary::ManFixPSETask::_t
TaskType _t
Task type.
Definition unary.hh:151
Gecode::Int::Unary::ManFixPSETask::lct
int lct(void) const
Return latest completion time.
Definition task.hpp:202
Gecode::Int::Unary::ManFixPSETask::lst
int lst(void) const
Return latest start time.
Definition task.hpp:198
Gecode::Int::Unary::ManFixPSETask::update
void update(Space &home, ManFixPSETask &t)
Update this task to be a clone of task t.
Definition task.hpp:299
Gecode::Int::Unary::ManFixPTask
Unary (mandatory) task with fixed processing time
Definition unary.hh:54
Gecode::Int::Unary::ManFixPTask::pmax
int pmax(void) const
Return maximum processing time.
Definition task.hpp:76
Gecode::Int::Unary::ManFixPTask::optional
bool optional(void) const
Whether task can still be optional.
Definition task.hpp:93
Gecode::Int::Unary::ManFixPTask::norun
ModEvent norun(Space &home, int e, int l)
Update such that task cannot run from e to l.
Definition task.hpp:119
Gecode::Int::Unary::ManFixPTask::ManFixPTask
ManFixPTask(void)
Default constructor.
Definition task.hpp:43
Gecode::Int::Unary::ManFixPTask::est
int est(void) const
Return earliest start time.
Definition task.hpp:56
Gecode::Int::Unary::ManFixPTask::pmin
int pmin(void) const
Return minimum processing time.
Definition task.hpp:72
Gecode::Int::Unary::ManFixPTask::init
void init(IntVar s, int p)
Initialize with start time s and processing time p.
Definition task.hpp:47
Gecode::Int::Unary::ManFixPTask::ect
int ect(void) const
Return earliest completion time.
Definition task.hpp:60
Gecode::Int::Unary::ManFixPTask::_s
Int::IntView _s
Start time.
Definition unary.hh:57
Gecode::Int::Unary::ManFixPTask::_p
int _p
Processing time.
Definition unary.hh:59
Gecode::Int::Unary::ManFixPTask::assigned
bool assigned(void) const
Test whether task is assigned.
Definition task.hpp:98
Gecode::Int::Unary::ManFixPTask::reschedule
void reschedule(Space &home, Propagator &p, PropCond pc)
Schedule propagator p.
Definition task.hpp:152
Gecode::Int::Unary::ManFixPTask::lct
int lct(void) const
Return latest completion time.
Definition task.hpp:68
Gecode::Int::Unary::ManFixPTask::st
IntVar st(void) const
Return start time.
Definition task.hpp:80
Gecode::Int::Unary::ManFixPTask::cancel
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p for task.
Definition task.hpp:148
Gecode::Int::Unary::ManFixPTask::lst
int lst(void) const
Return latest start time.
Definition task.hpp:64
Gecode::Int::Unary::ManFixPTask::update
void update(Space &home, ManFixPTask &t)
Update this task to be a clone of task t.
Definition task.hpp:139
Gecode::Int::Unary::ManFixPTask::mandatory
bool mandatory(void) const
Whether task is mandatory.
Definition task.hpp:85
Gecode::Int::Unary::ManFixPTask::excluded
bool excluded(void) const
Whether task is excluded.
Definition task.hpp:89
Gecode::Int::Unary::ManFixPTask::subscribe
void subscribe(Space &home, Propagator &p, PropCond pc)
Subscribe propagator p to task.
Definition task.hpp:144
Gecode::Int::Unary::ManFlexTask
Unary (mandatory) task with flexible processing time
Definition unary.hh:270
Gecode::Int::Unary::ManFlexTask::lst
int lst(void) const
Return latest start time.
Definition task.hpp:339
Gecode::Int::Unary::ManFlexTask::est
int est(void) const
Return earliest start time.
Definition task.hpp:331
Gecode::Int::Unary::ManFlexTask::p
IntVar p(void) const
Return processing time.
Definition task.hpp:359
Gecode::Int::Unary::ManFlexTask::pmin
int pmin(void) const
Return minimum processing time.
Definition task.hpp:347
Gecode::Int::Unary::ManFlexTask::_s
Int::IntView _s
Start time.
Definition unary.hh:273
Gecode::Int::Unary::ManFlexTask::st
IntVar st(void) const
Return start time.
Definition task.hpp:355
Gecode::Int::Unary::ManFlexTask::norun
ModEvent norun(Space &home, int e, int l)
Update such that task cannot run from e to l.
Definition task.hpp:402
Gecode::Int::Unary::ManFlexTask::reschedule
void reschedule(Space &home, Propagator &p, PropCond pc)
Schedule propagator p.
Definition task.hpp:444
Gecode::Int::Unary::ManFlexTask::mandatory
bool mandatory(void) const
Whether task is mandatory.
Definition task.hpp:368
Gecode::Int::Unary::ManFlexTask::subscribe
void subscribe(Space &home, Propagator &p, PropCond pc)
Subscribe propagator p to task.
Definition task.hpp:432
Gecode::Int::Unary::ManFlexTask::ect
int ect(void) const
Return earliest completion time.
Definition task.hpp:335
Gecode::Int::Unary::ManFlexTask::_e
Int::IntView _e
End time.
Definition unary.hh:277
Gecode::Int::Unary::ManFlexTask::pmax
int pmax(void) const
Return maximum processing time.
Definition task.hpp:351
Gecode::Int::Unary::ManFlexTask::e
IntVar e(void) const
Return end time.
Definition task.hpp:363
Gecode::Int::Unary::ManFlexTask::update
void update(Space &home, ManFlexTask &t)
Update this task to be a clone of task t.
Definition task.hpp:425
Gecode::Int::Unary::ManFlexTask::_p
Int::IntView _p
Processing time.
Definition unary.hh:275
Gecode::Int::Unary::ManFlexTask::excluded
bool excluded(void) const
Whether task is excluded.
Definition task.hpp:372
Gecode::Int::Unary::ManFlexTask::lct
int lct(void) const
Return latest completion time.
Definition task.hpp:343
Gecode::Int::Unary::ManFlexTask::cancel
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p for task.
Definition task.hpp:438
Gecode::Int::Unary::ManFlexTask::ManFlexTask
ManFlexTask(void)
Default constructor.
Definition task.hpp:317
Gecode::Int::Unary::ManFlexTask::optional
bool optional(void) const
Whether task can still be optional.
Definition task.hpp:376
Gecode::Int::Unary::ManFlexTask::assigned
bool assigned(void) const
Test whether task is assigned.
Definition task.hpp:381
Gecode::Int::Unary::ManFlexTask::init
void init(IntVar s, IntVar p, IntVar e)
Initialize with start time s, processing time p, end time e.
Definition task.hpp:322
Gecode::Int::Unary::OptFixPSETask
Unary optional task with fixed processing, start or end time.
Definition unary.hh:246
Gecode::Int::Unary::OptFixPSETask::OptFixPSETask
OptFixPSETask(void)
Default constructor.
Definition task.hpp:490
Gecode::Int::Unary::OptFixPSETask::init
void init(TaskType t, IntVar s, int p, BoolVar m)
Initialize with start time s, processing time p, and mandatory flag m.
Definition task.hpp:496
Gecode::Int::Unary::OptFixPTask
Unary optional task with fixed processing time
Definition unary.hh:222
Gecode::Int::Unary::OptFixPTask::init
void init(IntVar s, int p, BoolVar m)
Initialize with start time s, processing time p, and mandatory flag m.
Definition task.hpp:471
Gecode::Int::Unary::OptFixPTask::OptFixPTask
OptFixPTask(void)
Default constructor.
Definition task.hpp:465
Gecode::Int::Unary::OptFlexTask
Unary optional task with flexible processing time
Definition unary.hh:370
Gecode::Int::Unary::OptFlexTask::OptFlexTask
OptFlexTask(void)
Default constructor.
Definition task.hpp:515
Gecode::Int::Unary::OptFlexTask::init
void init(IntVar s, IntVar p, IntVar e, BoolVar m)
Initialize with start time s, processing time p, end time e, and mandatory flag m.
Definition task.hpp:521
Gecode::Iter::Ranges::Singleton
Range iterator for singleton range.
Definition ranges-singleton.hpp:42
Gecode::Propagator
Base-class for propagators.
Definition core.hpp:1064
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::me_failed
bool me_failed(ModEvent me)
Check whether modification event me is failed.
Definition modevent.hpp:54
Gecode::TaskType
TaskType
Type of task for scheduling constraints.
Definition int.hh:1004
Gecode::TT_FIXS
@ TT_FIXS
Definition int.hh:1006
Gecode::TT_FIXE
@ TT_FIXE
Definition int.hh:1007
Gecode::TT_FIXP
@ TT_FIXP
Definition int.hh:1005
Gecode::Int::Unary
Int for unary resources
Gecode::Int::Unary::operator<<
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const ManFixPTaskBwd &t)
Definition task-view.hpp:40
Gecode::Int
Finite domain integers.
Gecode::Int::ME_INT_FAILED
const Gecode::ModEvent ME_INT_FAILED
Domain operation has resulted in failure.
Definition var-type.hpp:52
Gecode::Int::ME_INT_NONE
const Gecode::ModEvent ME_INT_NONE
Domain operation has not changed domain.
Definition var-type.hpp:54
Gecode
Gecode toplevel namespace
Gecode::PropCond
int PropCond
Type for propagation conditions.
Definition core.hpp:72
Gecode::ModEvent
int ModEvent
Type for modification events.
Definition core.hpp:62
forceinline
#define forceinline
Definition config.hpp:187
GECODE_NEVER
#define GECODE_NEVER
Assert that this command is never executed.
Definition macros.hpp:56