36 namespace Gecode {
namespace Int {
namespace Branch {
58 for (
unsigned int i=0;
i<
n+1;
i++) {
72 for (
unsigned int i=0;
i<
n+1;
i++) {
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
Node * x
Pointer to corresponding Boolean expression node.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Base-class for branchers.
unsigned int alternatives(void) const
Return number of alternatives.
void free(T *b, long unsigned int n)
Delete n objects starting at b.
T * alloc(long unsigned int n)
Allocate block of n objects of type T from heap.
virtual ~PosValuesChoice(void)
Deallocate.
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.
Integer view for integer variables.
Range iterator for integer variable views
virtual void archive(Archive &e) const
Archive into e.
Heap heap
The single global heap.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Gecode::IntArgs i({1, 2, 3, 4})