use hashlink::lru_cache::LruCache;
#[derive(Debug)]
pub struct StatementCache<T> {
inner: LruCache<String, T>,
}
impl<T> StatementCache<T> {
pub fn new(capacity: usize) -> Self {
Self {
inner: LruCache::new(capacity),
}
}
pub fn get_mut(&mut self, k: &str) -> Option<&mut T> {
self.inner.get_mut(k)
}
pub fn insert(&mut self, k: &str, v: T) -> Option<T> {
let mut lru_item = None;
if self.capacity() == self.len() && !self.contains_key(k) {
lru_item = self.remove_lru();
} else if self.contains_key(k) {
lru_item = self.inner.remove(k);
}
self.inner.insert(k.into(), v);
lru_item
}
pub fn len(&self) -> usize {
self.inner.len()
}
pub fn is_empty(&self) -> bool {
self.inner.is_empty()
}
pub fn remove_lru(&mut self) -> Option<T> {
self.inner.remove_lru().map(|(_, v)| v)
}
pub fn clear(&mut self) {
self.inner.clear();
}
pub fn contains_key(&mut self, k: &str) -> bool {
self.inner.contains_key(k)
}
pub fn capacity(&self) -> usize {
self.inner.capacity()
}
#[allow(dead_code)] pub fn is_enabled(&self) -> bool {
self.capacity() > 0
}
}