Represents a hash literal.
{ a => b } ^^^^^^^^^^
attr_reader opening_loc
: Location
attr_reader closing_loc
: Location
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7476
def initialize(opening_loc, elements, closing_loc, location)
@opening_loc = opening_loc
@elements = elements
@closing_loc = closing_loc
@location = location
end
def initialize: (opening_loc
: Location
, elements: Array, closing_loc
: Location
, location: Location
) -> void
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7564
def self.type
:hash_node
end
Similar to type
, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type
, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.
def self.type: () -> Symbol
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7484
def accept(visitor)
visitor.visit_hash_node(self)
end
def accept: (visitor: Visitor
) -> void
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7489
def child_nodes
[*elements]
end
def child_nodes
: () -> Array[nil | Node]
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7527
def closing
closing_loc.slice
end
def closing: () -> String
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7499
def comment_targets
[opening_loc, *elements, closing_loc]
end
def comment_targets
: () -> Array[Node | Location]
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7494
def compact_child_nodes
[*elements]
end
def compact_child_nodes
: () -> Array
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7504
def copy(**params)
HashNode.new(
params.fetch(:opening_loc) { opening_loc },
params.fetch(:elements) { elements },
params.fetch(:closing_loc) { closing_loc },
params.fetch(:location) { location },
)
end
def copy: (**params) -> HashNode
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7517
def deconstruct_keys(keys)
{ opening_loc: opening_loc, elements: elements, closing_loc: closing_loc, location: location }
end
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7532
def inspect(inspector = NodeInspector.new)
inspector << inspector.header(self)
inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n"
inspector << "├── elements: #{inspector.list("#{inspector.prefix}│ ", elements)}"
inspector << "└── closing_loc: #{inspector.location(closing_loc)}\n"
inspector.to_str
end
def inspect(inspector: NodeInspector) -> String
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7522
def opening
opening_loc.slice
end
def opening: () -> String
# File tmp/rubies/ruby-3.3.0/lib/prism/node.rb, line 7554
def type
:hash_node
end
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol