tiered-cache 0.1.6

A high-performance multi-tiered cache with automatic sizing
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

use std::sync::Arc;
use lru_mem::HeapSize;

#[allow(dead_code)]
pub(crate) struct CacheEntry<V> {
    pub value: Arc<V>,
    pub size: usize,
}

impl<V: HeapSize> HeapSize for CacheEntry<V> {
    fn heap_size(&self) -> usize {
        self.value.heap_size() + std::mem::size_of::<Self>()
    }
}

impl<V> CacheEntry<V> {
    pub fn new(value: V, size: usize) -> Self {
        Self {
            value: Arc::new(value),
            size,
        }
    }
}