34 namespace Gecode {
namespace Int {
47 :
n(n0),
t(home.alloc<Task>(
n)) {
75 assert((i >= 0) && (i <
n));
81 assert((i >= 0) && (i <
n));
88 for (
int i=0;
i<
n;
i++)
95 for (
int i=0;
i<
n;
i++)
102 for (
int i=0;
i<
n;
i++)
110 for (
int i=0;
i<
n;
i++)
115 template<
class Char,
class Traits,
class Task>
116 std::basic_ostream<Char,Traits>&
117 operator <<(std::basic_ostream<Char,Traits>& os,
119 std::basic_ostringstream<Char,Traits> s;
120 s.copyfmt(os); s.width(0);
128 return os << s.str();
135 template<
class TaskView>
140 template<
class TaskView>
146 template<
class TaskView>
152 template<
class TaskView>
155 return static_cast<TaskView&
>(
t[
i]);
157 template<
class TaskView>
160 return static_cast<const TaskView&
>(
t[
i]);
163 template<
class Char,
class Traits,
class TaskView>
164 std::basic_ostream<Char,Traits>&
165 operator <<(std::basic_ostream<Char,Traits>& os,
167 std::basic_ostringstream<Char,Traits> s;
168 s.copyfmt(os); s.width(0);
176 return os << s.str();
TaskArray< Task > & t
Access to task array.
int size(void) const
Return size of array (number of elements)
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.
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Gecode::IntArgs i({1, 2, 3, 4})
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.
Gecode toplevel namespace
void reschedule(Space &home, Propagator &p, IntSet &y)
void update(IntSet &y, Space &home, IntSet &py)
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.