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

use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::source::Range;
use crate::Node;
/// Represents a hash pattern used in pattern matching (i.e. `in { a: 1 }`)
#[derive(Debug, Clone, PartialEq)]
pub struct HashPattern {
    /// A list of inner patterns
    pub elements: Vec<Node>,
    /// Location of the open parenthesis
    ///
    /// ```text
    /// case foo; in { a: 1 }; end
    ///              ~
    /// ```
    ///
    /// `None` if there are no parentheses
    pub begin_l: Option<Range>,
    /// Location of the open parenthesis
    ///
    /// ```text
    /// case foo; in { a: 1 }; end
    ///                     ~
    /// ```
    ///
    /// `None` if there are no parentheses
    pub end_l: Option<Range>,
    /// Location of the full expression
    ///
    /// ```text
    /// case foo; in { a: 1 }; end
    ///              ~~~~~~~~
    /// ```
    pub expression_l: Range,
}


impl InnerNode for HashPattern {
    fn expression(&self) -> &Range {
        &self.expression_l
    }

    fn inspected_children(&self, indent: usize) -> Vec<String> {
        let mut result = InspectVec::new(indent);
        result.push_nodes(&self.elements);
        result.strings()
    }

    fn str_type(&self) -> &'static str {
        "hash_pattern"
    }

    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");
        }
        for node in self.elements.iter() {
            node.inner().print_with_locs();
        }
    }
}