pub struct LruModelCache<T> { /* private fields */ }Expand description
LRU (Least Recently Used) cache for model elements
Thread-safe cache with automatic eviction of least recently used items.
Implementations§
Source§impl<T> LruModelCache<T>where
T: Clone,
impl<T> LruModelCache<T>where
T: Clone,
Sourcepub fn get(&self, key: &str) -> Option<Arc<T>>
pub fn get(&self, key: &str) -> Option<Arc<T>>
Get an item from the cache
Updates access statistics and LRU ordering.
Sourcepub fn put(&mut self, key: String, value: Arc<T>)
pub fn put(&mut self, key: String, value: Arc<T>)
Put an item into the cache
If the cache is at capacity, evicts the least recently used item.
Sourcepub fn resize(&mut self, new_capacity: usize)
pub fn resize(&mut self, new_capacity: usize)
Resize the cache capacity
If the new capacity is smaller than current size, evicts LRU items.
Sourcepub fn reset_statistics(&mut self)
pub fn reset_statistics(&mut self)
Reset cache statistics
Sourcepub fn statistics(&self) -> CacheStatistics
pub fn statistics(&self) -> CacheStatistics
Get cache statistics
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for LruModelCache<T>
impl<T> RefUnwindSafe for LruModelCache<T>
impl<T> Send for LruModelCache<T>
impl<T> Sync for LruModelCache<T>
impl<T> Unpin for LruModelCache<T>
impl<T> UnsafeUnpin for LruModelCache<T>
impl<T> UnwindSafe for LruModelCache<T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.