Module leapmap 

This module provides the LeapMap struct, which is a very fast implementation of a concurrent hash map.

Structs

AtomicCell

Struct which stores a cell in a concurrent hash map. A cell is simply a hash (rather than the key iteself) and the value associated with the key for which the hash is associated.

LeapMap

A concurrent hash map implementation which uses a modified form of RobinHood/ Hopscotch probing. This implementation is lock-free, and therefore it will not deadlock when any of the map operations are performed concurrently. The map is lock-free if the key and value types have built-in atomic support, and if not, an efficient spin-lock is used.