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.
def initialize(parts:, location:) @parts = parts @location = location @comments = [] endPublic Instance Methods Source
def ===(other) other.is_a?(Word) && ArrayMatch.call(parts, other.parts) endSource
def accept(visitor) visitor.visit_word(self) endSource
def child_nodes parts endSource
def copy(parts: nil, location: nil) node = Word.new( parts: parts || self.parts, location: location || self.location ) node.comments.concat(comments.map(&:copy)) node endSource
def deconstruct_keys(_keys) { parts: parts, location: location, comments: comments } endSource
def format(q) q.format_each(parts) endSource
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