Crate range_tree_rs 

This crate provides a range-tree implementation, automatically merge and split range section.

The usage scenario for persistent slab allocators (Similar to the range-tree in ZFS), while the underlayer is not avl, but b+tree, which has more friendly for CPU cache and smaller in memory usage.

Structs

Compact

Compact metadata for BTreeMap.

IntoIter

An consuming iterator for RangeTree

Iter

An iterator without bound, acquire from RangeTree::iter()

RangeIter

An iterator for RangeTree with bound, acquire from RangeTree::range()

RangeTree

A b+tree stores range segment of [start, start+size)

TreeInfo

Compact heap-allocated metadata for BTreeMap.

Traits

RangeTreeKey

RangeTreeOps

Trait for allocator

Type Aliases

RangeTreeCompact

RangeTreeLarge