Module hop

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

• Drain
  A draining iterator for HopSlotMap.
• HopSlotMap
  Hop slot map, storage with stable unique keys.
• IntoIter
  An iterator that moves key-value pairs out of a HopSlotMap.
• Iter
  An iterator over the key-value pairs in a HopSlotMap.
• IterMut
  A mutable iterator over the key-value pairs in a HopSlotMap.
• Keys
  An iterator over the keys in a HopSlotMap.
• Values
  An iterator over the values in a HopSlotMap.
• ValuesMut
  A mutable iterator over the values in a HopSlotMap.