42 namespace Test {
namespace Set {
64 for (
int i=0;
i<4;
i++) {
70 if (xi.
min() <= oldMax)
90 :
SetTest(
"Sequence::SeqU"+str(n0),n0+1,ds_33,false), n(n0) {}
94 for (
int i=0;
i<
n;
i++) {
100 if (xi.
min() <= oldMax)
106 isrs[
i].init(x.
lub, x[
i]);
122 for (
int i=x.
size()-1;
i--;)
SeqU(int n0)
Create and register test.
const int min
Smallest allowed integer in integer set.
Test for sequence constraint
Fake space for creation of regions.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
bool equal(I &i, J &j)
Check whether range iterators i and j are equal.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
void sequence(Home home, const IntVarArgs &x, const IntSet &s, int q, int l, int u, IntConLevel)
Post propagator for .
Sequence(const char *t)
Create and register test.
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
int ranges(void) const
Return number of ranges of the specification.
Range iterator for union of iterators.
Gecode::IntSet lub
The common superset for all domains.
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
union Gecode::@518::NNF::@57 u
Union depending on nodetype t.
Node * x
Pointer to corresponding Boolean expression node.
Test for sequential-union constraint
Base class for tests with set constraints
Generate all set assignments.
Range iterator producing subsets of an IntSet.
Sequence _sequence("Sequence::Sequence")
Gecode toplevel namespace
int size(void) const
Return size of array (number of elements)
int max(int i) const
Return maximum of range at position i.
int min(int i) const
Return minimum of range at position i.