Crate idmap [−] [src]
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; |
Modules
set | |
table |
The internal table types that can be used to power an |
Macros
idmap |
Creates an |
idset |
Creates an |
Structs
IdMap |
A map of mostly-contiguous |
Iter | |
IterMut | |
Keys | |
OccupiedEntry | |
RawDebug |
A wrapper to debug the underlying representation of an |
VacantEntry | |
Values | |
ValuesMut |
Enums
Entry |
Traits
IntegerId |
A type that can be uniquely identified by a 64 bit integer id |
Type Definitions
DirectIdMap |
An |
OrderedIdMap |
The default |