36 namespace Gecode {
namespace Int {
38 template<
class TaskView, SortTaskOrder sto,
bool inc>
42 template<
class TaskView, SortTaskOrder sto,
bool inc>
47 sort<TaskView,sto,!inc>(map,
t);
50 template<
class TaskView, SortTaskOrder sto,
bool inc>
55 template<
class TaskView, SortTaskOrder sto,
bool inc>
60 template<
class TaskView, SortTaskOrder sto,
bool inc>
66 template<
class TaskView, SortTaskOrder sto,
bool inc>
73 template<
class OptTaskView, SortTaskOrder sto,
bool inc>
77 map =
r.alloc<
int>(
t.size());
i=0;
78 for (
int j=0; j<
t.size(); j++)
81 sort<OptTaskView,sto,!inc>(map,
i,
t);
ManTaskViewIter(Region &r, const TaskViewArray< OptTaskView > &t)
Initialize iterator with mandatory tasks.
void operator++(void)
Move iterator to next task.
bool operator()(void) const
Test whether iterator is still at a task.
int task(void) const
Return current task position.
int left(void) const
How many tasks are left to be iterated.
TaskViewIter(void)
Default constructor (no initialization)
unsigned int size(I &i)
Size of all ranges of range iterator i.
Gecode::IntArgs i({1, 2, 3, 4})