FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
gecode/gecode/float/arithmetic/mult.hpp at master · slavaandrejev/gecode · GitHub
slavaandrejev
/
gecode
Public
forked from
Gecode/gecode
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
gecode
/
gecode
/
float
/
arithmetic
/
mult.hpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
executable file
·
356 lines (313 loc) · 9.92 KB
Breadcrumbs
gecode
/
gecode
/
float
/
arithmetic
/
mult.hpp
Copy path
File metadata and controls
executable file
·
356 lines (313 loc) · 9.92 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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
/*
-*- 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, 2004
* 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.
*
*/
namespace
Gecode
{
namespace
Float
{
namespace
Arithmetic
{
//
/ Test whether \a x is positive
template
<
class
View
>
forceinline
bool
pos
(
const
View& x) {
return
x.
min
() >=
0.0
;
}
//
/ Test whether \a x is negative
template
<
class
View
>
forceinline
bool
neg
(
const
View& x) {
return
x.
max
() <=
0.0
;
}
//
/ Test whether \a x is neither positive nor negative
template
<
class
View
>
forceinline
bool
any
(
const
View& x) {
return
(x.
min
() <=
0.0
) && (x.
max
() >=
0.0
);
}
/*
* Propagator for x * y = x
*
*/
template
<
class
View
>
forceinline
MultZeroOne<View>::MultZeroOne(Home home, View x0, View x1)
: BinaryPropagator<View,
PC_FLOAT_BND
>(home,x0,x1) {}
template
<
class
View
>
forceinline ExecStatus
MultZeroOne<View>::
post
(Home home, View x0, View x1) {
switch
(
rtest_eq
(x0,
0.0
)) {
case
RT_FALSE
:
GECODE_ME_CHECK
(x1.
eq
(home,
1.0
));
break
;
case
RT_TRUE
:
break
;
case
RT_MAYBE
:
switch
(
rtest_eq
(x1,
1.0
)) {
case
RT_FALSE
:
GECODE_ME_CHECK
(x0.
eq
(home,
0.0
));
break
;
case
RT_TRUE
:
break
;
case
RT_MAYBE
:
(
void
)
new
(home) MultZeroOne<View>(home,x0,x1);
break
;
default
:
GECODE_NEVER
;
}
break
;
default
:
GECODE_NEVER
;
}
return
ES_OK
;
}
template
<
class
View
>
forceinline
MultZeroOne<View>::MultZeroOne(Space& home, MultZeroOne<View>& p)
: BinaryPropagator<View,
PC_FLOAT_BND
>(home,p) {}
template
<
class
View
>
Actor*
MultZeroOne<View>::copy(Space& home) {
return
new
(home) MultZeroOne<View>(home,*
this
);
}
template
<
class
View
>
ExecStatus
MultZeroOne<View>::propagate(Space& home,
const
ModEventDelta&) {
switch
(
rtest_eq
(x0,
0.0
)) {
case
RT_FALSE
:
GECODE_ME_CHECK
(x1.
eq
(home,
1.0
));
break
;
case
RT_TRUE
:
break
;
case
RT_MAYBE
:
switch
(
rtest_eq
(x1,
1.0
)) {
case
RT_FALSE
:
GECODE_ME_CHECK
(x0.
eq
(home,
0.0
));
break
;
case
RT_TRUE
:
break
;
case
RT_MAYBE
:
return
ES_FIX
;
default
:
GECODE_NEVER
;
}
break
;
default
:
GECODE_NEVER
;
}
return
home.
ES_SUBSUMED
(*
this
);
}
/*
* Positive bounds consistent multiplication
*
*/
template
<
class
VA
,
class
VB
,
class
VC
>
forceinline
MultPlus<
VA
,
VB
,
VC
>::MultPlus(Home home,
VA
x0,
VB
x1,
VC
x2)
: MixTernaryPropagator<
VA
,
PC_FLOAT_BND
,
VB
,
PC_FLOAT_BND
,
VC
,
PC_FLOAT_BND
>
(home,x0,x1,x2) {}
template
<
class
VA
,
class
VB
,
class
VC
>
forceinline
MultPlus<
VA
,
VB
,
VC
>::MultPlus(Space& home, MultPlus<
VA
,
VB
,
VC
>& p)
: MixTernaryPropagator<
VA
,
PC_FLOAT_BND
,
VB
,
PC_FLOAT_BND
,
VC
,
PC_FLOAT_BND
>
(home,p) {}
template
<
class
VA
,
class
VB
,
class
VC
>
Actor*
MultPlus<
VA
,
VB
,
VC
>::copy(Space& home) {
return
new
(home) MultPlus<
VA
,
VB
,
VC
>(home,*
this
);
}
template
<
class
VA
,
class
VB
,
class
VC
>
ExecStatus
MultPlus<
VA
,
VB
,
VC
>::propagate(Space& home,
const
ModEventDelta&) {
if
(x1.
min
() !=
0.0
)
GECODE_ME_CHECK
(x0.
eq
(home,x2.
val
() / x1.
val
()));
if
(x0.
min
() !=
0.0
)
GECODE_ME_CHECK
(x1.
eq
(home,x2.
val
() / x0.
val
()));
GECODE_ME_CHECK
(x2.
eq
(home,x0.
val
() * x1.
val
()));
if
(x0.
assigned
() && x1.
assigned
() && x2.
assigned
())
return
home.
ES_SUBSUMED
(*
this
);
return
ES_NOFIX
;
}
template
<
class
VA
,
class
VB
,
class
VC
>
forceinline ExecStatus
MultPlus<
VA
,
VB
,
VC
>::
post
(Home home,
VA
x0,
VB
x1,
VC
x2) {
GECODE_ME_CHECK
(x0.
gq
(home,
0.0
));
GECODE_ME_CHECK
(x1.
gq
(home,
0.0
));
Rounding r;
GECODE_ME_CHECK
(x2.
gq
(home,r.
mul_down
(x0.
min
(),x1.
min
())));
(
void
)
new
(home) MultPlus<
VA
,
VB
,
VC
>(home,x0,x1,x2);
return
ES_OK
;
}
/*
* Bounds consistent multiplication
*
*/
template
<
class
View
>
forceinline
Mult<View>::Mult(Home home, View x0, View x1, View x2)
: TernaryPropagator<View,
PC_FLOAT_BND
>(home,x0,x1,x2) {}
template
<
class
View
>
forceinline
Mult<View>::Mult(Space& home, Mult<View>& p)
: TernaryPropagator<View,
PC_FLOAT_BND
>(home,p) {}
template
<
class
View
>
Actor*
Mult<View>::copy(Space& home) {
return
new
(home) Mult<View>(home,*
this
);
}
template
<
class
View
>
ExecStatus
Mult<View>::propagate(Space& home,
const
ModEventDelta&) {
Rounding r;
if
(
pos
(x0)) {
if
(
pos
(x1) ||
pos
(x2))
goto
rewrite_ppp;
if
(
neg
(x1) ||
neg
(x2))
goto
rewrite_pnn;
goto
prop_pxx;
}
if
(
neg
(x0)) {
if
(
neg
(x1) ||
pos
(x2))
goto
rewrite_nnp;
if
(
pos
(x1) ||
neg
(x2))
goto
rewrite_npn;
goto
prop_nxx;
}
if
(
pos
(x1)) {
if
(
pos
(x2))
goto
rewrite_ppp;
if
(
neg
(x2))
goto
rewrite_npn;
goto
prop_xpx;
}
if
(
neg
(x1)) {
if
(
pos
(x2))
goto
rewrite_nnp;
if
(
neg
(x2))
goto
rewrite_pnn;
goto
prop_xnx;
}
assert
(
any
(x0) &&
any
(x1));
GECODE_ME_CHECK
(x2.
lq
(home,
std::max
(r.
mul_up
(x0.
max
(),x1.
max
()),
r.
mul_up
(x0.
min
(),x1.
min
()))));
GECODE_ME_CHECK
(x2.
gq
(home,
std::min
(r.
mul_down
(x0.
min
(),x1.
max
()),
r.
mul_down
(x0.
max
(),x1.
min
()))));
if
(
pos
(x2)) {
if
(r.
div_up
(x2.
min
(),x1.
min
()) < x0.
min
())
GECODE_ME_CHECK
(x0.
gq
(home,
0
));
if
(r.
div_up
(x2.
min
(),x0.
min
()) < x1.
min
())
GECODE_ME_CHECK
(x1.
gq
(home,
0
));
}
if
(
neg
(x2)) {
if
(r.
div_up
(x2.
max
(),x1.
max
()) < x0.
min
())
GECODE_ME_CHECK
(x0.
gq
(home,
0
));
if
(r.
div_up
(x2.
max
(),x0.
max
()) < x1.
min
())
GECODE_ME_CHECK
(x1.
gq
(home,
0
));
}
if
(x0.
assigned
()) {
assert
((x0.
val
() ==
0.0
) && (x2.
val
() ==
0.0
));
return
home.
ES_SUBSUMED
(*
this
);
}
if
(x1.
assigned
()) {
assert
((x1.
val
() ==
0.0
) && (x2.
val
() ==
0.0
));
return
home.
ES_SUBSUMED
(*
this
);
}
return
ES_NOFIX
;
prop_xpx:
std::swap
(x0,x1);
prop_pxx:
assert
(
pos
(x0) &&
any
(x1) &&
any
(x2));
GECODE_ME_CHECK
(x2.
lq
(home,r.
mul_up
(x0.
max
(),x1.
max
())));
GECODE_ME_CHECK
(x2.
gq
(home,r.
mul_down
(x0.
max
(),x1.
min
())));
if
(
pos
(x2))
goto
rewrite_ppp;
if
(
neg
(x2))
goto
rewrite_pnn;
GECODE_ME_CHECK
(x1.
lq
(home,r.
div_up
(x2.
max
(),x0.
min
())));
GECODE_ME_CHECK
(x1.
gq
(home,r.
div_down
(x2.
min
(),x0.
min
())));
if
(x0.
assigned
() && x1.
assigned
()) {
GECODE_ME_CHECK
(x2.
eq
(home,x0.
val
()*x1.
val
()));
return
home.
ES_SUBSUMED
(*
this
);
}
return
ES_NOFIX
;
prop_xnx:
std::swap
(x0,x1);
prop_nxx:
assert
(
neg
(x0) &&
any
(x1) &&
any
(x2));
GECODE_ME_CHECK
(x2.
lq
(home,r.
mul_up
(x0.
min
(),x1.
min
())));
GECODE_ME_CHECK
(x2.
gq
(home,r.
mul_down
(x0.
min
(),x1.
max
())));
if
(
pos
(x2))
goto
rewrite_nnp;
if
(
neg
(x2))
goto
rewrite_npn;
if
(x0.
max
() !=
0.0
) {
GECODE_ME_CHECK
(x1.
lq
(home,r.
div_up
(x2.
min
(),x0.
max
())));
GECODE_ME_CHECK
(x1.
gq
(home,r.
div_down
(x2.
max
(),x0.
max
())));
}
if
(x0.
assigned
() && x1.
assigned
()) {
GECODE_ME_CHECK
(x2.
eq
(home,x0.
val
()*x1.
val
()));
return
home.
ES_SUBSUMED
(*
this
);
}
return
ES_NOFIX
;
rewrite_ppp:
GECODE_REWRITE
(*
this
,(MultPlus<FloatView,FloatView,FloatView>
::post
(home(*
this
),x0,x1,x2)));
rewrite_nnp:
GECODE_REWRITE
(*
this
,(MultPlus<MinusView,MinusView,FloatView>
::post
(home(*
this
),MinusView(x0),MinusView(x1),x2)));
rewrite_pnn:
std::swap
(x0,x1);
rewrite_npn:
GECODE_REWRITE
(*
this
,(MultPlus<MinusView,FloatView,MinusView>
::post
(home(*
this
),MinusView(x0),x1,MinusView(x2))));
}
template
<
class
View
>
ExecStatus
Mult<View>::
post
(Home home, View x0, View x1, View x2) {
if
(x0 == x1)
return
Sqr<View>::
post
(home,x0,x2);
if
(x0 == x2)
return
MultZeroOne<View>::
post
(home,x0,x1);
if
(x1 == x2)
return
MultZeroOne<View>::
post
(home,x1,x0);
if
(
pos
(x0)) {
if
(
pos
(x1) ||
pos
(x2))
goto
post_ppp;
if
(
neg
(x1) ||
neg
(x2))
goto
post_pnn;
}
else
if
(
neg
(x0)) {
if
(
neg
(x1) ||
pos
(x2))
goto
post_nnp;
if
(
pos
(x1) ||
neg
(x2))
goto
post_npn;
}
else
if
(
pos
(x1)) {
if
(
pos
(x2))
goto
post_ppp;
if
(
neg
(x2))
goto
post_npn;
}
else
if
(
neg
(x1)) {
if
(
pos
(x2))
goto
post_nnp;
if
(
neg
(x2))
goto
post_pnn;
}
{
GECODE_ME_CHECK
(x2.
eq
(home,x0.
val
()*x1.
val
()));
(
void
)
new
(home) Mult<View>(home,x0,x1,x2);
}
return
ES_OK
;
post_ppp:
return
MultPlus<FloatView,FloatView,FloatView>::
post
(home,x0,x1,x2);
post_nnp:
return
MultPlus<MinusView,MinusView,FloatView>::
post
(home,
MinusView
(x0),
MinusView
(x1),x2);
post_pnn:
std::swap
(x0,x1);
post_npn:
return
MultPlus<MinusView,FloatView,MinusView>::
post
(home,
MinusView
(x0),x1,
MinusView
(x2));
}
}}}
//
STATISTICS: float-prop
Back
|
FazBrowse Home
|
New Git URL