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
|
use std::hash::Hash;
use boxcar;
use dashmap::DashMap;
pub struct Interner<V, I>
where
V: Copy + Eq + Hash,
I: Copy + Into<usize>,
{
map: DashMap<V, I>,
store: boxcar::Vec<V>,
}
impl<V, I> Interner<V, I>
where
V: Copy + Eq + Hash,
I: Copy + From<usize> + Into<usize>,
{
pub fn new() -> Self {
return Interner {
map: DashMap::new(),
store: boxcar::Vec::with_capacity(1024),
};
}
pub fn get(&self, key: I) -> V {
return self.store[key.into()];
}
pub fn intern(&self, value: V) -> I {
if let Some(key) = self.map.get(&value) {
return *key;
}
let key = self.store.push(value).into();
self.map.insert(value, key);
return key;
}
}
#[cfg(test)]
mod tests {
use super::Interner;
use crate::unistr::UniStr;
#[test]
fn test_interner_intern() {
let xs = [UniStr("fishi"), UniStr("fishi"), UniStr("fishᵢ")];
let y = UniStr("andy");
let mut interner = Interner::<_, usize>::new();
for i in 0..xs.len() {
for j in i..xs.len() {
assert_eq!(interner.intern(xs[i]), interner.intern(xs[j]));
}
}
for i in 0..xs.len() {
assert_ne!(interner.intern(y), interner.intern(xs[i]));
}
}
#[test]
fn test_interner_gets_first_inserted() {
let mut interner = Interner::<_, usize>::new();
let xs = [UniStr("fishi"), UniStr("fishi"), UniStr("fishᵢ")];
let ys = xs.iter().map(|&x| interner.intern(x)).collect::<Vec<_>>();
for i in 0..ys.len() {
assert_eq!(interner.get(ys[i]), xs[0]);
}
}
}
|
