content-tree 0.2.0

An efficient data structure for compacted RLE data
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

use content_tree::ContentTree;
use std::ops::Range;
use rle::{HasLength, MergableSpan, SplitableSpanHelpers};

#[derive(Debug, Clone, Copy, Default)]
struct RleRange {
    // We can't embed a Range because it doesn't implement Copy. And Copy is needed for ContentTree.
    start: usize,
    end: usize,
}

impl From<Range<usize>> for RleRange {
    fn from(range: Range<usize>) -> Self {
        RleRange { start: range.start, end: range.end }
    }
}

impl HasLength for RleRange {
    fn len(&self) -> usize { self.end - self.start }
}

impl SplitableSpanHelpers for RleRange {
    fn truncate_h(&mut self, at: usize) -> Self {
        let old_end = self.end;

        // Truncate self
        self.end = self.start + at;

        // And return
        RleRange { start: self.end, end: old_end }
    }
}

impl MergableSpan for RleRange {
    fn can_append(&self, other: &Self) -> bool {
        self.end == other.start
    }

    fn append(&mut self, other: Self) {
        self.end = other.end;
    }
}

fn main() {
    let mut list = ContentTree::new();
    list.push((0..15).into());
    list.push((15..20).into());
    // Both items are merged!
    println!("List contains {:?}", list.iter().collect::<Vec<RleRange>>());
    // List contains [RleRange { start: 0, end: 20 }]

    list.insert_at_offset(5, (100..101).into());
    println!("List contains {:#?}", list.iter().collect::<Vec<RleRange>>());
    // List contains [
    //     RleRange { start: 0, end: 5, },
    //     RleRange { start: 100, end: 101, },
    //     RleRange { start: 5, end: 20, },
    // ]
}