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
use std::borrow::Borrow;
use std::fmt::{self, Debug};
use std::hash::Hash;
use std::marker::PhantomData;
use linked_hash_map::{Entries, LinkedHashMap};
pub trait Meter<T> {
fn measure(&self, item: &T) -> isize;
}
pub trait Pinnable<T> {
#[inline]
fn is_pinned(&self, _: &T) -> bool {
false
}
}
#[derive(Clone, Default)]
pub struct Lru<K, V, M, P>
where
K: Eq + Hash,
M: Meter<V> + Default,
P: Pinnable<V> + Default + Clone,
{
capacity: usize,
used: usize,
map: LinkedHashMap<K, V>,
meter: M,
pin_ckr: P,
}
impl<K, V, M, P> Lru<K, V, M, P>
where
K: Eq + Hash,
M: Meter<V> + Default,
P: Pinnable<V> + Default + Clone,
{
pub fn new(capacity: usize) -> Self {
Lru {
capacity,
used: 0,
map: LinkedHashMap::new(),
meter: M::default(),
pin_ckr: P::default(),
}
}
pub fn insert(&mut self, k: K, v: V) -> Option<V> {
debug_assert!(self.capacity > 0);
let mut delta: isize = self.meter.measure(&v);
let mut ret: Option<V> = None;
if let Some(old_val) = self.map.insert(k, v) {
delta -= self.meter.measure(&old_val);
ret = Some(old_val);
}
self.used = (self.used as isize + delta) as usize;
if self.used > self.capacity {
self.remove_lru();
}
ret
}
#[inline]
pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> bool
where
K: Borrow<Q>,
Q: Eq + Hash,
{
self.map.contains_key(k)
}
#[inline]
pub fn get_refresh<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>
where
K: Borrow<Q>,
Q: Eq + Hash,
{
self.map.get_refresh(k)
}
#[inline]
pub fn entries(&mut self) -> Entries<K, V> {
self.map.entries()
}
pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>
where
K: Borrow<Q>,
Q: Eq + Hash,
{
self.map.remove(k).and_then(|v| {
self.used = (self.used as isize - self.meter.measure(&v)) as usize;
Some(v)
})
}
fn remove_lru(&mut self) -> Option<V> {
let pin_ckr = self.pin_ckr.clone();
let ret = self
.map
.entries()
.enumerate()
.find(|&(_, ref ent)| !pin_ckr.is_pinned(ent.get()))
.and_then(|(_, ent)| Some(ent.remove()));
if let Some(ref v) = ret {
self.used = (self.used as isize - self.meter.measure(v)) as usize;
}
ret
}
}
impl<K, V, M, P> Debug for Lru<K, V, M, P>
where
K: Debug + Eq + Hash,
V: Debug,
M: Meter<V> + Default,
P: Pinnable<V> + Default + Clone,
{
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.debug_struct("Lru")
.field("capacity", &self.capacity)
.field("used", &self.used)
.field("map", &self.map)
.finish()
}
}
#[derive(Debug, Clone)]
pub struct CountMeter<T> {
_marker: PhantomData<T>,
}
impl<T> Meter<T> for CountMeter<T> {
#[inline]
fn measure(&self, _: &T) -> isize {
1
}
}
impl<T> Default for CountMeter<T> {
fn default() -> Self {
CountMeter {
_marker: PhantomData::<T>,
}
}
}
#[derive(Debug, Clone)]
pub struct PinChecker<T> {
_marker: PhantomData<T>,
}
impl<T> Pinnable<T> for PinChecker<T> {}
impl<T> Default for PinChecker<T> {
fn default() -> Self {
PinChecker {
_marker: PhantomData::<T>,
}
}
}