102 releases
0.1.106 | May 17, 2024 |
---|---|
0.1.105 | May 17, 2024 |
0.1.91 | Apr 29, 2024 |
0.1.39 | Mar 31, 2024 |
#979 in Data structures
48 downloads per month
180KB
5K
SLoC
Crate has moved to
lib.rs
:
This crate implements a BTreeMap
similar to std::collections::BTreeMap
.
The standard BtreeMap can use up to twice as much memory as required, this BTreeMap only allocates what is needed ( or a little more to avoid allocating too often ), so memory use can be up to 50% less.
Example
use btree_experiment::BTreeMap;
let mut mymap = BTreeMap::new();
mymap.insert("England", "London");
mymap.insert("France", "Paris");
println!("The capital of France is {}", mymap["France"]);
Features
This crate supports the following cargo features:
serde
: enables serialisation ofBTreeMap
via serde crate.unsafe-optim
: uses unsafe code for extra optimisation.
Dependencies
~235KB