class Prism::BlockParametersNode
Experimental RBS support (using type sampling data from the type_fusion
project).
# sig/prism/node.rbs class Prism::BlockParametersNode < Prism::Node def accept: (Analyzer::Visitor visitor) -> Array[Prism::ParametersNode] def compact_child_nodes: () -> Array[Prism::ParametersNode] end
end
^^^^^^^^^^^^^^^^^
foo do |a, b = 1; local|
^^^^^^^^^^^^^^^^^
-> (a, b = 1; local) { }
Represents a block’s parameters declaration.
def self.type
class, but should be faster in a case statement or an array comparison.
Note that like #type, it will still be slower than using == for a single
splitting on the type of the node without having to do a long === chain.
Similar to #type, this method returns a symbol that you can use for
def self.type :block_parameters_node end
def accept(visitor)
Experimental RBS support (using type sampling data from the type_fusion
project).
def accept: (Analyzer::Visitor visitor) ->
This signature was generated using 2 samples from 1 application.
def accept(visitor) visitor.visit_block_parameters_node(self) end
def child_nodes
def child_nodes [parameters, *locals] end
def closing
def closing closing_loc&.slice end
def comment_targets
def comment_targets [*parameters, *locals, *opening_loc, *closing_loc] end
def compact_child_nodes
Experimental RBS support (using type sampling data from the type_fusion
project).
def compact_child_nodes: () ->
This signature was generated using 1 sample from 1 application.
def compact_child_nodes compact = [] compact << parameters if parameters compact.concat(locals) compact end
def copy(**params)
def copy(**params) BlockParametersNode.new( params.fetch(:parameters) { parameters }, params.fetch(:locals) { locals }, params.fetch(:opening_loc) { opening_loc }, params.fetch(:closing_loc) { closing_loc }, params.fetch(:location) { location }, ) end
def deconstruct_keys(keys)
def deconstruct_keys(keys) { parameters: parameters, locals: locals, opening_loc: opening_loc, closing_loc: closing_loc, location: location } end
def initialize(parameters, locals, opening_loc, closing_loc, location)
def initialize(parameters, locals, opening_loc, closing_loc, location) @newline = false @parameters = parameters @locals = locals @opening_loc = opening_loc @closing_loc = closing_loc @location = location end
def inspect(inspector = NodeInspector.new)
def inspect(inspector = NodeInspector.new) inspector << inspector.header(self) if (parameters = self.parameters).nil? inspector << "├── parameters: ∅\n" else inspector << "├── parameters:\n" inspector << parameters.inspect(inspector.child_inspector("│ ")).delete_prefix(inspector.prefix) end inspector << "├── locals: #{inspector.list("#{inspector.prefix}│ ", locals)}" inspector << "├── opening_loc: #{inspector.location(opening_loc)}\n" inspector << "└── closing_loc: #{inspector.location(closing_loc)}\n" inspector.to_str end
def opening
def opening opening_loc&.slice end
def type
keys will use a jump table.
you can take advantage of the fact that case statements with all symbol
it uses a single integer comparison, but also because if you're on CRuby
can use for comparison. This is faster than the other approaches because
Instead, you can call #type, which will return to you a symbol that you
method calls, and/or array allocations.
these approaches are relatively slow because of the constant lookups,
case statement and doing `case node; when cls1; when cls2; end`. Both of
calling `[cls1, cls2].include?(node.class)` or putting the node into a
classes to see what kind of behavior to perform. Usually this is done by
Sometimes you want to check an instance of a node against a list of
def type :block_parameters_node end