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
use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::source::Range;
use crate::Node;
/// Represents `foo && bar` (or `foo and bar`) statement.
#[derive(Debug, Clone, PartialEq)]
pub struct And {
/// Left hand statament of the `&&` operation.
///
/// `Lvar("foo")` node for `foo && bar`
pub lhs: Node,
/// Right hand statement of the `&&` operation.
///
/// `Lvar("bar")` node for `foo && bar`
pub rhs: Node,
/// Location of the `&&` (or `and`) operator
///
/// ```text
/// a && b
/// ~~
/// ```
pub operator_l: Range,
/// Location of the full expression
///
/// ```text
/// a && b
/// ~~~~~~
/// ```
pub expression_l: Range,
}
impl InnerNode for And {
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.lhs);
result.push_node(&self.rhs);
result.strings()
}
fn str_type(&self) -> &'static str {
"and"
}
fn print_with_locs(&self) {
println!("{}", self.inspect(0));
self.expression_l.print("expression");
self.operator_l.print("operator");
self.rhs.inner_ref().print_with_locs();
self.lhs.inner_ref().print_with_locs();
}
}