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
221
222
223
224
225
226
227
228
229
230
231
use core::{
hash::{BuildHasher, Hash, Hasher},
marker::PhantomData,
};
use hashbrown::{hash_map::DefaultHashBuilder, raw::RawIter};
#[derive(Clone, Default)]
pub struct KeyedSet<T, Extractor, S = DefaultHashBuilder> {
inner: hashbrown::raw::RawTable<T>,
hash_builder: S,
extractor: Extractor,
}
pub trait KeyExtractor<'a, T> {
type Key: Hash;
fn extract(&self, from: &'a T) -> Self::Key;
}
impl<'a, T: 'a, U: Hash, F: Fn(&'a T) -> U> KeyExtractor<'a, T> for F {
type Key = U;
fn extract(&self, from: &'a T) -> Self::Key {
self(from)
}
}
impl<'a, T: 'a + Hash> KeyExtractor<'a, T> for () {
type Key = &'a T;
fn extract(&self, from: &'a T) -> Self::Key {
from
}
}
impl<T, Extractor> KeyedSet<T, Extractor>
where
Extractor: for<'a> KeyExtractor<'a, T>,
for<'a> <Extractor as KeyExtractor<'a, T>>::Key: std::hash::Hash,
{
pub fn new(extractor: Extractor) -> Self {
Self {
inner: Default::default(),
hash_builder: Default::default(),
extractor,
}
}
}
impl<T: std::fmt::Debug, Extractor, S> std::fmt::Debug for KeyedSet<T, Extractor, S> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "KeyedSet {{")?;
for v in self.iter() {
write!(f, "{:?}, ", v)?;
}
write!(f, "}}")
}
}
impl<T, Extractor, S> KeyedSet<T, Extractor, S>
where
Extractor: for<'a> KeyExtractor<'a, T>,
for<'a> <Extractor as KeyExtractor<'a, T>>::Key: std::hash::Hash,
S: BuildHasher,
{
pub fn insert(&mut self, value: T) -> Option<T>
where
for<'a, 'b> <Extractor as KeyExtractor<'a, T>>::Key:
PartialEq<<Extractor as KeyExtractor<'b, T>>::Key>,
{
let key = self.extractor.extract(&value);
let mut hasher = self.hash_builder.build_hasher();
key.hash(&mut hasher);
let hash = hasher.finish();
match self
.inner
.get_mut(hash, |i| self.extractor.extract(i).eq(&key))
{
Some(bucket) => {
core::mem::drop(key);
Some(core::mem::replace(bucket, value))
}
None => {
core::mem::drop(key);
let hasher = make_hasher(&self.hash_builder, &self.extractor);
self.inner.insert(hash, value, hasher);
None
}
}
}
pub fn get<K>(&self, key: &K) -> Option<&T>
where
K: std::hash::Hash,
for<'a> <Extractor as KeyExtractor<'a, T>>::Key: std::hash::Hash + PartialEq<K>,
{
let mut hasher = self.hash_builder.build_hasher();
key.hash(&mut hasher);
let hash = hasher.finish();
self.inner.get(hash, |i| self.extractor.extract(i).eq(key))
}
pub fn get_mut<'a, K>(&'a mut self, key: &'a K) -> Option<KeyedSetGuard<'a, K, T, Extractor>>
where
K: std::hash::Hash,
for<'z> <Extractor as KeyExtractor<'z, T>>::Key: std::hash::Hash + PartialEq<K>,
{
let mut hasher = self.hash_builder.build_hasher();
key.hash(&mut hasher);
let hash = hasher.finish();
self.inner
.get_mut(hash, |i| self.extractor.extract(i).eq(key))
.map(|guarded| KeyedSetGuard {
guarded,
key,
extractor: &self.extractor,
})
}
}
impl<T, Extractor, S> KeyedSet<T, Extractor, S> {
pub fn iter(&self) -> Iter<T> {
Iter {
inner: unsafe { self.inner.iter() },
marker: PhantomData,
}
}
pub fn iter_mut(&mut self) -> IterMut<T> {
IterMut {
inner: unsafe { self.inner.iter() },
marker: PhantomData,
}
}
pub fn len(&self) -> usize {
self.inner.len()
}
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
}
pub struct KeyedSetGuard<'a, K, T, Extractor>
where
Extractor: for<'z> KeyExtractor<'z, T>,
for<'z> <Extractor as KeyExtractor<'z, T>>::Key: std::hash::Hash + PartialEq<K>,
{
guarded: &'a mut T,
key: &'a K,
extractor: &'a Extractor,
}
impl<'a, K, T, Extractor> std::ops::Deref for KeyedSetGuard<'a, K, T, Extractor>
where
Extractor: for<'z> KeyExtractor<'z, T>,
for<'z> <Extractor as KeyExtractor<'z, T>>::Key: std::hash::Hash + PartialEq<K>,
{
type Target = T;
fn deref(&self) -> &Self::Target {
self.guarded
}
}
impl<'a, K, T, Extractor> std::ops::DerefMut for KeyedSetGuard<'a, K, T, Extractor>
where
Extractor: for<'z> KeyExtractor<'z, T>,
for<'z> <Extractor as KeyExtractor<'z, T>>::Key: std::hash::Hash + PartialEq<K>,
{
fn deref_mut(&mut self) -> &mut Self::Target {
self.guarded
}
}
impl<'a, K, T, Extractor> Drop for KeyedSetGuard<'a, K, T, Extractor>
where
Extractor: for<'z> KeyExtractor<'z, T>,
for<'z> <Extractor as KeyExtractor<'z, T>>::Key: std::hash::Hash + PartialEq<K>,
{
fn drop(&mut self) {
if !self.extractor.extract(&*self.guarded).eq(self.key) {
panic!("KeyedSetGuard dropped with new value that would change the key, breaking the internal table's invariants.")
}
}
}
pub struct Iter<'a, T> {
inner: RawIter<T>,
marker: PhantomData<&'a ()>,
}
impl<'a, T: 'a> Iterator for Iter<'a, T> {
type Item = &'a T;
fn next(&mut self) -> Option<Self::Item> {
self.inner.next().map(|b| unsafe { b.as_ref() })
}
}
impl<'a, T: 'a> ExactSizeIterator for Iter<'a, T> {
fn len(&self) -> usize {
self.inner.len()
}
}
pub struct IterMut<'a, T> {
inner: RawIter<T>,
marker: PhantomData<&'a mut ()>,
}
impl<'a, T: 'a> Iterator for IterMut<'a, T> {
type Item = &'a mut T;
fn next(&mut self) -> Option<Self::Item> {
self.inner.next().map(|b| unsafe { b.as_mut() })
}
}
impl<'a, T: 'a> ExactSizeIterator for IterMut<'a, T> {
fn len(&self) -> usize {
self.inner.len()
}
}
fn make_hasher<'a, S: BuildHasher, Extractor, T>(
hash_builder: &'a S,
extractor: &'a Extractor,
) -> impl Fn(&T) -> u64 + 'a
where
Extractor: for<'b> KeyExtractor<'b, T>,
for<'b> <Extractor as KeyExtractor<'b, T>>::Key: std::hash::Hash,
{
move |value| {
let key = extractor.extract(value);
let mut hasher = hash_builder.build_hasher();
key.hash(&mut hasher);
hasher.finish()
}
}
#[test]
fn test() {
let mut set = KeyedSet::new(|value: &(u64, u64)| value.0);
assert_eq!(set.len(), 0);
set.insert((0, 0));
assert_eq!(set.insert((0, 1)), Some((0, 0)));
dbg!(&set);
assert_eq!(set.len(), 1);
assert_eq!(set.get(&0), Some(&(0, 1)));
assert!(set.get(&1).is_none());
}