treers 0.1.2

Simple implementation of Sedgewick's tree maps
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

use treers::btree::BalancedTree;
use treers::SedgewickMap;

fn main() {
    let mut btree = BalancedTree::new();
    btree.put(4, 5);
    btree.put(2, 1);
    btree.put(3, 3);
    btree.put(1, 4);
    println!("min(1) = {}", btree.min().unwrap());
    println!("min(4) = {}", btree.max().unwrap());
    println!("btree[{}] = {}", 1, btree.get(&1).unwrap());
    dbg!(btree);
}