trie-rs 0.4.2

Memory efficient trie (prefix tree) and map library based on LOUDS
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
35
36

#[derive(Debug, Clone)]
/// Retains keys and strips off `Value`s from a [crate::iter] iterator.
pub struct Keys<I>(I);

impl<I> Keys<I> {
    ///Creates a new `Keys` iterator.
    pub fn new(iter: I) -> Self {
        Self(iter)
    }
}

// TODO: This is generic for V, which is a stand-in for the Value, but in a
// `map::Trie<K,V>`, its iterators will actually reurn `(C, &V)`. Hopefully that
// won't matter.
impl<I, C, V> Iterator for Keys<I>
where
    I: Iterator<Item = (C, V)>,
{
    type Item = C;
    fn next(&mut self) -> Option<C> {
        self.0.next().map(|x| x.0)
    }
}

/// Strip an iterator items `(K, V)` to only have `K`.
pub trait KeysExt: Iterator {
    /// Retain keys and strip values from a [crate::iter] iterator.
    fn keys(self) -> Keys<Self>
    where
        Self: Sized,
    {
        Keys::new(self)
    }
}

impl<T> KeysExt for T where T: Iterator + ?Sized {}