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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::Loc;
use crate::Node;
#[derive(Debug, Clone, PartialEq)]
#[repr(C)]
pub struct Dstr {
pub parts: Vec<Node>,
pub begin_l: Option<Loc>,
pub end_l: Option<Loc>,
pub expression_l: Loc,
}
impl Dstr {
pub fn get_parts(&self) -> &Vec<Node> {
&self.parts
}
pub fn get_begin_l(&self) -> &Option<Loc> {
&self.begin_l
}
pub fn get_end_l(&self) -> &Option<Loc> {
&self.end_l
}
pub fn get_expression_l(&self) -> &Loc {
&self.expression_l
}
pub fn set_parts(&mut self, parts: Vec<Node>) {
self.parts = parts;
}
pub fn set_begin_l(&mut self, begin_l: Option<Loc>) {
self.begin_l = begin_l;
}
pub fn set_end_l(&mut self, end_l: Option<Loc>) {
self.end_l = end_l;
}
pub fn set_expression_l(&mut self, expression_l: Loc) {
self.expression_l = expression_l;
}
#[allow(dead_code)]
pub(crate) fn into_internal(self) -> super::InternalDstr {
let Self { parts, begin_l, end_l, expression_l, } = self;
super::InternalDstr { parts, begin_l, end_l, expression_l, }
}
}
impl InnerNode for Dstr {
fn expression(&self) -> &Loc {
&self.expression_l
}
fn inspected_children(&self, indent: usize) -> Vec<String> {
let mut result = InspectVec::new(indent);
result.push_nodes(self.get_parts());
result.strings()
}
fn str_type(&self) -> &'static str {
"dstr"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
for node in self.get_parts().iter() { node.inner_ref().print_with_locs(); }
if let Some(loc) = self.get_begin_l().as_ref() { loc.print("begin") }
if let Some(loc) = self.get_end_l().as_ref() { loc.print("end") }
self.get_expression_l().print("expression");
}
}