43 namespace Test {
namespace Int {
67 for (
int i=0;
i< (
x.size() -
q + 1);
i++ ) {
69 for (
int j=
i; j <
i +
q; j++ ) {
88 int q0,
int l0,
int u0,
int size)
96 for (
int i=0;
i<
x.size();
i++) {
97 c[
i]=Gecode::channel(home,
x[
i]);
100 Gecode::sequence(home,
c,
s,
q,
l,
u);
109 int q0,
int l0,
int u0,
int size,
int min,
int max)
115 Gecode::sequence(home,
x,
s,
q,
l,
u);
125 using namespace Gecode;
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
Node * x
Pointer to corresponding Boolean expression node.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Passing Boolean variables.
Passing integer arguments.
bool in(int n) const
Return whether n is included in the set.
Base class for assignments
Help class to create and register tests.
Create(void)
Perform creation and registration.
Test for sequence with boolean variables
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
SequenceBoolTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size)
Create and register test.
Test for sequence with boolean variables
virtual void post(Gecode::Space &home, Gecode::IntVarArray &x)
Post constraint on x.
SequenceIntTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size, int min, int max)
Create and register test.
virtual bool solution(const Assignment &x) const
Test whether x is solutionin
SequenceTest(const std::string &s, const Gecode::IntSet &s0, int q0, int l0, int u0, int size, int min, int max)
Create and register test.
const FloatNum max
Largest allowed float value.
const FloatNum min
Smallest allowed float value.
unsigned int size(I &i)
Size of all ranges of range iterator i.
Gecode::IntArgs i({1, 2, 3, 4})