36 namespace Gecode {
namespace Support {
43 template<
class T,
class A>
81 template<
class T,
class A>
84 : a(a0), n(n0), x(a.template alloc<T>(n)) {}
86 template<
class T,
class A>
89 :
a(a0),
n(static_cast<int>(n0)),
x(
a.template alloc<T>(
n)) {}
91 template<
class T,
class A>
94 :
a(da.
a),
n(da.
n),
x(
a.template alloc<T>(
n)) {
98 template<
class T,
class A>
104 template<
class T,
class A>
109 a.free(
x,
n);
n = da.n;
x =
a.template alloc<T>(
n);
116 template<
class T,
class A>
120 x =
a.realloc(
x,
n,m);
124 template<
class T,
class A>
127 if (i >=
n) resize(i);
132 template<
class T,
class A>
135 return operator [](static_cast<int>(i));
138 template<
class T,
class A>
145 template<
class T,
class A>
148 return operator [](static_cast<int>(i));
151 template<
class T,
class A>
const DynamicArray< T, A > & operator=(const DynamicArray< T, A > &da)
Assign array (copy elements from a)
static T * copy(T *d, const T *s, long unsigned int n)
Copy n objects starting at s to d.
const FloatNum max
Largest allowed float value.
Array with arbitrary number of elements.
DynamicArray(A &a0, int n=32)
Initialize with size n.
T & operator[](int i)
Return element at position i (possibly resize)
int n
Number of negative literals for node type.
Gecode::IntArgs i({1, 2, 3, 4})
Node * x
Pointer to corresponding Boolean expression node.
Heap heap
The single global heap.
~DynamicArray(void)
Release memory.
Gecode toplevel namespace
struct Gecode::@593::NNF::@62::@64 a
For atomic nodes.