класс Prism::FindPatternNode

Родитель:: Prism::Node

Представляет шаблон поиска в сопоставлении с образцом.

foo in *bar, baz, *qux
       ^^^^^^^^^^^^^^^

foo in [*bar, baz, *qux]
       ^^^^^^^^^^^^^^^^^

foo in Foo(*bar, baz, *qux)
       ^^^^^^^^^^^^^^^^^^^^

Атрибуты

constant [R]

attr_reader constant: ConstantReadNode | ConstantPathNode | nil

left [R]

attr_reader left: SplatNode

requireds [R]

attr_reader requireds: Массив

right [R]

attr_reader right: SplatNode | MissingNode

Открытые методы класса

new (source, node_id, location, flags, constant, left, requireds, right, opening_loc, closing_loc)

Исходный код

# File lib/prism/node.rb, line 6818
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

Инициализировать новый узел FindPatternNode.

type ()

Исходный код

# File lib/prism/node.rb, line 6940
def self.type
  :find_pattern_node
end

Возвращает символьную запись типа узла. См. ‘Node::type`.

Публичные методы экземпляра

=== (other)

Исходный код

# File lib/prism/node.rb, line 6946
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

Реализует равенство по регистру для узла. Это фактически ==, но без сравнения значений местоположений. Местоположения проверяются только на наличие.

accept (visitor)

Исходный код

# File lib/prism/node.rb, line 6832
def accept(visitor)
  visitor.visit_find_pattern_node(self)
end

def accept: (Visitor visitor) -> void

child_nodes ()

Исходный код

# File lib/prism/node.rb, line 6837
def child_nodes
  [constant, left, *requireds, right]
end

def child_nodes: () -> Array[nil | Node]

Также известен как: deconstruct

closing ()

Исходный код

# File lib/prism/node.rb, line 6925
def closing
  closing_loc&.slice
end

def closing: () -> String?

closing_loc ()

Исходный код

# File lib/prism/node.rb, line 6901
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

attr_reader closing_loc: Location?

comment_targets ()

Исходный код

# File lib/prism/node.rb, line 6852
def comment_targets
  [*constant, left, *requireds, right, *opening_loc, *closing_loc] #: Array[Prism::node | Location]
end

def comment_targets: () -> Array[Node | Location]

compact_child_nodes ()

Исходный код

# File lib/prism/node.rb, line 6842
def compact_child_nodes
  compact = [] #: Array[Prism::node]
  compact << constant if constant
  compact << left
  compact.concat(requireds)
  compact << right
  compact
end

def compact_child_nodes: () -> Array

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)

Исходный код

# File lib/prism/node.rb, line 6857
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 copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?left: SplatNode, ?requireds: Array, ?right: SplatNode | MissingNode, ?opening_loc: Location?, ?closing_loc: Location?) -> FindPatternNode

deconstruct ()

def deconstruct: () -> Array[nil | Node]

Псевдоним для: child_nodes

deconstruct_keys (keys)

Исходный код

# File lib/prism/node.rb, line 6865
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 deconstruct_keys: (Array keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, left: SplatNode, requireds: Array, right: SplatNode | MissingNode, opening_loc: Location?, closing_loc: Location? }

inspect ()

Исходный код

# File lib/prism/node.rb, line 6930
def inspect
  InspectVisitor.compose(self)
end

def inspect -> String

opening ()

Исходный код

# File lib/prism/node.rb, line 6920
def opening
  opening_loc&.slice
end

def opening: () -> String?

opening_loc ()

Исходный код

# File lib/prism/node.rb, line 6882
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

attr_reader opening_loc: Location?

save_closing_loc (repository)

Исходный код

# File lib/prism/node.rb, line 6915
def save_closing_loc(repository)
  repository.enter(node_id, :closing_loc) unless @closing_loc.nil?
end

Сохраняет местоположение closing_loc с использованием заданного сохраненного источника, чтобы его можно было получить позже.

save_opening_loc (repository)

Исходный код

# File lib/prism/node.rb, line 6896
def save_opening_loc(repository)
  repository.enter(node_id, :opening_loc) unless @opening_loc.nil?
end

Сохраняет местоположение opening_loc с использованием заданного сохраненного источника, чтобы его можно было получить позже.

type ()

Исходный код

# File lib/prism/node.rb, line 6935
def type
  :find_pattern_node
end

Возвращает символьное представление типа узла. См. ‘Node#type`.

Ruby Core © 1993–2024 Yukihiro Matsumoto
Licensed under the Ruby License.
Ruby Standard Library © contributors
Licensed under their own licenses.