39 using namespace Gecode;
93 (
f[0] >= (
b.f[0].max()+
step)) ||
94 (
f[1] >= (
b.f[1].max()+
step)) ||
95 (
f[1] <= (
b.f[1].min()-
step)));
98 virtual void print(std::ostream& os)
const {
99 os <<
"XY " <<
f[0].med() <<
" " <<
f[1].med()
108 int main(
int argc,
char* argv[]) {
113 Script::run<CartesianHeart,BAB,Options>(
opt);
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
int p
Number of positive literals for node type.
int main(int argc, char *argv[])
Main-function.
CartesianHeart(const Options &opt)
Actual model.
CartesianHeart(CartesianHeart &p)
Constructor for cloning p.
virtual void print(std::ostream &os) const
Print solution coordinates.
FloatNum step
Minimum distance between two solutions.
virtual void constrain(const Space &_b)
Add constraints to current model to get next solution (not too close)
virtual Space * copy(void)
Copy during cloning.
FloatVarArray f
The numbers.
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
Parametric base-class for scripts.
void solutions(unsigned int n)
Set default number of solutions to search for.
void step(double s)
Set default step value.
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
void nroot(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n\geq 0$.
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
double FloatNum
Floating point number base type.
const Gecode::FloatNum step