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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::source::Range;
use crate::Node;
/// Represents `until` loop
#[derive(Debug, Clone, PartialEq)]
pub struct Until {
/// Condition of the loop
pub cond: Node,
/// Body of the loop.
///
/// `None` if body is empty
pub body: Option<Node>,
/// Location of the `until` keyword
///
/// ```text
/// until cond do; foo; end
/// ~~~~~
/// ```
pub keyword_l: Range,
/// Location of the `do` keyword
///
/// ```text
/// until cond do; foo; end
/// ~~
/// ```
///
/// `do` is optional, and so `begin_l` can be `None`
pub begin_l: Option<Range>,
/// Location of the `end` keyword
///
/// ```text
/// until cond do; foo; end
/// ~~~
/// ```
///
/// `None` if loop is a modifier (i.e. `foo until bar`)
pub end_l: Option<Range>,
/// Location of the full expression
///
/// ```text
/// until cond do; foo; end
/// ~~~~~~~~~~~~~~~~~~~~~~~
///
/// foo until bar
/// ~~~~~~~~~~~~~
/// ```
pub expression_l: Range,
}
impl InnerNode for Until {
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.cond);
result.push_maybe_node_or_nil(&self.body);
result.strings()
}
fn str_type(&self) -> &'static str {
"until"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
self.expression_l.print("expression");
if let Some(range) = &self.end_l {
range.print("end");
}
if let Some(range) = &self.begin_l {
range.print("begin");
}
self.keyword_l.print("keyword");
if let Some(node) = &self.body {
node.inner_ref().print_with_locs();
}
self.cond.inner_ref().print_with_locs();
}
}