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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
#[cfg(not(feature = "alloc"))]
use tinymap::{TinyMap, TinyMapIterator};
#[cfg(feature = "alloc")]
use core::marker::PhantomData;
#[cfg(feature = "alloc")]
use hashbrown::HashMap;
use core::{fmt, hash::Hash, iter};
#[repr(transparent)]
pub struct StorageMap<K: Eq + Ord + Hash, V, const N: usize>(SMImpl<K, V, N>);
#[cfg(feature = "alloc")]
#[repr(transparent)]
struct SMImpl<K: Eq + Ord + Hash, V, const N: usize>(HashMap<K, V>, PhantomData<[V; N]>);
#[cfg(not(feature = "alloc"))]
#[repr(transparent)]
struct SMImpl<K: Eq + Ord + Hash, V, const N: usize>(TinyMap<K, V, N>);
impl<K: Eq + Ord + Hash, V, const N: usize> StorageMap<K, V, N> {
#[inline]
#[must_use]
pub fn new() -> Self {
Self::new_impl()
}
#[cfg(feature = "alloc")]
#[inline]
fn new_impl() -> Self {
Self(SMImpl(HashMap::new(), PhantomData))
}
#[cfg(not(feature = "alloc"))]
#[inline]
fn new_impl() -> Self {
Self(SMImpl(TinyMap::new()))
}
#[inline]
#[must_use]
pub fn len(&self) -> usize {
(self.0).0.len()
}
#[inline]
#[must_use]
pub fn is_empty(&self) -> bool {
(self.0).0.is_empty()
}
#[inline]
#[must_use]
pub fn get(&self, key: &K) -> Option<&V> {
(self.0).0.get(key)
}
#[inline]
#[must_use]
pub fn get_mut(&mut self, key: &K) -> Option<&mut V> {
(self.0).0.get_mut(key)
}
#[inline]
pub fn try_insert(&mut self, key: K, value: V) -> Result<Option<V>, (K, V)> {
self.try_insert_impl(key, value)
}
#[cfg(feature = "alloc")]
#[inline]
fn try_insert_impl(&mut self, key: K, value: V) -> Result<Option<V>, (K, V)> {
Ok((self.0).0.insert(key, value))
}
#[cfg(not(feature = "alloc"))]
#[inline]
fn try_insert_impl(&mut self, key: K, value: V) -> Result<Option<V>, (K, V)> {
(self.0).0.try_insert(key, value)
}
#[inline]
pub fn insert(&mut self, key: K, value: V) -> Option<V> {
(self.0).0.insert(key, value)
}
#[inline]
pub fn remove_entry(&mut self, key: &K) -> Option<(K, V)> {
(self.0).0.remove_entry(key)
}
#[inline]
pub fn remove(&mut self, key: &K) -> Option<V> {
(self.0).0.remove(key)
}
#[inline]
pub fn contains_key(&self, key: &K) -> bool {
(self.0).0.contains_key(key)
}
#[inline]
pub fn iter(&self) -> impl Iterator<Item = (&K, &V)> {
(self.0).0.iter()
}
#[inline]
pub fn iter_mut(&mut self) -> impl Iterator<Item = (&K, &mut V)> {
(self.0).0.iter_mut()
}
#[inline]
pub fn keys(&self) -> impl Iterator<Item = &K> {
(self.0).0.keys()
}
#[inline]
pub fn values(&self) -> impl Iterator<Item = &V> {
(self.0).0.values()
}
#[inline]
pub fn values_mut(&mut self) -> impl Iterator<Item = &mut V> {
(self.0).0.values_mut()
}
}
impl<K: Ord + Eq + Hash + fmt::Debug, V: fmt::Debug, const N: usize> fmt::Debug
for StorageMap<K, V, N>
{
#[inline]
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
fmt::Debug::fmt(&(self.0).0, f)
}
}
impl<K: Ord + Eq + Hash + Clone, V: Clone, const N: usize> Clone for SMImpl<K, V, N> {
#[cfg(feature = "alloc")]
#[inline]
fn clone(&self) -> Self {
Self(self.0.clone(), PhantomData)
}
#[cfg(not(feature = "alloc"))]
#[inline]
fn clone(&self) -> Self {
Self(self.0.clone())
}
}
impl<K: Ord + Eq + Hash + Clone, V: Clone, const N: usize> Clone for StorageMap<K, V, N> {
#[inline]
fn clone(&self) -> Self {
Self(self.0.clone())
}
}
impl<K: Ord + Eq + Hash, V, const N: usize> iter::IntoIterator for StorageMap<K, V, N> {
type Item = (K, V);
#[cfg(feature = "alloc")]
type IntoIter = hashbrown::hash_map::IntoIter<K, V>;
#[cfg(not(feature = "alloc"))]
type IntoIter = TinyMapIterator<K, V, N>;
#[inline]
fn into_iter(self) -> Self::IntoIter {
(self.0).0.into_iter()
}
}
impl<K: Ord + Eq + Hash, V, const N: usize> iter::Extend<(K, V)> for StorageMap<K, V, N> {
#[inline]
fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iter: I) {
(self.0).0.extend(iter);
}
}
impl<K: Ord + Eq + Hash, V, const N: usize> iter::FromIterator<(K, V)> for StorageMap<K, V, N> {
#[inline]
fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self {
let mut map = Self::new();
map.extend(iter);
map
}
}
impl<K: Ord + Eq + Hash, V, const N: usize> Default for StorageMap<K, V, N> {
#[inline]
fn default() -> Self {
Self::new()
}
}