38 namespace Gecode {
namespace Int {
51 :
n(n0),
t(home.alloc<Task>(
n)) {
79 assert((
i >= 0) && (
i <
n));
85 assert((
i >= 0) && (
i <
n));
108 t[
i].update(home,share,
a.t[
i]);
112 template<
class Char,
class Traits,
class Task>
113 std::basic_ostream<Char,Traits>&
116 std::basic_ostringstream<Char,Traits> s;
117 s.copyfmt(os); s.width(0);
121 for (
int i=1;
i<
t.size();
i++)
125 return os << s.str();
132 template<
class TaskView>
137 template<
class TaskView>
143 template<
class TaskView>
149 template<
class TaskView>
152 return static_cast<TaskView&>(
t[
i]);
154 template<
class TaskView>
157 return static_cast<const TaskView&>(
t[
i]);
160 template<
class Char,
class Traits,
class TaskView>
161 std::basic_ostream<Char,Traits>&
164 std::basic_ostringstream<Char,Traits> s;
165 s.copyfmt(os); s.width(0);
169 for (
int i=1;
i<
t.size();
i++)
173 return os << s.str();
void cancel(Space &home, Propagator &p, IntSet &y)
TaskView & operator [](int i)
Return task view at position i.
int size(void) const
Return size of array (number of elements)
Base-class for propagators.
TaskArray(void)
Default constructor (array of size 0)
T * alloc(long unsigned int n)
Allocate block of n objects of type T from space heap.
int p
Number of positive literals for node type.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
int PropCond
Type for propagation conditions.
void subscribe(Space &home, Propagator &p, IntSet &y)
unsigned int size(I &i)
Size of all ranges of range iterator i.
struct Gecode::@511::NNF::@54::@56 a
For atomic nodes.
Gecode toplevel namespace
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const FloatView &x)
Print float variable view.
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const TaskArray< Task > &t)