class Prism::RescueModifierNode

^^^^^^^^^^^^^^
foo rescue nil
Represents an expression modified with a rescue.

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

def accept(visitor)

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

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [expression, keyword_loc, rescue_expression]
end

def compact_child_nodes

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

def copy(**params)

def copy: (**params) -> RescueModifierNode 
def copy(**params)
  RescueModifierNode.new(
    params.fetch(:expression) { expression },
    params.fetch(:keyword_loc) { keyword_loc },
    params.fetch(:rescue_expression) { rescue_expression },
    params.fetch(:location) { location },
  )
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node, keyword_loc: Location, rescue_expression: Node, location: Location } 
def deconstruct_keys(keys)
  { expression: expression, keyword_loc: keyword_loc, rescue_expression: rescue_expression, location: location }
end

def initialize(expression, keyword_loc, rescue_expression, location)

def initialize: (Node expression, Location keyword_loc, Node rescue_expression, Location location) -> void 
def initialize(expression, keyword_loc, rescue_expression, location)
  @newline = false
  @expression = expression
  @keyword_loc = keyword_loc
  @rescue_expression = rescue_expression
  @location = location
end

def inspect(inspector = NodeInspector.new)

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

def keyword

def keyword: () -> String 
def keyword
  keyword_loc.slice
end

def set_newline_flag(newline_marked) # :nodoc:

:nodoc: 
def set_newline_flag(newline_marked) # :nodoc:
  expression.set_newline_flag(newline_marked)
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
  :rescue_modifier_node
end