76 : f(*this,2,-20,20), step(0.01) {
86 :
Script(share,p), step(p.step) {
97 (f[0] >= (b.
f[0].max()+
step)) ||
98 (f[1] >= (b.
f[1].max()+
step)) ||
99 (f[1] <= (b.
f[1].min()-
step)));
102 virtual void print(std::ostream& os)
const {
103 os <<
"XY " << f[0].med() <<
" " << f[1].med()
112 int main(
int argc,
char* argv[]) {
114 opt.
parse(argc,argv);
116 Script::run<CartesianHeart,BAB,Options>(
opt);
virtual Space * copy(bool share)
Copy during cloning.
FloatNum step
Minimum distance between two solutions.
const Gecode::FloatNum step
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 0$.
int main(int argc, char *argv[])
Main-function.
CartesianHeart(bool share, CartesianHeart &p)
Constructor for cloning p.
FloatVarArray f
The numbers.
Parametric base-class for scripts.
CartesianHeart(const Options &)
Actual model.
void update(Space &, bool share, VarArray< Var > &a)
Update array to be a clone of array a.
int p
Number of positive literals for node type.
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
virtual void constrain(const Space &_b)
Add constraints to current model to get next solution (not too close)
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
void solutions(unsigned int n)
Set default number of solutions to search for.
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
BrancherHandle branch(Home home, const FloatVarArgs &x, FloatVarBranch vars, FloatValBranch vals, FloatBranchFilter bf, FloatVarValPrint vvp)
Branch over x with variable selection vars and value selection vals.
virtual void print(std::ostream &os) const
Print solution coordinates.
double FloatNum
Floating point number base type.