Class: Prism::RetryNode
- Inherits:
-
PrismNode
- Object
- PrismNode
- Prism::RetryNode
- Defined in:
- lib/prism/node.rb,
ext/prism/api_node.c
Overview
Represents the use of the ‘retry` keyword.
retry
^^^^^
Class Method Summary collapse
-
.type ⇒ Object
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.
Instance Method Summary collapse
-
#accept(visitor) ⇒ Object
def accept: (visitor: Visitor) -> void.
-
#child_nodes ⇒ Object
(also: #deconstruct)
def child_nodes: () -> Array[nil | Node].
-
#comment_targets ⇒ Object
def comment_targets: () -> Array[Node | Location].
-
#compact_child_nodes ⇒ Object
def compact_child_nodes: () -> Array.
-
#copy(**params) ⇒ Object
def copy: (**params) -> RetryNode.
- #deconstruct_keys(keys) ⇒ Object
-
#initialize(location) ⇒ RetryNode
constructor
def initialize: (location: Location) -> void.
-
#inspect(inspector = NodeInspector.new) ⇒ Object
def inspect(inspector: NodeInspector) -> String.
-
#type ⇒ Object
Sometimes you want to check an instance of a node against a list of classes to see what kind of behavior to perform.
Constructor Details
#initialize(location) ⇒ RetryNode
def initialize: (location: Location) -> void
15020 15021 15022 |
# File 'lib/prism/node.rb', line 15020 def initialize(location) @location = location end |
Class Method Details
.type ⇒ Object
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
15089 15090 15091 |
# File 'lib/prism/node.rb', line 15089 def self.type :retry_node end |
Instance Method Details
#accept(visitor) ⇒ Object
def accept: (visitor: Visitor) -> void
15025 15026 15027 |
# File 'lib/prism/node.rb', line 15025 def accept(visitor) visitor.visit_retry_node(self) end |
#child_nodes ⇒ Object Also known as: deconstruct
def child_nodes: () -> Array[nil | Node]
15030 15031 15032 |
# File 'lib/prism/node.rb', line 15030 def child_nodes [] end |
#comment_targets ⇒ Object
def comment_targets: () -> Array[Node | Location]
15040 15041 15042 |
# File 'lib/prism/node.rb', line 15040 def comment_targets [] end |
#compact_child_nodes ⇒ Object
def compact_child_nodes: () -> Array
15035 15036 15037 |
# File 'lib/prism/node.rb', line 15035 def compact_child_nodes [] end |
#copy(**params) ⇒ Object
def copy: (**params) -> RetryNode
15045 15046 15047 15048 15049 |
# File 'lib/prism/node.rb', line 15045 def copy(**params) RetryNode.new( params.fetch(:location) { location }, ) end |
#deconstruct_keys(keys) ⇒ Object
15055 15056 15057 |
# File 'lib/prism/node.rb', line 15055 def deconstruct_keys(keys) { location: location } end |
#inspect(inspector = NodeInspector.new) ⇒ Object
def inspect(inspector: NodeInspector) -> String
15060 15061 15062 15063 |
# File 'lib/prism/node.rb', line 15060 def inspect(inspector = NodeInspector.new) inspector << inspector.header(self) inspector.to_str end |
#type ⇒ Object
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
15079 15080 15081 |
# File 'lib/prism/node.rb', line 15079 def type :retry_node end |