def inspect -> 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
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
def initialize: (Prism::node value, Prism::node pattern, Location
operator_loc
, Location
location) -> void
def accept: (Visitor
visitor) -> void
def comment_targets
: () -> Array[Node | Location]
def copy: (?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location
, ?location: Location
) -> MatchRequiredNode
def deconstruct: () -> Array[nil | Node]
def deconstruct_keys
: (Array keys) -> { value: Prism::node, pattern: Prism::node, operator_loc
: Location
, location: Location
}
def inspect -> 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
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.
def accept: (Visitor
visitor) -> void
def comment_targets
: () -> Array[Node | Location]
def copy: (?call: CallNode
, ?targets: Array, ?location: Location
) -> MatchWriteNode
def deconstruct: () -> Array[nil | Node]
def deconstruct_keys
: (Array keys) -> { call: CallNode
, targets: Array, location: Location
}
def inspect -> 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
Implements case-equality for the node. This is effectively == but without comparing the value of locations. Locations are checked only for presence.