41 namespace Gecode {
namespace Int {
namespace LDSB {
48 if (indices.valid(
l._variable) && indices.get(
l._variable)) {
67 if (indices.valid(
l._variable) && indices.get(
l._variable)) {
94 lits[j++] =
Literal(
l._variable,
i.val());
113 lits[j++] =
Literal(
l._variable,
i.val());
127 std::pair<int,int> location =
findVar(
values, n_values, seq_size,
l._value);
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;
147 std::pair<int,int> location =
findVar(
values, n_values, seq_size,
l._value);
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;
virtual ArgArray< Literal > symmetric(Literal, const ViewArray< View > &) const
Compute symmetric literals.
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.
virtual ArgArray< Literal > symmetric(Literal, const ViewArray< View > &) const
Compute symmetric literals.
Gecode::IntArgs i(4, 1, 2, 3, 4)
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.
Value iterator for values in an offset bitset.
Heap heap
The single global heap.
Stack with arbitrary number of elements.
void values(Home home, const IntVarArgs &x, IntSet y, IntPropLevel ipl=IPL_DEF)
Post constraint .
Post propagator for SetVar x
Gecode toplevel namespace
ArgArray< T > dynamicStackToArgArray(const Support::DynamicStack< T, A > &s)
Convert a DynamicStack<T,A> into an ArgArray<T>
void push(const T &x)
Push element x on top of stack.
Bitsets with index offset.