class Prism::KeywordHashNode

^^^^
foo(a: b)
Represents a hash literal without opening and closing braces.

def self.type

Return a symbol representation of this node type. See `Node::type`. 
def self.type
  :keyword_hash_node
end

def ===(other)

comparing the value of locations. Locations are checked only for presence.
Implements case-equality for the node. This is effectively == but without 
def ===(other)
  other.is_a?(KeywordHashNode) &&
    (flags === other.flags) &&
    (elements.length == other.elements.length) &&
    elements.zip(other.elements).all? { |left, right| left === right }
end

def accept(visitor)

def accept: (Visitor visitor) -> void 
def accept(visitor)
  visitor.visit_keyword_hash_node(self)
end

def child_nodes

def child_nodes: () -> Array[Node?] 
def child_nodes
  [*elements]
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [*elements] #: Array[Prism::node | Location]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  [*elements]
end

def copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)

def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) -> KeywordHashNode 
def copy(node_id: self.node_id, location: self.location, flags: self.flags, elements: self.elements)
  KeywordHashNode.new(source, node_id, location, flags, elements)
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[AssocNode | AssocSplatNode] } 
def deconstruct_keys(keys)
  { node_id: node_id, location: location, elements: elements }
end

def each_child_node

def each_child_node: () { (Prism::node) -> void } -> void | () -> Enumerator[Prism::node] 
def each_child_node
  return to_enum(:each_child_node) unless block_given?
  elements.each { |node| yield node }
end

def initialize(source, node_id, location, flags, elements)

Initialize a new KeywordHashNode node. 
def initialize(source, node_id, location, flags, elements)
  @source = source
  @node_id = node_id
  @location = location
  @flags = flags
  @elements = elements
end

def inspect

def inspect -> String 
def inspect
  InspectVisitor.compose(self)
end

def symbol_keys?

def symbol_keys?: () -> bool 
def symbol_keys?
  flags.anybits?(KeywordHashNodeFlags::SYMBOL_KEYS)
end

def type

Return a symbol representation of this node type. See `Node#type`. 
def type
  :keyword_hash_node
end