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

use std::marker::PhantomData;

use crate::Ordinal;

pub(crate) struct OrdinalEnumerate<K, I> {
    pub(crate) next: usize,
    pub(crate) iter: I,
    _phantom: PhantomData<K>,
}

impl<K, I> OrdinalEnumerate<K, I> {
    pub(crate) fn new(iter: I, next: usize) -> Self {
        OrdinalEnumerate {
            next,
            iter,
            _phantom: PhantomData,
        }
    }
}

impl<K: Ordinal, I: Iterator> Iterator for OrdinalEnumerate<K, I> {
    type Item = (K, I::Item);

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        let v = self.iter.next()?;
        let k = K::from_ordinal(self.next).unwrap();
        self.next += 1;
        Some((k, v))
    }

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

impl<K: Ordinal, I: ExactSizeIterator> ExactSizeIterator for OrdinalEnumerate<K, I> {
    #[inline]
    fn len(&self) -> usize {
        self.iter.len()
    }
}

impl<K: Ordinal, I: ExactSizeIterator + DoubleEndedIterator> DoubleEndedIterator
    for OrdinalEnumerate<K, I>
{
    #[inline]
    fn next_back(&mut self) -> Option<Self::Item> {
        let v = self.iter.next_back()?;
        let k = K::from_ordinal(self.next + self.iter.len()).unwrap();
        Some((k, v))
    }
}

impl<K, I: Clone> Clone for OrdinalEnumerate<K, I> {
    #[inline]
    fn clone(&self) -> Self {
        OrdinalEnumerate {
            next: self.next,
            iter: self.iter.clone(),
            _phantom: PhantomData,
        }
    }
}