Type Alias bevy_utils::PreHashMap

pub type PreHashMap<K, V> = HashMap<Hashed<K>, V, PassHash>;

A HashMap pre-configured to use Hashed keys and PassHash passthrough hashing. Iteration order only depends on the order of insertions and deletions.

Aliased Type

struct PreHashMap<K, V> { /* private fields */ }

Trait Implementations

impl<K: Hash + Eq + PartialEq + Clone, V> PreHashMapExt<K, V> for PreHashMap<K, V>

fn get_or_insert_with<F: FnOnce() -> V>( &mut self, key: &Hashed<K>, func: F, ) -> &mut V

Tries to get or insert the value for the given key using the pre-computed hash first. If the PreHashMap does not already contain the key, it will clone it and insert the value returned by func.