Module std::collections::hash_mapExperimental
[-]
[+]
[src]
A hashmap
Reexports
pub use self::Entry::*; |
Structs
| Entries | HashMap iterator |
| HashMap | A hash map implementation which uses linear probing with Robin Hood bucket stealing. |
| MoveEntries | HashMap move iterator |
| MutEntries | HashMap mutable values iterator |
| OccupiedEntry | A view into a single occupied location in a HashMap |
| VacantEntry | A view into a single empty location in a HashMap |
Enums
| Entry | A view into a single location in a map, which may be vacant or occupied |
Constants
pub const INITIAL_CAPACITY: uint = 1 << INITIAL_LOG2_CAP |
Type Definitions
| Keys | HashMap keys iterator |
| Values | HashMap values iterator |