main page
modules
namespaces
classes
files
Gecode home
Generated on Wed Jan 1 2020 10:37:59 for Gecode by
doxygen
1.8.16
examples
cartesian-heart.cpp
Go to the documentation of this file.
1
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2
/*
3
* Main authors:
4
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
5
*
6
* Copyright:
7
* Vincent Barichard, 2012
8
*
9
* This file is part of Gecode, the generic constraint
10
* development environment:
11
* http://www.gecode.org
12
*
13
* Permission is hereby granted, free of charge, to any person obtaining
14
* a copy of this software and associated documentation files (the
15
* "Software"), to deal in the Software without restriction, including
16
* without limitation the rights to use, copy, modify, merge, publish,
17
* distribute, sublicense, and/or sell copies of the Software, and to
18
* permit persons to whom the Software is furnished to do so, subject to
19
* the following conditions:
20
*
21
* The above copyright notice and this permission notice shall be
22
* included in all copies or substantial portions of the Software.
23
*
24
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31
*
32
*/
33
34
#include <
gecode/driver.hh
>
35
36
#include <
gecode/minimodel.hh
>
37
#include <
gecode/float.hh
>
38
39
using namespace
Gecode
;
40
63
class
CartesianHeart
:
public
Script
{
64
protected
:
66
FloatVarArray
f
;
68
FloatNum
step
;
69
public
:
71
CartesianHeart
(
const
Options
&
opt
)
72
:
Script
(
opt
),
f
(*this,2,-20,20),
step
(
opt
.
step
()) {
73
int
q = 2;
74
FloatNum
p
= 0.5;
75
// Post equation
76
rel
(*
this
,
sqr
(
f
[0]) + 2*
sqr
(
f
[1]-
p
*
nroot
(
abs
(
f
[0]),q)) == 1);
77
branch
(*
this
,
f
[0],
FLOAT_VAL_SPLIT_MIN
());
78
branch
(*
this
,
f
[1],
FLOAT_VAL_SPLIT_MIN
());
79
}
81
CartesianHeart
(
CartesianHeart
&
p
)
82
:
Script
(
p
),
step
(
p
.
step
) {
83
f
.update(*
this
,
p
.f);
84
}
86
virtual
Space
*
copy
(
void
) {
87
return
new
CartesianHeart
(*
this
);
88
}
90
virtual
void
constrain
(
const
Space
&
_b
) {
91
const
CartesianHeart
&
b
= static_cast<const CartesianHeart&>(
_b
);
92
rel
(*
this
,
93
(
f
[0] >= (
b
.f[0].max()+
step
)) ||
94
(
f
[1] >= (
b
.f[1].max()+
step
)) ||
95
(
f
[1] <= (
b
.f[1].min()-
step
)));
96
}
98
virtual
void
print
(std::ostream& os)
const
{
99
os <<
"XY "
<<
f
[0].med() <<
" "
<<
f
[1].med()
100
<< std::endl;
101
}
102
103
};
104
108
int
main
(
int
argc,
char
* argv[]) {
109
Options
opt
(
"CartesianHeart"
);
110
opt
.
solutions
(0);
111
opt
.
step
(0.01);
112
opt
.
parse
(argc,argv);
113
Script::run<CartesianHeart,BAB,Options>(
opt
);
114
return
0;
115
}
116
117
// STATISTICS: example-any
b
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
Test::Float::Arithmetic::step
const Gecode::FloatNum step
Definition:
arithmetic.cpp:785
minimodel.hh
Gecode::sqr
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition:
arithmetic.cpp:95
Test::Int::Precede::_b
Single _b(1, 4)
Gecode::Space
Computation spaces.
Definition:
core.hpp:1742
Gecode::branch
void 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.
Definition:
branch.cpp:39
driver.hh
CartesianHeart::f
FloatVarArray f
The numbers.
Definition:
cartesian-heart.cpp:66
CartesianHeart::copy
virtual Space * copy(void)
Copy during cloning.
Definition:
cartesian-heart.cpp:86
Gecode
Gecode toplevel namespace
CartesianHeart::main
int main(int argc, char *argv[])
Main-function.
Definition:
cartesian-heart.cpp:108
Test::opt
Options opt
The options.
Definition:
test.cpp:97
Gecode::nroot
void nroot(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n\geq 0$.
Definition:
arithmetic.cpp:118
Gecode::Options
Options for scripts
Definition:
driver.hh:366
float.hh
Gecode::FLOAT_VAL_SPLIT_MIN
FloatValBranch FLOAT_VAL_SPLIT_MIN(void)
Select values not greater than mean of smallest and largest value.
Definition:
val.hpp:55
Gecode::Driver::ScriptBase
Parametric base-class for scripts.
Definition:
driver.hh:729
Gecode::Options::step
void step(double s)
Set default step value.
Definition:
options.hpp:256
Gecode::FloatNum
double FloatNum
Floating point number base type.
Definition:
float.hh:106
Gecode::BaseOptions::parse
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
Definition:
options.cpp:548
Gecode::abs
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition:
arithmetic.cpp:41
CartesianHeart::constrain
virtual void constrain(const Space &_b)
Add constraints to current model to get next solution (not too close)
Definition:
cartesian-heart.cpp:90
Gecode::rel
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition:
rel.cpp:43
CartesianHeart::print
virtual void print(std::ostream &os) const
Print solution coordinates.
Definition:
cartesian-heart.cpp:98
CartesianHeart::step
FloatNum step
Minimum distance between two solutions.
Definition:
cartesian-heart.cpp:68
CartesianHeart::CartesianHeart
CartesianHeart(CartesianHeart &p)
Constructor for cloning p.
Definition:
cartesian-heart.cpp:81
Gecode::FloatVarArray
Float variable array.
Definition:
float.hh:1030
Gecode::Options::solutions
void solutions(unsigned int n)
Set default number of solutions to search for.
Definition:
options.hpp:283
Gecode::f
Post propagator for f(x \diamond_{\mathit{op}} y) \sim_r z \f$ void rel(Home home
p
int p
Number of positive literals for node type.
Definition:
bool-expr.cpp:232
CartesianHeart::CartesianHeart
CartesianHeart(const Options &opt)
Actual model.
Definition:
cartesian-heart.cpp:71
CartesianHeart
Example: Cartesian Heart
Definition:
cartesian-heart.cpp:63