Struct lfu::LFUCache

pub struct LFUCache<K: Hash + Eq, V> { /* fields omitted */ }

Implementations

impl<K: Hash + Eq, V> LFUCache<K, V>

pub fn with_capacity(capacity: usize) -> Result<LFUCache<K, V>, &'static str>

pub fn contains(&self, key: &K) -> bool

pub fn len(&self) -> usize

pub fn remove(&mut self, key: K) -> bool

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

Returns the value associated with the given key (if it still exists) Method marked as mutable because it internally updates the frequency of the accessed key

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

pub fn iter(&self) -> LfuIterator<K, V>

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

Trait Implementations

impl<K: Debug + Hash + Eq, V: Debug> Debug for LFUCache<K, V>

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

Formats the value using the given formatter.

impl<K: Hash + Eq, V> Index<K> for LFUCache<K, V>

type Output = V

The returned type after indexing.

fn index(&self, index: K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K: Eq + Hash, V> IntoIterator for LFUCache<K, V>

type Item = (Rc<K>, V)

The type of the elements being iterated over.

type IntoIter = LfuConsumer<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K: Hash + Eq, V> IntoIterator for &'a LFUCache<K, V>

type Item = (Rc<K>, &'a V)

The type of the elements being iterated over.

type IntoIter = LfuIterator<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.