class Prism::ArrayNode

^^^^^^^^^
[1, 2, 3]
Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i.

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

def ===(other)

comparing the value of locations. Locations are checked only for presence.
Implements case-equality for the node. This is effectively == but without 
def ===(other)
  other.is_a?(ArrayNode) &&
    (flags === other.flags) &&
    (elements.length == other.elements.length) &&
    elements.zip(other.elements).all? { |left, right| left === right } &&
    (opening_loc.nil? == other.opening_loc.nil?) &&
    (closing_loc.nil? == other.closing_loc.nil?)
end

def accept(visitor)

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

def child_nodes

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

def closing

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

def closing_loc

foo = 1, 2, 3 # nil
%I(apple orange banana) # ")"
%w[foo bar baz] # "]"
[1,2,3] # "]"

Represents the optional source location for the closing token. 
def closing_loc
  location = @closing_loc
  case location
  when nil
    nil
  when Location
    location
  else
    @closing_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
  end
end

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [*elements, *opening_loc, *closing_loc] #: Array[Prism::node | Location]
end

def compact_child_nodes

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

def contains_splat?

def contains_splat?: () -> bool 
def contains_splat?
  flags.anybits?(ArrayNodeFlags::CONTAINS_SPLAT)
end

def copy(flags: self.flags, elements: self.elements, opening_loc: self.opening_loc, closing_loc: self.closing_loc, location: self.location)

def copy: (?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> ArrayNode 
def copy(flags: self.flags, elements: self.elements, opening_loc: self.opening_loc, closing_loc: self.closing_loc, location: self.location)
  ArrayNode.new(source, flags, elements, opening_loc, closing_loc, location)
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location?, location: Location } 
def deconstruct_keys(keys)
  { flags: flags, elements: elements, opening_loc: opening_loc, closing_loc: closing_loc, location: location }
end

def initialize(source, flags, elements, opening_loc, closing_loc, location)

def initialize: (Integer flags, Array[Prism::node] elements, Location? opening_loc, Location? closing_loc, Location location) -> void 
def initialize(source, flags, elements, opening_loc, closing_loc, location)
  @source = source
  @newline = false
  @location = location
  @flags = flags
  @elements = elements
  @opening_loc = opening_loc
  @closing_loc = closing_loc
end

def inspect

def inspect -> String 
def inspect
  InspectVisitor.compose(self)
end

def opening

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

def opening_loc

foo = 1, 2, 3 # nil
%I(apple orange banana) # "%I("
%w[foo bar baz] # "%w["
[1,2,3] # "["

Represents the optional source location for the opening token. 
def opening_loc
  location = @opening_loc
  case location
  when nil
    nil
  when Location
    location
  else
    @opening_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
  end
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
  :array_node
end