Struct TieredCache 

pub struct TieredCache { /* private fields */ }

Multi-level cache with automatic tiering.

Implementations

impl TieredCache

pub async fn new(config: TieredCacheConfig) -> Result<Self, TieredCacheError>

Create a new tiered cache.

pub async fn put( &mut self, key: String, data: Vec<u8>, ) -> Result<(), TieredCacheError>

Put data into cache (starts in L1).

pub async fn get( &mut self, key: &str, ) -> Result<Option<Vec<u8>>, TieredCacheError>

Get data from cache.

pub async fn remove(&mut self, key: &str) -> Result<(), TieredCacheError>

Remove item from cache.

pub const fn stats(&self) -> &TieredCacheStats

Get cache statistics.

pub fn l1_usage_percent(&self) -> f64

Get L1 usage percentage.

pub async fn warm_with_data( &mut self, items: Vec<(String, Vec<u8>)>, ) -> Result<usize, TieredCacheError>

Warm the cache with a list of key-value pairs.

This is useful for cold starts where you want to pre-populate frequently accessed data. Items are placed according to available capacity, starting from L1.

pub async fn warm_from_keys( &mut self, keys: &[String], ) -> Result<usize, TieredCacheError>

Warm the cache by loading keys from a list.

This method attempts to load data from storage tiers (L2/L3) and promote them to L1 for faster access on startup.

pub fn export_hot_keys(&self, limit: usize) -> Vec<String>

Export hot keys (most frequently accessed) for warming on next startup.

Returns keys sorted by access count in descending order.

pub fn len(&self) -> usize

Get the number of cached items.

pub fn is_empty(&self) -> bool

Check if the cache is empty.