main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
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
* Last modified:
10
* $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
11
* $Revision: 14967 $
12
*
13
* This file is part of Gecode, the generic constraint
14
* development environment:
15
* http://www.gecode.org
16
*
17
* Permission is hereby granted, free of charge, to any person obtaining
18
* a copy of this software and associated documentation files (the
19
* "Software"), to deal in the Software without restriction, including
20
* without limitation the rights to use, copy, modify, merge, publish,
21
* distribute, sublicense, and/or sell copies of the Software, and to
22
* permit persons to whom the Software is furnished to do so, subject to
23
* the following conditions:
24
*
25
* The above copyright notice and this permission notice shall be
26
* included in all copies or substantial portions of the Software.
27
*
28
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35
*
36
*/
37
38
#include <
gecode/driver.hh
>
39
40
#include <
gecode/minimodel.hh
>
41
#include <
gecode/float.hh
>
42
43
using namespace
Gecode
;
44
67
class
CartesianHeart
:
public
Script
{
68
protected
:
70
FloatVarArray
f
;
72
FloatNum
step
;
73
public
:
75
CartesianHeart
(
const
Options
&
opt
)
76
:
Script
(
opt
),
f
(*this,2,-20,20),
step
(
opt
.
step
()) {
77
int
q = 2;
78
FloatNum
p
= 0.5;
79
// Post equation
80
rel
(*
this
,
sqr
(
f
[0]) + 2*
sqr
(
f
[1]-
p
*
nroot
(
abs
(
f
[0]),q)) == 1);
81
branch
(*
this
,
f
[0],
FLOAT_VAL_SPLIT_MIN
());
82
branch
(*
this
,
f
[1],
FLOAT_VAL_SPLIT_MIN
());
83
}
85
CartesianHeart
(
bool
share,
CartesianHeart
&
p
)
86
:
Script
(share,
p
),
step
(
p
.
step
) {
87
f
.update(*
this
,share,
p
.f);
88
}
90
virtual
Space
*
copy
(
bool
share) {
91
return
new
CartesianHeart
(share,*
this
);
92
}
94
virtual
void
constrain
(
const
Space
&
_b
) {
95
const
CartesianHeart
&
b
=
static_cast<
const
CartesianHeart
&
>
(
_b
);
96
rel
(*
this
,
97
(
f
[0] >= (
b
.f[0].max()+
step
)) ||
98
(
f
[1] >= (
b
.f[1].max()+
step
)) ||
99
(
f
[1] <= (
b
.f[1].min()-
step
)));
100
}
102
virtual
void
print
(std::ostream& os)
const
{
103
os <<
"XY "
<<
f
[0].med() <<
" "
<<
f
[1].med()
104
<< std::endl;
105
}
106
107
};
108
112
int
main
(
int
argc,
char
* argv[]) {
113
Options
opt
(
"CartesianHeart"
);
114
opt
.
solutions
(0);
115
opt
.
step
(0.01);
116
opt
.
parse
(argc,argv);
117
Script::run<CartesianHeart,BAB,Options>(
opt
);
118
return
0;
119
}
120
121
// STATISTICS: example-any
Test::Float::Arithmetic::step
const Gecode::FloatNum step
Definition:
arithmetic.cpp:789
minimodel.hh
Gecode::sqr
void sqr(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition:
arithmetic.cpp:99
CartesianHeart::copy
virtual Space * copy(bool share)
Copy during cloning.
Definition:
cartesian-heart.cpp:90
Test::Int::Precede::_b
Single _b(1, 4)
Gecode::Space
Computation spaces.
Definition:
core.hpp:1748
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:43
driver.hh
CartesianHeart::f
FloatVarArray f
The numbers.
Definition:
cartesian-heart.cpp:70
Gecode
Gecode toplevel namespace
CartesianHeart::main
int main(int argc, char *argv[])
Main-function.
Definition:
cartesian-heart.cpp:112
CartesianHeart::CartesianHeart
CartesianHeart(bool share, CartesianHeart &p)
Constructor for cloning p.
Definition:
cartesian-heart.cpp:85
Test::opt
Options opt
The options.
Definition:
test.cpp:101
Gecode::nroot
void nroot(Home home, FloatVar x0, int n, FloatVar x1)
Post propagator for for $n\geq 0$.
Definition:
arithmetic.cpp:122
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:59
Gecode::Driver::ScriptBase
Parametric base-class for scripts.
Definition:
driver.hh:703
b
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
Gecode::Options::step
void step(double s)
Set default step value.
Definition:
options.hpp:260
Gecode::FloatNum
double FloatNum
Floating point number base type.
Definition:
float.hh:110
Gecode::BaseOptions::parse
void parse(int &argc, char *argv[])
Parse options from arguments argv (number is argc)
Definition:
options.cpp:510
Gecode::abs
void abs(Home home, FloatVar x0, FloatVar x1)
Post propagator for .
Definition:
arithmetic.cpp:45
CartesianHeart::constrain
virtual void constrain(const Space &_b)
Add constraints to current model to get next solution (not too close)
Definition:
cartesian-heart.cpp:94
Gecode::rel
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVal n)
Propagates .
Definition:
rel.cpp:47
CartesianHeart::print
virtual void print(std::ostream &os) const
Print solution coordinates.
Definition:
cartesian-heart.cpp:102
CartesianHeart::step
FloatNum step
Minimum distance between two solutions.
Definition:
cartesian-heart.cpp:72
Gecode::FloatVarArray
Float variable array.
Definition:
float.hh:1031
Gecode::Options::solutions
void solutions(unsigned int n)
Set default number of solutions to search for.
Definition:
options.hpp:287
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:236
CartesianHeart::CartesianHeart
CartesianHeart(const Options &opt)
Actual model.
Definition:
cartesian-heart.cpp:75
CartesianHeart
Example: Cartesian Heart
Definition:
cartesian-heart.cpp:67