Expand description
Concurrent and asynchronous containers.
HashMap
: concurrent and asynchronous hash map.HashSet
: concurrent and asynchronous hash set.HashIndex
: read-optimized concurrent and asynchronous hash map.HashCache
: concurrent and asynchronous sampling-based LRU cache backed byHashMap
.TreeIndex
: read-optimized concurrent and asynchronous B-plus tree.
Utilities for concurrent programming.
ebr
: lock-free epoch-based reclamation.LinkedList
: lock-free concurrent linked list type trait.Bag
: lock-free concurrent unordered instance container.Queue
: lock-free concurrent first-in-first-out container.Stack
: lock-free concurrent last-in-first-out container.
Re-exports
pub use hash_map::HashMap;
pub use hash_set::HashSet;
pub use hash_index::HashIndex;
pub use hash_cache::HashCache;
pub use tree_index::TreeIndex;
Modules
- Epoch-based reclamation.
HashIndex
is a read-optimized concurrent and asynchronous hash map.HashMap
is a concurrent and asynchronous hash map.HashSet
is a concurrent and asynchronous hash set.TreeIndex
is a read-optimized concurrent and asynchronous B-plus tree.
Structs
Bag
is a lock-free concurrent unordered instance container.Entry
stores an instance ofT
and a link to the next entry.Queue
is a lock-free concurrent first-in-first-out container.Stack
is a lock-free concurrent last-in-first-out container.
Traits
LinkedList
is a type trait implementing a lock-free singly linked list.