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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::source::Range;
use crate::Node;
#[derive(Debug, Clone, PartialEq)]
pub struct CaseMatch {
pub expr: Box<Node>,
pub in_bodies: Vec<Node>,
pub else_body: Option<Box<Node>>,
pub keyword_l: Range,
pub else_l: Option<Range>,
pub end_l: Range,
pub expression_l: Range,
}
impl InnerNode for CaseMatch {
fn expression(&self) -> &Range {
&self.expression_l
}
fn inspected_children(&self, indent: usize) -> Vec<String> {
let mut result = InspectVec::new(indent);
result.push_node(&self.expr);
result.push_nodes(&self.in_bodies);
result.push_maybe_node_or_nil(&self.else_body);
result.strings()
}
fn str_type(&self) -> &'static str {
"case_match"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
self.expression_l.print("expression");
self.end_l.print("end");
if let Some(range) = &self.else_l {
range.print("else");
}
self.keyword_l.print("keyword");
if let Some(node) = &self.else_body {
node.inner().print_with_locs();
}
for node in self.in_bodies.iter() {
node.inner().print_with_locs();
}
self.expr.inner().print_with_locs();
}
}