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
|
/* Copyright 2023 Yann ORLAREY
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <algorithm>
#include <functional>
#include <random>
#include "bitwiseOperations.hh"
#include "check.hh"
#include "interval_algebra.hh"
#include "interval_def.hh"
namespace itv {
//------------------------------------------------------------------------------------------
// Interval Or
// interval Or(const interval& x, const interval& y);
// void testOr();
static double myOr(double x, double y)
{
int a = saturatedIntCast(x);
int b = saturatedIntCast(y);
int c = a | b;
return double(c);
}
// BRUTE FORCE
interval interval_algebra::Or(const interval& x, const interval& y)
{
if (x.isEmpty() || y.isEmpty()) {
return empty();
}
int x0 = saturatedIntCast(x.lo());
int x1 = saturatedIntCast(x.hi());
int y0 = saturatedIntCast(y.lo());
int y1 = saturatedIntCast(y.hi());
SInterval z = bitwiseSignedOr({x0, x1}, {y0, y1});
int precision = std::min(x.lsb(), y.lsb()); // all input bits are significant
/* int precision = std::max(x.lsb(), y.lsb()); // output precision cannot be finer than that of
the input intervals
// however, if one of the intervals is reduced to one element, the mask can make it so
int precisionx = 0;
if (x0 == x1) {
int v = x0; // only element of interval x
while ((v & 1) == 1) // while we encounter ones at the lower end of v
{
v = v / 2;
precisionx++;
}
}
int precisiony = 0;
if (y0 == y1) {
int v = y0; // only element of interval y
while ((v & 1) == 1) // while we encounter ones at the lower end of v
{
v = v / 2;
precisiony++;
}
}*/
return {double(z.lo), double(z.hi),
// std::max(precision, std::max(precisionx, precisiony))
precision};
}
void interval_algebra::testOr()
{
analyzeBinaryMethod(10, 20000, "Or", interval(-1000, -800), interval(127), myOr,
&interval_algebra::Or);
analyzeBinaryMethod(10, 20000, "Or", interval(-1000, -800), interval(123), myOr,
&interval_algebra::Or);
analyzeBinaryMethod(10, 20000, "Or", interval(-128, 128), interval(127), myOr,
&interval_algebra::Or);
analyzeBinaryMethod(10, 20000, "Or", interval(0, 1000), interval(63, 127), myOr,
&interval_algebra::Or);
analyzeBinaryMethod(10, 20000, "Or", interval(-1000, 1000), interval(63, 127), myOr,
&interval_algebra::Or);
analyzeBinaryMethod(10, 2000, "Or", interval(10, 20), interval(0), myOr, &interval_algebra::Or);
analyzeBinaryMethod(10, 2000, "Or", interval(0), interval(15, 25), myOr, &interval_algebra::Or);
analyzeBinaryMethod(10, 2000, "Or", interval(0), interval(0), myOr, &interval_algebra::Or);
}
} // namespace itv
|
