Expand description
A lock-free map.
Structs
An iterator over key-vaue entries of a
Map. The Item of
this iterator is a ReadGuard. This iterator may be inconsistent, but
still it is memory-safe. It is guaranteed to yield items that have been in
the Map since the iterator creation and the current call to
next. However, it is not guaranteed to yield all items
present in the Map at some point if the Map is shared between threads.An owned iterator over references to key-vaue entries of a
Map. The reference to the value is mutable (but not the one
to the key).A lock-free map. Implemented using multi-level hash-tables (in a tree
fashion) with ordered buckets.
RandomState is the default state for HashMap types.A read-operation guard. This ensures no entry allocation is
mutated or freed while potential reads are performed.
The shared incinerator used by
Map. You may want to use this type in order to reduce memory consumption of the minimal space required by the incinerator. However, garbage items may be hold for longer time than they would if no shared incinerator were used.Enums
A
insert_with operation result.The preview of an interactive insertion. It is used by the
insert_with method and it is the return value
of the closure passed to the method.