Module lockfree::map[−][src]

A lock-free map.

Structs

Iter	An iterator over `Map`. As in the `Map`'s `get` method, we cannot return a reference to the elements. Therefore, the iterator has a reader which reads a temporary reference and returns the actual iterator `Item`.
Map	A lock-free map. Implemented using multi-level hash-tables (in a tree fashion) with ordered buckets.
RandomState	`RandomState` is the default state for `HashMap` types.
Removed	A removed entry. Although the entry allows the user to immutable access key and value, it does not allow moving them. This is because it cannot be dropped by the user. Imagine that a thread would remove and drop (by user defined code) the entry after another thread began would be reading, but, in the moment of the drop, still reading. This would cause use-after-free.

Insertion	The result of an interactive insertion.
Preview	A preview of the value in an interactive insertion.

A reader on map's iterator's temporary references.