bbtree 0.1.6

Fastest B-tree.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

//! An ordered map and set for one thread at a time: [`BBTreeMap`] and
//! [`BBTreeSet`], drop-in replacements for std's `BTreeMap` and `BTreeSet`
//! (D1). They use the same nodes as [`crate::BBTreeMap`], which threads
//! share. They take `&mut self` to change, lend references into their nodes,
//! and latch nothing.

pub(crate) mod map;
pub(crate) mod set;

pub use map::BBTreeMap;
pub use set::BBTreeSet;

/// An ordered map based on a B-tree, [`BBTreeMap`], and the types that go
/// with it: the counterpart of `std::collections::btree_map`.
pub mod bbtree_map {
    pub use super::map::{
        BBTreeMap, Entry, ExtractIf, IntoIter, IntoKeys, IntoValues, Iter, IterMut, Keys,
        OccupiedEntry, Range, RangeMut, VacantEntry, Values, ValuesMut,
    };
}

/// An ordered set based on a B-tree, [`BBTreeSet`], and the types that go
/// with it: the counterpart of `std::collections::btree_set`.
pub mod bbtree_set {
    pub use super::set::{
        BBTreeSet, Difference, ExtractIf, Intersection, IntoIter, Iter, Range, SymmetricDifference,
        Union,
    };
}