lookupvec 0.1.3

Container with Vec-like properties that also offers O(1) lookup of items based on an id field
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174

use std::iter::FusedIterator;
use delegate::delegate;
use crate::core::Lookup;

pub struct Iter<'a, T: Lookup> (pub(crate) indexmap::map::Values<'a, T::Key, T>);
impl<'a, T: Lookup> Iterator for Iter<'a, T> {
    type Item = &'a T;

    delegate![
        to self.0 {
            fn next(&mut self) -> Option<&'a T>;
            fn last(self) -> Option<&'a T>;
            fn nth(&mut self, n: usize) -> Option<&'a T>;
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<'a, T: Lookup> DoubleEndedIterator for Iter<'a, T> {
    delegate![
        to self.0 {
            fn next_back(&mut self) -> Option<&'a T>;
            fn nth_back(&mut self, n: usize) -> Option<&'a T>;
        }
    ];
}
impl<T: Lookup> ExactSizeIterator for Iter<'_, T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for Iter<'_, T> {}


pub struct IterMut<'a, T: Lookup> (pub(crate) indexmap::map::ValuesMut<'a, T::Key, T>);
impl<'a, T: Lookup> Iterator for IterMut<'a, T> {
    type Item = &'a mut T;

    delegate![
        to self.0 {
            fn next(&mut self) -> Option<&'a mut T>;
            fn last(self) -> Option<&'a mut T>;
            fn nth(&mut self, n: usize) -> Option<&'a mut T>;
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<'a, T: Lookup> DoubleEndedIterator for IterMut<'a, T> {
    delegate![
        to self.0 {
            fn next_back(&mut self) -> Option<&'a mut T>;
            fn nth_back(&mut self, n: usize) -> Option<&'a mut T>;
        }
    ];
}
impl<T: Lookup> ExactSizeIterator for IterMut<'_, T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for IterMut<'_, T> {}

pub struct IntoIter<T: Lookup> (pub(crate) indexmap::map::IntoValues<T::Key, T>);
impl<T: Lookup> Iterator for IntoIter<T> {
    type Item = T;

    delegate![
        to self.0 {
            fn next(&mut self) -> Option<T>;
            fn last(self) -> Option<T>;
            fn nth(&mut self, n: usize) -> Option<T>;
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<T: Lookup> DoubleEndedIterator for IntoIter<T> {
    delegate![
        to self.0 {
            fn next_back(&mut self) -> Option<T>;
            fn nth_back(&mut self, n: usize) -> Option<T>;
        }
    ];
}
impl<T: Lookup> ExactSizeIterator for IntoIter<T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for IntoIter<T> {}


pub struct Keys<'a, T: Lookup> (pub(crate) indexmap::map::Keys<'a, T::Key, T>);
impl<'a, T: Lookup> Iterator for Keys<'a, T> {
    type Item = &'a T::Key;

    delegate![
        to self.0 {
            fn next(&mut self) -> Option<&'a T::Key>;
            fn last(self) -> Option<&'a T::Key>;
            fn nth(&mut self, n: usize) -> Option<&'a T::Key>;
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<'a, T: Lookup> DoubleEndedIterator for Keys<'a, T> {
    delegate![
        to self.0 {
            fn next_back(&mut self) -> Option<&'a T::Key>;
            fn nth_back(&mut self, n: usize) -> Option<&'a T::Key>;
        }
    ];
}
impl<T: Lookup> ExactSizeIterator for Keys<'_, T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for Keys<'_, T> {}

pub struct IntoKeys<T: Lookup> (pub(crate) indexmap::map::IntoKeys<T::Key, T>);
impl<T: Lookup> Iterator for IntoKeys<T> {
    type Item = T::Key;

    delegate![
        to self.0 {
            fn next(&mut self) -> Option<T::Key>;
            fn last(self) -> Option<T::Key>;
            fn nth(&mut self, n: usize) -> Option<T::Key>;
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<T: Lookup> DoubleEndedIterator for IntoKeys<T> {
    delegate![
        to self.0 {
            fn next_back(&mut self) -> Option<T::Key>;
            fn nth_back(&mut self, n: usize) -> Option<T::Key>;
        }
    ];
}
impl<T: Lookup> ExactSizeIterator for IntoKeys<T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for IntoKeys<T> {}

pub struct Drain<'a, T: Lookup> (pub(crate) indexmap::map::Drain<'a, T::Key, T>);
impl<T: Lookup> Iterator for Drain<'_, T> {
    type Item = T;

    fn next(&mut self) -> Option<Self::Item> {
        self.0.next().map(|item| item.1)
    }
    fn last(self) -> Option<Self::Item> {
        self.0.last().map(|item| item.1)
    }
    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        self.0.nth(n).map(|item| item.1)
    }

    delegate![
        to self.0 {
            fn size_hint(&self) -> (usize, Option<usize>);
            fn count(self) -> usize;
        }
    ];
}
impl<T: Lookup> DoubleEndedIterator for Drain<'_, T> {
    fn next_back(&mut self) -> Option<Self::Item> {
        self.0.next_back().map(|item| item.1)
    }
    fn nth_back(&mut self, n: usize) -> Option<Self::Item> {
        self.0.nth_back(n).map(|item| item.1)
    }
}
impl<T: Lookup> ExactSizeIterator for Drain<'_, T> {
    fn len(&self) -> usize { self.0.len() }
}
impl<T: Lookup> FusedIterator for Drain<'_, T> {}