syntax_tree/
tree.rs

1use std::fmt;
2use crate::{Node, iterator, change};
3use std::rc::Rc;
4use std::hash::Hash;
5use std::fmt::Debug;
6
7/// The syntax tree struct.
8pub struct Tree<T> {
9    /// The trees root node.
10    root: Node<T>,
11}
12
13impl<T> Tree<T>
14    where T: Eq + Hash {
15    /// Create new tree.
16    pub fn new(string: &str, listener: Option<change::Listener<T>>) -> Tree<T> {
17        let mut root = Node::new_root(string);
18        if let Some(l) = listener {
19            root.give_listener(&Some(Rc::new(l)));
20        }
21
22        Tree {
23            root,
24        }
25    }
26
27    /// Set syntax/format info for the passed range.
28    /// The range is the passed start index (inclusive) to the passed end index (exclusive).
29    pub fn set(&mut self, start_idx: usize, end_idx: usize, info: T) {
30        self.root.set(start_idx, end_idx, Rc::new(info));
31    }
32
33    /// Unset the passed syntax/format info for the passed range.
34    /// The range is the passed start index (inclusive) to the passed end index (exclusive).
35    pub fn unset(&mut self, start_idx: usize, end_idx: usize, info: T) {
36        self.root.unset(start_idx, end_idx, Rc::new(info));
37    }
38
39    /// Insert a char in the underlying text.
40    pub fn insert(&mut self, idx: usize, ch: char) {
41        self.root.insert(idx, ch);
42    }
43
44    /// Insert a string in the underlying text.
45    pub fn insert_str(&mut self, idx: usize, string: &str) {
46        self.root.insert_str(idx, string);
47    }
48
49    /// Push a char to the underlying text.
50    pub fn push(&mut self, ch: char) {
51        self.root.push(ch);
52    }
53
54    /// Push a string to the underlying text.
55    pub fn push_str(&mut self, string: &str) {
56        self.root.push_str(string);
57    }
58
59    /// Get the length of the underlying text.
60    pub fn length(&self) -> usize {
61        self.root.length()
62    }
63
64    /// Remove a count of characters from the underlying text starting at idx.
65    pub fn remove(&mut self, idx: usize, count: usize) {
66        self.root.remove(idx, count);
67    }
68
69    /// Pop a char from the underlying text.
70    pub fn pop(&mut self) {
71        self.remove(self.length() - 1, 1);
72    }
73
74    /// Clear the underlying text.
75    /// Specify whether you want the tree to keep the formats on the root node.
76    pub fn clear(&mut self, keep_formats: bool) {
77        self.root.remove(0, self.length());
78
79        if !keep_formats {
80            self.root.clear_infos();
81        }
82    }
83
84    /// Get the root node.
85    pub fn get_root(&self) -> &Node<T> {
86        &self.root
87    }
88
89    /// Get a depth first pre order iterator.
90    pub fn pre_order_iter(&self) -> iterator::PreOrder<T> {
91        self.root.pre_order_iter()
92    }
93
94    /// Get a leaf iterator.
95    pub fn leaf_iter(&self) -> impl Iterator<Item=iterator::Item<T>> {
96        self.root.leaf_iter()
97    }
98}
99
100impl<T> fmt::Debug for Tree<T>
101    where T: Ord + Hash + Debug {
102    fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
103        write!(f, "{:?}", self.root)
104    }
105}
syntax_tree/tree.rs

syntax_tree/
tree.rs
