(Revision: 13879)
#include <cstring>
#include <cstdlib>
#include <algorithm>
Go to the source code of this file.
|
| Gecode |
| Gecode toplevel namespace
|
|
#define GECODE_SUPPORT_REALLOC |
( |
|
T | ) |
|
Value:
Heap::realloc<T>(T*
b,
long unsigned int,
long unsigned int m) { \
return
static_cast<T*
>(rrealloc(
b,m*
sizeof(T))); \
} \
Heap::realloc<T>(T*
b,
long int n,
long int m) { \
assert((n >= 0) && (m >= 0)); \
return realloc<T>(
b,
static_cast<long unsigned int>(
n), \
static_cast<long unsigned int>(m)); \
} \
Heap::realloc<T>(T*
b,
unsigned int n,
unsigned int m) { \
return realloc<T>(
b,
static_cast<long unsigned int>(
n), \
static_cast<long unsigned int>(m)); \
} \
Heap::realloc<T>(T*
b,
int n,
int m) { \
assert((n >= 0) && (m >= 0)); \
return realloc<T>(
b,
static_cast<long unsigned int>(
n), \
static_cast<long unsigned int>(m)); \
}
int n
Number of negative literals for node type.
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Definition at line 483 of file heap.hpp.
#define GECODE_SUPPORT_COPY |
( |
|
T | ) |
|
Value:
Heap::copy(T*
d,
const T* s,
long unsigned int n) { \
return static_cast<T*>(memcpy(d,s,n*sizeof(T))); \
} \
Heap::copy(T* d, const T* s, long int n) { \
assert(n >= 0); \
return copy<T>(
d,s,
static_cast<long unsigned int>(
n)); \
} \
Heap::copy(T*
d,
const T* s,
unsigned int n) { \
return copy<T>(
d,s,
static_cast<long unsigned int>(
n)); \
} \
Heap::copy(T*
d,
const T* s,
int n) { \
assert(n >= 0); \
return copy<T>(
d,s,
static_cast<long unsigned int>(
n)); \
}
int n
Number of negative literals for node type.
Definition at line 575 of file heap.hpp.