class Prism::KeywordHashNode

Experimental RBS support (using type sampling data from the type_fusion project). 

# sig/prism/node.rbs

class Prism::KeywordHashNode < Prism::Node
  def compact_child_nodes: () -> Array[Prism::AssocNode]
  def initialize: (Integer flags, Array[Prism::AssocNode] elements, Prism::Location location) -> void
end

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

def self.type

def self.type: () -> Symbol

class, but should be faster in a case statement or an array comparison.
Note that like #type, it will still be slower than using == for a single
splitting on the type of the node without having to do a long === chain.
Similar to #type, this method returns a symbol that you can use for 
def self.type
  :keyword_hash_node
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[nil | Node] 
def child_nodes
  [*elements]
end

def comment_targets

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

def compact_child_nodes

Experimental RBS support (using type sampling data from the type_fusion project). 

def compact_child_nodes: () -> Prism::AssocNode

This signature was generated using 1 sample from 1 application.

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

def copy(**params)

def copy: (**params) -> KeywordHashNode 
def copy(**params)
  KeywordHashNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:elements) { elements },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Node], location: Location } 
def deconstruct_keys(keys)
  { flags: flags, elements: elements, location: location }
end

def initialize(flags, elements, location)

Experimental RBS support (using type sampling data from the type_fusion project). 

def initialize: (Integer flags,  elements, Prism::Location location) -> void

This signature was generated using 1 sample from 1 application.

def initialize: (Integer flags, Array[Node] elements, Location location) -> void 
def initialize(flags, elements, location)
  @newline = false
  @flags = flags
  @elements = elements
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("symbol_keys" if symbol_keys?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "└── elements: #{inspector.list("#{inspector.prefix}    ", elements)}"
  inspector.to_str
end

def symbol_keys?

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

def type

def type: () -> Symbol

keys will use a jump table.
you can take advantage of the fact that case statements with all symbol
it uses a single integer comparison, but also because if you're on CRuby
can use for comparison. This is faster than the other approaches because
Instead, you can call #type, which will return to you a symbol that you

method calls, and/or array allocations.
these approaches are relatively slow because of the constant lookups,
case statement and doing `case node; when cls1; when cls2; end`. Both of
calling `[cls1, cls2].include?(node.class)` or putting the node into a
classes to see what kind of behavior to perform. Usually this is done by
Sometimes you want to check an instance of a node against a list of 
def type
  :keyword_hash_node
end