class Prism::KeywordParameterNode

end
^^^^
def a(b: 1)
end
^^
def a(b:)
Represents a keyword parameter to a method, block, or lambda definition.

def accept(visitor)

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

def child_nodes

def child_nodes: () -> Array[nil | Node] 
def child_nodes
  [value]
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [name_loc, *value]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  compact = []
  compact << value if value
  compact
end

def copy(**params)

def copy: (**params) -> KeywordParameterNode 
def copy(**params)
  KeywordParameterNode.new(
    params.fetch(:name) { name },
    params.fetch(:name_loc) { name_loc },
    params.fetch(:value) { value },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] 
def deconstruct_keys(keys)
  { name: name, name_loc: name_loc, value: value, location: location }
end

def initialize(name, name_loc, value, location)

def initialize: (name: Symbol, name_loc: Location, value: Node?, location: Location) -> void 
def initialize(name, name_loc, value, location)
  @name = name
  @name_loc = name_loc
  @value = value
  @location = location
end

def inspect(inspector = NodeInspector.new) 

def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── name: #{name.inspect}\n"
  inspector << "├── name_loc: #{inspector.location(name_loc)}\n"
  if (value = self.value).nil?
    inspector << "└── value: ∅\n"
  else
    inspector << "└── value:\n"
    inspector << value.inspect(inspector.child_inspector("    ")).delete_prefix(inspector.prefix)
  end
  inspector.to_str
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_parameter_node
end