Struct LookupCache 

pub struct LookupCache<K, V> { /* private fields */ }

Cache for frequently accessed lookups.

This provides a simple LRU-like cache for domain and predicate lookups to avoid repeated hash table accesses.

Example

use tensorlogic_adapters::LookupCache;

let mut cache = LookupCache::new(100);
cache.insert("Person".to_string(), 42);
assert_eq!(cache.get(&"Person".to_string()), Some(&42));

Implementations

impl<K: Clone + Eq + Hash, V: Clone> LookupCache<K, V>

pub fn new(capacity: usize) -> Self

Create a new lookup cache with the given capacity.

pub fn insert(&mut self, key: K, value: V)

Insert a key-value pair into the cache.

If the cache is at capacity, removes the least recently used item.

pub fn get(&mut self, key: &K) -> Option<&V>

Get a value from the cache, updating access count.

pub fn clear(&mut self)

Clear the cache.

pub fn len(&self) -> usize

Get the number of items in the cache.

pub fn is_empty(&self) -> bool

Check if the cache is empty.

pub fn stats(&self) -> CacheStats

Get cache hit statistics.

Trait Implementations

impl<K: Clone, V: Clone> Clone for LookupCache<K, V>

fn clone(&self) -> LookupCache<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for LookupCache<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.