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

// This file is autogenerated by codegen/node_file.liquid

use crate::nodes::InnerNode;
use crate::nodes::InspectVec;
use crate::Loc;
use crate::Node;

/// Represents a hash literal (i.e. `{ foo: 42 }`)
#[derive(Debug, Clone, PartialEq)]
#[repr(C)]
pub struct Hash {
    /// A list of key-value pairs
    pub pairs: Vec<Node>,

    /// Location of the open parenthesis
    ///
    /// ```text
    /// { a: 1 }
    /// ~
    /// ```
    ///
    /// `None` if hash literal is implicit, e.g. `foo(key: "value")`
    pub begin_l: Option<Loc>,

    /// Location of the closing parenthesis
    ///
    /// ```text
    /// { a: 1 }
    ///        ~
    /// ```
    ///
    /// `None` if hash literal is implicit, e.g. `foo(key: "value")`
    pub end_l: Option<Loc>,

    /// Location of the full expression
    ///
    /// ```text
    /// { a: 1 }
    /// ~~~~~~~~
    /// ```
    pub expression_l: Loc,

}

impl InnerNode for Hash {
    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.pairs);
        
        result.strings()
    }

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

    fn print_with_locs(&self) {
        println!("{}", self.inspect(0));
        for node in self.pairs.iter() { node.inner_ref().print_with_locs(); }
        if let Some(loc) = self.begin_l.as_ref() { loc.print("begin") }
        if let Some(loc) = self.end_l.as_ref() { loc.print("end") }
        self.expression_l.print("expression");
        
    }
}