class Prism::AssocNode

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

# sig/prism/node.rbs

class Prism::AssocNode < Prism::Node
  def accept: (Analyzer::Visitor visitor) -> Array[Prism::SymbolNode]
  def compact_child_nodes: () -> Array[Prism::SymbolNode]
  def initialize: ((Prism::StringNode | Prism::SymbolNode) key, (Prism::CallNode | Prism::HashNode) value, Prism::Location? operator_loc, Prism::Location location) -> void
end

^^^^^^
{ a => b }
Represents a hash key/value pair.

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
  :assoc_node
end

def accept(visitor)

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

def accept: (Analyzer::Visitor visitor) -> (Prism::IntegerNode | Prism::CallNode)

This signature was generated using 2 samples from 1 application.

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

def child_nodes

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

def comment_targets

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

def compact_child_nodes

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

type Prism__AssocNode_compact_child_nodes_return_value = Prism::FalseNode | Prism::IntegerNode | Prism::CallNode | Prism::SymbolNode

def compact_child_nodes: () -> Prism__AssocNode_compact_child_nodes_return_value

This signature was generated using 4 samples from 1 application.

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  [key, value]
end

def copy(**params)

def copy: (**params) -> AssocNode 
def copy(**params)
  AssocNode.new(
    params.fetch(:key) { key },
    params.fetch(:value) { value },
    params.fetch(:operator_loc) { operator_loc },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { key: Node, value: Node, operator_loc: Location?, location: Location } 
def deconstruct_keys(keys)
  { key: key, value: value, operator_loc: operator_loc, location: location }
end

def initialize(key, value, operator_loc, location)

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

def initialize: ((Prism::StringNode | Prism::SymbolNode) key, (Prism::CallNode | Prism::HashNode) value, Prism::Location? operator_loc, Prism::Location location) -> void

This signature was generated using 2 samples from 1 application.

def initialize: (Node key, Node value, Location? operator_loc, Location location) -> void 
def initialize(key, value, operator_loc, location)
  @newline = false
  @key = key
  @value = value
  @operator_loc = operator_loc
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── key:\n"
  inspector << inspector.child_node(key, "│   ")
  inspector << "├── value:\n"
  inspector << inspector.child_node(value, "│   ")
  inspector << "└── operator_loc: #{inspector.location(operator_loc)}\n"
  inspector.to_str
end

def operator

def operator: () -> String? 
def operator
  operator_loc&.slice
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
  :assoc_node
end