bittree 0.1.0

A crate for O(1) find functions in a special data structure called a bit tree.
Documentation 
1
2
3
4
5
6
7
8

fn main() {
    let mut btree = bittree::BitTree::new();
    btree.add(&1usize, Some(0usize));
    assert_eq!(btree.find(&0usize), Some(1usize));
    
    btree.remove(&1usize);
    assert_eq!(btree.find(&0usize), None);
}