Go to the documentation of this file.
43 namespace Test {
namespace Float {
75 if (curPb->extendAssignement(*
this))
return;
90 for (
int i =
n;
i--; )
101 for (
int i=0;
i<
n;
i++)
102 os <<
"[" <<
a[
i].
min() <<
"," <<
a[
i].max() <<
"]" << ((
i!=
n-1) ?
"," :
"}");
106 namespace Test {
namespace Float {
156 olog <<
ind(2) <<
"Initial: x[]=" <<
x
166 olog <<
ind(2) <<
"Initial: x[]=" <<
x
223 olog <<
ind(3) <<
"Posting reified propagator" << std::endl;
227 olog <<
ind(3) <<
"Posting propagator" << std::endl;
234 olog <<
ind(3) <<
"Fixpoint: " <<
x;
236 olog << std::endl <<
ind(3) <<
" --> " <<
x << std::endl;
246 olog <<
ind(4) <<
"x[" <<
i <<
"] ";
255 olog <<
" [" <<
n.min() <<
"," <<
n.max() <<
"]" << std::endl;
265 olog <<
ind(4) <<
"b = " <<
n << std::endl;
272 int i = skip ?
static_cast<int>(
Base::rand(
a.size())) : -1;
274 for (
int j=
a.size(); j--; )
276 if ((
x[j].
min() ==
a[j].
max()) || (
x[j].max() ==
a[j].min()))
309 for (
int j=
x.
size(); j--; ) {
313 if (cutDirections[
i]) {
390 olog <<
ind(3) <<
"Testing fixpoint on copy" << std::endl;
393 delete c;
return false;
396 if (
x[
i].
size() !=
c->x[
i].size()) {
397 delete c;
return false;
400 delete c;
return false;
403 olog <<
ind(3) <<
"Finished testing fixpoint on copy" << std::endl;
421 switch (assigmentType) {
442 if (!testsubsumed)
return true;
449 #define CHECK_TEST(T,M) \
451 olog << ind(3) << "Check: " << (M) << std::endl; \
453 problem = (M); delete s; goto failed; \
457 #define START_TEST(T) \
460 olog << ind(2) << "Testing: " << (T) << std::endl; \
476 const char*
test =
"NONE";
477 const char* problem =
"NONE";
485 post(*search_s,search_s->
x);
493 olog <<
ind(1) <<
"Assignment: " <<
a;
509 olog <<
ind(3) <<
"No copy" << std::endl;
515 olog <<
ind(3) <<
"Copy" << std::endl;
522 default: assert(
false);
533 START_TEST(
"Partial assignment (after posting)");
548 START_TEST(
"Assignment (after posting, disable)");
563 START_TEST(
"Partial assignment (after posting, disable)");
593 START_TEST(
"Partial assignment (before posting)");
613 if (!s->
prune(
a,testfix)) {
614 problem =
"No fixpoint";
629 START_TEST(
"Assignment reified (rewrite after post, <=>)");
639 START_TEST(
"Assignment reified (rewrite after post, =>)");
649 START_TEST(
"Assignment reified (rewrite after post, <=)");
659 START_TEST(
"Assignment reified (immediate rewrite, <=>)");
669 START_TEST(
"Assignment reified (immediate rewrite, =>)");
679 START_TEST(
"Assignment reified (immediate rewrite, <=)");
689 START_TEST(
"Assignment reified (before posting, <=>)");
705 START_TEST(
"Assignment reified (before posting, =>)");
719 START_TEST(
"Assignment reified (before posting, <=)");
735 START_TEST(
"Assignment reified (after posting, <=>)");
751 START_TEST(
"Assignment reified (after posting, =>)");
765 START_TEST(
"Assignment reified (after posting, <=)");
786 if (!s->
prune(
a,testfix)) {
787 problem =
"No fixpoint";
809 if (!s->
prune(
a,testfix)) {
810 problem =
"No fixpoint";
830 if (!s->
prune(
a,testfix)) {
831 problem =
"No fixpoint";
849 if (!search_s->
failed()) {
859 for (
int i=
a.size();
i--; ) {
872 if (!search_s->
failed()) {
879 if (e_s->
next() != NULL) {
880 problem =
"Excess solutions";
892 olog <<
"FAILURE" << std::endl
893 <<
ind(1) <<
"Test: " <<
test << std::endl
894 <<
ind(1) <<
"Problem: " << problem << std::endl;
896 olog <<
ind(1) <<
"Assignment: " <<
a << std::endl;
void disable(void)
Disable propagators in space and compute fixpoint (make all idle)
virtual Assignment * assignment(void) const
Create assignment.
virtual void operator++(void)
Move to next assignment.
Gecode::FloatNum cut(int *cutDirections)
Cut the bigger variable to an half sized interval. It returns the new size of the cut interval....
const Gecode::FloatNum step
virtual T * next(void)
Return next solution (NULL, if none exists or search has been stopped)
Gecode::Reify r
Reification information.
friend FloatVal max(const FloatVal &x, const FloatVal &y)
virtual Gecode::Space * copy(void)
Copy space during cloning.
#define START_TEST(T)
Start new test.
@ RM_PMI
Inverse implication for reification.
Gecode::FloatNum randFValDown(Gecode::FloatNum l, Gecode::FloatNum u)
friend FloatVal min(const FloatVal &x, const FloatVal &y)
unsigned int size(I &i)
Size of all ranges of range iterator i.
struct Gecode::Space::@61::@63 c
Data available only during copying.
Reify eqv(BoolVar x)
Use equivalence for reification.
bool matchAssignment(const Assignment &a) const
Test whether all variables match assignment a.
void branch(Home home, const IntVarArgs &x, const BoolVarArgs &y, IntBoolVarBranch vars, IntValBranch vals)
Branch function for integer and Boolean variables.
unsigned int size(Space &home) const
Return number of propagators in a group.
Gecode::FloatVal * dsv
Iterator for each variable.
bool reified
Does the constraint also exist as reified constraint.
@ RM_IMP
Implication for reification.
virtual bool extendAssignement(Assignment &a) const
Complete the current assignment to get a feasible one (which satisfies all constraint)....
FloatVarBranch FLOAT_VAR_NONE(void)
Select first unassigned variable.
void disable(Space &home)
Disable all propagators in a group.
const FloatNum min
Smallest allowed float value.
bool assigned(void) const
Test whether all variables are assigned.
ExecStatus subsumed(Space &home, Propagator &p, int c, TaskArray< Task > &t)
Check for subsumption (all tasks must be assigned)
Depth-first search engine.
bool reified
Whether the test is for a reified propagator.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x)=0
Post constraint.
FloatRelType
Relation types for floats.
bool assigned(void) const
Test whether view is assigned.
static Gecode::Support::RandomGenerator rand
Random number generator.
int size(void) const
Return size of array (number of elements)
bool failed(void)
Compute a fixpoint and check for failure.
virtual bool run(void)
Perform test.
void prune(int i)
Prune some random values from variable i.
Test * test
The test currently run.
Gecode::FloatNum randFValUp(Gecode::FloatNum l, Gecode::FloatNum u)
bool assigned(void) const
Test if all variables are assigned.
bool subsumed(const TestSpace &ts) const
Test if ts is subsumed or not (i.e. if there is no more propagator unless the assignment is an extend...
Gecode toplevel namespace
void enable(Space &home, bool s=true)
Enable all propagators in a group.
Space * clone(CloneStatistics &stat=unused_clone) const
Clone space.
union Gecode::@602::NNF::@65 u
Union depending on nodetype t.
Reify pmi(BoolVar x)
Use reverse implication for reification.
Gecode::FloatVarArray x
Variables to be tested.
unsigned int propagators(void)
Return the number of propagators.
Generate all assignments.
Node * x
Pointer to corresponding Boolean expression node.
Gecode::FloatVal d
Initial domain.
static PropagatorGroup all
Group of all propagators.
Reification specification.
TestSpace(int n, Gecode::FloatVal &d, Gecode::FloatNum s, Test *t)
Create test space.
@ RM_EQV
Equivalence for reification (default)
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
bool log
Whether to log the tests.
std::ostream & operator<<(std::ostream &os, const Test::Float::Assignment &a)
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
double FloatNum
Floating point number base type.
Boolean integer variables.
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
Floating point rounding policy.
void rel(int i, Gecode::FloatRelType frt, Gecode::FloatVal n)
Perform integer tell operation on x[i].
@ FRT_LQ
Less or equal ( )
static bool fixpoint(void)
Throw a coin whether to compute a fixpoint.
Gecode::FloatVal d
Domain for each variable.
#define GECODE_NEVER
Assert that this command is never executed.
Gecode::FloatNum step
Step for going to next solution.
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
virtual void operator++(void)
Move to next assignment.
void bound(void)
Assing a random variable to a random bound.
BoolVar var(void) const
Return Boolean control variable.
Generate random selection of assignments.
virtual bool ignore(const Assignment &a) const
Whether to ignore assignment for reification.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
bool overlap(const FloatVal &x, const FloatVal &y)
@ FRT_GQ
Greater or equal ( )
Gecode::FloatNum step
Step for going to next solution.
Space for executing tests.
ReifyMode
Mode for reification.
virtual void operator++(void)
Move to next assignment.
Simple class for describing identation.
void threads(double n)
Set number of parallel threads.
MaybeType
Type for comparisons and solutions.
void enable(void)
Enable propagators in space.
ReifyMode mode(void) const
Return reification mode.
void post(void)
Post propagator.
Generate all assignments except the last variable and complete it to get a solution.
Base class for assignments
Reify imp(BoolVar x)
Use implication for reification.
int val(void) const
Return assigned value.
virtual void dropUntil(const Assignment &a)
Add constraints to skip solutions to the a assignment.
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Gecode::FloatNum step
Step for next assignment.
#define CHECK_TEST(T, M)
Check the test result and handle failed test.
int n
Number of negative literals for node type.
void assign(const Assignment &a, MaybeType &sol, bool skip=false)
Assign all (or all but one, if skip is true) variables to values in a If assignment of a variable is ...
void prune(void)
Prune some random values for some random variable.
int n
Number of variables.
std::ostringstream olog
Stream used for logging.
Gecode::IntArgs i({1, 2, 3, 4})
@ SS_FAILED
Space is failed
const FloatNum max
Largest allowed float value.
void update(Space &home, VarArray< Var > &a)
Update array to be a clone of array a.
unsigned int size(void) const
Return size (cardinality) of domain.