Expand description
Concurrent and asynchronous containers.
HashMap: concurrent and asynchronous hash map.HashSet: concurrent and asynchronous hash set.HashIndex: concurrent and asynchronous hash map optimized for read.TreeIndex: concurrent and asynchronous B+ tree optimized for read.
Utilities for concurrent programming.
ebr: epoch-based reclamation.LinkedList: lock-free concurrent linked list type trait.Bag: lock-free concurrent unordered instance container.Queue: lock-free concurrent container.Stack: lock-free concurrent container.
Re-exports
pub use hash_map::HashMap;pub use hash_index::HashIndex;pub use hash_set::HashSet;pub use tree_index::TreeIndex;
Modules
- Epoch-based reclamation.
HashIndexis a read-optimized concurrent and asynchronous hash map.HashMapis a concurrent and asynchronous hash map.HashSetis a concurrent and asynchronous hash set.TreeIndexis a read-optimized concurrent and asynchronous B+ tree.
Structs
Bagis a lock-free concurrent unordered instance container.Queueis a lock-free concurrent first-in-first-out container.Stackis a lock-free concurrent last-in-first-out container.
Traits
LinkedListis a type trait implementing a lock-free singly linked list.