piece-tree 0.1.5

Purely functional (immutable) implementation of Piece Tree, inspired by fredbuf
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184

use criterion::{criterion_group, criterion_main, Criterion};
use piece_tree::PieceTree;

const TEXT: &str = include_str!("large.txt");

//----

fn insert_char(c: &mut Criterion) {
    let mut group = c.benchmark_group("insert_char");

    group.bench_function("random", |bench| {
        let mut rng = fastrand::Rng::new();
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars() as u32;
            tree.insert_char_no_commit(rng.u32(0..len), 'a')
        })
    });

    group.bench_function("start", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            tree.insert_char_no_commit(0, 'a');
        })
    });

    group.bench_function("middle", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_char_no_commit(len / 2, 'a');
        })
    });

    group.bench_function("end", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_char_no_commit(len, 'a');
        })
    });
}

fn insert_small(c: &mut Criterion) {
    let mut group = c.benchmark_group("insert_small");

    group.bench_function("random", |bench| {
        let mut rng = fastrand::Rng::new();
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(rng.u32(0..len), "a");
        })
    });

    group.bench_function("start", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            tree.insert_no_commit(0, "a");
        })
    });

    group.bench_function("middle", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len / 2, "a");
        })
    });

    group.bench_function("end", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len, "a");
        })
    });
}

fn insert_medium(c: &mut Criterion) {
    let mut group = c.benchmark_group("insert_medium");

    group.bench_function("random", |bench| {
        let mut rng = fastrand::Rng::new();
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(rng.u32(0..len), "This is some text.");
        })
    });

    group.bench_function("start", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            tree.insert_no_commit(0, "This is some text.");
        })
    });

    group.bench_function("middle", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len / 2, "This is some text.");
        })
    });

    group.bench_function("end", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len, "This is some text.");
        })
    });
}

const INSERT_TEXT: &str = include_str!("small.txt");

fn insert_large(c: &mut Criterion) {
    let mut group = c.benchmark_group("insert_large");

    group.bench_function("random", |bench| {
        let mut rng = fastrand::Rng::new();
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(rng.u32(0..len), INSERT_TEXT);
        })
    });

    group.bench_function("start", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            tree.insert_no_commit(0, INSERT_TEXT);
        })
    });

    group.bench_function("middle", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len / 2, INSERT_TEXT);
        })
    });

    group.bench_function("end", |bench| {
        let mut tree = PieceTree::from(TEXT);
        bench.iter(|| {
            let len = tree.len_chars();
            tree.insert_no_commit(len, INSERT_TEXT);
        })
    });
}

//----

fn insert_after_clone(c: &mut Criterion) {
    c.bench_function("insert_after_clone", |bench| {
        let mut rng = fastrand::Rng::new();
        let tree = PieceTree::from(TEXT);
        let mut tree_clone = tree.clone();
        let mut i = 0;
        bench.iter(|| {
            if i > 32 {
                i = 0;
                tree_clone = tree.clone();
            }
            let len = tree_clone.len_chars();
            tree_clone.insert(rng.u32(0..len), "a");
            i += 1;
        })
    });
}

//----

criterion_group!(
    benches,
    insert_char,
    insert_small,
    insert_medium,
    insert_large,
    insert_after_clone
);
criterion_main!(benches);