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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
use std::fmt;
use crate::{Node, iterator};
use std::rc::Rc;
use std::hash::Hash;
use std::fmt::Debug;

pub struct Tree<T> {
    /// The trees root node.
    root: Node<T>,
}

impl<T> Tree<T>
    where T: Eq + Hash {
    /// Create new tree.
    pub fn new(string: &str) -> Tree<T> {
        Tree {
            root: Node::new_root(string),
        }
    }

    /// Load a tree.
    pub fn load() -> Tree<T> {
        // TODO Implement loading a tree from syntax/format information and text
        unimplemented!()
    }

    /// Set syntax/format info for the passed range.
    /// The range is the passed start index (inclusive) to the passed end index (exclusive).
    pub fn set(&mut self, start_idx: usize, end_idx: usize, info: T) {
        self.root.set(start_idx, end_idx, Rc::new(info));
    }

    /// Unset the passed syntax/format info for the passed range.
    /// The range is the passed start index (inclusive) to the passed end index (exclusive).
    pub fn unset(&mut self, start_idx: usize, end_idx: usize, info: &T) {
        self.root.unset(start_idx, end_idx, info);
    }

    /// Insert a char in the underlying text.
    pub fn insert(&mut self, idx: usize, ch: char) {
        self.root.insert(idx, ch);
    }

    /// Insert a string in the underlying text.
    pub fn insert_str(&mut self, idx: usize, string: &str) {
        self.root.insert_str(idx, string);
    }

    /// Push a char to the underlying text.
    pub fn push(&mut self, ch: char) {
        self.root.push(ch);
    }

    /// Push a string to the underlying text.
    pub fn push_str(&mut self, string: &str) {
        self.root.push_str(string);
    }

    /// Get the length of the underlying text.
    pub fn length(&self) -> usize {
        self.root.length()
    }

    /// Remove a count of characters from the underlying text starting at idx.
    pub fn remove(&mut self, idx: usize, count: usize) {
        self.root.remove(idx, count);
    }

    /// Pop a char from the underlying text.
    pub fn pop(&mut self) {
        self.remove(self.length() - 1, 1);
    }

    /// Clear the underlying text.
    /// Specify whether you want the tree to keep the formats on the root node.
    pub fn clear(&mut self, keep_formats: bool) {
        let mut new_root = Node::new_root("");

        if keep_formats {
            for info in self.root.infos() {
                new_root.add_info(Rc::clone(info));
            }
        }

        self.root = new_root;
    }

    /// Get the root node.
    pub fn get_root(&self) -> &Node<T> {
        &self.root
    }

    /// Get a depth first pre order iterator.
    pub fn pre_order_iter(&self) -> iterator::PreOrder<T> {
        self.root.pre_order_iter()
    }

    /// Get a leaf iterator.
    pub fn leaf_iter(&self) -> impl Iterator<Item=iterator::Item<T>> {
        self.root.leaf_iter()
    }
}

impl<T> fmt::Debug for Tree<T>
    where T: Ord + Hash + Debug {
    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
        write!(f, "{:?}", self.root)
    }
}

#[cfg(test)]
mod tests {
    use crate::Tree;
    use std::cmp::Ordering;

    #[derive(Copy, Clone, Debug, PartialOrd, PartialEq, Eq, Hash)]
    pub enum Fmt {
        Bold = 1,
        Italic = 2,
        Underline = 3,
    }

    impl Ord for Fmt {
        fn cmp(&self, other: &Self) -> Ordering {
            let a = *self as u8;
            let b = *other as u8;

            a.cmp(&b)
        }
    }

