class Prism::PinnedExpressionNode

^^^^^^
foo in ^(bar)
pattern matching expression.
Represents the use of the ‘^` operator for pinning an expression in a

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

def accept(visitor)

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

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [expression, operator_loc, lparen_loc, rparen_loc]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> PinnedExpressionNode 
def copy(**params)
  PinnedExpressionNode.new(
    params.fetch(:expression) { expression },
    params.fetch(:operator_loc) { operator_loc },
    params.fetch(:lparen_loc) { lparen_loc },
    params.fetch(:rparen_loc) { rparen_loc },
    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)
  { expression: expression, operator_loc: operator_loc, lparen_loc: lparen_loc, rparen_loc: rparen_loc, location: location }
end

def initialize(expression, operator_loc, lparen_loc, rparen_loc, location)

def initialize: (expression: Node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location) -> void 
def initialize(expression, operator_loc, lparen_loc, rparen_loc, location)
  @expression = expression
  @operator_loc = operator_loc
  @lparen_loc = lparen_loc
  @rparen_loc = rparen_loc
  @location = location
end

def inspect(inspector = NodeInspector.new) 

def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  inspector << "├── expression:\n"
  inspector << inspector.child_node(expression, "│   ")
  inspector << "├── operator_loc: #{inspector.location(operator_loc)}\n"
  inspector << "├── lparen_loc: #{inspector.location(lparen_loc)}\n"
  inspector << "└── rparen_loc: #{inspector.location(rparen_loc)}\n"
  inspector.to_str
end

def lparen

def lparen: () -> String 
def lparen
  lparen_loc.slice
end

def operator

def operator: () -> String 
def operator
  operator_loc.slice
end

def rparen

def rparen: () -> String 
def rparen
  rparen_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
  :pinned_expression_node
end