class Prism::FindPatternNode
^^^^^^^^^^^^^^^^^^^^
foo in Foo(*bar, baz, *qux)
^^^^^^^^^^^^^^^^^
foo in [*bar, baz, *qux]
^^^^^^^^^^^^^^^
foo in *bar, baz, *qux
Represents a find pattern in pattern matching.
def self.type
def self.type :find_pattern_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(FindPatternNode) && (constant === other.constant) && (left === other.left) && (requireds.length == other.requireds.length) && requireds.zip(other.requireds).all? { |left, right| left === right } && (right === other.right) && (opening_loc.nil? == other.opening_loc.nil?) && (closing_loc.nil? == other.closing_loc.nil?) end
def accept(visitor)
def accept(visitor) visitor.visit_find_pattern_node(self) end
def child_nodes
def child_nodes [constant, left, *requireds, right] end
def closing
def closing closing_loc&.slice end
def closing_loc
def closing_loc location = @closing_loc case location when nil nil when Location location else @closing_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end end
def comment_targets
def comment_targets [*constant, left, *requireds, right, *opening_loc, *closing_loc] #: Array[Prism::node | Location] end
def compact_child_nodes
def compact_child_nodes compact = [] #: Array[Prism::node] compact << constant if constant compact << left compact.concat(requireds) compact << right compact end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, left: self.left, requireds: self.requireds, right: self.right, opening_loc: self.opening_loc, closing_loc: self.closing_loc)
def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, left: self.left, requireds: self.requireds, right: self.right, opening_loc: self.opening_loc, closing_loc: self.closing_loc) FindPatternNode.new(source, node_id, location, flags, constant, left, requireds, right, opening_loc, closing_loc) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, constant: constant, left: left, requireds: requireds, right: right, opening_loc: opening_loc, closing_loc: closing_loc } end
def initialize(source, node_id, location, flags, constant, left, requireds, right, opening_loc, closing_loc)
def initialize(source, node_id, location, flags, constant, left, requireds, right, opening_loc, closing_loc) @source = source @node_id = node_id @location = location @flags = flags @constant = constant @left = left @requireds = requireds @right = right @opening_loc = opening_loc @closing_loc = closing_loc end
def inspect
def inspect InspectVisitor.compose(self) end
def opening
def opening opening_loc&.slice end
def opening_loc
def opening_loc location = @opening_loc case location when nil nil when Location location else @opening_loc = Location.new(source, location >> 32, location & 0xFFFFFFFF) end end
def save_closing_loc(repository)
Save the closing_loc location using the given saved source so that
def save_closing_loc(repository) repository.enter(node_id, :closing_loc) unless @closing_loc.nil? end
def save_opening_loc(repository)
Save the opening_loc location using the given saved source so that
def save_opening_loc(repository) repository.enter(node_id, :opening_loc) unless @opening_loc.nil? end
def type
def type :find_pattern_node end