Struct TtlLruStore 

pub struct TtlLruStore<T> { /* private fields */ }

A thread-safe storage component combining TTL (Time-To-Live) and LRU (Least Recently Used) caching strategies

Type Parameters

• T - The type of values to store, must implement Expired trait

Implementations

impl<T: Expired + Clone> TtlLruStore<T>

pub fn new(size: NonZeroUsize) -> Self

Creates a new TtlLruStore with specified capacity

Arguments

• size - Maximum number of items the cache can hold (must be non-zero)

Returns

• A new TtlLruStore instance

pub async fn set(&self, key: &str, value: T)

Stores a value in the cache

Arguments

• key - The key under which to store the value
• value - The value to store

Notes

• If the cache is at capacity, the least recently used item will be removed
• If the key already exists, the value will be updated

pub async fn get(&self, key: &str) -> Option<T>

Retrieves a value from the cache if it exists and hasn’t expired

Arguments

• key - The key to look up

Returns

• Some(T) - The value if found and not expired
• None - If key doesn’t exist or value has expired

Notes

• Uses peek() instead of get() to avoid updating LRU order
• Returns a clone of the value to maintain thread safety

pub async fn del(&self, key: &str)

Removes a value from the cache

Arguments

• key - The key to remove

Notes

• No-op if key doesn’t exist
• Requires mutable access to the store

pub async fn purge_expired(&self)

This method should be called periodically to free up memory from expired “garbage” data.