class SyntaxTree::LBracket
Experimental RBS support (using type sampling data from the type_fusion
project).
# sig/syntax_tree/node.rbs class SyntaxTree::LBracket < SyntaxTree::Node def accept: (Visitor visitor) -> untyped def child_nodes: () -> untyped def initialize: (value: String, location: SyntaxTree::Location) -> void end
LBracket represents the use of a left bracket, i.e., [.
def self.default
easier to create LBracket nodes without any specific value, this method
another node. This means it's required at initialization time. To make it
to it if they occur in the source, oftentimes an LBracket is a child of
Because some nodes keep around a [ token so that comments can be attached
def self.default new(value: "[", location: Location.default) end
def ===(other)
def ===(other) other.is_a?(LBracket) && value === other.value end
def accept(visitor)
Experimental RBS support (using type sampling data from the type_fusion
project).
def accept: (Visitor visitor) -> untyped
This signature was generated using 3 samples from 1 application.
def accept(visitor) visitor.visit_lbracket(self) end
def child_nodes
Experimental RBS support (using type sampling data from the type_fusion
project).
def child_nodes: () -> untyped
This signature was generated using 4 samples from 1 application.
def child_nodes [] end
def copy(value: nil, location: nil)
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
def deconstruct_keys(_keys)
def deconstruct_keys(_keys) { value: value, location: location, comments: comments } end
def format(q)
def format(q) q.text(value) end
def initialize(value:, location:)
Experimental RBS support (using type sampling data from the type_fusion
project).
def initialize: (value: String, location: SyntaxTree::Location) -> void
This signature was generated using 8 samples from 1 application.
def initialize(value:, location:) @value = value @location = location @comments = [] end