56 if ((
dsv[i].
max() <
d.max()) || (i == 0))
74 if ((
dsv[i].
max() <
d.max()) || (i == 0)) {
75 if (
curPb->extendAssignement(*
this))
return;
76 if ((
dsv[i].
max() >=
d.max()) && (i == 0))
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) ?
"," :
"}");
156 olog <<
ind(2) <<
"Initial: x[]=" <<
x
166 olog <<
ind(2) <<
"Initial: x[]=" <<
x
173 x.update(*
this, s.
x);
198 for (
int i =
x.size(); i--; )
204 for (
int i=
x.size(); i--; )
212 for (
int i=
x.size(); i--; )
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;
274 for (
int j=a.
size(); j--; )
293 i = (i+1) %
x.size();
309 for (
int j=
x.size(); j--; ) {
310 if (!
x[j].
assigned() && (
x[j].size() >
x[i].size())) i = j;
313 if (cutDirections[i]) {
314 FloatNum m =
r.div_up(
r.add_up(
x[i].min(),
x[i].max()),2);
321 FloatNum m =
r.div_down(
r.add_down(
x[i].min(),
x[i].max()),2);
337 assert((v >=
x[i].
min()) && (v <=
x[i].
max()));
342 assert((v <=
x[i].
max()) && (v >=
x[i].
min()));
353 i = (i+1) %
x.size();
363 i = (i+1) %
x.size();
371 assert((v >= a[i].
max()) && (v <=
x[i].
max()));
380 assert((v <= a[i].
min()) && (v >=
x[i].
min()));
390 olog <<
ind(3) <<
"Testing fixpoint on copy" << std::endl;
393 delete c;
return false;
395 for (
int i=
x.size(); i--; )
396 if (
x[i].size() !=
c->x[i].size()) {
397 delete c;
return false;
399 if (
reified && (
r.var().size() !=
c->r.var().size())) {
400 delete c;
return false;
403 olog <<
ind(3) <<
"Finished testing fixpoint on copy" << std::endl;
443 if (
const_cast<TestSpace&
>(ts).propagators() == 0)
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)");
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, <=)");
787 problem =
"No fixpoint";
810 problem =
"No fixpoint";
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;
Boolean integer variables.
int val(void) const
Return assigned value.
Depth-first search engine.
friend FloatVal max(const FloatVal &x, const FloatVal &y)
friend FloatVal min(const FloatVal &x, const FloatVal &y)
FloatNum size(void) const
Return size of float value (distance between maximum and minimum)
Floating point rounding policy.
void threads(double n)
Set number of parallel threads.
static PropagatorGroup all
Group of all propagators.
Reification specification.
BoolVar var(void) const
Return Boolean control variable.
ReifyMode mode(void) const
Return reification mode.
virtual T * next(void)
Return next solution (NULL, if none exists or search has been stopped)
struct Gecode::Space::@055132133326276162005044145100211202071356247106::@155123175027073262103111264343315000271204104107 c
Data available only during copying.
bool assigned(void) const
Test if all variables are assigned.
bool assigned(void) const
Test whether view is assigned.
static Gecode::Support::RandomGenerator rand
Random number generator.
static bool fixpoint(void)
Throw a coin whether to compute a fixpoint.
Base class for assignments
int n
Number of variables.
Gecode::FloatVal d
Domain for each variable.
Generate all assignments.
virtual void operator++(void)
Move to next assignment.
Gecode::FloatNum step
Step for next assignment.
Gecode::FloatVal * dsv
Iterator for each variable.
Generate all assignments except the last variable and complete it to get a solution.
Gecode::FloatVal * dsv
Iterator for each variable.
virtual void operator++(void)
Move to next assignment.
Gecode::FloatNum step
Step for next assignment.
const Test * curPb
Current problem used to complete assignment.
Generate random selection of assignments.
Gecode::FloatNum randval(void)
Gecode::FloatVal * vals
The current values for the variables.
virtual void operator++(void)
Move to next assignment.
int a
How many assigments still to be generated Generate new value according to domain.
Space for executing tests.
Gecode::FloatVarArray x
Variables to be tested.
void prune(void)
Prune some random values for some random variable.
Gecode::FloatNum cut(int *cutDirections)
Cut the bigger variable to an half sized interval. It returns the new size of the cut interval....
bool matchAssignment(const Assignment &a) const
Test whether all variables match assignment a.
Gecode::Reify r
Reification information.
void bound(void)
Assing a random variable to a random bound.
unsigned int propagators(void)
Return the number of propagators.
void prune(int i)
Prune some random values from variable i.
void disable(void)
Disable propagators in space and compute fixpoint (make all idle)
Gecode::FloatVal d
Initial domain.
void post(void)
Post propagator.
TestSpace(int n, Gecode::FloatVal &d, Gecode::FloatNum s, Test *t)
Create test space.
Test * test
The test currently run.
bool reified
Whether the test is for a reified propagator.
void enable(void)
Enable propagators in space.
bool failed(void)
Compute a fixpoint and check for failure.
bool assigned(void) const
Test whether all variables are assigned.
virtual void dropUntil(const Assignment &a)
Add constraints to skip solutions to the a assignment.
Gecode::FloatNum step
Step for going to next solution.
void rel(int i, Gecode::FloatRelType frt, Gecode::FloatVal n)
Perform integer tell operation on x[i].
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 ...
virtual Gecode::Space * copy(void)
Copy space during cloning.
bool testsubsumed
Whether to test for subsumption.
virtual bool extendAssignement(Assignment &a) const
Complete the current assignment to get a feasible one (which satisfies all constraint)....
bool testfix
Whether to perform fixpoint test.
bool eqv(void) const
Test whether equivalence as reification mode is supported.
int arity
Number of variables.
virtual void post(Gecode::Space &home, Gecode::FloatVarArray &x)=0
Post constraint.
virtual bool run(void)
Perform test.
Gecode::FloatNum step
Step for going to next solution.
virtual Assignment * assignment(void) const
Create assignment.
bool pmi(void) const
Test whether reverse implication as reification mode is supported.
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...
bool reified
Does the constraint also exist as reified constraint.
bool testsearch
Whether to perform search test.
virtual bool ignore(const Assignment &a) const
Whether to ignore assignment for reification.
virtual MaybeType solution(const Assignment &) const =0
Check for solution.
AssignmentType assigmentType
Gives the type of assignment to use.
Gecode::FloatVal dom
Domain of variables.
bool imp(void) const
Test whether implication as reification mode is supported.
Simple class for describing identation.
void branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf=nullptr, FloatVarValPrint vvp=nullptr)
Branch over x with variable selection vars and value selection vals.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
double FloatNum
Floating point number base type.
FloatRelType
Relation types for floats.
@ FRT_LQ
Less or equal ( )
@ FRT_GQ
Greater or equal ( )
ReifyMode
Mode for reification.
@ RM_IMP
Implication for reification.
@ RM_PMI
Inverse implication for reification.
@ RM_EQV
Equivalence for reification (default)
Space(void)
Default constructor.
SpaceStatus status(StatusStatistics &stat=unused_status)
Query space status.
Space * clone(CloneStatistics &stat=unused_clone) const
Clone space.
@ SS_FAILED
Space is failed
bool overlap(const FloatVal &x, const FloatVal &y)
Numerical limits for integer variables.
const int max
Largest allowed integer value.
Gecode toplevel namespace
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
FloatVarBranch FLOAT_VAR_NONE(void)
Select first unassigned variable.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
Gecode::FloatNum randFValDown(Gecode::FloatNum l, Gecode::FloatNum u)
MaybeType
Type for comparisons and solutions.
Gecode::FloatNum randFValUp(Gecode::FloatNum l, Gecode::FloatNum u)
std::ostringstream olog
Stream used for logging.
#define GECODE_NEVER
Assert that this command is never executed.
#define START_TEST(T)
Start new test.
#define CHECK_TEST(T, M)
Check the test result and handle failed test.
std::ostream & operator<<(std::ostream &os, const Test::Float::Assignment &a)