40 namespace Gecode {
namespace Int {
namespace Branch {
62 for (
unsigned int i=0;
i<
n+1;
i++) {
81 for (
unsigned int i=0;
i<
n+1;
i++) {
unsigned int alternatives(void) const
Return number of alternatives.
virtual ~PosValuesChoice(void)
Deallocate.
virtual size_t size(void) const
Report size occupied.
PosValuesChoice(const Brancher &b, const Pos &p, IntView x)
Initialize choice for brancher b, position p, and view x.
virtual void archive(Archive &e) const
Archive into e.
Range iterator for integer variable views
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
int p
Number of positive literals for node type.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from heap.
Gecode::IntArgs i(4, 1, 2, 3, 4)
Base-class for branchers.
int n
Number of negative literals for node type.
unsigned int size(I &i)
Size of all ranges of range iterator i.
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
Post propagator for SetVar SetOpType SetVar SetRelType r
Integer view for integer variables.
void free(T *b, long unsigned int n)
Delete n objects starting at b.
Heap heap
The single global heap.
Post propagator for SetVar x
virtual void archive(Archive &e) const
Archive into e.
Gecode toplevel namespace