class Prism::IndexTargetNode

^^^^^^^^
for foo in baz do end
end
^^^^^^^^
rescue => foo[bar]<br>begin<br><br>^^^^^^^^<br>foo, = 1
Represents assigning to an index.

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

def accept(visitor)

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

def attribute_write?

def attribute_write?: () -> bool 
def attribute_write?
  flags.anybits?(CallNodeFlags::ATTRIBUTE_WRITE)
end

def child_nodes

def child_nodes: () -> Array[nil | Node] 
def child_nodes
  [receiver, arguments, block]
end

def closing

def closing: () -> String 
def closing
  closing_loc.slice
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [receiver, opening_loc, *arguments, closing_loc, *block]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> IndexTargetNode 
def copy(**params)
  IndexTargetNode.new(
    params.fetch(:flags) { flags },
    params.fetch(:receiver) { receiver },
    params.fetch(:opening_loc) { opening_loc },
    params.fetch(:arguments) { arguments },
    params.fetch(:closing_loc) { closing_loc },
    params.fetch(:block) { block },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, location: Location } 
def deconstruct_keys(keys)
  { flags: flags, receiver: receiver, opening_loc: opening_loc, arguments: arguments, closing_loc: closing_loc, block: block, location: location }
end

def ignore_visibility?

def ignore_visibility?: () -> bool 
def ignore_visibility?
  flags.anybits?(CallNodeFlags::IGNORE_VISIBILITY)
end

def initialize(flags, receiver, opening_loc, arguments, closing_loc, block, location)

def initialize: (Integer flags, Node receiver, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Location location) -> void 
def initialize(flags, receiver, opening_loc, arguments, closing_loc, block, location)
  @newline = false
  @flags = flags
  @receiver = receiver
  @opening_loc = opening_loc
  @arguments = arguments
  @closing_loc = closing_loc
  @block = block
  @location = location
end

def inspect(inspector = NodeInspector.new)

def inspect(NodeInspector inspector) -> String 
def inspect(inspector = NodeInspector.new)
  inspector << inspector.header(self)
  flags = [("safe_navigation" if safe_navigation?), ("variable_call" if variable_call?), ("attribute_write" if attribute_write?), ("ignore_visibility" if ignore_visibility?)].compact
  inspector << "├── flags: #{flags.empty? ? "∅" : flags.join(", ")}\n"
  inspector << "├── receiver:\n"
  inspector << inspector.child_node(receiver, "│   ")
  inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n"
  if (arguments = self.arguments).nil?
    inspector << "├── arguments: ∅\n"
  else
    inspector << "├── arguments:\n"
    inspector << arguments.inspect(inspector.child_inspector("│   ")).delete_prefix(inspector.prefix)
  end
  inspector << "├── closing_loc: #{inspector.location(closing_loc)}\n"
  if (block = self.block).nil?
    inspector << "└── block: ∅\n"
  else
    inspector << "└── block:\n"
    inspector << block.inspect(inspector.child_inspector("    ")).delete_prefix(inspector.prefix)
  end
  inspector.to_str
end

def opening

def opening: () -> String 
def opening
  opening_loc.slice
end

def safe_navigation?

def safe_navigation?: () -> bool 
def safe_navigation?
  flags.anybits?(CallNodeFlags::SAFE_NAVIGATION)
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
  :index_target_node
end

def variable_call?

def variable_call?: () -> bool 
def variable_call?
  flags.anybits?(CallNodeFlags::VARIABLE_CALL)
end