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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::Loc;
use crate::Node;
#[derive(Debug, Clone, PartialEq)]
#[repr(C)]
pub struct Return {
pub args: Vec<Node>,
pub keyword_l: Loc,
pub expression_l: Loc,
}
impl Return {
pub fn get_args(&self) -> &Vec<Node> {
&self.args
}
pub fn get_keyword_l(&self) -> &Loc {
&self.keyword_l
}
pub fn get_expression_l(&self) -> &Loc {
&self.expression_l
}
pub fn set_args(&mut self, args: Vec<Node>) {
self.args = args;
}
pub fn set_keyword_l(&mut self, keyword_l: Loc) {
self.keyword_l = keyword_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::InternalReturn {
let Self { args, keyword_l, expression_l, } = self;
super::InternalReturn { args, keyword_l, expression_l, }
}
}
impl InnerNode for Return {
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_args());
result.strings()
}
fn str_type(&self) -> &'static str {
"return"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
for node in self.get_args().iter() { node.inner_ref().print_with_locs(); }
self.get_keyword_l().print("keyword");
self.get_expression_l().print("expression");
}
}