class Prism::ReturnNode

^^^^^^^^
return 1
Represents the use of the ‘return` keyword.

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
  :return_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?(ReturnNode) &&
    (flags === other.flags) &&
    (keyword_loc.nil? == other.keyword_loc.nil?) &&
    (arguments === other.arguments)
end

def accept(visitor)

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

def child_nodes

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

def comment_targets

def comment_targets: () -> Array[Node | Location] 
def comment_targets
  [keyword_loc, *arguments] #: Array[Prism::node | Location]
end

def compact_child_nodes

def compact_child_nodes: () -> Array[Node] 
def compact_child_nodes
  compact = [] #: Array[Prism::node]
  compact << arguments if arguments
  compact
end

def copy(flags: self.flags, keyword_loc: self.keyword_loc, arguments: self.arguments, location: self.location)

def copy: (?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?, ?location: Location) -> ReturnNode 
def copy(flags: self.flags, keyword_loc: self.keyword_loc, arguments: self.arguments, location: self.location)
  ReturnNode.new(source, flags, keyword_loc, arguments, location)
end

def deconstruct_keys(keys)

def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, arguments: ArgumentsNode?, location: Location } 
def deconstruct_keys(keys)
  { flags: flags, keyword_loc: keyword_loc, arguments: arguments, location: location }
end

def initialize(source, flags, keyword_loc, arguments, location)

def initialize: (Integer flags, Location keyword_loc, ArgumentsNode? arguments, Location location) -> void 
def initialize(source, flags, keyword_loc, arguments, location)
  @source = source
  @newline = false
  @location = location
  @flags = flags
  @keyword_loc = keyword_loc
  @arguments = arguments
end

def inspect

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

def keyword

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

def keyword_loc

attr_reader keyword_loc: Location 
def keyword_loc
  location = @keyword_loc
  return location if location.is_a?(Location)
  @keyword_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF)
end

def redundant?

def redundant?: () -> bool 
def redundant?
  flags.anybits?(ReturnNodeFlags::REDUNDANT)
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
  :return_node
end