    #[test]
    #[should_panic]
    fn format_test_leaf_split_invalid_input_3() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(2, 1, Fmt::Bold);
    }

    #[test]
    fn format_test_leaf_split_case_1() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(0, "Hallo Welt".len(), Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' [Bold]
");
    }

    #[test]
    fn format_test_leaf_split_case_2() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(0, 5, Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' []
    |-- 'Hallo' [Bold]
    |-- ' Welt' []
");
    }

    #[test]
    fn format_test_leaf_split_case_3() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(6, "Hallo Welt".len(), Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' []
    |-- 'Hallo ' []
    |-- 'Welt' [Bold]
");
    }

    #[test]
    fn format_test_leaf_split_case_4() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(2, 7, Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' []
    |-- 'Ha' []
    |-- 'llo W' [Bold]
    |-- 'elt' []
");
    }

    #[test]
    fn format_test_complex_1() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(6, "Hallo Welt".len(), Fmt::Bold);
        tree.set(4, 7, Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' []
    |-- 'Hall' []
    |-- 'o ' [Underline]
    |-- 'Welt' [Bold]
        |-- 'W' [Underline]
        |-- 'elt' []
");
    }

    #[test]
    fn format_test_complex_2() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(6, "Hallo Welt".len(), Fmt::Bold);
        tree.set(0, "Hallo Welt".len(), Fmt::Italic);
        tree.set(4, 7, Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo Welt' [Italic]
    |-- 'Hall' []
    |-- 'o ' [Underline]
    |-- 'Welt' [Bold]
        |-- 'W' [Underline]
        |-- 'elt' []
");
    }

    #[test]
    fn insert_str_test_complex() {
        let mut tree = Tree::new("Hallo Welt");
        tree.set(6, "Hallo Welt".len(), Fmt::Bold);
        tree.set(0, "Hallo Welt".len(), Fmt::Italic);
        tree.set(4, 7, Fmt::Underline);
        tree.insert_str(6, "du ");

        assert_eq!(format!("{:#?}", tree), "|-- 'Hallo du Welt' [Italic]
    |-- 'Hall' []
    |-- 'o du ' [Underline]
    |-- 'Welt' [Bold]
        |-- 'W' [Underline]
        |-- 'elt' []
");
    }

    #[test]
    fn format_test_complex_3() {
        let mut tree: Tree<i32> = Tree::new("Hello World");
        tree.set(6, "Hello World".len(), 3);
        tree.set(0, "Hello World".len(), 42);
        tree.set(0, "Hello World".len(), 8);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' [8, 42]
    |-- 'Hello ' []
    |-- 'World' [3]
");
    }

    #[test]
    fn format_test_cleanup_1() {
        let mut tree = Tree::new("Hello World");
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(0, "Hello World".len(), Fmt::Italic);
        tree.set(0, "Hello World".len(), Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' [Bold, Italic]
");
    }

    #[test]
    fn format_test_cleanup_2() {
        let mut tree = Tree::new("Hello World");
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(0, 6, Fmt::Underline);
        tree.set(0, "Hello World".len(), Fmt::Italic);
        tree.set(0, "Hello World".len(), Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' [Bold, Italic]
    |-- 'Hello ' [Underline]
    |-- 'World' []
");
    }

    #[test]
    fn format_test_cleanup_3() {
        let mut tree = Tree::new("Hello World");
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(0, 6, Fmt::Underline);
        tree.set(0, "Hello World".len(), Fmt::Italic);
        tree.set(0, "Hello World".len(), Fmt::Bold);
        tree.set(0, "Hello World".len(), Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' [Bold, Italic, Underline]
");
    }

    #[test]
    fn unset_test_1() {
        let mut tree = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.unset(6, 7, &Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' []
");
    }

    #[test]
    fn group_neighbor_test_1() {
        let mut tree = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(4, 7, Fmt::Bold);
        tree.set(0, 4, Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' []
    |-- 'Hello W' [Underline]
        |-- 'Hell' []
        |-- 'o W' [Bold]
    |-- 'orld' []
");
    }

    #[test]
    fn group_neighbor_test_2() {
        let mut tree = Tree::new("Hello World");
        tree.set(0, 1, Fmt::Bold);
        tree.set(0, 1, Fmt::Italic);
        tree.set(0, 1, Fmt::Underline);
        tree.set(1, 2, Fmt::Bold);
        tree.set(1, 2, Fmt::Italic);
        tree.set(2, 3, Fmt::Bold);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' []
    |-- 'Hel' [Bold]
        |-- 'He' [Italic]
            |-- 'H' [Underline]
            |-- 'e' []
        |-- 'l' []
    |-- 'lo World' []
");
    }

    #[test]
    fn clear_test() {
        let mut tree = Tree::new("Hello World");
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(0, 6, Fmt::Underline);
        tree.set(0, "Hello World".len(), Fmt::Italic);
        tree.set(0, "Hello World".len(), Fmt::Bold);
        tree.set(0, "Hello World".len(), Fmt::Underline);

        tree.clear(true);

        assert_eq!(format!("{:#?}", tree), "|-- '' [Bold, Italic, Underline]
");

        tree.push_str("Hello World");
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(0, 6, Fmt::Underline);
        tree.set(0, "Hello World".len(), Fmt::Italic);
        tree.set(0, "Hello World".len(), Fmt::Bold);
        tree.set(0, "Hello World".len(), Fmt::Underline);

        tree.clear(false);

        assert_eq!(format!("{:#?}", tree), "|-- '' []
");
    }

    #[test]
    fn remove_test_1() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.pop();
        tree.remove(3, 4);

        assert_eq!(format!("{:#?}", tree), "|-- 'Helorl' []
");
    }

    #[test]
    fn remove_test_2() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(4, "Hello World".len(), Fmt::Bold);
        tree.set(0, 4, Fmt::Underline);
        tree.pop();
        tree.remove(3, tree.length() - 3);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hel' [Underline]
")
    }

    #[test]
    fn remove_test_3() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(4, "Hello World".len(), Fmt::Bold);
        tree.set(0, 4, Fmt::Underline);
        tree.pop();
        tree.remove(3, 5);

        assert_eq!(format!("{:#?}", tree), "|-- 'Helrl' []
    |-- 'Hel' [Underline]
    |-- 'rl' [Bold]
")
    }

    #[test]
    fn remove_test_regroup_1() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(4, "Hello World".len(), Fmt::Bold);
        tree.set(0, 4, Fmt::Underline);
        tree.remove(7, "Hello World".len());

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello W' []
    |-- 'Hello W' [Underline]
        |-- 'Hell' []
        |-- 'o W' [Bold]
")
    }

    #[test]
    fn remove_test_regroup_2() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(6, 9, Fmt::Underline);
        tree.remove(4, 2);

        assert_eq!(format!("{:#?}", tree), "|-- 'HellWorld' []
    |-- 'Hell' []
    |-- 'World' [Bold]
        |-- 'Wor' [Underline]
        |-- 'ld' []
")
    }

    #[test]
    fn set_test_info_already_set_on_node() {
        let mut tree: Tree<Fmt> = Tree::new("Hello World");
        tree.set(4, 7, Fmt::Underline);
        tree.set(6, "Hello World".len(), Fmt::Bold);
        tree.set(6, 9, Fmt::Underline);

        assert_eq!(format!("{:#?}", tree), "|-- 'Hello World' []
    |-- 'Hell' []
    |-- 'o W' [Underline]
        |-- 'o ' []
        |-- 'W' [Bold]
    |-- 'orld' [Bold]
        |-- 'or' [Underline]
        |-- 'ld' []
")
    }
}