41 namespace Gecode {
namespace Int {
namespace LDSB {
129 unsigned int seqNum = location.first;
130 unsigned int seqPos = location.second;
131 if (! dead_sequences.get(seqNum)) {
132 for (
unsigned int seq = 0 ; seq < n_seqs ; seq++) {
133 if (seq == seqNum)
continue;
134 if (dead_sequences.get(seq))
continue;
149 unsigned int seqNum = location.first;
150 unsigned int seqPos = location.second;
151 if (! dead_sequences.get(seqNum)) {
152 for (
unsigned int seq = 0 ; seq < n_seqs ; seq++) {
153 if (seq == seqNum)
continue;
154 if (dead_sequences.get(seq))
continue;
A Literal is a pair of variable index and value.
std::pair< int, int > findVar(int *indices, unsigned int n_values, unsigned int seq_size, int index)
Find the location of an integer in a collection of sequences.
int _value
The value of the literal. For int and bool variables, this is the value itself; for set variables...
int _variable
Variable index. The ViewArray that the index is meant for is assumed to be known by context...
Heap heap
The single global heap.
virtual ArgArray< Literal > symmetric(Literal, const ViewArray< View > &) const
Compute symmetric literals.
Gecode::IntArgs i(4, 1, 2, 3, 4)
virtual ArgArray< Literal > symmetric(Literal, const ViewArray< View > &) const
Compute symmetric literals.
int n
Number of negative literals for node type.
Argument array for non-primitive types.
virtual ArgArray< Literal > symmetric(Literal, const ViewArray< View > &) const
Compute symmetric literals.
void values(Home home, const IntVarArgs &x, IntSet y, IntConLevel icl=ICL_DEF)
Post constraint .
Value iterator for values in an offset bitset.
Node * x
Pointer to corresponding Boolean expression node.
Stack with arbitrary number of elements.
Gecode toplevel namespace
ArgArray< T > dynamicStackToArgArray(const Support::DynamicStack< T, A > &s)
Convert a DynamicStack into an ArgArray
void push(const T &x)
Push element x on top of stack.
Bitsets with index offset.