rbdc/common/
statement_cache.rs1use lru::LruCache;
2use std::num::NonZeroUsize;
3
4#[derive(Debug)]
7pub struct StatementCache<T> {
8 inner: LruCache<String, T>,
9}
10
11impl<T> StatementCache<T> {
12 pub fn new(capacity: usize) -> Self {
14 Self {
15 inner: LruCache::new(NonZeroUsize::new(capacity).unwrap()),
16 }
17 }
18
19 pub fn get_mut(&mut self, k: &str) -> Option<&mut T> {
22 self.inner.get_mut(k)
23 }
24
25 pub fn insert(&mut self, k: &str, v: T) -> Option<T> {
29 let mut lru_item = None;
30
31 if self.capacity() == self.len() && !self.contains_key(k) {
32 lru_item = self.remove_lru();
33 } else if self.contains_key(k) {
34 let entry = self.inner.pop_entry(k);
35 match entry {
36 None => {}
37 Some(v) => {
38 lru_item = Some(v.1);
39 }
40 }
41 }
42
43 self.inner.put(k.into(), v);
44
45 lru_item
46 }
47
48 pub fn len(&self) -> usize {
50 self.inner.len()
51 }
52
53 pub fn remove_lru(&mut self) -> Option<T> {
55 self.inner.pop_lru().map(|v| v.1)
56 }
57
58 pub fn clear(&mut self) {
60 self.inner.clear();
61 }
62
63 pub fn contains_key(&mut self, k: &str) -> bool {
65 self.inner.contains(k)
66 }
67
68 pub fn capacity(&self) -> usize {
70 self.inner.cap().get()
71 }
72
73 #[allow(dead_code)] pub fn is_enabled(&self) -> bool {
76 self.capacity() > 0
77 }
78}