class Prism::PostExecutionNode
Represents the use of the ‘END` keyword.
END { foo } ^^^^^^^^^^^
Attributes
attr_reader closing_loc
: Location
attr_reader keyword_loc
: Location
attr_reader opening_loc
: Location
attr_reader statements: StatementsNode
?
Public Class Methods
def initialize: (statements: StatementsNode
?, keyword_loc
: Location
, opening_loc
: Location
, closing_loc
: Location
, location: Location
) -> void
# File lib/prism/node.rb, line 13662 def initialize(statements, keyword_loc, opening_loc, closing_loc, location) @statements = statements @keyword_loc = keyword_loc @opening_loc = opening_loc @closing_loc = closing_loc @location = location end
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
# File lib/prism/node.rb, line 13765 def self.type :post_execution_node end
Public Instance Methods
def accept: (visitor: Visitor
) -> void
# File lib/prism/node.rb, line 13671 def accept(visitor) visitor.visit_post_execution_node(self) end
def child_nodes
: () -> Array[nil | Node]
# File lib/prism/node.rb, line 13676 def child_nodes [statements] end
def closing: () -> String
# File lib/prism/node.rb, line 13722 def closing closing_loc.slice end
def comment_targets
: () -> Array[Node | Location]
# File lib/prism/node.rb, line 13688 def comment_targets [*statements, keyword_loc, opening_loc, closing_loc] end
def compact_child_nodes
: () -> Array
# File lib/prism/node.rb, line 13681 def compact_child_nodes compact = [] compact << statements if statements compact end
def copy: (**params) -> PostExecutionNode
# File lib/prism/node.rb, line 13693 def copy(**params) PostExecutionNode.new( params.fetch(:statements) { statements }, params.fetch(:keyword_loc) { keyword_loc }, params.fetch(:opening_loc) { opening_loc }, params.fetch(:closing_loc) { closing_loc }, params.fetch(:location) { location }, ) end
def deconstruct_keys
: (keys: Array) -> Hash[Symbol, nil | Node
| Array | String
| Token
| Array | Location]
# File lib/prism/node.rb, line 13707 def deconstruct_keys(keys) { statements: statements, keyword_loc: keyword_loc, opening_loc: opening_loc, closing_loc: closing_loc, location: location } end
def inspect(inspector: NodeInspector) -> String
# File lib/prism/node.rb, line 13727 def inspect(inspector = NodeInspector.new) inspector << inspector.header(self) if (statements = self.statements).nil? inspector << "├── statements: ∅\n" else inspector << "├── statements:\n" inspector << statements.inspect(inspector.child_inspector("│ ")).delete_prefix(inspector.prefix) end inspector << "├── keyword_loc: #{inspector.location(keyword_loc)}\n" inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n" inspector << "└── closing_loc: #{inspector.location(closing_loc)}\n" inspector.to_str end
def keyword: () -> String
# File lib/prism/node.rb, line 13712 def keyword keyword_loc.slice end
def opening: () -> String
# File lib/prism/node.rb, line 13717 def opening opening_loc.slice end
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
# File lib/prism/node.rb, line 13755 def type :post_execution_node end