|
11 | 11 | //! The complexity of encoding a point is O(order) |
12 | 12 |
|
13 | 13 | use crate::geometry::OrientedBoundingBox; |
| 14 | +use crate::nextafter::nextafter; |
14 | 15 | use crate::Point2D; |
15 | 16 | use rayon::prelude::*; |
16 | 17 | use std::fmt; |
@@ -91,7 +92,7 @@ fn segment_to_segment(min: f64, max: f64, order: usize) -> impl Fn(f64) -> u64 { |
91 | 92 |
|
92 | 93 | // Map max to (2**order-1). |
93 | 94 | while n <= width * f { |
94 | | - f = crate::nextafter(f, 0.0); |
| 95 | + f = nextafter(f, 0.0); |
95 | 96 | } |
96 | 97 |
|
97 | 98 | move |v| { |
@@ -362,13 +363,13 @@ mod tests { |
362 | 363 | assert_eq!(mapping(7.0), 6); |
363 | 364 | assert_eq!(mapping(8.0), 7); |
364 | 365 |
|
365 | | - assert_eq!(mapping(crate::nextafter(1.0, f64::INFINITY)), 1); |
366 | | - assert_eq!(mapping(crate::nextafter(2.0, f64::INFINITY)), 2); |
367 | | - assert_eq!(mapping(crate::nextafter(3.0, f64::INFINITY)), 3); |
368 | | - assert_eq!(mapping(crate::nextafter(4.0, f64::INFINITY)), 4); |
369 | | - assert_eq!(mapping(crate::nextafter(5.0, f64::INFINITY)), 5); |
370 | | - assert_eq!(mapping(crate::nextafter(6.0, f64::INFINITY)), 6); |
371 | | - assert_eq!(mapping(crate::nextafter(7.0, f64::INFINITY)), 7); |
| 366 | + assert_eq!(mapping(nextafter(1.0, f64::INFINITY)), 1); |
| 367 | + assert_eq!(mapping(nextafter(2.0, f64::INFINITY)), 2); |
| 368 | + assert_eq!(mapping(nextafter(3.0, f64::INFINITY)), 3); |
| 369 | + assert_eq!(mapping(nextafter(4.0, f64::INFINITY)), 4); |
| 370 | + assert_eq!(mapping(nextafter(5.0, f64::INFINITY)), 5); |
| 371 | + assert_eq!(mapping(nextafter(6.0, f64::INFINITY)), 6); |
| 372 | + assert_eq!(mapping(nextafter(7.0, f64::INFINITY)), 7); |
372 | 373 | } |
373 | 374 |
|
374 | 375 | #[test] |
|
0 commit comments