Struct schnellru::Unlimited

pub struct Unlimited;

A limiter for a map which can hold an unlimited number of elements.

With this limiter the map will act like a normal ordered hashmap.

On 64-bit systems it is less efficient and uses more memory than UnlimitedCompact, but can hold a truly unlimited number of elements.

On 32-bit systems it is exactly the same as UnlimitedCompact.

Trait Implementations

impl Clone for Unlimited

fn clone(&self) -> Unlimited

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Unlimited

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

Formats the value using the given formatter.

impl Default for Unlimited

fn default() -> Unlimited

Returns the “default value” for a type.

impl<K, V> Limiter<K, V> for Unlimited

type KeyToInsert<'a> = K

The type of the key to be inserted into the map.

type LinkType = usize

The type used to hold the links between the nodes inside of the LRU map.

fn is_over_the_limit(&self, _: usize) -> bool

Checks whether any of the elements must be popped.

fn on_insert(
    &mut self,
    _length: usize,
    key: Self::KeyToInsert<'_>,
    value: V
) -> Option<(K, V)>

Called before a node is inserted into the map.

fn on_replace(
    &mut self,
    _length: usize,
    _old_key: &mut K,
    _new_key: K,
    _old_value: &mut V,
    _new_value: &mut V
) -> bool

Called before a node is replaced inside of the map.

fn on_removed(&mut self, _key: &mut K, _value: &mut V)

Called after an element is removed from the map.

fn on_cleared(&mut self)

Called after the map is cleared.

fn on_grow(&mut self, _new_memory_usage: usize) -> bool

Called before the map is resized.

impl Copy for Unlimited