manhattan-tree 0.1.0

A spatial tree which can effiently find closest key to a point, by manhattan distance.
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


use super::MTreeMap;
use space::CoordSpace;

/// A degenerate case of the MTreeMap. A set of coordinates in a particular coordinate space
/// that allows for queries on the closest element to a particular focus.
pub struct MTreeSet<S: CoordSpace> {
    map: MTreeMap<S::Coord, S>
}
impl<S: CoordSpace> MTreeSet<S> {
    /// New, empty MTreeSet.
    pub fn new(space: S) -> Self {
        MTreeSet {
            map: MTreeMap::new(space)
        }
    }

    /// Whether the set contain the coord.
    pub fn contains(&self, elem: S::Coord) -> bool {
        self.map.get(elem).is_some()
    }

    /// The closest element to the focus.
    pub fn closest(&self, focus: S::Coord) -> Option<&S::Coord> {
        self.map.get_closest(focus)
    }

    /// Insert element.
    pub fn insert(&mut self, elem: S::Coord) where S::Coord: Clone {
        self.map.insert(elem.clone(), elem);
    }

    /// Remove exact element.
    pub fn remove(&mut self, elem: S::Coord) -> bool {
        self.map.remove(elem).is_some()
    }

    /// Remove closest element to focus.
    pub fn remove_closest(&mut self, focus: S::Coord) -> Option<S::Coord> {
        self.map.remove_closest(focus)
    }

    /// Whether the set has 0 elmeents.
    pub fn is_empty(&self) -> bool {
        self.map.is_empty()
    }

    /// Borrow out each element in the set, in no particular order.
    pub fn iter(&self) -> impl Iterator<Item = &S::Coord> {
        self.map.iter()
    }
}