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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::Loc;
use crate::Node;
use crate::containers::List;
use crate::containers::LocPtr;
use crate::containers::MaybeLocPtr;
use crate::containers::maybe_loc_ptr::AsLocOption;
/// Represents an explicit `begin; end` block.
///
/// The reason why it's different is that only
/// ```text
/// begin; foo; end while cond
/// ```
/// is a post-while loop (same with post-until loop)
///
#[derive(Debug, Clone, PartialEq)]
#[repr(C)]
pub struct KwBegin {
/// A list of statements
///
pub statements: List<Node>,
/// Location of the `begin` keyword
///
/// ```text
/// begin; foo; end
/// ~~~~~
/// ```
///
pub begin_l: MaybeLocPtr,
/// Location of the `begin` keyword
///
/// ```text
/// begin; foo; end
/// ~~~
/// ```
///
pub end_l: MaybeLocPtr,
/// Location of the full expression
///
/// ```text
/// begin; foo; bar
/// ~~~~~~~~~~~~~~~
/// ```
///
pub expression_l: LocPtr,
}
impl InnerNode for KwBegin {
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.statements);
result.strings()
}
fn str_type(&self) -> &'static str {
"kwbegin"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
for node in self.statements.iter() {
node.inner_ref().print_with_locs();
}
self.begin_l.as_option().map(|loc| loc.print("begin"));
self.end_l.as_option().map(|loc| loc.print("end"));
self.expression_l.print("expression");
}
}