pub struct PriorityEntries<T> { /* private fields */ }Implementations§
Source§impl<T: Clone> PriorityEntries<T>
impl<T: Clone> PriorityEntries<T>
pub fn is_empty(&self) -> bool
pub fn len(&self) -> usize
pub fn bytes(&self) -> usize
pub fn get(&mut self, key: &InternalCacheKey) -> Option<T>
Sourcepub fn peek(&self, key: &InternalCacheKey) -> Option<&T>
pub fn peek(&self, key: &InternalCacheKey) -> Option<&T>
Look up an entry without refreshing its recency.
Sourcepub fn contains(&self, key: &InternalCacheKey) -> bool
pub fn contains(&self, key: &InternalCacheKey) -> bool
Membership only; unlike get, recency is unchanged.
pub fn remove(&mut self, key: &InternalCacheKey) -> Option<T>
pub fn insert( &mut self, key: InternalCacheKey, value: T, bytes: usize, priority: u8, capacity: usize, ) -> Vec<T>
pub fn clear(&mut self) -> Vec<T>
pub fn snapshot(&self) -> Vec<(InternalCacheKey, usize, T)>
pub fn stats(&self) -> [(usize, usize); 3]
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for PriorityEntries<T>
impl<T> RefUnwindSafe for PriorityEntries<T>
impl<T> Send for PriorityEntries<T>
impl<T> Sync for PriorityEntries<T>
impl<T> Unpin for PriorityEntries<T>
impl<T> UnsafeUnpin for PriorityEntries<T>
impl<T> UnwindSafe for PriorityEntries<T>
Blanket Implementations§
impl<T> Allocation for T
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