Contains the faster iteration, slower insertion/removal slot map implementation.
This data structure is essentially the same as a regular
maintains extra information when inserting/removing elements that allows it
to ‘hop over’ vacant slots during iteration, making it potentially much
faster for iteration.
The trade-off is that compared to a regular
SlotMap insertion/removal is
roughly twice as slow. Random indexing has identical performance for both.
A draining iterator for
Hop slot map, storage with stable unique keys.
An iterator that moves key-value pairs out of a
An iterator over the key-value pairs in a
A mutable iterator over the key-value pairs in a
An iterator over the keys in a
An iterator over the values in a
A mutable iterator over the values in a