BzTree(concurrent B-tree) implementation for Rust based on paper
BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory.
Current implementation doesn't support non-volatile memory and supposed to be used only as in-memory(not persistent) data structure.
BzTree uses MwCAS crate to get access to multi-word CAS.
use BzTree; let tree = new; let guard = pin; let key1 = "key_1".to_string; assert!; assert!; tree.upsert; assert!; let key2 = "key_2".to_string; tree.insert; assert!; assert!; assert!; assert!;