A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://ruby-syntax-tree.github.io/syntax_tree/SyntaxTree/QSymbols.html below:

class SyntaxTree::QSymbols - RDoc Documentation

  1. SyntaxTree::
  2. QSymbols
class SyntaxTree::QSymbols

QSymbols represents a symbol literal array without interpolation.

%i[one two three]
Attributes Public Class Methods

Source

def initialize(beginning:, elements:, location:)
  @beginning = beginning
  @elements = elements
  @location = location
  @comments = []
end
Public Instance Methods

Source

def ===(other)
  other.is_a?(QSymbols) && beginning === other.beginning &&
    ArrayMatch.call(elements, other.elements)
end

Source

def accept(visitor)
  visitor.visit_qsymbols(self)
end

Source

def copy(beginning: nil, elements: nil, location: nil)
  node =
    QSymbols.new(
      beginning: beginning || self.beginning,
      elements: elements || self.elements,
      location: location || self.location
    )

  node.comments.concat(comments.map(&:copy))
  node
end

Source

def deconstruct_keys(_keys)
  {
    beginning: beginning,
    elements: elements,
    location: location,
    comments: comments
  }
end

Source

def format(q)
  opening, closing = "%i[", "]"

  if elements.any? { |element| element.match?(/[\[\]]/) }
    opening = beginning.value
    closing = Quotes.matching(opening[2])
  end

  q.text(opening)
  q.group do
    q.indent do
      q.breakable_empty
      q.seplist(
        elements,
        ArrayLiteral::BREAKABLE_SPACE_SEPARATOR
      ) { |element| q.format(element) }
    end
    q.breakable_empty
  end
  q.text(closing)
end

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4