40 #ifndef __GECODE_TEST_INT_HH__ 41 #define __GECODE_TEST_INT_HH__ 208 void prune(
int i,
bool bounds_only);
220 unsigned int propagators(
void);
247 bool eqv(
void)
const;
250 bool imp(
void)
const;
252 bool pmi(
void)
const;
263 Test(
const std::string&
p,
const std::string& s,
274 Test(
const std::string& s,
285 Test(
const std::string&
p,
const std::string& s,
286 int a,
int min,
int max,
bool r=
false,
296 Test(
const std::string& s,
297 int a,
int min,
int max,
bool r=
false,
302 virtual bool solution(
const Assignment&)
const = 0;
311 virtual bool run(
void);
321 static std::string str(
int i);
Gecode::IntSet d
Initial domain.
Gecode::IntVarArray x
Variables to be tested.
void post(Home home, Term *t, int n, FloatRelType frt, FloatVal c)
Post propagator for linear constraint over floats.
int size(void) const
Return number of variables.
int a
How many assigments still to be generated Generate new value according to domain. ...
BoolOpType
Operation types for Booleans.
Gecode::Reify r
Reification information.
Gecode::IntSet dom
Domain of variables.
Space for executing tests.
ConTestLevel contest
Whether to test for certain consistency.
const int max
Largest allowed integer value.
int rms
Which reification modes are supported.
ExecStatus prune(Space &home, ViewArray< VX > &x, ConstIntView)
int _n1
How many variables in the second set.
Generate random selection of assignments.
const int min
Smallest allowed integer value.
Iterator for basic and advanced integer propagation levels.
int n
Number of variables.
virtual int operator[](int i) const =0
Return value for variable i.
Gecode::IntSet d
Domain for each variable.
Reify imp(BoolVar x)
Use implication for reification.
struct Gecode::@579::NNF::@61::@63 a
For atomic nodes.
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
Gecode::IntArgs i(4, 1, 2, 3, 4)
Generate random selection of assignments.
IntRelType
Relation types for integers.
ConTestLevel
Level of consistency to test for.
int a
How many assigments still to be generated.
Simple propagation levels.
int * vals
The current values for the variables.
Iterator for integer relation types.
virtual void operator++(void)=0
Move to next assignment.
Reification specification.
Base class for all tests to be run
Gecode::IntSetValues * dsv
Iterator for each variable.
Test for bounds(z)-consistency.
Test for bounds(d)-consistency.
Test for domain-consistency.
Reify eqv(BoolVar x)
Use equivalence for reification.
Gecode::IntPropLevel ipl
Propagation level.
Passing integer arguments.
std::basic_ostream< Char, Traits > & operator<<(std::basic_ostream< Char, Traits > &os, const Dictionary &d)
Print statistics summary.
bool testfix
Whether to perform fixpoint test.
IntPropLevel
Propagation levels for integer propagators.
Post propagator for SetVar SetOpType SetVar y
Gecode::IntSet _d1
Domain for second set of variables Generate new value according to domain d.
Node * x
Pointer to corresponding Boolean expression node.
Assignment(int n0, const Gecode::IntSet &d0)
Initialize assignments for n0 variables and values d0.
bool testsearch
Whether to perform search test.
Base class for assignments
bool assigned(View x, int v)
Whether x is assigned to value v.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Value iterator for integer sets.
Iterator for Boolean operation types.
int arity
Number of variables.
virtual bool operator()(void) const =0
Test whether all assignments have been iterated.
void assign(Home home, const FloatVarArgs &x, FloatAssign fa, FloatBranchFilter bf, FloatVarValPrint vvp)
Assign all x with value selection vals.
virtual ~Assignment(void)
Destructor.
Test * test
The test currently run.
ReifyMode
Mode for reification.
bool reified
Does the constraint also exist as reified constraint.
Generate all assignments.
Iterator for simple integer propagation levels.
int * vals
The current values for the variables.
Reify pmi(BoolVar x)
Use reverse implication for reification.
bool reified
Whether the test is for a reified propagator.