Struct WeightedCache 

pub struct WeightedCache { /* private fields */ }

Capacity-bounded cache that uses per-media-type weight factors to choose eviction candidates.

Entries are scored on each eviction pass; the entry with the lowest score (least worth keeping) is removed first.

Implementations

impl WeightedCache

pub fn new(capacity: usize, weights: WeightConfig) -> Self

Create a new WeightedCache with the given capacity and weight config.

Panics

Panics if capacity is 0.

pub fn insert( &mut self, key: impl Into<String>, value: Vec<u8>, media_type: CacheMediaType, priority: u8, )

Insert (key, value) into the cache with the given media_type and priority label (0–255, higher = more important).

If the key already exists it is overwritten. If the cache is at capacity, the lowest-scored entry is evicted first.

pub fn get(&mut self, key: &str) -> Option<&[u8]>

Look up key and return a reference to its value.

Records a hit or miss and updates last_accessed on hit.

pub fn remove(&mut self, key: &str) -> Option<Vec<u8>>

Remove the entry for key and return it (if present).

pub fn contains(&self, key: &str) -> bool

Return true when key is present.

pub fn len(&self) -> usize

Number of entries currently stored.

pub fn is_empty(&self) -> bool

Return true when no entries are stored.

pub fn capacity(&self) -> usize

Maximum number of entries the cache will hold.

pub fn hits(&self) -> u64

Total cache hits recorded.

pub fn misses(&self) -> u64

Total cache misses recorded.

pub fn evictions(&self) -> u64

Total evictions performed.

pub fn hit_rate(&self) -> f64

Hit rate as a fraction [0.0, 1.0].

pub fn resize(&mut self, new_capacity: usize)

Resize the cache. If new_capacity is smaller than the current entry count, entries are evicted until the count fits.

pub fn clear(&mut self)

Clear all entries and reset statistics.