Lib.rs

这是一个对缓存友好的红黑树实现，它分配了一个单个的节点向量。

示例

use rbtree_arena::RedBlackTree;

let mut tree = RedBlackTree::with_capacity(4);
tree.set(100, "very")?;
tree.set(50, "Trees")?;
tree.set(75, "are")?;
tree.set(150, "cool!")?;

for (k, v) in tree {
    println!("{}: {}", k, v);
}

输出

50: Trees
75: are
100: very
150: cool!