bevy_platform::collections

Module hash_map

Source
Expand description

Provides HashMap based on hashbrown’s implementation. Unlike hashbrown::HashMap, HashMap defaults to FixedHasher instead of RandomState. This provides determinism by default with an acceptable compromise to denial of service resistance in the context of a game engine.

Structs§

  • A Hasher instance implementing foldhash, optimized for speed.
  • A draining iterator over the entries of a HashMap in arbitrary order. The iterator element type is (K, V).
  • A draining iterator over entries of a HashMap which don’t satisfy the predicate f(&k, &mut v) in arbitrary order. The iterator element type is (K, V).
  • New-type for HashMap with FixedHasher as the default hashing provider. Can be trivially converted to and from a hashbrown HashMap using From.
  • An owning iterator over the entries of a HashMap in arbitrary order. The iterator element type is (K, V).
  • An owning iterator over the keys of a HashMap in arbitrary order. The iterator element type is K.
  • An owning iterator over the values of a HashMap in arbitrary order. The iterator element type is V.
  • An iterator over the entries of a HashMap in arbitrary order. The iterator element type is (&'a K, &'a V).
  • A mutable iterator over the entries of a HashMap in arbitrary order. The iterator element type is (&'a K, &'a mut V).
  • An iterator over the keys of a HashMap in arbitrary order. The iterator element type is &'a K.
  • A view into an occupied entry in a HashMap. It is part of the Entry and EntryRef enums.
  • The error returned by try_insert when the key already exists.
  • A BuildHasher for fast::FoldHasher that is randomly initialized.
  • A builder for computing where in a HashMap a key-value pair would be stored.
  • A builder for computing where in a HashMap a key-value pair would be stored.
  • A view into an occupied entry in a HashMap. It is part of the RawEntryMut enum.
  • A view into a vacant entry in a HashMap. It is part of the Entry enum.
  • An iterator over the values of a HashMap in arbitrary order. The iterator element type is &'a V.
  • A mutable iterator over the values of a HashMap in arbitrary order. The iterator element type is &'a mut V.

Enums§

  • A view into a single entry in a map, which may either be vacant or occupied, with any borrowed form of the map’s key type.
  • A view into a single entry in a map, which may either be vacant or occupied.

Type Aliases§