hashslab 0.5.2

A hash table with data accessible by index.
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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202

use core::{fmt, iter::FusedIterator};

use hashbrown::hash_table;

use crate::KeyData;

/// An iterator over the index-key pairs of an [`HashSlabMap`].
///
/// This `struct` is created by the [`HashSlabMap::full_keys`] method.
/// See its documentation for more.
///
/// [`HashSlabMap`]: crate::HashSlabMap
/// [`HashSlabMap::full_keys`]: crate::HashSlabMap::full_keys
pub struct FullKeys<'a, K> {
    iter: hash_table::Iter<'a, KeyData<K>>,
}

impl<'a, K> FullKeys<'a, K> {
    pub(super) fn new(iter: hash_table::Iter<'a, KeyData<K>>) -> Self {
        Self { iter }
    }
}

// https://github.com/rust-lang/rust/issues/26925
impl<K> Clone for FullKeys<'_, K> {
    fn clone(&self) -> Self {
        FullKeys {
            iter: self.iter.clone(),
        }
    }
}

impl<K: fmt::Debug> fmt::Debug for FullKeys<'_, K> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_list().entries(self.clone()).finish()
    }
}

impl<K> Default for FullKeys<'_, K> {
    fn default() -> Self {
        Self {
            iter: Default::default(),
        }
    }
}

impl<'a, K> Iterator for FullKeys<'a, K> {
    type Item = (usize, &'a K);

    fn next(&mut self) -> Option<Self::Item> {
        self.iter
            .next()
            .map(|KeyData { index, key, .. }| (*index, key))
    }
}

impl<K> ExactSizeIterator for FullKeys<'_, K> {
    fn len(&self) -> usize {
        self.iter.len()
    }
}

impl<K> FusedIterator for FullKeys<'_, K> {}

/// An iterator over the keys of an [`HashSlabMap`].
///
/// This `struct` is created by the [`HashSlabMap::keys`] method.
/// See its documentation for more.
///
/// [`HashSlabMap`]: crate::HashSlabMap
/// [`HashSlabMap::keys`]: crate::HashSlabMap::keys
pub struct Keys<'a, K> {
    pub(super) full_keys: FullKeys<'a, K>,
}

impl<'a, K> Keys<'a, K> {
    pub fn new(full_keys: FullKeys<'a, K>) -> Self {
        Self { full_keys }
    }
}

// https://github.com/rust-lang/rust/issues/26925
impl<K> Clone for Keys<'_, K> {
    fn clone(&self) -> Self {
        Keys {
            full_keys: self.full_keys.clone(),
        }
    }
}

impl<K: fmt::Debug> fmt::Debug for Keys<'_, K> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_list().entries(self.clone()).finish()
    }
}

impl<K> Default for Keys<'_, K> {
    fn default() -> Self {
        Self {
            full_keys: Default::default(),
        }
    }
}

impl<'a, K> Iterator for Keys<'a, K> {
    type Item = &'a K;

    fn next(&mut self) -> Option<Self::Item> {
        self.full_keys.next().map(|(_, k)| k)
    }
}

impl<K> ExactSizeIterator for Keys<'_, K> {
    fn len(&self) -> usize {
        self.full_keys.len()
    }
}

impl<K> FusedIterator for Keys<'_, K> {}

/// An owning iterator over the keys of an [`HashSlabMap`].
///
/// This `struct` is created by the [`HashSlabMap::into_keys`] method.
/// See its documentation for more.
///
/// [`HashSlabMap`]: crate::HashSlabMap
/// [`HashSlabMap::into_keys`]: crate::HashSlabMap::into_keys
pub struct IntoKeys<K> {
    into_iter: hash_table::IntoIter<KeyData<K>>,
}

impl<K> IntoKeys<K> {
    pub(super) fn new(into_iter: hash_table::IntoIter<KeyData<K>>) -> Self {
        Self { into_iter }
    }
}

impl<K: fmt::Debug> fmt::Debug for IntoKeys<K> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_struct("IntoKeys")
            .field("remaining", &self.len())
            .finish()
    }
}

impl<K> Default for IntoKeys<K> {
    fn default() -> Self {
        Self {
            into_iter: Default::default(),
        }
    }
}

impl<K> Iterator for IntoKeys<K> {
    type Item = K;

    fn next(&mut self) -> Option<Self::Item> {
        self.into_iter.next().map(|KeyData { key, .. }| key)
    }
}

impl<K> ExactSizeIterator for IntoKeys<K> {
    fn len(&self) -> usize {
        self.into_iter.len()
    }
}

impl<K> FusedIterator for IntoKeys<K> {}

/// An iterator over the indexes ([`usize`] keys) of an [`HashSlabMap`].
///
/// This `struct` is created by the [`HashSlabMap::indices`] method.
/// See its documentation for more.
///
/// [`HashSlabMap`]: crate::HashSlabMap
/// [`HashSlabMap::indices`]: crate::HashSlabMap::indices
#[derive(Debug, Clone)]
pub struct Indices<'a, K> {
    iter: hash_table::Iter<'a, KeyData<K>>,
}

impl<'a, K> Indices<'a, K> {
    pub(super) fn new(iter: hash_table::Iter<'a, KeyData<K>>) -> Self {
        Self { iter }
    }
}

impl<K> Iterator for Indices<'_, K> {
    type Item = usize;

    fn next(&mut self) -> Option<Self::Item> {
        self.iter.next().map(|KeyData { index, .. }| *index)
    }
}

impl<K> ExactSizeIterator for Indices<'_, K> {
    fn len(&self) -> usize {
        self.iter.len()
    }
}

impl<K> FusedIterator for Indices<'_, K> {}