pub struct LfuCache<K, V, S = DefaultHashBuilder> { /* private fields */ }Expand description
An implementation of a Least Frequently Used (LFU) cache.
The cache tracks the frequency of access for each item and evicts the least frequently used items when the cache reaches capacity. In case of a tie in frequency, the least recently used item among those with the same frequency is evicted.
§Examples
use cache_rs::lfu::LfuCache;
use cache_rs::config::LfuCacheConfig;
use core::num::NonZeroUsize;
// Create an LFU cache with capacity 3
let config = LfuCacheConfig {
capacity: NonZeroUsize::new(3).unwrap(),
max_size: u64::MAX,
};
let mut cache = LfuCache::init(config, None);
// Add some items
cache.put("a", 1);
cache.put("b", 2);
cache.put("c", 3);
// Access "a" multiple times to increase its frequency
assert_eq!(cache.get(&"a"), Some(&1));
assert_eq!(cache.get(&"a"), Some(&1));
// Add a new item, which will evict the least frequently used item
cache.put("d", 4);
assert_eq!(cache.get(&"b"), None); // "b" was evicted as it had frequency 0Implementations§
Source§impl<K: Hash + Eq, V: Clone, S: BuildHasher> LfuCache<K, V, S>
impl<K: Hash + Eq, V: Clone, S: BuildHasher> LfuCache<K, V, S>
Sourcepub fn cap(&self) -> NonZeroUsize
pub fn cap(&self) -> NonZeroUsize
Returns the maximum number of key-value pairs the cache can hold.
Sourcepub fn current_size(&self) -> u64
pub fn current_size(&self) -> u64
Returns the current total size of cached content.
Sourcepub fn put(&mut self, key: K, value: V) -> Option<(K, V)>where
K: Clone,
pub fn put(&mut self, key: K, value: V) -> Option<(K, V)>where
K: Clone,
Inserts a key-value pair into the cache.
If the cache already contained this key, the old value is replaced and returned. Otherwise, if the cache is at capacity, the least frequently used item is evicted. In case of a tie in frequency, the least recently used item among those with the same frequency is evicted.
New items are inserted with a frequency of 1.
Sourcepub fn put_with_size(&mut self, key: K, value: V, size: u64) -> Option<(K, V)>where
K: Clone,
pub fn put_with_size(&mut self, key: K, value: V, size: u64) -> Option<(K, V)>where
K: Clone,
Insert a key-value pair with explicit size tracking.
The size parameter specifies how much of max_size this entry consumes.
Use size=1 for count-based caches.
Sourcepub fn record_miss(&mut self, object_size: u64)
pub fn record_miss(&mut self, object_size: u64)
Records a cache miss for metrics tracking (to be called by simulation system)
Source§impl<K: Hash + Eq, V> LfuCache<K, V>where
V: Clone,
impl<K: Hash + Eq, V> LfuCache<K, V>where
V: Clone,
Sourcepub fn init(
config: LfuCacheConfig,
hasher: Option<DefaultHashBuilder>,
) -> LfuCache<K, V, DefaultHashBuilder>
pub fn init( config: LfuCacheConfig, hasher: Option<DefaultHashBuilder>, ) -> LfuCache<K, V, DefaultHashBuilder>
Creates a new LFU cache from a configuration.
This is the recommended way to create an LFU cache. All configuration
is specified through the LfuCacheConfig struct.
§Arguments
config- Configuration specifying capacity and optional size limithasher- Optional custom hash builder (uses default ifNone)
§Example
use cache_rs::LfuCache;
use cache_rs::config::LfuCacheConfig;
use core::num::NonZeroUsize;
// Simple capacity-only cache
let config = LfuCacheConfig {
capacity: NonZeroUsize::new(100).unwrap(),
max_size: u64::MAX,
};
let mut cache: LfuCache<&str, i32> = LfuCache::init(config, None);
cache.put("key", 42);
// Cache with size limit
let config = LfuCacheConfig {
capacity: NonZeroUsize::new(1000).unwrap(),
max_size: 10 * 1024 * 1024, // 10MB
};
let cache: LfuCache<String, Vec<u8>> = LfuCache::init(config, None);