Represents a hash literal without opening and closing braces.
foo(a: b)
^^^^
attr_reader elements: Array[AssocNode | AssocSplatNode]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11462
def initialize(source, flags, elements, location)
@source = source
@location = location
@flags = flags
@elements = elements
end
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11543
def self.type
:keyword_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.4.0-preview1/lib/prism/node.rb, line 11549
def ===(other)
other.is_a?(KeywordHashNode) &&
(flags === other.flags) &&
(elements.length == other.elements.length) &&
elements.zip(other.elements).all? { |left, right| left === right }
end
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11470
def accept(visitor)
visitor.visit_keyword_hash_node(self)
end
def accept: (Visitor visitor) -> void
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11475
def child_nodes
[*elements]
end
def child_nodes: () -> Array[nil | Node]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11485
def comment_targets
[*elements] #: Array[Prism::node | Location]
end
def comment_targets: () -> Array[Node | Location]
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11480
def compact_child_nodes
[*elements]
end
def compact_child_nodes: () -> Array
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11490
def copy(flags: self.flags, elements: self.elements, location: self.location)
KeywordHashNode.new(source, flags, elements, location)
end
def copy: (?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode], ?location: Location) -> KeywordHashNode
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11498
def deconstruct_keys(keys)
{ flags: flags, elements: elements, location: location }
end
def deconstruct_keys: (Array keys) -> { flags: Integer, elements: Array[AssocNode | AssocSplatNode], location: Location }
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11515
def inspect
InspectVisitor.compose(self)
end
def inspect -> String
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11510
def symbol_keys?
flags.anybits?(KeywordHashNodeFlags::SYMBOL_KEYS)
end
def symbol_keys?: () -> bool
# File tmp/rubies/ruby-3.4.0-preview1/lib/prism/node.rb, line 11533
def type
:keyword_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