Expand description
This is the core implementation that doesn’t depend on the hasher at all.
The methods of IndexMapCore
don’t use any Hash properties of K.
It’s cleaner to separate them out, then the compiler checks that we are not using Hash at all in these methods.
However, we should probably not let this show in the public API or docs.
Re-exports§
pub use entry::Entry;
pub use entry::IndexedEntry;
pub use entry::OccupiedEntry;
pub use entry::VacantEntry;
Modules§
- entry 🔒
- extract 🔒
- raw_
entry_ v1 - Opt-in access to the experimental raw entry API.
Structs§
- Index
MapCore 🔒 - Core of the map that does not depend on S
- RefMut 🔒
- Mutable references to the parts of an
IndexMapCore
.
Functions§
- equivalent 🔒
- erase_
index 🔒 - get_
hash 🔒 - insert_
bulk_ 🔒no_ grow - Inserts many entries into the indices table without reallocating, and without regard for duplication.
- reserve_
entries 🔒 - Reserve entries capacity, rounded up to match the indices (via
try_capacity
). - update_
index 🔒