1.0.0[−][src]Module nom::lib::std::collections::hash_map
A hash map implemented with linear probing and Robin Hood bucket stealing.
Structs
DefaultHasher | The default |
Drain | A draining iterator over the entries of a |
HashMap | A hash map implemented with quadratic probing and SIMD lookup. |
IntoIter | An owning iterator over the entries of a |
Iter | An iterator over the entries of a |
IterMut | A mutable iterator over the entries of a |
Keys | An iterator over the keys of a |
OccupiedEntry | A view into an occupied entry in a |
RandomState |
|
VacantEntry | A view into a vacant entry in a |
Values | An iterator over the values of a |
ValuesMut | A mutable iterator over the values of a |
RawEntryBuilder | Experimental A builder for computing where in a HashMap a key-value pair would be stored. |
RawEntryBuilderMut | Experimental A builder for computing where in a HashMap a key-value pair would be stored. |
RawOccupiedEntryMut | Experimental A view into an occupied entry in a |
RawVacantEntryMut | Experimental A view into a vacant entry in a |
Enums
Entry | A view into a single entry in a map, which may either be vacant or occupied. |
RawEntryMut | Experimental A view into a single entry in a map, which may either be vacant or occupied. |