class Prism::NextNode
^^^^^^
next 1
Represents the use of the ‘next` keyword.
def self.type
def self.type :next_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(NextNode) && (arguments === other.arguments) && (keyword_loc.nil? == other.keyword_loc.nil?) end
def accept(visitor)
def accept(visitor) visitor.visit_next_node(self) end
def child_nodes
def child_nodes [arguments] end
def comment_targets
def comment_targets [*arguments, keyword_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
def compact_child_nodes compact = [] #: Array[Prism::node] compact << arguments if arguments compact end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, arguments: self.arguments, keyword_loc: self.keyword_loc)
def copy(node_id: self.node_id, location: self.location, flags: self.flags, arguments: self.arguments, keyword_loc: self.keyword_loc) NextNode.new(source, node_id, location, flags, arguments, keyword_loc) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, arguments: arguments, keyword_loc: keyword_loc } end
def initialize(source, node_id, location, flags, arguments, keyword_loc)
def initialize(source, node_id, location, flags, arguments, keyword_loc) @source = source @node_id = node_id @location = location @flags = flags @arguments = arguments @keyword_loc = keyword_loc end
def inspect
def inspect InspectVisitor.compose(self) end
def keyword
def keyword keyword_loc.slice end
def keyword_loc
def keyword_loc location = @keyword_loc return location if location.is_a?(Location) @keyword_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end
def save_keyword_loc(repository)
Save the keyword_loc location using the given saved source so that
def save_keyword_loc(repository) repository.enter(node_id, :keyword_loc) end
def type
def type :next_node end