Type Alias FastHashMap 

pub type FastHashMap = HashMap<usize, Entry, RandomState>;

HashMap with ahash for faster hashing (not DOS-resistant).

Uses ahash instead of SipHash for improved throughput. Not DOS-resistant, suitable for local, non-hostile environments.

Aliased Type

pub struct FastHashMap { /* private fields */ }

Trait Implementations

impl MapStorage for FastHashMap

fn decrement_and_maybe_remove(&mut self, key: &usize) -> Option<(bool, usize)>

Entry-based decrement for single-lookup performance.

fn get(&self, key: &usize) -> Option<&Entry>

Get an entry by key.

fn get_mut(&mut self, key: &usize) -> Option<&mut Entry>

Get a mutable entry by key.

fn insert(&mut self, key: usize, entry: Entry) -> Option<Entry>

Insert an entry, returning the old value if present.

fn remove(&mut self, key: &usize) -> Option<Entry>

Remove an entry by key.

fn contains_key(&self, key: &usize) -> bool

Check if a key exists.

fn for_each_entry<F: FnMut(&Entry)>(&self, f: F)

Iterate over all entries.

fn clear(&mut self)

Clear all entries.

fn reserve(&mut self, additional: usize)

Reserve capacity for additional entries.

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: 64 bytes