Struct DelayedMap

pub struct DelayedMap<K, V> {
    cache: HashMap<K, V>,
    count: u32,
}

A hashmap which only starts hashing after ignoring the first few inputs.

This is used in type folders as in nearly all cases caching is not worth it as nearly all folded types are tiny. However, there are very rare incredibly large types for which caching is necessary to avoid hangs.

Fields

cache: HashMap<K, V>

count: u32

Implementations

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

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

fn cold_insert(&mut self, key: K, value: V) -> bool

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

fn cold_get(&self, key: &K) -> Option<&V>

Trait Implementations

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

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

Formats the value using the given formatter.

impl<K, V> Default for DelayedMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 40 bytes