class Prism::ArrayPatternNode
^^^^^^^^^^^^^^^^^^^
foo in Bar[1, 2, 3]
^^^^^^^^^^^^
foo in Bar[]
^^^^^^^^^
foo in *1
^^^^^^^^^^^^^
foo in [1, 2]
^^^^^^^^^^^
foo in 1, 2
Represents an array pattern in pattern matching.
def self.type
def self.type :array_pattern_node end
def ===(other)
Implements case-equality for the node. This is effectively == but without
def ===(other) other.is_a?(ArrayPatternNode) && (constant === other.constant) && (requireds.length == other.requireds.length) && requireds.zip(other.requireds).all? { |left, right| left === right } && (rest === other.rest) && (posts.length == other.posts.length) && posts.zip(other.posts).all? { |left, right| left === right } && (opening_loc.nil? == other.opening_loc.nil?) && (closing_loc.nil? == other.closing_loc.nil?) end
def accept(visitor)
def accept(visitor) visitor.visit_array_pattern_node(self) end
def child_nodes
def child_nodes [constant, *requireds, rest, *posts] 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, *requireds, *rest, *posts, *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.concat(requireds) compact << rest if rest compact.concat(posts) compact end
def copy(node_id: self.node_id, location: self.location, flags: self.flags, constant: self.constant, requireds: self.requireds, rest: self.rest, posts: self.posts, 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, requireds: self.requireds, rest: self.rest, posts: self.posts, opening_loc: self.opening_loc, closing_loc: self.closing_loc) ArrayPatternNode.new(source, node_id, location, flags, constant, requireds, rest, posts, opening_loc, closing_loc) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { node_id: node_id, location: location, constant: constant, requireds: requireds, rest: rest, posts: posts, opening_loc: opening_loc, closing_loc: closing_loc } end
def initialize(source, node_id, location, flags, constant, requireds, rest, posts, opening_loc, closing_loc)
def initialize(source, node_id, location, flags, constant, requireds, rest, posts, opening_loc, closing_loc) @source = source @node_id = node_id @location = location @flags = flags @constant = constant @requireds = requireds @rest = rest @posts = posts @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 type
def type :array_pattern_node end