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
pub const EPSILON: f64 = 1e-14;
pub const DBL_EPSILON: f64 = 2.220446049250313e-16;
#[macro_export]
macro_rules! f64_eq {
($x:expr, $y:expr) => {
($x - $y).abs() < EPSILON
};
}
#[macro_export]
macro_rules! assert_f64_eq {
($x:expr, $y:expr) => {
assert!(($x - $y).abs() < EPSILON)
};
}
#[allow(unused)]
pub fn f64_eq(x: f64, y: f64) -> bool {
f64_near(x, y, EPSILON)
}
#[allow(unused)]
pub fn f64_near(x: f64, y: f64, eps: f64) -> bool {
(x - y).abs() <= eps
}
pub fn remainder(x: f64, y: f64) -> f64 {
::libm::remquo(x, y).0
}
pub fn clamp<T>(val: T, min: T, max: T) -> T
where
T: PartialOrd,
{
if val < min {
min
} else if val > max {
max
} else {
val
}
}
pub fn search_lower_by<F>(len: usize, f: F) -> usize
where
F: Fn(usize) -> bool,
{
let mut i = 0;
let mut j = len;
while i < j {
let h = i + (j - i) / 2;
if !f(h) {
i = h + 1;
} else {
j = h;
}
}
i
}