tinylfu-cached 0.0.4

High performance, LFU based in-memory cache.
Documentation 
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

use std::hash::Hash;
use std::sync::Arc;

use crate::cache::buffer_event::{BufferConsumer, BufferEvent};
use crate::cache::policy::admission_policy::AdmissionPolicy;
use crate::cache::policy::config::CacheWeightConfig;
use crate::cache::stats::ConcurrentStatsCounter;
use crate::cache::types::{TotalCapacity, TotalCounters, TotalShards, Weight};

/// Proxy representation of the `crate::cache::policy::admission_policy::AdmissionPolicy`.
/// AdmissionPolicy also acts as a buffer consumer that consumes the access buffer after it is drained.
/// ProxyAdmissionPolicy implements `BufferConsumer` trait and ends up delegating to the AdmissionPolicy.
/// ProxyAdmissionPolicy is used in `benchmark benches/benchmarks/read_buffer.rs`
pub struct ProxyAdmissionPolicy<Key>
    where Key: Hash + Eq + Send + Sync + Clone + 'static, {
    admission_policy: Arc<AdmissionPolicy<Key>>,
}

impl<Key> ProxyAdmissionPolicy<Key>
    where Key: Hash + Eq + Send + Sync + Clone + 'static, {
    #[cfg(not(tarpaulin_include))]
    pub fn new(counters: TotalCounters, capacity: TotalCapacity, shards: TotalShards, total_cache_weight: Weight) -> Self {
        ProxyAdmissionPolicy {
            admission_policy: Arc::new(
                AdmissionPolicy::new(
                    counters,
                    CacheWeightConfig::new(
                        capacity,
                        shards,
                        total_cache_weight,
                    ),
                    Arc::new(ConcurrentStatsCounter::new()),
                )
            )
        }
    }
}

impl<Key> BufferConsumer for ProxyAdmissionPolicy<Key>
    where Key: Hash + Eq + Send + Sync + Clone + 'static, {
    #[cfg(not(tarpaulin_include))]
    fn accept(&self, event: BufferEvent) {
        self.admission_policy.accept(event);
    }
}