ordinal-map 0.1.10

Ordinal trait to map values to integers and efficient maps and sets for such types
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
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

use std::fmt::Debug;

use crate::set::set_ref::OrdinalSetRef;
use crate::Ordinal;

/// Iterator over elements of [`OrdinalSet`](crate::set::OrdinalSet)
/// or [`OrdinalArraySet`](crate::set::OrdinalArraySet).
pub struct Iter<'a, T> {
    iter: crate::OrdinalValues<T>,
    set: OrdinalSetRef<'a, T>,
}

impl<'a, T: Ordinal> Iter<'a, T> {
    #[inline]
    pub(crate) fn new(set: OrdinalSetRef<'a, T>) -> Self {
        Iter {
            iter: T::all_values(),
            set,
        }
    }
}

impl<'a, T: Ordinal> Iterator for Iter<'a, T> {
    type Item = T;

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let next = self.iter.next()?;
            if self.set.contains(&next) {
                return Some(next);
            }
        }
    }

    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        (0, Some(self.iter.len()))
    }
}

impl<'a, T: Ordinal> DoubleEndedIterator for Iter<'a, T> {
    #[inline]
    fn next_back(&mut self) -> Option<Self::Item> {
        loop {
            let next = self.iter.next_back()?;
            if self.set.contains(&next) {
                return Some(next);
            }
        }
    }
}

impl<'a, T> Clone for Iter<'a, T> {
    #[inline]
    fn clone(&self) -> Self {
        Iter {
            iter: self.iter.clone(),
            set: self.set.clone(),
        }
    }
}

impl<'a, T: Ordinal + Debug> Debug for Iter<'a, T> {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_list().entries(self.clone()).finish()
    }
}