#include <cstring>
#include <cstdlib>
#include <algorithm>
Go to the source code of this file.
|
| Gecode |
| Gecode toplevel namespace
|
|
◆ GECODE_SUPPORT_REALLOC
#define GECODE_SUPPORT_REALLOC |
( |
|
T | ) |
|
Value:template<> \
forceinline T* \
Heap::realloc<T>(T*
b,
long unsigned int,
long unsigned int m) { \
return
static_cast<T*
>(rrealloc(
b,m*
sizeof(T))); \
} \
template<> \
forceinline 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)); \
} \
template<> \
forceinline T* \
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)); \
} \
template<> \
forceinline T* \
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::@593::NNF::@62::@63 b
For binary nodes (and, or, eqv)
Definition at line 514 of file heap.hpp.
◆ GECODE_SUPPORT_COPY
#define GECODE_SUPPORT_COPY |
( |
|
T | ) |
|
Value:template<> \
forceinline T* \
Heap::copy(T*
d,
const T* s,
long unsigned int n) { \
} \
template<> \
forceinline 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)); \
} \
template<> \
forceinline T* \
Heap::copy(T* d, const T* s, unsigned int n) { \
return copy<T>(
d,s,
static_cast<long unsigned int>(
n)); \
} \
template<> \
forceinline T* \
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.
void * memcpy(void *d, const void *s, size_t n)
Copy n bytes from source s directly to d and returns d.
Allocator allocator
The single global default memory allocator.
Definition at line 606 of file heap.hpp.