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/Word.html below:

class SyntaxTree::Word - RDoc Documentation

  1. SyntaxTree::
  2. Word
class SyntaxTree::Word

Word represents an element within a special array literal that accepts interpolation.

%W[a#{b}c xyz]

In the example above, there would be two Word nodes within a parent Words node.

Attributes Public Class Methods

Source

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

Source

def ===(other)
  other.is_a?(Word) && ArrayMatch.call(parts, other.parts)
end

Source

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

Source

def child_nodes
  parts
end

Source

def copy(parts: nil, location: nil)
  node =
    Word.new(
      parts: parts || self.parts,
      location: location || self.location
    )

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

Source

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

Source

def format(q)
  q.format_each(parts)
end

Source

def match?(pattern)
  parts.any? { |part| part.is_a?(TStringContent) && part.match?(pattern) }
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