FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
gecode/test/float/dom.cpp at develop · Gecode/gecode · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
Gecode
/
gecode
Public
Notifications
You must be signed in to change notification settings
Fork
88
Star
335
Code
Issues
8
Pull requests
8
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
gecode
/
test
/
float
/
dom.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
148 lines (137 loc) · 4.73 KB
Breadcrumbs
gecode
/
test
/
float
/
dom.cpp
Copy path
File metadata and controls
148 lines (137 loc) · 4.73 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
/*
-*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*-
*/
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
*
* Copyright:
* Christian Schulte, 2005
* Vincent Barichard, 2012
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#
include
"
test/float.hh
"
#
include
<
gecode/minimodel.hh
>
namespace
Test
{
namespace
Float
{
//
/ %Tests for domain constraints
namespace
Dom
{
/*
*
* \defgroup TaskTestFloatDom Domain constraints
* \ingroup TaskTestFloat
*/
//
@{
//
/ %Test for domain constraints with a float value
class
Val
:
public
Test
{
protected:
//
/ Float constant
Gecode::FloatVal c;
public:
//
/ Create and register test
Val
(
int
n, Gecode::FloatVal c0, Gecode::FloatNum st)
: Test(
"
Dom::Val::
"
+str(n)+
"
::
"
+str(c0),
n,-
3
,
3
,st,
CPLT_ASSIGNMENT
,n==
1
), c(c0) {
testsubsumed =
false
;
}
//
/ %Test whether \a x is solution
virtual
MaybeType
solution
(
const
Assignment& x)
const
{
for
(
int
i=x.
size
(); i--; )
if
((x[i].
max
() > c.
max
()) || (x[i].
min
() < c.
min
()))
return
MT_FALSE
;
return
MT_TRUE
;
}
//
/ Post constraint on \a x
virtual
void
post
(Gecode::Space& home, Gecode::FloatVarArray& x) {
if
(x.
size
() ==
1
)
Gecode::dom
(home, x[
0
], c);
else
Gecode::dom
(home, x, c);
}
//
/ Post reified constraint on \a x for \a r
virtual
void
post
(Gecode::Space& home, Gecode::FloatVarArray& x,
Gecode::Reify r) {
assert
(x.
size
() ==
1
);
Gecode::dom
(home, x[
0
], c, r);
}
};
//
/ %Test for domain constraints with float numbers
class
Num
:
public
Test
{
protected:
//
/ Float number
Gecode::FloatNum min;
//
/ Float number
Gecode::FloatNum max;
public:
//
/ Create and register test
Num
(
int
n, Gecode::FloatNum min0, Gecode::FloatNum max0,
Gecode::FloatNum st)
: Test(
"
Dom::Num::
"
+str(n)+
"
::
"
+str(min0)+
"
::
"
+str(max0),
n,-
3
,
3
,st,
CPLT_ASSIGNMENT
,n==
1
), min(min0), max(max0) {
testsubsumed =
false
;
}
//
/ %Test whether \a x is solution
virtual
MaybeType
solution
(
const
Assignment& x)
const
{
if
(max < min)
return
MT_FALSE
;
for
(
int
i=x.
size
(); i--; )
if
((x[i].
max
() > max) || (x[i].
min
() < min))
return
MT_FALSE
;
return
MT_TRUE
;
}
//
/ Post constraint on \a x
virtual
void
post
(Gecode::Space& home, Gecode::FloatVarArray& x) {
if
(x.
size
() ==
1
)
Gecode::dom
(home, x[
0
], min, max);
else
Gecode::dom
(home, x, min, max);
}
//
/ Post reified constraint on \a x for \a r
virtual
void
post
(Gecode::Space& home, Gecode::FloatVarArray& x,
Gecode::Reify r) {
assert
(x.
size
() ==
1
);
Gecode::dom
(home, x[
0
], min, max, r);
}
};
//
/ Help class to create and register tests
class
Create
{
public:
//
/ Perform creation and registration
Create
(
void
) {
using
namespace
Gecode
;
FloatNum step =
0.7
;
for
(
int
c=-
4
; c<=
4
; c++) {
(
void
)
new
Val
(
1
,c,step);
(
void
)
new
Val
(
2
,c,step);
for
(
int
d=-
3
; d<=
3
; d++) {
(
void
)
new
Num
(
1
,c,d,step);
(
void
)
new
Num
(
2
,c,d,step);
}
}
}
};
Create c;
//
@}
}
}}
//
STATISTICS: test-float
Back
|
FazBrowse Home
|
New Git URL