Module slotmap::hop

source ·
Expand description

Contains the faster iteration, slower insertion/removal slot map implementation.

This data structure is essentially the same as a regular SlotMap, but 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.

Structs§