37namespace Gecode {
namespace Int {
namespace LDSB {
41 VariableSymmetryImp<IntView>
126 unsigned int seqNum = location.first;
127 unsigned int seqPos = location.second;
128 if (! dead_sequences.get(seqNum)) {
129 for (
unsigned int seq = 0 ; seq < n_seqs ; seq++) {
130 if (seq == seqNum)
continue;
131 if (dead_sequences.get(seq))
continue;
147 unsigned int seqNum = location.first;
148 unsigned int seqPos = location.second;
149 if (! dead_sequences.get(seqNum)) {
150 for (
unsigned int seq = 0 ; seq < n_seqs ; seq++) {
151 if (seq == seqNum)
continue;
152 if (dead_sequences.get(seq))
continue;
Argument array for non-primitive types.
A Literal is a pair of variable index and value.
int _variable
Variable index. The ViewArray that the index is meant for is assumed to be known by context.
int _value
The value of the literal. For int and bool variables, this is the value itself; for set variables,...
Implementation of a value sequence symmetry.
Implementation of a value symmetry.
Implementation of a variable symmetry.
Value iterator for values in an offset bitset.
Bitsets with index offset.
Stack with arbitrary number of elements.
void push(const T &x)
Push element x on top of stack.
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.
ArgArray< T > dynamicStackToArgArray(const Support::DynamicStack< T, A > &s)
Convert a DynamicStack<T,A> into an ArgArray<T>
Gecode toplevel namespace
void values(Home home, const IntVarArgs &x, IntSet y, IntPropLevel ipl=IPL_DEF)
Post constraint .
Post propagator for SetVar x