Dispatch enter and leave events for OptionalKeywordParameterNode
nodes and continue walking the tree.
Copy a OptionalKeywordParameterNode
node
Returns the node id for the given backtrace location.
begin raise rescue => e loc = e.backtrace_locations.first RubyVM::AbstractSyntaxTree.node_id_for_backtrace_location(loc) end # => 0
Compile a InterpolatedMatchLastLineNode
node
Dispatch enter and leave events for InterpolatedMatchLastLineNode
nodes and continue walking the tree.
Copy a InterpolatedMatchLastLineNode
node
def initialize: (name: Symbol
, name_loc
: Location
, operator_loc
: Location
, value: Node
, location: Location
) -> void
def accept: (visitor: Visitor
) -> void
def child_nodes
: () -> Array[nil | Node]
def operator: () -> String
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol
Similar to type
, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type
, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.
def self.type: () -> Symbol
def initialize: (name: Symbol
, name_loc
: Location
, operator_loc
: Location
, value: Node
, operator: Symbol
, location: Location
) -> void
def accept: (visitor: Visitor
) -> void
def child_nodes
: () -> Array[nil | Node]
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol
Similar to type
, this method returns a symbol that you can use for splitting on the type of the node without having to do a long === chain. Note that like type
, it will still be slower than using == for a single class, but should be faster in a case statement or an array comparison.
def self.type: () -> Symbol
def initialize: (name: Symbol
, name_loc
: Location
, operator_loc
: Location
, value: Node
, location: Location
) -> void
def accept: (visitor: Visitor
) -> void
def child_nodes
: () -> Array[nil | Node]
def operator: () -> String
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform. Usually this is done by calling ‘[cls1, cls2].include?(node.class)` or putting the node into a case statement and doing `case node; when cls1; when cls2; end`. Both of these approaches are relatively slow because of the constant lookups, method calls, and/or array allocations.
Instead, you can call type
, which will return to you a symbol that you can use for comparison. This is faster than the other approaches because it uses a single integer comparison, but also because if you’re on CRuby you can take advantage of the fact that case statements with all symbol keys will use a jump table.
def type: () -> Symbol