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
|
use parking_lot::RwLock;
use {yellow::{GreenNode, RedPtr}, TextUnit};
#[derive(Debug)]
pub(crate) struct RedNode {
green: GreenNode,
parent: Option<ParentData>,
children: RwLock<Box<[RedChild]>>,
}
#[derive(Debug)]
enum RedChild {
Zigot(TextUnit),
Child(RedNode)
}
impl RedChild {
fn set(&mut self, node: RedNode) -> &RedNode {
match self {
RedChild::Child(node) => return node,
RedChild::Zigot(_) => {
*self = RedChild::Child(node);
match self {
RedChild::Child(node) => return node,
RedChild::Zigot(_) => unreachable!()
}
}
}
}
}
#[derive(Debug)]
struct ParentData {
parent: RedPtr,
start_offset: TextUnit,
index_in_parent: usize,
}
impl RedNode {
pub fn new_root(green: GreenNode) -> RedNode {
RedNode::new(green, None)
}
fn new_child(
green: GreenNode,
parent: RedPtr,
start_offset: TextUnit,
index_in_parent: usize,
) -> RedNode {
let parent_data = ParentData {
parent,
start_offset,
index_in_parent,
};
RedNode::new(green, Some(parent_data))
}
fn new(green: GreenNode, parent: Option<ParentData>) -> RedNode {
let mut start_offset = parent.as_ref().map(|it| it.start_offset).unwrap_or(0.into());
let children = green.children()
.iter()
.map(|child| {
let off = start_offset;
start_offset += child.text_len();
RedChild::Zigot(off)
})
.collect::<Vec<_>>()
.into_boxed_slice();
RedNode {
green,
parent,
children: RwLock::new(children),
}
}
pub(crate) fn green(&self) -> &GreenNode {
&self.green
}
pub(crate) fn start_offset(&self) -> TextUnit {
match &self.parent {
None => 0.into(),
Some(p) => p.start_offset,
}
}
pub(crate) fn n_children(&self) -> usize {
self.green.children().len()
}
pub(crate) fn get_child(&self, idx: usize) -> Option<RedPtr> {
if idx >= self.n_children() {
return None;
}
let start_offset = match &self.children.read()[idx] {
RedChild::Child(child) => return Some(RedPtr::new(child)),
RedChild::Zigot(start_offset) => *start_offset,
};
let green_children = self.green.children();
let child =
RedNode::new_child(green_children[idx].clone(), RedPtr::new(self), start_offset, idx);
let mut children = self.children.write();
let child = children[idx].set(child);
Some(RedPtr::new(child))
}
pub(crate) fn parent(&self) -> Option<RedPtr> {
Some(self.parent.as_ref()?.parent)
}
pub(crate) fn index_in_parent(&self) -> Option<usize> {
Some(self.parent.as_ref()?.index_in_parent)
}
}
|
