class Prism::UndefNode
^^^^^^^^^^^^^^^^^^^^^^
undef :foo, :bar, :baz
Represents the use of the ‘undef` keyword.
def self.type
def self.type :undef_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(UndefNode) && (names.length == other.names.length) && names.zip(other.names).all? { |left, right| left === right } && (keyword_loc.nil? == other.keyword_loc.nil?) end
def accept(visitor)
def accept(visitor) visitor.visit_undef_node(self) end
def child_nodes
def child_nodes [*names] end
def comment_targets
def comment_targets [*names, keyword_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
def compact_child_nodes [*names] end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, names: self.names, keyword_loc: self.keyword_loc)
def copy(node_id: self.node_id, location: self.location, flags: self.flags, names: self.names, keyword_loc: self.keyword_loc) UndefNode.new(source, node_id, location, flags, names, keyword_loc) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, names: names, keyword_loc: keyword_loc } end
def initialize(source, node_id, location, flags, names, keyword_loc)
def initialize(source, node_id, location, flags, names, keyword_loc) @source = source @node_id = node_id @location = location @flags = flags @names = names @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 :undef_node end