Struct QueryCache 

pub struct QueryCache { /* private fields */ }

Thread-safe LRU cache for query results.

Uses parking_lot::RwLock for efficient concurrent access. Read operations (cache hits) only require a read lock; mutations (inserts, evictions, invalidations) acquire a write lock.

Implementations

impl QueryCache

pub fn new(config: QueryCacheConfig) -> Self

Create a new cache with the given configuration.

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

Look up a cached value by its raw key bytes.

Returns None if the entry does not exist or has expired. A successful lookup increments the hit counter and moves the entry to the most-recently-used position.

pub fn put(&self, key: &[u8], value: Vec<u8>)

Insert a value into the cache.

If the value exceeds max_value_size it is silently dropped. If the cache is at capacity, the least recently used entry is evicted first.

pub fn put_with_collection( &self, key: &[u8], value: Vec<u8>, collection: Option<&str>, )

Insert a value into the cache with an associated collection name.

The collection name is used for invalidate_collection.

pub fn invalidate(&self, key: &[u8])

Remove a specific entry from the cache.

pub fn invalidate_collection(&self, collection: &str)

Remove all cache entries belonging to a given collection.

pub fn clear(&self)

Remove all entries from the cache.

pub fn stats(&self) -> CacheStats

Return a snapshot of the current cache statistics.

pub fn len(&self) -> usize

Return the current number of entries in the cache.

pub fn is_empty(&self) -> bool

Check whether the cache is empty.

pub fn config(&self) -> &QueryCacheConfig

Get a reference to the cache configuration.

pub fn invalidation_policy(&self) -> InvalidationPolicy

Return the invalidation policy.

pub fn make_key(collection: &str, query_key: &[u8]) -> Vec<u8>

Build a composite cache key from collection + query key and hash it.