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));
115 t[
i].update(home,share,
a.t[
i]);
119 template<
class Char,
class Traits,
class Task>
120 std::basic_ostream<Char,Traits>&
123 std::basic_ostringstream<Char,Traits> s;
124 s.copyfmt(os); s.width(0);
128 for (
int i=1;
i<
t.size();
i++)
132 return os << s.str();
139 template<
class TaskView>
144 template<
class TaskView>
150 template<
class TaskView>
156 template<
class TaskView>
159 return static_cast<TaskView&>(
t[
i]);
161 template<
class TaskView>
164 return static_cast<const TaskView&>(
t[
i]);
167 template<
class Char,
class Traits,
class TaskView>
168 std::basic_ostream<Char,Traits>&
171 std::basic_ostringstream<Char,Traits> s;
172 s.copyfmt(os); s.width(0);
176 for (
int i=1;
i<
t.size();
i++)
180 return os << s.str();
void cancel(Space &home, Propagator &p, IntSet &y)
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.
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
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.
TaskView & operator[](int i)
Return task view at position i.
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const IdxViewArray< View > &x)
Gecode toplevel namespace
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const FloatView &x)
Print float variable view.
void reschedule(Space &home, Propagator &p, IntSet &y)