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

class SyntaxTree::LBracket - RDoc Documentation

  1. SyntaxTree::
  2. LBracket
class SyntaxTree::LBracket

LBracket represents the use of a left bracket, i.e., [.

Attributes Public Class Methods

Source

def self.default
  new(value: "[", location: Location.default)
end

Because some nodes keep around a [ token so that comments can be attached to it if they occur in the source, oftentimes an LBracket is a child of another node. This means it’s required at initialization time. To make it easier to create LBracket nodes without any specific value, this method provides a default node.

Source

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

Source

def ===(other)
  other.is_a?(LBracket) && value === other.value
end

Source

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

Source

def copy(value: nil, location: nil)
  node =
    LBracket.new(
      value: value || self.value,
      location: location || self.location
    )

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

Source

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

Source

def format(q)
  q.text(value)
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