lsph 0.1.9

Learned Spatial HashMap
Documentation 
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

use crate::geometry::Point;
use num_traits::float::Float;
use std::cmp::Ordering;

/// State for store nearest neighbors distances and points in min_heap
#[derive(Copy, Clone, PartialEq)]
pub struct NearestNeighborState<F>
where
    F: Float,
{
    pub distance: F,
    pub point: Point<F>,
}

impl<F: Float> Eq for NearestNeighborState<F> {}

impl<F> PartialOrd for NearestNeighborState<F>
where
    F: Float,
{
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl<F> Ord for NearestNeighborState<F>
where
    F: Float,
{
    fn cmp(&self, other: &Self) -> Ordering {
        // We flip the ordering on distance, so the queue becomes a min-heap
        other.distance.partial_cmp(&self.distance).unwrap_or(Ordering::Equal)
    }
}