class Prism::ReturnNode
Represents the use of the ‘return` keyword.
return 1 ^^^^^^^^
Attributes
attr_reader arguments: ArgumentsNode
?
protected attr_reader flags: Integer
Public Class Methods
def initialize: (Integer flags, Location
keyword_loc
, ArgumentsNode
? arguments, Location
location) -> void
# File prism/node.rb, line 16469 def initialize(source, flags, keyword_loc, arguments, location) @source = source @location = location @flags = flags @keyword_loc = keyword_loc @arguments = arguments end
Similar to type
, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type
, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.
def self.type: () -> Symbol
# File prism/node.rb, line 16565 def self.type :return_node end
Public Instance Methods
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
# File prism/node.rb, line 16571 def ===(other) other.is_a?(ReturnNode) && (flags === other.flags) && (keyword_loc.nil? == other.keyword_loc.nil?) && (arguments === other.arguments) end
def accept: (Visitor
visitor) -> void
# File prism/node.rb, line 16478 def accept(visitor) visitor.visit_return_node(self) end
def child_nodes
: () -> Array[nil | Node]
# File prism/node.rb, line 16483 def child_nodes [arguments] end
def comment_targets
: () -> Array[Node | Location]
# File prism/node.rb, line 16495 def comment_targets [keyword_loc, *arguments] #: Array[Prism::node | Location] end
def compact_child_nodes
: () -> Array
# File prism/node.rb, line 16488 def compact_child_nodes compact = [] #: Array[Prism::node] compact << arguments if arguments compact end
def copy: (?flags: Integer, ?keyword_loc: Location
, ?arguments: ArgumentsNode
?, ?location: Location
) -> ReturnNode
# File prism/node.rb, line 16500 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
: (Array keys) -> { flags: Integer, keyword_loc
: Location
, arguments: ArgumentsNode
?, location: Location
}
# File prism/node.rb, line 16508 def deconstruct_keys(keys) { flags: flags, keyword_loc: keyword_loc, arguments: arguments, location: location } end
def inspect -> String
# File prism/node.rb, line 16537 def inspect InspectVisitor.compose(self) end
def keyword: () -> String
# File prism/node.rb, line 16532 def keyword keyword_loc.slice end
attr_reader keyword_loc
: Location
# File prism/node.rb, line 16517 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?: () -> bool
# File prism/node.rb, line 16527 def redundant? flags.anybits?(ReturnNodeFlags::REDUNDANT) end
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol
# File prism/node.rb, line 16555 def type :return_node end