content-tree 0.2.0

An efficient data structure for compacted RLE data
Documentation 
1
2
3
4
5
6
7
8
9
10

use content_tree::ContentTree;
use rle::RleRun;

fn main() {
    let mut list = ContentTree::new();
    list.push(RleRun { val: false, len: 10 });

    list.insert_at_offset(5, RleRun { val: true, len: 2 });
    println!("List contains {:?}", list.iter().collect::<Vec<RleRun<bool>>>());
}