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
|
/* 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 "check.hh"
#include "interval_algebra.hh"
#include "interval_def.hh"
namespace itv {
//------------------------------------------------------------------------------------------
// Interval IntNum
interval interval_algebra::IntNum(int x)
{
/* int lsb = -24; // lsb_number(x); // x is an integer so lsb is bound to be >=0, but we might
be able to shave a
// couple more bits
// actually this is a terrible idea, in regard of the consequences on later
inferred precisions
// why should _,16:*:sin have a different output precision than _,15:*:sin ?
// shaving a couple extra bits is not worth the later consequences
while (floor(x * pow(2, -lsb - 1)) == x * pow(2, -lsb - 1) && x != 0) {
lsb++;
}
*/
int lsb = 0;
return {double(x), double(x), lsb};
}
interval interval_algebra::Int64Num(int64_t x)
{
/* int lsb = -24; // lsb_number(x); // x is an integer so lsb is bound to be >=0, but we might
be able to shave a
// couple more bits
while (floor(x * pow(2, -lsb - 1)) == x * pow(2, -lsb - 1) and x != 0) {
lsb++;
} */
int lsb = 0;
return {double(x), double(x), lsb};
}
} // namespace itv
|
