Expand description
Efficient maps of integer id keys to values, backed by an underlying Vec.
However, unless a CompactIdMap is used, space requirements are O(n) the largest key.
Any type that implements IntegerId can be used for the key,
but no storage is wasted if the key can be represented from the id.
Re-exports§
pub use set::IdSet;pub use self::direct::DirectIdMap;pub use self::ordered::OrderedIdMap;
Modules§
- direct
- Type aliases for DirectIdMap
- ordered
- Type aliases for OrderedIdMap
- set
- Implements an
IdSetusing a bitset - table
- The internal table types that can be used to power an
IdMap.
Macros§
- direct_
idmap - Creates an
DirectIdMapfrom a list of key-value pairs - idmap
- Creates an
IdMapfrom a list of key-value pairs - idset
- Creates an
IdSetfrom a list of elements
Structs§
- IdMap
- A map of mostly-contiguous
IntegerIdkeys to values, backed by aVec. - Iter
- An iterator over the entries in a map
- IterMut
- An iterator over the entries in a map, giving mutable references to the values
- Keys
- An iterator over the keys in a map
- Occupied
Entry - An entry in an IdMap where the value is present
- RawDebug
- A wrapper to debug the underlying representation of an
IdMap - Vacant
Entry - An entry in an IdMap where the value is not present
- Values
- An iterator over the values in a map
- Values
Mut - An iterator over mutable references to the values in a map
Enums§
Traits§
- Integer
Id - A type that can be uniquely identified by a 64 bit integer id