diff --git a/Gemfile.lock b/Gemfile.lock index de756b8e83..890bee5d1b 100644 --- a/Gemfile.lock +++ b/Gemfile.lock @@ -39,7 +39,7 @@ GEM prettyprint prettier_print (1.2.1) prettyprint (0.2.0) - prism (1.4.0) + prism (1.6.0) psych (5.2.6) date stringio @@ -174,7 +174,7 @@ CHECKSUMS pp (0.6.2) sha256=947ec3120c6f92195f8ee8aa25a7b2c5297bb106d83b41baa02983686577b6ff prettier_print (1.2.1) sha256=a72838b5f23facff21f90a5423cdcdda19e4271092b41f4ea7f50b83929e6ff9 prettyprint (0.2.0) sha256=2bc9e15581a94742064a3cc8b0fb9d45aae3d03a1baa6ef80922627a0766f193 - prism (1.4.0) sha256=dc0e3e00e93160213dc2a65519d9002a4a1e7b962db57d444cf1a71565bb703e + prism (1.6.0) sha256=bfc0281a81718c4872346bc858dc84abd3a60cae78336c65ad35c8fbff641c6b psych (5.2.6) sha256=814328aa5dcb6d604d32126a20bc1cbcf05521a5b49dbb1a8b30a07e580f316e racc (1.8.1) sha256=4a7f6929691dbec8b5209a0b373bc2614882b55fc5d2e447a21aaa691303d62f rainbow (3.1.1) sha256=039491aa3a89f42efa1d6dec2fc4e62ede96eb6acd95e52f1ad581182b79bc6a diff --git a/sorbet/rbi/gems/prism@1.4.0.rbi b/sorbet/rbi/gems/prism@1.6.0.rbi similarity index 78% rename from sorbet/rbi/gems/prism@1.4.0.rbi rename to sorbet/rbi/gems/prism@1.6.0.rbi index 422935e8e2..e0e533552c 100644 --- a/sorbet/rbi/gems/prism@1.4.0.rbi +++ b/sorbet/rbi/gems/prism@1.6.0.rbi @@ -34,22 +34,22 @@ class Parser::Base; end # "Parsing Ruby is suddenly manageable!" # - You, hopefully # -# source://prism//lib/prism.rb#8 +# source://prism//lib/prism.rb#9 module Prism class << self # Mirror the Prism.dump API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def dump(*_arg0); end # Mirror the Prism.dump_file API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def dump_file(*_arg0); end # Mirror the Prism.lex API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def lex(*_arg0); end # :call-seq: @@ -61,13 +61,13 @@ module Prism # # For supported options, see Prism::parse. # - # source://prism//lib/prism.rb#47 + # source://prism//lib/prism.rb#69 sig { params(source: String, options: T::Hash[Symbol, T.untyped]).returns(Prism::LexCompat::Result) } def lex_compat(source, **options); end # Mirror the Prism.lex_file API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def lex_file(*_arg0); end # :call-seq: @@ -77,7 +77,7 @@ module Prism # returns the same tokens. Raises SyntaxError if the syntax in source is # invalid. # - # source://prism//lib/prism.rb#57 + # source://prism//lib/prism.rb#79 sig { params(source: String).returns(T::Array[T.untyped]) } def lex_ripper(source); end @@ -86,92 +86,92 @@ module Prism # # Load the serialized AST using the source as a reference into a tree. # - # source://prism//lib/prism.rb#65 + # source://prism//lib/prism.rb#87 sig { params(source: String, serialized: String, freeze: T.nilable(T::Boolean)).returns(Prism::ParseResult) } def load(source, serialized, freeze = T.unsafe(nil)); end # Mirror the Prism.parse API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse(*_arg0); end # Mirror the Prism.parse_comments API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_comments(*_arg0); end # Mirror the Prism.parse_failure? API by using the serialization API. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_failure?(*_arg0); end # Mirror the Prism.parse_file API by using the serialization API. This uses # native strings instead of Ruby strings because it allows us to use mmap # when it is available. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_file(*_arg0); end # Mirror the Prism.parse_file_comments API by using the serialization # API. This uses native strings instead of Ruby strings because it allows us # to use mmap when it is available. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_file_comments(*_arg0); end # Mirror the Prism.parse_file_failure? API by using the serialization API. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_file_failure?(*_arg0); end # Mirror the Prism.parse_file_success? API by using the serialization API. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_file_success?(*_arg0); end # Mirror the Prism.parse_lex API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_lex(*_arg0); end # Mirror the Prism.parse_lex_file API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_lex_file(*_arg0); end # Mirror the Prism.parse_stream API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_stream(*_arg0); end # Mirror the Prism.parse_success? API by using the serialization API. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse_success?(*_arg0); end # Mirror the Prism.profile API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def profile(*_arg0); end # Mirror the Prism.profile_file API by using the serialization API. # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def profile_file(*_arg0); end # Create a new scope with the given locals and forwarding options that is # suitable for passing into one of the Prism.* methods that accepts the # `scopes` option. # - # source://prism//lib/prism/parse_result.rb#907 + # source://prism//lib/prism/parse_result.rb#908 sig { params(locals: T::Array[Symbol], forwarding: T::Array[Symbol]).returns(Prism::Scope) } def scope(locals: T.unsafe(nil), forwarding: T.unsafe(nil)); end end @@ -186,17 +186,17 @@ end # eagerly converted to UTF-8, this class will be used as well. This is because # at that point we will treat everything as single-byte characters. # -# source://prism//lib/prism/parse_result.rb#253 +# source://prism//lib/prism/parse_result.rb#254 class Prism::ASCIISource < ::Prism::Source # Return the column number in characters for the given byte offset. # - # source://prism//lib/prism/parse_result.rb#260 + # source://prism//lib/prism/parse_result.rb#261 sig { params(byte_offset: Integer).returns(Integer) } def character_column(byte_offset); end # Return the character offset for the given byte offset. # - # source://prism//lib/prism/parse_result.rb#255 + # source://prism//lib/prism/parse_result.rb#256 sig { params(byte_offset: Integer).returns(Integer) } def character_offset(byte_offset); end @@ -204,7 +204,7 @@ class Prism::ASCIISource < ::Prism::Source # same interface. We can do this because code units are always equivalent to # byte offsets for ASCII-only sources. # - # source://prism//lib/prism/parse_result.rb#277 + # source://prism//lib/prism/parse_result.rb#278 sig do params( encoding: Encoding @@ -216,7 +216,7 @@ class Prism::ASCIISource < ::Prism::Source # `code_units_offset`, which is a more expensive operation. This is # essentially the same as `Prism::Source#column`. # - # source://prism//lib/prism/parse_result.rb#284 + # source://prism//lib/prism/parse_result.rb#285 sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } def code_units_column(byte_offset, encoding); end @@ -227,7 +227,7 @@ class Prism::ASCIISource < ::Prism::Source # concept of code units that differs from the number of characters in other # encodings, it is not captured here. # - # source://prism//lib/prism/parse_result.rb#270 + # source://prism//lib/prism/parse_result.rb#271 sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } def code_units_offset(byte_offset, encoding); end end @@ -237,13 +237,13 @@ end # alias $foo $bar # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#316 +# source://prism//lib/prism/node.rb#319 class Prism::AliasGlobalVariableNode < ::Prism::Node # Initialize a new AliasGlobalVariableNode node. # # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#318 + # source://prism//lib/prism/node.rb#321 sig do params( source: Prism::Source, @@ -260,36 +260,36 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#411 + # source://prism//lib/prism/node.rb#414 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#329 + # source://prism//lib/prism/node.rb#332 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#334 + # source://prism//lib/prism/node.rb#337 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#344 + # source://prism//lib/prism/node.rb#347 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#339 + # source://prism//lib/prism/node.rb#342 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, ?old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, ?keyword_loc: Location) -> AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#349 + # source://prism//lib/prism/node.rb#352 sig do params( node_id: Integer, @@ -302,16 +302,16 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), new_name: T.unsafe(nil), old_name: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#354 + # source://prism//lib/prism/node.rb#357 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode, old_name: GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | SymbolNode | MissingNode, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#357 + # source://prism//lib/prism/node.rb#360 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -320,13 +320,13 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#395 + # source://prism//lib/prism/node.rb#398 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#390 + # source://prism//lib/prism/node.rb#393 sig { returns(String) } def keyword; end @@ -335,7 +335,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^^ # - # source://prism//lib/prism/node.rb#377 + # source://prism//lib/prism/node.rb#380 sig { returns(Prism::Location) } def keyword_loc; end @@ -344,7 +344,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^ # - # source://prism//lib/prism/node.rb#365 + # source://prism//lib/prism/node.rb#368 sig { returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)) } def new_name; end @@ -353,7 +353,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # alias $foo $bar # ^^^^ # - # source://prism//lib/prism/node.rb#371 + # source://prism//lib/prism/node.rb#374 sig do returns(T.any(Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::SymbolNode, Prism::MissingNode)) end @@ -362,19 +362,19 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#385 + # source://prism//lib/prism/node.rb#388 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#400 + # source://prism//lib/prism/node.rb#403 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#405 + # source://prism//lib/prism/node.rb#408 def type; end end end @@ -384,13 +384,13 @@ end # alias foo bar # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#423 +# source://prism//lib/prism/node.rb#426 class Prism::AliasMethodNode < ::Prism::Node # Initialize a new AliasMethodNode node. # # @return [AliasMethodNode] a new instance of AliasMethodNode # - # source://prism//lib/prism/node.rb#425 + # source://prism//lib/prism/node.rb#428 sig do params( source: Prism::Source, @@ -407,36 +407,36 @@ class Prism::AliasMethodNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#530 + # source://prism//lib/prism/node.rb#533 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#436 + # source://prism//lib/prism/node.rb#439 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#441 + # source://prism//lib/prism/node.rb#444 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#451 + # source://prism//lib/prism/node.rb#454 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#446 + # source://prism//lib/prism/node.rb#449 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?new_name: SymbolNode | InterpolatedSymbolNode, ?old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, ?keyword_loc: Location) -> AliasMethodNode # - # source://prism//lib/prism/node.rb#456 + # source://prism//lib/prism/node.rb#459 sig do params( node_id: Integer, @@ -449,16 +449,16 @@ class Prism::AliasMethodNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), new_name: T.unsafe(nil), old_name: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#461 + # source://prism//lib/prism/node.rb#464 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, new_name: SymbolNode | InterpolatedSymbolNode, old_name: SymbolNode | InterpolatedSymbolNode | GlobalVariableReadNode | MissingNode, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#464 + # source://prism//lib/prism/node.rb#467 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -467,13 +467,13 @@ class Prism::AliasMethodNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#514 + # source://prism//lib/prism/node.rb#517 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#509 + # source://prism//lib/prism/node.rb#512 sig { returns(String) } def keyword; end @@ -482,7 +482,7 @@ class Prism::AliasMethodNode < ::Prism::Node # alias foo bar # ^^^^^ # - # source://prism//lib/prism/node.rb#496 + # source://prism//lib/prism/node.rb#499 sig { returns(Prism::Location) } def keyword_loc; end @@ -497,7 +497,7 @@ class Prism::AliasMethodNode < ::Prism::Node # alias :"#{foo}" :"#{bar}" # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#478 + # source://prism//lib/prism/node.rb#481 sig { returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)) } def new_name; end @@ -512,7 +512,7 @@ class Prism::AliasMethodNode < ::Prism::Node # alias :"#{foo}" :"#{bar}" # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#490 + # source://prism//lib/prism/node.rb#493 sig do returns(T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode, Prism::GlobalVariableReadNode, Prism::MissingNode)) end @@ -521,19 +521,19 @@ class Prism::AliasMethodNode < ::Prism::Node # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#504 + # source://prism//lib/prism/node.rb#507 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#519 + # source://prism//lib/prism/node.rb#522 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#524 + # source://prism//lib/prism/node.rb#527 def type; end end end @@ -543,13 +543,13 @@ end # foo => bar | baz # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#542 +# source://prism//lib/prism/node.rb#545 class Prism::AlternationPatternNode < ::Prism::Node # Initialize a new AlternationPatternNode node. # # @return [AlternationPatternNode] a new instance of AlternationPatternNode # - # source://prism//lib/prism/node.rb#544 + # source://prism//lib/prism/node.rb#547 sig do params( source: Prism::Source, @@ -566,36 +566,36 @@ class Prism::AlternationPatternNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#637 + # source://prism//lib/prism/node.rb#640 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#555 + # source://prism//lib/prism/node.rb#558 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#560 + # source://prism//lib/prism/node.rb#563 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#570 + # source://prism//lib/prism/node.rb#573 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#565 + # source://prism//lib/prism/node.rb#568 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AlternationPatternNode # - # source://prism//lib/prism/node.rb#575 + # source://prism//lib/prism/node.rb#578 sig do params( node_id: Integer, @@ -608,16 +608,16 @@ class Prism::AlternationPatternNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#580 + # source://prism//lib/prism/node.rb#583 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#583 + # source://prism//lib/prism/node.rb#586 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -626,7 +626,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#621 + # source://prism//lib/prism/node.rb#624 sig { override.returns(String) } def inspect; end @@ -635,13 +635,13 @@ class Prism::AlternationPatternNode < ::Prism::Node # foo => bar | baz # ^^^ # - # source://prism//lib/prism/node.rb#591 + # source://prism//lib/prism/node.rb#594 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#616 + # source://prism//lib/prism/node.rb#619 sig { returns(String) } def operator; end @@ -650,7 +650,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # foo => bar | baz # ^ # - # source://prism//lib/prism/node.rb#603 + # source://prism//lib/prism/node.rb#606 sig { returns(Prism::Location) } def operator_loc; end @@ -659,26 +659,26 @@ class Prism::AlternationPatternNode < ::Prism::Node # foo => bar | baz # ^^^ # - # source://prism//lib/prism/node.rb#597 + # source://prism//lib/prism/node.rb#600 sig { returns(Prism::Node) } def right; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#611 + # source://prism//lib/prism/node.rb#614 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#626 + # source://prism//lib/prism/node.rb#629 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#631 + # source://prism//lib/prism/node.rb#634 def type; end end end @@ -688,13 +688,13 @@ end # left and right # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#649 +# source://prism//lib/prism/node.rb#652 class Prism::AndNode < ::Prism::Node # Initialize a new AndNode node. # # @return [AndNode] a new instance of AndNode # - # source://prism//lib/prism/node.rb#651 + # source://prism//lib/prism/node.rb#654 sig do params( source: Prism::Source, @@ -711,36 +711,36 @@ class Prism::AndNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#750 + # source://prism//lib/prism/node.rb#753 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#662 + # source://prism//lib/prism/node.rb#665 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#667 + # source://prism//lib/prism/node.rb#670 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#677 + # source://prism//lib/prism/node.rb#680 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#672 + # source://prism//lib/prism/node.rb#675 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> AndNode # - # source://prism//lib/prism/node.rb#682 + # source://prism//lib/prism/node.rb#685 sig do params( node_id: Integer, @@ -753,16 +753,16 @@ class Prism::AndNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#687 + # source://prism//lib/prism/node.rb#690 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#690 + # source://prism//lib/prism/node.rb#693 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -771,7 +771,7 @@ class Prism::AndNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#734 + # source://prism//lib/prism/node.rb#737 sig { override.returns(String) } def inspect; end @@ -783,13 +783,13 @@ class Prism::AndNode < ::Prism::Node # 1 && 2 # ^ # - # source://prism//lib/prism/node.rb#701 + # source://prism//lib/prism/node.rb#704 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#729 + # source://prism//lib/prism/node.rb#732 sig { returns(String) } def operator; end @@ -798,7 +798,7 @@ class Prism::AndNode < ::Prism::Node # left and right # ^^^ # - # source://prism//lib/prism/node.rb#716 + # source://prism//lib/prism/node.rb#719 sig { returns(Prism::Location) } def operator_loc; end @@ -810,26 +810,26 @@ class Prism::AndNode < ::Prism::Node # 1 and 2 # ^ # - # source://prism//lib/prism/node.rb#710 + # source://prism//lib/prism/node.rb#713 sig { returns(Prism::Node) } def right; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#724 + # source://prism//lib/prism/node.rb#727 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#739 + # source://prism//lib/prism/node.rb#742 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#744 + # source://prism//lib/prism/node.rb#747 def type; end end end @@ -839,13 +839,13 @@ end # return foo, bar, baz # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#762 +# source://prism//lib/prism/node.rb#765 class Prism::ArgumentsNode < ::Prism::Node # Initialize a new ArgumentsNode node. # # @return [ArgumentsNode] a new instance of ArgumentsNode # - # source://prism//lib/prism/node.rb#764 + # source://prism//lib/prism/node.rb#767 sig do params( source: Prism::Source, @@ -860,12 +860,12 @@ class Prism::ArgumentsNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#853 + # source://prism//lib/prism/node.rb#856 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#773 + # source://prism//lib/prism/node.rb#776 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -874,25 +874,25 @@ class Prism::ArgumentsNode < ::Prism::Node # foo(bar, baz) # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#834 + # source://prism//lib/prism/node.rb#837 sig { returns(T::Array[Prism::Node]) } def arguments; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#778 + # source://prism//lib/prism/node.rb#781 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#788 + # source://prism//lib/prism/node.rb#791 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#783 + # source://prism//lib/prism/node.rb#786 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -900,7 +900,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#806 + # source://prism//lib/prism/node.rb#809 sig { returns(T::Boolean) } def contains_forwarding?; end @@ -908,7 +908,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#816 + # source://prism//lib/prism/node.rb#819 sig { returns(T::Boolean) } def contains_keyword_splat?; end @@ -916,7 +916,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#811 + # source://prism//lib/prism/node.rb#814 sig { returns(T::Boolean) } def contains_keywords?; end @@ -924,7 +924,7 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#826 + # source://prism//lib/prism/node.rb#829 sig { returns(T::Boolean) } def contains_multiple_splats?; end @@ -932,13 +932,13 @@ class Prism::ArgumentsNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#821 + # source://prism//lib/prism/node.rb#824 sig { returns(T::Boolean) } def contains_splat?; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: Array[Prism::node]) -> ArgumentsNode # - # source://prism//lib/prism/node.rb#793 + # source://prism//lib/prism/node.rb#796 sig do params( node_id: Integer, @@ -949,16 +949,16 @@ class Prism::ArgumentsNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), arguments: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#798 + # source://prism//lib/prism/node.rb#801 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: Array[Prism::node] } # - # source://prism//lib/prism/node.rb#801 + # source://prism//lib/prism/node.rb#804 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -967,52 +967,52 @@ class Prism::ArgumentsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#837 + # source://prism//lib/prism/node.rb#840 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#842 + # source://prism//lib/prism/node.rb#845 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#847 + # source://prism//lib/prism/node.rb#850 def type; end end end # Flags for arguments nodes. # -# source://prism//lib/prism/node.rb#18459 +# source://prism//lib/prism/node.rb#18630 module Prism::ArgumentsNodeFlags; end # if the arguments contain forwarding # -# source://prism//lib/prism/node.rb#18461 +# source://prism//lib/prism/node.rb#18632 Prism::ArgumentsNodeFlags::CONTAINS_FORWARDING = T.let(T.unsafe(nil), Integer) # if the arguments contain keywords # -# source://prism//lib/prism/node.rb#18464 +# source://prism//lib/prism/node.rb#18635 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORDS = T.let(T.unsafe(nil), Integer) # if the arguments contain a keyword splat # -# source://prism//lib/prism/node.rb#18467 +# source://prism//lib/prism/node.rb#18638 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer) # if the arguments contain multiple splats # -# source://prism//lib/prism/node.rb#18473 +# source://prism//lib/prism/node.rb#18644 Prism::ArgumentsNodeFlags::CONTAINS_MULTIPLE_SPLATS = T.let(T.unsafe(nil), Integer) # if the arguments contain a splat # -# source://prism//lib/prism/node.rb#18470 +# source://prism//lib/prism/node.rb#18641 Prism::ArgumentsNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i. @@ -1020,13 +1020,13 @@ Prism::ArgumentsNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # [1, 2, 3] # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#865 +# source://prism//lib/prism/node.rb#868 class Prism::ArrayNode < ::Prism::Node # Initialize a new ArrayNode node. # # @return [ArrayNode] a new instance of ArrayNode # - # source://prism//lib/prism/node.rb#867 + # source://prism//lib/prism/node.rb#870 sig do params( source: Prism::Source, @@ -1043,24 +1043,24 @@ class Prism::ArrayNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#993 + # source://prism//lib/prism/node.rb#996 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#878 + # source://prism//lib/prism/node.rb#881 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#883 + # source://prism//lib/prism/node.rb#886 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#972 + # source://prism//lib/prism/node.rb#975 sig { returns(T.nilable(String)) } def closing; end @@ -1071,19 +1071,19 @@ class Prism::ArrayNode < ::Prism::Node # %I(apple orange banana) # ")" # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#948 + # source://prism//lib/prism/node.rb#951 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#893 + # source://prism//lib/prism/node.rb#896 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#888 + # source://prism//lib/prism/node.rb#891 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -1091,13 +1091,13 @@ class Prism::ArrayNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#911 + # source://prism//lib/prism/node.rb#914 sig { returns(T::Boolean) } def contains_splat?; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayNode # - # source://prism//lib/prism/node.rb#898 + # source://prism//lib/prism/node.rb#901 sig do params( node_id: Integer, @@ -1110,22 +1110,22 @@ class Prism::ArrayNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), elements: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#903 + # source://prism//lib/prism/node.rb#906 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location? } # - # source://prism//lib/prism/node.rb#906 + # source://prism//lib/prism/node.rb#909 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Represent the list of zero or more [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression) within the array. # - # source://prism//lib/prism/node.rb#916 + # source://prism//lib/prism/node.rb#919 sig { returns(T::Array[Prism::Node]) } def elements; end @@ -1134,13 +1134,13 @@ class Prism::ArrayNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#977 + # source://prism//lib/prism/node.rb#980 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#967 + # source://prism//lib/prism/node.rb#970 sig { returns(T.nilable(String)) } def opening; end @@ -1151,44 +1151,44 @@ class Prism::ArrayNode < ::Prism::Node # %I(apple orange banana) # "%I(" # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#924 + # source://prism//lib/prism/node.rb#927 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#962 + # source://prism//lib/prism/node.rb#965 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#938 + # source://prism//lib/prism/node.rb#941 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#982 + # source://prism//lib/prism/node.rb#985 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#987 + # source://prism//lib/prism/node.rb#990 def type; end end end # Flags for array nodes. # -# source://prism//lib/prism/node.rb#18477 +# source://prism//lib/prism/node.rb#18648 module Prism::ArrayNodeFlags; end # if array contains splat nodes # -# source://prism//lib/prism/node.rb#18479 +# source://prism//lib/prism/node.rb#18650 Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array pattern in pattern matching. @@ -1208,20 +1208,20 @@ Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # foo in Bar[1, 2, 3] # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1019 +# source://prism//lib/prism/node.rb#1022 class Prism::ArrayPatternNode < ::Prism::Node # Initialize a new ArrayPatternNode node. # # @return [ArrayPatternNode] a new instance of ArrayPatternNode # - # source://prism//lib/prism/node.rb#1021 + # source://prism//lib/prism/node.rb#1024 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), requireds: T::Array[Prism::Node], rest: T.nilable(Prism::Node), posts: T::Array[Prism::Node], @@ -1234,24 +1234,24 @@ class Prism::ArrayPatternNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1164 + # source://prism//lib/prism/node.rb#1176 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1035 + # source://prism//lib/prism/node.rb#1038 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1040 + # source://prism//lib/prism/node.rb#1043 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#1143 + # source://prism//lib/prism/node.rb#1155 sig { returns(T.nilable(String)) } def closing; end @@ -1260,37 +1260,46 @@ class Prism::ArrayPatternNode < ::Prism::Node # foo in [1, 2] # ^ # - # source://prism//lib/prism/node.rb#1119 + # source://prism//lib/prism/node.rb#1131 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1055 + # source://prism//lib/prism/node.rb#1058 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1045 + # source://prism//lib/prism/node.rb#1048 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: ConstantReadNode | ConstantPathNode | nil + # Represents the optional constant preceding the Array + # + # foo in Bar[] + # ^^^ + # + # foo in Bar[1, 2, 3] + # ^^^ + # + # foo in Bar::Baz[1, 2, 3] + # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#1073 - sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) } + # source://prism//lib/prism/node.rb#1085 + sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) } def constant; end - # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayPatternNode + # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?) -> ArrayPatternNode # - # source://prism//lib/prism/node.rb#1060 + # source://prism//lib/prism/node.rb#1063 sig do params( node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), requireds: T::Array[Prism::Node], rest: T.nilable(Prism::Node), posts: T::Array[Prism::Node], @@ -1300,16 +1309,16 @@ class Prism::ArrayPatternNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), constant: T.unsafe(nil), requireds: T.unsafe(nil), rest: T.unsafe(nil), posts: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1065 + # source://prism//lib/prism/node.rb#1068 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location? } + # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location? } # - # source://prism//lib/prism/node.rb#1068 + # source://prism//lib/prism/node.rb#1071 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1318,13 +1327,13 @@ class Prism::ArrayPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1148 + # source://prism//lib/prism/node.rb#1160 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#1138 + # source://prism//lib/prism/node.rb#1150 sig { returns(T.nilable(String)) } def opening; end @@ -1333,7 +1342,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # foo in [1, 2] # ^ # - # source://prism//lib/prism/node.rb#1097 + # source://prism//lib/prism/node.rb#1109 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -1342,7 +1351,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # foo in *bar, baz # ^^^ # - # source://prism//lib/prism/node.rb#1091 + # source://prism//lib/prism/node.rb#1103 sig { returns(T::Array[Prism::Node]) } def posts; end @@ -1351,7 +1360,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # foo in [1, 2] # ^ ^ # - # source://prism//lib/prism/node.rb#1079 + # source://prism//lib/prism/node.rb#1091 sig { returns(T::Array[Prism::Node]) } def requireds; end @@ -1360,32 +1369,32 @@ class Prism::ArrayPatternNode < ::Prism::Node # foo in *bar # ^^^^ # - # source://prism//lib/prism/node.rb#1085 + # source://prism//lib/prism/node.rb#1097 sig { returns(T.nilable(Prism::Node)) } def rest; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1133 + # source://prism//lib/prism/node.rb#1145 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1111 + # source://prism//lib/prism/node.rb#1123 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1153 + # source://prism//lib/prism/node.rb#1165 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1158 + # source://prism//lib/prism/node.rb#1170 def type; end end end @@ -1395,13 +1404,13 @@ end # { a => b } # ^^^^^^ # -# source://prism//lib/prism/node.rb#1181 +# source://prism//lib/prism/node.rb#1193 class Prism::AssocNode < ::Prism::Node # Initialize a new AssocNode node. # # @return [AssocNode] a new instance of AssocNode # - # source://prism//lib/prism/node.rb#1183 + # source://prism//lib/prism/node.rb#1195 sig do params( source: Prism::Source, @@ -1418,36 +1427,36 @@ class Prism::AssocNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1291 + # source://prism//lib/prism/node.rb#1303 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1194 + # source://prism//lib/prism/node.rb#1206 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1199 + # source://prism//lib/prism/node.rb#1211 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1209 + # source://prism//lib/prism/node.rb#1221 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1204 + # source://prism//lib/prism/node.rb#1216 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?key: Prism::node, ?value: Prism::node, ?operator_loc: Location?) -> AssocNode # - # source://prism//lib/prism/node.rb#1214 + # source://prism//lib/prism/node.rb#1226 sig do params( node_id: Integer, @@ -1460,16 +1469,16 @@ class Prism::AssocNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), key: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1219 + # source://prism//lib/prism/node.rb#1231 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, key: Prism::node, value: Prism::node, operator_loc: Location? } # - # source://prism//lib/prism/node.rb#1222 + # source://prism//lib/prism/node.rb#1234 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1478,7 +1487,7 @@ class Prism::AssocNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1275 + # source://prism//lib/prism/node.rb#1287 sig { override.returns(String) } def inspect; end @@ -1493,13 +1502,13 @@ class Prism::AssocNode < ::Prism::Node # { def a; end => 1 } # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#1236 + # source://prism//lib/prism/node.rb#1248 sig { returns(Prism::Node) } def key; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#1270 + # source://prism//lib/prism/node.rb#1282 sig { returns(T.nilable(String)) } def operator; end @@ -1508,19 +1517,19 @@ class Prism::AssocNode < ::Prism::Node # { foo => bar } # ^^ # - # source://prism//lib/prism/node.rb#1251 + # source://prism//lib/prism/node.rb#1263 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1265 + # source://prism//lib/prism/node.rb#1277 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1280 + # source://prism//lib/prism/node.rb#1292 sig { override.returns(Symbol) } def type; end @@ -1532,14 +1541,14 @@ class Prism::AssocNode < ::Prism::Node # { x: 1 } # ^ # - # source://prism//lib/prism/node.rb#1245 + # source://prism//lib/prism/node.rb#1257 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1285 + # source://prism//lib/prism/node.rb#1297 def type; end end end @@ -1549,13 +1558,13 @@ end # { **foo } # ^^^^^ # -# source://prism//lib/prism/node.rb#1303 +# source://prism//lib/prism/node.rb#1315 class Prism::AssocSplatNode < ::Prism::Node # Initialize a new AssocSplatNode node. # # @return [AssocSplatNode] a new instance of AssocSplatNode # - # source://prism//lib/prism/node.rb#1305 + # source://prism//lib/prism/node.rb#1317 sig do params( source: Prism::Source, @@ -1571,36 +1580,36 @@ class Prism::AssocSplatNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1393 + # source://prism//lib/prism/node.rb#1405 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1315 + # source://prism//lib/prism/node.rb#1327 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1320 + # source://prism//lib/prism/node.rb#1332 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1332 + # source://prism//lib/prism/node.rb#1344 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1325 + # source://prism//lib/prism/node.rb#1337 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node?, ?operator_loc: Location) -> AssocSplatNode # - # source://prism//lib/prism/node.rb#1337 + # source://prism//lib/prism/node.rb#1349 sig do params( node_id: Integer, @@ -1612,16 +1621,16 @@ class Prism::AssocSplatNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1342 + # source://prism//lib/prism/node.rb#1354 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#1345 + # source://prism//lib/prism/node.rb#1357 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1630,13 +1639,13 @@ class Prism::AssocSplatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1377 + # source://prism//lib/prism/node.rb#1389 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1372 + # source://prism//lib/prism/node.rb#1384 sig { returns(String) } def operator; end @@ -1645,19 +1654,19 @@ class Prism::AssocSplatNode < ::Prism::Node # { **x } # ^^ # - # source://prism//lib/prism/node.rb#1359 + # source://prism//lib/prism/node.rb#1371 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1367 + # source://prism//lib/prism/node.rb#1379 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1382 + # source://prism//lib/prism/node.rb#1394 sig { override.returns(Symbol) } def type; end @@ -1666,21 +1675,21 @@ class Prism::AssocSplatNode < ::Prism::Node # { **foo } # ^^^ # - # source://prism//lib/prism/node.rb#1353 + # source://prism//lib/prism/node.rb#1365 sig { returns(T.nilable(Prism::Node)) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1387 + # source://prism//lib/prism/node.rb#1399 def type; end end end # The FFI backend is used on other Ruby implementations. # -# source://prism//lib/prism.rb#81 +# source://prism//lib/prism.rb#104 Prism::BACKEND = T.let(T.unsafe(nil), Symbol) # Represents reading a reference to a field in the previous match. @@ -1688,49 +1697,49 @@ Prism::BACKEND = T.let(T.unsafe(nil), Symbol) # $' # ^^ # -# source://prism//lib/prism/node.rb#1404 +# source://prism//lib/prism/node.rb#1416 class Prism::BackReferenceReadNode < ::Prism::Node # Initialize a new BackReferenceReadNode node. # # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1406 + # source://prism//lib/prism/node.rb#1418 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1471 + # source://prism//lib/prism/node.rb#1483 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1415 + # source://prism//lib/prism/node.rb#1427 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1420 + # source://prism//lib/prism/node.rb#1432 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1430 + # source://prism//lib/prism/node.rb#1442 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1425 + # source://prism//lib/prism/node.rb#1437 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1435 + # source://prism//lib/prism/node.rb#1447 sig do params( node_id: Integer, @@ -1741,16 +1750,16 @@ class Prism::BackReferenceReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1440 + # source://prism//lib/prism/node.rb#1452 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#1443 + # source://prism//lib/prism/node.rb#1455 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1759,7 +1768,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1455 + # source://prism//lib/prism/node.rb#1467 sig { override.returns(String) } def inspect; end @@ -1769,20 +1778,20 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # $+ # name `:$+` # - # source://prism//lib/prism/node.rb#1452 + # source://prism//lib/prism/node.rb#1464 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1460 + # source://prism//lib/prism/node.rb#1472 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1465 + # source://prism//lib/prism/node.rb#1477 def type; end end end @@ -1792,24 +1801,24 @@ end # implement each one that they need. For a default implementation that # continues walking the tree, see the Visitor class. # -# source://prism//lib/prism/visitor.rb#14 +# source://prism//lib/prism/visitor.rb#17 class Prism::BasicVisitor # Calls `accept` on the given node if it is not `nil`, which in turn should # call back into this visitor by calling the appropriate `visit_*` method. # - # source://prism//lib/prism/visitor.rb#17 + # source://prism//lib/prism/visitor.rb#20 sig { params(node: T.nilable(Prism::Node)).void } def visit(node); end # Visits each node in `nodes` by calling `accept` on each one. # - # source://prism//lib/prism/visitor.rb#23 + # source://prism//lib/prism/visitor.rb#26 sig { params(nodes: T::Array[T.nilable(Prism::Node)]).void } def visit_all(nodes); end # Visits the child nodes of `node` by calling `accept` on each one. # - # source://prism//lib/prism/visitor.rb#29 + # source://prism//lib/prism/visitor.rb#32 sig { params(node: Prism::Node).void } def visit_child_nodes(node); end end @@ -1821,13 +1830,13 @@ end # end # ^^^^^ # -# source://prism//lib/prism/node.rb#1483 +# source://prism//lib/prism/node.rb#1495 class Prism::BeginNode < ::Prism::Node # Initialize a new BeginNode node. # # @return [BeginNode] a new instance of BeginNode # - # source://prism//lib/prism/node.rb#1485 + # source://prism//lib/prism/node.rb#1497 sig do params( source: Prism::Source, @@ -1847,18 +1856,18 @@ class Prism::BeginNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1631 + # source://prism//lib/prism/node.rb#1643 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1499 + # source://prism//lib/prism/node.rb#1511 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def begin_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1605 + # source://prism//lib/prism/node.rb#1617 sig { returns(T.nilable(String)) } def begin_keyword; end @@ -1867,31 +1876,31 @@ class Prism::BeginNode < ::Prism::Node # begin x end # ^^^^^ # - # source://prism//lib/prism/node.rb#1540 + # source://prism//lib/prism/node.rb#1552 sig { returns(T.nilable(Prism::Location)) } def begin_keyword_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1504 + # source://prism//lib/prism/node.rb#1516 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1519 + # source://prism//lib/prism/node.rb#1531 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1509 + # source://prism//lib/prism/node.rb#1521 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?begin_keyword_loc: Location?, ?statements: StatementsNode?, ?rescue_clause: RescueNode?, ?else_clause: ElseNode?, ?ensure_clause: EnsureNode?, ?end_keyword_loc: Location?) -> BeginNode # - # source://prism//lib/prism/node.rb#1524 + # source://prism//lib/prism/node.rb#1536 sig do params( node_id: Integer, @@ -1907,16 +1916,16 @@ class Prism::BeginNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), begin_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), rescue_clause: T.unsafe(nil), else_clause: T.unsafe(nil), ensure_clause: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1529 + # source://prism//lib/prism/node.rb#1541 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location? } # - # source://prism//lib/prism/node.rb#1532 + # source://prism//lib/prism/node.rb#1544 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -1925,13 +1934,13 @@ class Prism::BeginNode < ::Prism::Node # begin x; rescue y; else z; end # ^^^^^^ # - # source://prism//lib/prism/node.rb#1574 + # source://prism//lib/prism/node.rb#1586 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1610 + # source://prism//lib/prism/node.rb#1622 sig { returns(T.nilable(String)) } def end_keyword; end @@ -1940,7 +1949,7 @@ class Prism::BeginNode < ::Prism::Node # begin x end # ^^^ # - # source://prism//lib/prism/node.rb#1586 + # source://prism//lib/prism/node.rb#1598 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -1949,7 +1958,7 @@ class Prism::BeginNode < ::Prism::Node # begin x; ensure y; end # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#1580 + # source://prism//lib/prism/node.rb#1592 sig { returns(T.nilable(Prism::EnsureNode)) } def ensure_clause; end @@ -1958,11 +1967,11 @@ class Prism::BeginNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1615 + # source://prism//lib/prism/node.rb#1627 sig { override.returns(String) } def inspect; end - # source://prism//lib/prism/parse_result/newlines.rb#79 + # source://prism//lib/prism/parse_result/newlines.rb#80 def newline_flag!(lines); end # Represents the rescue clause within the begin block. @@ -1970,20 +1979,20 @@ class Prism::BeginNode < ::Prism::Node # begin x; rescue y; end # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#1568 + # source://prism//lib/prism/node.rb#1580 sig { returns(T.nilable(Prism::RescueNode)) } def rescue_clause; end # Save the begin_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1554 + # source://prism//lib/prism/node.rb#1566 def save_begin_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1600 + # source://prism//lib/prism/node.rb#1612 def save_end_keyword_loc(repository); end # Represents the statements within the begin block. @@ -1991,20 +2000,20 @@ class Prism::BeginNode < ::Prism::Node # begin x end # ^ # - # source://prism//lib/prism/node.rb#1562 + # source://prism//lib/prism/node.rb#1574 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1620 + # source://prism//lib/prism/node.rb#1632 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1625 + # source://prism//lib/prism/node.rb#1637 def type; end end end @@ -2014,13 +2023,13 @@ end # bar(&args) # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1646 +# source://prism//lib/prism/node.rb#1658 class Prism::BlockArgumentNode < ::Prism::Node # Initialize a new BlockArgumentNode node. # # @return [BlockArgumentNode] a new instance of BlockArgumentNode # - # source://prism//lib/prism/node.rb#1648 + # source://prism//lib/prism/node.rb#1660 sig do params( source: Prism::Source, @@ -2036,36 +2045,36 @@ class Prism::BlockArgumentNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1736 + # source://prism//lib/prism/node.rb#1748 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1658 + # source://prism//lib/prism/node.rb#1670 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1663 + # source://prism//lib/prism/node.rb#1675 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1675 + # source://prism//lib/prism/node.rb#1687 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1668 + # source://prism//lib/prism/node.rb#1680 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node?, ?operator_loc: Location) -> BlockArgumentNode # - # source://prism//lib/prism/node.rb#1680 + # source://prism//lib/prism/node.rb#1692 sig do params( node_id: Integer, @@ -2077,16 +2086,16 @@ class Prism::BlockArgumentNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), expression: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1685 + # source://prism//lib/prism/node.rb#1697 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#1688 + # source://prism//lib/prism/node.rb#1700 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2095,7 +2104,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # foo(&args) # ^^^^^ # - # source://prism//lib/prism/node.rb#1696 + # source://prism//lib/prism/node.rb#1708 sig { returns(T.nilable(Prism::Node)) } def expression; end @@ -2104,13 +2113,13 @@ class Prism::BlockArgumentNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1720 + # source://prism//lib/prism/node.rb#1732 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1715 + # source://prism//lib/prism/node.rb#1727 sig { returns(String) } def operator; end @@ -2119,26 +2128,26 @@ class Prism::BlockArgumentNode < ::Prism::Node # foo(&args) # ^ # - # source://prism//lib/prism/node.rb#1702 + # source://prism//lib/prism/node.rb#1714 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1710 + # source://prism//lib/prism/node.rb#1722 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1725 + # source://prism//lib/prism/node.rb#1737 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1730 + # source://prism//lib/prism/node.rb#1742 def type; end end end @@ -2148,49 +2157,49 @@ end # a { |; b| } # ^ # -# source://prism//lib/prism/node.rb#1747 +# source://prism//lib/prism/node.rb#1759 class Prism::BlockLocalVariableNode < ::Prism::Node # Initialize a new BlockLocalVariableNode node. # # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1749 + # source://prism//lib/prism/node.rb#1761 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1818 + # source://prism//lib/prism/node.rb#1830 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1758 + # source://prism//lib/prism/node.rb#1770 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1763 + # source://prism//lib/prism/node.rb#1775 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1773 + # source://prism//lib/prism/node.rb#1785 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1768 + # source://prism//lib/prism/node.rb#1780 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1778 + # source://prism//lib/prism/node.rb#1790 sig do params( node_id: Integer, @@ -2201,16 +2210,16 @@ class Prism::BlockLocalVariableNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1783 + # source://prism//lib/prism/node.rb#1795 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#1786 + # source://prism//lib/prism/node.rb#1798 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2219,7 +2228,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1802 + # source://prism//lib/prism/node.rb#1814 sig { override.returns(String) } def inspect; end @@ -2228,7 +2237,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # a { |; b| } # name `:b` # ^ # - # source://prism//lib/prism/node.rb#1799 + # source://prism//lib/prism/node.rb#1811 sig { returns(Symbol) } def name; end @@ -2236,20 +2245,20 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#1791 + # source://prism//lib/prism/node.rb#1803 sig { returns(T::Boolean) } def repeated_parameter?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1807 + # source://prism//lib/prism/node.rb#1819 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1812 + # source://prism//lib/prism/node.rb#1824 def type; end end end @@ -2259,13 +2268,13 @@ end # [1, 2, 3].each { |i| puts x } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1829 +# source://prism//lib/prism/node.rb#1841 class Prism::BlockNode < ::Prism::Node # Initialize a new BlockNode node. # # @return [BlockNode] a new instance of BlockNode # - # source://prism//lib/prism/node.rb#1831 + # source://prism//lib/prism/node.rb#1843 sig do params( source: Prism::Source, @@ -2284,12 +2293,12 @@ class Prism::BlockNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#1960 + # source://prism//lib/prism/node.rb#1972 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1844 + # source://prism//lib/prism/node.rb#1856 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -2298,19 +2307,19 @@ class Prism::BlockNode < ::Prism::Node # [1, 2, 3].each { |i| puts x } # ^^^^^^ # - # source://prism//lib/prism/node.rb#1899 + # source://prism//lib/prism/node.rb#1911 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1849 + # source://prism//lib/prism/node.rb#1861 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#1939 + # source://prism//lib/prism/node.rb#1951 sig { returns(String) } def closing; end @@ -2319,25 +2328,25 @@ class Prism::BlockNode < ::Prism::Node # [1, 2, 3].each { |i| puts x } # ^ # - # source://prism//lib/prism/node.rb#1921 + # source://prism//lib/prism/node.rb#1933 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1862 + # source://prism//lib/prism/node.rb#1874 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1854 + # source://prism//lib/prism/node.rb#1866 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil, ?opening_loc: Location, ?closing_loc: Location) -> BlockNode # - # source://prism//lib/prism/node.rb#1867 + # source://prism//lib/prism/node.rb#1879 sig do params( node_id: Integer, @@ -2352,16 +2361,16 @@ class Prism::BlockNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), parameters: T.unsafe(nil), body: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1872 + # source://prism//lib/prism/node.rb#1884 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil, opening_loc: Location, closing_loc: Location } # - # source://prism//lib/prism/node.rb#1875 + # source://prism//lib/prism/node.rb#1887 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2370,7 +2379,7 @@ class Prism::BlockNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#1944 + # source://prism//lib/prism/node.rb#1956 sig { override.returns(String) } def inspect; end @@ -2379,13 +2388,13 @@ class Prism::BlockNode < ::Prism::Node # [1, 2, 3].each { |i| puts x } # locals: [:i] # ^ # - # source://prism//lib/prism/node.rb#1883 + # source://prism//lib/prism/node.rb#1895 sig { returns(T::Array[Symbol]) } def locals; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#1934 + # source://prism//lib/prism/node.rb#1946 sig { returns(String) } def opening; end @@ -2394,7 +2403,7 @@ class Prism::BlockNode < ::Prism::Node # [1, 2, 3].each { |i| puts x } # ^ # - # source://prism//lib/prism/node.rb#1905 + # source://prism//lib/prism/node.rb#1917 sig { returns(Prism::Location) } def opening_loc; end @@ -2407,32 +2416,32 @@ class Prism::BlockNode < ::Prism::Node # [1, 2, 3].each { puts it } # ^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#1893 + # source://prism//lib/prism/node.rb#1905 sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) } def parameters; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1929 + # source://prism//lib/prism/node.rb#1941 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#1913 + # source://prism//lib/prism/node.rb#1925 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#1949 + # source://prism//lib/prism/node.rb#1961 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#1954 + # source://prism//lib/prism/node.rb#1966 def type; end end end @@ -2443,13 +2452,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#1976 +# source://prism//lib/prism/node.rb#1988 class Prism::BlockParameterNode < ::Prism::Node # Initialize a new BlockParameterNode node. # # @return [BlockParameterNode] a new instance of BlockParameterNode # - # source://prism//lib/prism/node.rb#1978 + # source://prism//lib/prism/node.rb#1990 sig do params( source: Prism::Source, @@ -2466,36 +2475,36 @@ class Prism::BlockParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#2094 + # source://prism//lib/prism/node.rb#2106 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1989 + # source://prism//lib/prism/node.rb#2001 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#1994 + # source://prism//lib/prism/node.rb#2006 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2004 + # source://prism//lib/prism/node.rb#2016 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#1999 + # source://prism//lib/prism/node.rb#2011 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> BlockParameterNode # - # source://prism//lib/prism/node.rb#2009 + # source://prism//lib/prism/node.rb#2021 sig do params( node_id: Integer, @@ -2508,16 +2517,16 @@ class Prism::BlockParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2014 + # source://prism//lib/prism/node.rb#2026 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#2017 + # source://prism//lib/prism/node.rb#2029 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2526,7 +2535,7 @@ class Prism::BlockParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#2078 + # source://prism//lib/prism/node.rb#2090 sig { override.returns(String) } def inspect; end @@ -2536,7 +2545,7 @@ class Prism::BlockParameterNode < ::Prism::Node # ^ # end # - # source://prism//lib/prism/node.rb#2031 + # source://prism//lib/prism/node.rb#2043 sig { returns(T.nilable(Symbol)) } def name; end @@ -2545,13 +2554,13 @@ class Prism::BlockParameterNode < ::Prism::Node # def a(&b) # ^ # - # source://prism//lib/prism/node.rb#2037 + # source://prism//lib/prism/node.rb#2049 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#2073 + # source://prism//lib/prism/node.rb#2085 sig { returns(String) } def operator; end @@ -2561,7 +2570,7 @@ class Prism::BlockParameterNode < ::Prism::Node # ^ # end # - # source://prism//lib/prism/node.rb#2060 + # source://prism//lib/prism/node.rb#2072 sig { returns(Prism::Location) } def operator_loc; end @@ -2569,32 +2578,32 @@ class Prism::BlockParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2022 + # source://prism//lib/prism/node.rb#2034 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2051 + # source://prism//lib/prism/node.rb#2063 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2068 + # source://prism//lib/prism/node.rb#2080 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#2083 + # source://prism//lib/prism/node.rb#2095 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#2088 + # source://prism//lib/prism/node.rb#2100 def type; end end end @@ -2608,13 +2617,13 @@ end # ^^^^^^^^^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#2111 +# source://prism//lib/prism/node.rb#2123 class Prism::BlockParametersNode < ::Prism::Node # Initialize a new BlockParametersNode node. # # @return [BlockParametersNode] a new instance of BlockParametersNode # - # source://prism//lib/prism/node.rb#2113 + # source://prism//lib/prism/node.rb#2125 sig do params( source: Prism::Source, @@ -2632,24 +2641,24 @@ class Prism::BlockParametersNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#2259 + # source://prism//lib/prism/node.rb#2271 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2125 + # source://prism//lib/prism/node.rb#2137 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2130 + # source://prism//lib/prism/node.rb#2142 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2238 + # source://prism//lib/prism/node.rb#2250 sig { returns(T.nilable(String)) } def closing; end @@ -2662,25 +2671,25 @@ class Prism::BlockParametersNode < ::Prism::Node # ^ # end # - # source://prism//lib/prism/node.rb#2214 + # source://prism//lib/prism/node.rb#2226 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2143 + # source://prism//lib/prism/node.rb#2155 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2135 + # source://prism//lib/prism/node.rb#2147 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parameters: ParametersNode?, ?locals: Array[BlockLocalVariableNode], ?opening_loc: Location?, ?closing_loc: Location?) -> BlockParametersNode # - # source://prism//lib/prism/node.rb#2148 + # source://prism//lib/prism/node.rb#2160 sig do params( node_id: Integer, @@ -2694,16 +2703,16 @@ class Prism::BlockParametersNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), parameters: T.unsafe(nil), locals: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2153 + # source://prism//lib/prism/node.rb#2165 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parameters: ParametersNode?, locals: Array[BlockLocalVariableNode], opening_loc: Location?, closing_loc: Location? } # - # source://prism//lib/prism/node.rb#2156 + # source://prism//lib/prism/node.rb#2168 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2712,7 +2721,7 @@ class Prism::BlockParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#2243 + # source://prism//lib/prism/node.rb#2255 sig { override.returns(String) } def inspect; end @@ -2725,13 +2734,13 @@ class Prism::BlockParametersNode < ::Prism::Node # ^^^^^ # end # - # source://prism//lib/prism/node.rb#2178 + # source://prism//lib/prism/node.rb#2190 sig { returns(T::Array[Prism::BlockLocalVariableNode]) } def locals; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2233 + # source://prism//lib/prism/node.rb#2245 sig { returns(T.nilable(String)) } def opening; end @@ -2744,7 +2753,7 @@ class Prism::BlockParametersNode < ::Prism::Node # ^ # end # - # source://prism//lib/prism/node.rb#2188 + # source://prism//lib/prism/node.rb#2200 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -2757,32 +2766,32 @@ class Prism::BlockParametersNode < ::Prism::Node # ^^^^^^^^ # end # - # source://prism//lib/prism/node.rb#2168 + # source://prism//lib/prism/node.rb#2180 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2228 + # source://prism//lib/prism/node.rb#2240 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2202 + # source://prism//lib/prism/node.rb#2214 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#2248 + # source://prism//lib/prism/node.rb#2260 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#2253 + # source://prism//lib/prism/node.rb#2265 def type; end end end @@ -2792,13 +2801,13 @@ end # break foo # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2273 +# source://prism//lib/prism/node.rb#2285 class Prism::BreakNode < ::Prism::Node # Initialize a new BreakNode node. # # @return [BreakNode] a new instance of BreakNode # - # source://prism//lib/prism/node.rb#2275 + # source://prism//lib/prism/node.rb#2287 sig do params( source: Prism::Source, @@ -2814,12 +2823,12 @@ class Prism::BreakNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#2363 + # source://prism//lib/prism/node.rb#2375 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2285 + # source://prism//lib/prism/node.rb#2297 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -2828,31 +2837,31 @@ class Prism::BreakNode < ::Prism::Node # break foo # ^^^ # - # source://prism//lib/prism/node.rb#2323 + # source://prism//lib/prism/node.rb#2335 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2290 + # source://prism//lib/prism/node.rb#2302 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2302 + # source://prism//lib/prism/node.rb#2314 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2295 + # source://prism//lib/prism/node.rb#2307 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> BreakNode # - # source://prism//lib/prism/node.rb#2307 + # source://prism//lib/prism/node.rb#2319 sig do params( node_id: Integer, @@ -2864,16 +2873,16 @@ class Prism::BreakNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), arguments: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2312 + # source://prism//lib/prism/node.rb#2324 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#2315 + # source://prism//lib/prism/node.rb#2327 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -2882,13 +2891,13 @@ class Prism::BreakNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#2347 + # source://prism//lib/prism/node.rb#2359 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#2342 + # source://prism//lib/prism/node.rb#2354 sig { returns(String) } def keyword; end @@ -2897,26 +2906,26 @@ class Prism::BreakNode < ::Prism::Node # break foo # ^^^^^ # - # source://prism//lib/prism/node.rb#2329 + # source://prism//lib/prism/node.rb#2341 sig { returns(Prism::Location) } def keyword_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2337 + # source://prism//lib/prism/node.rb#2349 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#2352 + # source://prism//lib/prism/node.rb#2364 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#2357 + # source://prism//lib/prism/node.rb#2369 def type; end end end @@ -2926,13 +2935,13 @@ end # foo.bar &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2374 +# source://prism//lib/prism/node.rb#2386 class Prism::CallAndWriteNode < ::Prism::Node # Initialize a new CallAndWriteNode node. # # @return [CallAndWriteNode] a new instance of CallAndWriteNode # - # source://prism//lib/prism/node.rb#2376 + # source://prism//lib/prism/node.rb#2388 sig do params( source: Prism::Source, @@ -2953,12 +2962,12 @@ class Prism::CallAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#2562 + # source://prism//lib/prism/node.rb#2574 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2391 + # source://prism//lib/prism/node.rb#2403 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -2966,13 +2975,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2437 + # source://prism//lib/prism/node.rb#2449 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2531 + # source://prism//lib/prism/node.rb#2543 sig { returns(T.nilable(String)) } def call_operator; end @@ -2981,31 +2990,31 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # ^ # - # source://prism//lib/prism/node.rb#2456 + # source://prism//lib/prism/node.rb#2468 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2396 + # source://prism//lib/prism/node.rb#2408 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2409 + # source://prism//lib/prism/node.rb#2421 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2401 + # source://prism//lib/prism/node.rb#2413 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallAndWriteNode # - # source://prism//lib/prism/node.rb#2414 + # source://prism//lib/prism/node.rb#2426 sig do params( node_id: Integer, @@ -3022,16 +3031,16 @@ class Prism::CallAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), message_loc: T.unsafe(nil), read_name: T.unsafe(nil), write_name: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2419 + # source://prism//lib/prism/node.rb#2431 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#2422 + # source://prism//lib/prism/node.rb#2434 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3042,19 +3051,19 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2442 + # source://prism//lib/prism/node.rb#2454 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#2546 + # source://prism//lib/prism/node.rb#2558 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2536 + # source://prism//lib/prism/node.rb#2548 sig { returns(T.nilable(String)) } def message; end @@ -3063,13 +3072,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # ^^^ # - # source://prism//lib/prism/node.rb#2478 + # source://prism//lib/prism/node.rb#2490 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#2541 + # source://prism//lib/prism/node.rb#2553 sig { returns(String) } def operator; end @@ -3078,7 +3087,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # ^^^ # - # source://prism//lib/prism/node.rb#2512 + # source://prism//lib/prism/node.rb#2524 sig { returns(Prism::Location) } def operator_loc; end @@ -3087,7 +3096,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # read_name `:bar` # ^^^ # - # source://prism//lib/prism/node.rb#2500 + # source://prism//lib/prism/node.rb#2512 sig { returns(Symbol) } def read_name; end @@ -3096,7 +3105,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # ^^^ # - # source://prism//lib/prism/node.rb#2450 + # source://prism//lib/prism/node.rb#2462 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3104,31 +3113,31 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2427 + # source://prism//lib/prism/node.rb#2439 sig { returns(T::Boolean) } def safe_navigation?; end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2470 + # source://prism//lib/prism/node.rb#2482 def save_call_operator_loc(repository); end # Save the message_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2492 + # source://prism//lib/prism/node.rb#2504 def save_message_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2520 + # source://prism//lib/prism/node.rb#2532 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#2551 + # source://prism//lib/prism/node.rb#2563 sig { override.returns(Symbol) } def type; end @@ -3137,7 +3146,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # ^^^^^ # - # source://prism//lib/prism/node.rb#2528 + # source://prism//lib/prism/node.rb#2540 sig { returns(Prism::Node) } def value; end @@ -3145,7 +3154,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2432 + # source://prism//lib/prism/node.rb#2444 sig { returns(T::Boolean) } def variable_call?; end @@ -3154,14 +3163,14 @@ class Prism::CallAndWriteNode < ::Prism::Node # foo.bar &&= value # write_name `:bar=` # ^^^ # - # source://prism//lib/prism/node.rb#2506 + # source://prism//lib/prism/node.rb#2518 sig { returns(Symbol) } def write_name; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#2556 + # source://prism//lib/prism/node.rb#2568 def type; end end end @@ -3186,13 +3195,13 @@ end # foo&.bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#2594 +# source://prism//lib/prism/node.rb#2606 class Prism::CallNode < ::Prism::Node # Initialize a new CallNode node. # # @return [CallNode] a new instance of CallNode # - # source://prism//lib/prism/node.rb#2596 + # source://prism//lib/prism/node.rb#2608 sig do params( source: Prism::Source, @@ -3214,12 +3223,12 @@ class Prism::CallNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#2825 + # source://prism//lib/prism/node.rb#2837 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2612 + # source://prism//lib/prism/node.rb#2624 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3228,7 +3237,7 @@ class Prism::CallNode < ::Prism::Node # foo(bar) # ^^^ # - # source://prism//lib/prism/node.rb#2758 + # source://prism//lib/prism/node.rb#2770 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -3236,7 +3245,7 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2659 + # source://prism//lib/prism/node.rb#2671 sig { returns(T::Boolean) } def attribute_write?; end @@ -3245,13 +3254,13 @@ class Prism::CallNode < ::Prism::Node # foo { |a| a } # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#2786 + # source://prism//lib/prism/node.rb#2798 sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2789 + # source://prism//lib/prism/node.rb#2801 sig { returns(T.nilable(String)) } def call_operator; end @@ -3263,19 +3272,19 @@ class Prism::CallNode < ::Prism::Node # foo&.bar # ^^ # - # source://prism//lib/prism/node.rb#2687 + # source://prism//lib/prism/node.rb#2699 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2617 + # source://prism//lib/prism/node.rb#2629 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2804 + # source://prism//lib/prism/node.rb#2816 sig { returns(T.nilable(String)) } def closing; end @@ -3284,25 +3293,25 @@ class Prism::CallNode < ::Prism::Node # foo(bar) # ^ # - # source://prism//lib/prism/node.rb#2764 + # source://prism//lib/prism/node.rb#2776 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2631 + # source://prism//lib/prism/node.rb#2643 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2622 + # source://prism//lib/prism/node.rb#2634 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?name: Symbol, ?message_loc: Location?, ?opening_loc: Location?, ?arguments: ArgumentsNode?, ?closing_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> CallNode # - # source://prism//lib/prism/node.rb#2636 + # source://prism//lib/prism/node.rb#2648 sig do params( node_id: Integer, @@ -3320,16 +3329,16 @@ class Prism::CallNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), name: T.unsafe(nil), message_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2641 + # source://prism//lib/prism/node.rb#2653 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, block: BlockNode | BlockArgumentNode | nil } # - # source://prism//lib/prism/node.rb#2644 + # source://prism//lib/prism/node.rb#2656 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3346,7 +3355,7 @@ class Prism::CallNode < ::Prism::Node # sometimes you want the location of the full message including the inner # space and the = sign. This method provides that. # - # source://prism//lib/prism/node_ext.rb#331 + # source://prism//lib/prism/node_ext.rb#334 sig { returns(T.nilable(Prism::Location)) } def full_message_loc; end @@ -3354,19 +3363,19 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2664 + # source://prism//lib/prism/node.rb#2676 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#2809 + # source://prism//lib/prism/node.rb#2821 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2794 + # source://prism//lib/prism/node.rb#2806 sig { returns(T.nilable(String)) } def message; end @@ -3375,7 +3384,7 @@ class Prism::CallNode < ::Prism::Node # foo.bar # ^^^ # - # source://prism//lib/prism/node.rb#2715 + # source://prism//lib/prism/node.rb#2727 sig { returns(T.nilable(Prism::Location)) } def message_loc; end @@ -3384,13 +3393,13 @@ class Prism::CallNode < ::Prism::Node # foo.bar # name `:foo` # ^^^ # - # source://prism//lib/prism/node.rb#2709 + # source://prism//lib/prism/node.rb#2721 sig { returns(Symbol) } def name; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2799 + # source://prism//lib/prism/node.rb#2811 sig { returns(T.nilable(String)) } def opening; end @@ -3398,7 +3407,7 @@ class Prism::CallNode < ::Prism::Node # foo(bar) # ^ # - # source://prism//lib/prism/node.rb#2736 + # source://prism//lib/prism/node.rb#2748 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -3413,7 +3422,7 @@ class Prism::CallNode < ::Prism::Node # foo + bar # ^^^ # - # source://prism//lib/prism/node.rb#2678 + # source://prism//lib/prism/node.rb#2690 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3421,37 +3430,37 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2649 + # source://prism//lib/prism/node.rb#2661 sig { returns(T::Boolean) } def safe_navigation?; end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2701 + # source://prism//lib/prism/node.rb#2713 def save_call_operator_loc(repository); end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2778 + # source://prism//lib/prism/node.rb#2790 def save_closing_loc(repository); end # Save the message_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2729 + # source://prism//lib/prism/node.rb#2741 def save_message_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2750 + # source://prism//lib/prism/node.rb#2762 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#2814 + # source://prism//lib/prism/node.rb#2826 sig { override.returns(Symbol) } def type; end @@ -3459,41 +3468,41 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2654 + # source://prism//lib/prism/node.rb#2666 sig { returns(T::Boolean) } def variable_call?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#2819 + # source://prism//lib/prism/node.rb#2831 def type; end end end # Flags for call nodes. # -# source://prism//lib/prism/node.rb#18483 +# source://prism//lib/prism/node.rb#18654 module Prism::CallNodeFlags; end # a call that is an attribute write, so the value being written should be returned # -# source://prism//lib/prism/node.rb#18491 +# source://prism//lib/prism/node.rb#18662 Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer) # a call that ignores method visibility # -# source://prism//lib/prism/node.rb#18494 +# source://prism//lib/prism/node.rb#18665 Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer) # &. operator # -# source://prism//lib/prism/node.rb#18485 +# source://prism//lib/prism/node.rb#18656 Prism::CallNodeFlags::SAFE_NAVIGATION = T.let(T.unsafe(nil), Integer) # a call that could have been a local variable # -# source://prism//lib/prism/node.rb#18488 +# source://prism//lib/prism/node.rb#18659 Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # Represents the use of an assignment operator on a call. @@ -3501,13 +3510,13 @@ Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # foo.bar += baz # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2843 +# source://prism//lib/prism/node.rb#2855 class Prism::CallOperatorWriteNode < ::Prism::Node # Initialize a new CallOperatorWriteNode node. # # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode # - # source://prism//lib/prism/node.rb#2845 + # source://prism//lib/prism/node.rb#2857 sig do params( source: Prism::Source, @@ -3529,12 +3538,12 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3033 + # source://prism//lib/prism/node.rb#3045 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2861 + # source://prism//lib/prism/node.rb#2873 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3542,7 +3551,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2907 + # source://prism//lib/prism/node.rb#2919 sig { returns(T::Boolean) } def attribute_write?; end @@ -3551,7 +3560,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # binary_operator `:+` # ^ # - # source://prism//lib/prism/node.rb#2982 + # source://prism//lib/prism/node.rb#2994 sig { returns(Symbol) } def binary_operator; end @@ -3560,13 +3569,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # ^^ # - # source://prism//lib/prism/node.rb#2988 + # source://prism//lib/prism/node.rb#3000 sig { returns(Prism::Location) } def binary_operator_loc; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#3007 + # source://prism//lib/prism/node.rb#3019 sig { returns(T.nilable(String)) } def call_operator; end @@ -3575,31 +3584,31 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # ^ # - # source://prism//lib/prism/node.rb#2926 + # source://prism//lib/prism/node.rb#2938 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2866 + # source://prism//lib/prism/node.rb#2878 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2879 + # source://prism//lib/prism/node.rb#2891 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#2871 + # source://prism//lib/prism/node.rb#2883 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> CallOperatorWriteNode # - # source://prism//lib/prism/node.rb#2884 + # source://prism//lib/prism/node.rb#2896 sig do params( node_id: Integer, @@ -3617,16 +3626,16 @@ class Prism::CallOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), message_loc: T.unsafe(nil), read_name: T.unsafe(nil), write_name: T.unsafe(nil), binary_operator: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#2889 + # source://prism//lib/prism/node.rb#2901 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#2892 + # source://prism//lib/prism/node.rb#2904 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3637,19 +3646,19 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2912 + # source://prism//lib/prism/node.rb#2924 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3017 + # source://prism//lib/prism/node.rb#3029 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#3012 + # source://prism//lib/prism/node.rb#3024 sig { returns(T.nilable(String)) } def message; end @@ -3658,20 +3667,20 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # ^^^ # - # source://prism//lib/prism/node.rb#2948 + # source://prism//lib/prism/node.rb#2960 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#339 + # source://prism//lib/prism/node_ext.rb#342 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#346 + # source://prism//lib/prism/node_ext.rb#349 def operator_loc; end # Represents the name of the method being called. @@ -3679,7 +3688,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # read_name `:bar` # ^^^ # - # source://prism//lib/prism/node.rb#2970 + # source://prism//lib/prism/node.rb#2982 sig { returns(Symbol) } def read_name; end @@ -3688,7 +3697,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # ^^^ # - # source://prism//lib/prism/node.rb#2920 + # source://prism//lib/prism/node.rb#2932 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3696,31 +3705,31 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2897 + # source://prism//lib/prism/node.rb#2909 sig { returns(T::Boolean) } def safe_navigation?; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2996 + # source://prism//lib/prism/node.rb#3008 def save_binary_operator_loc(repository); end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2940 + # source://prism//lib/prism/node.rb#2952 def save_call_operator_loc(repository); end # Save the message_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#2962 + # source://prism//lib/prism/node.rb#2974 def save_message_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3022 + # source://prism//lib/prism/node.rb#3034 sig { override.returns(Symbol) } def type; end @@ -3729,7 +3738,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # ^^^^^ # - # source://prism//lib/prism/node.rb#3004 + # source://prism//lib/prism/node.rb#3016 sig { returns(Prism::Node) } def value; end @@ -3737,7 +3746,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2902 + # source://prism//lib/prism/node.rb#2914 sig { returns(T::Boolean) } def variable_call?; end @@ -3746,14 +3755,14 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # foo.bar += value # write_name `:bar=` # ^^^ # - # source://prism//lib/prism/node.rb#2976 + # source://prism//lib/prism/node.rb#2988 sig { returns(Symbol) } def write_name; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3027 + # source://prism//lib/prism/node.rb#3039 def type; end end end @@ -3763,13 +3772,13 @@ end # foo.bar ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3051 +# source://prism//lib/prism/node.rb#3063 class Prism::CallOrWriteNode < ::Prism::Node # Initialize a new CallOrWriteNode node. # # @return [CallOrWriteNode] a new instance of CallOrWriteNode # - # source://prism//lib/prism/node.rb#3053 + # source://prism//lib/prism/node.rb#3065 sig do params( source: Prism::Source, @@ -3790,12 +3799,12 @@ class Prism::CallOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3239 + # source://prism//lib/prism/node.rb#3251 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3068 + # source://prism//lib/prism/node.rb#3080 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -3803,13 +3812,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3114 + # source://prism//lib/prism/node.rb#3126 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#3208 + # source://prism//lib/prism/node.rb#3220 sig { returns(T.nilable(String)) } def call_operator; end @@ -3818,31 +3827,31 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # ^ # - # source://prism//lib/prism/node.rb#3133 + # source://prism//lib/prism/node.rb#3145 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3073 + # source://prism//lib/prism/node.rb#3085 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3086 + # source://prism//lib/prism/node.rb#3098 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3078 + # source://prism//lib/prism/node.rb#3090 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node) -> CallOrWriteNode # - # source://prism//lib/prism/node.rb#3091 + # source://prism//lib/prism/node.rb#3103 sig do params( node_id: Integer, @@ -3859,16 +3868,16 @@ class Prism::CallOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), message_loc: T.unsafe(nil), read_name: T.unsafe(nil), write_name: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3096 + # source://prism//lib/prism/node.rb#3108 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#3099 + # source://prism//lib/prism/node.rb#3111 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -3879,19 +3888,19 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3119 + # source://prism//lib/prism/node.rb#3131 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3223 + # source://prism//lib/prism/node.rb#3235 sig { override.returns(String) } def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#3213 + # source://prism//lib/prism/node.rb#3225 sig { returns(T.nilable(String)) } def message; end @@ -3900,13 +3909,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # ^^^ # - # source://prism//lib/prism/node.rb#3155 + # source://prism//lib/prism/node.rb#3167 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3218 + # source://prism//lib/prism/node.rb#3230 sig { returns(String) } def operator; end @@ -3915,7 +3924,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # ^^^ # - # source://prism//lib/prism/node.rb#3189 + # source://prism//lib/prism/node.rb#3201 sig { returns(Prism::Location) } def operator_loc; end @@ -3924,7 +3933,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # read_name `:bar` # ^^^ # - # source://prism//lib/prism/node.rb#3177 + # source://prism//lib/prism/node.rb#3189 sig { returns(Symbol) } def read_name; end @@ -3933,7 +3942,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # ^^^ # - # source://prism//lib/prism/node.rb#3127 + # source://prism//lib/prism/node.rb#3139 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3941,31 +3950,31 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3104 + # source://prism//lib/prism/node.rb#3116 sig { returns(T::Boolean) } def safe_navigation?; end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3147 + # source://prism//lib/prism/node.rb#3159 def save_call_operator_loc(repository); end # Save the message_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3169 + # source://prism//lib/prism/node.rb#3181 def save_message_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3197 + # source://prism//lib/prism/node.rb#3209 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3228 + # source://prism//lib/prism/node.rb#3240 sig { override.returns(Symbol) } def type; end @@ -3974,7 +3983,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # ^^^^^ # - # source://prism//lib/prism/node.rb#3205 + # source://prism//lib/prism/node.rb#3217 sig { returns(Prism::Node) } def value; end @@ -3982,7 +3991,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3109 + # source://prism//lib/prism/node.rb#3121 sig { returns(T::Boolean) } def variable_call?; end @@ -3991,14 +4000,14 @@ class Prism::CallOrWriteNode < ::Prism::Node # foo.bar ||= value # write_name `:bar=` # ^^^ # - # source://prism//lib/prism/node.rb#3183 + # source://prism//lib/prism/node.rb#3195 sig { returns(Symbol) } def write_name; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3233 + # source://prism//lib/prism/node.rb#3245 def type; end end end @@ -4016,13 +4025,13 @@ end # for foo.bar in baz do end # ^^^^^^^ # -# source://prism//lib/prism/node.rb#3264 +# source://prism//lib/prism/node.rb#3276 class Prism::CallTargetNode < ::Prism::Node # Initialize a new CallTargetNode node. # # @return [CallTargetNode] a new instance of CallTargetNode # - # source://prism//lib/prism/node.rb#3266 + # source://prism//lib/prism/node.rb#3278 sig do params( source: Prism::Source, @@ -4040,12 +4049,12 @@ class Prism::CallTargetNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3401 + # source://prism//lib/prism/node.rb#3413 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3278 + # source://prism//lib/prism/node.rb#3290 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -4053,13 +4062,13 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3321 + # source://prism//lib/prism/node.rb#3333 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String # - # source://prism//lib/prism/node.rb#3375 + # source://prism//lib/prism/node.rb#3387 sig { returns(String) } def call_operator; end @@ -4068,31 +4077,31 @@ class Prism::CallTargetNode < ::Prism::Node # foo.bar = 1 # ^ # - # source://prism//lib/prism/node.rb#3340 + # source://prism//lib/prism/node.rb#3352 sig { returns(Prism::Location) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3283 + # source://prism//lib/prism/node.rb#3295 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3293 + # source://prism//lib/prism/node.rb#3305 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3288 + # source://prism//lib/prism/node.rb#3300 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?call_operator_loc: Location, ?name: Symbol, ?message_loc: Location) -> CallTargetNode # - # source://prism//lib/prism/node.rb#3298 + # source://prism//lib/prism/node.rb#3310 sig do params( node_id: Integer, @@ -4106,16 +4115,16 @@ class Prism::CallTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), name: T.unsafe(nil), message_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3303 + # source://prism//lib/prism/node.rb#3315 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, call_operator_loc: Location, name: Symbol, message_loc: Location } # - # source://prism//lib/prism/node.rb#3306 + # source://prism//lib/prism/node.rb#3318 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4126,19 +4135,19 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3326 + # source://prism//lib/prism/node.rb#3338 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3385 + # source://prism//lib/prism/node.rb#3397 sig { override.returns(String) } def inspect; end # def message: () -> String # - # source://prism//lib/prism/node.rb#3380 + # source://prism//lib/prism/node.rb#3392 sig { returns(String) } def message; end @@ -4147,7 +4156,7 @@ class Prism::CallTargetNode < ::Prism::Node # foo.bar = 1 # ^^^ # - # source://prism//lib/prism/node.rb#3362 + # source://prism//lib/prism/node.rb#3374 sig { returns(Prism::Location) } def message_loc; end @@ -4156,7 +4165,7 @@ class Prism::CallTargetNode < ::Prism::Node # foo.bar = 1 # name `:foo` # ^^^ # - # source://prism//lib/prism/node.rb#3356 + # source://prism//lib/prism/node.rb#3368 sig { returns(Symbol) } def name; end @@ -4165,7 +4174,7 @@ class Prism::CallTargetNode < ::Prism::Node # foo.bar = 1 # ^^^ # - # source://prism//lib/prism/node.rb#3334 + # source://prism//lib/prism/node.rb#3346 sig { returns(Prism::Node) } def receiver; end @@ -4173,25 +4182,25 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3311 + # source://prism//lib/prism/node.rb#3323 sig { returns(T::Boolean) } def safe_navigation?; end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3348 + # source://prism//lib/prism/node.rb#3360 def save_call_operator_loc(repository); end # Save the message_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3370 + # source://prism//lib/prism/node.rb#3382 def save_message_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3390 + # source://prism//lib/prism/node.rb#3402 sig { override.returns(Symbol) } def type; end @@ -4199,14 +4208,14 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3316 + # source://prism//lib/prism/node.rb#3328 sig { returns(T::Boolean) } def variable_call?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3395 + # source://prism//lib/prism/node.rb#3407 def type; end end end @@ -4216,13 +4225,13 @@ end # foo => [bar => baz] # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3415 +# source://prism//lib/prism/node.rb#3427 class Prism::CapturePatternNode < ::Prism::Node # Initialize a new CapturePatternNode node. # # @return [CapturePatternNode] a new instance of CapturePatternNode # - # source://prism//lib/prism/node.rb#3417 + # source://prism//lib/prism/node.rb#3429 sig do params( source: Prism::Source, @@ -4239,36 +4248,36 @@ class Prism::CapturePatternNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3510 + # source://prism//lib/prism/node.rb#3522 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3428 + # source://prism//lib/prism/node.rb#3440 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3433 + # source://prism//lib/prism/node.rb#3445 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3443 + # source://prism//lib/prism/node.rb#3455 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3438 + # source://prism//lib/prism/node.rb#3450 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?target: LocalVariableTargetNode, ?operator_loc: Location) -> CapturePatternNode # - # source://prism//lib/prism/node.rb#3448 + # source://prism//lib/prism/node.rb#3460 sig do params( node_id: Integer, @@ -4281,16 +4290,16 @@ class Prism::CapturePatternNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil), target: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3453 + # source://prism//lib/prism/node.rb#3465 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, target: LocalVariableTargetNode, operator_loc: Location } # - # source://prism//lib/prism/node.rb#3456 + # source://prism//lib/prism/node.rb#3468 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4299,13 +4308,13 @@ class Prism::CapturePatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3494 + # source://prism//lib/prism/node.rb#3506 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3489 + # source://prism//lib/prism/node.rb#3501 sig { returns(String) } def operator; end @@ -4314,14 +4323,14 @@ class Prism::CapturePatternNode < ::Prism::Node # foo => bar # ^^ # - # source://prism//lib/prism/node.rb#3476 + # source://prism//lib/prism/node.rb#3488 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3484 + # source://prism//lib/prism/node.rb#3496 def save_operator_loc(repository); end # Represents the target of the capture. @@ -4329,13 +4338,13 @@ class Prism::CapturePatternNode < ::Prism::Node # foo => bar # ^^^ # - # source://prism//lib/prism/node.rb#3470 + # source://prism//lib/prism/node.rb#3482 sig { returns(Prism::LocalVariableTargetNode) } def target; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3499 + # source://prism//lib/prism/node.rb#3511 sig { override.returns(Symbol) } def type; end @@ -4344,14 +4353,14 @@ class Prism::CapturePatternNode < ::Prism::Node # foo => bar # ^^^ # - # source://prism//lib/prism/node.rb#3464 + # source://prism//lib/prism/node.rb#3476 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3504 + # source://prism//lib/prism/node.rb#3516 def type; end end end @@ -4363,13 +4372,13 @@ end # end # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3524 +# source://prism//lib/prism/node.rb#3536 class Prism::CaseMatchNode < ::Prism::Node # Initialize a new CaseMatchNode node. # # @return [CaseMatchNode] a new instance of CaseMatchNode # - # source://prism//lib/prism/node.rb#3526 + # source://prism//lib/prism/node.rb#3538 sig do params( source: Prism::Source, @@ -4388,18 +4397,18 @@ class Prism::CaseMatchNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3652 + # source://prism//lib/prism/node.rb#3664 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3539 + # source://prism//lib/prism/node.rb#3551 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3626 + # source://prism//lib/prism/node.rb#3638 sig { returns(String) } def case_keyword; end @@ -4408,25 +4417,25 @@ class Prism::CaseMatchNode < ::Prism::Node # case true; in false; end # ^^^^ # - # source://prism//lib/prism/node.rb#3597 + # source://prism//lib/prism/node.rb#3609 sig { returns(Prism::Location) } def case_keyword_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3544 + # source://prism//lib/prism/node.rb#3556 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3558 + # source://prism//lib/prism/node.rb#3570 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3549 + # source://prism//lib/prism/node.rb#3561 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -4435,19 +4444,19 @@ class Prism::CaseMatchNode < ::Prism::Node # case true; in false; end # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#3585 + # source://prism//lib/prism/node.rb#3597 sig { returns(T::Array[Prism::InNode]) } def conditions; end # Returns the else clause of the case match node. This method is deprecated # in favor of #else_clause. # - # source://prism//lib/prism/node_ext.rb#467 + # source://prism//lib/prism/node_ext.rb#470 def consequent; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[InNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseMatchNode # - # source://prism//lib/prism/node.rb#3563 + # source://prism//lib/prism/node.rb#3575 sig do params( node_id: Integer, @@ -4462,16 +4471,16 @@ class Prism::CaseMatchNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), predicate: T.unsafe(nil), conditions: T.unsafe(nil), else_clause: T.unsafe(nil), case_keyword_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3568 + # source://prism//lib/prism/node.rb#3580 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[InNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location } # - # source://prism//lib/prism/node.rb#3571 + # source://prism//lib/prism/node.rb#3583 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4480,13 +4489,13 @@ class Prism::CaseMatchNode < ::Prism::Node # case true; in false; else; end # ^^^^ # - # source://prism//lib/prism/node.rb#3591 + # source://prism//lib/prism/node.rb#3603 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#3631 + # source://prism//lib/prism/node.rb#3643 sig { returns(String) } def end_keyword; end @@ -4495,7 +4504,7 @@ class Prism::CaseMatchNode < ::Prism::Node # case true; in false; end # ^^^ # - # source://prism//lib/prism/node.rb#3613 + # source://prism//lib/prism/node.rb#3625 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4504,7 +4513,7 @@ class Prism::CaseMatchNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3636 + # source://prism//lib/prism/node.rb#3648 sig { override.returns(String) } def inspect; end @@ -4513,32 +4522,32 @@ class Prism::CaseMatchNode < ::Prism::Node # case true; in false; end # ^^^^ # - # source://prism//lib/prism/node.rb#3579 + # source://prism//lib/prism/node.rb#3591 sig { returns(T.nilable(Prism::Node)) } def predicate; end # Save the case_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3605 + # source://prism//lib/prism/node.rb#3617 def save_case_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3621 + # source://prism//lib/prism/node.rb#3633 def save_end_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3641 + # source://prism//lib/prism/node.rb#3653 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3646 + # source://prism//lib/prism/node.rb#3658 def type; end end end @@ -4550,13 +4559,13 @@ end # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3669 +# source://prism//lib/prism/node.rb#3681 class Prism::CaseNode < ::Prism::Node # Initialize a new CaseNode node. # # @return [CaseNode] a new instance of CaseNode # - # source://prism//lib/prism/node.rb#3671 + # source://prism//lib/prism/node.rb#3683 sig do params( source: Prism::Source, @@ -4575,18 +4584,18 @@ class Prism::CaseNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3797 + # source://prism//lib/prism/node.rb#3809 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3684 + # source://prism//lib/prism/node.rb#3696 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3771 + # source://prism//lib/prism/node.rb#3783 sig { returns(String) } def case_keyword; end @@ -4595,25 +4604,25 @@ class Prism::CaseNode < ::Prism::Node # case true; when false; end # ^^^^ # - # source://prism//lib/prism/node.rb#3742 + # source://prism//lib/prism/node.rb#3754 sig { returns(Prism::Location) } def case_keyword_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3689 + # source://prism//lib/prism/node.rb#3701 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3703 + # source://prism//lib/prism/node.rb#3715 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3694 + # source://prism//lib/prism/node.rb#3706 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -4622,19 +4631,19 @@ class Prism::CaseNode < ::Prism::Node # case true; when false; end # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#3730 + # source://prism//lib/prism/node.rb#3742 sig { returns(T::Array[Prism::WhenNode]) } def conditions; end # Returns the else clause of the case node. This method is deprecated in # favor of #else_clause. # - # source://prism//lib/prism/node_ext.rb#476 + # source://prism//lib/prism/node_ext.rb#479 def consequent; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?predicate: Prism::node?, ?conditions: Array[WhenNode], ?else_clause: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location) -> CaseNode # - # source://prism//lib/prism/node.rb#3708 + # source://prism//lib/prism/node.rb#3720 sig do params( node_id: Integer, @@ -4649,16 +4658,16 @@ class Prism::CaseNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), predicate: T.unsafe(nil), conditions: T.unsafe(nil), else_clause: T.unsafe(nil), case_keyword_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3713 + # source://prism//lib/prism/node.rb#3725 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, predicate: Prism::node?, conditions: Array[WhenNode], else_clause: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location } # - # source://prism//lib/prism/node.rb#3716 + # source://prism//lib/prism/node.rb#3728 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -4667,13 +4676,13 @@ class Prism::CaseNode < ::Prism::Node # case true; when false; else; end # ^^^^ # - # source://prism//lib/prism/node.rb#3736 + # source://prism//lib/prism/node.rb#3748 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#3776 + # source://prism//lib/prism/node.rb#3788 sig { returns(String) } def end_keyword; end @@ -4682,7 +4691,7 @@ class Prism::CaseNode < ::Prism::Node # case true; when false; end # ^^^ # - # source://prism//lib/prism/node.rb#3758 + # source://prism//lib/prism/node.rb#3770 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4691,41 +4700,41 @@ class Prism::CaseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#3781 + # source://prism//lib/prism/node.rb#3793 sig { override.returns(String) } def inspect; end # Represents the predicate of the case statement. This can be either `nil` or any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # # case true; when false; end - # ^^^^ + # ^^^^ # - # source://prism//lib/prism/node.rb#3724 + # source://prism//lib/prism/node.rb#3736 sig { returns(T.nilable(Prism::Node)) } def predicate; end # Save the case_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3750 + # source://prism//lib/prism/node.rb#3762 def save_case_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3766 + # source://prism//lib/prism/node.rb#3778 def save_end_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3786 + # source://prism//lib/prism/node.rb#3798 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3791 + # source://prism//lib/prism/node.rb#3803 def type; end end end @@ -4735,13 +4744,13 @@ end # class Foo end # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3812 +# source://prism//lib/prism/node.rb#3824 class Prism::ClassNode < ::Prism::Node # Initialize a new ClassNode node. # # @return [ClassNode] a new instance of ClassNode # - # source://prism//lib/prism/node.rb#3814 + # source://prism//lib/prism/node.rb#3826 sig do params( source: Prism::Source, @@ -4763,60 +4772,67 @@ class Prism::ClassNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#3958 + # source://prism//lib/prism/node.rb#3988 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3830 + # source://prism//lib/prism/node.rb#3842 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: StatementsNode | BeginNode | nil + # Represents the body of the class. # - # source://prism//lib/prism/node.rb#3908 + # class Foo + # foo + # ^^^ + # + # source://prism//lib/prism/node.rb#3933 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3835 + # source://prism//lib/prism/node.rb#3847 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//lib/prism/node.rb#3927 + # source://prism//lib/prism/node.rb#3957 sig { returns(String) } def class_keyword; end - # attr_reader class_keyword_loc: Location + # Represents the location of the `class` keyword. + # + # class Foo end + # ^^^^^ # - # source://prism//lib/prism/node.rb#3870 + # source://prism//lib/prism/node.rb#3885 sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3849 + # source://prism//lib/prism/node.rb#3861 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#3840 + # source://prism//lib/prism/node.rb#3852 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant_path: ConstantReadNode | ConstantPathNode | CallNode # - # source://prism//lib/prism/node.rb#3883 + # source://prism//lib/prism/node.rb#3898 sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::CallNode)) } def constant_path; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | CallNode, ?inheritance_operator_loc: Location?, ?superclass: Prism::node?, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ClassNode # - # source://prism//lib/prism/node.rb#3854 + # source://prism//lib/prism/node.rb#3866 sig do params( node_id: Integer, @@ -4834,28 +4850,31 @@ class Prism::ClassNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), class_keyword_loc: T.unsafe(nil), constant_path: T.unsafe(nil), inheritance_operator_loc: T.unsafe(nil), superclass: T.unsafe(nil), body: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3859 + # source://prism//lib/prism/node.rb#3871 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | CallNode, inheritance_operator_loc: Location?, superclass: Prism::node?, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#3862 + # source://prism//lib/prism/node.rb#3874 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#3937 + # source://prism//lib/prism/node.rb#3967 sig { returns(String) } def end_keyword; end - # attr_reader end_keyword_loc: Location + # Represents the location of the `end` keyword. # - # source://prism//lib/prism/node.rb#3911 + # class Foo end + # ^^^ + # + # source://prism//lib/prism/node.rb#3939 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -4864,68 +4883,76 @@ class Prism::ClassNode < ::Prism::Node # def inheritance_operator: () -> String? # - # source://prism//lib/prism/node.rb#3932 + # source://prism//lib/prism/node.rb#3962 sig { returns(T.nilable(String)) } def inheritance_operator; end - # attr_reader inheritance_operator_loc: Location? + # Represents the location of the `<` operator. + # + # class Foo < Bar + # ^ # - # source://prism//lib/prism/node.rb#3886 + # source://prism//lib/prism/node.rb#3904 sig { returns(T.nilable(Prism::Location)) } def inheritance_operator_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#3942 + # source://prism//lib/prism/node.rb#3972 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#3867 + # source://prism//lib/prism/node.rb#3879 sig { returns(T::Array[Symbol]) } def locals; end - # attr_reader name: Symbol + # The name of the class. + # + # class Foo end # name `:Foo` # - # source://prism//lib/prism/node.rb#3924 + # source://prism//lib/prism/node.rb#3954 sig { returns(Symbol) } def name; end # Save the class_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3878 + # source://prism//lib/prism/node.rb#3893 def save_class_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3919 + # source://prism//lib/prism/node.rb#3947 def save_end_keyword_loc(repository); end # Save the inheritance_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#3900 + # source://prism//lib/prism/node.rb#3918 def save_inheritance_operator_loc(repository); end - # attr_reader superclass: Prism::node? + # Represents the superclass of the class. # - # source://prism//lib/prism/node.rb#3905 + # class Foo < Bar + # ^^^ + # + # source://prism//lib/prism/node.rb#3926 sig { returns(T.nilable(Prism::Node)) } def superclass; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#3947 + # source://prism//lib/prism/node.rb#3977 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#3952 + # source://prism//lib/prism/node.rb#3982 def type; end end end @@ -4935,13 +4962,13 @@ end # @@target &&= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3976 +# source://prism//lib/prism/node.rb#4006 class Prism::ClassVariableAndWriteNode < ::Prism::Node # Initialize a new ClassVariableAndWriteNode node. # # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#3978 + # source://prism//lib/prism/node.rb#4008 sig do params( source: Prism::Source, @@ -4959,36 +4986,36 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4088 + # source://prism//lib/prism/node.rb#4118 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3990 + # source://prism//lib/prism/node.rb#4020 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#3995 + # source://prism//lib/prism/node.rb#4025 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4005 + # source://prism//lib/prism/node.rb#4035 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4000 + # source://prism//lib/prism/node.rb#4030 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#4010 + # source://prism//lib/prism/node.rb#4040 sig do params( node_id: Integer, @@ -5002,20 +5029,20 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4015 + # source://prism//lib/prism/node.rb#4045 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#4018 + # source://prism//lib/prism/node.rb#4048 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#164 + # source://prism//lib/prism/desugar_compiler.rb#165 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -5023,7 +5050,7 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4072 + # source://prism//lib/prism/node.rb#4102 sig { override.returns(String) } def inspect; end @@ -5032,7 +5059,7 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # @@target &&= value # name `:@@target` # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#4026 + # source://prism//lib/prism/node.rb#4056 sig { returns(Symbol) } def name; end @@ -5041,13 +5068,13 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # @@target &&= value # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#4032 + # source://prism//lib/prism/node.rb#4062 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4067 + # source://prism//lib/prism/node.rb#4097 sig { returns(String) } def operator; end @@ -5056,25 +5083,25 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # @@target &&= value # ^^^ # - # source://prism//lib/prism/node.rb#4048 + # source://prism//lib/prism/node.rb#4078 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4040 + # source://prism//lib/prism/node.rb#4070 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4056 + # source://prism//lib/prism/node.rb#4086 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4077 + # source://prism//lib/prism/node.rb#4107 sig { override.returns(Symbol) } def type; end @@ -5083,14 +5110,14 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # @@target &&= value # ^^^^^ # - # source://prism//lib/prism/node.rb#4064 + # source://prism//lib/prism/node.rb#4094 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4082 + # source://prism//lib/prism/node.rb#4112 def type; end end end @@ -5100,13 +5127,13 @@ end # @@target += value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4101 +# source://prism//lib/prism/node.rb#4131 class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # Initialize a new ClassVariableOperatorWriteNode node. # # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#4103 + # source://prism//lib/prism/node.rb#4133 sig do params( source: Prism::Source, @@ -5125,48 +5152,48 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4200 + # source://prism//lib/prism/node.rb#4230 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4116 + # source://prism//lib/prism/node.rb#4146 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#4181 + # source://prism//lib/prism/node.rb#4211 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#4165 + # source://prism//lib/prism/node.rb#4195 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4121 + # source://prism//lib/prism/node.rb#4151 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4131 + # source://prism//lib/prism/node.rb#4161 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4126 + # source://prism//lib/prism/node.rb#4156 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#4136 + # source://prism//lib/prism/node.rb#4166 sig do params( node_id: Integer, @@ -5181,20 +5208,20 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4141 + # source://prism//lib/prism/node.rb#4171 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol } # - # source://prism//lib/prism/node.rb#4144 + # source://prism//lib/prism/node.rb#4174 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#176 + # source://prism//lib/prism/desugar_compiler.rb#177 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -5202,62 +5229,62 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4184 + # source://prism//lib/prism/node.rb#4214 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4149 + # source://prism//lib/prism/node.rb#4179 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4152 + # source://prism//lib/prism/node.rb#4182 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#355 + # source://prism//lib/prism/node_ext.rb#358 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#362 + # source://prism//lib/prism/node_ext.rb#365 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4173 + # source://prism//lib/prism/node.rb#4203 def save_binary_operator_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4160 + # source://prism//lib/prism/node.rb#4190 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4189 + # source://prism//lib/prism/node.rb#4219 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4178 + # source://prism//lib/prism/node.rb#4208 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4194 + # source://prism//lib/prism/node.rb#4224 def type; end end end @@ -5267,13 +5294,13 @@ end # @@target ||= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4214 +# source://prism//lib/prism/node.rb#4244 class Prism::ClassVariableOrWriteNode < ::Prism::Node # Initialize a new ClassVariableOrWriteNode node. # # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4216 + # source://prism//lib/prism/node.rb#4246 sig do params( source: Prism::Source, @@ -5291,36 +5318,36 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4314 + # source://prism//lib/prism/node.rb#4344 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4228 + # source://prism//lib/prism/node.rb#4258 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4233 + # source://prism//lib/prism/node.rb#4263 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4243 + # source://prism//lib/prism/node.rb#4273 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4238 + # source://prism//lib/prism/node.rb#4268 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4248 + # source://prism//lib/prism/node.rb#4278 sig do params( node_id: Integer, @@ -5334,20 +5361,20 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4253 + # source://prism//lib/prism/node.rb#4283 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#4256 + # source://prism//lib/prism/node.rb#4286 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#170 + # source://prism//lib/prism/desugar_compiler.rb#171 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -5355,62 +5382,62 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4298 + # source://prism//lib/prism/node.rb#4328 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4261 + # source://prism//lib/prism/node.rb#4291 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4264 + # source://prism//lib/prism/node.rb#4294 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4293 + # source://prism//lib/prism/node.rb#4323 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4277 + # source://prism//lib/prism/node.rb#4307 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4272 + # source://prism//lib/prism/node.rb#4302 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4285 + # source://prism//lib/prism/node.rb#4315 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4303 + # source://prism//lib/prism/node.rb#4333 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4290 + # source://prism//lib/prism/node.rb#4320 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4308 + # source://prism//lib/prism/node.rb#4338 def type; end end end @@ -5420,49 +5447,49 @@ end # @@foo # ^^^^^ # -# source://prism//lib/prism/node.rb#4327 +# source://prism//lib/prism/node.rb#4357 class Prism::ClassVariableReadNode < ::Prism::Node # Initialize a new ClassVariableReadNode node. # # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode # - # source://prism//lib/prism/node.rb#4329 + # source://prism//lib/prism/node.rb#4359 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4394 + # source://prism//lib/prism/node.rb#4424 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4338 + # source://prism//lib/prism/node.rb#4368 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4343 + # source://prism//lib/prism/node.rb#4373 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4353 + # source://prism//lib/prism/node.rb#4383 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4348 + # source://prism//lib/prism/node.rb#4378 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableReadNode # - # source://prism//lib/prism/node.rb#4358 + # source://prism//lib/prism/node.rb#4388 sig do params( node_id: Integer, @@ -5473,16 +5500,16 @@ class Prism::ClassVariableReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4363 + # source://prism//lib/prism/node.rb#4393 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#4366 + # source://prism//lib/prism/node.rb#4396 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5491,7 +5518,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4378 + # source://prism//lib/prism/node.rb#4408 sig { override.returns(String) } def inspect; end @@ -5501,20 +5528,20 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # @@_test # name `:@@_test` # - # source://prism//lib/prism/node.rb#4375 + # source://prism//lib/prism/node.rb#4405 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4383 + # source://prism//lib/prism/node.rb#4413 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4388 + # source://prism//lib/prism/node.rb#4418 def type; end end end @@ -5524,49 +5551,49 @@ end # @@foo, @@bar = baz # ^^^^^ ^^^^^ # -# source://prism//lib/prism/node.rb#4404 +# source://prism//lib/prism/node.rb#4434 class Prism::ClassVariableTargetNode < ::Prism::Node # Initialize a new ClassVariableTargetNode node. # # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode # - # source://prism//lib/prism/node.rb#4406 + # source://prism//lib/prism/node.rb#4436 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4467 + # source://prism//lib/prism/node.rb#4497 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4415 + # source://prism//lib/prism/node.rb#4445 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4420 + # source://prism//lib/prism/node.rb#4450 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4430 + # source://prism//lib/prism/node.rb#4460 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4425 + # source://prism//lib/prism/node.rb#4455 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ClassVariableTargetNode # - # source://prism//lib/prism/node.rb#4435 + # source://prism//lib/prism/node.rb#4465 sig do params( node_id: Integer, @@ -5577,16 +5604,16 @@ class Prism::ClassVariableTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4440 + # source://prism//lib/prism/node.rb#4470 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#4443 + # source://prism//lib/prism/node.rb#4473 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5595,26 +5622,26 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4451 + # source://prism//lib/prism/node.rb#4481 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4448 + # source://prism//lib/prism/node.rb#4478 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4456 + # source://prism//lib/prism/node.rb#4486 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4461 + # source://prism//lib/prism/node.rb#4491 def type; end end end @@ -5624,13 +5651,13 @@ end # @@foo = 1 # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4477 +# source://prism//lib/prism/node.rb#4507 class Prism::ClassVariableWriteNode < ::Prism::Node # Initialize a new ClassVariableWriteNode node. # # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4479 + # source://prism//lib/prism/node.rb#4509 sig do params( source: Prism::Source, @@ -5648,36 +5675,36 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4593 + # source://prism//lib/prism/node.rb#4623 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4491 + # source://prism//lib/prism/node.rb#4521 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4496 + # source://prism//lib/prism/node.rb#4526 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4506 + # source://prism//lib/prism/node.rb#4536 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4501 + # source://prism//lib/prism/node.rb#4531 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4511 + # source://prism//lib/prism/node.rb#4541 sig do params( node_id: Integer, @@ -5691,16 +5718,16 @@ class Prism::ClassVariableWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4516 + # source://prism//lib/prism/node.rb#4546 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#4519 + # source://prism//lib/prism/node.rb#4549 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -5709,7 +5736,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4577 + # source://prism//lib/prism/node.rb#4607 sig { override.returns(String) } def inspect; end @@ -5719,7 +5746,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # @@_test = :test # name `@@_test` # - # source://prism//lib/prism/node.rb#4528 + # source://prism//lib/prism/node.rb#4558 sig { returns(Symbol) } def name; end @@ -5728,13 +5755,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@foo = :bar # ^^^^^ # - # source://prism//lib/prism/node.rb#4534 + # source://prism//lib/prism/node.rb#4564 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4572 + # source://prism//lib/prism/node.rb#4602 sig { returns(String) } def operator; end @@ -5743,25 +5770,25 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@foo = :bar # ^ # - # source://prism//lib/prism/node.rb#4559 + # source://prism//lib/prism/node.rb#4589 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4542 + # source://prism//lib/prism/node.rb#4572 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4567 + # source://prism//lib/prism/node.rb#4597 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4582 + # source://prism//lib/prism/node.rb#4612 sig { override.returns(Symbol) } def type; end @@ -5773,14 +5800,14 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # @@_xyz = 123 # ^^^ # - # source://prism//lib/prism/node.rb#4553 + # source://prism//lib/prism/node.rb#4583 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4587 + # source://prism//lib/prism/node.rb#4617 def type; end end end @@ -5799,49 +5826,49 @@ end # introduce some kind of LRU cache to limit the number of entries, but this # has not yet been implemented. # -# source://prism//lib/prism/parse_result.rb#189 +# source://prism//lib/prism/parse_result.rb#190 class Prism::CodeUnitsCache # Initialize a new cache with the given source and encoding. # # @return [CodeUnitsCache] a new instance of CodeUnitsCache # - # source://prism//lib/prism/parse_result.rb#215 + # source://prism//lib/prism/parse_result.rb#216 sig { params(source: String, encoding: Encoding).void } def initialize(source, encoding); end # Retrieve the code units offset from the given byte offset. # - # source://prism//lib/prism/parse_result.rb#229 + # source://prism//lib/prism/parse_result.rb#230 sig { params(byte_offset: Integer).returns(Integer) } def [](byte_offset); end end -# source://prism//lib/prism/parse_result.rb#201 +# source://prism//lib/prism/parse_result.rb#202 class Prism::CodeUnitsCache::LengthCounter # @return [LengthCounter] a new instance of LengthCounter # - # source://prism//lib/prism/parse_result.rb#202 + # source://prism//lib/prism/parse_result.rb#203 def initialize(source, encoding); end - # source://prism//lib/prism/parse_result.rb#207 + # source://prism//lib/prism/parse_result.rb#208 def count(byte_offset, byte_length); end end -# source://prism//lib/prism/parse_result.rb#190 +# source://prism//lib/prism/parse_result.rb#191 class Prism::CodeUnitsCache::UTF16Counter # @return [UTF16Counter] a new instance of UTF16Counter # - # source://prism//lib/prism/parse_result.rb#191 + # source://prism//lib/prism/parse_result.rb#192 def initialize(source, encoding); end - # source://prism//lib/prism/parse_result.rb#196 + # source://prism//lib/prism/parse_result.rb#197 def count(byte_offset, byte_length); end end # This represents a comment that was encountered during parsing. It is the # base class for all comment types. # -# source://prism//lib/prism/parse_result.rb#524 +# source://prism//lib/prism/parse_result.rb#525 class Prism::Comment abstract! @@ -5849,25 +5876,25 @@ class Prism::Comment # # @return [Comment] a new instance of Comment # - # source://prism//lib/prism/parse_result.rb#529 + # source://prism//lib/prism/parse_result.rb#530 sig { params(location: Prism::Location).void } def initialize(location); end # Implement the hash pattern matching interface for Comment. # - # source://prism//lib/prism/parse_result.rb#534 + # source://prism//lib/prism/parse_result.rb#535 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # The location of this comment in the source. # - # source://prism//lib/prism/parse_result.rb#526 + # source://prism//lib/prism/parse_result.rb#527 sig { returns(Prism::Location) } def location; end # Returns the content of the comment by slicing it from the source code. # - # source://prism//lib/prism/parse_result.rb#539 + # source://prism//lib/prism/parse_result.rb#540 sig { returns(String) } def slice; end @@ -5892,930 +5919,779 @@ end # Prism.parse("1 + 2").value.accept(SExpressions.new) # # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]] # -# source://prism//lib/prism/compiler.rb#27 +# source://prism//lib/prism/compiler.rb#30 class Prism::Compiler < ::Prism::Visitor # Visit an individual node. # - # source://prism//lib/prism/compiler.rb#29 + # source://prism//lib/prism/compiler.rb#32 sig { params(node: T.nilable(Prism::Node)).returns(T.untyped) } def visit(node); end - # Visit the child nodes of the given node. # Compile a AliasGlobalVariableNode node # - # source://prism//lib/prism/compiler.rb#44 + # source://prism//lib/prism/compiler.rb#47 def visit_alias_global_variable_node(node); end - # Visit the child nodes of the given node. # Compile a AliasMethodNode node # - # source://prism//lib/prism/compiler.rb#47 + # source://prism//lib/prism/compiler.rb#52 def visit_alias_method_node(node); end # Visit a list of nodes. # - # source://prism//lib/prism/compiler.rb#34 + # source://prism//lib/prism/compiler.rb#37 sig { params(nodes: T::Array[T.nilable(Prism::Node)]).returns(T::Array[T.untyped]) } def visit_all(nodes); end - # Visit the child nodes of the given node. # Compile a AlternationPatternNode node # - # source://prism//lib/prism/compiler.rb#50 + # source://prism//lib/prism/compiler.rb#57 def visit_alternation_pattern_node(node); end - # Visit the child nodes of the given node. # Compile a AndNode node # - # source://prism//lib/prism/compiler.rb#53 + # source://prism//lib/prism/compiler.rb#62 def visit_and_node(node); end - # Visit the child nodes of the given node. # Compile a ArgumentsNode node # - # source://prism//lib/prism/compiler.rb#56 + # source://prism//lib/prism/compiler.rb#67 def visit_arguments_node(node); end - # Visit the child nodes of the given node. # Compile a ArrayNode node # - # source://prism//lib/prism/compiler.rb#59 + # source://prism//lib/prism/compiler.rb#72 def visit_array_node(node); end - # Visit the child nodes of the given node. # Compile a ArrayPatternNode node # - # source://prism//lib/prism/compiler.rb#62 + # source://prism//lib/prism/compiler.rb#77 def visit_array_pattern_node(node); end - # Visit the child nodes of the given node. # Compile a AssocNode node # - # source://prism//lib/prism/compiler.rb#65 + # source://prism//lib/prism/compiler.rb#82 def visit_assoc_node(node); end - # Visit the child nodes of the given node. # Compile a AssocSplatNode node # - # source://prism//lib/prism/compiler.rb#68 + # source://prism//lib/prism/compiler.rb#87 def visit_assoc_splat_node(node); end - # Visit the child nodes of the given node. # Compile a BackReferenceReadNode node # - # source://prism//lib/prism/compiler.rb#71 + # source://prism//lib/prism/compiler.rb#92 def visit_back_reference_read_node(node); end - # Visit the child nodes of the given node. # Compile a BeginNode node # - # source://prism//lib/prism/compiler.rb#74 + # source://prism//lib/prism/compiler.rb#97 def visit_begin_node(node); end - # Visit the child nodes of the given node. # Compile a BlockArgumentNode node # - # source://prism//lib/prism/compiler.rb#77 + # source://prism//lib/prism/compiler.rb#102 def visit_block_argument_node(node); end - # Visit the child nodes of the given node. # Compile a BlockLocalVariableNode node # - # source://prism//lib/prism/compiler.rb#80 + # source://prism//lib/prism/compiler.rb#107 def visit_block_local_variable_node(node); end - # Visit the child nodes of the given node. # Compile a BlockNode node # - # source://prism//lib/prism/compiler.rb#83 + # source://prism//lib/prism/compiler.rb#112 def visit_block_node(node); end - # Visit the child nodes of the given node. # Compile a BlockParameterNode node # - # source://prism//lib/prism/compiler.rb#86 + # source://prism//lib/prism/compiler.rb#117 def visit_block_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a BlockParametersNode node # - # source://prism//lib/prism/compiler.rb#89 + # source://prism//lib/prism/compiler.rb#122 def visit_block_parameters_node(node); end - # Visit the child nodes of the given node. # Compile a BreakNode node # - # source://prism//lib/prism/compiler.rb#92 + # source://prism//lib/prism/compiler.rb#127 def visit_break_node(node); end - # Visit the child nodes of the given node. # Compile a CallAndWriteNode node # - # source://prism//lib/prism/compiler.rb#95 + # source://prism//lib/prism/compiler.rb#132 def visit_call_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a CallNode node # - # source://prism//lib/prism/compiler.rb#98 + # source://prism//lib/prism/compiler.rb#137 def visit_call_node(node); end - # Visit the child nodes of the given node. # Compile a CallOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#101 + # source://prism//lib/prism/compiler.rb#142 def visit_call_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a CallOrWriteNode node # - # source://prism//lib/prism/compiler.rb#104 + # source://prism//lib/prism/compiler.rb#147 def visit_call_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a CallTargetNode node # - # source://prism//lib/prism/compiler.rb#107 + # source://prism//lib/prism/compiler.rb#152 def visit_call_target_node(node); end - # Visit the child nodes of the given node. # Compile a CapturePatternNode node # - # source://prism//lib/prism/compiler.rb#110 + # source://prism//lib/prism/compiler.rb#157 def visit_capture_pattern_node(node); end - # Visit the child nodes of the given node. # Compile a CaseMatchNode node # - # source://prism//lib/prism/compiler.rb#113 + # source://prism//lib/prism/compiler.rb#162 def visit_case_match_node(node); end - # Visit the child nodes of the given node. # Compile a CaseNode node # - # source://prism//lib/prism/compiler.rb#116 + # source://prism//lib/prism/compiler.rb#167 def visit_case_node(node); end # Visit the child nodes of the given node. # - # source://prism//lib/prism/compiler.rb#39 + # source://prism//lib/prism/compiler.rb#42 sig { params(node: Prism::Node).returns(T::Array[T.untyped]) } def visit_child_nodes(node); end - # Visit the child nodes of the given node. # Compile a ClassNode node # - # source://prism//lib/prism/compiler.rb#119 + # source://prism//lib/prism/compiler.rb#172 def visit_class_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#122 + # source://prism//lib/prism/compiler.rb#177 def visit_class_variable_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#125 + # source://prism//lib/prism/compiler.rb#182 def visit_class_variable_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableOrWriteNode node # - # source://prism//lib/prism/compiler.rb#128 + # source://prism//lib/prism/compiler.rb#187 def visit_class_variable_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableReadNode node # - # source://prism//lib/prism/compiler.rb#131 + # source://prism//lib/prism/compiler.rb#192 def visit_class_variable_read_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableTargetNode node # - # source://prism//lib/prism/compiler.rb#134 + # source://prism//lib/prism/compiler.rb#197 def visit_class_variable_target_node(node); end - # Visit the child nodes of the given node. # Compile a ClassVariableWriteNode node # - # source://prism//lib/prism/compiler.rb#137 + # source://prism//lib/prism/compiler.rb#202 def visit_class_variable_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantAndWriteNode node # - # source://prism//lib/prism/compiler.rb#140 + # source://prism//lib/prism/compiler.rb#207 def visit_constant_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#143 + # source://prism//lib/prism/compiler.rb#212 def visit_constant_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantOrWriteNode node # - # source://prism//lib/prism/compiler.rb#146 + # source://prism//lib/prism/compiler.rb#217 def visit_constant_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathAndWriteNode node # - # source://prism//lib/prism/compiler.rb#149 + # source://prism//lib/prism/compiler.rb#222 def visit_constant_path_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathNode node # - # source://prism//lib/prism/compiler.rb#152 + # source://prism//lib/prism/compiler.rb#227 def visit_constant_path_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#155 + # source://prism//lib/prism/compiler.rb#232 def visit_constant_path_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathOrWriteNode node # - # source://prism//lib/prism/compiler.rb#158 + # source://prism//lib/prism/compiler.rb#237 def visit_constant_path_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathTargetNode node # - # source://prism//lib/prism/compiler.rb#161 + # source://prism//lib/prism/compiler.rb#242 def visit_constant_path_target_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantPathWriteNode node # - # source://prism//lib/prism/compiler.rb#164 + # source://prism//lib/prism/compiler.rb#247 def visit_constant_path_write_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantReadNode node # - # source://prism//lib/prism/compiler.rb#167 + # source://prism//lib/prism/compiler.rb#252 def visit_constant_read_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantTargetNode node # - # source://prism//lib/prism/compiler.rb#170 + # source://prism//lib/prism/compiler.rb#257 def visit_constant_target_node(node); end - # Visit the child nodes of the given node. # Compile a ConstantWriteNode node # - # source://prism//lib/prism/compiler.rb#173 + # source://prism//lib/prism/compiler.rb#262 def visit_constant_write_node(node); end - # Visit the child nodes of the given node. # Compile a DefNode node # - # source://prism//lib/prism/compiler.rb#176 + # source://prism//lib/prism/compiler.rb#267 def visit_def_node(node); end - # Visit the child nodes of the given node. # Compile a DefinedNode node # - # source://prism//lib/prism/compiler.rb#179 + # source://prism//lib/prism/compiler.rb#272 def visit_defined_node(node); end - # Visit the child nodes of the given node. # Compile a ElseNode node # - # source://prism//lib/prism/compiler.rb#182 + # source://prism//lib/prism/compiler.rb#277 def visit_else_node(node); end - # Visit the child nodes of the given node. # Compile a EmbeddedStatementsNode node # - # source://prism//lib/prism/compiler.rb#185 + # source://prism//lib/prism/compiler.rb#282 def visit_embedded_statements_node(node); end - # Visit the child nodes of the given node. # Compile a EmbeddedVariableNode node # - # source://prism//lib/prism/compiler.rb#188 + # source://prism//lib/prism/compiler.rb#287 def visit_embedded_variable_node(node); end - # Visit the child nodes of the given node. # Compile a EnsureNode node # - # source://prism//lib/prism/compiler.rb#191 + # source://prism//lib/prism/compiler.rb#292 def visit_ensure_node(node); end - # Visit the child nodes of the given node. # Compile a FalseNode node # - # source://prism//lib/prism/compiler.rb#194 + # source://prism//lib/prism/compiler.rb#297 def visit_false_node(node); end - # Visit the child nodes of the given node. # Compile a FindPatternNode node # - # source://prism//lib/prism/compiler.rb#197 + # source://prism//lib/prism/compiler.rb#302 def visit_find_pattern_node(node); end - # Visit the child nodes of the given node. # Compile a FlipFlopNode node # - # source://prism//lib/prism/compiler.rb#200 + # source://prism//lib/prism/compiler.rb#307 def visit_flip_flop_node(node); end - # Visit the child nodes of the given node. # Compile a FloatNode node # - # source://prism//lib/prism/compiler.rb#203 + # source://prism//lib/prism/compiler.rb#312 def visit_float_node(node); end - # Visit the child nodes of the given node. # Compile a ForNode node # - # source://prism//lib/prism/compiler.rb#206 + # source://prism//lib/prism/compiler.rb#317 def visit_for_node(node); end - # Visit the child nodes of the given node. # Compile a ForwardingArgumentsNode node # - # source://prism//lib/prism/compiler.rb#209 + # source://prism//lib/prism/compiler.rb#322 def visit_forwarding_arguments_node(node); end - # Visit the child nodes of the given node. # Compile a ForwardingParameterNode node # - # source://prism//lib/prism/compiler.rb#212 + # source://prism//lib/prism/compiler.rb#327 def visit_forwarding_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a ForwardingSuperNode node # - # source://prism//lib/prism/compiler.rb#215 + # source://prism//lib/prism/compiler.rb#332 def visit_forwarding_super_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#218 + # source://prism//lib/prism/compiler.rb#337 def visit_global_variable_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#221 + # source://prism//lib/prism/compiler.rb#342 def visit_global_variable_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableOrWriteNode node # - # source://prism//lib/prism/compiler.rb#224 + # source://prism//lib/prism/compiler.rb#347 def visit_global_variable_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableReadNode node # - # source://prism//lib/prism/compiler.rb#227 + # source://prism//lib/prism/compiler.rb#352 def visit_global_variable_read_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableTargetNode node # - # source://prism//lib/prism/compiler.rb#230 + # source://prism//lib/prism/compiler.rb#357 def visit_global_variable_target_node(node); end - # Visit the child nodes of the given node. # Compile a GlobalVariableWriteNode node # - # source://prism//lib/prism/compiler.rb#233 + # source://prism//lib/prism/compiler.rb#362 def visit_global_variable_write_node(node); end - # Visit the child nodes of the given node. # Compile a HashNode node # - # source://prism//lib/prism/compiler.rb#236 + # source://prism//lib/prism/compiler.rb#367 def visit_hash_node(node); end - # Visit the child nodes of the given node. # Compile a HashPatternNode node # - # source://prism//lib/prism/compiler.rb#239 + # source://prism//lib/prism/compiler.rb#372 def visit_hash_pattern_node(node); end - # Visit the child nodes of the given node. # Compile a IfNode node # - # source://prism//lib/prism/compiler.rb#242 + # source://prism//lib/prism/compiler.rb#377 def visit_if_node(node); end - # Visit the child nodes of the given node. # Compile a ImaginaryNode node # - # source://prism//lib/prism/compiler.rb#245 + # source://prism//lib/prism/compiler.rb#382 def visit_imaginary_node(node); end - # Visit the child nodes of the given node. # Compile a ImplicitNode node # - # source://prism//lib/prism/compiler.rb#248 + # source://prism//lib/prism/compiler.rb#387 def visit_implicit_node(node); end - # Visit the child nodes of the given node. # Compile a ImplicitRestNode node # - # source://prism//lib/prism/compiler.rb#251 + # source://prism//lib/prism/compiler.rb#392 def visit_implicit_rest_node(node); end - # Visit the child nodes of the given node. # Compile a InNode node # - # source://prism//lib/prism/compiler.rb#254 + # source://prism//lib/prism/compiler.rb#397 def visit_in_node(node); end - # Visit the child nodes of the given node. # Compile a IndexAndWriteNode node # - # source://prism//lib/prism/compiler.rb#257 + # source://prism//lib/prism/compiler.rb#402 def visit_index_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a IndexOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#260 + # source://prism//lib/prism/compiler.rb#407 def visit_index_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a IndexOrWriteNode node # - # source://prism//lib/prism/compiler.rb#263 + # source://prism//lib/prism/compiler.rb#412 def visit_index_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a IndexTargetNode node # - # source://prism//lib/prism/compiler.rb#266 + # source://prism//lib/prism/compiler.rb#417 def visit_index_target_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#269 + # source://prism//lib/prism/compiler.rb#422 def visit_instance_variable_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#272 + # source://prism//lib/prism/compiler.rb#427 def visit_instance_variable_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableOrWriteNode node # - # source://prism//lib/prism/compiler.rb#275 + # source://prism//lib/prism/compiler.rb#432 def visit_instance_variable_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableReadNode node # - # source://prism//lib/prism/compiler.rb#278 + # source://prism//lib/prism/compiler.rb#437 def visit_instance_variable_read_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableTargetNode node # - # source://prism//lib/prism/compiler.rb#281 + # source://prism//lib/prism/compiler.rb#442 def visit_instance_variable_target_node(node); end - # Visit the child nodes of the given node. # Compile a InstanceVariableWriteNode node # - # source://prism//lib/prism/compiler.rb#284 + # source://prism//lib/prism/compiler.rb#447 def visit_instance_variable_write_node(node); end - # Visit the child nodes of the given node. # Compile a IntegerNode node # - # source://prism//lib/prism/compiler.rb#287 + # source://prism//lib/prism/compiler.rb#452 def visit_integer_node(node); end - # Visit the child nodes of the given node. # Compile a InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/compiler.rb#290 + # source://prism//lib/prism/compiler.rb#457 def visit_interpolated_match_last_line_node(node); end - # Visit the child nodes of the given node. # Compile a InterpolatedRegularExpressionNode node # - # source://prism//lib/prism/compiler.rb#293 + # source://prism//lib/prism/compiler.rb#462 def visit_interpolated_regular_expression_node(node); end - # Visit the child nodes of the given node. # Compile a InterpolatedStringNode node # - # source://prism//lib/prism/compiler.rb#296 + # source://prism//lib/prism/compiler.rb#467 def visit_interpolated_string_node(node); end - # Visit the child nodes of the given node. # Compile a InterpolatedSymbolNode node # - # source://prism//lib/prism/compiler.rb#299 + # source://prism//lib/prism/compiler.rb#472 def visit_interpolated_symbol_node(node); end - # Visit the child nodes of the given node. # Compile a InterpolatedXStringNode node # - # source://prism//lib/prism/compiler.rb#302 + # source://prism//lib/prism/compiler.rb#477 def visit_interpolated_x_string_node(node); end - # Visit the child nodes of the given node. # Compile a ItLocalVariableReadNode node # - # source://prism//lib/prism/compiler.rb#305 + # source://prism//lib/prism/compiler.rb#482 def visit_it_local_variable_read_node(node); end - # Visit the child nodes of the given node. # Compile a ItParametersNode node # - # source://prism//lib/prism/compiler.rb#308 + # source://prism//lib/prism/compiler.rb#487 def visit_it_parameters_node(node); end - # Visit the child nodes of the given node. # Compile a KeywordHashNode node # - # source://prism//lib/prism/compiler.rb#311 + # source://prism//lib/prism/compiler.rb#492 def visit_keyword_hash_node(node); end - # Visit the child nodes of the given node. # Compile a KeywordRestParameterNode node # - # source://prism//lib/prism/compiler.rb#314 + # source://prism//lib/prism/compiler.rb#497 def visit_keyword_rest_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a LambdaNode node # - # source://prism//lib/prism/compiler.rb#317 + # source://prism//lib/prism/compiler.rb#502 def visit_lambda_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#320 + # source://prism//lib/prism/compiler.rb#507 def visit_local_variable_and_write_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#323 + # source://prism//lib/prism/compiler.rb#512 def visit_local_variable_operator_write_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableOrWriteNode node # - # source://prism//lib/prism/compiler.rb#326 + # source://prism//lib/prism/compiler.rb#517 def visit_local_variable_or_write_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableReadNode node # - # source://prism//lib/prism/compiler.rb#329 + # source://prism//lib/prism/compiler.rb#522 def visit_local_variable_read_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableTargetNode node # - # source://prism//lib/prism/compiler.rb#332 + # source://prism//lib/prism/compiler.rb#527 def visit_local_variable_target_node(node); end - # Visit the child nodes of the given node. # Compile a LocalVariableWriteNode node # - # source://prism//lib/prism/compiler.rb#335 + # source://prism//lib/prism/compiler.rb#532 def visit_local_variable_write_node(node); end - # Visit the child nodes of the given node. # Compile a MatchLastLineNode node # - # source://prism//lib/prism/compiler.rb#338 + # source://prism//lib/prism/compiler.rb#537 def visit_match_last_line_node(node); end - # Visit the child nodes of the given node. # Compile a MatchPredicateNode node # - # source://prism//lib/prism/compiler.rb#341 + # source://prism//lib/prism/compiler.rb#542 def visit_match_predicate_node(node); end - # Visit the child nodes of the given node. # Compile a MatchRequiredNode node # - # source://prism//lib/prism/compiler.rb#344 + # source://prism//lib/prism/compiler.rb#547 def visit_match_required_node(node); end - # Visit the child nodes of the given node. # Compile a MatchWriteNode node # - # source://prism//lib/prism/compiler.rb#347 + # source://prism//lib/prism/compiler.rb#552 def visit_match_write_node(node); end - # Visit the child nodes of the given node. # Compile a MissingNode node # - # source://prism//lib/prism/compiler.rb#350 + # source://prism//lib/prism/compiler.rb#557 def visit_missing_node(node); end - # Visit the child nodes of the given node. # Compile a ModuleNode node # - # source://prism//lib/prism/compiler.rb#353 + # source://prism//lib/prism/compiler.rb#562 def visit_module_node(node); end - # Visit the child nodes of the given node. # Compile a MultiTargetNode node # - # source://prism//lib/prism/compiler.rb#356 + # source://prism//lib/prism/compiler.rb#567 def visit_multi_target_node(node); end - # Visit the child nodes of the given node. # Compile a MultiWriteNode node # - # source://prism//lib/prism/compiler.rb#359 + # source://prism//lib/prism/compiler.rb#572 def visit_multi_write_node(node); end - # Visit the child nodes of the given node. # Compile a NextNode node # - # source://prism//lib/prism/compiler.rb#362 + # source://prism//lib/prism/compiler.rb#577 def visit_next_node(node); end - # Visit the child nodes of the given node. # Compile a NilNode node # - # source://prism//lib/prism/compiler.rb#365 + # source://prism//lib/prism/compiler.rb#582 def visit_nil_node(node); end - # Visit the child nodes of the given node. # Compile a NoKeywordsParameterNode node # - # source://prism//lib/prism/compiler.rb#368 + # source://prism//lib/prism/compiler.rb#587 def visit_no_keywords_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a NumberedParametersNode node # - # source://prism//lib/prism/compiler.rb#371 + # source://prism//lib/prism/compiler.rb#592 def visit_numbered_parameters_node(node); end - # Visit the child nodes of the given node. # Compile a NumberedReferenceReadNode node # - # source://prism//lib/prism/compiler.rb#374 + # source://prism//lib/prism/compiler.rb#597 def visit_numbered_reference_read_node(node); end - # Visit the child nodes of the given node. # Compile a OptionalKeywordParameterNode node # - # source://prism//lib/prism/compiler.rb#377 + # source://prism//lib/prism/compiler.rb#602 def visit_optional_keyword_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a OptionalParameterNode node # - # source://prism//lib/prism/compiler.rb#380 + # source://prism//lib/prism/compiler.rb#607 def visit_optional_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a OrNode node # - # source://prism//lib/prism/compiler.rb#383 + # source://prism//lib/prism/compiler.rb#612 def visit_or_node(node); end - # Visit the child nodes of the given node. # Compile a ParametersNode node # - # source://prism//lib/prism/compiler.rb#386 + # source://prism//lib/prism/compiler.rb#617 def visit_parameters_node(node); end - # Visit the child nodes of the given node. # Compile a ParenthesesNode node # - # source://prism//lib/prism/compiler.rb#389 + # source://prism//lib/prism/compiler.rb#622 def visit_parentheses_node(node); end - # Visit the child nodes of the given node. # Compile a PinnedExpressionNode node # - # source://prism//lib/prism/compiler.rb#392 + # source://prism//lib/prism/compiler.rb#627 def visit_pinned_expression_node(node); end - # Visit the child nodes of the given node. # Compile a PinnedVariableNode node # - # source://prism//lib/prism/compiler.rb#395 + # source://prism//lib/prism/compiler.rb#632 def visit_pinned_variable_node(node); end - # Visit the child nodes of the given node. # Compile a PostExecutionNode node # - # source://prism//lib/prism/compiler.rb#398 + # source://prism//lib/prism/compiler.rb#637 def visit_post_execution_node(node); end - # Visit the child nodes of the given node. # Compile a PreExecutionNode node # - # source://prism//lib/prism/compiler.rb#401 + # source://prism//lib/prism/compiler.rb#642 def visit_pre_execution_node(node); end - # Visit the child nodes of the given node. # Compile a ProgramNode node # - # source://prism//lib/prism/compiler.rb#404 + # source://prism//lib/prism/compiler.rb#647 def visit_program_node(node); end - # Visit the child nodes of the given node. # Compile a RangeNode node # - # source://prism//lib/prism/compiler.rb#407 + # source://prism//lib/prism/compiler.rb#652 def visit_range_node(node); end - # Visit the child nodes of the given node. # Compile a RationalNode node # - # source://prism//lib/prism/compiler.rb#410 + # source://prism//lib/prism/compiler.rb#657 def visit_rational_node(node); end - # Visit the child nodes of the given node. # Compile a RedoNode node # - # source://prism//lib/prism/compiler.rb#413 + # source://prism//lib/prism/compiler.rb#662 def visit_redo_node(node); end - # Visit the child nodes of the given node. # Compile a RegularExpressionNode node # - # source://prism//lib/prism/compiler.rb#416 + # source://prism//lib/prism/compiler.rb#667 def visit_regular_expression_node(node); end - # Visit the child nodes of the given node. # Compile a RequiredKeywordParameterNode node # - # source://prism//lib/prism/compiler.rb#419 + # source://prism//lib/prism/compiler.rb#672 def visit_required_keyword_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a RequiredParameterNode node # - # source://prism//lib/prism/compiler.rb#422 + # source://prism//lib/prism/compiler.rb#677 def visit_required_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a RescueModifierNode node # - # source://prism//lib/prism/compiler.rb#425 + # source://prism//lib/prism/compiler.rb#682 def visit_rescue_modifier_node(node); end - # Visit the child nodes of the given node. # Compile a RescueNode node # - # source://prism//lib/prism/compiler.rb#428 + # source://prism//lib/prism/compiler.rb#687 def visit_rescue_node(node); end - # Visit the child nodes of the given node. # Compile a RestParameterNode node # - # source://prism//lib/prism/compiler.rb#431 + # source://prism//lib/prism/compiler.rb#692 def visit_rest_parameter_node(node); end - # Visit the child nodes of the given node. # Compile a RetryNode node # - # source://prism//lib/prism/compiler.rb#434 + # source://prism//lib/prism/compiler.rb#697 def visit_retry_node(node); end - # Visit the child nodes of the given node. # Compile a ReturnNode node # - # source://prism//lib/prism/compiler.rb#437 + # source://prism//lib/prism/compiler.rb#702 def visit_return_node(node); end - # Visit the child nodes of the given node. # Compile a SelfNode node # - # source://prism//lib/prism/compiler.rb#440 + # source://prism//lib/prism/compiler.rb#707 def visit_self_node(node); end - # Visit the child nodes of the given node. # Compile a ShareableConstantNode node # - # source://prism//lib/prism/compiler.rb#443 + # source://prism//lib/prism/compiler.rb#712 def visit_shareable_constant_node(node); end - # Visit the child nodes of the given node. # Compile a SingletonClassNode node # - # source://prism//lib/prism/compiler.rb#446 + # source://prism//lib/prism/compiler.rb#717 def visit_singleton_class_node(node); end - # Visit the child nodes of the given node. # Compile a SourceEncodingNode node # - # source://prism//lib/prism/compiler.rb#449 + # source://prism//lib/prism/compiler.rb#722 def visit_source_encoding_node(node); end - # Visit the child nodes of the given node. # Compile a SourceFileNode node # - # source://prism//lib/prism/compiler.rb#452 + # source://prism//lib/prism/compiler.rb#727 def visit_source_file_node(node); end - # Visit the child nodes of the given node. # Compile a SourceLineNode node # - # source://prism//lib/prism/compiler.rb#455 + # source://prism//lib/prism/compiler.rb#732 def visit_source_line_node(node); end - # Visit the child nodes of the given node. # Compile a SplatNode node # - # source://prism//lib/prism/compiler.rb#458 + # source://prism//lib/prism/compiler.rb#737 def visit_splat_node(node); end - # Visit the child nodes of the given node. # Compile a StatementsNode node # - # source://prism//lib/prism/compiler.rb#461 + # source://prism//lib/prism/compiler.rb#742 def visit_statements_node(node); end - # Visit the child nodes of the given node. # Compile a StringNode node # - # source://prism//lib/prism/compiler.rb#464 + # source://prism//lib/prism/compiler.rb#747 def visit_string_node(node); end - # Visit the child nodes of the given node. # Compile a SuperNode node # - # source://prism//lib/prism/compiler.rb#467 + # source://prism//lib/prism/compiler.rb#752 def visit_super_node(node); end - # Visit the child nodes of the given node. # Compile a SymbolNode node # - # source://prism//lib/prism/compiler.rb#470 + # source://prism//lib/prism/compiler.rb#757 def visit_symbol_node(node); end - # Visit the child nodes of the given node. # Compile a TrueNode node # - # source://prism//lib/prism/compiler.rb#473 + # source://prism//lib/prism/compiler.rb#762 def visit_true_node(node); end - # Visit the child nodes of the given node. # Compile a UndefNode node # - # source://prism//lib/prism/compiler.rb#476 + # source://prism//lib/prism/compiler.rb#767 def visit_undef_node(node); end - # Visit the child nodes of the given node. # Compile a UnlessNode node # - # source://prism//lib/prism/compiler.rb#479 + # source://prism//lib/prism/compiler.rb#772 def visit_unless_node(node); end - # Visit the child nodes of the given node. # Compile a UntilNode node # - # source://prism//lib/prism/compiler.rb#482 + # source://prism//lib/prism/compiler.rb#777 def visit_until_node(node); end - # Visit the child nodes of the given node. # Compile a WhenNode node # - # source://prism//lib/prism/compiler.rb#485 + # source://prism//lib/prism/compiler.rb#782 def visit_when_node(node); end - # Visit the child nodes of the given node. # Compile a WhileNode node # - # source://prism//lib/prism/compiler.rb#488 + # source://prism//lib/prism/compiler.rb#787 def visit_while_node(node); end - # Visit the child nodes of the given node. # Compile a XStringNode node # - # source://prism//lib/prism/compiler.rb#491 + # source://prism//lib/prism/compiler.rb#792 def visit_x_string_node(node); end - # Visit the child nodes of the given node. # Compile a YieldNode node # - # source://prism//lib/prism/compiler.rb#494 + # source://prism//lib/prism/compiler.rb#797 def visit_yield_node(node); end end @@ -6824,13 +6700,13 @@ end # Target &&= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4606 +# source://prism//lib/prism/node.rb#4636 class Prism::ConstantAndWriteNode < ::Prism::Node # Initialize a new ConstantAndWriteNode node. # # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4608 + # source://prism//lib/prism/node.rb#4638 sig do params( source: Prism::Source, @@ -6848,36 +6724,36 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4706 + # source://prism//lib/prism/node.rb#4736 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4620 + # source://prism//lib/prism/node.rb#4650 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4625 + # source://prism//lib/prism/node.rb#4655 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4635 + # source://prism//lib/prism/node.rb#4665 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4630 + # source://prism//lib/prism/node.rb#4660 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4640 + # source://prism//lib/prism/node.rb#4670 sig do params( node_id: Integer, @@ -6891,20 +6767,20 @@ class Prism::ConstantAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4645 + # source://prism//lib/prism/node.rb#4675 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#4648 + # source://prism//lib/prism/node.rb#4678 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#182 + # source://prism//lib/prism/desugar_compiler.rb#183 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -6912,62 +6788,62 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4690 + # source://prism//lib/prism/node.rb#4720 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4653 + # source://prism//lib/prism/node.rb#4683 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4656 + # source://prism//lib/prism/node.rb#4686 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4685 + # source://prism//lib/prism/node.rb#4715 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4669 + # source://prism//lib/prism/node.rb#4699 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4664 + # source://prism//lib/prism/node.rb#4694 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4677 + # source://prism//lib/prism/node.rb#4707 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4695 + # source://prism//lib/prism/node.rb#4725 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4682 + # source://prism//lib/prism/node.rb#4712 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4700 + # source://prism//lib/prism/node.rb#4730 def type; end end end @@ -6977,13 +6853,13 @@ end # Target += value # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4719 +# source://prism//lib/prism/node.rb#4749 class Prism::ConstantOperatorWriteNode < ::Prism::Node # Initialize a new ConstantOperatorWriteNode node. # # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4721 + # source://prism//lib/prism/node.rb#4751 sig do params( source: Prism::Source, @@ -7002,48 +6878,48 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4818 + # source://prism//lib/prism/node.rb#4848 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4734 + # source://prism//lib/prism/node.rb#4764 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#4799 + # source://prism//lib/prism/node.rb#4829 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#4783 + # source://prism//lib/prism/node.rb#4813 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4739 + # source://prism//lib/prism/node.rb#4769 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4749 + # source://prism//lib/prism/node.rb#4779 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4744 + # source://prism//lib/prism/node.rb#4774 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4754 + # source://prism//lib/prism/node.rb#4784 sig do params( node_id: Integer, @@ -7058,20 +6934,20 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4759 + # source://prism//lib/prism/node.rb#4789 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol } # - # source://prism//lib/prism/node.rb#4762 + # source://prism//lib/prism/node.rb#4792 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#194 + # source://prism//lib/prism/desugar_compiler.rb#195 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -7079,62 +6955,62 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4802 + # source://prism//lib/prism/node.rb#4832 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4767 + # source://prism//lib/prism/node.rb#4797 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4770 + # source://prism//lib/prism/node.rb#4800 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#371 + # source://prism//lib/prism/node_ext.rb#374 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#378 + # source://prism//lib/prism/node_ext.rb#381 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4791 + # source://prism//lib/prism/node.rb#4821 def save_binary_operator_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4778 + # source://prism//lib/prism/node.rb#4808 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4807 + # source://prism//lib/prism/node.rb#4837 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4796 + # source://prism//lib/prism/node.rb#4826 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4812 + # source://prism//lib/prism/node.rb#4842 def type; end end end @@ -7144,13 +7020,13 @@ end # Target ||= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4832 +# source://prism//lib/prism/node.rb#4862 class Prism::ConstantOrWriteNode < ::Prism::Node # Initialize a new ConstantOrWriteNode node. # # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4834 + # source://prism//lib/prism/node.rb#4864 sig do params( source: Prism::Source, @@ -7168,36 +7044,36 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#4932 + # source://prism//lib/prism/node.rb#4962 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4846 + # source://prism//lib/prism/node.rb#4876 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4851 + # source://prism//lib/prism/node.rb#4881 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4861 + # source://prism//lib/prism/node.rb#4891 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4856 + # source://prism//lib/prism/node.rb#4886 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4866 + # source://prism//lib/prism/node.rb#4896 sig do params( node_id: Integer, @@ -7211,20 +7087,20 @@ class Prism::ConstantOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4871 + # source://prism//lib/prism/node.rb#4901 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#4874 + # source://prism//lib/prism/node.rb#4904 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#188 + # source://prism//lib/prism/desugar_compiler.rb#189 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -7232,62 +7108,62 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#4916 + # source://prism//lib/prism/node.rb#4946 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4879 + # source://prism//lib/prism/node.rb#4909 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4882 + # source://prism//lib/prism/node.rb#4912 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4911 + # source://prism//lib/prism/node.rb#4941 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4895 + # source://prism//lib/prism/node.rb#4925 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4890 + # source://prism//lib/prism/node.rb#4920 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#4903 + # source://prism//lib/prism/node.rb#4933 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#4921 + # source://prism//lib/prism/node.rb#4951 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4908 + # source://prism//lib/prism/node.rb#4938 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#4926 + # source://prism//lib/prism/node.rb#4956 def type; end end end @@ -7297,13 +7173,13 @@ end # Parent::Child &&= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4945 +# source://prism//lib/prism/node.rb#4975 class Prism::ConstantPathAndWriteNode < ::Prism::Node # Initialize a new ConstantPathAndWriteNode node. # # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4947 + # source://prism//lib/prism/node.rb#4977 sig do params( source: Prism::Source, @@ -7320,36 +7196,36 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5031 + # source://prism//lib/prism/node.rb#5061 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4958 + # source://prism//lib/prism/node.rb#4988 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4963 + # source://prism//lib/prism/node.rb#4993 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#4973 + # source://prism//lib/prism/node.rb#5003 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#4968 + # source://prism//lib/prism/node.rb#4998 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4978 + # source://prism//lib/prism/node.rb#5008 sig do params( node_id: Integer, @@ -7362,16 +7238,16 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#4983 + # source://prism//lib/prism/node.rb#5013 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#4986 + # source://prism//lib/prism/node.rb#5016 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7380,50 +7256,50 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5015 + # source://prism//lib/prism/node.rb#5045 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5010 + # source://prism//lib/prism/node.rb#5040 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4994 + # source://prism//lib/prism/node.rb#5024 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5002 + # source://prism//lib/prism/node.rb#5032 def save_operator_loc(repository); end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#4991 + # source://prism//lib/prism/node.rb#5021 sig { returns(Prism::ConstantPathNode) } def target; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5020 + # source://prism//lib/prism/node.rb#5050 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5007 + # source://prism//lib/prism/node.rb#5037 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5025 + # source://prism//lib/prism/node.rb#5055 def type; end end end @@ -7433,13 +7309,13 @@ end # Foo::Bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#5043 +# source://prism//lib/prism/node.rb#5073 class Prism::ConstantPathNode < ::Prism::Node # Initialize a new ConstantPathNode node. # # @return [ConstantPathNode] a new instance of ConstantPathNode # - # source://prism//lib/prism/node.rb#5045 + # source://prism//lib/prism/node.rb#5075 sig do params( source: Prism::Source, @@ -7457,12 +7333,12 @@ class Prism::ConstantPathNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5166 + # source://prism//lib/prism/node.rb#5196 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5057 + # source://prism//lib/prism/node.rb#5087 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -7470,30 +7346,30 @@ class Prism::ConstantPathNode < ::Prism::Node # constant read or a missing node. To not cause a breaking change, we # continue to supply that API. # - # source://prism//lib/prism/node_ext.rb#202 + # source://prism//lib/prism/node_ext.rb#205 def child; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5062 + # source://prism//lib/prism/node.rb#5092 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5074 + # source://prism//lib/prism/node.rb#5104 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5067 + # source://prism//lib/prism/node.rb#5097 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathNode # - # source://prism//lib/prism/node.rb#5079 + # source://prism//lib/prism/node.rb#5109 sig do params( node_id: Integer, @@ -7507,22 +7383,22 @@ class Prism::ConstantPathNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), parent: T.unsafe(nil), name: T.unsafe(nil), delimiter_loc: T.unsafe(nil), name_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5084 + # source://prism//lib/prism/node.rb#5114 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location } # - # source://prism//lib/prism/node.rb#5087 + # source://prism//lib/prism/node.rb#5117 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def delimiter: () -> String # - # source://prism//lib/prism/node.rb#5145 + # source://prism//lib/prism/node.rb#5175 sig { returns(String) } def delimiter; end @@ -7534,7 +7410,7 @@ class Prism::ConstantPathNode < ::Prism::Node # One::Two # ^^ # - # source://prism//lib/prism/node.rb#5113 + # source://prism//lib/prism/node.rb#5143 sig { returns(Prism::Location) } def delimiter_loc; end @@ -7543,26 +7419,26 @@ class Prism::ConstantPathNode < ::Prism::Node # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//lib/prism/node_ext.rb#195 + # source://prism//lib/prism/node_ext.rb#198 sig { returns(String) } def full_name; end # Returns the list of parts for the full name of this constant path. # For example: [:Foo, :Bar] # - # source://prism//lib/prism/node_ext.rb#173 + # source://prism//lib/prism/node_ext.rb#176 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5150 + # source://prism//lib/prism/node.rb#5180 sig { override.returns(String) } def inspect; end # The name of the constant being accessed. This could be `nil` in the event of a syntax error. # - # source://prism//lib/prism/node.rb#5104 + # source://prism//lib/prism/node.rb#5134 sig { returns(T.nilable(Symbol)) } def name; end @@ -7574,7 +7450,7 @@ class Prism::ConstantPathNode < ::Prism::Node # One::Two # ^^^ # - # source://prism//lib/prism/node.rb#5132 + # source://prism//lib/prism/node.rb#5162 sig { returns(Prism::Location) } def name_loc; end @@ -7589,32 +7465,32 @@ class Prism::ConstantPathNode < ::Prism::Node # a.b::C # ^^^ # - # source://prism//lib/prism/node.rb#5101 + # source://prism//lib/prism/node.rb#5131 sig { returns(T.nilable(Prism::Node)) } def parent; end # Save the delimiter_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5121 + # source://prism//lib/prism/node.rb#5151 def save_delimiter_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5140 + # source://prism//lib/prism/node.rb#5170 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5155 + # source://prism//lib/prism/node.rb#5185 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5160 + # source://prism//lib/prism/node.rb#5190 def type; end end end @@ -7626,14 +7502,14 @@ end # var::Bar::Baz -> raises because the first part of the constant path is a # local variable # -# source://prism//lib/prism/node_ext.rb#164 +# source://prism//lib/prism/node_ext.rb#167 class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end # An error class raised when missing nodes are found while computing a # constant path's full name. For example: # Foo:: -> raises because the constant path is missing the last part # -# source://prism//lib/prism/node_ext.rb#169 +# source://prism//lib/prism/node_ext.rb#172 class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError; end # Represents assigning to a constant path using an operator that isn't `=`. @@ -7641,13 +7517,13 @@ class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError # Parent::Child += value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5179 +# source://prism//lib/prism/node.rb#5209 class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # Initialize a new ConstantPathOperatorWriteNode node. # # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5181 + # source://prism//lib/prism/node.rb#5211 sig do params( source: Prism::Source, @@ -7665,48 +7541,48 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5264 + # source://prism//lib/prism/node.rb#5294 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5193 + # source://prism//lib/prism/node.rb#5223 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#5245 + # source://prism//lib/prism/node.rb#5275 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#5229 + # source://prism//lib/prism/node.rb#5259 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5198 + # source://prism//lib/prism/node.rb#5228 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5208 + # source://prism//lib/prism/node.rb#5238 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5203 + # source://prism//lib/prism/node.rb#5233 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5213 + # source://prism//lib/prism/node.rb#5243 sig do params( node_id: Integer, @@ -7720,16 +7596,16 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), target: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5218 + # source://prism//lib/prism/node.rb#5248 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol } # - # source://prism//lib/prism/node.rb#5221 + # source://prism//lib/prism/node.rb#5251 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7738,50 +7614,50 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5248 + # source://prism//lib/prism/node.rb#5278 sig { override.returns(String) } def inspect; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#387 + # source://prism//lib/prism/node_ext.rb#390 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#394 + # source://prism//lib/prism/node_ext.rb#397 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5237 + # source://prism//lib/prism/node.rb#5267 def save_binary_operator_loc(repository); end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5226 + # source://prism//lib/prism/node.rb#5256 sig { returns(Prism::ConstantPathNode) } def target; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5253 + # source://prism//lib/prism/node.rb#5283 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5242 + # source://prism//lib/prism/node.rb#5272 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5258 + # source://prism//lib/prism/node.rb#5288 def type; end end end @@ -7791,13 +7667,13 @@ end # Parent::Child ||= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5277 +# source://prism//lib/prism/node.rb#5307 class Prism::ConstantPathOrWriteNode < ::Prism::Node # Initialize a new ConstantPathOrWriteNode node. # # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5279 + # source://prism//lib/prism/node.rb#5309 sig do params( source: Prism::Source, @@ -7814,36 +7690,36 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5363 + # source://prism//lib/prism/node.rb#5393 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5290 + # source://prism//lib/prism/node.rb#5320 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5295 + # source://prism//lib/prism/node.rb#5325 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5305 + # source://prism//lib/prism/node.rb#5335 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5300 + # source://prism//lib/prism/node.rb#5330 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5310 + # source://prism//lib/prism/node.rb#5340 sig do params( node_id: Integer, @@ -7856,16 +7732,16 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5315 + # source://prism//lib/prism/node.rb#5345 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#5318 + # source://prism//lib/prism/node.rb#5348 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -7874,50 +7750,50 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5347 + # source://prism//lib/prism/node.rb#5377 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5342 + # source://prism//lib/prism/node.rb#5372 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#5326 + # source://prism//lib/prism/node.rb#5356 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5334 + # source://prism//lib/prism/node.rb#5364 def save_operator_loc(repository); end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5323 + # source://prism//lib/prism/node.rb#5353 sig { returns(Prism::ConstantPathNode) } def target; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5352 + # source://prism//lib/prism/node.rb#5382 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5339 + # source://prism//lib/prism/node.rb#5369 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5357 + # source://prism//lib/prism/node.rb#5387 def type; end end end @@ -7927,13 +7803,13 @@ end # Foo::Foo, Bar::Bar = baz # ^^^^^^^^ ^^^^^^^^ # -# source://prism//lib/prism/node.rb#5375 +# source://prism//lib/prism/node.rb#5405 class Prism::ConstantPathTargetNode < ::Prism::Node # Initialize a new ConstantPathTargetNode node. # # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5377 + # source://prism//lib/prism/node.rb#5407 sig do params( source: Prism::Source, @@ -7951,12 +7827,12 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5477 + # source://prism//lib/prism/node.rb#5507 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5389 + # source://prism//lib/prism/node.rb#5419 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -7964,30 +7840,30 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # constant read or a missing node. To not cause a breaking change, we # continue to supply that API. # - # source://prism//lib/prism/node_ext.rb#243 + # source://prism//lib/prism/node_ext.rb#246 def child; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5394 + # source://prism//lib/prism/node.rb#5424 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5406 + # source://prism//lib/prism/node.rb#5436 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5399 + # source://prism//lib/prism/node.rb#5429 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location) -> ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5411 + # source://prism//lib/prism/node.rb#5441 sig do params( node_id: Integer, @@ -8001,28 +7877,28 @@ class Prism::ConstantPathTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), parent: T.unsafe(nil), name: T.unsafe(nil), delimiter_loc: T.unsafe(nil), name_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5416 + # source://prism//lib/prism/node.rb#5446 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location } # - # source://prism//lib/prism/node.rb#5419 + # source://prism//lib/prism/node.rb#5449 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def delimiter: () -> String # - # source://prism//lib/prism/node.rb#5456 + # source://prism//lib/prism/node.rb#5486 sig { returns(String) } def delimiter; end # attr_reader delimiter_loc: Location # - # source://prism//lib/prism/node.rb#5430 + # source://prism//lib/prism/node.rb#5460 sig { returns(Prism::Location) } def delimiter_loc; end @@ -8031,63 +7907,63 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//lib/prism/node_ext.rb#236 + # source://prism//lib/prism/node_ext.rb#239 sig { returns(String) } def full_name; end # Returns the list of parts for the full name of this constant path. # For example: [:Foo, :Bar] # - # source://prism//lib/prism/node_ext.rb#216 + # source://prism//lib/prism/node_ext.rb#219 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5461 + # source://prism//lib/prism/node.rb#5491 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#5427 + # source://prism//lib/prism/node.rb#5457 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5443 + # source://prism//lib/prism/node.rb#5473 sig { returns(Prism::Location) } def name_loc; end # attr_reader parent: Prism::node? # - # source://prism//lib/prism/node.rb#5424 + # source://prism//lib/prism/node.rb#5454 sig { returns(T.nilable(Prism::Node)) } def parent; end # Save the delimiter_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5438 + # source://prism//lib/prism/node.rb#5468 def save_delimiter_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5451 + # source://prism//lib/prism/node.rb#5481 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5466 + # source://prism//lib/prism/node.rb#5496 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5471 + # source://prism//lib/prism/node.rb#5501 def type; end end end @@ -8103,13 +7979,13 @@ end # ::Foo::Bar = 1 # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5496 +# source://prism//lib/prism/node.rb#5526 class Prism::ConstantPathWriteNode < ::Prism::Node # Initialize a new ConstantPathWriteNode node. # # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5498 + # source://prism//lib/prism/node.rb#5528 sig do params( source: Prism::Source, @@ -8126,36 +8002,36 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5594 + # source://prism//lib/prism/node.rb#5624 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5509 + # source://prism//lib/prism/node.rb#5539 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5514 + # source://prism//lib/prism/node.rb#5544 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5524 + # source://prism//lib/prism/node.rb#5554 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5519 + # source://prism//lib/prism/node.rb#5549 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node) -> ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5529 + # source://prism//lib/prism/node.rb#5559 sig do params( node_id: Integer, @@ -8168,16 +8044,16 @@ class Prism::ConstantPathWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5534 + # source://prism//lib/prism/node.rb#5564 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, target: ConstantPathNode, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#5537 + # source://prism//lib/prism/node.rb#5567 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8186,13 +8062,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#5578 + # source://prism//lib/prism/node.rb#5608 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5573 + # source://prism//lib/prism/node.rb#5603 sig { returns(String) } def operator; end @@ -8201,14 +8077,14 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # ::ABC = 123 # ^ # - # source://prism//lib/prism/node.rb#5554 + # source://prism//lib/prism/node.rb#5584 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5562 + # source://prism//lib/prism/node.rb#5592 def save_operator_loc(repository); end # A node representing the constant path being written to. @@ -8219,13 +8095,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # ::Foo = :abc # ^^^^^ # - # source://prism//lib/prism/node.rb#5548 + # source://prism//lib/prism/node.rb#5578 sig { returns(Prism::ConstantPathNode) } def target; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5583 + # source://prism//lib/prism/node.rb#5613 sig { override.returns(Symbol) } def type; end @@ -8234,14 +8110,14 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # FOO::BAR = :abc # ^^^^ # - # source://prism//lib/prism/node.rb#5570 + # source://prism//lib/prism/node.rb#5600 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5588 + # source://prism//lib/prism/node.rb#5618 def type; end end end @@ -8251,49 +8127,49 @@ end # Foo # ^^^ # -# source://prism//lib/prism/node.rb#5606 +# source://prism//lib/prism/node.rb#5636 class Prism::ConstantReadNode < ::Prism::Node # Initialize a new ConstantReadNode node. # # @return [ConstantReadNode] a new instance of ConstantReadNode # - # source://prism//lib/prism/node.rb#5608 + # source://prism//lib/prism/node.rb#5638 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5673 + # source://prism//lib/prism/node.rb#5703 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5617 + # source://prism//lib/prism/node.rb#5647 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5622 + # source://prism//lib/prism/node.rb#5652 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5632 + # source://prism//lib/prism/node.rb#5662 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5627 + # source://prism//lib/prism/node.rb#5657 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantReadNode # - # source://prism//lib/prism/node.rb#5637 + # source://prism//lib/prism/node.rb#5667 sig do params( node_id: Integer, @@ -8304,16 +8180,16 @@ class Prism::ConstantReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5642 + # source://prism//lib/prism/node.rb#5672 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#5645 + # source://prism//lib/prism/node.rb#5675 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8322,20 +8198,20 @@ class Prism::ConstantReadNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#139 + # source://prism//lib/prism/node_ext.rb#142 sig { returns(String) } def full_name; end # Returns the list of parts for the full name of this constant. # For example: [:Foo] # - # source://prism//lib/prism/node_ext.rb#134 + # source://prism//lib/prism/node_ext.rb#137 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5657 + # source://prism//lib/prism/node.rb#5687 sig { override.returns(String) } def inspect; end @@ -8345,20 +8221,20 @@ class Prism::ConstantReadNode < ::Prism::Node # # SOME_CONSTANT # name `:SOME_CONSTANT` # - # source://prism//lib/prism/node.rb#5654 + # source://prism//lib/prism/node.rb#5684 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5662 + # source://prism//lib/prism/node.rb#5692 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5667 + # source://prism//lib/prism/node.rb#5697 def type; end end end @@ -8368,49 +8244,49 @@ end # Foo, Bar = baz # ^^^ ^^^ # -# source://prism//lib/prism/node.rb#5683 +# source://prism//lib/prism/node.rb#5713 class Prism::ConstantTargetNode < ::Prism::Node # Initialize a new ConstantTargetNode node. # # @return [ConstantTargetNode] a new instance of ConstantTargetNode # - # source://prism//lib/prism/node.rb#5685 + # source://prism//lib/prism/node.rb#5715 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5746 + # source://prism//lib/prism/node.rb#5776 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5694 + # source://prism//lib/prism/node.rb#5724 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5699 + # source://prism//lib/prism/node.rb#5729 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5709 + # source://prism//lib/prism/node.rb#5739 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5704 + # source://prism//lib/prism/node.rb#5734 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> ConstantTargetNode # - # source://prism//lib/prism/node.rb#5714 + # source://prism//lib/prism/node.rb#5744 sig do params( node_id: Integer, @@ -8421,16 +8297,16 @@ class Prism::ConstantTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5719 + # source://prism//lib/prism/node.rb#5749 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#5722 + # source://prism//lib/prism/node.rb#5752 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8439,39 +8315,39 @@ class Prism::ConstantTargetNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#262 + # source://prism//lib/prism/node_ext.rb#265 sig { returns(String) } def full_name; end # Returns the list of parts for the full name of this constant. # For example: [:Foo] # - # source://prism//lib/prism/node_ext.rb#257 + # source://prism//lib/prism/node_ext.rb#260 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5730 + # source://prism//lib/prism/node.rb#5760 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5727 + # source://prism//lib/prism/node.rb#5757 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5735 + # source://prism//lib/prism/node.rb#5765 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5740 + # source://prism//lib/prism/node.rb#5770 def type; end end end @@ -8481,13 +8357,13 @@ end # Foo = 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#5756 +# source://prism//lib/prism/node.rb#5786 class Prism::ConstantWriteNode < ::Prism::Node # Initialize a new ConstantWriteNode node. # # @return [ConstantWriteNode] a new instance of ConstantWriteNode # - # source://prism//lib/prism/node.rb#5758 + # source://prism//lib/prism/node.rb#5788 sig do params( source: Prism::Source, @@ -8505,36 +8381,36 @@ class Prism::ConstantWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#5872 + # source://prism//lib/prism/node.rb#5902 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5770 + # source://prism//lib/prism/node.rb#5800 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5775 + # source://prism//lib/prism/node.rb#5805 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5785 + # source://prism//lib/prism/node.rb#5815 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5780 + # source://prism//lib/prism/node.rb#5810 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> ConstantWriteNode # - # source://prism//lib/prism/node.rb#5790 + # source://prism//lib/prism/node.rb#5820 sig do params( node_id: Integer, @@ -8548,16 +8424,16 @@ class Prism::ConstantWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5795 + # source://prism//lib/prism/node.rb#5825 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#5798 + # source://prism//lib/prism/node.rb#5828 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -8566,20 +8442,20 @@ class Prism::ConstantWriteNode < ::Prism::Node # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#152 + # source://prism//lib/prism/node_ext.rb#155 sig { returns(String) } def full_name; end # Returns the list of parts for the full name of this constant. # For example: [:Foo] # - # source://prism//lib/prism/node_ext.rb#147 + # source://prism//lib/prism/node_ext.rb#150 sig { returns(T::Array[Symbol]) } def full_name_parts; end # def inspect -> String # - # source://prism//lib/prism/node.rb#5856 + # source://prism//lib/prism/node.rb#5886 sig { override.returns(String) } def inspect; end @@ -8589,7 +8465,7 @@ class Prism::ConstantWriteNode < ::Prism::Node # # XYZ = 1 # name `:XYZ` # - # source://prism//lib/prism/node.rb#5807 + # source://prism//lib/prism/node.rb#5837 sig { returns(Symbol) } def name; end @@ -8598,13 +8474,13 @@ class Prism::ConstantWriteNode < ::Prism::Node # FOO = 1 # ^^^ # - # source://prism//lib/prism/node.rb#5813 + # source://prism//lib/prism/node.rb#5843 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5851 + # source://prism//lib/prism/node.rb#5881 sig { returns(String) } def operator; end @@ -8613,25 +8489,25 @@ class Prism::ConstantWriteNode < ::Prism::Node # FOO = :bar # ^ # - # source://prism//lib/prism/node.rb#5838 + # source://prism//lib/prism/node.rb#5868 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5821 + # source://prism//lib/prism/node.rb#5851 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5846 + # source://prism//lib/prism/node.rb#5876 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#5861 + # source://prism//lib/prism/node.rb#5891 sig { override.returns(Symbol) } def type; end @@ -8643,18 +8519,30 @@ class Prism::ConstantWriteNode < ::Prism::Node # MyClass = Class.new # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#5832 + # source://prism//lib/prism/node.rb#5862 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#5866 + # source://prism//lib/prism/node.rb#5896 def type; end end end +# Raised when requested to parse as the currently running Ruby version but Prism has no support for it. +# +# source://prism//lib/prism.rb#41 +class Prism::CurrentVersionError < ::ArgumentError + # Initialize a new exception for the given ruby version string. + # + # @return [CurrentVersionError] a new instance of CurrentVersionError + # + # source://prism//lib/prism.rb#43 + def initialize(version); end +end + # The DSL module provides a set of methods that can be used to create prism # nodes in a more concise manner. For example, instead of writing: # @@ -8707,13 +8595,13 @@ end # # This is mostly helpful in the context of generating trees programmatically. # -# source://prism//lib/prism/dsl.rb#61 +# source://prism//lib/prism/dsl.rb#64 module Prism::DSL extend ::Prism::DSL # Create a new AliasGlobalVariableNode node. # - # source://prism//lib/prism/dsl.rb#77 + # source://prism//lib/prism/dsl.rb#80 sig do params( source: Prism::Source, @@ -8729,7 +8617,7 @@ module Prism::DSL # Create a new AliasMethodNode node. # - # source://prism//lib/prism/dsl.rb#82 + # source://prism//lib/prism/dsl.rb#85 sig do params( source: Prism::Source, @@ -8745,7 +8633,7 @@ module Prism::DSL # Create a new AlternationPatternNode node. # - # source://prism//lib/prism/dsl.rb#87 + # source://prism//lib/prism/dsl.rb#90 sig do params( source: Prism::Source, @@ -8761,7 +8649,7 @@ module Prism::DSL # Create a new AndNode node. # - # source://prism//lib/prism/dsl.rb#92 + # source://prism//lib/prism/dsl.rb#95 sig do params( source: Prism::Source, @@ -8777,7 +8665,7 @@ module Prism::DSL # Create a new ArgumentsNode node. # - # source://prism//lib/prism/dsl.rb#97 + # source://prism//lib/prism/dsl.rb#100 sig do params( source: Prism::Source, @@ -8791,13 +8679,13 @@ module Prism::DSL # Retrieve the value of one of the ArgumentsNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#832 + # source://prism//lib/prism/dsl.rb#835 sig { params(name: Symbol).returns(Integer) } def arguments_node_flag(name); end # Create a new ArrayNode node. # - # source://prism//lib/prism/dsl.rb#102 + # source://prism//lib/prism/dsl.rb#105 sig do params( source: Prism::Source, @@ -8813,20 +8701,20 @@ module Prism::DSL # Retrieve the value of one of the ArrayNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#844 + # source://prism//lib/prism/dsl.rb#847 sig { params(name: Symbol).returns(Integer) } def array_node_flag(name); end # Create a new ArrayPatternNode node. # - # source://prism//lib/prism/dsl.rb#107 + # source://prism//lib/prism/dsl.rb#110 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), requireds: T::Array[Prism::Node], rest: T.nilable(Prism::Node), posts: T::Array[Prism::Node], @@ -8838,7 +8726,7 @@ module Prism::DSL # Create a new AssocNode node. # - # source://prism//lib/prism/dsl.rb#112 + # source://prism//lib/prism/dsl.rb#115 sig do params( source: Prism::Source, @@ -8854,7 +8742,7 @@ module Prism::DSL # Create a new AssocSplatNode node. # - # source://prism//lib/prism/dsl.rb#117 + # source://prism//lib/prism/dsl.rb#120 sig do params( source: Prism::Source, @@ -8869,7 +8757,7 @@ module Prism::DSL # Create a new BackReferenceReadNode node. # - # source://prism//lib/prism/dsl.rb#122 + # source://prism//lib/prism/dsl.rb#125 sig do params( source: Prism::Source, @@ -8883,7 +8771,7 @@ module Prism::DSL # Create a new BeginNode node. # - # source://prism//lib/prism/dsl.rb#127 + # source://prism//lib/prism/dsl.rb#130 sig do params( source: Prism::Source, @@ -8902,7 +8790,7 @@ module Prism::DSL # Create a new BlockArgumentNode node. # - # source://prism//lib/prism/dsl.rb#132 + # source://prism//lib/prism/dsl.rb#135 sig do params( source: Prism::Source, @@ -8917,7 +8805,7 @@ module Prism::DSL # Create a new BlockLocalVariableNode node. # - # source://prism//lib/prism/dsl.rb#137 + # source://prism//lib/prism/dsl.rb#140 sig do params( source: Prism::Source, @@ -8931,7 +8819,7 @@ module Prism::DSL # Create a new BlockNode node. # - # source://prism//lib/prism/dsl.rb#142 + # source://prism//lib/prism/dsl.rb#145 sig do params( source: Prism::Source, @@ -8949,7 +8837,7 @@ module Prism::DSL # Create a new BlockParameterNode node. # - # source://prism//lib/prism/dsl.rb#147 + # source://prism//lib/prism/dsl.rb#150 sig do params( source: Prism::Source, @@ -8965,7 +8853,7 @@ module Prism::DSL # Create a new BlockParametersNode node. # - # source://prism//lib/prism/dsl.rb#152 + # source://prism//lib/prism/dsl.rb#155 sig do params( source: Prism::Source, @@ -8982,7 +8870,7 @@ module Prism::DSL # Create a new BreakNode node. # - # source://prism//lib/prism/dsl.rb#157 + # source://prism//lib/prism/dsl.rb#160 sig do params( source: Prism::Source, @@ -8997,7 +8885,7 @@ module Prism::DSL # Create a new CallAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#162 + # source://prism//lib/prism/dsl.rb#165 sig do params( source: Prism::Source, @@ -9017,7 +8905,7 @@ module Prism::DSL # Create a new CallNode node. # - # source://prism//lib/prism/dsl.rb#167 + # source://prism//lib/prism/dsl.rb#170 sig do params( source: Prism::Source, @@ -9038,13 +8926,13 @@ module Prism::DSL # Retrieve the value of one of the CallNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#852 + # source://prism//lib/prism/dsl.rb#855 sig { params(name: Symbol).returns(Integer) } def call_node_flag(name); end # Create a new CallOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#172 + # source://prism//lib/prism/dsl.rb#175 sig do params( source: Prism::Source, @@ -9065,7 +8953,7 @@ module Prism::DSL # Create a new CallOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#177 + # source://prism//lib/prism/dsl.rb#180 sig do params( source: Prism::Source, @@ -9085,7 +8973,7 @@ module Prism::DSL # Create a new CallTargetNode node. # - # source://prism//lib/prism/dsl.rb#182 + # source://prism//lib/prism/dsl.rb#185 sig do params( source: Prism::Source, @@ -9102,7 +8990,7 @@ module Prism::DSL # Create a new CapturePatternNode node. # - # source://prism//lib/prism/dsl.rb#187 + # source://prism//lib/prism/dsl.rb#190 sig do params( source: Prism::Source, @@ -9118,7 +9006,7 @@ module Prism::DSL # Create a new CaseMatchNode node. # - # source://prism//lib/prism/dsl.rb#192 + # source://prism//lib/prism/dsl.rb#195 sig do params( source: Prism::Source, @@ -9136,7 +9024,7 @@ module Prism::DSL # Create a new CaseNode node. # - # source://prism//lib/prism/dsl.rb#197 + # source://prism//lib/prism/dsl.rb#200 sig do params( source: Prism::Source, @@ -9154,7 +9042,7 @@ module Prism::DSL # Create a new ClassNode node. # - # source://prism//lib/prism/dsl.rb#202 + # source://prism//lib/prism/dsl.rb#205 sig do params( source: Prism::Source, @@ -9175,7 +9063,7 @@ module Prism::DSL # Create a new ClassVariableAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#207 + # source://prism//lib/prism/dsl.rb#210 sig do params( source: Prism::Source, @@ -9192,7 +9080,7 @@ module Prism::DSL # Create a new ClassVariableOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#212 + # source://prism//lib/prism/dsl.rb#215 sig do params( source: Prism::Source, @@ -9210,7 +9098,7 @@ module Prism::DSL # Create a new ClassVariableOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#217 + # source://prism//lib/prism/dsl.rb#220 sig do params( source: Prism::Source, @@ -9227,7 +9115,7 @@ module Prism::DSL # Create a new ClassVariableReadNode node. # - # source://prism//lib/prism/dsl.rb#222 + # source://prism//lib/prism/dsl.rb#225 sig do params( source: Prism::Source, @@ -9241,7 +9129,7 @@ module Prism::DSL # Create a new ClassVariableTargetNode node. # - # source://prism//lib/prism/dsl.rb#227 + # source://prism//lib/prism/dsl.rb#230 sig do params( source: Prism::Source, @@ -9255,7 +9143,7 @@ module Prism::DSL # Create a new ClassVariableWriteNode node. # - # source://prism//lib/prism/dsl.rb#232 + # source://prism//lib/prism/dsl.rb#235 sig do params( source: Prism::Source, @@ -9272,7 +9160,7 @@ module Prism::DSL # Create a new ConstantAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#237 + # source://prism//lib/prism/dsl.rb#240 sig do params( source: Prism::Source, @@ -9289,7 +9177,7 @@ module Prism::DSL # Create a new ConstantOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#242 + # source://prism//lib/prism/dsl.rb#245 sig do params( source: Prism::Source, @@ -9307,7 +9195,7 @@ module Prism::DSL # Create a new ConstantOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#247 + # source://prism//lib/prism/dsl.rb#250 sig do params( source: Prism::Source, @@ -9324,7 +9212,7 @@ module Prism::DSL # Create a new ConstantPathAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#252 + # source://prism//lib/prism/dsl.rb#255 sig do params( source: Prism::Source, @@ -9340,7 +9228,7 @@ module Prism::DSL # Create a new ConstantPathNode node. # - # source://prism//lib/prism/dsl.rb#257 + # source://prism//lib/prism/dsl.rb#260 sig do params( source: Prism::Source, @@ -9357,7 +9245,7 @@ module Prism::DSL # Create a new ConstantPathOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#262 + # source://prism//lib/prism/dsl.rb#265 sig do params( source: Prism::Source, @@ -9374,7 +9262,7 @@ module Prism::DSL # Create a new ConstantPathOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#267 + # source://prism//lib/prism/dsl.rb#270 sig do params( source: Prism::Source, @@ -9390,7 +9278,7 @@ module Prism::DSL # Create a new ConstantPathTargetNode node. # - # source://prism//lib/prism/dsl.rb#272 + # source://prism//lib/prism/dsl.rb#275 sig do params( source: Prism::Source, @@ -9407,7 +9295,7 @@ module Prism::DSL # Create a new ConstantPathWriteNode node. # - # source://prism//lib/prism/dsl.rb#277 + # source://prism//lib/prism/dsl.rb#280 sig do params( source: Prism::Source, @@ -9423,7 +9311,7 @@ module Prism::DSL # Create a new ConstantReadNode node. # - # source://prism//lib/prism/dsl.rb#282 + # source://prism//lib/prism/dsl.rb#285 sig do params( source: Prism::Source, @@ -9437,7 +9325,7 @@ module Prism::DSL # Create a new ConstantTargetNode node. # - # source://prism//lib/prism/dsl.rb#287 + # source://prism//lib/prism/dsl.rb#290 sig do params( source: Prism::Source, @@ -9451,7 +9339,7 @@ module Prism::DSL # Create a new ConstantWriteNode node. # - # source://prism//lib/prism/dsl.rb#292 + # source://prism//lib/prism/dsl.rb#295 sig do params( source: Prism::Source, @@ -9468,7 +9356,7 @@ module Prism::DSL # Create a new DefNode node. # - # source://prism//lib/prism/dsl.rb#297 + # source://prism//lib/prism/dsl.rb#300 sig do params( source: Prism::Source, @@ -9493,7 +9381,7 @@ module Prism::DSL # Create a new DefinedNode node. # - # source://prism//lib/prism/dsl.rb#302 + # source://prism//lib/prism/dsl.rb#305 sig do params( source: Prism::Source, @@ -9510,7 +9398,7 @@ module Prism::DSL # Create a new ElseNode node. # - # source://prism//lib/prism/dsl.rb#307 + # source://prism//lib/prism/dsl.rb#310 sig do params( source: Prism::Source, @@ -9526,7 +9414,7 @@ module Prism::DSL # Create a new EmbeddedStatementsNode node. # - # source://prism//lib/prism/dsl.rb#312 + # source://prism//lib/prism/dsl.rb#315 sig do params( source: Prism::Source, @@ -9542,7 +9430,7 @@ module Prism::DSL # Create a new EmbeddedVariableNode node. # - # source://prism//lib/prism/dsl.rb#317 + # source://prism//lib/prism/dsl.rb#320 sig do params( source: Prism::Source, @@ -9557,13 +9445,13 @@ module Prism::DSL # Retrieve the value of one of the EncodingFlags flags. # - # source://prism//lib/prism/dsl.rb#863 + # source://prism//lib/prism/dsl.rb#866 sig { params(name: Symbol).returns(Integer) } def encoding_flag(name); end # Create a new EnsureNode node. # - # source://prism//lib/prism/dsl.rb#322 + # source://prism//lib/prism/dsl.rb#325 sig do params( source: Prism::Source, @@ -9579,7 +9467,7 @@ module Prism::DSL # Create a new FalseNode node. # - # source://prism//lib/prism/dsl.rb#327 + # source://prism//lib/prism/dsl.rb#330 sig do params( source: Prism::Source, @@ -9592,14 +9480,14 @@ module Prism::DSL # Create a new FindPatternNode node. # - # source://prism//lib/prism/dsl.rb#332 + # source://prism//lib/prism/dsl.rb#335 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), left: Prism::SplatNode, requireds: T::Array[Prism::Node], right: T.any(Prism::SplatNode, Prism::MissingNode), @@ -9611,7 +9499,7 @@ module Prism::DSL # Create a new FlipFlopNode node. # - # source://prism//lib/prism/dsl.rb#337 + # source://prism//lib/prism/dsl.rb#340 sig do params( source: Prism::Source, @@ -9627,7 +9515,7 @@ module Prism::DSL # Create a new FloatNode node. # - # source://prism//lib/prism/dsl.rb#342 + # source://prism//lib/prism/dsl.rb#345 sig do params( source: Prism::Source, @@ -9641,7 +9529,7 @@ module Prism::DSL # Create a new ForNode node. # - # source://prism//lib/prism/dsl.rb#347 + # source://prism//lib/prism/dsl.rb#350 sig do params( source: Prism::Source, @@ -9661,7 +9549,7 @@ module Prism::DSL # Create a new ForwardingArgumentsNode node. # - # source://prism//lib/prism/dsl.rb#352 + # source://prism//lib/prism/dsl.rb#355 sig do params( source: Prism::Source, @@ -9674,7 +9562,7 @@ module Prism::DSL # Create a new ForwardingParameterNode node. # - # source://prism//lib/prism/dsl.rb#357 + # source://prism//lib/prism/dsl.rb#360 sig do params( source: Prism::Source, @@ -9687,7 +9575,7 @@ module Prism::DSL # Create a new ForwardingSuperNode node. # - # source://prism//lib/prism/dsl.rb#362 + # source://prism//lib/prism/dsl.rb#365 sig do params( source: Prism::Source, @@ -9701,7 +9589,7 @@ module Prism::DSL # Create a new GlobalVariableAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#367 + # source://prism//lib/prism/dsl.rb#370 sig do params( source: Prism::Source, @@ -9718,7 +9606,7 @@ module Prism::DSL # Create a new GlobalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#372 + # source://prism//lib/prism/dsl.rb#375 sig do params( source: Prism::Source, @@ -9736,7 +9624,7 @@ module Prism::DSL # Create a new GlobalVariableOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#377 + # source://prism//lib/prism/dsl.rb#380 sig do params( source: Prism::Source, @@ -9753,7 +9641,7 @@ module Prism::DSL # Create a new GlobalVariableReadNode node. # - # source://prism//lib/prism/dsl.rb#382 + # source://prism//lib/prism/dsl.rb#385 sig do params( source: Prism::Source, @@ -9767,7 +9655,7 @@ module Prism::DSL # Create a new GlobalVariableTargetNode node. # - # source://prism//lib/prism/dsl.rb#387 + # source://prism//lib/prism/dsl.rb#390 sig do params( source: Prism::Source, @@ -9781,7 +9669,7 @@ module Prism::DSL # Create a new GlobalVariableWriteNode node. # - # source://prism//lib/prism/dsl.rb#392 + # source://prism//lib/prism/dsl.rb#395 sig do params( source: Prism::Source, @@ -9798,7 +9686,7 @@ module Prism::DSL # Create a new HashNode node. # - # source://prism//lib/prism/dsl.rb#397 + # source://prism//lib/prism/dsl.rb#400 sig do params( source: Prism::Source, @@ -9814,14 +9702,14 @@ module Prism::DSL # Create a new HashPatternNode node. # - # source://prism//lib/prism/dsl.rb#402 + # source://prism//lib/prism/dsl.rb#405 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), elements: T::Array[Prism::AssocNode], rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)), opening_loc: T.nilable(Prism::Location), @@ -9832,7 +9720,7 @@ module Prism::DSL # Create a new IfNode node. # - # source://prism//lib/prism/dsl.rb#407 + # source://prism//lib/prism/dsl.rb#410 sig do params( source: Prism::Source, @@ -9851,7 +9739,7 @@ module Prism::DSL # Create a new ImaginaryNode node. # - # source://prism//lib/prism/dsl.rb#412 + # source://prism//lib/prism/dsl.rb#415 sig do params( source: Prism::Source, @@ -9865,7 +9753,7 @@ module Prism::DSL # Create a new ImplicitNode node. # - # source://prism//lib/prism/dsl.rb#417 + # source://prism//lib/prism/dsl.rb#420 sig do params( source: Prism::Source, @@ -9879,7 +9767,7 @@ module Prism::DSL # Create a new ImplicitRestNode node. # - # source://prism//lib/prism/dsl.rb#422 + # source://prism//lib/prism/dsl.rb#425 sig do params( source: Prism::Source, @@ -9892,7 +9780,7 @@ module Prism::DSL # Create a new InNode node. # - # source://prism//lib/prism/dsl.rb#427 + # source://prism//lib/prism/dsl.rb#430 sig do params( source: Prism::Source, @@ -9909,7 +9797,7 @@ module Prism::DSL # Create a new IndexAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#432 + # source://prism//lib/prism/dsl.rb#435 sig do params( source: Prism::Source, @@ -9930,7 +9818,7 @@ module Prism::DSL # Create a new IndexOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#437 + # source://prism//lib/prism/dsl.rb#440 sig do params( source: Prism::Source, @@ -9952,7 +9840,7 @@ module Prism::DSL # Create a new IndexOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#442 + # source://prism//lib/prism/dsl.rb#445 sig do params( source: Prism::Source, @@ -9973,7 +9861,7 @@ module Prism::DSL # Create a new IndexTargetNode node. # - # source://prism//lib/prism/dsl.rb#447 + # source://prism//lib/prism/dsl.rb#450 sig do params( source: Prism::Source, @@ -9991,7 +9879,7 @@ module Prism::DSL # Create a new InstanceVariableAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#452 + # source://prism//lib/prism/dsl.rb#455 sig do params( source: Prism::Source, @@ -10008,7 +9896,7 @@ module Prism::DSL # Create a new InstanceVariableOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#457 + # source://prism//lib/prism/dsl.rb#460 sig do params( source: Prism::Source, @@ -10026,7 +9914,7 @@ module Prism::DSL # Create a new InstanceVariableOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#462 + # source://prism//lib/prism/dsl.rb#465 sig do params( source: Prism::Source, @@ -10043,7 +9931,7 @@ module Prism::DSL # Create a new InstanceVariableReadNode node. # - # source://prism//lib/prism/dsl.rb#467 + # source://prism//lib/prism/dsl.rb#470 sig do params( source: Prism::Source, @@ -10057,7 +9945,7 @@ module Prism::DSL # Create a new InstanceVariableTargetNode node. # - # source://prism//lib/prism/dsl.rb#472 + # source://prism//lib/prism/dsl.rb#475 sig do params( source: Prism::Source, @@ -10071,7 +9959,7 @@ module Prism::DSL # Create a new InstanceVariableWriteNode node. # - # source://prism//lib/prism/dsl.rb#477 + # source://prism//lib/prism/dsl.rb#480 sig do params( source: Prism::Source, @@ -10088,13 +9976,13 @@ module Prism::DSL # Retrieve the value of one of the IntegerBaseFlags flags. # - # source://prism//lib/prism/dsl.rb#872 + # source://prism//lib/prism/dsl.rb#875 sig { params(name: Symbol).returns(Integer) } def integer_base_flag(name); end # Create a new IntegerNode node. # - # source://prism//lib/prism/dsl.rb#482 + # source://prism//lib/prism/dsl.rb#485 sig do params( source: Prism::Source, @@ -10108,7 +9996,7 @@ module Prism::DSL # Create a new InterpolatedMatchLastLineNode node. # - # source://prism//lib/prism/dsl.rb#487 + # source://prism//lib/prism/dsl.rb#490 sig do params( source: Prism::Source, @@ -10124,7 +10012,7 @@ module Prism::DSL # Create a new InterpolatedRegularExpressionNode node. # - # source://prism//lib/prism/dsl.rb#492 + # source://prism//lib/prism/dsl.rb#495 sig do params( source: Prism::Source, @@ -10140,7 +10028,7 @@ module Prism::DSL # Create a new InterpolatedStringNode node. # - # source://prism//lib/prism/dsl.rb#497 + # source://prism//lib/prism/dsl.rb#500 sig do params( source: Prism::Source, @@ -10156,13 +10044,13 @@ module Prism::DSL # Retrieve the value of one of the InterpolatedStringNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#883 + # source://prism//lib/prism/dsl.rb#886 sig { params(name: Symbol).returns(Integer) } def interpolated_string_node_flag(name); end # Create a new InterpolatedSymbolNode node. # - # source://prism//lib/prism/dsl.rb#502 + # source://prism//lib/prism/dsl.rb#505 sig do params( source: Prism::Source, @@ -10178,7 +10066,7 @@ module Prism::DSL # Create a new InterpolatedXStringNode node. # - # source://prism//lib/prism/dsl.rb#507 + # source://prism//lib/prism/dsl.rb#510 sig do params( source: Prism::Source, @@ -10194,7 +10082,7 @@ module Prism::DSL # Create a new ItLocalVariableReadNode node. # - # source://prism//lib/prism/dsl.rb#512 + # source://prism//lib/prism/dsl.rb#515 sig do params( source: Prism::Source, @@ -10207,7 +10095,7 @@ module Prism::DSL # Create a new ItParametersNode node. # - # source://prism//lib/prism/dsl.rb#517 + # source://prism//lib/prism/dsl.rb#520 sig do params( source: Prism::Source, @@ -10220,7 +10108,7 @@ module Prism::DSL # Create a new KeywordHashNode node. # - # source://prism//lib/prism/dsl.rb#522 + # source://prism//lib/prism/dsl.rb#525 sig do params( source: Prism::Source, @@ -10234,13 +10122,13 @@ module Prism::DSL # Retrieve the value of one of the KeywordHashNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#892 + # source://prism//lib/prism/dsl.rb#895 sig { params(name: Symbol).returns(Integer) } def keyword_hash_node_flag(name); end # Create a new KeywordRestParameterNode node. # - # source://prism//lib/prism/dsl.rb#527 + # source://prism//lib/prism/dsl.rb#530 sig do params( source: Prism::Source, @@ -10256,7 +10144,7 @@ module Prism::DSL # Create a new LambdaNode node. # - # source://prism//lib/prism/dsl.rb#532 + # source://prism//lib/prism/dsl.rb#535 sig do params( source: Prism::Source, @@ -10275,7 +10163,7 @@ module Prism::DSL # Create a new LocalVariableAndWriteNode node. # - # source://prism//lib/prism/dsl.rb#537 + # source://prism//lib/prism/dsl.rb#540 sig do params( source: Prism::Source, @@ -10293,7 +10181,7 @@ module Prism::DSL # Create a new LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dsl.rb#542 + # source://prism//lib/prism/dsl.rb#545 sig do params( source: Prism::Source, @@ -10312,7 +10200,7 @@ module Prism::DSL # Create a new LocalVariableOrWriteNode node. # - # source://prism//lib/prism/dsl.rb#547 + # source://prism//lib/prism/dsl.rb#550 sig do params( source: Prism::Source, @@ -10330,7 +10218,7 @@ module Prism::DSL # Create a new LocalVariableReadNode node. # - # source://prism//lib/prism/dsl.rb#552 + # source://prism//lib/prism/dsl.rb#555 sig do params( source: Prism::Source, @@ -10345,7 +10233,7 @@ module Prism::DSL # Create a new LocalVariableTargetNode node. # - # source://prism//lib/prism/dsl.rb#557 + # source://prism//lib/prism/dsl.rb#560 sig do params( source: Prism::Source, @@ -10360,7 +10248,7 @@ module Prism::DSL # Create a new LocalVariableWriteNode node. # - # source://prism//lib/prism/dsl.rb#562 + # source://prism//lib/prism/dsl.rb#565 sig do params( source: Prism::Source, @@ -10378,19 +10266,19 @@ module Prism::DSL # Create a new Location object. # - # source://prism//lib/prism/dsl.rb#72 + # source://prism//lib/prism/dsl.rb#75 sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) } def location(source: T.unsafe(nil), start_offset: T.unsafe(nil), length: T.unsafe(nil)); end # Retrieve the value of one of the LoopFlags flags. # - # source://prism//lib/prism/dsl.rb#900 + # source://prism//lib/prism/dsl.rb#903 sig { params(name: Symbol).returns(Integer) } def loop_flag(name); end # Create a new MatchLastLineNode node. # - # source://prism//lib/prism/dsl.rb#567 + # source://prism//lib/prism/dsl.rb#570 sig do params( source: Prism::Source, @@ -10407,7 +10295,7 @@ module Prism::DSL # Create a new MatchPredicateNode node. # - # source://prism//lib/prism/dsl.rb#572 + # source://prism//lib/prism/dsl.rb#575 sig do params( source: Prism::Source, @@ -10423,7 +10311,7 @@ module Prism::DSL # Create a new MatchRequiredNode node. # - # source://prism//lib/prism/dsl.rb#577 + # source://prism//lib/prism/dsl.rb#580 sig do params( source: Prism::Source, @@ -10439,7 +10327,7 @@ module Prism::DSL # Create a new MatchWriteNode node. # - # source://prism//lib/prism/dsl.rb#582 + # source://prism//lib/prism/dsl.rb#585 sig do params( source: Prism::Source, @@ -10454,7 +10342,7 @@ module Prism::DSL # Create a new MissingNode node. # - # source://prism//lib/prism/dsl.rb#587 + # source://prism//lib/prism/dsl.rb#590 sig do params( source: Prism::Source, @@ -10467,7 +10355,7 @@ module Prism::DSL # Create a new ModuleNode node. # - # source://prism//lib/prism/dsl.rb#592 + # source://prism//lib/prism/dsl.rb#595 sig do params( source: Prism::Source, @@ -10486,7 +10374,7 @@ module Prism::DSL # Create a new MultiTargetNode node. # - # source://prism//lib/prism/dsl.rb#597 + # source://prism//lib/prism/dsl.rb#600 sig do params( source: Prism::Source, @@ -10504,7 +10392,7 @@ module Prism::DSL # Create a new MultiWriteNode node. # - # source://prism//lib/prism/dsl.rb#602 + # source://prism//lib/prism/dsl.rb#605 sig do params( source: Prism::Source, @@ -10524,7 +10412,7 @@ module Prism::DSL # Create a new NextNode node. # - # source://prism//lib/prism/dsl.rb#607 + # source://prism//lib/prism/dsl.rb#610 sig do params( source: Prism::Source, @@ -10539,7 +10427,7 @@ module Prism::DSL # Create a new NilNode node. # - # source://prism//lib/prism/dsl.rb#612 + # source://prism//lib/prism/dsl.rb#615 sig do params( source: Prism::Source, @@ -10552,7 +10440,7 @@ module Prism::DSL # Create a new NoKeywordsParameterNode node. # - # source://prism//lib/prism/dsl.rb#617 + # source://prism//lib/prism/dsl.rb#620 sig do params( source: Prism::Source, @@ -10567,7 +10455,7 @@ module Prism::DSL # Create a new NumberedParametersNode node. # - # source://prism//lib/prism/dsl.rb#622 + # source://prism//lib/prism/dsl.rb#625 sig do params( source: Prism::Source, @@ -10581,7 +10469,7 @@ module Prism::DSL # Create a new NumberedReferenceReadNode node. # - # source://prism//lib/prism/dsl.rb#627 + # source://prism//lib/prism/dsl.rb#630 sig do params( source: Prism::Source, @@ -10595,7 +10483,7 @@ module Prism::DSL # Create a new OptionalKeywordParameterNode node. # - # source://prism//lib/prism/dsl.rb#632 + # source://prism//lib/prism/dsl.rb#635 sig do params( source: Prism::Source, @@ -10611,7 +10499,7 @@ module Prism::DSL # Create a new OptionalParameterNode node. # - # source://prism//lib/prism/dsl.rb#637 + # source://prism//lib/prism/dsl.rb#640 sig do params( source: Prism::Source, @@ -10628,7 +10516,7 @@ module Prism::DSL # Create a new OrNode node. # - # source://prism//lib/prism/dsl.rb#642 + # source://prism//lib/prism/dsl.rb#645 sig do params( source: Prism::Source, @@ -10644,13 +10532,13 @@ module Prism::DSL # Retrieve the value of one of the ParameterFlags flags. # - # source://prism//lib/prism/dsl.rb#908 + # source://prism//lib/prism/dsl.rb#911 sig { params(name: Symbol).returns(Integer) } def parameter_flag(name); end # Create a new ParametersNode node. # - # source://prism//lib/prism/dsl.rb#647 + # source://prism//lib/prism/dsl.rb#650 sig do params( source: Prism::Source, @@ -10670,7 +10558,7 @@ module Prism::DSL # Create a new ParenthesesNode node. # - # source://prism//lib/prism/dsl.rb#652 + # source://prism//lib/prism/dsl.rb#655 sig do params( source: Prism::Source, @@ -10686,13 +10574,13 @@ module Prism::DSL # Retrieve the value of one of the ParenthesesNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#916 + # source://prism//lib/prism/dsl.rb#919 sig { params(name: Symbol).returns(Integer) } def parentheses_node_flag(name); end # Create a new PinnedExpressionNode node. # - # source://prism//lib/prism/dsl.rb#657 + # source://prism//lib/prism/dsl.rb#660 sig do params( source: Prism::Source, @@ -10709,7 +10597,7 @@ module Prism::DSL # Create a new PinnedVariableNode node. # - # source://prism//lib/prism/dsl.rb#662 + # source://prism//lib/prism/dsl.rb#665 sig do params( source: Prism::Source, @@ -10724,7 +10612,7 @@ module Prism::DSL # Create a new PostExecutionNode node. # - # source://prism//lib/prism/dsl.rb#667 + # source://prism//lib/prism/dsl.rb#670 sig do params( source: Prism::Source, @@ -10741,7 +10629,7 @@ module Prism::DSL # Create a new PreExecutionNode node. # - # source://prism//lib/prism/dsl.rb#672 + # source://prism//lib/prism/dsl.rb#675 sig do params( source: Prism::Source, @@ -10758,7 +10646,7 @@ module Prism::DSL # Create a new ProgramNode node. # - # source://prism//lib/prism/dsl.rb#677 + # source://prism//lib/prism/dsl.rb#680 sig do params( source: Prism::Source, @@ -10773,13 +10661,13 @@ module Prism::DSL # Retrieve the value of one of the RangeFlags flags. # - # source://prism//lib/prism/dsl.rb#924 + # source://prism//lib/prism/dsl.rb#927 sig { params(name: Symbol).returns(Integer) } def range_flag(name); end # Create a new RangeNode node. # - # source://prism//lib/prism/dsl.rb#682 + # source://prism//lib/prism/dsl.rb#685 sig do params( source: Prism::Source, @@ -10795,7 +10683,7 @@ module Prism::DSL # Create a new RationalNode node. # - # source://prism//lib/prism/dsl.rb#687 + # source://prism//lib/prism/dsl.rb#690 sig do params( source: Prism::Source, @@ -10810,7 +10698,7 @@ module Prism::DSL # Create a new RedoNode node. # - # source://prism//lib/prism/dsl.rb#692 + # source://prism//lib/prism/dsl.rb#695 sig do params( source: Prism::Source, @@ -10823,13 +10711,13 @@ module Prism::DSL # Retrieve the value of one of the RegularExpressionFlags flags. # - # source://prism//lib/prism/dsl.rb#932 + # source://prism//lib/prism/dsl.rb#935 sig { params(name: Symbol).returns(Integer) } def regular_expression_flag(name); end # Create a new RegularExpressionNode node. # - # source://prism//lib/prism/dsl.rb#697 + # source://prism//lib/prism/dsl.rb#700 sig do params( source: Prism::Source, @@ -10846,7 +10734,7 @@ module Prism::DSL # Create a new RequiredKeywordParameterNode node. # - # source://prism//lib/prism/dsl.rb#702 + # source://prism//lib/prism/dsl.rb#705 sig do params( source: Prism::Source, @@ -10861,7 +10749,7 @@ module Prism::DSL # Create a new RequiredParameterNode node. # - # source://prism//lib/prism/dsl.rb#707 + # source://prism//lib/prism/dsl.rb#710 sig do params( source: Prism::Source, @@ -10875,7 +10763,7 @@ module Prism::DSL # Create a new RescueModifierNode node. # - # source://prism//lib/prism/dsl.rb#712 + # source://prism//lib/prism/dsl.rb#715 sig do params( source: Prism::Source, @@ -10891,7 +10779,7 @@ module Prism::DSL # Create a new RescueNode node. # - # source://prism//lib/prism/dsl.rb#717 + # source://prism//lib/prism/dsl.rb#720 sig do params( source: Prism::Source, @@ -10911,7 +10799,7 @@ module Prism::DSL # Create a new RestParameterNode node. # - # source://prism//lib/prism/dsl.rb#722 + # source://prism//lib/prism/dsl.rb#725 sig do params( source: Prism::Source, @@ -10927,7 +10815,7 @@ module Prism::DSL # Create a new RetryNode node. # - # source://prism//lib/prism/dsl.rb#727 + # source://prism//lib/prism/dsl.rb#730 sig do params( source: Prism::Source, @@ -10940,7 +10828,7 @@ module Prism::DSL # Create a new ReturnNode node. # - # source://prism//lib/prism/dsl.rb#732 + # source://prism//lib/prism/dsl.rb#735 sig do params( source: Prism::Source, @@ -10955,7 +10843,7 @@ module Prism::DSL # Create a new SelfNode node. # - # source://prism//lib/prism/dsl.rb#737 + # source://prism//lib/prism/dsl.rb#740 sig do params( source: Prism::Source, @@ -10968,7 +10856,7 @@ module Prism::DSL # Create a new ShareableConstantNode node. # - # source://prism//lib/prism/dsl.rb#742 + # source://prism//lib/prism/dsl.rb#745 sig do params( source: Prism::Source, @@ -10982,13 +10870,13 @@ module Prism::DSL # Retrieve the value of one of the ShareableConstantNodeFlags flags. # - # source://prism//lib/prism/dsl.rb#950 + # source://prism//lib/prism/dsl.rb#953 sig { params(name: Symbol).returns(Integer) } def shareable_constant_node_flag(name); end # Create a new SingletonClassNode node. # - # source://prism//lib/prism/dsl.rb#747 + # source://prism//lib/prism/dsl.rb#750 sig do params( source: Prism::Source, @@ -11007,13 +10895,13 @@ module Prism::DSL # Create a new Source object. # - # source://prism//lib/prism/dsl.rb#67 + # source://prism//lib/prism/dsl.rb#70 sig { params(string: String).returns(Prism::Source) } def source(string); end # Create a new SourceEncodingNode node. # - # source://prism//lib/prism/dsl.rb#752 + # source://prism//lib/prism/dsl.rb#755 sig do params( source: Prism::Source, @@ -11026,7 +10914,7 @@ module Prism::DSL # Create a new SourceFileNode node. # - # source://prism//lib/prism/dsl.rb#757 + # source://prism//lib/prism/dsl.rb#760 sig do params( source: Prism::Source, @@ -11040,7 +10928,7 @@ module Prism::DSL # Create a new SourceLineNode node. # - # source://prism//lib/prism/dsl.rb#762 + # source://prism//lib/prism/dsl.rb#765 sig do params( source: Prism::Source, @@ -11053,7 +10941,7 @@ module Prism::DSL # Create a new SplatNode node. # - # source://prism//lib/prism/dsl.rb#767 + # source://prism//lib/prism/dsl.rb#770 sig do params( source: Prism::Source, @@ -11068,7 +10956,7 @@ module Prism::DSL # Create a new StatementsNode node. # - # source://prism//lib/prism/dsl.rb#772 + # source://prism//lib/prism/dsl.rb#775 sig do params( source: Prism::Source, @@ -11082,13 +10970,13 @@ module Prism::DSL # Retrieve the value of one of the StringFlags flags. # - # source://prism//lib/prism/dsl.rb#960 + # source://prism//lib/prism/dsl.rb#963 sig { params(name: Symbol).returns(Integer) } def string_flag(name); end # Create a new StringNode node. # - # source://prism//lib/prism/dsl.rb#777 + # source://prism//lib/prism/dsl.rb#780 sig do params( source: Prism::Source, @@ -11105,7 +10993,7 @@ module Prism::DSL # Create a new SuperNode node. # - # source://prism//lib/prism/dsl.rb#782 + # source://prism//lib/prism/dsl.rb#785 sig do params( source: Prism::Source, @@ -11123,13 +11011,13 @@ module Prism::DSL # Retrieve the value of one of the SymbolFlags flags. # - # source://prism//lib/prism/dsl.rb#971 + # source://prism//lib/prism/dsl.rb#974 sig { params(name: Symbol).returns(Integer) } def symbol_flag(name); end # Create a new SymbolNode node. # - # source://prism//lib/prism/dsl.rb#787 + # source://prism//lib/prism/dsl.rb#790 sig do params( source: Prism::Source, @@ -11146,7 +11034,7 @@ module Prism::DSL # Create a new TrueNode node. # - # source://prism//lib/prism/dsl.rb#792 + # source://prism//lib/prism/dsl.rb#795 sig do params( source: Prism::Source, @@ -11159,7 +11047,7 @@ module Prism::DSL # Create a new UndefNode node. # - # source://prism//lib/prism/dsl.rb#797 + # source://prism//lib/prism/dsl.rb#800 sig do params( source: Prism::Source, @@ -11174,7 +11062,7 @@ module Prism::DSL # Create a new UnlessNode node. # - # source://prism//lib/prism/dsl.rb#802 + # source://prism//lib/prism/dsl.rb#805 sig do params( source: Prism::Source, @@ -11193,7 +11081,7 @@ module Prism::DSL # Create a new UntilNode node. # - # source://prism//lib/prism/dsl.rb#807 + # source://prism//lib/prism/dsl.rb#810 sig do params( source: Prism::Source, @@ -11211,7 +11099,7 @@ module Prism::DSL # Create a new WhenNode node. # - # source://prism//lib/prism/dsl.rb#812 + # source://prism//lib/prism/dsl.rb#815 sig do params( source: Prism::Source, @@ -11228,7 +11116,7 @@ module Prism::DSL # Create a new WhileNode node. # - # source://prism//lib/prism/dsl.rb#817 + # source://prism//lib/prism/dsl.rb#820 sig do params( source: Prism::Source, @@ -11246,7 +11134,7 @@ module Prism::DSL # Create a new XStringNode node. # - # source://prism//lib/prism/dsl.rb#822 + # source://prism//lib/prism/dsl.rb#825 sig do params( source: Prism::Source, @@ -11263,7 +11151,7 @@ module Prism::DSL # Create a new YieldNode node. # - # source://prism//lib/prism/dsl.rb#827 + # source://prism//lib/prism/dsl.rb#830 sig do params( source: Prism::Source, @@ -11283,21 +11171,21 @@ module Prism::DSL # The default location object that gets attached to nodes if no location is # specified, which uses the given source. # - # source://prism//lib/prism/dsl.rb#990 + # source://prism//lib/prism/dsl.rb#993 sig { returns(Prism::Location) } def default_location; end # The default node that gets attached to nodes if no node is specified for a # required node field. # - # source://prism//lib/prism/dsl.rb#996 + # source://prism//lib/prism/dsl.rb#999 sig { params(source: Prism::Source, location: Prism::Location).returns(Prism::Node) } def default_node(source, location); end # The default source object that gets attached to nodes and locations if no # source is specified. # - # source://prism//lib/prism/dsl.rb#984 + # source://prism//lib/prism/dsl.rb#987 sig { returns(Prism::Source) } def default_source; end end @@ -11308,13 +11196,13 @@ end # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5886 +# source://prism//lib/prism/node.rb#5916 class Prism::DefNode < ::Prism::Node # Initialize a new DefNode node. # # @return [DefNode] a new instance of DefNode # - # source://prism//lib/prism/node.rb#5888 + # source://prism//lib/prism/node.rb#5918 sig do params( source: Prism::Source, @@ -11340,42 +11228,42 @@ class Prism::DefNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6127 + # source://prism//lib/prism/node.rb#6157 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5908 + # source://prism//lib/prism/node.rb#5938 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: StatementsNode | BeginNode | nil # - # source://prism//lib/prism/node.rb#5967 + # source://prism//lib/prism/node.rb#5997 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5913 + # source://prism//lib/prism/node.rb#5943 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#5927 + # source://prism//lib/prism/node.rb#5957 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#5918 + # source://prism//lib/prism/node.rb#5948 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?receiver: Prism::node?, ?parameters: ParametersNode?, ?body: StatementsNode | BeginNode | nil, ?locals: Array[Symbol], ?def_keyword_loc: Location, ?operator_loc: Location?, ?lparen_loc: Location?, ?rparen_loc: Location?, ?equal_loc: Location?, ?end_keyword_loc: Location?) -> DefNode # - # source://prism//lib/prism/node.rb#5932 + # source://prism//lib/prism/node.rb#5962 sig do params( node_id: Integer, @@ -11397,52 +11285,52 @@ class Prism::DefNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), receiver: T.unsafe(nil), parameters: T.unsafe(nil), body: T.unsafe(nil), locals: T.unsafe(nil), def_keyword_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil), equal_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#5937 + # source://prism//lib/prism/node.rb#5967 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, receiver: Prism::node?, parameters: ParametersNode?, body: StatementsNode | BeginNode | nil, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location? } # - # source://prism//lib/prism/node.rb#5940 + # source://prism//lib/prism/node.rb#5970 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def def_keyword: () -> String # - # source://prism//lib/prism/node.rb#6081 + # source://prism//lib/prism/node.rb#6111 sig { returns(String) } def def_keyword; end # attr_reader def_keyword_loc: Location # - # source://prism//lib/prism/node.rb#5973 + # source://prism//lib/prism/node.rb#6003 sig { returns(Prism::Location) } def def_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6106 + # source://prism//lib/prism/node.rb#6136 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#6062 + # source://prism//lib/prism/node.rb#6092 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # def equal: () -> String? # - # source://prism//lib/prism/node.rb#6101 + # source://prism//lib/prism/node.rb#6131 sig { returns(T.nilable(String)) } def equal; end # attr_reader equal_loc: Location? # - # source://prism//lib/prism/node.rb#6043 + # source://prism//lib/prism/node.rb#6073 sig { returns(T.nilable(Prism::Location)) } def equal_loc; end @@ -11451,128 +11339,128 @@ class Prism::DefNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6111 + # source://prism//lib/prism/node.rb#6141 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#5970 + # source://prism//lib/prism/node.rb#6000 sig { returns(T::Array[Symbol]) } def locals; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6091 + # source://prism//lib/prism/node.rb#6121 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#6005 + # source://prism//lib/prism/node.rb#6035 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5945 + # source://prism//lib/prism/node.rb#5975 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5948 + # source://prism//lib/prism/node.rb#5978 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#6086 + # source://prism//lib/prism/node.rb#6116 sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//lib/prism/node.rb#5986 + # source://prism//lib/prism/node.rb#6016 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//lib/prism/node.rb#5964 + # source://prism//lib/prism/node.rb#5994 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#5961 + # source://prism//lib/prism/node.rb#5991 sig { returns(T.nilable(Prism::Node)) } def receiver; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6096 + # source://prism//lib/prism/node.rb#6126 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#6024 + # source://prism//lib/prism/node.rb#6054 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the def_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5981 + # source://prism//lib/prism/node.rb#6011 def save_def_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6076 + # source://prism//lib/prism/node.rb#6106 def save_end_keyword_loc(repository); end # Save the equal_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6057 + # source://prism//lib/prism/node.rb#6087 def save_equal_loc(repository); end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6019 + # source://prism//lib/prism/node.rb#6049 def save_lparen_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#5956 + # source://prism//lib/prism/node.rb#5986 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6000 + # source://prism//lib/prism/node.rb#6030 def save_operator_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6038 + # source://prism//lib/prism/node.rb#6068 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6116 + # source://prism//lib/prism/node.rb#6146 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6121 + # source://prism//lib/prism/node.rb#6151 def type; end end end @@ -11582,13 +11470,13 @@ end # defined?(a) # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6149 +# source://prism//lib/prism/node.rb#6179 class Prism::DefinedNode < ::Prism::Node # Initialize a new DefinedNode node. # # @return [DefinedNode] a new instance of DefinedNode # - # source://prism//lib/prism/node.rb#6151 + # source://prism//lib/prism/node.rb#6181 sig do params( source: Prism::Source, @@ -11606,36 +11494,36 @@ class Prism::DefinedNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6281 + # source://prism//lib/prism/node.rb#6311 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6163 + # source://prism//lib/prism/node.rb#6193 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6168 + # source://prism//lib/prism/node.rb#6198 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6178 + # source://prism//lib/prism/node.rb#6208 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6173 + # source://prism//lib/prism/node.rb#6203 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lparen_loc: Location?, ?value: Prism::node, ?rparen_loc: Location?, ?keyword_loc: Location) -> DefinedNode # - # source://prism//lib/prism/node.rb#6183 + # source://prism//lib/prism/node.rb#6213 sig do params( node_id: Integer, @@ -11649,16 +11537,16 @@ class Prism::DefinedNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), lparen_loc: T.unsafe(nil), value: T.unsafe(nil), rparen_loc: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6188 + # source://prism//lib/prism/node.rb#6218 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lparen_loc: Location?, value: Prism::node, rparen_loc: Location?, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#6191 + # source://prism//lib/prism/node.rb#6221 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -11667,128 +11555,128 @@ class Prism::DefinedNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6265 + # source://prism//lib/prism/node.rb#6295 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#6260 + # source://prism//lib/prism/node.rb#6290 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#6237 + # source://prism//lib/prism/node.rb#6267 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6250 + # source://prism//lib/prism/node.rb#6280 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#6196 + # source://prism//lib/prism/node.rb#6226 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6255 + # source://prism//lib/prism/node.rb#6285 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#6218 + # source://prism//lib/prism/node.rb#6248 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6245 + # source://prism//lib/prism/node.rb#6275 def save_keyword_loc(repository); end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6210 + # source://prism//lib/prism/node.rb#6240 def save_lparen_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6232 + # source://prism//lib/prism/node.rb#6262 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6270 + # source://prism//lib/prism/node.rb#6300 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#6215 + # source://prism//lib/prism/node.rb#6245 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6275 + # source://prism//lib/prism/node.rb#6305 def type; end end end -# source://prism//lib/prism/desugar_compiler.rb#4 +# source://prism//lib/prism/desugar_compiler.rb#5 class Prism::DesugarAndWriteNode include ::Prism::DSL # @return [DesugarAndWriteNode] a new instance of DesugarAndWriteNode # - # source://prism//lib/prism/desugar_compiler.rb#9 + # source://prism//lib/prism/desugar_compiler.rb#10 def initialize(node, default_source, read_class, write_class, **arguments); end # Returns the value of attribute arguments. # - # source://prism//lib/prism/desugar_compiler.rb#7 + # source://prism//lib/prism/desugar_compiler.rb#8 def arguments; end # Desugar `x &&= y` to `x && x = y` # - # source://prism//lib/prism/desugar_compiler.rb#18 + # source://prism//lib/prism/desugar_compiler.rb#19 def compile; end # Returns the value of attribute default_source. # - # source://prism//lib/prism/desugar_compiler.rb#7 + # source://prism//lib/prism/desugar_compiler.rb#8 def default_source; end # Returns the value of attribute node. # - # source://prism//lib/prism/desugar_compiler.rb#7 + # source://prism//lib/prism/desugar_compiler.rb#8 def node; end # Returns the value of attribute read_class. # - # source://prism//lib/prism/desugar_compiler.rb#7 + # source://prism//lib/prism/desugar_compiler.rb#8 def read_class; end # Returns the value of attribute write_class. # - # source://prism//lib/prism/desugar_compiler.rb#7 + # source://prism//lib/prism/desugar_compiler.rb#8 def write_class; end end # DesugarCompiler is a compiler that desugars Ruby code into a more primitive # form. This is useful for consumers that want to deal with fewer node types. # -# source://prism//lib/prism/desugar_compiler.rb#255 +# source://prism//lib/prism/desugar_compiler.rb#256 class Prism::DesugarCompiler < ::Prism::MutationCompiler # @@foo &&= bar # @@ -11796,7 +11684,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo && @@foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#261 + # source://prism//lib/prism/desugar_compiler.rb#262 def visit_class_variable_and_write_node(node); end # @@foo += bar @@ -11805,7 +11693,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo = @@foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#279 + # source://prism//lib/prism/desugar_compiler.rb#280 def visit_class_variable_operator_write_node(node); end # @@foo ||= bar @@ -11814,7 +11702,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(@@foo) ? @@foo : @@foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#270 + # source://prism//lib/prism/desugar_compiler.rb#271 def visit_class_variable_or_write_node(node); end # Foo &&= bar @@ -11823,7 +11711,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo && Foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#288 + # source://prism//lib/prism/desugar_compiler.rb#289 def visit_constant_and_write_node(node); end # Foo += bar @@ -11832,7 +11720,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo = Foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#306 + # source://prism//lib/prism/desugar_compiler.rb#307 def visit_constant_operator_write_node(node); end # Foo ||= bar @@ -11841,7 +11729,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(Foo) ? Foo : Foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#297 + # source://prism//lib/prism/desugar_compiler.rb#298 def visit_constant_or_write_node(node); end # $foo &&= bar @@ -11850,7 +11738,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo && $foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#315 + # source://prism//lib/prism/desugar_compiler.rb#316 def visit_global_variable_and_write_node(node); end # $foo += bar @@ -11859,7 +11747,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo = $foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#333 + # source://prism//lib/prism/desugar_compiler.rb#334 def visit_global_variable_operator_write_node(node); end # $foo ||= bar @@ -11868,22 +11756,22 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?($foo) ? $foo : $foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#324 + # source://prism//lib/prism/desugar_compiler.rb#325 def visit_global_variable_or_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#342 + # source://prism//lib/prism/desugar_compiler.rb#343 def visit_instance_variable_and_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#360 + # source://prism//lib/prism/desugar_compiler.rb#361 def visit_instance_variable_operator_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#351 + # source://prism//lib/prism/desugar_compiler.rb#352 def visit_instance_variable_or_write_node(node); end # foo &&= bar @@ -11892,7 +11780,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo && foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#369 + # source://prism//lib/prism/desugar_compiler.rb#370 def visit_local_variable_and_write_node(node); end # foo += bar @@ -11901,7 +11789,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo = foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#387 + # source://prism//lib/prism/desugar_compiler.rb#388 def visit_local_variable_operator_write_node(node); end # foo ||= bar @@ -11910,127 +11798,127 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo || foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#378 + # source://prism//lib/prism/desugar_compiler.rb#379 def visit_local_variable_or_write_node(node); end end -# source://prism//lib/prism/desugar_compiler.rb#86 +# source://prism//lib/prism/desugar_compiler.rb#87 class Prism::DesugarOperatorWriteNode include ::Prism::DSL # @return [DesugarOperatorWriteNode] a new instance of DesugarOperatorWriteNode # - # source://prism//lib/prism/desugar_compiler.rb#91 + # source://prism//lib/prism/desugar_compiler.rb#92 def initialize(node, default_source, read_class, write_class, **arguments); end # Returns the value of attribute arguments. # - # source://prism//lib/prism/desugar_compiler.rb#89 + # source://prism//lib/prism/desugar_compiler.rb#90 def arguments; end # Desugar `x += y` to `x = x + y` # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#101 def compile; end # Returns the value of attribute default_source. # - # source://prism//lib/prism/desugar_compiler.rb#89 + # source://prism//lib/prism/desugar_compiler.rb#90 def default_source; end # Returns the value of attribute node. # - # source://prism//lib/prism/desugar_compiler.rb#89 + # source://prism//lib/prism/desugar_compiler.rb#90 def node; end # Returns the value of attribute read_class. # - # source://prism//lib/prism/desugar_compiler.rb#89 + # source://prism//lib/prism/desugar_compiler.rb#90 def read_class; end # Returns the value of attribute write_class. # - # source://prism//lib/prism/desugar_compiler.rb#89 + # source://prism//lib/prism/desugar_compiler.rb#90 def write_class; end end -# source://prism//lib/prism/desugar_compiler.rb#35 +# source://prism//lib/prism/desugar_compiler.rb#36 class Prism::DesugarOrWriteDefinedNode include ::Prism::DSL # @return [DesugarOrWriteDefinedNode] a new instance of DesugarOrWriteDefinedNode # - # source://prism//lib/prism/desugar_compiler.rb#40 + # source://prism//lib/prism/desugar_compiler.rb#41 def initialize(node, default_source, read_class, write_class, **arguments); end # Returns the value of attribute arguments. # - # source://prism//lib/prism/desugar_compiler.rb#38 + # source://prism//lib/prism/desugar_compiler.rb#39 def arguments; end # Desugar `x ||= y` to `defined?(x) ? x : x = y` # - # source://prism//lib/prism/desugar_compiler.rb#49 + # source://prism//lib/prism/desugar_compiler.rb#50 def compile; end # Returns the value of attribute default_source. # - # source://prism//lib/prism/desugar_compiler.rb#38 + # source://prism//lib/prism/desugar_compiler.rb#39 def default_source; end # Returns the value of attribute node. # - # source://prism//lib/prism/desugar_compiler.rb#38 + # source://prism//lib/prism/desugar_compiler.rb#39 def node; end # Returns the value of attribute read_class. # - # source://prism//lib/prism/desugar_compiler.rb#38 + # source://prism//lib/prism/desugar_compiler.rb#39 def read_class; end # Returns the value of attribute write_class. # - # source://prism//lib/prism/desugar_compiler.rb#38 + # source://prism//lib/prism/desugar_compiler.rb#39 def write_class; end end -# source://prism//lib/prism/desugar_compiler.rb#130 +# source://prism//lib/prism/desugar_compiler.rb#131 class Prism::DesugarOrWriteNode include ::Prism::DSL # @return [DesugarOrWriteNode] a new instance of DesugarOrWriteNode # - # source://prism//lib/prism/desugar_compiler.rb#135 + # source://prism//lib/prism/desugar_compiler.rb#136 def initialize(node, default_source, read_class, write_class, **arguments); end # Returns the value of attribute arguments. # - # source://prism//lib/prism/desugar_compiler.rb#133 + # source://prism//lib/prism/desugar_compiler.rb#134 def arguments; end # Desugar `x ||= y` to `x || x = y` # - # source://prism//lib/prism/desugar_compiler.rb#144 + # source://prism//lib/prism/desugar_compiler.rb#145 def compile; end # Returns the value of attribute default_source. # - # source://prism//lib/prism/desugar_compiler.rb#133 + # source://prism//lib/prism/desugar_compiler.rb#134 def default_source; end # Returns the value of attribute node. # - # source://prism//lib/prism/desugar_compiler.rb#133 + # source://prism//lib/prism/desugar_compiler.rb#134 def node; end # Returns the value of attribute read_class. # - # source://prism//lib/prism/desugar_compiler.rb#133 + # source://prism//lib/prism/desugar_compiler.rb#134 def read_class; end # Returns the value of attribute write_class. # - # source://prism//lib/prism/desugar_compiler.rb#133 + # source://prism//lib/prism/desugar_compiler.rb#134 def write_class; end end @@ -12066,2491 +11954,2506 @@ end # integer = result.value.statements.body.first.receiver.receiver # dispatcher.dispatch_once(integer) # -# source://prism//lib/prism/dispatcher.rb#42 +# source://prism//lib/prism/dispatcher.rb#45 class Prism::Dispatcher < ::Prism::Visitor # Initialize a new dispatcher. # # @return [Dispatcher] a new instance of Dispatcher # - # source://prism//lib/prism/dispatcher.rb#47 + # source://prism//lib/prism/dispatcher.rb#50 def initialize; end # Walks `root` dispatching events to all registered listeners. # # def dispatch: (Node) -> void # - # source://prism//lib/prism/dispatcher.rb#61 + # source://prism//lib/prism/dispatcher.rb#77 def dispatch(node); end # Dispatches a single event for `node` to all registered listeners. # # def dispatch_once: (Node) -> void # - # source://prism//lib/prism/dispatcher.rb#66 + # source://prism//lib/prism/dispatcher.rb#82 def dispatch_once(node); end # attr_reader listeners: Hash[Symbol, Array[Listener]] # - # source://prism//lib/prism/dispatcher.rb#44 + # source://prism//lib/prism/dispatcher.rb#47 def listeners; end # Register a listener for one or more events. # # def register: (Listener, *Symbol) -> void # - # source://prism//lib/prism/dispatcher.rb#54 + # source://prism//lib/prism/dispatcher.rb#57 def register(listener, *events); end + # Register all public methods of a listener that match the pattern + # `on__(enter|leave)`. + # + # def register_public_methods: (Listener) -> void + # + # source://prism//lib/prism/dispatcher.rb#65 + def register_public_methods(listener); end + # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#72 + # source://prism//lib/prism/dispatcher.rb#88 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#80 + # source://prism//lib/prism/dispatcher.rb#96 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#88 + # source://prism//lib/prism/dispatcher.rb#104 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#96 + # source://prism//lib/prism/dispatcher.rb#112 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#104 + # source://prism//lib/prism/dispatcher.rb#120 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#112 + # source://prism//lib/prism/dispatcher.rb#128 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#120 + # source://prism//lib/prism/dispatcher.rb#136 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#128 + # source://prism//lib/prism/dispatcher.rb#144 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#136 + # source://prism//lib/prism/dispatcher.rb#152 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#144 + # source://prism//lib/prism/dispatcher.rb#160 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#152 + # source://prism//lib/prism/dispatcher.rb#168 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#160 + # source://prism//lib/prism/dispatcher.rb#176 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#168 + # source://prism//lib/prism/dispatcher.rb#184 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#176 + # source://prism//lib/prism/dispatcher.rb#192 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#184 + # source://prism//lib/prism/dispatcher.rb#200 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#192 + # source://prism//lib/prism/dispatcher.rb#208 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#200 + # source://prism//lib/prism/dispatcher.rb#216 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#208 + # source://prism//lib/prism/dispatcher.rb#224 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#216 + # source://prism//lib/prism/dispatcher.rb#232 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#224 + # source://prism//lib/prism/dispatcher.rb#240 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#232 + # source://prism//lib/prism/dispatcher.rb#248 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#240 + # source://prism//lib/prism/dispatcher.rb#256 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#248 + # source://prism//lib/prism/dispatcher.rb#264 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#256 + # source://prism//lib/prism/dispatcher.rb#272 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#264 + # source://prism//lib/prism/dispatcher.rb#280 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#272 + # source://prism//lib/prism/dispatcher.rb#288 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#280 + # source://prism//lib/prism/dispatcher.rb#296 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#288 + # source://prism//lib/prism/dispatcher.rb#304 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#296 + # source://prism//lib/prism/dispatcher.rb#312 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#304 + # source://prism//lib/prism/dispatcher.rb#320 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#312 + # source://prism//lib/prism/dispatcher.rb#328 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#320 + # source://prism//lib/prism/dispatcher.rb#336 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#328 + # source://prism//lib/prism/dispatcher.rb#344 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#336 + # source://prism//lib/prism/dispatcher.rb#352 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#344 + # source://prism//lib/prism/dispatcher.rb#360 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#352 + # source://prism//lib/prism/dispatcher.rb#368 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#360 + # source://prism//lib/prism/dispatcher.rb#376 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#368 + # source://prism//lib/prism/dispatcher.rb#384 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#376 + # source://prism//lib/prism/dispatcher.rb#392 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#384 + # source://prism//lib/prism/dispatcher.rb#400 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#392 + # source://prism//lib/prism/dispatcher.rb#408 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#400 + # source://prism//lib/prism/dispatcher.rb#416 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#408 + # source://prism//lib/prism/dispatcher.rb#424 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#416 + # source://prism//lib/prism/dispatcher.rb#432 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#424 + # source://prism//lib/prism/dispatcher.rb#440 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#432 + # source://prism//lib/prism/dispatcher.rb#448 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#440 + # source://prism//lib/prism/dispatcher.rb#456 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#448 + # source://prism//lib/prism/dispatcher.rb#464 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#456 + # source://prism//lib/prism/dispatcher.rb#472 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#464 + # source://prism//lib/prism/dispatcher.rb#480 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#472 + # source://prism//lib/prism/dispatcher.rb#488 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#480 + # source://prism//lib/prism/dispatcher.rb#496 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#488 + # source://prism//lib/prism/dispatcher.rb#504 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#496 + # source://prism//lib/prism/dispatcher.rb#512 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#504 + # source://prism//lib/prism/dispatcher.rb#520 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#512 + # source://prism//lib/prism/dispatcher.rb#528 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#520 + # source://prism//lib/prism/dispatcher.rb#536 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#528 + # source://prism//lib/prism/dispatcher.rb#544 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#536 + # source://prism//lib/prism/dispatcher.rb#552 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#544 + # source://prism//lib/prism/dispatcher.rb#560 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#552 + # source://prism//lib/prism/dispatcher.rb#568 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#560 + # source://prism//lib/prism/dispatcher.rb#576 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#568 + # source://prism//lib/prism/dispatcher.rb#584 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#576 + # source://prism//lib/prism/dispatcher.rb#592 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#584 + # source://prism//lib/prism/dispatcher.rb#600 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#592 + # source://prism//lib/prism/dispatcher.rb#608 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#600 + # source://prism//lib/prism/dispatcher.rb#616 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#608 + # source://prism//lib/prism/dispatcher.rb#624 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#616 + # source://prism//lib/prism/dispatcher.rb#632 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#624 + # source://prism//lib/prism/dispatcher.rb#640 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#632 + # source://prism//lib/prism/dispatcher.rb#648 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#640 + # source://prism//lib/prism/dispatcher.rb#656 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#648 + # source://prism//lib/prism/dispatcher.rb#664 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#656 + # source://prism//lib/prism/dispatcher.rb#672 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#664 + # source://prism//lib/prism/dispatcher.rb#680 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#672 + # source://prism//lib/prism/dispatcher.rb#688 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#680 + # source://prism//lib/prism/dispatcher.rb#696 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#688 + # source://prism//lib/prism/dispatcher.rb#704 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#696 + # source://prism//lib/prism/dispatcher.rb#712 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#704 + # source://prism//lib/prism/dispatcher.rb#720 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#712 + # source://prism//lib/prism/dispatcher.rb#728 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#720 + # source://prism//lib/prism/dispatcher.rb#736 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#728 + # source://prism//lib/prism/dispatcher.rb#744 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#736 + # source://prism//lib/prism/dispatcher.rb#752 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#744 + # source://prism//lib/prism/dispatcher.rb#760 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#752 + # source://prism//lib/prism/dispatcher.rb#768 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#760 + # source://prism//lib/prism/dispatcher.rb#776 def visit_interpolated_x_string_node(node); end # Dispatch enter and leave events for ItLocalVariableReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#768 + # source://prism//lib/prism/dispatcher.rb#784 def visit_it_local_variable_read_node(node); end # Dispatch enter and leave events for ItParametersNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#776 + # source://prism//lib/prism/dispatcher.rb#792 def visit_it_parameters_node(node); end # Dispatch enter and leave events for KeywordHashNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#784 + # source://prism//lib/prism/dispatcher.rb#800 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#792 + # source://prism//lib/prism/dispatcher.rb#808 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#800 + # source://prism//lib/prism/dispatcher.rb#816 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#808 + # source://prism//lib/prism/dispatcher.rb#824 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#816 + # source://prism//lib/prism/dispatcher.rb#832 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#824 + # source://prism//lib/prism/dispatcher.rb#840 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#832 + # source://prism//lib/prism/dispatcher.rb#848 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#840 + # source://prism//lib/prism/dispatcher.rb#856 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#848 + # source://prism//lib/prism/dispatcher.rb#864 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#856 + # source://prism//lib/prism/dispatcher.rb#872 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#864 + # source://prism//lib/prism/dispatcher.rb#880 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#872 + # source://prism//lib/prism/dispatcher.rb#888 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#880 + # source://prism//lib/prism/dispatcher.rb#896 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#888 + # source://prism//lib/prism/dispatcher.rb#904 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#896 + # source://prism//lib/prism/dispatcher.rb#912 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#904 + # source://prism//lib/prism/dispatcher.rb#920 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#912 + # source://prism//lib/prism/dispatcher.rb#928 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#920 + # source://prism//lib/prism/dispatcher.rb#936 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#928 + # source://prism//lib/prism/dispatcher.rb#944 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#936 + # source://prism//lib/prism/dispatcher.rb#952 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#944 + # source://prism//lib/prism/dispatcher.rb#960 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#952 + # source://prism//lib/prism/dispatcher.rb#968 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#960 + # source://prism//lib/prism/dispatcher.rb#976 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#968 + # source://prism//lib/prism/dispatcher.rb#984 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#976 + # source://prism//lib/prism/dispatcher.rb#992 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#984 + # source://prism//lib/prism/dispatcher.rb#1000 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#992 + # source://prism//lib/prism/dispatcher.rb#1008 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1000 + # source://prism//lib/prism/dispatcher.rb#1016 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1008 + # source://prism//lib/prism/dispatcher.rb#1024 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1016 + # source://prism//lib/prism/dispatcher.rb#1032 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1024 + # source://prism//lib/prism/dispatcher.rb#1040 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1032 + # source://prism//lib/prism/dispatcher.rb#1048 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1040 + # source://prism//lib/prism/dispatcher.rb#1056 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1048 + # source://prism//lib/prism/dispatcher.rb#1064 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1056 + # source://prism//lib/prism/dispatcher.rb#1072 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1064 + # source://prism//lib/prism/dispatcher.rb#1080 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1072 + # source://prism//lib/prism/dispatcher.rb#1088 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1080 + # source://prism//lib/prism/dispatcher.rb#1096 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1088 + # source://prism//lib/prism/dispatcher.rb#1104 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1096 + # source://prism//lib/prism/dispatcher.rb#1112 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1104 + # source://prism//lib/prism/dispatcher.rb#1120 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1112 + # source://prism//lib/prism/dispatcher.rb#1128 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1120 + # source://prism//lib/prism/dispatcher.rb#1136 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1128 + # source://prism//lib/prism/dispatcher.rb#1144 def visit_self_node(node); end # Dispatch enter and leave events for ShareableConstantNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1136 + # source://prism//lib/prism/dispatcher.rb#1152 def visit_shareable_constant_node(node); end # Dispatch enter and leave events for SingletonClassNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1144 + # source://prism//lib/prism/dispatcher.rb#1160 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1152 + # source://prism//lib/prism/dispatcher.rb#1168 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1160 + # source://prism//lib/prism/dispatcher.rb#1176 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1168 + # source://prism//lib/prism/dispatcher.rb#1184 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1176 + # source://prism//lib/prism/dispatcher.rb#1192 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1184 + # source://prism//lib/prism/dispatcher.rb#1200 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1192 + # source://prism//lib/prism/dispatcher.rb#1208 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1200 + # source://prism//lib/prism/dispatcher.rb#1216 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1208 + # source://prism//lib/prism/dispatcher.rb#1224 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1216 + # source://prism//lib/prism/dispatcher.rb#1232 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1224 + # source://prism//lib/prism/dispatcher.rb#1240 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1232 + # source://prism//lib/prism/dispatcher.rb#1248 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1240 + # source://prism//lib/prism/dispatcher.rb#1256 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1248 + # source://prism//lib/prism/dispatcher.rb#1264 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1256 + # source://prism//lib/prism/dispatcher.rb#1272 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1264 + # source://prism//lib/prism/dispatcher.rb#1280 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#1272 + # source://prism//lib/prism/dispatcher.rb#1288 def visit_yield_node(node); end + + private + + # Register a listener for the given events. + # + # source://prism//lib/prism/dispatcher.rb#70 + def register_events(listener, events); end end -# source://prism//lib/prism/dispatcher.rb#1278 +# source://prism//lib/prism/dispatcher.rb#1294 class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor # @return [DispatchOnce] a new instance of DispatchOnce # - # source://prism//lib/prism/dispatcher.rb#1281 + # source://prism//lib/prism/dispatcher.rb#1297 def initialize(listeners); end # Returns the value of attribute listeners. # - # source://prism//lib/prism/dispatcher.rb#1279 + # source://prism//lib/prism/dispatcher.rb#1295 def listeners; end # Dispatch enter and leave events for AliasGlobalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1286 + # source://prism//lib/prism/dispatcher.rb#1302 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1292 + # source://prism//lib/prism/dispatcher.rb#1308 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1298 + # source://prism//lib/prism/dispatcher.rb#1314 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1304 + # source://prism//lib/prism/dispatcher.rb#1320 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1310 + # source://prism//lib/prism/dispatcher.rb#1326 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1316 + # source://prism//lib/prism/dispatcher.rb#1332 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1322 + # source://prism//lib/prism/dispatcher.rb#1338 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1328 + # source://prism//lib/prism/dispatcher.rb#1344 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1334 + # source://prism//lib/prism/dispatcher.rb#1350 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1340 + # source://prism//lib/prism/dispatcher.rb#1356 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1346 + # source://prism//lib/prism/dispatcher.rb#1362 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1352 + # source://prism//lib/prism/dispatcher.rb#1368 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1358 + # source://prism//lib/prism/dispatcher.rb#1374 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1364 + # source://prism//lib/prism/dispatcher.rb#1380 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1370 + # source://prism//lib/prism/dispatcher.rb#1386 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1376 + # source://prism//lib/prism/dispatcher.rb#1392 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1382 + # source://prism//lib/prism/dispatcher.rb#1398 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1388 + # source://prism//lib/prism/dispatcher.rb#1404 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1394 + # source://prism//lib/prism/dispatcher.rb#1410 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1400 + # source://prism//lib/prism/dispatcher.rb#1416 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1406 + # source://prism//lib/prism/dispatcher.rb#1422 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1412 + # source://prism//lib/prism/dispatcher.rb#1428 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1418 + # source://prism//lib/prism/dispatcher.rb#1434 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1424 + # source://prism//lib/prism/dispatcher.rb#1440 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1430 + # source://prism//lib/prism/dispatcher.rb#1446 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1436 + # source://prism//lib/prism/dispatcher.rb#1452 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1442 + # source://prism//lib/prism/dispatcher.rb#1458 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1448 + # source://prism//lib/prism/dispatcher.rb#1464 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1454 + # source://prism//lib/prism/dispatcher.rb#1470 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1460 + # source://prism//lib/prism/dispatcher.rb#1476 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1466 + # source://prism//lib/prism/dispatcher.rb#1482 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1472 + # source://prism//lib/prism/dispatcher.rb#1488 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1478 + # source://prism//lib/prism/dispatcher.rb#1494 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1484 + # source://prism//lib/prism/dispatcher.rb#1500 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1490 + # source://prism//lib/prism/dispatcher.rb#1506 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1496 + # source://prism//lib/prism/dispatcher.rb#1512 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1502 + # source://prism//lib/prism/dispatcher.rb#1518 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1508 + # source://prism//lib/prism/dispatcher.rb#1524 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1514 + # source://prism//lib/prism/dispatcher.rb#1530 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1520 + # source://prism//lib/prism/dispatcher.rb#1536 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1526 + # source://prism//lib/prism/dispatcher.rb#1542 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1532 + # source://prism//lib/prism/dispatcher.rb#1548 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1538 + # source://prism//lib/prism/dispatcher.rb#1554 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1544 + # source://prism//lib/prism/dispatcher.rb#1560 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1550 + # source://prism//lib/prism/dispatcher.rb#1566 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1556 + # source://prism//lib/prism/dispatcher.rb#1572 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1562 + # source://prism//lib/prism/dispatcher.rb#1578 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1568 + # source://prism//lib/prism/dispatcher.rb#1584 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1574 + # source://prism//lib/prism/dispatcher.rb#1590 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1580 + # source://prism//lib/prism/dispatcher.rb#1596 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1586 + # source://prism//lib/prism/dispatcher.rb#1602 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1592 + # source://prism//lib/prism/dispatcher.rb#1608 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1598 + # source://prism//lib/prism/dispatcher.rb#1614 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1604 + # source://prism//lib/prism/dispatcher.rb#1620 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1610 + # source://prism//lib/prism/dispatcher.rb#1626 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1616 + # source://prism//lib/prism/dispatcher.rb#1632 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1622 + # source://prism//lib/prism/dispatcher.rb#1638 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1628 + # source://prism//lib/prism/dispatcher.rb#1644 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1634 + # source://prism//lib/prism/dispatcher.rb#1650 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1640 + # source://prism//lib/prism/dispatcher.rb#1656 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1646 + # source://prism//lib/prism/dispatcher.rb#1662 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1652 + # source://prism//lib/prism/dispatcher.rb#1668 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1658 + # source://prism//lib/prism/dispatcher.rb#1674 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1664 + # source://prism//lib/prism/dispatcher.rb#1680 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1670 + # source://prism//lib/prism/dispatcher.rb#1686 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1676 + # source://prism//lib/prism/dispatcher.rb#1692 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1682 + # source://prism//lib/prism/dispatcher.rb#1698 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1688 + # source://prism//lib/prism/dispatcher.rb#1704 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1694 + # source://prism//lib/prism/dispatcher.rb#1710 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1700 + # source://prism//lib/prism/dispatcher.rb#1716 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1706 + # source://prism//lib/prism/dispatcher.rb#1722 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1712 + # source://prism//lib/prism/dispatcher.rb#1728 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1718 + # source://prism//lib/prism/dispatcher.rb#1734 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1724 + # source://prism//lib/prism/dispatcher.rb#1740 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1730 + # source://prism//lib/prism/dispatcher.rb#1746 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1736 + # source://prism//lib/prism/dispatcher.rb#1752 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1742 + # source://prism//lib/prism/dispatcher.rb#1758 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1748 + # source://prism//lib/prism/dispatcher.rb#1764 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1754 + # source://prism//lib/prism/dispatcher.rb#1770 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1760 + # source://prism//lib/prism/dispatcher.rb#1776 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1766 + # source://prism//lib/prism/dispatcher.rb#1782 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1772 + # source://prism//lib/prism/dispatcher.rb#1788 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1778 + # source://prism//lib/prism/dispatcher.rb#1794 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1784 + # source://prism//lib/prism/dispatcher.rb#1800 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1790 + # source://prism//lib/prism/dispatcher.rb#1806 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1796 + # source://prism//lib/prism/dispatcher.rb#1812 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1802 + # source://prism//lib/prism/dispatcher.rb#1818 def visit_interpolated_x_string_node(node); end # Dispatch enter and leave events for ItLocalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1808 + # source://prism//lib/prism/dispatcher.rb#1824 def visit_it_local_variable_read_node(node); end # Dispatch enter and leave events for ItParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1814 + # source://prism//lib/prism/dispatcher.rb#1830 def visit_it_parameters_node(node); end # Dispatch enter and leave events for KeywordHashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1820 + # source://prism//lib/prism/dispatcher.rb#1836 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1826 + # source://prism//lib/prism/dispatcher.rb#1842 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1832 + # source://prism//lib/prism/dispatcher.rb#1848 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1838 + # source://prism//lib/prism/dispatcher.rb#1854 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1844 + # source://prism//lib/prism/dispatcher.rb#1860 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1850 + # source://prism//lib/prism/dispatcher.rb#1866 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1856 + # source://prism//lib/prism/dispatcher.rb#1872 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1862 + # source://prism//lib/prism/dispatcher.rb#1878 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1868 + # source://prism//lib/prism/dispatcher.rb#1884 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1874 + # source://prism//lib/prism/dispatcher.rb#1890 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1880 + # source://prism//lib/prism/dispatcher.rb#1896 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1886 + # source://prism//lib/prism/dispatcher.rb#1902 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1892 + # source://prism//lib/prism/dispatcher.rb#1908 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1898 + # source://prism//lib/prism/dispatcher.rb#1914 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1904 + # source://prism//lib/prism/dispatcher.rb#1920 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1910 + # source://prism//lib/prism/dispatcher.rb#1926 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1916 + # source://prism//lib/prism/dispatcher.rb#1932 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1922 + # source://prism//lib/prism/dispatcher.rb#1938 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1928 + # source://prism//lib/prism/dispatcher.rb#1944 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1934 + # source://prism//lib/prism/dispatcher.rb#1950 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1940 + # source://prism//lib/prism/dispatcher.rb#1956 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1946 + # source://prism//lib/prism/dispatcher.rb#1962 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1952 + # source://prism//lib/prism/dispatcher.rb#1968 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1958 + # source://prism//lib/prism/dispatcher.rb#1974 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1964 + # source://prism//lib/prism/dispatcher.rb#1980 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1970 + # source://prism//lib/prism/dispatcher.rb#1986 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1976 + # source://prism//lib/prism/dispatcher.rb#1992 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1982 + # source://prism//lib/prism/dispatcher.rb#1998 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1988 + # source://prism//lib/prism/dispatcher.rb#2004 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1994 + # source://prism//lib/prism/dispatcher.rb#2010 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2000 + # source://prism//lib/prism/dispatcher.rb#2016 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2006 + # source://prism//lib/prism/dispatcher.rb#2022 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2012 + # source://prism//lib/prism/dispatcher.rb#2028 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2018 + # source://prism//lib/prism/dispatcher.rb#2034 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2024 + # source://prism//lib/prism/dispatcher.rb#2040 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2030 + # source://prism//lib/prism/dispatcher.rb#2046 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2036 + # source://prism//lib/prism/dispatcher.rb#2052 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2042 + # source://prism//lib/prism/dispatcher.rb#2058 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2048 + # source://prism//lib/prism/dispatcher.rb#2064 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2054 + # source://prism//lib/prism/dispatcher.rb#2070 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2060 + # source://prism//lib/prism/dispatcher.rb#2076 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2066 + # source://prism//lib/prism/dispatcher.rb#2082 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2072 + # source://prism//lib/prism/dispatcher.rb#2088 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2078 + # source://prism//lib/prism/dispatcher.rb#2094 def visit_self_node(node); end # Dispatch enter and leave events for ShareableConstantNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2084 + # source://prism//lib/prism/dispatcher.rb#2100 def visit_shareable_constant_node(node); end # Dispatch enter and leave events for SingletonClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2090 + # source://prism//lib/prism/dispatcher.rb#2106 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2096 + # source://prism//lib/prism/dispatcher.rb#2112 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2102 + # source://prism//lib/prism/dispatcher.rb#2118 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2108 + # source://prism//lib/prism/dispatcher.rb#2124 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2114 + # source://prism//lib/prism/dispatcher.rb#2130 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2120 + # source://prism//lib/prism/dispatcher.rb#2136 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2126 + # source://prism//lib/prism/dispatcher.rb#2142 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2132 + # source://prism//lib/prism/dispatcher.rb#2148 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2138 + # source://prism//lib/prism/dispatcher.rb#2154 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2144 + # source://prism//lib/prism/dispatcher.rb#2160 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2150 + # source://prism//lib/prism/dispatcher.rb#2166 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2156 + # source://prism//lib/prism/dispatcher.rb#2172 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2162 + # source://prism//lib/prism/dispatcher.rb#2178 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2168 + # source://prism//lib/prism/dispatcher.rb#2184 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2174 + # source://prism//lib/prism/dispatcher.rb#2190 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2180 + # source://prism//lib/prism/dispatcher.rb#2196 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2186 + # source://prism//lib/prism/dispatcher.rb#2202 def visit_yield_node(node); end end # This visitor provides the ability to call Node#to_dot, which converts a # subtree into a graphviz dot graph. # -# source://prism//lib/prism/dot_visitor.rb#14 +# source://prism//lib/prism/dot_visitor.rb#18 class Prism::DotVisitor < ::Prism::Visitor # Initialize a new dot visitor. # # @return [DotVisitor] a new instance of DotVisitor # - # source://prism//lib/prism/dot_visitor.rb#106 + # source://prism//lib/prism/dot_visitor.rb#110 def initialize; end # The digraph that is being built. # - # source://prism//lib/prism/dot_visitor.rb#103 + # source://prism//lib/prism/dot_visitor.rb#107 def digraph; end # Convert this visitor into a graphviz dot graph string. # - # source://prism//lib/prism/dot_visitor.rb#111 + # source://prism//lib/prism/dot_visitor.rb#115 def to_dot; end # Visit a AliasGlobalVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#116 + # source://prism//lib/prism/dot_visitor.rb#120 def visit_alias_global_variable_node(node); end # Visit a AliasMethodNode node. # - # source://prism//lib/prism/dot_visitor.rb#141 + # source://prism//lib/prism/dot_visitor.rb#145 def visit_alias_method_node(node); end # Visit a AlternationPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#166 + # source://prism//lib/prism/dot_visitor.rb#170 def visit_alternation_pattern_node(node); end # Visit a AndNode node. # - # source://prism//lib/prism/dot_visitor.rb#191 + # source://prism//lib/prism/dot_visitor.rb#195 def visit_and_node(node); end # Visit a ArgumentsNode node. # - # source://prism//lib/prism/dot_visitor.rb#216 + # source://prism//lib/prism/dot_visitor.rb#220 def visit_arguments_node(node); end # Visit a ArrayNode node. # - # source://prism//lib/prism/dot_visitor.rb#246 + # source://prism//lib/prism/dot_visitor.rb#250 def visit_array_node(node); end # Visit a ArrayPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#286 + # source://prism//lib/prism/dot_visitor.rb#290 def visit_array_pattern_node(node); end # Visit a AssocNode node. # - # source://prism//lib/prism/dot_visitor.rb#348 + # source://prism//lib/prism/dot_visitor.rb#352 def visit_assoc_node(node); end # Visit a AssocSplatNode node. # - # source://prism//lib/prism/dot_visitor.rb#375 + # source://prism//lib/prism/dot_visitor.rb#379 def visit_assoc_splat_node(node); end # Visit a BackReferenceReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#398 + # source://prism//lib/prism/dot_visitor.rb#402 def visit_back_reference_read_node(node); end # Visit a BeginNode node. # - # source://prism//lib/prism/dot_visitor.rb#415 + # source://prism//lib/prism/dot_visitor.rb#419 def visit_begin_node(node); end # Visit a BlockArgumentNode node. # - # source://prism//lib/prism/dot_visitor.rb#463 + # source://prism//lib/prism/dot_visitor.rb#467 def visit_block_argument_node(node); end # Visit a BlockLocalVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#486 + # source://prism//lib/prism/dot_visitor.rb#490 def visit_block_local_variable_node(node); end # Visit a BlockNode node. # - # source://prism//lib/prism/dot_visitor.rb#506 + # source://prism//lib/prism/dot_visitor.rb#510 def visit_block_node(node); end # Visit a BlockParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#541 + # source://prism//lib/prism/dot_visitor.rb#545 def visit_block_parameter_node(node); end # Visit a BlockParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#569 + # source://prism//lib/prism/dot_visitor.rb#573 def visit_block_parameters_node(node); end # Visit a BreakNode node. # - # source://prism//lib/prism/dot_visitor.rb#612 + # source://prism//lib/prism/dot_visitor.rb#616 def visit_break_node(node); end # Visit a CallAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#635 + # source://prism//lib/prism/dot_visitor.rb#639 def visit_call_and_write_node(node); end # Visit a CallNode node. # - # source://prism//lib/prism/dot_visitor.rb#681 + # source://prism//lib/prism/dot_visitor.rb#685 def visit_call_node(node); end # Visit a CallOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#739 + # source://prism//lib/prism/dot_visitor.rb#743 def visit_call_operator_write_node(node); end # Visit a CallOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#788 + # source://prism//lib/prism/dot_visitor.rb#792 def visit_call_or_write_node(node); end # Visit a CallTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#834 + # source://prism//lib/prism/dot_visitor.rb#838 def visit_call_target_node(node); end # Visit a CapturePatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#864 + # source://prism//lib/prism/dot_visitor.rb#868 def visit_capture_pattern_node(node); end # Visit a CaseMatchNode node. # - # source://prism//lib/prism/dot_visitor.rb#889 + # source://prism//lib/prism/dot_visitor.rb#893 def visit_case_match_node(node); end # Visit a CaseNode node. # - # source://prism//lib/prism/dot_visitor.rb#934 + # source://prism//lib/prism/dot_visitor.rb#938 def visit_case_node(node); end # Visit a ClassNode node. # - # source://prism//lib/prism/dot_visitor.rb#979 + # source://prism//lib/prism/dot_visitor.rb#983 def visit_class_node(node); end # Visit a ClassVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1026 + # source://prism//lib/prism/dot_visitor.rb#1030 def visit_class_variable_and_write_node(node); end # Visit a ClassVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1053 + # source://prism//lib/prism/dot_visitor.rb#1057 def visit_class_variable_operator_write_node(node); end # Visit a ClassVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1083 + # source://prism//lib/prism/dot_visitor.rb#1087 def visit_class_variable_or_write_node(node); end # Visit a ClassVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1110 + # source://prism//lib/prism/dot_visitor.rb#1114 def visit_class_variable_read_node(node); end # Visit a ClassVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1127 + # source://prism//lib/prism/dot_visitor.rb#1131 def visit_class_variable_target_node(node); end # Visit a ClassVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1144 + # source://prism//lib/prism/dot_visitor.rb#1148 def visit_class_variable_write_node(node); end # Visit a ConstantAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1171 + # source://prism//lib/prism/dot_visitor.rb#1175 def visit_constant_and_write_node(node); end # Visit a ConstantOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1198 + # source://prism//lib/prism/dot_visitor.rb#1202 def visit_constant_operator_write_node(node); end # Visit a ConstantOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1228 + # source://prism//lib/prism/dot_visitor.rb#1232 def visit_constant_or_write_node(node); end # Visit a ConstantPathAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1255 + # source://prism//lib/prism/dot_visitor.rb#1259 def visit_constant_path_and_write_node(node); end # Visit a ConstantPathNode node. # - # source://prism//lib/prism/dot_visitor.rb#1280 + # source://prism//lib/prism/dot_visitor.rb#1284 def visit_constant_path_node(node); end # Visit a ConstantPathOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1309 + # source://prism//lib/prism/dot_visitor.rb#1313 def visit_constant_path_operator_write_node(node); end # Visit a ConstantPathOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1337 + # source://prism//lib/prism/dot_visitor.rb#1341 def visit_constant_path_or_write_node(node); end # Visit a ConstantPathTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1362 + # source://prism//lib/prism/dot_visitor.rb#1366 def visit_constant_path_target_node(node); end # Visit a ConstantPathWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1391 + # source://prism//lib/prism/dot_visitor.rb#1395 def visit_constant_path_write_node(node); end # Visit a ConstantReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1416 + # source://prism//lib/prism/dot_visitor.rb#1420 def visit_constant_read_node(node); end # Visit a ConstantTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1433 + # source://prism//lib/prism/dot_visitor.rb#1437 def visit_constant_target_node(node); end # Visit a ConstantWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1450 + # source://prism//lib/prism/dot_visitor.rb#1454 def visit_constant_write_node(node); end # Visit a DefNode node. # - # source://prism//lib/prism/dot_visitor.rb#1477 + # source://prism//lib/prism/dot_visitor.rb#1481 def visit_def_node(node); end # Visit a DefinedNode node. # - # source://prism//lib/prism/dot_visitor.rb#1546 + # source://prism//lib/prism/dot_visitor.rb#1550 def visit_defined_node(node); end # Visit a ElseNode node. # - # source://prism//lib/prism/dot_visitor.rb#1577 + # source://prism//lib/prism/dot_visitor.rb#1581 def visit_else_node(node); end # Visit a EmbeddedStatementsNode node. # - # source://prism//lib/prism/dot_visitor.rb#1605 + # source://prism//lib/prism/dot_visitor.rb#1609 def visit_embedded_statements_node(node); end # Visit a EmbeddedVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#1631 + # source://prism//lib/prism/dot_visitor.rb#1635 def visit_embedded_variable_node(node); end # Visit a EnsureNode node. # - # source://prism//lib/prism/dot_visitor.rb#1652 + # source://prism//lib/prism/dot_visitor.rb#1656 def visit_ensure_node(node); end # Visit a FalseNode node. # - # source://prism//lib/prism/dot_visitor.rb#1678 + # source://prism//lib/prism/dot_visitor.rb#1682 def visit_false_node(node); end # Visit a FindPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#1692 + # source://prism//lib/prism/dot_visitor.rb#1696 def visit_find_pattern_node(node); end # Visit a FlipFlopNode node. # - # source://prism//lib/prism/dot_visitor.rb#1743 + # source://prism//lib/prism/dot_visitor.rb#1747 def visit_flip_flop_node(node); end # Visit a FloatNode node. # - # source://prism//lib/prism/dot_visitor.rb#1775 + # source://prism//lib/prism/dot_visitor.rb#1779 def visit_float_node(node); end # Visit a ForNode node. # - # source://prism//lib/prism/dot_visitor.rb#1792 + # source://prism//lib/prism/dot_visitor.rb#1796 def visit_for_node(node); end # Visit a ForwardingArgumentsNode node. # - # source://prism//lib/prism/dot_visitor.rb#1834 + # source://prism//lib/prism/dot_visitor.rb#1838 def visit_forwarding_arguments_node(node); end # Visit a ForwardingParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#1848 + # source://prism//lib/prism/dot_visitor.rb#1852 def visit_forwarding_parameter_node(node); end # Visit a ForwardingSuperNode node. # - # source://prism//lib/prism/dot_visitor.rb#1862 + # source://prism//lib/prism/dot_visitor.rb#1866 def visit_forwarding_super_node(node); end # Visit a GlobalVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1882 + # source://prism//lib/prism/dot_visitor.rb#1886 def visit_global_variable_and_write_node(node); end # Visit a GlobalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1909 + # source://prism//lib/prism/dot_visitor.rb#1913 def visit_global_variable_operator_write_node(node); end # Visit a GlobalVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1939 + # source://prism//lib/prism/dot_visitor.rb#1943 def visit_global_variable_or_write_node(node); end # Visit a GlobalVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1966 + # source://prism//lib/prism/dot_visitor.rb#1970 def visit_global_variable_read_node(node); end # Visit a GlobalVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1983 + # source://prism//lib/prism/dot_visitor.rb#1987 def visit_global_variable_target_node(node); end # Visit a GlobalVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2000 + # source://prism//lib/prism/dot_visitor.rb#2004 def visit_global_variable_write_node(node); end # Visit a HashNode node. # - # source://prism//lib/prism/dot_visitor.rb#2027 + # source://prism//lib/prism/dot_visitor.rb#2031 def visit_hash_node(node); end # Visit a HashPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#2060 + # source://prism//lib/prism/dot_visitor.rb#2064 def visit_hash_pattern_node(node); end # Visit a IfNode node. # - # source://prism//lib/prism/dot_visitor.rb#2109 + # source://prism//lib/prism/dot_visitor.rb#2113 def visit_if_node(node); end # Visit a ImaginaryNode node. # - # source://prism//lib/prism/dot_visitor.rb#2154 + # source://prism//lib/prism/dot_visitor.rb#2158 def visit_imaginary_node(node); end # Visit a ImplicitNode node. # - # source://prism//lib/prism/dot_visitor.rb#2172 + # source://prism//lib/prism/dot_visitor.rb#2176 def visit_implicit_node(node); end # Visit a ImplicitRestNode node. # - # source://prism//lib/prism/dot_visitor.rb#2190 + # source://prism//lib/prism/dot_visitor.rb#2194 def visit_implicit_rest_node(node); end # Visit a InNode node. # - # source://prism//lib/prism/dot_visitor.rb#2204 + # source://prism//lib/prism/dot_visitor.rb#2208 def visit_in_node(node); end # Visit a IndexAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2236 + # source://prism//lib/prism/dot_visitor.rb#2240 def visit_index_and_write_node(node); end # Visit a IndexOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2289 + # source://prism//lib/prism/dot_visitor.rb#2293 def visit_index_operator_write_node(node); end # Visit a IndexOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2345 + # source://prism//lib/prism/dot_visitor.rb#2349 def visit_index_or_write_node(node); end # Visit a IndexTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#2398 + # source://prism//lib/prism/dot_visitor.rb#2402 def visit_index_target_node(node); end # Visit a InstanceVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2437 + # source://prism//lib/prism/dot_visitor.rb#2441 def visit_instance_variable_and_write_node(node); end # Visit a InstanceVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2464 + # source://prism//lib/prism/dot_visitor.rb#2468 def visit_instance_variable_operator_write_node(node); end # Visit a InstanceVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2494 + # source://prism//lib/prism/dot_visitor.rb#2498 def visit_instance_variable_or_write_node(node); end # Visit a InstanceVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#2521 + # source://prism//lib/prism/dot_visitor.rb#2525 def visit_instance_variable_read_node(node); end # Visit a InstanceVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#2538 + # source://prism//lib/prism/dot_visitor.rb#2542 def visit_instance_variable_target_node(node); end # Visit a InstanceVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2555 + # source://prism//lib/prism/dot_visitor.rb#2559 def visit_instance_variable_write_node(node); end # Visit a IntegerNode node. # - # source://prism//lib/prism/dot_visitor.rb#2582 + # source://prism//lib/prism/dot_visitor.rb#2586 def visit_integer_node(node); end # Visit a InterpolatedMatchLastLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#2602 + # source://prism//lib/prism/dot_visitor.rb#2606 def visit_interpolated_match_last_line_node(node); end # Visit a InterpolatedRegularExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#2638 + # source://prism//lib/prism/dot_visitor.rb#2642 def visit_interpolated_regular_expression_node(node); end # Visit a InterpolatedStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#2674 + # source://prism//lib/prism/dot_visitor.rb#2678 def visit_interpolated_string_node(node); end # Visit a InterpolatedSymbolNode node. # - # source://prism//lib/prism/dot_visitor.rb#2714 + # source://prism//lib/prism/dot_visitor.rb#2718 def visit_interpolated_symbol_node(node); end # Visit a InterpolatedXStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#2751 + # source://prism//lib/prism/dot_visitor.rb#2755 def visit_interpolated_x_string_node(node); end # Visit a ItLocalVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#2784 + # source://prism//lib/prism/dot_visitor.rb#2788 def visit_it_local_variable_read_node(node); end # Visit a ItParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#2798 + # source://prism//lib/prism/dot_visitor.rb#2802 def visit_it_parameters_node(node); end # Visit a KeywordHashNode node. # - # source://prism//lib/prism/dot_visitor.rb#2812 + # source://prism//lib/prism/dot_visitor.rb#2816 def visit_keyword_hash_node(node); end # Visit a KeywordRestParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#2842 + # source://prism//lib/prism/dot_visitor.rb#2846 def visit_keyword_rest_parameter_node(node); end # Visit a LambdaNode node. # - # source://prism//lib/prism/dot_visitor.rb#2870 + # source://prism//lib/prism/dot_visitor.rb#2874 def visit_lambda_node(node); end # Visit a LocalVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2908 + # source://prism//lib/prism/dot_visitor.rb#2912 def visit_local_variable_and_write_node(node); end # Visit a LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2938 + # source://prism//lib/prism/dot_visitor.rb#2942 def visit_local_variable_operator_write_node(node); end # Visit a LocalVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2971 + # source://prism//lib/prism/dot_visitor.rb#2975 def visit_local_variable_or_write_node(node); end # Visit a LocalVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#3001 + # source://prism//lib/prism/dot_visitor.rb#3005 def visit_local_variable_read_node(node); end # Visit a LocalVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#3021 + # source://prism//lib/prism/dot_visitor.rb#3025 def visit_local_variable_target_node(node); end # Visit a LocalVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3041 + # source://prism//lib/prism/dot_visitor.rb#3045 def visit_local_variable_write_node(node); end # Visit a MatchLastLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#3071 + # source://prism//lib/prism/dot_visitor.rb#3075 def visit_match_last_line_node(node); end # Visit a MatchPredicateNode node. # - # source://prism//lib/prism/dot_visitor.rb#3100 + # source://prism//lib/prism/dot_visitor.rb#3104 def visit_match_predicate_node(node); end # Visit a MatchRequiredNode node. # - # source://prism//lib/prism/dot_visitor.rb#3125 + # source://prism//lib/prism/dot_visitor.rb#3129 def visit_match_required_node(node); end # Visit a MatchWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3150 + # source://prism//lib/prism/dot_visitor.rb#3154 def visit_match_write_node(node); end # Visit a MissingNode node. # - # source://prism//lib/prism/dot_visitor.rb#3181 + # source://prism//lib/prism/dot_visitor.rb#3185 def visit_missing_node(node); end # Visit a ModuleNode node. # - # source://prism//lib/prism/dot_visitor.rb#3195 + # source://prism//lib/prism/dot_visitor.rb#3199 def visit_module_node(node); end # Visit a MultiTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#3231 + # source://prism//lib/prism/dot_visitor.rb#3235 def visit_multi_target_node(node); end # Visit a MultiWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3287 + # source://prism//lib/prism/dot_visitor.rb#3291 def visit_multi_write_node(node); end # Visit a NextNode node. # - # source://prism//lib/prism/dot_visitor.rb#3350 + # source://prism//lib/prism/dot_visitor.rb#3354 def visit_next_node(node); end # Visit a NilNode node. # - # source://prism//lib/prism/dot_visitor.rb#3373 + # source://prism//lib/prism/dot_visitor.rb#3377 def visit_nil_node(node); end # Visit a NoKeywordsParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3387 + # source://prism//lib/prism/dot_visitor.rb#3391 def visit_no_keywords_parameter_node(node); end # Visit a NumberedParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#3407 + # source://prism//lib/prism/dot_visitor.rb#3411 def visit_numbered_parameters_node(node); end # Visit a NumberedReferenceReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#3424 + # source://prism//lib/prism/dot_visitor.rb#3428 def visit_numbered_reference_read_node(node); end # Visit a OptionalKeywordParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3441 + # source://prism//lib/prism/dot_visitor.rb#3445 def visit_optional_keyword_parameter_node(node); end # Visit a OptionalParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3468 + # source://prism//lib/prism/dot_visitor.rb#3472 def visit_optional_parameter_node(node); end # Visit a OrNode node. # - # source://prism//lib/prism/dot_visitor.rb#3498 + # source://prism//lib/prism/dot_visitor.rb#3502 def visit_or_node(node); end # Visit a ParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#3523 + # source://prism//lib/prism/dot_visitor.rb#3527 def visit_parameters_node(node); end # Visit a ParenthesesNode node. # - # source://prism//lib/prism/dot_visitor.rb#3607 + # source://prism//lib/prism/dot_visitor.rb#3611 def visit_parentheses_node(node); end # Visit a PinnedExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3636 + # source://prism//lib/prism/dot_visitor.rb#3640 def visit_pinned_expression_node(node); end # Visit a PinnedVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#3663 + # source://prism//lib/prism/dot_visitor.rb#3667 def visit_pinned_variable_node(node); end # Visit a PostExecutionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3684 + # source://prism//lib/prism/dot_visitor.rb#3688 def visit_post_execution_node(node); end # Visit a PreExecutionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3713 + # source://prism//lib/prism/dot_visitor.rb#3717 def visit_pre_execution_node(node); end # Visit a ProgramNode node. # - # source://prism//lib/prism/dot_visitor.rb#3742 + # source://prism//lib/prism/dot_visitor.rb#3746 def visit_program_node(node); end # Visit a RangeNode node. # - # source://prism//lib/prism/dot_visitor.rb#3763 + # source://prism//lib/prism/dot_visitor.rb#3767 def visit_range_node(node); end # Visit a RationalNode node. # - # source://prism//lib/prism/dot_visitor.rb#3795 + # source://prism//lib/prism/dot_visitor.rb#3799 def visit_rational_node(node); end # Visit a RedoNode node. # - # source://prism//lib/prism/dot_visitor.rb#3818 + # source://prism//lib/prism/dot_visitor.rb#3822 def visit_redo_node(node); end # Visit a RegularExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3832 + # source://prism//lib/prism/dot_visitor.rb#3836 def visit_regular_expression_node(node); end # Visit a RequiredKeywordParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3861 + # source://prism//lib/prism/dot_visitor.rb#3865 def visit_required_keyword_parameter_node(node); end # Visit a RequiredParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3884 + # source://prism//lib/prism/dot_visitor.rb#3888 def visit_required_parameter_node(node); end # Visit a RescueModifierNode node. # - # source://prism//lib/prism/dot_visitor.rb#3904 + # source://prism//lib/prism/dot_visitor.rb#3908 def visit_rescue_modifier_node(node); end # Visit a RescueNode node. # - # source://prism//lib/prism/dot_visitor.rb#3929 + # source://prism//lib/prism/dot_visitor.rb#3933 def visit_rescue_node(node); end # Visit a RestParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3987 + # source://prism//lib/prism/dot_visitor.rb#3991 def visit_rest_parameter_node(node); end # Visit a RetryNode node. # - # source://prism//lib/prism/dot_visitor.rb#4015 + # source://prism//lib/prism/dot_visitor.rb#4019 def visit_retry_node(node); end # Visit a ReturnNode node. # - # source://prism//lib/prism/dot_visitor.rb#4029 + # source://prism//lib/prism/dot_visitor.rb#4033 def visit_return_node(node); end # Visit a SelfNode node. # - # source://prism//lib/prism/dot_visitor.rb#4052 + # source://prism//lib/prism/dot_visitor.rb#4056 def visit_self_node(node); end # Visit a ShareableConstantNode node. # - # source://prism//lib/prism/dot_visitor.rb#4066 + # source://prism//lib/prism/dot_visitor.rb#4070 def visit_shareable_constant_node(node); end # Visit a SingletonClassNode node. # - # source://prism//lib/prism/dot_visitor.rb#4087 + # source://prism//lib/prism/dot_visitor.rb#4091 def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node. # - # source://prism//lib/prism/dot_visitor.rb#4123 + # source://prism//lib/prism/dot_visitor.rb#4127 def visit_source_encoding_node(node); end # Visit a SourceFileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4137 + # source://prism//lib/prism/dot_visitor.rb#4141 def visit_source_file_node(node); end # Visit a SourceLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#4157 + # source://prism//lib/prism/dot_visitor.rb#4161 def visit_source_line_node(node); end # Visit a SplatNode node. # - # source://prism//lib/prism/dot_visitor.rb#4171 + # source://prism//lib/prism/dot_visitor.rb#4175 def visit_splat_node(node); end # Visit a StatementsNode node. # - # source://prism//lib/prism/dot_visitor.rb#4194 + # source://prism//lib/prism/dot_visitor.rb#4198 def visit_statements_node(node); end # Visit a StringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4221 + # source://prism//lib/prism/dot_visitor.rb#4225 def visit_string_node(node); end # Visit a SuperNode node. # - # source://prism//lib/prism/dot_visitor.rb#4254 + # source://prism//lib/prism/dot_visitor.rb#4258 def visit_super_node(node); end # Visit a SymbolNode node. # - # source://prism//lib/prism/dot_visitor.rb#4293 + # source://prism//lib/prism/dot_visitor.rb#4297 def visit_symbol_node(node); end # Visit a TrueNode node. # - # source://prism//lib/prism/dot_visitor.rb#4328 + # source://prism//lib/prism/dot_visitor.rb#4332 def visit_true_node(node); end # Visit a UndefNode node. # - # source://prism//lib/prism/dot_visitor.rb#4342 + # source://prism//lib/prism/dot_visitor.rb#4346 def visit_undef_node(node); end # Visit a UnlessNode node. # - # source://prism//lib/prism/dot_visitor.rb#4372 + # source://prism//lib/prism/dot_visitor.rb#4376 def visit_unless_node(node); end # Visit a UntilNode node. # - # source://prism//lib/prism/dot_visitor.rb#4415 + # source://prism//lib/prism/dot_visitor.rb#4419 def visit_until_node(node); end # Visit a WhenNode node. # - # source://prism//lib/prism/dot_visitor.rb#4455 + # source://prism//lib/prism/dot_visitor.rb#4459 def visit_when_node(node); end # Visit a WhileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4496 + # source://prism//lib/prism/dot_visitor.rb#4500 def visit_while_node(node); end # Visit a XStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4536 + # source://prism//lib/prism/dot_visitor.rb#4540 def visit_x_string_node(node); end # Visit a YieldNode node. # - # source://prism//lib/prism/dot_visitor.rb#4565 + # source://prism//lib/prism/dot_visitor.rb#4569 def visit_yield_node(node); end private @@ -14558,186 +14461,186 @@ class Prism::DotVisitor < ::Prism::Visitor # Inspect a node that has arguments_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4611 + # source://prism//lib/prism/dot_visitor.rb#4615 def arguments_node_flags_inspect(node); end # Inspect a node that has array_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4623 + # source://prism//lib/prism/dot_visitor.rb#4627 def array_node_flags_inspect(node); end # Inspect a node that has call_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4631 + # source://prism//lib/prism/dot_visitor.rb#4635 def call_node_flags_inspect(node); end # Inspect a node that has encoding_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4642 + # source://prism//lib/prism/dot_visitor.rb#4646 def encoding_flags_inspect(node); end # Inspect a node that has integer_base_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4651 + # source://prism//lib/prism/dot_visitor.rb#4655 def integer_base_flags_inspect(node); end # Inspect a node that has interpolated_string_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4662 + # source://prism//lib/prism/dot_visitor.rb#4666 def interpolated_string_node_flags_inspect(node); end # Inspect a node that has keyword_hash_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4671 + # source://prism//lib/prism/dot_visitor.rb#4675 def keyword_hash_node_flags_inspect(node); end # Inspect a location to display the start and end line and column numbers. # - # source://prism//lib/prism/dot_visitor.rb#4605 + # source://prism//lib/prism/dot_visitor.rb#4609 def location_inspect(location); end # Inspect a node that has loop_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4679 + # source://prism//lib/prism/dot_visitor.rb#4683 def loop_flags_inspect(node); end # Generate a unique node ID for a node throughout the digraph. # - # source://prism//lib/prism/dot_visitor.rb#4600 + # source://prism//lib/prism/dot_visitor.rb#4604 def node_id(node); end # Inspect a node that has parameter_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4687 + # source://prism//lib/prism/dot_visitor.rb#4691 def parameter_flags_inspect(node); end # Inspect a node that has parentheses_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4695 + # source://prism//lib/prism/dot_visitor.rb#4699 def parentheses_node_flags_inspect(node); end # Inspect a node that has range_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4703 + # source://prism//lib/prism/dot_visitor.rb#4707 def range_flags_inspect(node); end # Inspect a node that has regular_expression_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4711 + # source://prism//lib/prism/dot_visitor.rb#4715 def regular_expression_flags_inspect(node); end # Inspect a node that has shareable_constant_node_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4729 + # source://prism//lib/prism/dot_visitor.rb#4733 def shareable_constant_node_flags_inspect(node); end # Inspect a node that has string_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4739 + # source://prism//lib/prism/dot_visitor.rb#4743 def string_flags_inspect(node); end # Inspect a node that has symbol_flags flags to display the flags as a # comma-separated list. # - # source://prism//lib/prism/dot_visitor.rb#4750 + # source://prism//lib/prism/dot_visitor.rb#4754 def symbol_flags_inspect(node); end end -# source://prism//lib/prism/dot_visitor.rb#59 +# source://prism//lib/prism/dot_visitor.rb#63 class Prism::DotVisitor::Digraph # @return [Digraph] a new instance of Digraph # - # source://prism//lib/prism/dot_visitor.rb#62 + # source://prism//lib/prism/dot_visitor.rb#66 def initialize; end - # source://prism//lib/prism/dot_visitor.rb#76 + # source://prism//lib/prism/dot_visitor.rb#80 def edge(value); end # Returns the value of attribute edges. # - # source://prism//lib/prism/dot_visitor.rb#60 + # source://prism//lib/prism/dot_visitor.rb#64 def edges; end - # source://prism//lib/prism/dot_visitor.rb#68 + # source://prism//lib/prism/dot_visitor.rb#72 def node(value); end # Returns the value of attribute nodes. # - # source://prism//lib/prism/dot_visitor.rb#60 + # source://prism//lib/prism/dot_visitor.rb#64 def nodes; end - # source://prism//lib/prism/dot_visitor.rb#80 + # source://prism//lib/prism/dot_visitor.rb#84 def to_dot; end - # source://prism//lib/prism/dot_visitor.rb#72 + # source://prism//lib/prism/dot_visitor.rb#76 def waypoint(value); end # Returns the value of attribute waypoints. # - # source://prism//lib/prism/dot_visitor.rb#60 + # source://prism//lib/prism/dot_visitor.rb#64 def waypoints; end end -# source://prism//lib/prism/dot_visitor.rb#15 +# source://prism//lib/prism/dot_visitor.rb#19 class Prism::DotVisitor::Field # @return [Field] a new instance of Field # - # source://prism//lib/prism/dot_visitor.rb#18 + # source://prism//lib/prism/dot_visitor.rb#22 def initialize(name, value, port); end # Returns the value of attribute name. # - # source://prism//lib/prism/dot_visitor.rb#16 + # source://prism//lib/prism/dot_visitor.rb#20 def name; end # Returns the value of attribute port. # - # source://prism//lib/prism/dot_visitor.rb#16 + # source://prism//lib/prism/dot_visitor.rb#20 def port; end - # source://prism//lib/prism/dot_visitor.rb#24 + # source://prism//lib/prism/dot_visitor.rb#28 def to_dot; end # Returns the value of attribute value. # - # source://prism//lib/prism/dot_visitor.rb#16 + # source://prism//lib/prism/dot_visitor.rb#20 def value; end end -# source://prism//lib/prism/dot_visitor.rb#33 +# source://prism//lib/prism/dot_visitor.rb#37 class Prism::DotVisitor::Table # @return [Table] a new instance of Table # - # source://prism//lib/prism/dot_visitor.rb#36 + # source://prism//lib/prism/dot_visitor.rb#40 def initialize(name); end - # source://prism//lib/prism/dot_visitor.rb#41 + # source://prism//lib/prism/dot_visitor.rb#45 def field(name, value = T.unsafe(nil), port: T.unsafe(nil)); end # Returns the value of attribute fields. # - # source://prism//lib/prism/dot_visitor.rb#34 + # source://prism//lib/prism/dot_visitor.rb#38 def fields; end # Returns the value of attribute name. # - # source://prism//lib/prism/dot_visitor.rb#34 + # source://prism//lib/prism/dot_visitor.rb#38 def name; end - # source://prism//lib/prism/dot_visitor.rb#45 + # source://prism//lib/prism/dot_visitor.rb#49 def to_dot; end end @@ -14746,13 +14649,13 @@ end # if a then b else c end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6294 +# source://prism//lib/prism/node.rb#6324 class Prism::ElseNode < ::Prism::Node # Initialize a new ElseNode node. # # @return [ElseNode] a new instance of ElseNode # - # source://prism//lib/prism/node.rb#6296 + # source://prism//lib/prism/node.rb#6326 sig do params( source: Prism::Source, @@ -14769,36 +14672,36 @@ class Prism::ElseNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6403 + # source://prism//lib/prism/node.rb#6433 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6307 + # source://prism//lib/prism/node.rb#6337 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6312 + # source://prism//lib/prism/node.rb#6342 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6324 + # source://prism//lib/prism/node.rb#6354 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6317 + # source://prism//lib/prism/node.rb#6347 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?else_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location?) -> ElseNode # - # source://prism//lib/prism/node.rb#6329 + # source://prism//lib/prism/node.rb#6359 sig do params( node_id: Integer, @@ -14811,40 +14714,40 @@ class Prism::ElseNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), else_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6334 + # source://prism//lib/prism/node.rb#6364 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location? } # - # source://prism//lib/prism/node.rb#6337 + # source://prism//lib/prism/node.rb#6367 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def else_keyword: () -> String # - # source://prism//lib/prism/node.rb#6377 + # source://prism//lib/prism/node.rb#6407 sig { returns(String) } def else_keyword; end # attr_reader else_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6342 + # source://prism//lib/prism/node.rb#6372 sig { returns(Prism::Location) } def else_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6382 + # source://prism//lib/prism/node.rb#6412 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#6358 + # source://prism//lib/prism/node.rb#6388 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -14853,38 +14756,38 @@ class Prism::ElseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6387 + # source://prism//lib/prism/node.rb#6417 sig { override.returns(String) } def inspect; end # Save the else_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6350 + # source://prism//lib/prism/node.rb#6380 def save_else_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6372 + # source://prism//lib/prism/node.rb#6402 def save_end_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6355 + # source://prism//lib/prism/node.rb#6385 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6392 + # source://prism//lib/prism/node.rb#6422 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6397 + # source://prism//lib/prism/node.rb#6427 def type; end end end @@ -14892,11 +14795,11 @@ end # EmbDocComment objects correspond to comments that are surrounded by =begin # and =end. # -# source://prism//lib/prism/parse_result.rb#561 +# source://prism//lib/prism/parse_result.rb#562 class Prism::EmbDocComment < ::Prism::Comment # Returns a string representation of this comment. # - # source://prism//lib/prism/parse_result.rb#568 + # source://prism//lib/prism/parse_result.rb#569 sig { returns(String) } def inspect; end @@ -14904,7 +14807,7 @@ class Prism::EmbDocComment < ::Prism::Comment # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#563 + # source://prism//lib/prism/parse_result.rb#564 sig { override.returns(T::Boolean) } def trailing?; end end @@ -14914,13 +14817,13 @@ end # "foo #{bar}" # ^^^^^^ # -# source://prism//lib/prism/node.rb#6415 +# source://prism//lib/prism/node.rb#6445 class Prism::EmbeddedStatementsNode < ::Prism::Node # Initialize a new EmbeddedStatementsNode node. # # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6417 + # source://prism//lib/prism/node.rb#6447 sig do params( source: Prism::Source, @@ -14937,48 +14840,48 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6518 + # source://prism//lib/prism/node.rb#6548 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6428 + # source://prism//lib/prism/node.rb#6458 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6433 + # source://prism//lib/prism/node.rb#6463 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#6497 + # source://prism//lib/prism/node.rb#6527 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#6479 + # source://prism//lib/prism/node.rb#6509 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6445 + # source://prism//lib/prism/node.rb#6475 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6438 + # source://prism//lib/prism/node.rb#6468 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?statements: StatementsNode?, ?closing_loc: Location) -> EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6450 + # source://prism//lib/prism/node.rb#6480 sig do params( node_id: Integer, @@ -14991,16 +14894,16 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), statements: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6455 + # source://prism//lib/prism/node.rb#6485 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, statements: StatementsNode?, closing_loc: Location } # - # source://prism//lib/prism/node.rb#6458 + # source://prism//lib/prism/node.rb#6488 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15009,50 +14912,50 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6502 + # source://prism//lib/prism/node.rb#6532 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#6492 + # source://prism//lib/prism/node.rb#6522 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#6463 + # source://prism//lib/prism/node.rb#6493 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6487 + # source://prism//lib/prism/node.rb#6517 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6471 + # source://prism//lib/prism/node.rb#6501 def save_opening_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6476 + # source://prism//lib/prism/node.rb#6506 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6507 + # source://prism//lib/prism/node.rb#6537 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6512 + # source://prism//lib/prism/node.rb#6542 def type; end end end @@ -15062,13 +14965,13 @@ end # "foo #@bar" # ^^^^^ # -# source://prism//lib/prism/node.rb#6530 +# source://prism//lib/prism/node.rb#6560 class Prism::EmbeddedVariableNode < ::Prism::Node # Initialize a new EmbeddedVariableNode node. # # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6532 + # source://prism//lib/prism/node.rb#6562 sig do params( source: Prism::Source, @@ -15084,36 +14987,36 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6612 + # source://prism//lib/prism/node.rb#6642 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6542 + # source://prism//lib/prism/node.rb#6572 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6547 + # source://prism//lib/prism/node.rb#6577 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6557 + # source://prism//lib/prism/node.rb#6587 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6552 + # source://prism//lib/prism/node.rb#6582 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode) -> EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6562 + # source://prism//lib/prism/node.rb#6592 sig do params( node_id: Integer, @@ -15125,16 +15028,16 @@ class Prism::EmbeddedVariableNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), operator_loc: T.unsafe(nil), variable: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6567 + # source://prism//lib/prism/node.rb#6597 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode } # - # source://prism//lib/prism/node.rb#6570 + # source://prism//lib/prism/node.rb#6600 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15143,37 +15046,37 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6596 + # source://prism//lib/prism/node.rb#6626 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#6591 + # source://prism//lib/prism/node.rb#6621 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#6575 + # source://prism//lib/prism/node.rb#6605 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6583 + # source://prism//lib/prism/node.rb#6613 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6601 + # source://prism//lib/prism/node.rb#6631 sig { override.returns(Symbol) } def type; end # attr_reader variable: InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode # - # source://prism//lib/prism/node.rb#6588 + # source://prism//lib/prism/node.rb#6618 sig do returns(T.any(Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)) end @@ -15182,24 +15085,24 @@ class Prism::EmbeddedVariableNode < ::Prism::Node class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6606 + # source://prism//lib/prism/node.rb#6636 def type; end end end # Flags for nodes that have unescaped content. # -# source://prism//lib/prism/node.rb#18498 +# source://prism//lib/prism/node.rb#18669 module Prism::EncodingFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#18503 +# source://prism//lib/prism/node.rb#18674 Prism::EncodingFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#18500 +# source://prism//lib/prism/node.rb#18671 Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # Represents an `ensure` clause in a `begin` statement. @@ -15211,13 +15114,13 @@ Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # bar # end # -# source://prism//lib/prism/node.rb#6627 +# source://prism//lib/prism/node.rb#6657 class Prism::EnsureNode < ::Prism::Node # Initialize a new EnsureNode node. # # @return [EnsureNode] a new instance of EnsureNode # - # source://prism//lib/prism/node.rb#6629 + # source://prism//lib/prism/node.rb#6659 sig do params( source: Prism::Source, @@ -15234,36 +15137,36 @@ class Prism::EnsureNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6730 + # source://prism//lib/prism/node.rb#6760 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6640 + # source://prism//lib/prism/node.rb#6670 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6645 + # source://prism//lib/prism/node.rb#6675 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6657 + # source://prism//lib/prism/node.rb#6687 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6650 + # source://prism//lib/prism/node.rb#6680 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?ensure_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location) -> EnsureNode # - # source://prism//lib/prism/node.rb#6662 + # source://prism//lib/prism/node.rb#6692 sig do params( node_id: Integer, @@ -15276,40 +15179,40 @@ class Prism::EnsureNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), ensure_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6667 + # source://prism//lib/prism/node.rb#6697 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location } # - # source://prism//lib/prism/node.rb#6670 + # source://prism//lib/prism/node.rb#6700 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#6709 + # source://prism//lib/prism/node.rb#6739 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6691 + # source://prism//lib/prism/node.rb#6721 sig { returns(Prism::Location) } def end_keyword_loc; end # def ensure_keyword: () -> String # - # source://prism//lib/prism/node.rb#6704 + # source://prism//lib/prism/node.rb#6734 sig { returns(String) } def ensure_keyword; end # attr_reader ensure_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6675 + # source://prism//lib/prism/node.rb#6705 sig { returns(Prism::Location) } def ensure_keyword_loc; end @@ -15318,38 +15221,38 @@ class Prism::EnsureNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6714 + # source://prism//lib/prism/node.rb#6744 sig { override.returns(String) } def inspect; end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6699 + # source://prism//lib/prism/node.rb#6729 def save_end_keyword_loc(repository); end # Save the ensure_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6683 + # source://prism//lib/prism/node.rb#6713 def save_ensure_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6688 + # source://prism//lib/prism/node.rb#6718 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6719 + # source://prism//lib/prism/node.rb#6749 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6724 + # source://prism//lib/prism/node.rb#6754 def type; end end end @@ -15359,62 +15262,62 @@ end # false # ^^^^^ # -# source://prism//lib/prism/node.rb#6742 +# source://prism//lib/prism/node.rb#6772 class Prism::FalseNode < ::Prism::Node # Initialize a new FalseNode node. # # @return [FalseNode] a new instance of FalseNode # - # source://prism//lib/prism/node.rb#6744 + # source://prism//lib/prism/node.rb#6774 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6801 + # source://prism//lib/prism/node.rb#6831 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6752 + # source://prism//lib/prism/node.rb#6782 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6757 + # source://prism//lib/prism/node.rb#6787 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6767 + # source://prism//lib/prism/node.rb#6797 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6762 + # source://prism//lib/prism/node.rb#6792 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> FalseNode # - # source://prism//lib/prism/node.rb#6772 + # source://prism//lib/prism/node.rb#6802 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::FalseNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6777 + # source://prism//lib/prism/node.rb#6807 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#6780 + # source://prism//lib/prism/node.rb#6810 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15423,20 +15326,20 @@ class Prism::FalseNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6785 + # source://prism//lib/prism/node.rb#6815 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6790 + # source://prism//lib/prism/node.rb#6820 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6795 + # source://prism//lib/prism/node.rb#6825 def type; end end end @@ -15452,20 +15355,23 @@ end # foo in Foo(*bar, baz, *qux) # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6816 +# foo => *bar, baz, *qux +# ^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#6849 class Prism::FindPatternNode < ::Prism::Node # Initialize a new FindPatternNode node. # # @return [FindPatternNode] a new instance of FindPatternNode # - # source://prism//lib/prism/node.rb#6818 + # source://prism//lib/prism/node.rb#6851 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), left: Prism::SplatNode, requireds: T::Array[Prism::Node], right: T.any(Prism::SplatNode, Prism::MissingNode), @@ -15478,60 +15384,69 @@ class Prism::FindPatternNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#6946 + # source://prism//lib/prism/node.rb#7012 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6832 + # source://prism//lib/prism/node.rb#6865 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6837 + # source://prism//lib/prism/node.rb#6870 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#6925 + # source://prism//lib/prism/node.rb#6991 sig { returns(T.nilable(String)) } def closing; end - # attr_reader closing_loc: Location? + # The location of the closing brace. + # + # foo in [*bar, baz, *qux] + # ^ + # + # foo in Foo(*bar, baz, *qux) + # ^ # - # source://prism//lib/prism/node.rb#6901 + # source://prism//lib/prism/node.rb#6967 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6852 + # source://prism//lib/prism/node.rb#6885 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6842 + # source://prism//lib/prism/node.rb#6875 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: ConstantReadNode | ConstantPathNode | nil + # Represents the optional constant preceding the pattern # - # source://prism//lib/prism/node.rb#6870 - sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) } + # foo in Foo(*bar, baz, *qux) + # ^^^ + # + # source://prism//lib/prism/node.rb#6906 + sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) } def constant; end - # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?left: SplatNode, ?requireds: Array[Prism::node], ?right: SplatNode | MissingNode, ?opening_loc: Location?, ?closing_loc: Location?) -> FindPatternNode + # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?left: SplatNode, ?requireds: Array[Prism::node], ?right: SplatNode | MissingNode, ?opening_loc: Location?, ?closing_loc: Location?) -> FindPatternNode # - # source://prism//lib/prism/node.rb#6857 + # source://prism//lib/prism/node.rb#6890 sig do params( node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), left: Prism::SplatNode, requireds: T::Array[Prism::Node], right: T.any(Prism::SplatNode, Prism::MissingNode), @@ -15541,16 +15456,16 @@ class Prism::FindPatternNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), constant: T.unsafe(nil), left: T.unsafe(nil), requireds: T.unsafe(nil), right: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6862 + # source://prism//lib/prism/node.rb#6895 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, left: SplatNode, requireds: Array[Prism::node], right: SplatNode | MissingNode, opening_loc: Location?, closing_loc: Location? } + # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, left: SplatNode, requireds: Array[Prism::node], right: SplatNode | MissingNode, opening_loc: Location?, closing_loc: Location? } # - # source://prism//lib/prism/node.rb#6865 + # source://prism//lib/prism/node.rb#6898 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15559,62 +15474,86 @@ class Prism::FindPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#6930 + # source://prism//lib/prism/node.rb#6996 sig { override.returns(String) } def inspect; end - # attr_reader left: SplatNode + # Represents the first wildcard node in the pattern. # - # source://prism//lib/prism/node.rb#6873 + # foo in *bar, baz, *qux + # ^^^^ + # + # foo in Foo(*bar, baz, *qux) + # ^^^^ + # + # source://prism//lib/prism/node.rb#6915 sig { returns(Prism::SplatNode) } def left; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#6920 + # source://prism//lib/prism/node.rb#6986 sig { returns(T.nilable(String)) } def opening; end - # attr_reader opening_loc: Location? + # The location of the opening brace. # - # source://prism//lib/prism/node.rb#6882 + # foo in [*bar, baz, *qux] + # ^ + # + # foo in Foo(*bar, baz, *qux) + # ^ + # + # source://prism//lib/prism/node.rb#6942 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader requireds: Array[Prism::node] + # Represents the nodes in between the wildcards. + # + # foo in *bar, baz, *qux + # ^^^ + # + # foo in Foo(*bar, baz, 1, *qux) + # ^^^^^^ # - # source://prism//lib/prism/node.rb#6876 + # source://prism//lib/prism/node.rb#6924 sig { returns(T::Array[Prism::Node]) } def requireds; end - # attr_reader right: SplatNode | MissingNode + # Represents the second wildcard node in the pattern. + # + # foo in *bar, baz, *qux + # ^^^^ + # + # foo in Foo(*bar, baz, *qux) + # ^^^^ # - # source://prism//lib/prism/node.rb#6879 + # source://prism//lib/prism/node.rb#6933 sig { returns(T.any(Prism::SplatNode, Prism::MissingNode)) } def right; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6915 + # source://prism//lib/prism/node.rb#6981 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#6896 + # source://prism//lib/prism/node.rb#6956 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#6935 + # source://prism//lib/prism/node.rb#7001 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#6940 + # source://prism//lib/prism/node.rb#7006 def type; end end end @@ -15624,13 +15563,13 @@ end # baz if foo .. bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6962 +# source://prism//lib/prism/node.rb#7028 class Prism::FlipFlopNode < ::Prism::Node # Initialize a new FlipFlopNode node. # # @return [FlipFlopNode] a new instance of FlipFlopNode # - # source://prism//lib/prism/node.rb#6964 + # source://prism//lib/prism/node.rb#7030 sig do params( source: Prism::Source, @@ -15647,36 +15586,36 @@ class Prism::FlipFlopNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7056 + # source://prism//lib/prism/node.rb#7122 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6975 + # source://prism//lib/prism/node.rb#7041 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#6980 + # source://prism//lib/prism/node.rb#7046 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6993 + # source://prism//lib/prism/node.rb#7059 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#6985 + # source://prism//lib/prism/node.rb#7051 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> FlipFlopNode # - # source://prism//lib/prism/node.rb#6998 + # source://prism//lib/prism/node.rb#7064 sig do params( node_id: Integer, @@ -15689,16 +15628,16 @@ class Prism::FlipFlopNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7003 + # source://prism//lib/prism/node.rb#7069 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#7006 + # source://prism//lib/prism/node.rb#7072 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15706,7 +15645,7 @@ class Prism::FlipFlopNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#7011 + # source://prism//lib/prism/node.rb#7077 sig { returns(T::Boolean) } def exclude_end?; end @@ -15715,50 +15654,50 @@ class Prism::FlipFlopNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7040 + # source://prism//lib/prism/node.rb#7106 sig { override.returns(String) } def inspect; end # attr_reader left: Prism::node? # - # source://prism//lib/prism/node.rb#7016 + # source://prism//lib/prism/node.rb#7082 sig { returns(T.nilable(Prism::Node)) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7035 + # source://prism//lib/prism/node.rb#7101 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7022 + # source://prism//lib/prism/node.rb#7088 sig { returns(Prism::Location) } def operator_loc; end # attr_reader right: Prism::node? # - # source://prism//lib/prism/node.rb#7019 + # source://prism//lib/prism/node.rb#7085 sig { returns(T.nilable(Prism::Node)) } def right; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7030 + # source://prism//lib/prism/node.rb#7096 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7045 + # source://prism//lib/prism/node.rb#7111 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7050 + # source://prism//lib/prism/node.rb#7116 def type; end end end @@ -15768,62 +15707,62 @@ end # 1.0 # ^^^ # -# source://prism//lib/prism/node.rb#7069 +# source://prism//lib/prism/node.rb#7135 class Prism::FloatNode < ::Prism::Node # Initialize a new FloatNode node. # # @return [FloatNode] a new instance of FloatNode # - # source://prism//lib/prism/node.rb#7071 + # source://prism//lib/prism/node.rb#7137 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, value: Float).void } def initialize(source, node_id, location, flags, value); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7132 + # source://prism//lib/prism/node.rb#7198 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7080 + # source://prism//lib/prism/node.rb#7146 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7085 + # source://prism//lib/prism/node.rb#7151 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7095 + # source://prism//lib/prism/node.rb#7161 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7090 + # source://prism//lib/prism/node.rb#7156 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Float) -> FloatNode # - # source://prism//lib/prism/node.rb#7100 + # source://prism//lib/prism/node.rb#7166 sig { params(node_id: Integer, location: Prism::Location, flags: Integer, value: Float).returns(Prism::FloatNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7105 + # source://prism//lib/prism/node.rb#7171 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Float } # - # source://prism//lib/prism/node.rb#7108 + # source://prism//lib/prism/node.rb#7174 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -15832,26 +15771,26 @@ class Prism::FloatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7116 + # source://prism//lib/prism/node.rb#7182 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7121 + # source://prism//lib/prism/node.rb#7187 sig { override.returns(Symbol) } def type; end # The value of the floating point number as a Float. # - # source://prism//lib/prism/node.rb#7113 + # source://prism//lib/prism/node.rb#7179 sig { returns(Float) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7126 + # source://prism//lib/prism/node.rb#7192 def type; end end end @@ -15861,13 +15800,13 @@ end # for i in a end # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7142 +# source://prism//lib/prism/node.rb#7208 class Prism::ForNode < ::Prism::Node # Initialize a new ForNode node. # # @return [ForNode] a new instance of ForNode # - # source://prism//lib/prism/node.rb#7144 + # source://prism//lib/prism/node.rb#7210 sig do params( source: Prism::Source, @@ -15888,18 +15827,18 @@ class Prism::ForNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7322 + # source://prism//lib/prism/node.rb#7388 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7159 + # source://prism//lib/prism/node.rb#7225 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7164 + # source://prism//lib/prism/node.rb#7230 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end @@ -15908,25 +15847,25 @@ class Prism::ForNode < ::Prism::Node # for i in a end # ^ # - # source://prism//lib/prism/node.rb#7205 + # source://prism//lib/prism/node.rb#7271 sig { returns(Prism::Node) } def collection; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7178 + # source://prism//lib/prism/node.rb#7244 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7169 + # source://prism//lib/prism/node.rb#7235 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, ?collection: Prism::node, ?statements: StatementsNode?, ?for_keyword_loc: Location, ?in_keyword_loc: Location, ?do_keyword_loc: Location?, ?end_keyword_loc: Location) -> ForNode # - # source://prism//lib/prism/node.rb#7183 + # source://prism//lib/prism/node.rb#7249 sig do params( node_id: Integer, @@ -15943,22 +15882,22 @@ class Prism::ForNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), index: T.unsafe(nil), collection: T.unsafe(nil), statements: T.unsafe(nil), for_keyword_loc: T.unsafe(nil), in_keyword_loc: T.unsafe(nil), do_keyword_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7188 + # source://prism//lib/prism/node.rb#7254 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, index: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode, collection: Prism::node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location } # - # source://prism//lib/prism/node.rb#7191 + # source://prism//lib/prism/node.rb#7257 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def do_keyword: () -> String? # - # source://prism//lib/prism/node.rb#7296 + # source://prism//lib/prism/node.rb#7362 sig { returns(T.nilable(String)) } def do_keyword; end @@ -15967,13 +15906,13 @@ class Prism::ForNode < ::Prism::Node # for i in a do end # ^^ # - # source://prism//lib/prism/node.rb#7251 + # source://prism//lib/prism/node.rb#7317 sig { returns(T.nilable(Prism::Location)) } def do_keyword_loc; end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#7301 + # source://prism//lib/prism/node.rb#7367 sig { returns(String) } def end_keyword; end @@ -15982,7 +15921,7 @@ class Prism::ForNode < ::Prism::Node # for i in a end # ^^^ # - # source://prism//lib/prism/node.rb#7273 + # source://prism//lib/prism/node.rb#7339 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -15991,7 +15930,7 @@ class Prism::ForNode < ::Prism::Node # def for_keyword: () -> String # - # source://prism//lib/prism/node.rb#7286 + # source://prism//lib/prism/node.rb#7352 sig { returns(String) } def for_keyword; end @@ -16000,13 +15939,13 @@ class Prism::ForNode < ::Prism::Node # for i in a end # ^^^ # - # source://prism//lib/prism/node.rb#7219 + # source://prism//lib/prism/node.rb#7285 sig { returns(Prism::Location) } def for_keyword_loc; end # def in_keyword: () -> String # - # source://prism//lib/prism/node.rb#7291 + # source://prism//lib/prism/node.rb#7357 sig { returns(String) } def in_keyword; end @@ -16015,7 +15954,7 @@ class Prism::ForNode < ::Prism::Node # for i in a end # ^^ # - # source://prism//lib/prism/node.rb#7235 + # source://prism//lib/prism/node.rb#7301 sig { returns(Prism::Location) } def in_keyword_loc; end @@ -16024,7 +15963,7 @@ class Prism::ForNode < ::Prism::Node # for i in a end # ^ # - # source://prism//lib/prism/node.rb#7199 + # source://prism//lib/prism/node.rb#7265 sig do returns(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode)) end @@ -16032,32 +15971,32 @@ class Prism::ForNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7306 + # source://prism//lib/prism/node.rb#7372 sig { override.returns(String) } def inspect; end # Save the do_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7265 + # source://prism//lib/prism/node.rb#7331 def save_do_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7281 + # source://prism//lib/prism/node.rb#7347 def save_end_keyword_loc(repository); end # Save the for_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7227 + # source://prism//lib/prism/node.rb#7293 def save_for_keyword_loc(repository); end # Save the in_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7243 + # source://prism//lib/prism/node.rb#7309 def save_in_keyword_loc(repository); end # Represents the body of statements to execute for each iteration of the loop. @@ -16067,20 +16006,20 @@ class Prism::ForNode < ::Prism::Node # ^^^^^^ # end # - # source://prism//lib/prism/node.rb#7213 + # source://prism//lib/prism/node.rb#7279 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7311 + # source://prism//lib/prism/node.rb#7377 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7316 + # source://prism//lib/prism/node.rb#7382 def type; end end end @@ -16092,62 +16031,62 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7340 +# source://prism//lib/prism/node.rb#7406 class Prism::ForwardingArgumentsNode < ::Prism::Node # Initialize a new ForwardingArgumentsNode node. # # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7342 + # source://prism//lib/prism/node.rb#7408 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7399 + # source://prism//lib/prism/node.rb#7465 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7350 + # source://prism//lib/prism/node.rb#7416 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7355 + # source://prism//lib/prism/node.rb#7421 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7365 + # source://prism//lib/prism/node.rb#7431 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7360 + # source://prism//lib/prism/node.rb#7426 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7370 + # source://prism//lib/prism/node.rb#7436 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingArgumentsNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7375 + # source://prism//lib/prism/node.rb#7441 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#7378 + # source://prism//lib/prism/node.rb#7444 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16156,20 +16095,20 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7383 + # source://prism//lib/prism/node.rb#7449 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7388 + # source://prism//lib/prism/node.rb#7454 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7393 + # source://prism//lib/prism/node.rb#7459 def type; end end end @@ -16180,62 +16119,62 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7409 +# source://prism//lib/prism/node.rb#7475 class Prism::ForwardingParameterNode < ::Prism::Node # Initialize a new ForwardingParameterNode node. # # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7411 + # source://prism//lib/prism/node.rb#7477 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7468 + # source://prism//lib/prism/node.rb#7534 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7419 + # source://prism//lib/prism/node.rb#7485 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7424 + # source://prism//lib/prism/node.rb#7490 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7434 + # source://prism//lib/prism/node.rb#7500 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7429 + # source://prism//lib/prism/node.rb#7495 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7439 + # source://prism//lib/prism/node.rb#7505 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ForwardingParameterNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7444 + # source://prism//lib/prism/node.rb#7510 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#7447 + # source://prism//lib/prism/node.rb#7513 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16244,20 +16183,20 @@ class Prism::ForwardingParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7452 + # source://prism//lib/prism/node.rb#7518 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7457 + # source://prism//lib/prism/node.rb#7523 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7462 + # source://prism//lib/prism/node.rb#7528 def type; end end end @@ -16267,13 +16206,13 @@ end # super # ^^^^^ # -# source://prism//lib/prism/node.rb#7477 +# source://prism//lib/prism/node.rb#7543 class Prism::ForwardingSuperNode < ::Prism::Node # Initialize a new ForwardingSuperNode node. # # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7479 + # source://prism//lib/prism/node.rb#7545 sig do params( source: Prism::Source, @@ -16288,42 +16227,42 @@ class Prism::ForwardingSuperNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7542 + # source://prism//lib/prism/node.rb#7608 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7488 + # source://prism//lib/prism/node.rb#7554 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader block: BlockNode? # - # source://prism//lib/prism/node.rb#7523 + # source://prism//lib/prism/node.rb#7589 sig { returns(T.nilable(Prism::BlockNode)) } def block; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7493 + # source://prism//lib/prism/node.rb#7559 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7505 + # source://prism//lib/prism/node.rb#7571 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7498 + # source://prism//lib/prism/node.rb#7564 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?block: BlockNode?) -> ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7510 + # source://prism//lib/prism/node.rb#7576 sig do params( node_id: Integer, @@ -16334,16 +16273,16 @@ class Prism::ForwardingSuperNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), block: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7515 + # source://prism//lib/prism/node.rb#7581 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, block: BlockNode? } # - # source://prism//lib/prism/node.rb#7518 + # source://prism//lib/prism/node.rb#7584 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16352,20 +16291,20 @@ class Prism::ForwardingSuperNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7526 + # source://prism//lib/prism/node.rb#7592 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7531 + # source://prism//lib/prism/node.rb#7597 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7536 + # source://prism//lib/prism/node.rb#7602 def type; end end end @@ -16375,13 +16314,13 @@ end # $target &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7552 +# source://prism//lib/prism/node.rb#7618 class Prism::GlobalVariableAndWriteNode < ::Prism::Node # Initialize a new GlobalVariableAndWriteNode node. # # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7554 + # source://prism//lib/prism/node.rb#7620 sig do params( source: Prism::Source, @@ -16399,36 +16338,36 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7652 + # source://prism//lib/prism/node.rb#7718 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7566 + # source://prism//lib/prism/node.rb#7632 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7571 + # source://prism//lib/prism/node.rb#7637 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7581 + # source://prism//lib/prism/node.rb#7647 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7576 + # source://prism//lib/prism/node.rb#7642 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7586 + # source://prism//lib/prism/node.rb#7652 sig do params( node_id: Integer, @@ -16442,20 +16381,20 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7591 + # source://prism//lib/prism/node.rb#7657 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#7594 + # source://prism//lib/prism/node.rb#7660 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#200 + # source://prism//lib/prism/desugar_compiler.rb#201 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -16463,62 +16402,62 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7636 + # source://prism//lib/prism/node.rb#7702 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7599 + # source://prism//lib/prism/node.rb#7665 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7602 + # source://prism//lib/prism/node.rb#7668 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7631 + # source://prism//lib/prism/node.rb#7697 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7615 + # source://prism//lib/prism/node.rb#7681 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7610 + # source://prism//lib/prism/node.rb#7676 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7623 + # source://prism//lib/prism/node.rb#7689 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7641 + # source://prism//lib/prism/node.rb#7707 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7628 + # source://prism//lib/prism/node.rb#7694 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7646 + # source://prism//lib/prism/node.rb#7712 def type; end end end @@ -16528,13 +16467,13 @@ end # $target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7665 +# source://prism//lib/prism/node.rb#7731 class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # Initialize a new GlobalVariableOperatorWriteNode node. # # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7667 + # source://prism//lib/prism/node.rb#7733 sig do params( source: Prism::Source, @@ -16553,48 +16492,48 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7764 + # source://prism//lib/prism/node.rb#7830 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7680 + # source://prism//lib/prism/node.rb#7746 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#7745 + # source://prism//lib/prism/node.rb#7811 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#7729 + # source://prism//lib/prism/node.rb#7795 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7685 + # source://prism//lib/prism/node.rb#7751 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7695 + # source://prism//lib/prism/node.rb#7761 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7690 + # source://prism//lib/prism/node.rb#7756 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7700 + # source://prism//lib/prism/node.rb#7766 sig do params( node_id: Integer, @@ -16609,20 +16548,20 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7705 + # source://prism//lib/prism/node.rb#7771 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol } # - # source://prism//lib/prism/node.rb#7708 + # source://prism//lib/prism/node.rb#7774 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#212 + # source://prism//lib/prism/desugar_compiler.rb#213 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -16630,62 +16569,62 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7748 + # source://prism//lib/prism/node.rb#7814 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7713 + # source://prism//lib/prism/node.rb#7779 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7716 + # source://prism//lib/prism/node.rb#7782 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#403 + # source://prism//lib/prism/node_ext.rb#406 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#410 + # source://prism//lib/prism/node_ext.rb#413 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7737 + # source://prism//lib/prism/node.rb#7803 def save_binary_operator_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7724 + # source://prism//lib/prism/node.rb#7790 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7753 + # source://prism//lib/prism/node.rb#7819 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7742 + # source://prism//lib/prism/node.rb#7808 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7758 + # source://prism//lib/prism/node.rb#7824 def type; end end end @@ -16695,13 +16634,13 @@ end # $target ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7778 +# source://prism//lib/prism/node.rb#7844 class Prism::GlobalVariableOrWriteNode < ::Prism::Node # Initialize a new GlobalVariableOrWriteNode node. # # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7780 + # source://prism//lib/prism/node.rb#7846 sig do params( source: Prism::Source, @@ -16719,36 +16658,36 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7878 + # source://prism//lib/prism/node.rb#7944 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7792 + # source://prism//lib/prism/node.rb#7858 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7797 + # source://prism//lib/prism/node.rb#7863 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7807 + # source://prism//lib/prism/node.rb#7873 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7802 + # source://prism//lib/prism/node.rb#7868 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7812 + # source://prism//lib/prism/node.rb#7878 sig do params( node_id: Integer, @@ -16762,20 +16701,20 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7817 + # source://prism//lib/prism/node.rb#7883 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#7820 + # source://prism//lib/prism/node.rb#7886 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#206 + # source://prism//lib/prism/desugar_compiler.rb#207 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -16783,62 +16722,62 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7862 + # source://prism//lib/prism/node.rb#7928 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7825 + # source://prism//lib/prism/node.rb#7891 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7828 + # source://prism//lib/prism/node.rb#7894 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7857 + # source://prism//lib/prism/node.rb#7923 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7841 + # source://prism//lib/prism/node.rb#7907 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7836 + # source://prism//lib/prism/node.rb#7902 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#7849 + # source://prism//lib/prism/node.rb#7915 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7867 + # source://prism//lib/prism/node.rb#7933 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7854 + # source://prism//lib/prism/node.rb#7920 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7872 + # source://prism//lib/prism/node.rb#7938 def type; end end end @@ -16848,49 +16787,49 @@ end # $foo # ^^^^ # -# source://prism//lib/prism/node.rb#7891 +# source://prism//lib/prism/node.rb#7957 class Prism::GlobalVariableReadNode < ::Prism::Node # Initialize a new GlobalVariableReadNode node. # # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#7893 + # source://prism//lib/prism/node.rb#7959 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#7958 + # source://prism//lib/prism/node.rb#8024 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7902 + # source://prism//lib/prism/node.rb#7968 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7907 + # source://prism//lib/prism/node.rb#7973 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7917 + # source://prism//lib/prism/node.rb#7983 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7912 + # source://prism//lib/prism/node.rb#7978 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#7922 + # source://prism//lib/prism/node.rb#7988 sig do params( node_id: Integer, @@ -16901,16 +16840,16 @@ class Prism::GlobalVariableReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7927 + # source://prism//lib/prism/node.rb#7993 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#7930 + # source://prism//lib/prism/node.rb#7996 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -16919,7 +16858,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#7942 + # source://prism//lib/prism/node.rb#8008 sig { override.returns(String) } def inspect; end @@ -16929,20 +16868,20 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # $_Test # name `:$_Test` # - # source://prism//lib/prism/node.rb#7939 + # source://prism//lib/prism/node.rb#8005 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#7947 + # source://prism//lib/prism/node.rb#8013 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#7952 + # source://prism//lib/prism/node.rb#8018 def type; end end end @@ -16952,49 +16891,49 @@ end # $foo, $bar = baz # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#7968 +# source://prism//lib/prism/node.rb#8034 class Prism::GlobalVariableTargetNode < ::Prism::Node # Initialize a new GlobalVariableTargetNode node. # # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#7970 + # source://prism//lib/prism/node.rb#8036 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8031 + # source://prism//lib/prism/node.rb#8097 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7979 + # source://prism//lib/prism/node.rb#8045 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#7984 + # source://prism//lib/prism/node.rb#8050 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7994 + # source://prism//lib/prism/node.rb#8060 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#7989 + # source://prism//lib/prism/node.rb#8055 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#7999 + # source://prism//lib/prism/node.rb#8065 sig do params( node_id: Integer, @@ -17005,16 +16944,16 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8004 + # source://prism//lib/prism/node.rb#8070 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#8007 + # source://prism//lib/prism/node.rb#8073 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17023,26 +16962,26 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8015 + # source://prism//lib/prism/node.rb#8081 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#8012 + # source://prism//lib/prism/node.rb#8078 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8020 + # source://prism//lib/prism/node.rb#8086 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8025 + # source://prism//lib/prism/node.rb#8091 def type; end end end @@ -17052,13 +16991,13 @@ end # $foo = 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#8041 +# source://prism//lib/prism/node.rb#8107 class Prism::GlobalVariableWriteNode < ::Prism::Node # Initialize a new GlobalVariableWriteNode node. # # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8043 + # source://prism//lib/prism/node.rb#8109 sig do params( source: Prism::Source, @@ -17076,36 +17015,36 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8157 + # source://prism//lib/prism/node.rb#8223 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8055 + # source://prism//lib/prism/node.rb#8121 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8060 + # source://prism//lib/prism/node.rb#8126 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8070 + # source://prism//lib/prism/node.rb#8136 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8065 + # source://prism//lib/prism/node.rb#8131 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8075 + # source://prism//lib/prism/node.rb#8141 sig do params( node_id: Integer, @@ -17119,16 +17058,16 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8080 + # source://prism//lib/prism/node.rb#8146 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#8083 + # source://prism//lib/prism/node.rb#8149 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17137,7 +17076,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8141 + # source://prism//lib/prism/node.rb#8207 sig { override.returns(String) } def inspect; end @@ -17147,7 +17086,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # $_Test = 123 # name `:$_Test` # - # source://prism//lib/prism/node.rb#8092 + # source://prism//lib/prism/node.rb#8158 sig { returns(Symbol) } def name; end @@ -17156,13 +17095,13 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $foo = :bar # ^^^^ # - # source://prism//lib/prism/node.rb#8098 + # source://prism//lib/prism/node.rb#8164 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#8136 + # source://prism//lib/prism/node.rb#8202 sig { returns(String) } def operator; end @@ -17171,25 +17110,25 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $foo = :bar # ^ # - # source://prism//lib/prism/node.rb#8123 + # source://prism//lib/prism/node.rb#8189 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8106 + # source://prism//lib/prism/node.rb#8172 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8131 + # source://prism//lib/prism/node.rb#8197 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8146 + # source://prism//lib/prism/node.rb#8212 sig { override.returns(Symbol) } def type; end @@ -17201,14 +17140,14 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # $-xyz = 123 # ^^^ # - # source://prism//lib/prism/node.rb#8117 + # source://prism//lib/prism/node.rb#8183 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8151 + # source://prism//lib/prism/node.rb#8217 def type; end end end @@ -17218,13 +17157,13 @@ end # { a => b } # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8170 +# source://prism//lib/prism/node.rb#8236 class Prism::HashNode < ::Prism::Node # Initialize a new HashNode node. # # @return [HashNode] a new instance of HashNode # - # source://prism//lib/prism/node.rb#8172 + # source://prism//lib/prism/node.rb#8238 sig do params( source: Prism::Source, @@ -17241,24 +17180,24 @@ class Prism::HashNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8283 + # source://prism//lib/prism/node.rb#8349 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8183 + # source://prism//lib/prism/node.rb#8249 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8188 + # source://prism//lib/prism/node.rb#8254 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#8262 + # source://prism//lib/prism/node.rb#8328 sig { returns(String) } def closing; end @@ -17267,25 +17206,25 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8244 + # source://prism//lib/prism/node.rb#8310 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8198 + # source://prism//lib/prism/node.rb#8264 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8193 + # source://prism//lib/prism/node.rb#8259 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?elements: Array[AssocNode | AssocSplatNode], ?closing_loc: Location) -> HashNode # - # source://prism//lib/prism/node.rb#8203 + # source://prism//lib/prism/node.rb#8269 sig do params( node_id: Integer, @@ -17298,16 +17237,16 @@ class Prism::HashNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), elements: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8208 + # source://prism//lib/prism/node.rb#8274 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, elements: Array[AssocNode | AssocSplatNode], closing_loc: Location } # - # source://prism//lib/prism/node.rb#8211 + # source://prism//lib/prism/node.rb#8277 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17319,7 +17258,7 @@ class Prism::HashNode < ::Prism::Node # { **foo } # ^^^^^ # - # source://prism//lib/prism/node.rb#8238 + # source://prism//lib/prism/node.rb#8304 sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } def elements; end @@ -17328,13 +17267,13 @@ class Prism::HashNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8267 + # source://prism//lib/prism/node.rb#8333 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#8257 + # source://prism//lib/prism/node.rb#8323 sig { returns(String) } def opening; end @@ -17343,32 +17282,32 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8219 + # source://prism//lib/prism/node.rb#8285 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8252 + # source://prism//lib/prism/node.rb#8318 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8227 + # source://prism//lib/prism/node.rb#8293 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8272 + # source://prism//lib/prism/node.rb#8338 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8277 + # source://prism//lib/prism/node.rb#8343 def type; end end end @@ -17381,20 +17320,26 @@ end # foo => { a: 1, b: 2, **c } # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8299 +# foo => Bar[a: 1, b: 2] +# ^^^^^^^^^^^^^^^ +# +# foo in { a: 1, b: 2 } +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8371 class Prism::HashPatternNode < ::Prism::Node # Initialize a new HashPatternNode node. # # @return [HashPatternNode] a new instance of HashPatternNode # - # source://prism//lib/prism/node.rb#8301 + # source://prism//lib/prism/node.rb#8373 sig do params( source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), elements: T::Array[Prism::AssocNode], rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)), opening_loc: T.nilable(Prism::Location), @@ -17406,60 +17351,72 @@ class Prism::HashPatternNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8424 + # source://prism//lib/prism/node.rb#8526 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8314 + # source://prism//lib/prism/node.rb#8386 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8319 + # source://prism//lib/prism/node.rb#8391 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#8403 + # source://prism//lib/prism/node.rb#8505 sig { returns(T.nilable(String)) } def closing; end - # attr_reader closing_loc: Location? + # The location of the closing brace. + # + # foo => { a: 1 } + # ^ # - # source://prism//lib/prism/node.rb#8379 + # foo => Bar[a: 1] + # ^ + # + # source://prism//lib/prism/node.rb#8481 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8333 + # source://prism//lib/prism/node.rb#8405 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8324 + # source://prism//lib/prism/node.rb#8396 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: ConstantReadNode | ConstantPathNode | nil + # Represents the optional constant preceding the Hash. # - # source://prism//lib/prism/node.rb#8351 - sig { returns(T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode))) } + # foo => Bar[a: 1, b: 2] + # ^^^ + # + # foo => Bar::Baz[a: 1, b: 2] + # ^^^^^^^^ + # + # source://prism//lib/prism/node.rb#8429 + sig { returns(T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode))) } def constant; end - # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantReadNode | ConstantPathNode | nil, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?) -> HashPatternNode + # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?constant: ConstantPathNode | ConstantReadNode | nil, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?) -> HashPatternNode # - # source://prism//lib/prism/node.rb#8338 + # source://prism//lib/prism/node.rb#8410 sig do params( node_id: Integer, location: Prism::Location, flags: Integer, - constant: T.nilable(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode)), + constant: T.nilable(T.any(Prism::ConstantPathNode, Prism::ConstantReadNode)), elements: T::Array[Prism::AssocNode], rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)), opening_loc: T.nilable(Prism::Location), @@ -17468,22 +17425,25 @@ class Prism::HashPatternNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), constant: T.unsafe(nil), elements: T.unsafe(nil), rest: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8343 + # source://prism//lib/prism/node.rb#8415 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantReadNode | ConstantPathNode | nil, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location? } + # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, constant: ConstantPathNode | ConstantReadNode | nil, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location? } # - # source://prism//lib/prism/node.rb#8346 + # source://prism//lib/prism/node.rb#8418 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader elements: Array[AssocNode] + # Represents the explicit named hash keys and values. # - # source://prism//lib/prism/node.rb#8354 + # foo => { a: 1, b:, ** } + # ^^^^^^^^ + # + # source://prism//lib/prism/node.rb#8435 sig { returns(T::Array[Prism::AssocNode]) } def elements; end @@ -17492,61 +17452,76 @@ class Prism::HashPatternNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8408 + # source://prism//lib/prism/node.rb#8510 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#8398 + # source://prism//lib/prism/node.rb#8500 sig { returns(T.nilable(String)) } def opening; end - # attr_reader opening_loc: Location? + # The location of the opening brace. # - # source://prism//lib/prism/node.rb#8360 + # foo => { a: 1 } + # ^ + # + # foo => Bar[a: 1] + # ^ + # + # source://prism//lib/prism/node.rb#8456 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader rest: AssocSplatNode | NoKeywordsParameterNode | nil + # Represents the rest of the Hash keys and values. This can be named, unnamed, or explicitly forbidden via `**nil`, this last one results in a `NoKeywordsParameterNode`. + # + # foo => { a: 1, b:, **c } + # ^^^ # - # source://prism//lib/prism/node.rb#8357 + # foo => { a: 1, b:, ** } + # ^^ + # + # foo => { a: 1, b:, **nil } + # ^^^^^ + # + # source://prism//lib/prism/node.rb#8447 sig { returns(T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode))) } def rest; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8393 + # source://prism//lib/prism/node.rb#8495 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8374 + # source://prism//lib/prism/node.rb#8470 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8413 + # source://prism//lib/prism/node.rb#8515 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8418 + # source://prism//lib/prism/node.rb#8520 def type; end end end -# source://prism//lib/prism/node_ext.rb#52 +# source://prism//lib/prism/node_ext.rb#55 module Prism::HeredocQuery # Returns true if this node was represented as a heredoc in the source code. # # @return [Boolean] # - # source://prism//lib/prism/node_ext.rb#54 + # source://prism//lib/prism/node_ext.rb#57 def heredoc?; end end @@ -17561,13 +17536,13 @@ end # foo ? bar : baz # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8445 +# source://prism//lib/prism/node.rb#8547 class Prism::IfNode < ::Prism::Node # Initialize a new IfNode node. # # @return [IfNode] a new instance of IfNode # - # source://prism//lib/prism/node.rb#8447 + # source://prism//lib/prism/node.rb#8549 sig do params( source: Prism::Source, @@ -17587,42 +17562,42 @@ class Prism::IfNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8641 + # source://prism//lib/prism/node.rb#8743 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8461 + # source://prism//lib/prism/node.rb#8563 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8466 + # source://prism//lib/prism/node.rb#8568 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8480 + # source://prism//lib/prism/node.rb#8582 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8471 + # source://prism//lib/prism/node.rb#8573 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # Returns the subsequent if/elsif/else clause of the if node. This method is # deprecated in favor of #subsequent. # - # source://prism//lib/prism/node_ext.rb#485 + # source://prism//lib/prism/node_ext.rb#488 def consequent; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?if_keyword_loc: Location?, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?subsequent: ElseNode | IfNode | nil, ?end_keyword_loc: Location?) -> IfNode # - # source://prism//lib/prism/node.rb#8485 + # source://prism//lib/prism/node.rb#8587 sig do params( node_id: Integer, @@ -17638,22 +17613,22 @@ class Prism::IfNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), if_keyword_loc: T.unsafe(nil), predicate: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), subsequent: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8490 + # source://prism//lib/prism/node.rb#8592 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, if_keyword_loc: Location?, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, subsequent: ElseNode | IfNode | nil, end_keyword_loc: Location? } # - # source://prism//lib/prism/node.rb#8493 + # source://prism//lib/prism/node.rb#8595 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8620 + # source://prism//lib/prism/node.rb#8722 sig { returns(T.nilable(String)) } def end_keyword; end @@ -17664,7 +17639,7 @@ class Prism::IfNode < ::Prism::Node # end # ^^^ # - # source://prism//lib/prism/node.rb#8591 + # source://prism//lib/prism/node.rb#8693 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -17673,7 +17648,7 @@ class Prism::IfNode < ::Prism::Node # def if_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8610 + # source://prism//lib/prism/node.rb#8712 sig { returns(T.nilable(String)) } def if_keyword; end @@ -17684,17 +17659,17 @@ class Prism::IfNode < ::Prism::Node # # The `if_keyword_loc` field will be `nil` when the `IfNode` represents a ternary expression. # - # source://prism//lib/prism/node.rb#8503 + # source://prism//lib/prism/node.rb#8605 sig { returns(T.nilable(Prism::Location)) } def if_keyword_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#8625 + # source://prism//lib/prism/node.rb#8727 sig { override.returns(String) } def inspect; end - # source://prism//lib/prism/parse_result/newlines.rb#91 + # source://prism//lib/prism/parse_result/newlines.rb#92 def newline_flag!(lines); end # The node for the condition the `IfNode` is testing. @@ -17710,26 +17685,26 @@ class Prism::IfNode < ::Prism::Node # foo ? bar : baz # ^^^ # - # source://prism//lib/prism/node.rb#8533 + # source://prism//lib/prism/node.rb#8635 sig { returns(Prism::Node) } def predicate; end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8605 + # source://prism//lib/prism/node.rb#8707 def save_end_keyword_loc(repository); end # Save the if_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8517 + # source://prism//lib/prism/node.rb#8619 def save_if_keyword_loc(repository); end # Save the then_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8556 + # source://prism//lib/prism/node.rb#8658 def save_then_keyword_loc(repository); end # Represents the body of statements that will be executed when the predicate is evaluated as truthy. Will be `nil` when no body is provided. @@ -17741,7 +17716,7 @@ class Prism::IfNode < ::Prism::Node # ^^^ # end # - # source://prism//lib/prism/node.rb#8568 + # source://prism//lib/prism/node.rb#8670 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -17759,13 +17734,13 @@ class Prism::IfNode < ::Prism::Node # if foo then bar else baz end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#8583 + # source://prism//lib/prism/node.rb#8685 sig { returns(T.nilable(T.any(Prism::ElseNode, Prism::IfNode))) } def subsequent; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8615 + # source://prism//lib/prism/node.rb#8717 sig { returns(T.nilable(String)) } def then_keyword; end @@ -17777,20 +17752,20 @@ class Prism::IfNode < ::Prism::Node # a ? b : c # ^ # - # source://prism//lib/prism/node.rb#8542 + # source://prism//lib/prism/node.rb#8644 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8630 + # source://prism//lib/prism/node.rb#8732 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8635 + # source://prism//lib/prism/node.rb#8737 def type; end end end @@ -17800,13 +17775,13 @@ end # 1.0i # ^^^^ # -# source://prism//lib/prism/node.rb#8656 +# source://prism//lib/prism/node.rb#8758 class Prism::ImaginaryNode < ::Prism::Node # Initialize a new ImaginaryNode node. # # @return [ImaginaryNode] a new instance of ImaginaryNode # - # source://prism//lib/prism/node.rb#8658 + # source://prism//lib/prism/node.rb#8760 sig do params( source: Prism::Source, @@ -17821,36 +17796,36 @@ class Prism::ImaginaryNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8719 + # source://prism//lib/prism/node.rb#8821 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8667 + # source://prism//lib/prism/node.rb#8769 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8672 + # source://prism//lib/prism/node.rb#8774 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8682 + # source://prism//lib/prism/node.rb#8784 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8677 + # source://prism//lib/prism/node.rb#8779 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numeric: FloatNode | IntegerNode | RationalNode) -> ImaginaryNode # - # source://prism//lib/prism/node.rb#8687 + # source://prism//lib/prism/node.rb#8789 sig do params( node_id: Integer, @@ -17861,16 +17836,16 @@ class Prism::ImaginaryNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), numeric: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8692 + # source://prism//lib/prism/node.rb#8794 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numeric: FloatNode | IntegerNode | RationalNode } # - # source://prism//lib/prism/node.rb#8695 + # source://prism//lib/prism/node.rb#8797 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17879,32 +17854,32 @@ class Prism::ImaginaryNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8703 + # source://prism//lib/prism/node.rb#8805 sig { override.returns(String) } def inspect; end # attr_reader numeric: FloatNode | IntegerNode | RationalNode # - # source://prism//lib/prism/node.rb#8700 + # source://prism//lib/prism/node.rb#8802 sig { returns(T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)) } def numeric; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8708 + # source://prism//lib/prism/node.rb#8810 sig { override.returns(Symbol) } def type; end # Returns the value of the node as a Ruby Complex. # - # source://prism//lib/prism/node_ext.rb#107 + # source://prism//lib/prism/node_ext.rb#110 sig { returns(Complex) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8713 + # source://prism//lib/prism/node.rb#8815 def type; end end end @@ -17920,13 +17895,13 @@ end # foo in { bar: } # ^^^^ # -# source://prism//lib/prism/node.rb#8735 +# source://prism//lib/prism/node.rb#8837 class Prism::ImplicitNode < ::Prism::Node # Initialize a new ImplicitNode node. # # @return [ImplicitNode] a new instance of ImplicitNode # - # source://prism//lib/prism/node.rb#8737 + # source://prism//lib/prism/node.rb#8839 sig do params( source: Prism::Source, @@ -17941,36 +17916,36 @@ class Prism::ImplicitNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8798 + # source://prism//lib/prism/node.rb#8900 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8746 + # source://prism//lib/prism/node.rb#8848 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8751 + # source://prism//lib/prism/node.rb#8853 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8761 + # source://prism//lib/prism/node.rb#8863 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8756 + # source://prism//lib/prism/node.rb#8858 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode) -> ImplicitNode # - # source://prism//lib/prism/node.rb#8766 + # source://prism//lib/prism/node.rb#8868 sig do params( node_id: Integer, @@ -17981,16 +17956,16 @@ class Prism::ImplicitNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8771 + # source://prism//lib/prism/node.rb#8873 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode } # - # source://prism//lib/prism/node.rb#8774 + # source://prism//lib/prism/node.rb#8876 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -17999,19 +17974,19 @@ class Prism::ImplicitNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8782 + # source://prism//lib/prism/node.rb#8884 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8787 + # source://prism//lib/prism/node.rb#8889 sig { override.returns(Symbol) } def type; end # attr_reader value: LocalVariableReadNode | CallNode | ConstantReadNode | LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#8779 + # source://prism//lib/prism/node.rb#8881 sig do returns(T.any(Prism::LocalVariableReadNode, Prism::CallNode, Prism::ConstantReadNode, Prism::LocalVariableTargetNode)) end @@ -18020,7 +17995,7 @@ class Prism::ImplicitNode < ::Prism::Node class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8792 + # source://prism//lib/prism/node.rb#8894 def type; end end end @@ -18039,62 +18014,62 @@ end # foo, = bar # ^ # -# source://prism//lib/prism/node.rb#8817 +# source://prism//lib/prism/node.rb#8919 class Prism::ImplicitRestNode < ::Prism::Node # Initialize a new ImplicitRestNode node. # # @return [ImplicitRestNode] a new instance of ImplicitRestNode # - # source://prism//lib/prism/node.rb#8819 + # source://prism//lib/prism/node.rb#8921 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8876 + # source://prism//lib/prism/node.rb#8978 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8827 + # source://prism//lib/prism/node.rb#8929 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8832 + # source://prism//lib/prism/node.rb#8934 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8842 + # source://prism//lib/prism/node.rb#8944 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8837 + # source://prism//lib/prism/node.rb#8939 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ImplicitRestNode # - # source://prism//lib/prism/node.rb#8847 + # source://prism//lib/prism/node.rb#8949 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ImplicitRestNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8852 + # source://prism//lib/prism/node.rb#8954 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#8855 + # source://prism//lib/prism/node.rb#8957 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18103,20 +18078,20 @@ class Prism::ImplicitRestNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#8860 + # source://prism//lib/prism/node.rb#8962 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8865 + # source://prism//lib/prism/node.rb#8967 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8870 + # source://prism//lib/prism/node.rb#8972 def type; end end end @@ -18126,13 +18101,13 @@ end # case a; in b then c end # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8885 +# source://prism//lib/prism/node.rb#8987 class Prism::InNode < ::Prism::Node # Initialize a new InNode node. # # @return [InNode] a new instance of InNode # - # source://prism//lib/prism/node.rb#8887 + # source://prism//lib/prism/node.rb#8989 sig do params( source: Prism::Source, @@ -18150,36 +18125,36 @@ class Prism::InNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#8999 + # source://prism//lib/prism/node.rb#9101 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8899 + # source://prism//lib/prism/node.rb#9001 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8904 + # source://prism//lib/prism/node.rb#9006 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8917 + # source://prism//lib/prism/node.rb#9019 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#8909 + # source://prism//lib/prism/node.rb#9011 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?pattern: Prism::node, ?statements: StatementsNode?, ?in_loc: Location, ?then_loc: Location?) -> InNode # - # source://prism//lib/prism/node.rb#8922 + # source://prism//lib/prism/node.rb#9024 sig do params( node_id: Integer, @@ -18193,16 +18168,16 @@ class Prism::InNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), pattern: T.unsafe(nil), statements: T.unsafe(nil), in_loc: T.unsafe(nil), then_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#8927 + # source://prism//lib/prism/node.rb#9029 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, pattern: Prism::node, statements: StatementsNode?, in_loc: Location, then_loc: Location? } # - # source://prism//lib/prism/node.rb#8930 + # source://prism//lib/prism/node.rb#9032 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18211,68 +18186,68 @@ class Prism::InNode < ::Prism::Node # def in: () -> String # - # source://prism//lib/prism/node.rb#8973 + # source://prism//lib/prism/node.rb#9075 sig { returns(String) } def in; end # attr_reader in_loc: Location # - # source://prism//lib/prism/node.rb#8941 + # source://prism//lib/prism/node.rb#9043 sig { returns(Prism::Location) } def in_loc; end # def inspect -> String # - # source://prism//lib/prism/node.rb#8983 + # source://prism//lib/prism/node.rb#9085 sig { override.returns(String) } def inspect; end # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#8935 + # source://prism//lib/prism/node.rb#9037 sig { returns(Prism::Node) } def pattern; end # Save the in_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8949 + # source://prism//lib/prism/node.rb#9051 def save_in_loc(repository); end # Save the then_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#8968 + # source://prism//lib/prism/node.rb#9070 def save_then_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#8938 + # source://prism//lib/prism/node.rb#9040 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then: () -> String? # - # source://prism//lib/prism/node.rb#8978 + # source://prism//lib/prism/node.rb#9080 sig { returns(T.nilable(String)) } def then; end # attr_reader then_loc: Location? # - # source://prism//lib/prism/node.rb#8954 + # source://prism//lib/prism/node.rb#9056 sig { returns(T.nilable(Prism::Location)) } def then_loc; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#8988 + # source://prism//lib/prism/node.rb#9090 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#8993 + # source://prism//lib/prism/node.rb#9095 def type; end end end @@ -18282,13 +18257,13 @@ end # foo.bar[baz] &&= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9012 +# source://prism//lib/prism/node.rb#9114 class Prism::IndexAndWriteNode < ::Prism::Node # Initialize a new IndexAndWriteNode node. # # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9014 + # source://prism//lib/prism/node.rb#9116 sig do params( source: Prism::Source, @@ -18310,18 +18285,18 @@ class Prism::IndexAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9194 + # source://prism//lib/prism/node.rb#9296 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9030 + # source://prism//lib/prism/node.rb#9132 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9123 + # source://prism//lib/prism/node.rb#9225 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -18329,61 +18304,61 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9078 + # source://prism//lib/prism/node.rb#9180 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: BlockArgumentNode? # - # source://prism//lib/prism/node.rb#9139 + # source://prism//lib/prism/node.rb#9241 sig { returns(T.nilable(Prism::BlockArgumentNode)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9158 + # source://prism//lib/prism/node.rb#9260 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9091 + # source://prism//lib/prism/node.rb#9193 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9035 + # source://prism//lib/prism/node.rb#9137 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9168 + # source://prism//lib/prism/node.rb#9270 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9126 + # source://prism//lib/prism/node.rb#9228 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9050 + # source://prism//lib/prism/node.rb#9152 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9040 + # source://prism//lib/prism/node.rb#9142 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9055 + # source://prism//lib/prism/node.rb#9157 sig do params( node_id: Integer, @@ -18401,16 +18376,16 @@ class Prism::IndexAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9060 + # source://prism//lib/prism/node.rb#9162 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#9063 + # source://prism//lib/prism/node.rb#9165 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18421,43 +18396,43 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9083 + # source://prism//lib/prism/node.rb#9185 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9178 + # source://prism//lib/prism/node.rb#9280 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9163 + # source://prism//lib/prism/node.rb#9265 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9110 + # source://prism//lib/prism/node.rb#9212 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9173 + # source://prism//lib/prism/node.rb#9275 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9142 + # source://prism//lib/prism/node.rb#9244 sig { returns(Prism::Location) } def operator_loc; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9088 + # source://prism//lib/prism/node.rb#9190 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -18465,43 +18440,43 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9068 + # source://prism//lib/prism/node.rb#9170 sig { returns(T::Boolean) } def safe_navigation?; end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9105 + # source://prism//lib/prism/node.rb#9207 def save_call_operator_loc(repository); end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9134 + # source://prism//lib/prism/node.rb#9236 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9118 + # source://prism//lib/prism/node.rb#9220 def save_opening_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9150 + # source://prism//lib/prism/node.rb#9252 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#9183 + # source://prism//lib/prism/node.rb#9285 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9155 + # source://prism//lib/prism/node.rb#9257 sig { returns(Prism::Node) } def value; end @@ -18509,14 +18484,14 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9073 + # source://prism//lib/prism/node.rb#9175 sig { returns(T::Boolean) } def variable_call?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#9188 + # source://prism//lib/prism/node.rb#9290 def type; end end end @@ -18526,13 +18501,13 @@ end # foo.bar[baz] += value # ^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9212 +# source://prism//lib/prism/node.rb#9314 class Prism::IndexOperatorWriteNode < ::Prism::Node # Initialize a new IndexOperatorWriteNode node. # # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9214 + # source://prism//lib/prism/node.rb#9316 sig do params( source: Prism::Source, @@ -18555,18 +18530,18 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9393 + # source://prism//lib/prism/node.rb#9495 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9231 + # source://prism//lib/prism/node.rb#9333 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9324 + # source://prism//lib/prism/node.rb#9426 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -18574,73 +18549,73 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9279 + # source://prism//lib/prism/node.rb#9381 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#9343 + # source://prism//lib/prism/node.rb#9445 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#9346 + # source://prism//lib/prism/node.rb#9448 sig { returns(Prism::Location) } def binary_operator_loc; end # attr_reader block: BlockArgumentNode? # - # source://prism//lib/prism/node.rb#9340 + # source://prism//lib/prism/node.rb#9442 sig { returns(T.nilable(Prism::BlockArgumentNode)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9362 + # source://prism//lib/prism/node.rb#9464 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9292 + # source://prism//lib/prism/node.rb#9394 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9236 + # source://prism//lib/prism/node.rb#9338 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9372 + # source://prism//lib/prism/node.rb#9474 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9327 + # source://prism//lib/prism/node.rb#9429 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9251 + # source://prism//lib/prism/node.rb#9353 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9241 + # source://prism//lib/prism/node.rb#9343 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node) -> IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9256 + # source://prism//lib/prism/node.rb#9358 sig do params( node_id: Integer, @@ -18659,16 +18634,16 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil), binary_operator: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9261 + # source://prism//lib/prism/node.rb#9363 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#9264 + # source://prism//lib/prism/node.rb#9366 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -18679,43 +18654,43 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9284 + # source://prism//lib/prism/node.rb#9386 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9377 + # source://prism//lib/prism/node.rb#9479 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9367 + # source://prism//lib/prism/node.rb#9469 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9311 + # source://prism//lib/prism/node.rb#9413 sig { returns(Prism::Location) } def opening_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#419 + # source://prism//lib/prism/node_ext.rb#422 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#426 + # source://prism//lib/prism/node_ext.rb#429 def operator_loc; end # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9289 + # source://prism//lib/prism/node.rb#9391 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -18723,43 +18698,43 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9269 + # source://prism//lib/prism/node.rb#9371 sig { returns(T::Boolean) } def safe_navigation?; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9354 + # source://prism//lib/prism/node.rb#9456 def save_binary_operator_loc(repository); end # Save the call_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9306 + # source://prism//lib/prism/node.rb#9408 def save_call_operator_loc(repository); end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9335 + # source://prism//lib/prism/node.rb#9437 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9319 + # source://prism//lib/prism/node.rb#9421 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#9382 + # source://prism//lib/prism/node.rb#9484 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9359 + # source://prism//lib/prism/node.rb#9461 sig { returns(Prism::Node) } def value; end @@ -18767,14 +18742,14 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9274 + # source://prism//lib/prism/node.rb#9376 sig { returns(T::Boolean) } def variable_call?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#9387 + # source://prism//lib/prism/node.rb#9489 def type; end end end @@ -18784,13 +18759,13 @@ end # foo.bar[baz] ||= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9412 +# source://prism//lib/prism/node.rb#9514 class Prism::IndexOrWriteNode < ::Prism::Node # Initialize a new IndexOrWriteNode node. # # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode # - # source://prism//lib/prism/node.rb#9414 + # source://prism//lib/prism/node.rb#9516 sig do params( source: Prism::Source, @@ -18812,267 +18787,18 @@ class Prism::IndexOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9594 - def ===(other); end - - # def accept: (Visitor visitor) -> void - # - # source://prism//lib/prism/node.rb#9430 - sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } - def accept(visitor); end - - # attr_reader arguments: ArgumentsNode? - # - # source://prism//lib/prism/node.rb#9523 - sig { returns(T.nilable(Prism::ArgumentsNode)) } - def arguments; end - - # def attribute_write?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#9478 - sig { returns(T::Boolean) } - def attribute_write?; end - - # attr_reader block: BlockArgumentNode? - # - # source://prism//lib/prism/node.rb#9539 - sig { returns(T.nilable(Prism::BlockArgumentNode)) } - def block; end - - # def call_operator: () -> String? - # - # source://prism//lib/prism/node.rb#9558 - sig { returns(T.nilable(String)) } - def call_operator; end - - # attr_reader call_operator_loc: Location? - # - # source://prism//lib/prism/node.rb#9491 - sig { returns(T.nilable(Prism::Location)) } - def call_operator_loc; end - - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#9435 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # def closing: () -> String - # - # source://prism//lib/prism/node.rb#9568 - sig { returns(String) } - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//lib/prism/node.rb#9526 - sig { returns(Prism::Location) } - def closing_loc; end - - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//lib/prism/node.rb#9450 - sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//lib/prism/node.rb#9440 - sig { override.returns(T::Array[Prism::Node]) } - def compact_child_nodes; end - - # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexOrWriteNode - # - # source://prism//lib/prism/node.rb#9455 - sig do - params( - node_id: Integer, - location: Prism::Location, - flags: Integer, - receiver: T.nilable(Prism::Node), - call_operator_loc: T.nilable(Prism::Location), - opening_loc: Prism::Location, - arguments: T.nilable(Prism::ArgumentsNode), - closing_loc: Prism::Location, - block: T.nilable(Prism::BlockArgumentNode), - operator_loc: Prism::Location, - value: Prism::Node - ).returns(Prism::IndexOrWriteNode) - end - def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#9460 - sig { override.returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end - - # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node } - # - # source://prism//lib/prism/node.rb#9463 - sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } - def deconstruct_keys(keys); end - - sig { override.returns(T::Array[Prism::Reflection::Field]) } - def fields; end - - # def ignore_visibility?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#9483 - sig { returns(T::Boolean) } - def ignore_visibility?; end - - # def inspect -> String - # - # source://prism//lib/prism/node.rb#9578 - sig { override.returns(String) } - def inspect; end - - # def opening: () -> String - # - # source://prism//lib/prism/node.rb#9563 - sig { returns(String) } - def opening; end - - # attr_reader opening_loc: Location - # - # source://prism//lib/prism/node.rb#9510 - sig { returns(Prism::Location) } - def opening_loc; end - - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#9573 - sig { returns(String) } - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//lib/prism/node.rb#9542 - sig { returns(Prism::Location) } - def operator_loc; end - - # attr_reader receiver: Prism::node? - # - # source://prism//lib/prism/node.rb#9488 - sig { returns(T.nilable(Prism::Node)) } - def receiver; end - - # def safe_navigation?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#9468 - sig { returns(T::Boolean) } - def safe_navigation?; end - - # Save the call_operator_loc location using the given saved source so that - # it can be retrieved later. - # - # source://prism//lib/prism/node.rb#9505 - def save_call_operator_loc(repository); end - - # Save the closing_loc location using the given saved source so that - # it can be retrieved later. - # - # source://prism//lib/prism/node.rb#9534 - def save_closing_loc(repository); end - - # Save the opening_loc location using the given saved source so that - # it can be retrieved later. - # - # source://prism//lib/prism/node.rb#9518 - def save_opening_loc(repository); end - - # Save the operator_loc location using the given saved source so that - # it can be retrieved later. - # - # source://prism//lib/prism/node.rb#9550 - def save_operator_loc(repository); end - - # Return a symbol representation of this node type. See `Node#type`. - # - # source://prism//lib/prism/node.rb#9583 - sig { override.returns(Symbol) } - def type; end - - # attr_reader value: Prism::node - # - # source://prism//lib/prism/node.rb#9555 - sig { returns(Prism::Node) } - def value; end - - # def variable_call?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#9473 - sig { returns(T::Boolean) } - def variable_call?; end - - class << self - # Return a symbol representation of this node type. See `Node::type`. - # - # source://prism//lib/prism/node.rb#9588 - def type; end - end -end - -# Represents assigning to an index. -# -# foo[bar], = 1 -# ^^^^^^^^ -# -# begin -# rescue => foo[bar] -# ^^^^^^^^ -# end -# -# for foo[bar] in baz do end -# ^^^^^^^^ -# -# source://prism//lib/prism/node.rb#9620 -class Prism::IndexTargetNode < ::Prism::Node - # Initialize a new IndexTargetNode node. - # - # @return [IndexTargetNode] a new instance of IndexTargetNode - # - # source://prism//lib/prism/node.rb#9622 - sig do - params( - source: Prism::Source, - node_id: Integer, - location: Prism::Location, - flags: Integer, - receiver: Prism::Node, - opening_loc: Prism::Location, - arguments: T.nilable(Prism::ArgumentsNode), - closing_loc: Prism::Location, - block: T.nilable(Prism::BlockArgumentNode) - ).void - end - def initialize(source, node_id, location, flags, receiver, opening_loc, arguments, closing_loc, block); end - - # Implements case-equality for the node. This is effectively == but without - # comparing the value of locations. Locations are checked only for presence. - # - # source://prism//lib/prism/node.rb#9753 + # source://prism//lib/prism/node.rb#9696 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9635 + # source://prism//lib/prism/node.rb#9532 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9708 + # source://prism//lib/prism/node.rb#9625 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -19080,49 +18806,298 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9682 + # source://prism//lib/prism/node.rb#9580 sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: BlockArgumentNode? # + # source://prism//lib/prism/node.rb#9641 + sig { returns(T.nilable(Prism::BlockArgumentNode)) } + def block; end + + # def call_operator: () -> String? + # + # source://prism//lib/prism/node.rb#9660 + sig { returns(T.nilable(String)) } + def call_operator; end + + # attr_reader call_operator_loc: Location? + # + # source://prism//lib/prism/node.rb#9593 + sig { returns(T.nilable(Prism::Location)) } + def call_operator_loc; end + + # def child_nodes: () -> Array[Node?] + # + # source://prism//lib/prism/node.rb#9537 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#9670 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#9628 + sig { returns(Prism::Location) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#9552 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#9542 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?, ?operator_loc: Location, ?value: Prism::node) -> IndexOrWriteNode + # + # source://prism//lib/prism/node.rb#9557 + sig do + params( + node_id: Integer, + location: Prism::Location, + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + opening_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: Prism::Location, + block: T.nilable(Prism::BlockArgumentNode), + operator_loc: Prism::Location, + value: Prism::Node + ).returns(Prism::IndexOrWriteNode) + end + def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end + + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] + # + # source://prism//lib/prism/node.rb#9562 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode?, operator_loc: Location, value: Prism::node } + # + # source://prism//lib/prism/node.rb#9565 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9585 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#9680 + sig { override.returns(String) } + def inspect; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#9665 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#9612 + sig { returns(Prism::Location) } + def opening_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#9675 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#9644 + sig { returns(Prism::Location) } + def operator_loc; end + + # attr_reader receiver: Prism::node? + # + # source://prism//lib/prism/node.rb#9590 + sig { returns(T.nilable(Prism::Node)) } + def receiver; end + + # def safe_navigation?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9570 + sig { returns(T::Boolean) } + def safe_navigation?; end + + # Save the call_operator_loc location using the given saved source so that + # it can be retrieved later. + # + # source://prism//lib/prism/node.rb#9607 + def save_call_operator_loc(repository); end + + # Save the closing_loc location using the given saved source so that + # it can be retrieved later. + # + # source://prism//lib/prism/node.rb#9636 + def save_closing_loc(repository); end + + # Save the opening_loc location using the given saved source so that + # it can be retrieved later. + # + # source://prism//lib/prism/node.rb#9620 + def save_opening_loc(repository); end + + # Save the operator_loc location using the given saved source so that + # it can be retrieved later. + # + # source://prism//lib/prism/node.rb#9652 + def save_operator_loc(repository); end + + # Return a symbol representation of this node type. See `Node#type`. + # + # source://prism//lib/prism/node.rb#9685 + sig { override.returns(Symbol) } + def type; end + + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#9657 + sig { returns(Prism::Node) } + def value; end + + # def variable_call?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9575 + sig { returns(T::Boolean) } + def variable_call?; end + + class << self + # Return a symbol representation of this node type. See `Node::type`. + # + # source://prism//lib/prism/node.rb#9690 + def type; end + end +end + +# Represents assigning to an index. +# +# foo[bar], = 1 +# ^^^^^^^^ +# +# begin +# rescue => foo[bar] +# ^^^^^^^^ +# end +# +# for foo[bar] in baz do end +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9722 +class Prism::IndexTargetNode < ::Prism::Node + # Initialize a new IndexTargetNode node. + # + # @return [IndexTargetNode] a new instance of IndexTargetNode + # # source://prism//lib/prism/node.rb#9724 + sig do + params( + source: Prism::Source, + node_id: Integer, + location: Prism::Location, + flags: Integer, + receiver: Prism::Node, + opening_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: Prism::Location, + block: T.nilable(Prism::BlockArgumentNode) + ).void + end + def initialize(source, node_id, location, flags, receiver, opening_loc, arguments, closing_loc, block); end + + # Implements case-equality for the node. This is effectively == but without + # comparing the value of locations. Locations are checked only for presence. + # + # source://prism//lib/prism/node.rb#9855 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#9737 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#9810 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + + # def attribute_write?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9784 + sig { returns(T::Boolean) } + def attribute_write?; end + + # attr_reader block: BlockArgumentNode? + # + # source://prism//lib/prism/node.rb#9826 sig { returns(T.nilable(Prism::BlockArgumentNode)) } def block; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9640 + # source://prism//lib/prism/node.rb#9742 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9732 + # source://prism//lib/prism/node.rb#9834 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9711 + # source://prism//lib/prism/node.rb#9813 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9654 + # source://prism//lib/prism/node.rb#9756 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9645 + # source://prism//lib/prism/node.rb#9747 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?receiver: Prism::node, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: BlockArgumentNode?) -> IndexTargetNode # - # source://prism//lib/prism/node.rb#9659 + # source://prism//lib/prism/node.rb#9761 sig do params( node_id: Integer, @@ -19137,16 +19112,16 @@ class Prism::IndexTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), receiver: T.unsafe(nil), opening_loc: T.unsafe(nil), arguments: T.unsafe(nil), closing_loc: T.unsafe(nil), block: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9664 + # source://prism//lib/prism/node.rb#9766 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, receiver: Prism::node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: BlockArgumentNode? } # - # source://prism//lib/prism/node.rb#9667 + # source://prism//lib/prism/node.rb#9769 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -19157,31 +19132,31 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9687 + # source://prism//lib/prism/node.rb#9789 sig { returns(T::Boolean) } def ignore_visibility?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#9737 + # source://prism//lib/prism/node.rb#9839 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9727 + # source://prism//lib/prism/node.rb#9829 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9695 + # source://prism//lib/prism/node.rb#9797 sig { returns(Prism::Location) } def opening_loc; end # attr_reader receiver: Prism::node # - # source://prism//lib/prism/node.rb#9692 + # source://prism//lib/prism/node.rb#9794 sig { returns(Prism::Node) } def receiver; end @@ -19189,25 +19164,25 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9672 + # source://prism//lib/prism/node.rb#9774 sig { returns(T::Boolean) } def safe_navigation?; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9719 + # source://prism//lib/prism/node.rb#9821 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9703 + # source://prism//lib/prism/node.rb#9805 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#9742 + # source://prism//lib/prism/node.rb#9844 sig { override.returns(Symbol) } def type; end @@ -19215,14 +19190,14 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9677 + # source://prism//lib/prism/node.rb#9779 sig { returns(T::Boolean) } def variable_call?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#9747 + # source://prism//lib/prism/node.rb#9849 def type; end end end @@ -19230,11 +19205,11 @@ end # InlineComment objects are the most common. They correspond to comments in # the source file like this one that start with #. # -# source://prism//lib/prism/parse_result.rb#546 +# source://prism//lib/prism/parse_result.rb#547 class Prism::InlineComment < ::Prism::Comment # Returns a string representation of this comment. # - # source://prism//lib/prism/parse_result.rb#554 + # source://prism//lib/prism/parse_result.rb#555 sig { returns(String) } def inspect; end @@ -19243,7 +19218,7 @@ class Prism::InlineComment < ::Prism::Comment # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#549 + # source://prism//lib/prism/parse_result.rb#550 sig { override.returns(T::Boolean) } def trailing?; end end @@ -19251,804 +19226,804 @@ end # This visitor is responsible for composing the strings that get returned by # the various #inspect methods defined on each of the nodes. # -# source://prism//lib/prism/inspect_visitor.rb#12 +# source://prism//lib/prism/inspect_visitor.rb#15 class Prism::InspectVisitor < ::Prism::Visitor # Initializes a new instance of the InspectVisitor. # # @return [InspectVisitor] a new instance of InspectVisitor # - # source://prism//lib/prism/inspect_visitor.rb#35 + # source://prism//lib/prism/inspect_visitor.rb#38 sig { params(indent: String).void } def initialize(indent = T.unsafe(nil)); end # The list of commands that we need to execute in order to compose the # final string. # - # source://prism//lib/prism/inspect_visitor.rb#32 + # source://prism//lib/prism/inspect_visitor.rb#35 def commands; end # Compose the final string. # - # source://prism//lib/prism/inspect_visitor.rb#48 + # source://prism//lib/prism/inspect_visitor.rb#51 sig { returns(String) } def compose; end # The current prefix string. # - # source://prism//lib/prism/inspect_visitor.rb#28 + # source://prism//lib/prism/inspect_visitor.rb#31 def indent; end # Inspect a AliasGlobalVariableNode node. # - # source://prism//lib/prism/inspect_visitor.rb#77 + # source://prism//lib/prism/inspect_visitor.rb#80 def visit_alias_global_variable_node(node); end # Inspect a AliasMethodNode node. # - # source://prism//lib/prism/inspect_visitor.rb#89 + # source://prism//lib/prism/inspect_visitor.rb#92 def visit_alias_method_node(node); end # Inspect a AlternationPatternNode node. # - # source://prism//lib/prism/inspect_visitor.rb#101 + # source://prism//lib/prism/inspect_visitor.rb#104 def visit_alternation_pattern_node(node); end # Inspect a AndNode node. # - # source://prism//lib/prism/inspect_visitor.rb#113 + # source://prism//lib/prism/inspect_visitor.rb#116 def visit_and_node(node); end # Inspect a ArgumentsNode node. # - # source://prism//lib/prism/inspect_visitor.rb#125 + # source://prism//lib/prism/inspect_visitor.rb#128 def visit_arguments_node(node); end # Inspect a ArrayNode node. # - # source://prism//lib/prism/inspect_visitor.rb#141 + # source://prism//lib/prism/inspect_visitor.rb#144 def visit_array_node(node); end # Inspect a ArrayPatternNode node. # - # source://prism//lib/prism/inspect_visitor.rb#159 + # source://prism//lib/prism/inspect_visitor.rb#162 def visit_array_pattern_node(node); end # Inspect a AssocNode node. # - # source://prism//lib/prism/inspect_visitor.rb#198 + # source://prism//lib/prism/inspect_visitor.rb#201 def visit_assoc_node(node); end # Inspect a AssocSplatNode node. # - # source://prism//lib/prism/inspect_visitor.rb#210 + # source://prism//lib/prism/inspect_visitor.rb#213 def visit_assoc_splat_node(node); end # Inspect a BackReferenceReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#224 + # source://prism//lib/prism/inspect_visitor.rb#227 def visit_back_reference_read_node(node); end # Inspect a BeginNode node. # - # source://prism//lib/prism/inspect_visitor.rb#232 + # source://prism//lib/prism/inspect_visitor.rb#235 def visit_begin_node(node); end # Inspect a BlockArgumentNode node. # - # source://prism//lib/prism/inspect_visitor.rb#265 + # source://prism//lib/prism/inspect_visitor.rb#268 def visit_block_argument_node(node); end # Inspect a BlockLocalVariableNode node. # - # source://prism//lib/prism/inspect_visitor.rb#279 + # source://prism//lib/prism/inspect_visitor.rb#282 def visit_block_local_variable_node(node); end # Inspect a BlockNode node. # - # source://prism//lib/prism/inspect_visitor.rb#287 + # source://prism//lib/prism/inspect_visitor.rb#290 def visit_block_node(node); end # Inspect a BlockParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#309 + # source://prism//lib/prism/inspect_visitor.rb#312 def visit_block_parameter_node(node); end # Inspect a BlockParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#323 + # source://prism//lib/prism/inspect_visitor.rb#326 def visit_block_parameters_node(node); end # Inspect a BreakNode node. # - # source://prism//lib/prism/inspect_visitor.rb#347 + # source://prism//lib/prism/inspect_visitor.rb#350 def visit_break_node(node); end # Inspect a CallAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#361 + # source://prism//lib/prism/inspect_visitor.rb#364 def visit_call_and_write_node(node); end # Inspect a CallNode node. # - # source://prism//lib/prism/inspect_visitor.rb#381 + # source://prism//lib/prism/inspect_visitor.rb#384 def visit_call_node(node); end # Inspect a CallOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#411 + # source://prism//lib/prism/inspect_visitor.rb#414 def visit_call_operator_write_node(node); end # Inspect a CallOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#432 + # source://prism//lib/prism/inspect_visitor.rb#435 def visit_call_or_write_node(node); end # Inspect a CallTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#452 + # source://prism//lib/prism/inspect_visitor.rb#455 def visit_call_target_node(node); end # Inspect a CapturePatternNode node. # - # source://prism//lib/prism/inspect_visitor.rb#464 + # source://prism//lib/prism/inspect_visitor.rb#467 def visit_capture_pattern_node(node); end # Inspect a CaseMatchNode node. # - # source://prism//lib/prism/inspect_visitor.rb#476 + # source://prism//lib/prism/inspect_visitor.rb#479 def visit_case_match_node(node); end # Inspect a CaseNode node. # - # source://prism//lib/prism/inspect_visitor.rb#506 + # source://prism//lib/prism/inspect_visitor.rb#509 def visit_case_node(node); end # Inspect a ClassNode node. # - # source://prism//lib/prism/inspect_visitor.rb#536 + # source://prism//lib/prism/inspect_visitor.rb#539 def visit_class_node(node); end # Inspect a ClassVariableAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#562 + # source://prism//lib/prism/inspect_visitor.rb#565 def visit_class_variable_and_write_node(node); end # Inspect a ClassVariableOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#574 + # source://prism//lib/prism/inspect_visitor.rb#577 def visit_class_variable_operator_write_node(node); end # Inspect a ClassVariableOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#587 + # source://prism//lib/prism/inspect_visitor.rb#590 def visit_class_variable_or_write_node(node); end # Inspect a ClassVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#599 + # source://prism//lib/prism/inspect_visitor.rb#602 def visit_class_variable_read_node(node); end # Inspect a ClassVariableTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#607 + # source://prism//lib/prism/inspect_visitor.rb#610 def visit_class_variable_target_node(node); end # Inspect a ClassVariableWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#615 + # source://prism//lib/prism/inspect_visitor.rb#618 def visit_class_variable_write_node(node); end # Inspect a ConstantAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#627 + # source://prism//lib/prism/inspect_visitor.rb#630 def visit_constant_and_write_node(node); end # Inspect a ConstantOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#639 + # source://prism//lib/prism/inspect_visitor.rb#642 def visit_constant_operator_write_node(node); end # Inspect a ConstantOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#652 + # source://prism//lib/prism/inspect_visitor.rb#655 def visit_constant_or_write_node(node); end # Inspect a ConstantPathAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#664 + # source://prism//lib/prism/inspect_visitor.rb#667 def visit_constant_path_and_write_node(node); end # Inspect a ConstantPathNode node. # - # source://prism//lib/prism/inspect_visitor.rb#676 + # source://prism//lib/prism/inspect_visitor.rb#679 def visit_constant_path_node(node); end # Inspect a ConstantPathOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#696 + # source://prism//lib/prism/inspect_visitor.rb#699 def visit_constant_path_operator_write_node(node); end # Inspect a ConstantPathOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#709 + # source://prism//lib/prism/inspect_visitor.rb#712 def visit_constant_path_or_write_node(node); end # Inspect a ConstantPathTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#721 + # source://prism//lib/prism/inspect_visitor.rb#724 def visit_constant_path_target_node(node); end # Inspect a ConstantPathWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#741 + # source://prism//lib/prism/inspect_visitor.rb#744 def visit_constant_path_write_node(node); end # Inspect a ConstantReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#753 + # source://prism//lib/prism/inspect_visitor.rb#756 def visit_constant_read_node(node); end # Inspect a ConstantTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#761 + # source://prism//lib/prism/inspect_visitor.rb#764 def visit_constant_target_node(node); end # Inspect a ConstantWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#769 + # source://prism//lib/prism/inspect_visitor.rb#772 def visit_constant_write_node(node); end # Inspect a DefNode node. # - # source://prism//lib/prism/inspect_visitor.rb#781 + # source://prism//lib/prism/inspect_visitor.rb#784 def visit_def_node(node); end # Inspect a DefinedNode node. # - # source://prism//lib/prism/inspect_visitor.rb#815 + # source://prism//lib/prism/inspect_visitor.rb#818 def visit_defined_node(node); end # Inspect a ElseNode node. # - # source://prism//lib/prism/inspect_visitor.rb#827 + # source://prism//lib/prism/inspect_visitor.rb#830 def visit_else_node(node); end # Inspect a EmbeddedStatementsNode node. # - # source://prism//lib/prism/inspect_visitor.rb#842 + # source://prism//lib/prism/inspect_visitor.rb#845 def visit_embedded_statements_node(node); end # Inspect a EmbeddedVariableNode node. # - # source://prism//lib/prism/inspect_visitor.rb#857 + # source://prism//lib/prism/inspect_visitor.rb#860 def visit_embedded_variable_node(node); end # Inspect a EnsureNode node. # - # source://prism//lib/prism/inspect_visitor.rb#867 + # source://prism//lib/prism/inspect_visitor.rb#870 def visit_ensure_node(node); end # Inspect a FalseNode node. # - # source://prism//lib/prism/inspect_visitor.rb#882 + # source://prism//lib/prism/inspect_visitor.rb#885 def visit_false_node(node); end # Inspect a FindPatternNode node. # - # source://prism//lib/prism/inspect_visitor.rb#889 + # source://prism//lib/prism/inspect_visitor.rb#892 def visit_find_pattern_node(node); end # Inspect a FlipFlopNode node. # - # source://prism//lib/prism/inspect_visitor.rb#917 + # source://prism//lib/prism/inspect_visitor.rb#920 def visit_flip_flop_node(node); end # Inspect a FloatNode node. # - # source://prism//lib/prism/inspect_visitor.rb#937 + # source://prism//lib/prism/inspect_visitor.rb#940 def visit_float_node(node); end # Inspect a ForNode node. # - # source://prism//lib/prism/inspect_visitor.rb#945 + # source://prism//lib/prism/inspect_visitor.rb#948 def visit_for_node(node); end # Inspect a ForwardingArgumentsNode node. # - # source://prism//lib/prism/inspect_visitor.rb#966 + # source://prism//lib/prism/inspect_visitor.rb#969 def visit_forwarding_arguments_node(node); end # Inspect a ForwardingParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#973 + # source://prism//lib/prism/inspect_visitor.rb#976 def visit_forwarding_parameter_node(node); end # Inspect a ForwardingSuperNode node. # - # source://prism//lib/prism/inspect_visitor.rb#980 + # source://prism//lib/prism/inspect_visitor.rb#983 def visit_forwarding_super_node(node); end # Inspect a GlobalVariableAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#993 + # source://prism//lib/prism/inspect_visitor.rb#996 def visit_global_variable_and_write_node(node); end # Inspect a GlobalVariableOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1005 + # source://prism//lib/prism/inspect_visitor.rb#1008 def visit_global_variable_operator_write_node(node); end # Inspect a GlobalVariableOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1018 + # source://prism//lib/prism/inspect_visitor.rb#1021 def visit_global_variable_or_write_node(node); end # Inspect a GlobalVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1030 + # source://prism//lib/prism/inspect_visitor.rb#1033 def visit_global_variable_read_node(node); end # Inspect a GlobalVariableTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1038 + # source://prism//lib/prism/inspect_visitor.rb#1041 def visit_global_variable_target_node(node); end # Inspect a GlobalVariableWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1046 + # source://prism//lib/prism/inspect_visitor.rb#1049 def visit_global_variable_write_node(node); end # Inspect a HashNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1058 + # source://prism//lib/prism/inspect_visitor.rb#1061 def visit_hash_node(node); end # Inspect a HashPatternNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1076 + # source://prism//lib/prism/inspect_visitor.rb#1079 def visit_hash_pattern_node(node); end # Inspect a IfNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1106 + # source://prism//lib/prism/inspect_visitor.rb#1109 def visit_if_node(node); end # Inspect a ImaginaryNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1130 + # source://prism//lib/prism/inspect_visitor.rb#1133 def visit_imaginary_node(node); end # Inspect a ImplicitNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1139 + # source://prism//lib/prism/inspect_visitor.rb#1142 def visit_implicit_node(node); end # Inspect a ImplicitRestNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1148 + # source://prism//lib/prism/inspect_visitor.rb#1151 def visit_implicit_rest_node(node); end # Inspect a InNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1155 + # source://prism//lib/prism/inspect_visitor.rb#1158 def visit_in_node(node); end # Inspect a IndexAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1172 + # source://prism//lib/prism/inspect_visitor.rb#1175 def visit_index_and_write_node(node); end # Inspect a IndexOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1203 + # source://prism//lib/prism/inspect_visitor.rb#1206 def visit_index_operator_write_node(node); end # Inspect a IndexOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1235 + # source://prism//lib/prism/inspect_visitor.rb#1238 def visit_index_or_write_node(node); end # Inspect a IndexTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1266 + # source://prism//lib/prism/inspect_visitor.rb#1269 def visit_index_target_node(node); end # Inspect a InstanceVariableAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1289 + # source://prism//lib/prism/inspect_visitor.rb#1292 def visit_instance_variable_and_write_node(node); end # Inspect a InstanceVariableOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1301 + # source://prism//lib/prism/inspect_visitor.rb#1304 def visit_instance_variable_operator_write_node(node); end # Inspect a InstanceVariableOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1314 + # source://prism//lib/prism/inspect_visitor.rb#1317 def visit_instance_variable_or_write_node(node); end # Inspect a InstanceVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1326 + # source://prism//lib/prism/inspect_visitor.rb#1329 def visit_instance_variable_read_node(node); end # Inspect a InstanceVariableTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1334 + # source://prism//lib/prism/inspect_visitor.rb#1337 def visit_instance_variable_target_node(node); end # Inspect a InstanceVariableWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1342 + # source://prism//lib/prism/inspect_visitor.rb#1345 def visit_instance_variable_write_node(node); end # Inspect a IntegerNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1354 + # source://prism//lib/prism/inspect_visitor.rb#1357 def visit_integer_node(node); end # Inspect a InterpolatedMatchLastLineNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1362 + # source://prism//lib/prism/inspect_visitor.rb#1365 def visit_interpolated_match_last_line_node(node); end # Inspect a InterpolatedRegularExpressionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1380 + # source://prism//lib/prism/inspect_visitor.rb#1383 def visit_interpolated_regular_expression_node(node); end # Inspect a InterpolatedStringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1398 + # source://prism//lib/prism/inspect_visitor.rb#1401 def visit_interpolated_string_node(node); end # Inspect a InterpolatedSymbolNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1416 + # source://prism//lib/prism/inspect_visitor.rb#1419 def visit_interpolated_symbol_node(node); end # Inspect a InterpolatedXStringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1434 + # source://prism//lib/prism/inspect_visitor.rb#1437 def visit_interpolated_x_string_node(node); end # Inspect a ItLocalVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1452 + # source://prism//lib/prism/inspect_visitor.rb#1455 def visit_it_local_variable_read_node(node); end # Inspect a ItParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1459 + # source://prism//lib/prism/inspect_visitor.rb#1462 def visit_it_parameters_node(node); end # Inspect a KeywordHashNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1466 + # source://prism//lib/prism/inspect_visitor.rb#1469 def visit_keyword_hash_node(node); end # Inspect a KeywordRestParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1482 + # source://prism//lib/prism/inspect_visitor.rb#1485 def visit_keyword_rest_parameter_node(node); end # Inspect a LambdaNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1496 + # source://prism//lib/prism/inspect_visitor.rb#1499 def visit_lambda_node(node); end # Inspect a LocalVariableAndWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1519 + # source://prism//lib/prism/inspect_visitor.rb#1522 def visit_local_variable_and_write_node(node); end # Inspect a LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1532 + # source://prism//lib/prism/inspect_visitor.rb#1535 def visit_local_variable_operator_write_node(node); end # Inspect a LocalVariableOrWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1546 + # source://prism//lib/prism/inspect_visitor.rb#1549 def visit_local_variable_or_write_node(node); end # Inspect a LocalVariableReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1559 + # source://prism//lib/prism/inspect_visitor.rb#1562 def visit_local_variable_read_node(node); end # Inspect a LocalVariableTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1568 + # source://prism//lib/prism/inspect_visitor.rb#1571 def visit_local_variable_target_node(node); end # Inspect a LocalVariableWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1577 + # source://prism//lib/prism/inspect_visitor.rb#1580 def visit_local_variable_write_node(node); end # Inspect a MatchLastLineNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1590 + # source://prism//lib/prism/inspect_visitor.rb#1593 def visit_match_last_line_node(node); end # Inspect a MatchPredicateNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1601 + # source://prism//lib/prism/inspect_visitor.rb#1604 def visit_match_predicate_node(node); end # Inspect a MatchRequiredNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1613 + # source://prism//lib/prism/inspect_visitor.rb#1616 def visit_match_required_node(node); end # Inspect a MatchWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1625 + # source://prism//lib/prism/inspect_visitor.rb#1628 def visit_match_write_node(node); end # Inspect a MissingNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1643 + # source://prism//lib/prism/inspect_visitor.rb#1646 def visit_missing_node(node); end # Inspect a ModuleNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1650 + # source://prism//lib/prism/inspect_visitor.rb#1653 def visit_module_node(node); end # Inspect a MultiTargetNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1669 + # source://prism//lib/prism/inspect_visitor.rb#1672 def visit_multi_target_node(node); end # Inspect a MultiWriteNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1702 + # source://prism//lib/prism/inspect_visitor.rb#1705 def visit_multi_write_node(node); end # Inspect a NextNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1738 + # source://prism//lib/prism/inspect_visitor.rb#1741 def visit_next_node(node); end # Inspect a NilNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1752 + # source://prism//lib/prism/inspect_visitor.rb#1755 def visit_nil_node(node); end # Inspect a NoKeywordsParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1759 + # source://prism//lib/prism/inspect_visitor.rb#1762 def visit_no_keywords_parameter_node(node); end # Inspect a NumberedParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1768 + # source://prism//lib/prism/inspect_visitor.rb#1771 def visit_numbered_parameters_node(node); end # Inspect a NumberedReferenceReadNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1776 + # source://prism//lib/prism/inspect_visitor.rb#1779 def visit_numbered_reference_read_node(node); end # Inspect a OptionalKeywordParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1784 + # source://prism//lib/prism/inspect_visitor.rb#1787 def visit_optional_keyword_parameter_node(node); end # Inspect a OptionalParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1795 + # source://prism//lib/prism/inspect_visitor.rb#1798 def visit_optional_parameter_node(node); end # Inspect a OrNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1807 + # source://prism//lib/prism/inspect_visitor.rb#1810 def visit_or_node(node); end # Inspect a ParametersNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1819 + # source://prism//lib/prism/inspect_visitor.rb#1822 def visit_parameters_node(node); end # Inspect a ParenthesesNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1880 + # source://prism//lib/prism/inspect_visitor.rb#1883 def visit_parentheses_node(node); end # Inspect a PinnedExpressionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1895 + # source://prism//lib/prism/inspect_visitor.rb#1898 def visit_pinned_expression_node(node); end # Inspect a PinnedVariableNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1907 + # source://prism//lib/prism/inspect_visitor.rb#1910 def visit_pinned_variable_node(node); end # Inspect a PostExecutionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1917 + # source://prism//lib/prism/inspect_visitor.rb#1920 def visit_post_execution_node(node); end # Inspect a PreExecutionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1933 + # source://prism//lib/prism/inspect_visitor.rb#1936 def visit_pre_execution_node(node); end # Inspect a ProgramNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1949 + # source://prism//lib/prism/inspect_visitor.rb#1952 def visit_program_node(node); end # Inspect a RangeNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1959 + # source://prism//lib/prism/inspect_visitor.rb#1962 def visit_range_node(node); end # Inspect a RationalNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1979 + # source://prism//lib/prism/inspect_visitor.rb#1982 def visit_rational_node(node); end # Inspect a RedoNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1988 + # source://prism//lib/prism/inspect_visitor.rb#1991 def visit_redo_node(node); end # Inspect a RegularExpressionNode node. # - # source://prism//lib/prism/inspect_visitor.rb#1995 + # source://prism//lib/prism/inspect_visitor.rb#1998 def visit_regular_expression_node(node); end # Inspect a RequiredKeywordParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2006 + # source://prism//lib/prism/inspect_visitor.rb#2009 def visit_required_keyword_parameter_node(node); end # Inspect a RequiredParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2015 + # source://prism//lib/prism/inspect_visitor.rb#2018 def visit_required_parameter_node(node); end # Inspect a RescueModifierNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2023 + # source://prism//lib/prism/inspect_visitor.rb#2026 def visit_rescue_modifier_node(node); end # Inspect a RescueNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2035 + # source://prism//lib/prism/inspect_visitor.rb#2038 def visit_rescue_node(node); end # Inspect a RestParameterNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2072 + # source://prism//lib/prism/inspect_visitor.rb#2075 def visit_rest_parameter_node(node); end # Inspect a RetryNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2086 + # source://prism//lib/prism/inspect_visitor.rb#2089 def visit_retry_node(node); end # Inspect a ReturnNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2093 + # source://prism//lib/prism/inspect_visitor.rb#2096 def visit_return_node(node); end # Inspect a SelfNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2107 + # source://prism//lib/prism/inspect_visitor.rb#2110 def visit_self_node(node); end # Inspect a ShareableConstantNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2114 + # source://prism//lib/prism/inspect_visitor.rb#2117 def visit_shareable_constant_node(node); end # Inspect a SingletonClassNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2123 + # source://prism//lib/prism/inspect_visitor.rb#2126 def visit_singleton_class_node(node); end # Inspect a SourceEncodingNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2142 + # source://prism//lib/prism/inspect_visitor.rb#2145 def visit_source_encoding_node(node); end # Inspect a SourceFileNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2149 + # source://prism//lib/prism/inspect_visitor.rb#2152 def visit_source_file_node(node); end # Inspect a SourceLineNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2157 + # source://prism//lib/prism/inspect_visitor.rb#2160 def visit_source_line_node(node); end # Inspect a SplatNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2164 + # source://prism//lib/prism/inspect_visitor.rb#2167 def visit_splat_node(node); end # Inspect a StatementsNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2178 + # source://prism//lib/prism/inspect_visitor.rb#2181 def visit_statements_node(node); end # Inspect a StringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2194 + # source://prism//lib/prism/inspect_visitor.rb#2197 def visit_string_node(node); end # Inspect a SuperNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2205 + # source://prism//lib/prism/inspect_visitor.rb#2208 def visit_super_node(node); end # Inspect a SymbolNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2227 + # source://prism//lib/prism/inspect_visitor.rb#2230 def visit_symbol_node(node); end # Inspect a TrueNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2238 + # source://prism//lib/prism/inspect_visitor.rb#2241 def visit_true_node(node); end # Inspect a UndefNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2245 + # source://prism//lib/prism/inspect_visitor.rb#2248 def visit_undef_node(node); end # Inspect a UnlessNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2262 + # source://prism//lib/prism/inspect_visitor.rb#2265 def visit_unless_node(node); end # Inspect a UntilNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2286 + # source://prism//lib/prism/inspect_visitor.rb#2289 def visit_until_node(node); end # Inspect a WhenNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2304 + # source://prism//lib/prism/inspect_visitor.rb#2307 def visit_when_node(node); end # Inspect a WhileNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2328 + # source://prism//lib/prism/inspect_visitor.rb#2331 def visit_while_node(node); end # Inspect a XStringNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2346 + # source://prism//lib/prism/inspect_visitor.rb#2349 def visit_x_string_node(node); end # Inspect a YieldNode node. # - # source://prism//lib/prism/inspect_visitor.rb#2357 + # source://prism//lib/prism/inspect_visitor.rb#2360 def visit_yield_node(node); end private # Compose a string representing the given inner location field. # - # source://prism//lib/prism/inspect_visitor.rb#2381 + # source://prism//lib/prism/inspect_visitor.rb#2384 def inspect_location(location); end # Compose a header for the given node. # - # source://prism//lib/prism/inspect_visitor.rb#2375 + # source://prism//lib/prism/inspect_visitor.rb#2378 def inspect_node(name, node); end class << self # Compose an inspect string for the given node. # - # source://prism//lib/prism/inspect_visitor.rb#41 + # source://prism//lib/prism/inspect_visitor.rb#44 sig { params(node: Prism::Node).returns(String) } def compose(node); end end @@ -20059,14 +20034,14 @@ end # when we hit an element in that list. In this case, we have a special # command that replaces the subsequent indent with the given value. # -# source://prism//lib/prism/inspect_visitor.rb#17 +# source://prism//lib/prism/inspect_visitor.rb#20 class Prism::InspectVisitor::Replace # @return [Replace] a new instance of Replace # - # source://prism//lib/prism/inspect_visitor.rb#20 + # source://prism//lib/prism/inspect_visitor.rb#23 def initialize(value); end - # source://prism//lib/prism/inspect_visitor.rb#18 + # source://prism//lib/prism/inspect_visitor.rb#21 def value; end end @@ -20075,13 +20050,13 @@ end # @target &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9768 +# source://prism//lib/prism/node.rb#9870 class Prism::InstanceVariableAndWriteNode < ::Prism::Node # Initialize a new InstanceVariableAndWriteNode node. # # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode # - # source://prism//lib/prism/node.rb#9770 + # source://prism//lib/prism/node.rb#9872 sig do params( source: Prism::Source, @@ -20099,36 +20074,36 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9868 + # source://prism//lib/prism/node.rb#9970 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9782 + # source://prism//lib/prism/node.rb#9884 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9787 + # source://prism//lib/prism/node.rb#9889 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9797 + # source://prism//lib/prism/node.rb#9899 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9792 + # source://prism//lib/prism/node.rb#9894 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableAndWriteNode # - # source://prism//lib/prism/node.rb#9802 + # source://prism//lib/prism/node.rb#9904 sig do params( node_id: Integer, @@ -20142,20 +20117,20 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9807 + # source://prism//lib/prism/node.rb#9909 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#9810 + # source://prism//lib/prism/node.rb#9912 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#218 + # source://prism//lib/prism/desugar_compiler.rb#219 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -20163,62 +20138,62 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#9852 + # source://prism//lib/prism/node.rb#9954 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#9815 + # source://prism//lib/prism/node.rb#9917 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#9818 + # source://prism//lib/prism/node.rb#9920 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9847 + # source://prism//lib/prism/node.rb#9949 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9831 + # source://prism//lib/prism/node.rb#9933 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9826 + # source://prism//lib/prism/node.rb#9928 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9839 + # source://prism//lib/prism/node.rb#9941 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#9857 + # source://prism//lib/prism/node.rb#9959 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9844 + # source://prism//lib/prism/node.rb#9946 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#9862 + # source://prism//lib/prism/node.rb#9964 def type; end end end @@ -20228,13 +20203,13 @@ end # @target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9881 +# source://prism//lib/prism/node.rb#9983 class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # Initialize a new InstanceVariableOperatorWriteNode node. # # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#9883 + # source://prism//lib/prism/node.rb#9985 sig do params( source: Prism::Source, @@ -20253,48 +20228,48 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#9980 + # source://prism//lib/prism/node.rb#10082 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9896 + # source://prism//lib/prism/node.rb#9998 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#9961 + # source://prism//lib/prism/node.rb#10063 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#9945 + # source://prism//lib/prism/node.rb#10047 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9901 + # source://prism//lib/prism/node.rb#10003 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9911 + # source://prism//lib/prism/node.rb#10013 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#9906 + # source://prism//lib/prism/node.rb#10008 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol) -> InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#9916 + # source://prism//lib/prism/node.rb#10018 sig do params( node_id: Integer, @@ -20309,20 +20284,20 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#9921 + # source://prism//lib/prism/node.rb#10023 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol } # - # source://prism//lib/prism/node.rb#9924 + # source://prism//lib/prism/node.rb#10026 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#230 + # source://prism//lib/prism/desugar_compiler.rb#231 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -20330,62 +20305,62 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#9964 + # source://prism//lib/prism/node.rb#10066 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#9929 + # source://prism//lib/prism/node.rb#10031 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#9932 + # source://prism//lib/prism/node.rb#10034 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#435 + # source://prism//lib/prism/node_ext.rb#438 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#442 + # source://prism//lib/prism/node_ext.rb#445 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9953 + # source://prism//lib/prism/node.rb#10055 def save_binary_operator_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#9940 + # source://prism//lib/prism/node.rb#10042 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#9969 + # source://prism//lib/prism/node.rb#10071 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9958 + # source://prism//lib/prism/node.rb#10060 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#9974 + # source://prism//lib/prism/node.rb#10076 def type; end end end @@ -20395,13 +20370,13 @@ end # @target ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9994 +# source://prism//lib/prism/node.rb#10096 class Prism::InstanceVariableOrWriteNode < ::Prism::Node # Initialize a new InstanceVariableOrWriteNode node. # # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#9996 + # source://prism//lib/prism/node.rb#10098 sig do params( source: Prism::Source, @@ -20419,36 +20394,36 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10094 + # source://prism//lib/prism/node.rb#10196 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10008 + # source://prism//lib/prism/node.rb#10110 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10013 + # source://prism//lib/prism/node.rb#10115 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10023 + # source://prism//lib/prism/node.rb#10125 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10018 + # source://prism//lib/prism/node.rb#10120 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#10028 + # source://prism//lib/prism/node.rb#10130 sig do params( node_id: Integer, @@ -20462,20 +20437,20 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10033 + # source://prism//lib/prism/node.rb#10135 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#10036 + # source://prism//lib/prism/node.rb#10138 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # source://prism//lib/prism/desugar_compiler.rb#224 + # source://prism//lib/prism/desugar_compiler.rb#225 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -20483,62 +20458,62 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10078 + # source://prism//lib/prism/node.rb#10180 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#10041 + # source://prism//lib/prism/node.rb#10143 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#10044 + # source://prism//lib/prism/node.rb#10146 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#10073 + # source://prism//lib/prism/node.rb#10175 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#10057 + # source://prism//lib/prism/node.rb#10159 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10052 + # source://prism//lib/prism/node.rb#10154 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10065 + # source://prism//lib/prism/node.rb#10167 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10083 + # source://prism//lib/prism/node.rb#10185 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#10070 + # source://prism//lib/prism/node.rb#10172 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10088 + # source://prism//lib/prism/node.rb#10190 def type; end end end @@ -20548,49 +20523,49 @@ end # @foo # ^^^^ # -# source://prism//lib/prism/node.rb#10107 +# source://prism//lib/prism/node.rb#10209 class Prism::InstanceVariableReadNode < ::Prism::Node # Initialize a new InstanceVariableReadNode node. # # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#10109 + # source://prism//lib/prism/node.rb#10211 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10174 + # source://prism//lib/prism/node.rb#10276 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10118 + # source://prism//lib/prism/node.rb#10220 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10123 + # source://prism//lib/prism/node.rb#10225 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10133 + # source://prism//lib/prism/node.rb#10235 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10128 + # source://prism//lib/prism/node.rb#10230 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#10138 + # source://prism//lib/prism/node.rb#10240 sig do params( node_id: Integer, @@ -20601,16 +20576,16 @@ class Prism::InstanceVariableReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10143 + # source://prism//lib/prism/node.rb#10245 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#10146 + # source://prism//lib/prism/node.rb#10248 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20619,7 +20594,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10158 + # source://prism//lib/prism/node.rb#10260 sig { override.returns(String) } def inspect; end @@ -20629,20 +20604,20 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # @_test # name `:@_test` # - # source://prism//lib/prism/node.rb#10155 + # source://prism//lib/prism/node.rb#10257 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10163 + # source://prism//lib/prism/node.rb#10265 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10168 + # source://prism//lib/prism/node.rb#10270 def type; end end end @@ -20652,49 +20627,49 @@ end # @foo, @bar = baz # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#10184 +# source://prism//lib/prism/node.rb#10286 class Prism::InstanceVariableTargetNode < ::Prism::Node # Initialize a new InstanceVariableTargetNode node. # # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#10186 + # source://prism//lib/prism/node.rb#10288 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10247 + # source://prism//lib/prism/node.rb#10349 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10195 + # source://prism//lib/prism/node.rb#10297 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10200 + # source://prism//lib/prism/node.rb#10302 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10210 + # source://prism//lib/prism/node.rb#10312 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10205 + # source://prism//lib/prism/node.rb#10307 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#10215 + # source://prism//lib/prism/node.rb#10317 sig do params( node_id: Integer, @@ -20705,16 +20680,16 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10220 + # source://prism//lib/prism/node.rb#10322 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#10223 + # source://prism//lib/prism/node.rb#10325 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20723,26 +20698,26 @@ class Prism::InstanceVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10231 + # source://prism//lib/prism/node.rb#10333 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#10228 + # source://prism//lib/prism/node.rb#10330 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10236 + # source://prism//lib/prism/node.rb#10338 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10241 + # source://prism//lib/prism/node.rb#10343 def type; end end end @@ -20752,13 +20727,13 @@ end # @foo = 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#10257 +# source://prism//lib/prism/node.rb#10359 class Prism::InstanceVariableWriteNode < ::Prism::Node # Initialize a new InstanceVariableWriteNode node. # # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#10259 + # source://prism//lib/prism/node.rb#10361 sig do params( source: Prism::Source, @@ -20776,36 +20751,36 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10373 + # source://prism//lib/prism/node.rb#10475 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10271 + # source://prism//lib/prism/node.rb#10373 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10276 + # source://prism//lib/prism/node.rb#10378 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10286 + # source://prism//lib/prism/node.rb#10388 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10281 + # source://prism//lib/prism/node.rb#10383 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#10291 + # source://prism//lib/prism/node.rb#10393 sig do params( node_id: Integer, @@ -20819,16 +20794,16 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10296 + # source://prism//lib/prism/node.rb#10398 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#10299 + # source://prism//lib/prism/node.rb#10401 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -20837,7 +20812,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10357 + # source://prism//lib/prism/node.rb#10459 sig { override.returns(String) } def inspect; end @@ -20847,7 +20822,7 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # @_foo = "bar" # name `@_foo` # - # source://prism//lib/prism/node.rb#10308 + # source://prism//lib/prism/node.rb#10410 sig { returns(Symbol) } def name; end @@ -20856,13 +20831,13 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @_x = 1 # ^^^ # - # source://prism//lib/prism/node.rb#10314 + # source://prism//lib/prism/node.rb#10416 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#10352 + # source://prism//lib/prism/node.rb#10454 sig { returns(String) } def operator; end @@ -20871,25 +20846,25 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @x = y # ^ # - # source://prism//lib/prism/node.rb#10339 + # source://prism//lib/prism/node.rb#10441 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10322 + # source://prism//lib/prism/node.rb#10424 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10347 + # source://prism//lib/prism/node.rb#10449 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10362 + # source://prism//lib/prism/node.rb#10464 sig { override.returns(Symbol) } def type; end @@ -20901,41 +20876,41 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # @_x = 1234 # ^^^^ # - # source://prism//lib/prism/node.rb#10333 + # source://prism//lib/prism/node.rb#10435 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10367 + # source://prism//lib/prism/node.rb#10469 def type; end end end # Flags for integer nodes that correspond to the base of the integer. # -# source://prism//lib/prism/node.rb#18507 +# source://prism//lib/prism/node.rb#18678 module Prism::IntegerBaseFlags; end # 0b prefix # -# source://prism//lib/prism/node.rb#18509 +# source://prism//lib/prism/node.rb#18680 Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) # 0d or no prefix # -# source://prism//lib/prism/node.rb#18512 +# source://prism//lib/prism/node.rb#18683 Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) # 0x prefix # -# source://prism//lib/prism/node.rb#18518 +# source://prism//lib/prism/node.rb#18689 Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) # 0o or 0 prefix # -# source://prism//lib/prism/node.rb#18515 +# source://prism//lib/prism/node.rb#18686 Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) # Represents an integer number literal. @@ -20943,13 +20918,13 @@ Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) # 1 # ^ # -# source://prism//lib/prism/node.rb#10386 +# source://prism//lib/prism/node.rb#10488 class Prism::IntegerNode < ::Prism::Node # Initialize a new IntegerNode node. # # @return [IntegerNode] a new instance of IntegerNode # - # source://prism//lib/prism/node.rb#10388 + # source://prism//lib/prism/node.rb#10490 sig do params( source: Prism::Source, @@ -20964,12 +20939,12 @@ class Prism::IntegerNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10469 + # source://prism//lib/prism/node.rb#10571 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10397 + # source://prism//lib/prism/node.rb#10499 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -20977,31 +20952,31 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10430 + # source://prism//lib/prism/node.rb#10532 sig { returns(T::Boolean) } def binary?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10402 + # source://prism//lib/prism/node.rb#10504 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10412 + # source://prism//lib/prism/node.rb#10514 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10407 + # source://prism//lib/prism/node.rb#10509 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Integer) -> IntegerNode # - # source://prism//lib/prism/node.rb#10417 + # source://prism//lib/prism/node.rb#10519 sig do params( node_id: Integer, @@ -21016,20 +20991,20 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10435 + # source://prism//lib/prism/node.rb#10537 sig { returns(T::Boolean) } def decimal?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10422 + # source://prism//lib/prism/node.rb#10524 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Integer } # - # source://prism//lib/prism/node.rb#10425 + # source://prism//lib/prism/node.rb#10527 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21040,13 +21015,13 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10445 + # source://prism//lib/prism/node.rb#10547 sig { returns(T::Boolean) } def hexadecimal?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#10453 + # source://prism//lib/prism/node.rb#10555 sig { override.returns(String) } def inspect; end @@ -21054,26 +21029,26 @@ class Prism::IntegerNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10440 + # source://prism//lib/prism/node.rb#10542 sig { returns(T::Boolean) } def octal?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10458 + # source://prism//lib/prism/node.rb#10560 sig { override.returns(Symbol) } def type; end # The value of the integer literal as a number. # - # source://prism//lib/prism/node.rb#10450 + # source://prism//lib/prism/node.rb#10552 sig { returns(Integer) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10463 + # source://prism//lib/prism/node.rb#10565 def type; end end end @@ -21083,7 +21058,7 @@ end # if /foo #{bar} baz/ then end # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10480 +# source://prism//lib/prism/node.rb#10582 class Prism::InterpolatedMatchLastLineNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -21091,7 +21066,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#10482 + # source://prism//lib/prism/node.rb#10584 sig do params( source: Prism::Source, @@ -21108,12 +21083,12 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10636 + # source://prism//lib/prism/node.rb#10738 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10493 + # source://prism//lib/prism/node.rb#10595 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -21121,43 +21096,43 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10551 + # source://prism//lib/prism/node.rb#10653 sig { returns(T::Boolean) } def ascii_8bit?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10498 + # source://prism//lib/prism/node.rb#10600 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#10615 + # source://prism//lib/prism/node.rb#10717 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#10597 + # source://prism//lib/prism/node.rb#10699 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10508 + # source://prism//lib/prism/node.rb#10610 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10503 + # source://prism//lib/prism/node.rb#10605 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#10513 + # source://prism//lib/prism/node.rb#10615 sig do params( node_id: Integer, @@ -21170,16 +21145,16 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10518 + # source://prism//lib/prism/node.rb#10620 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location } # - # source://prism//lib/prism/node.rb#10521 + # source://prism//lib/prism/node.rb#10623 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21187,7 +21162,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10546 + # source://prism//lib/prism/node.rb#10648 sig { returns(T::Boolean) } def euc_jp?; end @@ -21195,7 +21170,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10531 + # source://prism//lib/prism/node.rb#10633 sig { returns(T::Boolean) } def extended?; end @@ -21206,7 +21181,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10571 + # source://prism//lib/prism/node.rb#10673 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -21214,7 +21189,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10576 + # source://prism//lib/prism/node.rb#10678 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -21222,7 +21197,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10566 + # source://prism//lib/prism/node.rb#10668 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -21230,13 +21205,13 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10526 + # source://prism//lib/prism/node.rb#10628 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#10620 + # source://prism//lib/prism/node.rb#10722 sig { override.returns(String) } def inspect; end @@ -21244,30 +21219,30 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10536 + # source://prism//lib/prism/node.rb#10638 sig { returns(T::Boolean) } def multi_line?; end - # source://prism//lib/prism/parse_result/newlines.rb#121 + # source://prism//lib/prism/parse_result/newlines.rb#122 def newline_flag!(lines); end # def once?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10541 + # source://prism//lib/prism/node.rb#10643 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#10610 + # source://prism//lib/prism/node.rb#10712 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#10581 + # source://prism//lib/prism/node.rb#10683 sig { returns(Prism::Location) } def opening_loc; end @@ -21276,25 +21251,25 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#10594 + # source://prism//lib/prism/node.rb#10696 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10605 + # source://prism//lib/prism/node.rb#10707 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10589 + # source://prism//lib/prism/node.rb#10691 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10625 + # source://prism//lib/prism/node.rb#10727 sig { override.returns(Symbol) } def type; end @@ -21302,7 +21277,7 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10561 + # source://prism//lib/prism/node.rb#10663 sig { returns(T::Boolean) } def utf_8?; end @@ -21310,14 +21285,14 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10556 + # source://prism//lib/prism/node.rb#10658 sig { returns(T::Boolean) } def windows_31j?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10630 + # source://prism//lib/prism/node.rb#10732 def type; end end end @@ -21327,7 +21302,7 @@ end # /foo #{bar} baz/ # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10650 +# source://prism//lib/prism/node.rb#10752 class Prism::InterpolatedRegularExpressionNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -21335,7 +21310,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode # - # source://prism//lib/prism/node.rb#10652 + # source://prism//lib/prism/node.rb#10754 sig do params( source: Prism::Source, @@ -21352,12 +21327,12 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10806 + # source://prism//lib/prism/node.rb#10908 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10663 + # source://prism//lib/prism/node.rb#10765 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -21365,43 +21340,43 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10721 + # source://prism//lib/prism/node.rb#10823 sig { returns(T::Boolean) } def ascii_8bit?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10668 + # source://prism//lib/prism/node.rb#10770 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#10785 + # source://prism//lib/prism/node.rb#10887 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#10767 + # source://prism//lib/prism/node.rb#10869 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10678 + # source://prism//lib/prism/node.rb#10780 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10673 + # source://prism//lib/prism/node.rb#10775 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedRegularExpressionNode # - # source://prism//lib/prism/node.rb#10683 + # source://prism//lib/prism/node.rb#10785 sig do params( node_id: Integer, @@ -21414,16 +21389,16 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10688 + # source://prism//lib/prism/node.rb#10790 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location } # - # source://prism//lib/prism/node.rb#10691 + # source://prism//lib/prism/node.rb#10793 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21431,7 +21406,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10716 + # source://prism//lib/prism/node.rb#10818 sig { returns(T::Boolean) } def euc_jp?; end @@ -21439,7 +21414,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10701 + # source://prism//lib/prism/node.rb#10803 sig { returns(T::Boolean) } def extended?; end @@ -21450,7 +21425,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10741 + # source://prism//lib/prism/node.rb#10843 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -21458,7 +21433,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10746 + # source://prism//lib/prism/node.rb#10848 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -21466,7 +21441,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10736 + # source://prism//lib/prism/node.rb#10838 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -21474,13 +21449,13 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10696 + # source://prism//lib/prism/node.rb#10798 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#10790 + # source://prism//lib/prism/node.rb#10892 sig { override.returns(String) } def inspect; end @@ -21488,30 +21463,30 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10706 + # source://prism//lib/prism/node.rb#10808 sig { returns(T::Boolean) } def multi_line?; end - # source://prism//lib/prism/parse_result/newlines.rb#128 + # source://prism//lib/prism/parse_result/newlines.rb#129 def newline_flag!(lines); end # def once?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10711 + # source://prism//lib/prism/node.rb#10813 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#10780 + # source://prism//lib/prism/node.rb#10882 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#10751 + # source://prism//lib/prism/node.rb#10853 sig { returns(Prism::Location) } def opening_loc; end @@ -21520,25 +21495,25 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#10764 + # source://prism//lib/prism/node.rb#10866 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10775 + # source://prism//lib/prism/node.rb#10877 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10759 + # source://prism//lib/prism/node.rb#10861 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10795 + # source://prism//lib/prism/node.rb#10897 sig { override.returns(Symbol) } def type; end @@ -21546,7 +21521,7 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10731 + # source://prism//lib/prism/node.rb#10833 sig { returns(T::Boolean) } def utf_8?; end @@ -21554,14 +21529,14 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10726 + # source://prism//lib/prism/node.rb#10828 sig { returns(T::Boolean) } def windows_31j?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10800 + # source://prism//lib/prism/node.rb#10902 def type; end end end @@ -21571,7 +21546,7 @@ end # "foo #{bar} baz" # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10820 +# source://prism//lib/prism/node.rb#10922 class Prism::InterpolatedStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -21579,7 +21554,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode # - # source://prism//lib/prism/node.rb#10822 + # source://prism//lib/prism/node.rb#10924 sig do params( source: Prism::Source, @@ -21596,48 +21571,48 @@ class Prism::InterpolatedStringNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#10943 + # source://prism//lib/prism/node.rb#11045 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10833 + # source://prism//lib/prism/node.rb#10935 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10838 + # source://prism//lib/prism/node.rb#10940 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#10922 + # source://prism//lib/prism/node.rb#11024 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#10898 + # source://prism//lib/prism/node.rb#11000 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10848 + # source://prism//lib/prism/node.rb#10950 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10843 + # source://prism//lib/prism/node.rb#10945 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode], ?closing_loc: Location?) -> InterpolatedStringNode # - # source://prism//lib/prism/node.rb#10853 + # source://prism//lib/prism/node.rb#10955 sig do params( node_id: Integer, @@ -21650,16 +21625,16 @@ class Prism::InterpolatedStringNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10858 + # source://prism//lib/prism/node.rb#10960 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode], closing_loc: Location? } # - # source://prism//lib/prism/node.rb#10861 + # source://prism//lib/prism/node.rb#10963 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21670,7 +21645,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10866 + # source://prism//lib/prism/node.rb#10968 sig { returns(T::Boolean) } def frozen?; end @@ -21679,7 +21654,7 @@ class Prism::InterpolatedStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#10927 + # source://prism//lib/prism/node.rb#11029 sig { override.returns(String) } def inspect; end @@ -21687,28 +21662,28 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10871 + # source://prism//lib/prism/node.rb#10973 sig { returns(T::Boolean) } def mutable?; end - # source://prism//lib/prism/parse_result/newlines.rb#135 + # source://prism//lib/prism/parse_result/newlines.rb#136 def newline_flag!(lines); end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#10917 + # source://prism//lib/prism/node.rb#11019 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#10876 + # source://prism//lib/prism/node.rb#10978 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode | XStringNode] # - # source://prism//lib/prism/node.rb#10895 + # source://prism//lib/prism/node.rb#10997 sig do returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode, Prism::XStringNode)]) end @@ -21717,38 +21692,38 @@ class Prism::InterpolatedStringNode < ::Prism::Node # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10912 + # source://prism//lib/prism/node.rb#11014 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#10890 + # source://prism//lib/prism/node.rb#10992 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#10932 + # source://prism//lib/prism/node.rb#11034 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#10937 + # source://prism//lib/prism/node.rb#11039 def type; end end end # Flags for interpolated string nodes that indicated mutability if they are also marked as literals. # -# source://prism//lib/prism/node.rb#18522 +# source://prism//lib/prism/node.rb#18693 module Prism::InterpolatedStringNodeFlags; end -# source://prism//lib/prism/node.rb#18524 +# source://prism//lib/prism/node.rb#18695 Prism::InterpolatedStringNodeFlags::FROZEN = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#18527 +# source://prism//lib/prism/node.rb#18698 Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # Represents a symbol literal that contains interpolation. @@ -21756,13 +21731,13 @@ Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # :"foo #{bar} baz" # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#10957 +# source://prism//lib/prism/node.rb#11059 class Prism::InterpolatedSymbolNode < ::Prism::Node # Initialize a new InterpolatedSymbolNode node. # # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#10959 + # source://prism//lib/prism/node.rb#11061 sig do params( source: Prism::Source, @@ -21779,48 +21754,48 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11070 + # source://prism//lib/prism/node.rb#11172 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10970 + # source://prism//lib/prism/node.rb#11072 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10975 + # source://prism//lib/prism/node.rb#11077 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#11049 + # source://prism//lib/prism/node.rb#11151 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#11025 + # source://prism//lib/prism/node.rb#11127 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#10985 + # source://prism//lib/prism/node.rb#11087 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#10980 + # source://prism//lib/prism/node.rb#11082 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location?) -> InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#10990 + # source://prism//lib/prism/node.rb#11092 sig do params( node_id: Integer, @@ -21833,16 +21808,16 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#10995 + # source://prism//lib/prism/node.rb#11097 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location? } # - # source://prism//lib/prism/node.rb#10998 + # source://prism//lib/prism/node.rb#11100 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -21851,53 +21826,53 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11054 + # source://prism//lib/prism/node.rb#11156 sig { override.returns(String) } def inspect; end - # source://prism//lib/prism/parse_result/newlines.rb#142 + # source://prism//lib/prism/parse_result/newlines.rb#143 def newline_flag!(lines); end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#11044 + # source://prism//lib/prism/node.rb#11146 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#11003 + # source://prism//lib/prism/node.rb#11105 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#11022 + # source://prism//lib/prism/node.rb#11124 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11039 + # source://prism//lib/prism/node.rb#11141 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11017 + # source://prism//lib/prism/node.rb#11119 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11059 + # source://prism//lib/prism/node.rb#11161 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11064 + # source://prism//lib/prism/node.rb#11166 def type; end end end @@ -21907,7 +21882,7 @@ end # `foo #{bar} baz` # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11083 +# source://prism//lib/prism/node.rb#11185 class Prism::InterpolatedXStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -21915,7 +21890,7 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#11085 + # source://prism//lib/prism/node.rb#11187 sig do params( source: Prism::Source, @@ -21932,48 +21907,48 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11184 + # source://prism//lib/prism/node.rb#11286 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11096 + # source://prism//lib/prism/node.rb#11198 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11101 + # source://prism//lib/prism/node.rb#11203 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11163 + # source://prism//lib/prism/node.rb#11265 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#11145 + # source://prism//lib/prism/node.rb#11247 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11111 + # source://prism//lib/prism/node.rb#11213 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11106 + # source://prism//lib/prism/node.rb#11208 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location) -> InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#11116 + # source://prism//lib/prism/node.rb#11218 sig do params( node_id: Integer, @@ -21986,16 +21961,16 @@ class Prism::InterpolatedXStringNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11121 + # source://prism//lib/prism/node.rb#11223 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location } # - # source://prism//lib/prism/node.rb#11124 + # source://prism//lib/prism/node.rb#11226 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22007,53 +21982,53 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11168 + # source://prism//lib/prism/node.rb#11270 sig { override.returns(String) } def inspect; end - # source://prism//lib/prism/parse_result/newlines.rb#149 + # source://prism//lib/prism/parse_result/newlines.rb#150 def newline_flag!(lines); end # def opening: () -> String # - # source://prism//lib/prism/node.rb#11158 + # source://prism//lib/prism/node.rb#11260 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#11129 + # source://prism//lib/prism/node.rb#11231 sig { returns(Prism::Location) } def opening_loc; end # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#11142 + # source://prism//lib/prism/node.rb#11244 sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } def parts; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11153 + # source://prism//lib/prism/node.rb#11255 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11137 + # source://prism//lib/prism/node.rb#11239 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11173 + # source://prism//lib/prism/node.rb#11275 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11178 + # source://prism//lib/prism/node.rb#11280 def type; end end end @@ -22063,62 +22038,62 @@ end # -> { it } # ^^ # -# source://prism//lib/prism/node.rb#11197 +# source://prism//lib/prism/node.rb#11299 class Prism::ItLocalVariableReadNode < ::Prism::Node # Initialize a new ItLocalVariableReadNode node. # # @return [ItLocalVariableReadNode] a new instance of ItLocalVariableReadNode # - # source://prism//lib/prism/node.rb#11199 + # source://prism//lib/prism/node.rb#11301 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11256 + # source://prism//lib/prism/node.rb#11358 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11207 + # source://prism//lib/prism/node.rb#11309 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11212 + # source://prism//lib/prism/node.rb#11314 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11222 + # source://prism//lib/prism/node.rb#11324 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11217 + # source://prism//lib/prism/node.rb#11319 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItLocalVariableReadNode # - # source://prism//lib/prism/node.rb#11227 + # source://prism//lib/prism/node.rb#11329 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItLocalVariableReadNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11232 + # source://prism//lib/prism/node.rb#11334 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#11235 + # source://prism//lib/prism/node.rb#11337 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22127,20 +22102,20 @@ class Prism::ItLocalVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11240 + # source://prism//lib/prism/node.rb#11342 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11245 + # source://prism//lib/prism/node.rb#11347 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11250 + # source://prism//lib/prism/node.rb#11352 def type; end end end @@ -22150,62 +22125,62 @@ end # -> { it + it } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11265 +# source://prism//lib/prism/node.rb#11367 class Prism::ItParametersNode < ::Prism::Node # Initialize a new ItParametersNode node. # # @return [ItParametersNode] a new instance of ItParametersNode # - # source://prism//lib/prism/node.rb#11267 + # source://prism//lib/prism/node.rb#11369 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11324 + # source://prism//lib/prism/node.rb#11426 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11275 + # source://prism//lib/prism/node.rb#11377 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11280 + # source://prism//lib/prism/node.rb#11382 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11290 + # source://prism//lib/prism/node.rb#11392 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11285 + # source://prism//lib/prism/node.rb#11387 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> ItParametersNode # - # source://prism//lib/prism/node.rb#11295 + # source://prism//lib/prism/node.rb#11397 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::ItParametersNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11300 + # source://prism//lib/prism/node.rb#11402 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#11303 + # source://prism//lib/prism/node.rb#11405 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22214,20 +22189,20 @@ class Prism::ItParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11308 + # source://prism//lib/prism/node.rb#11410 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11313 + # source://prism//lib/prism/node.rb#11415 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11318 + # source://prism//lib/prism/node.rb#11420 def type; end end end @@ -22237,13 +22212,13 @@ end # foo(a: b) # ^^^^ # -# source://prism//lib/prism/node.rb#11333 +# source://prism//lib/prism/node.rb#11435 class Prism::KeywordHashNode < ::Prism::Node # Initialize a new KeywordHashNode node. # # @return [KeywordHashNode] a new instance of KeywordHashNode # - # source://prism//lib/prism/node.rb#11335 + # source://prism//lib/prism/node.rb#11437 sig do params( source: Prism::Source, @@ -22258,36 +22233,36 @@ class Prism::KeywordHashNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11401 + # source://prism//lib/prism/node.rb#11503 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11344 + # source://prism//lib/prism/node.rb#11446 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11349 + # source://prism//lib/prism/node.rb#11451 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11359 + # source://prism//lib/prism/node.rb#11461 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11354 + # source://prism//lib/prism/node.rb#11456 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode]) -> KeywordHashNode # - # source://prism//lib/prism/node.rb#11364 + # source://prism//lib/prism/node.rb#11466 sig do params( node_id: Integer, @@ -22298,22 +22273,22 @@ class Prism::KeywordHashNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), elements: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11369 + # source://prism//lib/prism/node.rb#11471 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, elements: Array[AssocNode | AssocSplatNode] } # - # source://prism//lib/prism/node.rb#11372 + # source://prism//lib/prism/node.rb#11474 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader elements: Array[AssocNode | AssocSplatNode] # - # source://prism//lib/prism/node.rb#11382 + # source://prism//lib/prism/node.rb#11484 sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } def elements; end @@ -22322,7 +22297,7 @@ class Prism::KeywordHashNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11385 + # source://prism//lib/prism/node.rb#11487 sig { override.returns(String) } def inspect; end @@ -22330,32 +22305,32 @@ class Prism::KeywordHashNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11377 + # source://prism//lib/prism/node.rb#11479 sig { returns(T::Boolean) } def symbol_keys?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11390 + # source://prism//lib/prism/node.rb#11492 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11395 + # source://prism//lib/prism/node.rb#11497 def type; end end end # Flags for keyword hash nodes. # -# source://prism//lib/prism/node.rb#18531 +# source://prism//lib/prism/node.rb#18702 module Prism::KeywordHashNodeFlags; end # a keyword hash which only has `AssocNode` elements all with symbol keys, which means the elements can be treated as keyword arguments # -# source://prism//lib/prism/node.rb#18533 +# source://prism//lib/prism/node.rb#18704 Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) # Represents a keyword rest parameter to a method, block, or lambda definition. @@ -22364,13 +22339,13 @@ Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) # ^^^ # end # -# source://prism//lib/prism/node.rb#11414 +# source://prism//lib/prism/node.rb#11516 class Prism::KeywordRestParameterNode < ::Prism::Node # Initialize a new KeywordRestParameterNode node. # # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#11416 + # source://prism//lib/prism/node.rb#11518 sig do params( source: Prism::Source, @@ -22387,36 +22362,36 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11521 + # source://prism//lib/prism/node.rb#11623 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11427 + # source://prism//lib/prism/node.rb#11529 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11432 + # source://prism//lib/prism/node.rb#11534 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11442 + # source://prism//lib/prism/node.rb#11544 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11437 + # source://prism//lib/prism/node.rb#11539 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#11447 + # source://prism//lib/prism/node.rb#11549 sig do params( node_id: Integer, @@ -22429,16 +22404,16 @@ class Prism::KeywordRestParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11452 + # source://prism//lib/prism/node.rb#11554 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#11455 + # source://prism//lib/prism/node.rb#11557 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22447,31 +22422,31 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11505 + # source://prism//lib/prism/node.rb#11607 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#11465 + # source://prism//lib/prism/node.rb#11567 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#11468 + # source://prism//lib/prism/node.rb#11570 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#11500 + # source://prism//lib/prism/node.rb#11602 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11487 + # source://prism//lib/prism/node.rb#11589 sig { returns(Prism::Location) } def operator_loc; end @@ -22479,32 +22454,32 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11460 + # source://prism//lib/prism/node.rb#11562 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11482 + # source://prism//lib/prism/node.rb#11584 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11495 + # source://prism//lib/prism/node.rb#11597 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11510 + # source://prism//lib/prism/node.rb#11612 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11515 + # source://prism//lib/prism/node.rb#11617 def type; end end end @@ -22514,13 +22489,13 @@ end # ->(value) { value * 2 } # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11534 +# source://prism//lib/prism/node.rb#11636 class Prism::LambdaNode < ::Prism::Node # Initialize a new LambdaNode node. # # @return [LambdaNode] a new instance of LambdaNode # - # source://prism//lib/prism/node.rb#11536 + # source://prism//lib/prism/node.rb#11638 sig do params( source: Prism::Source, @@ -22540,54 +22515,54 @@ class Prism::LambdaNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11665 + # source://prism//lib/prism/node.rb#11767 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11550 + # source://prism//lib/prism/node.rb#11652 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: StatementsNode | BeginNode | nil # - # source://prism//lib/prism/node.rb#11631 + # source://prism//lib/prism/node.rb#11733 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11555 + # source://prism//lib/prism/node.rb#11657 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11644 + # source://prism//lib/prism/node.rb#11746 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#11615 + # source://prism//lib/prism/node.rb#11717 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11568 + # source://prism//lib/prism/node.rb#11670 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11560 + # source://prism//lib/prism/node.rb#11662 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?operator_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, ?body: StatementsNode | BeginNode | nil) -> LambdaNode # - # source://prism//lib/prism/node.rb#11573 + # source://prism//lib/prism/node.rb#11675 sig do params( node_id: Integer, @@ -22603,16 +22578,16 @@ class Prism::LambdaNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), operator_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), parameters: T.unsafe(nil), body: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11578 + # source://prism//lib/prism/node.rb#11680 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil, body: StatementsNode | BeginNode | nil } # - # source://prism//lib/prism/node.rb#11581 + # source://prism//lib/prism/node.rb#11683 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -22621,74 +22596,74 @@ class Prism::LambdaNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11649 + # source://prism//lib/prism/node.rb#11751 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#11586 + # source://prism//lib/prism/node.rb#11688 sig { returns(T::Array[Symbol]) } def locals; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#11639 + # source://prism//lib/prism/node.rb#11741 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#11602 + # source://prism//lib/prism/node.rb#11704 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#11634 + # source://prism//lib/prism/node.rb#11736 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11589 + # source://prism//lib/prism/node.rb#11691 sig { returns(Prism::Location) } def operator_loc; end # attr_reader parameters: BlockParametersNode | NumberedParametersNode | ItParametersNode | nil # - # source://prism//lib/prism/node.rb#11628 + # source://prism//lib/prism/node.rb#11730 sig { returns(T.nilable(T.any(Prism::BlockParametersNode, Prism::NumberedParametersNode, Prism::ItParametersNode))) } def parameters; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11623 + # source://prism//lib/prism/node.rb#11725 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11610 + # source://prism//lib/prism/node.rb#11712 def save_opening_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11597 + # source://prism//lib/prism/node.rb#11699 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11654 + # source://prism//lib/prism/node.rb#11756 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11659 + # source://prism//lib/prism/node.rb#11761 def type; end end end @@ -22699,33 +22674,33 @@ end # generally lines up. However, there are a few cases that require special # handling. # -# source://prism//lib/prism/lex_compat.rb#12 +# source://prism//lib/prism/lex_compat.rb#13 class Prism::LexCompat # @return [LexCompat] a new instance of LexCompat # - # source://prism//lib/prism/lex_compat.rb#619 + # source://prism//lib/prism/lex_compat.rb#620 def initialize(source, **options); end # Returns the value of attribute options. # - # source://prism//lib/prism/lex_compat.rb#617 + # source://prism//lib/prism/lex_compat.rb#618 def options; end - # source://prism//lib/prism/lex_compat.rb#624 + # source://prism//lib/prism/lex_compat.rb#625 def result; end # Returns the value of attribute source. # - # source://prism//lib/prism/lex_compat.rb#617 + # source://prism//lib/prism/lex_compat.rb#618 def source; end end # Ripper doesn't include the rest of the token in the event, so we need to # trim it down to just the content on the first line when comparing. # -# source://prism//lib/prism/lex_compat.rb#230 +# source://prism//lib/prism/lex_compat.rb#231 class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#231 + # source://prism//lib/prism/lex_compat.rb#232 def ==(other); end end @@ -22733,13 +22708,13 @@ end # heredoc that should be appended onto the list of tokens when the heredoc # closes. # -# source://prism//lib/prism/lex_compat.rb#291 +# source://prism//lib/prism/lex_compat.rb#292 module Prism::LexCompat::Heredoc class << self # Here we will split between the two types of heredocs and return the # object that will store their tokens. # - # source://prism//lib/prism/lex_compat.rb#603 + # source://prism//lib/prism/lex_compat.rb#604 def build(opening); end end end @@ -22748,23 +22723,23 @@ end # that need to be split on "\\\n" to mimic Ripper's behavior. We also need # to keep track of the state that the heredoc was opened in. # -# source://prism//lib/prism/lex_compat.rb#315 +# source://prism//lib/prism/lex_compat.rb#316 class Prism::LexCompat::Heredoc::DashHeredoc # @return [DashHeredoc] a new instance of DashHeredoc # - # source://prism//lib/prism/lex_compat.rb#318 + # source://prism//lib/prism/lex_compat.rb#319 def initialize(split); end - # source://prism//lib/prism/lex_compat.rb#323 + # source://prism//lib/prism/lex_compat.rb#324 def <<(token); end - # source://prism//lib/prism/lex_compat.rb#316 + # source://prism//lib/prism/lex_compat.rb#317 def split; end - # source://prism//lib/prism/lex_compat.rb#327 + # source://prism//lib/prism/lex_compat.rb#328 def to_a; end - # source://prism//lib/prism/lex_compat.rb#316 + # source://prism//lib/prism/lex_compat.rb#317 def tokens; end end @@ -22779,45 +22754,45 @@ end # some extra manipulation on the tokens to make them match Ripper's # output by mirroring the dedent logic that Ripper uses. # -# source://prism//lib/prism/lex_compat.rb#374 +# source://prism//lib/prism/lex_compat.rb#375 class Prism::LexCompat::Heredoc::DedentingHeredoc # @return [DedentingHeredoc] a new instance of DedentingHeredoc # - # source://prism//lib/prism/lex_compat.rb#379 + # source://prism//lib/prism/lex_compat.rb#380 def initialize; end # As tokens are coming in, we track the minimum amount of common leading # whitespace on plain string content tokens. This allows us to later # remove that amount of whitespace from the beginning of each line. # - # source://prism//lib/prism/lex_compat.rb#390 + # source://prism//lib/prism/lex_compat.rb#391 def <<(token); end # Returns the value of attribute dedent. # - # source://prism//lib/prism/lex_compat.rb#377 + # source://prism//lib/prism/lex_compat.rb#378 def dedent; end # Returns the value of attribute dedent_next. # - # source://prism//lib/prism/lex_compat.rb#377 + # source://prism//lib/prism/lex_compat.rb#378 def dedent_next; end # Returns the value of attribute embexpr_balance. # - # source://prism//lib/prism/lex_compat.rb#377 + # source://prism//lib/prism/lex_compat.rb#378 def embexpr_balance; end - # source://prism//lib/prism/lex_compat.rb#427 + # source://prism//lib/prism/lex_compat.rb#428 def to_a; end # Returns the value of attribute tokens. # - # source://prism//lib/prism/lex_compat.rb#377 + # source://prism//lib/prism/lex_compat.rb#378 def tokens; end end -# source://prism//lib/prism/lex_compat.rb#375 +# source://prism//lib/prism/lex_compat.rb#376 Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer) # Heredocs that are no dash or tilde heredocs are just a list of tokens. @@ -22825,20 +22800,20 @@ Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), In # order back into the token stream and set the state of the last token to # the state that the heredoc was opened in. # -# source://prism//lib/prism/lex_compat.rb#296 +# source://prism//lib/prism/lex_compat.rb#297 class Prism::LexCompat::Heredoc::PlainHeredoc # @return [PlainHeredoc] a new instance of PlainHeredoc # - # source://prism//lib/prism/lex_compat.rb#299 + # source://prism//lib/prism/lex_compat.rb#300 def initialize; end - # source://prism//lib/prism/lex_compat.rb#303 + # source://prism//lib/prism/lex_compat.rb#304 def <<(token); end - # source://prism//lib/prism/lex_compat.rb#307 + # source://prism//lib/prism/lex_compat.rb#308 def to_a; end - # source://prism//lib/prism/lex_compat.rb#297 + # source://prism//lib/prism/lex_compat.rb#298 def tokens; end end @@ -22847,27 +22822,27 @@ end # through named captures in regular expressions). In that case we don't # compare the state. # -# source://prism//lib/prism/lex_compat.rb#248 +# source://prism//lib/prism/lex_compat.rb#249 class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#249 + # source://prism//lib/prism/lex_compat.rb#250 def ==(other); end end # Tokens where state should be ignored # used for :on_comment, :on_heredoc_end, :on_embexpr_end # -# source://prism//lib/prism/lex_compat.rb#238 +# source://prism//lib/prism/lex_compat.rb#239 class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#239 + # source://prism//lib/prism/lex_compat.rb#240 def ==(other); end end # Ignored newlines can occasionally have a LABEL state attached to them, so # we compare the state differently here. # -# source://prism//lib/prism/lex_compat.rb#259 +# source://prism//lib/prism/lex_compat.rb#260 class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#260 + # source://prism//lib/prism/lex_compat.rb#261 def ==(other); end end @@ -22880,9 +22855,9 @@ end # more accurately, so we need to allow comparing against both END and # END|LABEL. # -# source://prism//lib/prism/lex_compat.rb#279 +# source://prism//lib/prism/lex_compat.rb#280 class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#280 + # source://prism//lib/prism/lex_compat.rb#281 def ==(other); end end @@ -22890,28 +22865,28 @@ end # many-to-one mapping because we split up our token types, whereas Ripper # tends to group them. # -# source://prism//lib/prism/lex_compat.rb#33 +# source://prism//lib/prism/lex_compat.rb#34 Prism::LexCompat::RIPPER = T.let(T.unsafe(nil), Hash) # A result class specialized for holding tokens produced by the lexer. # -# source://prism//lib/prism/lex_compat.rb#14 +# source://prism//lib/prism/lex_compat.rb#15 class Prism::LexCompat::Result < ::Prism::Result # Create a new lex compat result object with the given values. # # @return [Result] a new instance of Result # - # source://prism//lib/prism/lex_compat.rb#19 + # source://prism//lib/prism/lex_compat.rb#20 def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end # Implement the hash pattern matching interface for Result. # - # source://prism//lib/prism/lex_compat.rb#25 + # source://prism//lib/prism/lex_compat.rb#26 def deconstruct_keys(keys); end # The list of tokens that were produced by the lexer. # - # source://prism//lib/prism/lex_compat.rb#16 + # source://prism//lib/prism/lex_compat.rb#17 def value; end end @@ -22919,38 +22894,38 @@ end # However, we add a couple of convenience methods onto them to make them a # little easier to work with. We delegate all other methods to the array. # -# source://prism//lib/prism/lex_compat.rb#204 +# source://prism//lib/prism/lex_compat.rb#205 class Prism::LexCompat::Token < ::SimpleDelegator # The type of the token. # - # source://prism//lib/prism/lex_compat.rb#213 + # source://prism//lib/prism/lex_compat.rb#214 def event; end # The location of the token in the source. # - # source://prism//lib/prism/lex_compat.rb#208 + # source://prism//lib/prism/lex_compat.rb#209 def location; end # The state of the lexer when this token was produced. # - # source://prism//lib/prism/lex_compat.rb#223 + # source://prism//lib/prism/lex_compat.rb#224 def state; end # The slice of the source that this token represents. # - # source://prism//lib/prism/lex_compat.rb#218 + # source://prism//lib/prism/lex_compat.rb#219 def value; end end # This is a result specific to the `lex` and `lex_file` methods. # -# source://prism//lib/prism/parse_result.rb#781 +# source://prism//lib/prism/parse_result.rb#782 class Prism::LexResult < ::Prism::Result # Create a new lex result object with the given values. # # @return [LexResult] a new instance of LexResult # - # source://prism//lib/prism/parse_result.rb#786 + # source://prism//lib/prism/parse_result.rb#787 sig do params( value: T::Array[T.untyped], @@ -22966,13 +22941,13 @@ class Prism::LexResult < ::Prism::Result # Implement the hash pattern matching interface for LexResult. # - # source://prism//lib/prism/parse_result.rb#792 + # source://prism//lib/prism/parse_result.rb#793 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # The list of tokens that were parsed from the source code. # - # source://prism//lib/prism/parse_result.rb#783 + # source://prism//lib/prism/parse_result.rb#784 sig { returns(T::Array[T.untyped]) } def value; end end @@ -22980,22 +22955,22 @@ end # This is a class that wraps the Ripper lexer to produce almost exactly the # same tokens. # -# source://prism//lib/prism/lex_compat.rb#872 +# source://prism//lib/prism/lex_compat.rb#873 class Prism::LexRipper # @return [LexRipper] a new instance of LexRipper # - # source://prism//lib/prism/lex_compat.rb#875 + # source://prism//lib/prism/lex_compat.rb#876 def initialize(source); end - # source://prism//lib/prism/lex_compat.rb#879 + # source://prism//lib/prism/lex_compat.rb#880 def result; end - # source://prism//lib/prism/lex_compat.rb#873 + # source://prism//lib/prism/lex_compat.rb#874 def source; end private - # source://prism//lib/prism/lex_compat.rb#913 + # source://prism//lib/prism/lex_compat.rb#914 def lex(source); end end @@ -23004,13 +22979,13 @@ end # target &&= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11681 +# source://prism//lib/prism/node.rb#11783 class Prism::LocalVariableAndWriteNode < ::Prism::Node # Initialize a new LocalVariableAndWriteNode node. # # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#11683 + # source://prism//lib/prism/node.rb#11785 sig do params( source: Prism::Source, @@ -23029,36 +23004,36 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11785 + # source://prism//lib/prism/node.rb#11887 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11696 + # source://prism//lib/prism/node.rb#11798 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11701 + # source://prism//lib/prism/node.rb#11803 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11711 + # source://prism//lib/prism/node.rb#11813 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11706 + # source://prism//lib/prism/node.rb#11808 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#11716 + # source://prism//lib/prism/node.rb#11818 sig do params( node_id: Integer, @@ -23073,26 +23048,26 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11721 + # source://prism//lib/prism/node.rb#11823 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer } # - # source://prism//lib/prism/node.rb#11724 + # source://prism//lib/prism/node.rb#11826 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#11761 + # source://prism//lib/prism/node.rb#11863 sig { returns(Integer) } def depth; end - # source://prism//lib/prism/desugar_compiler.rb#236 + # source://prism//lib/prism/desugar_compiler.rb#237 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -23100,62 +23075,62 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11769 + # source://prism//lib/prism/node.rb#11871 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11758 + # source://prism//lib/prism/node.rb#11860 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#11729 + # source://prism//lib/prism/node.rb#11831 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#11764 + # source://prism//lib/prism/node.rb#11866 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11742 + # source://prism//lib/prism/node.rb#11844 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11737 + # source://prism//lib/prism/node.rb#11839 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11750 + # source://prism//lib/prism/node.rb#11852 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11774 + # source://prism//lib/prism/node.rb#11876 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#11755 + # source://prism//lib/prism/node.rb#11857 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11779 + # source://prism//lib/prism/node.rb#11881 def type; end end end @@ -23165,13 +23140,13 @@ end # target += value # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11799 +# source://prism//lib/prism/node.rb#11901 class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # Initialize a new LocalVariableOperatorWriteNode node. # # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#11801 + # source://prism//lib/prism/node.rb#11903 sig do params( source: Prism::Source, @@ -23191,48 +23166,48 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#11902 + # source://prism//lib/prism/node.rb#12004 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11815 + # source://prism//lib/prism/node.rb#11917 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader binary_operator: Symbol # - # source://prism//lib/prism/node.rb#11880 + # source://prism//lib/prism/node.rb#11982 sig { returns(Symbol) } def binary_operator; end # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#11861 + # source://prism//lib/prism/node.rb#11963 sig { returns(Prism::Location) } def binary_operator_loc; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11820 + # source://prism//lib/prism/node.rb#11922 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11830 + # source://prism//lib/prism/node.rb#11932 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11825 + # source://prism//lib/prism/node.rb#11927 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer) -> LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#11835 + # source://prism//lib/prism/node.rb#11937 sig do params( node_id: Integer, @@ -23248,26 +23223,26 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), name: T.unsafe(nil), binary_operator: T.unsafe(nil), depth: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11840 + # source://prism//lib/prism/node.rb#11942 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer } # - # source://prism//lib/prism/node.rb#11843 + # source://prism//lib/prism/node.rb#11945 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#11883 + # source://prism//lib/prism/node.rb#11985 sig { returns(Integer) } def depth; end - # source://prism//lib/prism/desugar_compiler.rb#248 + # source://prism//lib/prism/desugar_compiler.rb#249 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -23275,62 +23250,62 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#11886 + # source://prism//lib/prism/node.rb#11988 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11877 + # source://prism//lib/prism/node.rb#11979 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#11848 + # source://prism//lib/prism/node.rb#11950 sig { returns(Prism::Location) } def name_loc; end # Returns the binary operator used to modify the receiver. This method is # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node_ext.rb#451 + # source://prism//lib/prism/node_ext.rb#454 def operator; end # Returns the location of the binary operator used to modify the receiver. # This method is deprecated in favor of #binary_operator_loc. # - # source://prism//lib/prism/node_ext.rb#458 + # source://prism//lib/prism/node_ext.rb#461 def operator_loc; end # Save the binary_operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11869 + # source://prism//lib/prism/node.rb#11971 def save_binary_operator_loc(repository); end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11856 + # source://prism//lib/prism/node.rb#11958 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#11891 + # source://prism//lib/prism/node.rb#11993 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#11874 + # source://prism//lib/prism/node.rb#11976 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#11896 + # source://prism//lib/prism/node.rb#11998 def type; end end end @@ -23340,13 +23315,13 @@ end # target ||= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11917 +# source://prism//lib/prism/node.rb#12019 class Prism::LocalVariableOrWriteNode < ::Prism::Node # Initialize a new LocalVariableOrWriteNode node. # # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#11919 + # source://prism//lib/prism/node.rb#12021 sig do params( source: Prism::Source, @@ -23365,36 +23340,36 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12021 + # source://prism//lib/prism/node.rb#12123 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11932 + # source://prism//lib/prism/node.rb#12034 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11937 + # source://prism//lib/prism/node.rb#12039 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11947 + # source://prism//lib/prism/node.rb#12049 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11942 + # source://prism//lib/prism/node.rb#12044 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer) -> LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#11952 + # source://prism//lib/prism/node.rb#12054 sig do params( node_id: Integer, @@ -23409,26 +23384,26 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#11957 + # source://prism//lib/prism/node.rb#12059 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer } # - # source://prism//lib/prism/node.rb#11960 + # source://prism//lib/prism/node.rb#12062 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#11997 + # source://prism//lib/prism/node.rb#12099 sig { returns(Integer) } def depth; end - # source://prism//lib/prism/desugar_compiler.rb#242 + # source://prism//lib/prism/desugar_compiler.rb#243 def desugar; end sig { override.returns(T::Array[Prism::Reflection::Field]) } @@ -23436,62 +23411,62 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12005 + # source://prism//lib/prism/node.rb#12107 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11994 + # source://prism//lib/prism/node.rb#12096 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#11965 + # source://prism//lib/prism/node.rb#12067 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12000 + # source://prism//lib/prism/node.rb#12102 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#11978 + # source://prism//lib/prism/node.rb#12080 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11973 + # source://prism//lib/prism/node.rb#12075 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#11986 + # source://prism//lib/prism/node.rb#12088 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12010 + # source://prism//lib/prism/node.rb#12112 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#11991 + # source://prism//lib/prism/node.rb#12093 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12015 + # source://prism//lib/prism/node.rb#12117 def type; end end end @@ -23501,13 +23476,13 @@ end # foo # ^^^ # -# source://prism//lib/prism/node.rb#12035 +# source://prism//lib/prism/node.rb#12137 class Prism::LocalVariableReadNode < ::Prism::Node # Initialize a new LocalVariableReadNode node. # # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode # - # source://prism//lib/prism/node.rb#12037 + # source://prism//lib/prism/node.rb#12139 sig do params( source: Prism::Source, @@ -23523,36 +23498,36 @@ class Prism::LocalVariableReadNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12116 + # source://prism//lib/prism/node.rb#12218 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12047 + # source://prism//lib/prism/node.rb#12149 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12052 + # source://prism//lib/prism/node.rb#12154 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12062 + # source://prism//lib/prism/node.rb#12164 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12057 + # source://prism//lib/prism/node.rb#12159 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableReadNode # - # source://prism//lib/prism/node.rb#12067 + # source://prism//lib/prism/node.rb#12169 sig do params( node_id: Integer, @@ -23564,16 +23539,16 @@ class Prism::LocalVariableReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12072 + # source://prism//lib/prism/node.rb#12174 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer } # - # source://prism//lib/prism/node.rb#12075 + # source://prism//lib/prism/node.rb#12177 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23585,7 +23560,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md). # - # source://prism//lib/prism/node.rb#12097 + # source://prism//lib/prism/node.rb#12199 sig { returns(Integer) } def depth; end @@ -23594,7 +23569,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12100 + # source://prism//lib/prism/node.rb#12202 sig { override.returns(String) } def inspect; end @@ -23608,20 +23583,20 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # _1 # name `:_1` # - # source://prism//lib/prism/node.rb#12088 + # source://prism//lib/prism/node.rb#12190 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12105 + # source://prism//lib/prism/node.rb#12207 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12110 + # source://prism//lib/prism/node.rb#12212 def type; end end end @@ -23631,13 +23606,16 @@ end # foo, bar = baz # ^^^ ^^^ # -# source://prism//lib/prism/node.rb#12127 +# foo => baz +# ^^^ +# +# source://prism//lib/prism/node.rb#12232 class Prism::LocalVariableTargetNode < ::Prism::Node # Initialize a new LocalVariableTargetNode node. # # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#12129 + # source://prism//lib/prism/node.rb#12234 sig do params( source: Prism::Source, @@ -23653,36 +23631,36 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12194 + # source://prism//lib/prism/node.rb#12299 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12139 + # source://prism//lib/prism/node.rb#12244 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12144 + # source://prism//lib/prism/node.rb#12249 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12154 + # source://prism//lib/prism/node.rb#12259 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12149 + # source://prism//lib/prism/node.rb#12254 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer) -> LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#12159 + # source://prism//lib/prism/node.rb#12264 sig do params( node_id: Integer, @@ -23694,22 +23672,22 @@ class Prism::LocalVariableTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12164 + # source://prism//lib/prism/node.rb#12269 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer } # - # source://prism//lib/prism/node.rb#12167 + # source://prism//lib/prism/node.rb#12272 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#12175 + # source://prism//lib/prism/node.rb#12280 sig { returns(Integer) } def depth; end @@ -23718,26 +23696,26 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12178 + # source://prism//lib/prism/node.rb#12283 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12172 + # source://prism//lib/prism/node.rb#12277 sig { returns(Symbol) } def name; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12183 + # source://prism//lib/prism/node.rb#12288 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12188 + # source://prism//lib/prism/node.rb#12293 def type; end end end @@ -23747,13 +23725,13 @@ end # foo = 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#12205 +# source://prism//lib/prism/node.rb#12310 class Prism::LocalVariableWriteNode < ::Prism::Node # Initialize a new LocalVariableWriteNode node. # # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#12207 + # source://prism//lib/prism/node.rb#12312 sig do params( source: Prism::Source, @@ -23772,36 +23750,36 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12335 + # source://prism//lib/prism/node.rb#12440 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12220 + # source://prism//lib/prism/node.rb#12325 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12225 + # source://prism//lib/prism/node.rb#12330 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12235 + # source://prism//lib/prism/node.rb#12340 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12230 + # source://prism//lib/prism/node.rb#12335 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?depth: Integer, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location) -> LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#12240 + # source://prism//lib/prism/node.rb#12345 sig do params( node_id: Integer, @@ -23816,16 +23794,16 @@ class Prism::LocalVariableWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12245 + # source://prism//lib/prism/node.rb#12350 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, depth: Integer, name_loc: Location, value: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#12248 + # source://prism//lib/prism/node.rb#12353 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -23837,7 +23815,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # The specific rules for calculating the depth may differ from individual Ruby implementations, as they are not specified by the language. For more information, see [the Prism documentation](https://github.com/ruby/prism/blob/main/docs/local_variable_depth.md). # - # source://prism//lib/prism/node.rb#12266 + # source://prism//lib/prism/node.rb#12371 sig { returns(Integer) } def depth; end @@ -23846,7 +23824,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12319 + # source://prism//lib/prism/node.rb#12424 sig { override.returns(String) } def inspect; end @@ -23856,7 +23834,7 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # abc = 123 # name `:abc` # - # source://prism//lib/prism/node.rb#12257 + # source://prism//lib/prism/node.rb#12362 sig { returns(Symbol) } def name; end @@ -23865,13 +23843,13 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # foo = :bar # ^^^ # - # source://prism//lib/prism/node.rb#12272 + # source://prism//lib/prism/node.rb#12377 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12314 + # source://prism//lib/prism/node.rb#12419 sig { returns(String) } def operator; end @@ -23880,25 +23858,25 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # x = :y # ^ # - # source://prism//lib/prism/node.rb#12301 + # source://prism//lib/prism/node.rb#12406 sig { returns(Prism::Location) } def operator_loc; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12280 + # source://prism//lib/prism/node.rb#12385 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12309 + # source://prism//lib/prism/node.rb#12414 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12324 + # source://prism//lib/prism/node.rb#12429 sig { override.returns(Symbol) } def type; end @@ -23914,34 +23892,34 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # foo = foo # - # source://prism//lib/prism/node.rb#12295 + # source://prism//lib/prism/node.rb#12400 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12329 + # source://prism//lib/prism/node.rb#12434 def type; end end end # This represents a location in the source. # -# source://prism//lib/prism/parse_result.rb#290 +# source://prism//lib/prism/parse_result.rb#291 class Prism::Location # Create a new location object with the given source, start byte offset, and # byte length. # # @return [Location] a new instance of Location # - # source://prism//lib/prism/parse_result.rb#305 + # source://prism//lib/prism/parse_result.rb#306 sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void } def initialize(source, start_offset, length); end # Returns true if the given other location is equal to this location. # - # source://prism//lib/prism/parse_result.rb#493 + # source://prism//lib/prism/parse_result.rb#494 sig { params(other: T.untyped).returns(T::Boolean) } def ==(other); end @@ -23949,14 +23927,14 @@ class Prism::Location # that occurs after this location on the same line, and return the new # location. This will raise an error if the string does not exist. # - # source://prism//lib/prism/parse_result.rb#512 + # source://prism//lib/prism/parse_result.rb#513 sig { params(string: String).returns(Prism::Location) } def adjoin(string); end # The end column in code units using the given cache to fetch or calculate # the value. # - # source://prism//lib/prism/parse_result.rb#478 + # source://prism//lib/prism/parse_result.rb#479 sig do params( cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)) @@ -23967,7 +23945,7 @@ class Prism::Location # The end offset from the start of the file in code units using the given # cache to fetch or calculate the value. # - # source://prism//lib/prism/parse_result.rb#414 + # source://prism//lib/prism/parse_result.rb#415 sig do params( cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)) @@ -23978,7 +23956,7 @@ class Prism::Location # The start column in code units using the given cache to fetch or calculate # the value. # - # source://prism//lib/prism/parse_result.rb#454 + # source://prism//lib/prism/parse_result.rb#455 sig do params( cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)) @@ -23989,7 +23967,7 @@ class Prism::Location # The start offset from the start of the file in code units using the given # cache to fetch or calculate the value. # - # source://prism//lib/prism/parse_result.rb#392 + # source://prism//lib/prism/parse_result.rb#393 sig do params( cache: T.any(Prism::CodeUnitsCache, T.proc.params(byte_offset: Integer).returns(Integer)) @@ -23999,78 +23977,78 @@ class Prism::Location # Returns a new location that is the result of chopping off the last byte. # - # source://prism//lib/prism/parse_result.rb#351 + # source://prism//lib/prism/parse_result.rb#352 sig { returns(Prism::Location) } def chop; end # Returns all comments that are associated with this location (both leading # and trailing comments). # - # source://prism//lib/prism/parse_result.rb#341 + # source://prism//lib/prism/parse_result.rb#342 sig { returns(T::Array[Prism::Comment]) } def comments; end # Create a new location object with the given options. # - # source://prism//lib/prism/parse_result.rb#346 + # source://prism//lib/prism/parse_result.rb#347 sig { params(source: Prism::Source, start_offset: Integer, length: Integer).returns(Prism::Location) } def copy(source: T.unsafe(nil), start_offset: T.unsafe(nil), length: T.unsafe(nil)); end # Implement the hash pattern matching interface for Location. # - # source://prism//lib/prism/parse_result.rb#483 + # source://prism//lib/prism/parse_result.rb#484 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # The column number in characters where this location ends from the start of # the line. # - # source://prism//lib/prism/parse_result.rb#466 + # source://prism//lib/prism/parse_result.rb#467 sig { returns(Integer) } def end_character_column; end # The character offset from the beginning of the source where this location # ends. # - # source://prism//lib/prism/parse_result.rb#403 + # source://prism//lib/prism/parse_result.rb#404 sig { returns(Integer) } def end_character_offset; end # The column number in code units of the given encoding where this location # ends from the start of the line. # - # source://prism//lib/prism/parse_result.rb#472 + # source://prism//lib/prism/parse_result.rb#473 sig { params(encoding: Encoding).returns(Integer) } def end_code_units_column(encoding = T.unsafe(nil)); end # The offset from the start of the file in code units of the given encoding. # - # source://prism//lib/prism/parse_result.rb#408 + # source://prism//lib/prism/parse_result.rb#409 sig { params(encoding: Encoding).returns(Integer) } def end_code_units_offset(encoding = T.unsafe(nil)); end # The column number in bytes where this location ends from the start of the # line. # - # source://prism//lib/prism/parse_result.rb#460 + # source://prism//lib/prism/parse_result.rb#461 sig { returns(Integer) } def end_column; end # The line number where this location ends. # - # source://prism//lib/prism/parse_result.rb#430 + # source://prism//lib/prism/parse_result.rb#431 sig { returns(Integer) } def end_line; end # The byte offset from the beginning of the source where this location ends. # - # source://prism//lib/prism/parse_result.rb#397 + # source://prism//lib/prism/parse_result.rb#398 sig { returns(Integer) } def end_offset; end # Returns a string representation of this location. # - # source://prism//lib/prism/parse_result.rb#356 + # source://prism//lib/prism/parse_result.rb#357 sig { returns(String) } def inspect; end @@ -24078,38 +24056,38 @@ class Prism::Location # other location. Raises an error if this location is not before the other # location or if they don't share the same source. # - # source://prism//lib/prism/parse_result.rb#502 + # source://prism//lib/prism/parse_result.rb#503 sig { params(other: Prism::Location).returns(Prism::Location) } def join(other); end # Attach a comment to the leading comments of this location. # - # source://prism//lib/prism/parse_result.rb#324 + # source://prism//lib/prism/parse_result.rb#325 sig { params(comment: Prism::Comment).void } def leading_comment(comment); end # These are the comments that are associated with this location that exist # before the start of this location. # - # source://prism//lib/prism/parse_result.rb#319 + # source://prism//lib/prism/parse_result.rb#320 sig { returns(T::Array[Prism::Comment]) } def leading_comments; end # The length of this location in bytes. # - # source://prism//lib/prism/parse_result.rb#301 + # source://prism//lib/prism/parse_result.rb#302 sig { returns(Integer) } def length; end # Implement the pretty print interface for Location. # - # source://prism//lib/prism/parse_result.rb#488 + # source://prism//lib/prism/parse_result.rb#489 sig { params(q: T.untyped).void } def pretty_print(q); end # The source code that this location represents. # - # source://prism//lib/prism/parse_result.rb#366 + # source://prism//lib/prism/parse_result.rb#367 sig { returns(String) } def slice; end @@ -24117,78 +24095,78 @@ class Prism::Location # of the line that this location starts on to the end of the line that this # location ends on. # - # source://prism//lib/prism/parse_result.rb#373 + # source://prism//lib/prism/parse_result.rb#374 def slice_lines; end # Returns all of the lines of the source code associated with this location. # - # source://prism//lib/prism/parse_result.rb#361 + # source://prism//lib/prism/parse_result.rb#362 sig { returns(T::Array[String]) } def source_lines; end # The column number in characters where this location ends from the start of # the line. # - # source://prism//lib/prism/parse_result.rb#442 + # source://prism//lib/prism/parse_result.rb#443 sig { returns(Integer) } def start_character_column; end # The character offset from the beginning of the source where this location # starts. # - # source://prism//lib/prism/parse_result.rb#381 + # source://prism//lib/prism/parse_result.rb#382 sig { returns(Integer) } def start_character_offset; end # The column number in code units of the given encoding where this location # starts from the start of the line. # - # source://prism//lib/prism/parse_result.rb#448 + # source://prism//lib/prism/parse_result.rb#449 sig { params(encoding: Encoding).returns(Integer) } def start_code_units_column(encoding = T.unsafe(nil)); end # The offset from the start of the file in code units of the given encoding. # - # source://prism//lib/prism/parse_result.rb#386 + # source://prism//lib/prism/parse_result.rb#387 sig { params(encoding: Encoding).returns(Integer) } def start_code_units_offset(encoding = T.unsafe(nil)); end # The column number in bytes where this location starts from the start of # the line. # - # source://prism//lib/prism/parse_result.rb#436 + # source://prism//lib/prism/parse_result.rb#437 sig { returns(Integer) } def start_column; end # The line number where this location starts. # - # source://prism//lib/prism/parse_result.rb#419 + # source://prism//lib/prism/parse_result.rb#420 sig { returns(Integer) } def start_line; end # The content of the line where this location starts before this location. # - # source://prism//lib/prism/parse_result.rb#424 + # source://prism//lib/prism/parse_result.rb#425 sig { returns(String) } def start_line_slice; end # The byte offset from the beginning of the source where this location # starts. # - # source://prism//lib/prism/parse_result.rb#298 + # source://prism//lib/prism/parse_result.rb#299 sig { returns(Integer) } def start_offset; end # Attach a comment to the trailing comments of this location. # - # source://prism//lib/prism/parse_result.rb#335 + # source://prism//lib/prism/parse_result.rb#336 sig { params(comment: Prism::Comment).void } def trailing_comment(comment); end # These are the comments that are associated with this location that exist # after the end of this location. # - # source://prism//lib/prism/parse_result.rb#330 + # source://prism//lib/prism/parse_result.rb#331 sig { returns(T::Array[Prism::Comment]) } def trailing_comments; end @@ -24197,66 +24175,66 @@ class Prism::Location # A Source object that is used to determine more information from the given # offset and length. # - # source://prism//lib/prism/parse_result.rb#293 + # source://prism//lib/prism/parse_result.rb#294 sig { returns(Prism::Source) } def source; end end # Flags for while and until loop nodes. # -# source://prism//lib/prism/node.rb#18537 +# source://prism//lib/prism/node.rb#18708 module Prism::LoopFlags; end # a loop after a begin statement, so the body is executed first before the condition # -# source://prism//lib/prism/node.rb#18539 +# source://prism//lib/prism/node.rb#18710 Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) # This represents a magic comment that was encountered during parsing. # -# source://prism//lib/prism/parse_result.rb#574 +# source://prism//lib/prism/parse_result.rb#575 class Prism::MagicComment # Create a new magic comment object with the given key and value locations. # # @return [MagicComment] a new instance of MagicComment # - # source://prism//lib/prism/parse_result.rb#582 + # source://prism//lib/prism/parse_result.rb#583 sig { params(key_loc: Prism::Location, value_loc: Prism::Location).void } def initialize(key_loc, value_loc); end # Implement the hash pattern matching interface for MagicComment. # - # source://prism//lib/prism/parse_result.rb#598 + # source://prism//lib/prism/parse_result.rb#599 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Returns a string representation of this magic comment. # - # source://prism//lib/prism/parse_result.rb#603 + # source://prism//lib/prism/parse_result.rb#604 sig { returns(String) } def inspect; end # Returns the key of the magic comment by slicing it from the source code. # - # source://prism//lib/prism/parse_result.rb#588 + # source://prism//lib/prism/parse_result.rb#589 sig { returns(String) } def key; end # A Location object representing the location of the key in the source. # - # source://prism//lib/prism/parse_result.rb#576 + # source://prism//lib/prism/parse_result.rb#577 sig { returns(Prism::Location) } def key_loc; end # Returns the value of the magic comment by slicing it from the source code. # - # source://prism//lib/prism/parse_result.rb#593 + # source://prism//lib/prism/parse_result.rb#594 sig { returns(String) } def value; end # A Location object representing the location of the value in the source. # - # source://prism//lib/prism/parse_result.rb#579 + # source://prism//lib/prism/parse_result.rb#580 sig { returns(Prism::Location) } def value_loc; end end @@ -24266,7 +24244,7 @@ end # if /foo/i then end # ^^^^^^ # -# source://prism//lib/prism/node.rb#12349 +# source://prism//lib/prism/node.rb#12454 class Prism::MatchLastLineNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -24274,7 +24252,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [MatchLastLineNode] a new instance of MatchLastLineNode # - # source://prism//lib/prism/node.rb#12351 + # source://prism//lib/prism/node.rb#12456 sig do params( source: Prism::Source, @@ -24292,12 +24270,12 @@ class Prism::MatchLastLineNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12524 + # source://prism//lib/prism/node.rb#12629 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12363 + # source://prism//lib/prism/node.rb#12468 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -24305,55 +24283,55 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12421 + # source://prism//lib/prism/node.rb#12526 sig { returns(T::Boolean) } def ascii_8bit?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12368 + # source://prism//lib/prism/node.rb#12473 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#12503 + # source://prism//lib/prism/node.rb#12608 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#12477 + # source://prism//lib/prism/node.rb#12582 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12378 + # source://prism//lib/prism/node.rb#12483 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12373 + # source://prism//lib/prism/node.rb#12478 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#12498 + # source://prism//lib/prism/node.rb#12603 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#12464 + # source://prism//lib/prism/node.rb#12569 sig { returns(Prism::Location) } def content_loc; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> MatchLastLineNode # - # source://prism//lib/prism/node.rb#12383 + # source://prism//lib/prism/node.rb#12488 sig do params( node_id: Integer, @@ -24367,16 +24345,16 @@ class Prism::MatchLastLineNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12388 + # source://prism//lib/prism/node.rb#12493 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String } # - # source://prism//lib/prism/node.rb#12391 + # source://prism//lib/prism/node.rb#12496 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24384,7 +24362,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12416 + # source://prism//lib/prism/node.rb#12521 sig { returns(T::Boolean) } def euc_jp?; end @@ -24392,7 +24370,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12401 + # source://prism//lib/prism/node.rb#12506 sig { returns(T::Boolean) } def extended?; end @@ -24403,7 +24381,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12441 + # source://prism//lib/prism/node.rb#12546 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -24411,7 +24389,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12446 + # source://prism//lib/prism/node.rb#12551 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -24419,7 +24397,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12436 + # source://prism//lib/prism/node.rb#12541 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -24427,13 +24405,13 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12396 + # source://prism//lib/prism/node.rb#12501 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#12508 + # source://prism//lib/prism/node.rb#12613 sig { override.returns(String) } def inspect; end @@ -24441,7 +24419,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12406 + # source://prism//lib/prism/node.rb#12511 sig { returns(T::Boolean) } def multi_line?; end @@ -24449,19 +24427,19 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12411 + # source://prism//lib/prism/node.rb#12516 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#12493 + # source://prism//lib/prism/node.rb#12598 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#12451 + # source://prism//lib/prism/node.rb#12556 sig { returns(Prism::Location) } def opening_loc; end @@ -24471,30 +24449,30 @@ class Prism::MatchLastLineNode < ::Prism::Node # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12485 + # source://prism//lib/prism/node.rb#12590 def save_closing_loc(repository); end # Save the content_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12472 + # source://prism//lib/prism/node.rb#12577 def save_content_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12459 + # source://prism//lib/prism/node.rb#12564 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12513 + # source://prism//lib/prism/node.rb#12618 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#12490 + # source://prism//lib/prism/node.rb#12595 sig { returns(String) } def unescaped; end @@ -24502,7 +24480,7 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12431 + # source://prism//lib/prism/node.rb#12536 sig { returns(T::Boolean) } def utf_8?; end @@ -24510,14 +24488,14 @@ class Prism::MatchLastLineNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#12426 + # source://prism//lib/prism/node.rb#12531 sig { returns(T::Boolean) } def windows_31j?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12518 + # source://prism//lib/prism/node.rb#12623 def type; end end end @@ -24527,13 +24505,13 @@ end # foo in bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12538 +# source://prism//lib/prism/node.rb#12643 class Prism::MatchPredicateNode < ::Prism::Node # Initialize a new MatchPredicateNode node. # # @return [MatchPredicateNode] a new instance of MatchPredicateNode # - # source://prism//lib/prism/node.rb#12540 + # source://prism//lib/prism/node.rb#12645 sig do params( source: Prism::Source, @@ -24550,36 +24528,36 @@ class Prism::MatchPredicateNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12624 + # source://prism//lib/prism/node.rb#12729 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12551 + # source://prism//lib/prism/node.rb#12656 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12556 + # source://prism//lib/prism/node.rb#12661 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12566 + # source://prism//lib/prism/node.rb#12671 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12561 + # source://prism//lib/prism/node.rb#12666 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchPredicateNode # - # source://prism//lib/prism/node.rb#12571 + # source://prism//lib/prism/node.rb#12676 sig do params( node_id: Integer, @@ -24592,16 +24570,16 @@ class Prism::MatchPredicateNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil), pattern: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12576 + # source://prism//lib/prism/node.rb#12681 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#12579 + # source://prism//lib/prism/node.rb#12684 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24610,50 +24588,50 @@ class Prism::MatchPredicateNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12608 + # source://prism//lib/prism/node.rb#12713 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12603 + # source://prism//lib/prism/node.rb#12708 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12590 + # source://prism//lib/prism/node.rb#12695 sig { returns(Prism::Location) } def operator_loc; end # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#12587 + # source://prism//lib/prism/node.rb#12692 sig { returns(Prism::Node) } def pattern; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12598 + # source://prism//lib/prism/node.rb#12703 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12613 + # source://prism//lib/prism/node.rb#12718 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12584 + # source://prism//lib/prism/node.rb#12689 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12618 + # source://prism//lib/prism/node.rb#12723 def type; end end end @@ -24663,13 +24641,13 @@ end # foo => bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12636 +# source://prism//lib/prism/node.rb#12741 class Prism::MatchRequiredNode < ::Prism::Node # Initialize a new MatchRequiredNode node. # # @return [MatchRequiredNode] a new instance of MatchRequiredNode # - # source://prism//lib/prism/node.rb#12638 + # source://prism//lib/prism/node.rb#12743 sig do params( source: Prism::Source, @@ -24686,36 +24664,36 @@ class Prism::MatchRequiredNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12722 + # source://prism//lib/prism/node.rb#12875 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12649 + # source://prism//lib/prism/node.rb#12754 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12654 + # source://prism//lib/prism/node.rb#12759 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12664 + # source://prism//lib/prism/node.rb#12769 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12659 + # source://prism//lib/prism/node.rb#12764 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location) -> MatchRequiredNode # - # source://prism//lib/prism/node.rb#12669 + # source://prism//lib/prism/node.rb#12774 sig do params( node_id: Integer, @@ -24728,16 +24706,16 @@ class Prism::MatchRequiredNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), value: T.unsafe(nil), pattern: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12674 + # source://prism//lib/prism/node.rb#12779 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, value: Prism::node, pattern: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#12677 + # source://prism//lib/prism/node.rb#12782 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24746,50 +24724,98 @@ class Prism::MatchRequiredNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12706 + # source://prism//lib/prism/node.rb#12859 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12701 + # source://prism//lib/prism/node.rb#12854 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the operator. + # + # foo => bar + # ^^ # - # source://prism//lib/prism/node.rb#12688 + # source://prism//lib/prism/node.rb#12841 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader pattern: Prism::node + # Represents the right-hand side of the operator. The type of the node depends on the expression. + # + # Anything that looks like a local variable name (including `_`) will result in a `LocalVariableTargetNode`. + # + # foo => a # This is equivalent to writing `a = foo` + # ^ + # + # Using an explicit `Array` or combining expressions with `,` will result in a `ArrayPatternNode`. This can be preceded by a constant. + # + # foo => [a] + # ^^^ + # + # foo => a, b + # ^^^^ + # + # foo => Bar[a, b] + # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#12685 + # If the array pattern contains at least two wildcard matches, a `FindPatternNode` is created instead. + # + # foo => *, 1, *a + # ^^^^^ + # + # Using an explicit `Hash` or a constant with square brackets and hash keys in the square brackets will result in a `HashPatternNode`. + # + # foo => { a: 1, b: } + # + # foo => Bar[a: 1, b:] + # + # foo => Bar[**] + # + # To use any variable that needs run time evaluation, pinning is required. This results in a `PinnedVariableNode` + # + # foo => ^a + # ^^ + # + # Similar, any expression can be used with pinning. This results in a `PinnedExpressionNode`. + # + # foo => ^(a + 1) + # + # Anything else will result in the regular node for that expression, for example a `ConstantReadNode`. + # + # foo => CONST + # + # source://prism//lib/prism/node.rb#12835 sig { returns(Prism::Node) } def pattern; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12696 + # source://prism//lib/prism/node.rb#12849 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12711 + # source://prism//lib/prism/node.rb#12864 sig { override.returns(Symbol) } def type; end - # attr_reader value: Prism::node + # Represents the left-hand side of the operator. # - # source://prism//lib/prism/node.rb#12682 + # foo => bar + # ^^^ + # + # source://prism//lib/prism/node.rb#12790 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12716 + # source://prism//lib/prism/node.rb#12869 def type; end end end @@ -24799,13 +24825,13 @@ end # /(?bar)/ =~ baz # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12734 +# source://prism//lib/prism/node.rb#12887 class Prism::MatchWriteNode < ::Prism::Node # Initialize a new MatchWriteNode node. # # @return [MatchWriteNode] a new instance of MatchWriteNode # - # source://prism//lib/prism/node.rb#12736 + # source://prism//lib/prism/node.rb#12889 sig do params( source: Prism::Source, @@ -24821,42 +24847,42 @@ class Prism::MatchWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12801 + # source://prism//lib/prism/node.rb#12954 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12746 + # source://prism//lib/prism/node.rb#12899 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader call: CallNode # - # source://prism//lib/prism/node.rb#12779 + # source://prism//lib/prism/node.rb#12932 sig { returns(Prism::CallNode) } def call; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12751 + # source://prism//lib/prism/node.rb#12904 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12761 + # source://prism//lib/prism/node.rb#12914 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12756 + # source://prism//lib/prism/node.rb#12909 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?call: CallNode, ?targets: Array[LocalVariableTargetNode]) -> MatchWriteNode # - # source://prism//lib/prism/node.rb#12766 + # source://prism//lib/prism/node.rb#12919 sig do params( node_id: Integer, @@ -24868,16 +24894,16 @@ class Prism::MatchWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), call: T.unsafe(nil), targets: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12771 + # source://prism//lib/prism/node.rb#12924 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, call: CallNode, targets: Array[LocalVariableTargetNode] } # - # source://prism//lib/prism/node.rb#12774 + # source://prism//lib/prism/node.rb#12927 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24886,88 +24912,88 @@ class Prism::MatchWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12785 + # source://prism//lib/prism/node.rb#12938 sig { override.returns(String) } def inspect; end # attr_reader targets: Array[LocalVariableTargetNode] # - # source://prism//lib/prism/node.rb#12782 + # source://prism//lib/prism/node.rb#12935 sig { returns(T::Array[Prism::LocalVariableTargetNode]) } def targets; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12790 + # source://prism//lib/prism/node.rb#12943 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12795 + # source://prism//lib/prism/node.rb#12948 def type; end end end # Represents a node that is missing from the source and results in a syntax error. # -# source://prism//lib/prism/node.rb#12810 +# source://prism//lib/prism/node.rb#12963 class Prism::MissingNode < ::Prism::Node # Initialize a new MissingNode node. # # @return [MissingNode] a new instance of MissingNode # - # source://prism//lib/prism/node.rb#12812 + # source://prism//lib/prism/node.rb#12965 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12869 + # source://prism//lib/prism/node.rb#13022 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12820 + # source://prism//lib/prism/node.rb#12973 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12825 + # source://prism//lib/prism/node.rb#12978 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12835 + # source://prism//lib/prism/node.rb#12988 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12830 + # source://prism//lib/prism/node.rb#12983 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> MissingNode # - # source://prism//lib/prism/node.rb#12840 + # source://prism//lib/prism/node.rb#12993 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::MissingNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12845 + # source://prism//lib/prism/node.rb#12998 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12848 + # source://prism//lib/prism/node.rb#13001 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -24976,20 +25002,20 @@ class Prism::MissingNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12853 + # source://prism//lib/prism/node.rb#13006 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12858 + # source://prism//lib/prism/node.rb#13011 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12863 + # source://prism//lib/prism/node.rb#13016 def type; end end end @@ -24999,13 +25025,13 @@ end # module Foo end # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12878 +# source://prism//lib/prism/node.rb#13031 class Prism::ModuleNode < ::Prism::Node # Initialize a new ModuleNode node. # # @return [ModuleNode] a new instance of ModuleNode # - # source://prism//lib/prism/node.rb#12880 + # source://prism//lib/prism/node.rb#13033 sig do params( source: Prism::Source, @@ -25025,48 +25051,48 @@ class Prism::ModuleNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#12994 + # source://prism//lib/prism/node.rb#13147 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12894 + # source://prism//lib/prism/node.rb#13047 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: StatementsNode | BeginNode | nil # - # source://prism//lib/prism/node.rb#12949 + # source://prism//lib/prism/node.rb#13102 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12899 + # source://prism//lib/prism/node.rb#13052 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12912 + # source://prism//lib/prism/node.rb#13065 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#12904 + # source://prism//lib/prism/node.rb#13057 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader constant_path: ConstantReadNode | ConstantPathNode | MissingNode # - # source://prism//lib/prism/node.rb#12946 + # source://prism//lib/prism/node.rb#13099 sig { returns(T.any(Prism::ConstantReadNode, Prism::ConstantPathNode, Prism::MissingNode)) } def constant_path; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?module_keyword_loc: Location, ?constant_path: ConstantReadNode | ConstantPathNode | MissingNode, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location, ?name: Symbol) -> ModuleNode # - # source://prism//lib/prism/node.rb#12917 + # source://prism//lib/prism/node.rb#13070 sig do params( node_id: Integer, @@ -25082,28 +25108,28 @@ class Prism::ModuleNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), module_keyword_loc: T.unsafe(nil), constant_path: T.unsafe(nil), body: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#12922 + # source://prism//lib/prism/node.rb#13075 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], module_keyword_loc: Location, constant_path: ConstantReadNode | ConstantPathNode | MissingNode, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#12925 + # source://prism//lib/prism/node.rb#13078 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#12973 + # source://prism//lib/prism/node.rb#13126 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#12952 + # source://prism//lib/prism/node.rb#13105 sig { returns(Prism::Location) } def end_keyword_loc; end @@ -25112,56 +25138,56 @@ class Prism::ModuleNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#12978 + # source://prism//lib/prism/node.rb#13131 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#12930 + # source://prism//lib/prism/node.rb#13083 sig { returns(T::Array[Symbol]) } def locals; end # def module_keyword: () -> String # - # source://prism//lib/prism/node.rb#12968 + # source://prism//lib/prism/node.rb#13121 sig { returns(String) } def module_keyword; end # attr_reader module_keyword_loc: Location # - # source://prism//lib/prism/node.rb#12933 + # source://prism//lib/prism/node.rb#13086 sig { returns(Prism::Location) } def module_keyword_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#12965 + # source://prism//lib/prism/node.rb#13118 sig { returns(Symbol) } def name; end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12960 + # source://prism//lib/prism/node.rb#13113 def save_end_keyword_loc(repository); end # Save the module_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#12941 + # source://prism//lib/prism/node.rb#13094 def save_module_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#12983 + # source://prism//lib/prism/node.rb#13136 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#12988 + # source://prism//lib/prism/node.rb#13141 def type; end end end @@ -25176,13 +25202,13 @@ end # for a, b in [[1, 2], [3, 4]] # ^^^^ # -# source://prism//lib/prism/node.rb#13015 +# source://prism//lib/prism/node.rb#13168 class Prism::MultiTargetNode < ::Prism::Node # Initialize a new MultiTargetNode node. # # @return [MultiTargetNode] a new instance of MultiTargetNode # - # source://prism//lib/prism/node.rb#13017 + # source://prism//lib/prism/node.rb#13170 sig do params( source: Prism::Source, @@ -25201,36 +25227,36 @@ class Prism::MultiTargetNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13170 + # source://prism//lib/prism/node.rb#13323 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13030 + # source://prism//lib/prism/node.rb#13183 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13035 + # source://prism//lib/prism/node.rb#13188 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13049 + # source://prism//lib/prism/node.rb#13202 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13040 + # source://prism//lib/prism/node.rb#13193 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?) -> MultiTargetNode # - # source://prism//lib/prism/node.rb#13054 + # source://prism//lib/prism/node.rb#13207 sig do params( node_id: Integer, @@ -25245,16 +25271,16 @@ class Prism::MultiTargetNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), lefts: T.unsafe(nil), rest: T.unsafe(nil), rights: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13059 + # source://prism//lib/prism/node.rb#13212 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location? } # - # source://prism//lib/prism/node.rb#13062 + # source://prism//lib/prism/node.rb#13215 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25263,7 +25289,7 @@ class Prism::MultiTargetNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13154 + # source://prism//lib/prism/node.rb#13307 sig { override.returns(String) } def inspect; end @@ -25277,7 +25303,7 @@ class Prism::MultiTargetNode < ::Prism::Node # a, (b, c) = 1, 2, 3, 4, 5 # ^^^^ # - # source://prism//lib/prism/node.rb#13075 + # source://prism//lib/prism/node.rb#13228 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)]) end @@ -25285,7 +25311,7 @@ class Prism::MultiTargetNode < ::Prism::Node # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#13144 + # source://prism//lib/prism/node.rb#13297 sig { returns(T.nilable(String)) } def lparen; end @@ -25294,7 +25320,7 @@ class Prism::MultiTargetNode < ::Prism::Node # a, (b, c) = 1, 2, 3 # ^ # - # source://prism//lib/prism/node.rb#13103 + # source://prism//lib/prism/node.rb#13256 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end @@ -25313,7 +25339,7 @@ class Prism::MultiTargetNode < ::Prism::Node # a, (b,) = 1, 2, 3, 4 # ^ # - # source://prism//lib/prism/node.rb#13091 + # source://prism//lib/prism/node.rb#13244 sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) } def rest; end @@ -25322,7 +25348,7 @@ class Prism::MultiTargetNode < ::Prism::Node # a, (*, b, c) = 1, 2, 3, 4, 5 # ^^^^ # - # source://prism//lib/prism/node.rb#13097 + # source://prism//lib/prism/node.rb#13250 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::RequiredParameterNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)]) end @@ -25330,7 +25356,7 @@ class Prism::MultiTargetNode < ::Prism::Node # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#13149 + # source://prism//lib/prism/node.rb#13302 sig { returns(T.nilable(String)) } def rparen; end @@ -25339,32 +25365,32 @@ class Prism::MultiTargetNode < ::Prism::Node # a, (b, c) = 1, 2, 3 # ^ # - # source://prism//lib/prism/node.rb#13125 + # source://prism//lib/prism/node.rb#13278 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13117 + # source://prism//lib/prism/node.rb#13270 def save_lparen_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13139 + # source://prism//lib/prism/node.rb#13292 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13159 + # source://prism//lib/prism/node.rb#13312 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13164 + # source://prism//lib/prism/node.rb#13317 def type; end end end @@ -25374,13 +25400,13 @@ end # a, b, c = 1, 2, 3 # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13186 +# source://prism//lib/prism/node.rb#13339 class Prism::MultiWriteNode < ::Prism::Node # Initialize a new MultiWriteNode node. # # @return [MultiWriteNode] a new instance of MultiWriteNode # - # source://prism//lib/prism/node.rb#13188 + # source://prism//lib/prism/node.rb#13341 sig do params( source: Prism::Source, @@ -25401,36 +25427,36 @@ class Prism::MultiWriteNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13371 + # source://prism//lib/prism/node.rb#13524 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13203 + # source://prism//lib/prism/node.rb#13356 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13208 + # source://prism//lib/prism/node.rb#13361 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13223 + # source://prism//lib/prism/node.rb#13376 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13213 + # source://prism//lib/prism/node.rb#13366 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: ImplicitRestNode | SplatNode | nil, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?operator_loc: Location, ?value: Prism::node) -> MultiWriteNode # - # source://prism//lib/prism/node.rb#13228 + # source://prism//lib/prism/node.rb#13381 sig do params( node_id: Integer, @@ -25447,16 +25473,16 @@ class Prism::MultiWriteNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), lefts: T.unsafe(nil), rest: T.unsafe(nil), rights: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13233 + # source://prism//lib/prism/node.rb#13386 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: ImplicitRestNode | SplatNode | nil, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | BackReferenceReadNode | NumberedReferenceReadNode], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#13236 + # source://prism//lib/prism/node.rb#13389 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -25465,7 +25491,7 @@ class Prism::MultiWriteNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13355 + # source://prism//lib/prism/node.rb#13508 sig { override.returns(String) } def inspect; end @@ -25479,7 +25505,7 @@ class Prism::MultiWriteNode < ::Prism::Node # a, b, c = 1, 2, 3, 4, 5 # ^^^^^^^ # - # source://prism//lib/prism/node.rb#13249 + # source://prism//lib/prism/node.rb#13402 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)]) end @@ -25487,7 +25513,7 @@ class Prism::MultiWriteNode < ::Prism::Node # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#13340 + # source://prism//lib/prism/node.rb#13493 sig { returns(T.nilable(String)) } def lparen; end @@ -25496,13 +25522,13 @@ class Prism::MultiWriteNode < ::Prism::Node # (a, b, c) = 1, 2, 3 # ^ # - # source://prism//lib/prism/node.rb#13277 + # source://prism//lib/prism/node.rb#13430 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13350 + # source://prism//lib/prism/node.rb#13503 sig { returns(String) } def operator; end @@ -25511,7 +25537,7 @@ class Prism::MultiWriteNode < ::Prism::Node # a, b, c = 1, 2, 3 # ^ # - # source://prism//lib/prism/node.rb#13321 + # source://prism//lib/prism/node.rb#13474 sig { returns(Prism::Location) } def operator_loc; end @@ -25530,7 +25556,7 @@ class Prism::MultiWriteNode < ::Prism::Node # a, b, = 1, 2, 3, 4 # ^ # - # source://prism//lib/prism/node.rb#13265 + # source://prism//lib/prism/node.rb#13418 sig { returns(T.nilable(T.any(Prism::ImplicitRestNode, Prism::SplatNode))) } def rest; end @@ -25539,7 +25565,7 @@ class Prism::MultiWriteNode < ::Prism::Node # a, *, b, c = 1, 2, 3, 4, 5 # ^^^^ # - # source://prism//lib/prism/node.rb#13271 + # source://prism//lib/prism/node.rb#13424 sig do returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode)]) end @@ -25547,7 +25573,7 @@ class Prism::MultiWriteNode < ::Prism::Node # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#13345 + # source://prism//lib/prism/node.rb#13498 sig { returns(T.nilable(String)) } def rparen; end @@ -25556,31 +25582,31 @@ class Prism::MultiWriteNode < ::Prism::Node # (a, b, c) = 1, 2, 3 # ^ # - # source://prism//lib/prism/node.rb#13299 + # source://prism//lib/prism/node.rb#13452 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13291 + # source://prism//lib/prism/node.rb#13444 def save_lparen_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13329 + # source://prism//lib/prism/node.rb#13482 def save_operator_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13313 + # source://prism//lib/prism/node.rb#13466 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13360 + # source://prism//lib/prism/node.rb#13513 sig { override.returns(Symbol) } def type; end @@ -25589,14 +25615,14 @@ class Prism::MultiWriteNode < ::Prism::Node # a, b, c = 1, 2, 3 # ^^^^^^^ # - # source://prism//lib/prism/node.rb#13337 + # source://prism//lib/prism/node.rb#13490 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13365 + # source://prism//lib/prism/node.rb#13518 def type; end end end @@ -25605,761 +25631,761 @@ end # visited. This is useful for consumers that want to mutate the tree, as you # can change subtrees in place without effecting the rest of the tree. # -# source://prism//lib/prism/mutation_compiler.rb#13 +# source://prism//lib/prism/mutation_compiler.rb#16 class Prism::MutationCompiler < ::Prism::Compiler # Copy a AliasGlobalVariableNode node # - # source://prism//lib/prism/mutation_compiler.rb#15 + # source://prism//lib/prism/mutation_compiler.rb#18 def visit_alias_global_variable_node(node); end # Copy a AliasMethodNode node # - # source://prism//lib/prism/mutation_compiler.rb#20 + # source://prism//lib/prism/mutation_compiler.rb#23 def visit_alias_method_node(node); end # Copy a AlternationPatternNode node # - # source://prism//lib/prism/mutation_compiler.rb#25 + # source://prism//lib/prism/mutation_compiler.rb#28 def visit_alternation_pattern_node(node); end # Copy a AndNode node # - # source://prism//lib/prism/mutation_compiler.rb#30 + # source://prism//lib/prism/mutation_compiler.rb#33 def visit_and_node(node); end # Copy a ArgumentsNode node # - # source://prism//lib/prism/mutation_compiler.rb#35 + # source://prism//lib/prism/mutation_compiler.rb#38 def visit_arguments_node(node); end # Copy a ArrayNode node # - # source://prism//lib/prism/mutation_compiler.rb#40 + # source://prism//lib/prism/mutation_compiler.rb#43 def visit_array_node(node); end # Copy a ArrayPatternNode node # - # source://prism//lib/prism/mutation_compiler.rb#45 + # source://prism//lib/prism/mutation_compiler.rb#48 def visit_array_pattern_node(node); end # Copy a AssocNode node # - # source://prism//lib/prism/mutation_compiler.rb#50 + # source://prism//lib/prism/mutation_compiler.rb#53 def visit_assoc_node(node); end # Copy a AssocSplatNode node # - # source://prism//lib/prism/mutation_compiler.rb#55 + # source://prism//lib/prism/mutation_compiler.rb#58 def visit_assoc_splat_node(node); end # Copy a BackReferenceReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#60 + # source://prism//lib/prism/mutation_compiler.rb#63 def visit_back_reference_read_node(node); end # Copy a BeginNode node # - # source://prism//lib/prism/mutation_compiler.rb#65 + # source://prism//lib/prism/mutation_compiler.rb#68 def visit_begin_node(node); end # Copy a BlockArgumentNode node # - # source://prism//lib/prism/mutation_compiler.rb#70 + # source://prism//lib/prism/mutation_compiler.rb#73 def visit_block_argument_node(node); end # Copy a BlockLocalVariableNode node # - # source://prism//lib/prism/mutation_compiler.rb#75 + # source://prism//lib/prism/mutation_compiler.rb#78 def visit_block_local_variable_node(node); end # Copy a BlockNode node # - # source://prism//lib/prism/mutation_compiler.rb#80 + # source://prism//lib/prism/mutation_compiler.rb#83 def visit_block_node(node); end # Copy a BlockParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#85 + # source://prism//lib/prism/mutation_compiler.rb#88 def visit_block_parameter_node(node); end # Copy a BlockParametersNode node # - # source://prism//lib/prism/mutation_compiler.rb#90 + # source://prism//lib/prism/mutation_compiler.rb#93 def visit_block_parameters_node(node); end # Copy a BreakNode node # - # source://prism//lib/prism/mutation_compiler.rb#95 + # source://prism//lib/prism/mutation_compiler.rb#98 def visit_break_node(node); end # Copy a CallAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#100 + # source://prism//lib/prism/mutation_compiler.rb#103 def visit_call_and_write_node(node); end # Copy a CallNode node # - # source://prism//lib/prism/mutation_compiler.rb#105 + # source://prism//lib/prism/mutation_compiler.rb#108 def visit_call_node(node); end # Copy a CallOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#110 + # source://prism//lib/prism/mutation_compiler.rb#113 def visit_call_operator_write_node(node); end # Copy a CallOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#115 + # source://prism//lib/prism/mutation_compiler.rb#118 def visit_call_or_write_node(node); end # Copy a CallTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#120 + # source://prism//lib/prism/mutation_compiler.rb#123 def visit_call_target_node(node); end # Copy a CapturePatternNode node # - # source://prism//lib/prism/mutation_compiler.rb#125 + # source://prism//lib/prism/mutation_compiler.rb#128 def visit_capture_pattern_node(node); end # Copy a CaseMatchNode node # - # source://prism//lib/prism/mutation_compiler.rb#130 + # source://prism//lib/prism/mutation_compiler.rb#133 def visit_case_match_node(node); end # Copy a CaseNode node # - # source://prism//lib/prism/mutation_compiler.rb#135 + # source://prism//lib/prism/mutation_compiler.rb#138 def visit_case_node(node); end # Copy a ClassNode node # - # source://prism//lib/prism/mutation_compiler.rb#140 + # source://prism//lib/prism/mutation_compiler.rb#143 def visit_class_node(node); end # Copy a ClassVariableAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#145 + # source://prism//lib/prism/mutation_compiler.rb#148 def visit_class_variable_and_write_node(node); end # Copy a ClassVariableOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#150 + # source://prism//lib/prism/mutation_compiler.rb#153 def visit_class_variable_operator_write_node(node); end # Copy a ClassVariableOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#155 + # source://prism//lib/prism/mutation_compiler.rb#158 def visit_class_variable_or_write_node(node); end # Copy a ClassVariableReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#160 + # source://prism//lib/prism/mutation_compiler.rb#163 def visit_class_variable_read_node(node); end # Copy a ClassVariableTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#165 + # source://prism//lib/prism/mutation_compiler.rb#168 def visit_class_variable_target_node(node); end # Copy a ClassVariableWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#170 + # source://prism//lib/prism/mutation_compiler.rb#173 def visit_class_variable_write_node(node); end # Copy a ConstantAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#175 + # source://prism//lib/prism/mutation_compiler.rb#178 def visit_constant_and_write_node(node); end # Copy a ConstantOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#180 + # source://prism//lib/prism/mutation_compiler.rb#183 def visit_constant_operator_write_node(node); end # Copy a ConstantOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#185 + # source://prism//lib/prism/mutation_compiler.rb#188 def visit_constant_or_write_node(node); end # Copy a ConstantPathAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#190 + # source://prism//lib/prism/mutation_compiler.rb#193 def visit_constant_path_and_write_node(node); end # Copy a ConstantPathNode node # - # source://prism//lib/prism/mutation_compiler.rb#195 + # source://prism//lib/prism/mutation_compiler.rb#198 def visit_constant_path_node(node); end # Copy a ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#200 + # source://prism//lib/prism/mutation_compiler.rb#203 def visit_constant_path_operator_write_node(node); end # Copy a ConstantPathOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#205 + # source://prism//lib/prism/mutation_compiler.rb#208 def visit_constant_path_or_write_node(node); end # Copy a ConstantPathTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#210 + # source://prism//lib/prism/mutation_compiler.rb#213 def visit_constant_path_target_node(node); end # Copy a ConstantPathWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#215 + # source://prism//lib/prism/mutation_compiler.rb#218 def visit_constant_path_write_node(node); end # Copy a ConstantReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#220 + # source://prism//lib/prism/mutation_compiler.rb#223 def visit_constant_read_node(node); end # Copy a ConstantTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#225 + # source://prism//lib/prism/mutation_compiler.rb#228 def visit_constant_target_node(node); end # Copy a ConstantWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#230 + # source://prism//lib/prism/mutation_compiler.rb#233 def visit_constant_write_node(node); end # Copy a DefNode node # - # source://prism//lib/prism/mutation_compiler.rb#235 + # source://prism//lib/prism/mutation_compiler.rb#238 def visit_def_node(node); end # Copy a DefinedNode node # - # source://prism//lib/prism/mutation_compiler.rb#240 + # source://prism//lib/prism/mutation_compiler.rb#243 def visit_defined_node(node); end # Copy a ElseNode node # - # source://prism//lib/prism/mutation_compiler.rb#245 + # source://prism//lib/prism/mutation_compiler.rb#248 def visit_else_node(node); end # Copy a EmbeddedStatementsNode node # - # source://prism//lib/prism/mutation_compiler.rb#250 + # source://prism//lib/prism/mutation_compiler.rb#253 def visit_embedded_statements_node(node); end # Copy a EmbeddedVariableNode node # - # source://prism//lib/prism/mutation_compiler.rb#255 + # source://prism//lib/prism/mutation_compiler.rb#258 def visit_embedded_variable_node(node); end # Copy a EnsureNode node # - # source://prism//lib/prism/mutation_compiler.rb#260 + # source://prism//lib/prism/mutation_compiler.rb#263 def visit_ensure_node(node); end # Copy a FalseNode node # - # source://prism//lib/prism/mutation_compiler.rb#265 + # source://prism//lib/prism/mutation_compiler.rb#268 def visit_false_node(node); end # Copy a FindPatternNode node # - # source://prism//lib/prism/mutation_compiler.rb#270 + # source://prism//lib/prism/mutation_compiler.rb#273 def visit_find_pattern_node(node); end # Copy a FlipFlopNode node # - # source://prism//lib/prism/mutation_compiler.rb#275 + # source://prism//lib/prism/mutation_compiler.rb#278 def visit_flip_flop_node(node); end # Copy a FloatNode node # - # source://prism//lib/prism/mutation_compiler.rb#280 + # source://prism//lib/prism/mutation_compiler.rb#283 def visit_float_node(node); end # Copy a ForNode node # - # source://prism//lib/prism/mutation_compiler.rb#285 + # source://prism//lib/prism/mutation_compiler.rb#288 def visit_for_node(node); end # Copy a ForwardingArgumentsNode node # - # source://prism//lib/prism/mutation_compiler.rb#290 + # source://prism//lib/prism/mutation_compiler.rb#293 def visit_forwarding_arguments_node(node); end # Copy a ForwardingParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#295 + # source://prism//lib/prism/mutation_compiler.rb#298 def visit_forwarding_parameter_node(node); end # Copy a ForwardingSuperNode node # - # source://prism//lib/prism/mutation_compiler.rb#300 + # source://prism//lib/prism/mutation_compiler.rb#303 def visit_forwarding_super_node(node); end # Copy a GlobalVariableAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#305 + # source://prism//lib/prism/mutation_compiler.rb#308 def visit_global_variable_and_write_node(node); end # Copy a GlobalVariableOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#310 + # source://prism//lib/prism/mutation_compiler.rb#313 def visit_global_variable_operator_write_node(node); end # Copy a GlobalVariableOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#315 + # source://prism//lib/prism/mutation_compiler.rb#318 def visit_global_variable_or_write_node(node); end # Copy a GlobalVariableReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#320 + # source://prism//lib/prism/mutation_compiler.rb#323 def visit_global_variable_read_node(node); end # Copy a GlobalVariableTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#325 + # source://prism//lib/prism/mutation_compiler.rb#328 def visit_global_variable_target_node(node); end # Copy a GlobalVariableWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#330 + # source://prism//lib/prism/mutation_compiler.rb#333 def visit_global_variable_write_node(node); end # Copy a HashNode node # - # source://prism//lib/prism/mutation_compiler.rb#335 + # source://prism//lib/prism/mutation_compiler.rb#338 def visit_hash_node(node); end # Copy a HashPatternNode node # - # source://prism//lib/prism/mutation_compiler.rb#340 + # source://prism//lib/prism/mutation_compiler.rb#343 def visit_hash_pattern_node(node); end # Copy a IfNode node # - # source://prism//lib/prism/mutation_compiler.rb#345 + # source://prism//lib/prism/mutation_compiler.rb#348 def visit_if_node(node); end # Copy a ImaginaryNode node # - # source://prism//lib/prism/mutation_compiler.rb#350 + # source://prism//lib/prism/mutation_compiler.rb#353 def visit_imaginary_node(node); end # Copy a ImplicitNode node # - # source://prism//lib/prism/mutation_compiler.rb#355 + # source://prism//lib/prism/mutation_compiler.rb#358 def visit_implicit_node(node); end # Copy a ImplicitRestNode node # - # source://prism//lib/prism/mutation_compiler.rb#360 + # source://prism//lib/prism/mutation_compiler.rb#363 def visit_implicit_rest_node(node); end # Copy a InNode node # - # source://prism//lib/prism/mutation_compiler.rb#365 + # source://prism//lib/prism/mutation_compiler.rb#368 def visit_in_node(node); end # Copy a IndexAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#370 + # source://prism//lib/prism/mutation_compiler.rb#373 def visit_index_and_write_node(node); end # Copy a IndexOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#375 + # source://prism//lib/prism/mutation_compiler.rb#378 def visit_index_operator_write_node(node); end # Copy a IndexOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#380 + # source://prism//lib/prism/mutation_compiler.rb#383 def visit_index_or_write_node(node); end # Copy a IndexTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#385 + # source://prism//lib/prism/mutation_compiler.rb#388 def visit_index_target_node(node); end # Copy a InstanceVariableAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#390 + # source://prism//lib/prism/mutation_compiler.rb#393 def visit_instance_variable_and_write_node(node); end # Copy a InstanceVariableOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#395 + # source://prism//lib/prism/mutation_compiler.rb#398 def visit_instance_variable_operator_write_node(node); end # Copy a InstanceVariableOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#400 + # source://prism//lib/prism/mutation_compiler.rb#403 def visit_instance_variable_or_write_node(node); end # Copy a InstanceVariableReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#405 + # source://prism//lib/prism/mutation_compiler.rb#408 def visit_instance_variable_read_node(node); end # Copy a InstanceVariableTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#410 + # source://prism//lib/prism/mutation_compiler.rb#413 def visit_instance_variable_target_node(node); end # Copy a InstanceVariableWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#415 + # source://prism//lib/prism/mutation_compiler.rb#418 def visit_instance_variable_write_node(node); end # Copy a IntegerNode node # - # source://prism//lib/prism/mutation_compiler.rb#420 + # source://prism//lib/prism/mutation_compiler.rb#423 def visit_integer_node(node); end # Copy a InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/mutation_compiler.rb#425 + # source://prism//lib/prism/mutation_compiler.rb#428 def visit_interpolated_match_last_line_node(node); end # Copy a InterpolatedRegularExpressionNode node # - # source://prism//lib/prism/mutation_compiler.rb#430 + # source://prism//lib/prism/mutation_compiler.rb#433 def visit_interpolated_regular_expression_node(node); end # Copy a InterpolatedStringNode node # - # source://prism//lib/prism/mutation_compiler.rb#435 + # source://prism//lib/prism/mutation_compiler.rb#438 def visit_interpolated_string_node(node); end # Copy a InterpolatedSymbolNode node # - # source://prism//lib/prism/mutation_compiler.rb#440 + # source://prism//lib/prism/mutation_compiler.rb#443 def visit_interpolated_symbol_node(node); end # Copy a InterpolatedXStringNode node # - # source://prism//lib/prism/mutation_compiler.rb#445 + # source://prism//lib/prism/mutation_compiler.rb#448 def visit_interpolated_x_string_node(node); end # Copy a ItLocalVariableReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#450 + # source://prism//lib/prism/mutation_compiler.rb#453 def visit_it_local_variable_read_node(node); end # Copy a ItParametersNode node # - # source://prism//lib/prism/mutation_compiler.rb#455 + # source://prism//lib/prism/mutation_compiler.rb#458 def visit_it_parameters_node(node); end # Copy a KeywordHashNode node # - # source://prism//lib/prism/mutation_compiler.rb#460 + # source://prism//lib/prism/mutation_compiler.rb#463 def visit_keyword_hash_node(node); end # Copy a KeywordRestParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#465 + # source://prism//lib/prism/mutation_compiler.rb#468 def visit_keyword_rest_parameter_node(node); end # Copy a LambdaNode node # - # source://prism//lib/prism/mutation_compiler.rb#470 + # source://prism//lib/prism/mutation_compiler.rb#473 def visit_lambda_node(node); end # Copy a LocalVariableAndWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#475 + # source://prism//lib/prism/mutation_compiler.rb#478 def visit_local_variable_and_write_node(node); end # Copy a LocalVariableOperatorWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#480 + # source://prism//lib/prism/mutation_compiler.rb#483 def visit_local_variable_operator_write_node(node); end # Copy a LocalVariableOrWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#485 + # source://prism//lib/prism/mutation_compiler.rb#488 def visit_local_variable_or_write_node(node); end # Copy a LocalVariableReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#490 + # source://prism//lib/prism/mutation_compiler.rb#493 def visit_local_variable_read_node(node); end # Copy a LocalVariableTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#495 + # source://prism//lib/prism/mutation_compiler.rb#498 def visit_local_variable_target_node(node); end # Copy a LocalVariableWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#500 + # source://prism//lib/prism/mutation_compiler.rb#503 def visit_local_variable_write_node(node); end # Copy a MatchLastLineNode node # - # source://prism//lib/prism/mutation_compiler.rb#505 + # source://prism//lib/prism/mutation_compiler.rb#508 def visit_match_last_line_node(node); end # Copy a MatchPredicateNode node # - # source://prism//lib/prism/mutation_compiler.rb#510 + # source://prism//lib/prism/mutation_compiler.rb#513 def visit_match_predicate_node(node); end # Copy a MatchRequiredNode node # - # source://prism//lib/prism/mutation_compiler.rb#515 + # source://prism//lib/prism/mutation_compiler.rb#518 def visit_match_required_node(node); end # Copy a MatchWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#520 + # source://prism//lib/prism/mutation_compiler.rb#523 def visit_match_write_node(node); end # Copy a MissingNode node # - # source://prism//lib/prism/mutation_compiler.rb#525 + # source://prism//lib/prism/mutation_compiler.rb#528 def visit_missing_node(node); end # Copy a ModuleNode node # - # source://prism//lib/prism/mutation_compiler.rb#530 + # source://prism//lib/prism/mutation_compiler.rb#533 def visit_module_node(node); end # Copy a MultiTargetNode node # - # source://prism//lib/prism/mutation_compiler.rb#535 + # source://prism//lib/prism/mutation_compiler.rb#538 def visit_multi_target_node(node); end # Copy a MultiWriteNode node # - # source://prism//lib/prism/mutation_compiler.rb#540 + # source://prism//lib/prism/mutation_compiler.rb#543 def visit_multi_write_node(node); end # Copy a NextNode node # - # source://prism//lib/prism/mutation_compiler.rb#545 + # source://prism//lib/prism/mutation_compiler.rb#548 def visit_next_node(node); end # Copy a NilNode node # - # source://prism//lib/prism/mutation_compiler.rb#550 + # source://prism//lib/prism/mutation_compiler.rb#553 def visit_nil_node(node); end # Copy a NoKeywordsParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#555 + # source://prism//lib/prism/mutation_compiler.rb#558 def visit_no_keywords_parameter_node(node); end # Copy a NumberedParametersNode node # - # source://prism//lib/prism/mutation_compiler.rb#560 + # source://prism//lib/prism/mutation_compiler.rb#563 def visit_numbered_parameters_node(node); end # Copy a NumberedReferenceReadNode node # - # source://prism//lib/prism/mutation_compiler.rb#565 + # source://prism//lib/prism/mutation_compiler.rb#568 def visit_numbered_reference_read_node(node); end # Copy a OptionalKeywordParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#570 + # source://prism//lib/prism/mutation_compiler.rb#573 def visit_optional_keyword_parameter_node(node); end # Copy a OptionalParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#575 + # source://prism//lib/prism/mutation_compiler.rb#578 def visit_optional_parameter_node(node); end # Copy a OrNode node # - # source://prism//lib/prism/mutation_compiler.rb#580 + # source://prism//lib/prism/mutation_compiler.rb#583 def visit_or_node(node); end # Copy a ParametersNode node # - # source://prism//lib/prism/mutation_compiler.rb#585 + # source://prism//lib/prism/mutation_compiler.rb#588 def visit_parameters_node(node); end # Copy a ParenthesesNode node # - # source://prism//lib/prism/mutation_compiler.rb#590 + # source://prism//lib/prism/mutation_compiler.rb#593 def visit_parentheses_node(node); end # Copy a PinnedExpressionNode node # - # source://prism//lib/prism/mutation_compiler.rb#595 + # source://prism//lib/prism/mutation_compiler.rb#598 def visit_pinned_expression_node(node); end # Copy a PinnedVariableNode node # - # source://prism//lib/prism/mutation_compiler.rb#600 + # source://prism//lib/prism/mutation_compiler.rb#603 def visit_pinned_variable_node(node); end # Copy a PostExecutionNode node # - # source://prism//lib/prism/mutation_compiler.rb#605 + # source://prism//lib/prism/mutation_compiler.rb#608 def visit_post_execution_node(node); end # Copy a PreExecutionNode node # - # source://prism//lib/prism/mutation_compiler.rb#610 + # source://prism//lib/prism/mutation_compiler.rb#613 def visit_pre_execution_node(node); end # Copy a ProgramNode node # - # source://prism//lib/prism/mutation_compiler.rb#615 + # source://prism//lib/prism/mutation_compiler.rb#618 def visit_program_node(node); end # Copy a RangeNode node # - # source://prism//lib/prism/mutation_compiler.rb#620 + # source://prism//lib/prism/mutation_compiler.rb#623 def visit_range_node(node); end # Copy a RationalNode node # - # source://prism//lib/prism/mutation_compiler.rb#625 + # source://prism//lib/prism/mutation_compiler.rb#628 def visit_rational_node(node); end # Copy a RedoNode node # - # source://prism//lib/prism/mutation_compiler.rb#630 + # source://prism//lib/prism/mutation_compiler.rb#633 def visit_redo_node(node); end # Copy a RegularExpressionNode node # - # source://prism//lib/prism/mutation_compiler.rb#635 + # source://prism//lib/prism/mutation_compiler.rb#638 def visit_regular_expression_node(node); end # Copy a RequiredKeywordParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#640 + # source://prism//lib/prism/mutation_compiler.rb#643 def visit_required_keyword_parameter_node(node); end # Copy a RequiredParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#645 + # source://prism//lib/prism/mutation_compiler.rb#648 def visit_required_parameter_node(node); end # Copy a RescueModifierNode node # - # source://prism//lib/prism/mutation_compiler.rb#650 + # source://prism//lib/prism/mutation_compiler.rb#653 def visit_rescue_modifier_node(node); end # Copy a RescueNode node # - # source://prism//lib/prism/mutation_compiler.rb#655 + # source://prism//lib/prism/mutation_compiler.rb#658 def visit_rescue_node(node); end # Copy a RestParameterNode node # - # source://prism//lib/prism/mutation_compiler.rb#660 + # source://prism//lib/prism/mutation_compiler.rb#663 def visit_rest_parameter_node(node); end # Copy a RetryNode node # - # source://prism//lib/prism/mutation_compiler.rb#665 + # source://prism//lib/prism/mutation_compiler.rb#668 def visit_retry_node(node); end # Copy a ReturnNode node # - # source://prism//lib/prism/mutation_compiler.rb#670 + # source://prism//lib/prism/mutation_compiler.rb#673 def visit_return_node(node); end # Copy a SelfNode node # - # source://prism//lib/prism/mutation_compiler.rb#675 + # source://prism//lib/prism/mutation_compiler.rb#678 def visit_self_node(node); end # Copy a ShareableConstantNode node # - # source://prism//lib/prism/mutation_compiler.rb#680 + # source://prism//lib/prism/mutation_compiler.rb#683 def visit_shareable_constant_node(node); end # Copy a SingletonClassNode node # - # source://prism//lib/prism/mutation_compiler.rb#685 + # source://prism//lib/prism/mutation_compiler.rb#688 def visit_singleton_class_node(node); end # Copy a SourceEncodingNode node # - # source://prism//lib/prism/mutation_compiler.rb#690 + # source://prism//lib/prism/mutation_compiler.rb#693 def visit_source_encoding_node(node); end # Copy a SourceFileNode node # - # source://prism//lib/prism/mutation_compiler.rb#695 + # source://prism//lib/prism/mutation_compiler.rb#698 def visit_source_file_node(node); end # Copy a SourceLineNode node # - # source://prism//lib/prism/mutation_compiler.rb#700 + # source://prism//lib/prism/mutation_compiler.rb#703 def visit_source_line_node(node); end # Copy a SplatNode node # - # source://prism//lib/prism/mutation_compiler.rb#705 + # source://prism//lib/prism/mutation_compiler.rb#708 def visit_splat_node(node); end # Copy a StatementsNode node # - # source://prism//lib/prism/mutation_compiler.rb#710 + # source://prism//lib/prism/mutation_compiler.rb#713 def visit_statements_node(node); end # Copy a StringNode node # - # source://prism//lib/prism/mutation_compiler.rb#715 + # source://prism//lib/prism/mutation_compiler.rb#718 def visit_string_node(node); end # Copy a SuperNode node # - # source://prism//lib/prism/mutation_compiler.rb#720 + # source://prism//lib/prism/mutation_compiler.rb#723 def visit_super_node(node); end # Copy a SymbolNode node # - # source://prism//lib/prism/mutation_compiler.rb#725 + # source://prism//lib/prism/mutation_compiler.rb#728 def visit_symbol_node(node); end # Copy a TrueNode node # - # source://prism//lib/prism/mutation_compiler.rb#730 + # source://prism//lib/prism/mutation_compiler.rb#733 def visit_true_node(node); end # Copy a UndefNode node # - # source://prism//lib/prism/mutation_compiler.rb#735 + # source://prism//lib/prism/mutation_compiler.rb#738 def visit_undef_node(node); end # Copy a UnlessNode node # - # source://prism//lib/prism/mutation_compiler.rb#740 + # source://prism//lib/prism/mutation_compiler.rb#743 def visit_unless_node(node); end # Copy a UntilNode node # - # source://prism//lib/prism/mutation_compiler.rb#745 + # source://prism//lib/prism/mutation_compiler.rb#748 def visit_until_node(node); end # Copy a WhenNode node # - # source://prism//lib/prism/mutation_compiler.rb#750 + # source://prism//lib/prism/mutation_compiler.rb#753 def visit_when_node(node); end # Copy a WhileNode node # - # source://prism//lib/prism/mutation_compiler.rb#755 + # source://prism//lib/prism/mutation_compiler.rb#758 def visit_while_node(node); end # Copy a XStringNode node # - # source://prism//lib/prism/mutation_compiler.rb#760 + # source://prism//lib/prism/mutation_compiler.rb#763 def visit_x_string_node(node); end # Copy a YieldNode node # - # source://prism//lib/prism/mutation_compiler.rb#765 + # source://prism//lib/prism/mutation_compiler.rb#768 def visit_yield_node(node); end end @@ -26368,13 +26394,13 @@ end # next 1 # ^^^^^^ # -# source://prism//lib/prism/node.rb#13389 +# source://prism//lib/prism/node.rb#13542 class Prism::NextNode < ::Prism::Node # Initialize a new NextNode node. # # @return [NextNode] a new instance of NextNode # - # source://prism//lib/prism/node.rb#13391 + # source://prism//lib/prism/node.rb#13544 sig do params( source: Prism::Source, @@ -26390,42 +26416,42 @@ class Prism::NextNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13473 + # source://prism//lib/prism/node.rb#13626 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13401 + # source://prism//lib/prism/node.rb#13554 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#13436 + # source://prism//lib/prism/node.rb#13589 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13406 + # source://prism//lib/prism/node.rb#13559 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13418 + # source://prism//lib/prism/node.rb#13571 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13411 + # source://prism//lib/prism/node.rb#13564 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?arguments: ArgumentsNode?, ?keyword_loc: Location) -> NextNode # - # source://prism//lib/prism/node.rb#13423 + # source://prism//lib/prism/node.rb#13576 sig do params( node_id: Integer, @@ -26437,16 +26463,16 @@ class Prism::NextNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), arguments: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13428 + # source://prism//lib/prism/node.rb#13581 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, arguments: ArgumentsNode?, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#13431 + # source://prism//lib/prism/node.rb#13584 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -26455,38 +26481,38 @@ class Prism::NextNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13457 + # source://prism//lib/prism/node.rb#13610 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#13452 + # source://prism//lib/prism/node.rb#13605 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#13439 + # source://prism//lib/prism/node.rb#13592 sig { returns(Prism::Location) } def keyword_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13447 + # source://prism//lib/prism/node.rb#13600 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13462 + # source://prism//lib/prism/node.rb#13615 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13467 + # source://prism//lib/prism/node.rb#13620 def type; end end end @@ -26496,62 +26522,62 @@ end # nil # ^^^ # -# source://prism//lib/prism/node.rb#13484 +# source://prism//lib/prism/node.rb#13637 class Prism::NilNode < ::Prism::Node # Initialize a new NilNode node. # # @return [NilNode] a new instance of NilNode # - # source://prism//lib/prism/node.rb#13486 + # source://prism//lib/prism/node.rb#13639 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13543 + # source://prism//lib/prism/node.rb#13696 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13494 + # source://prism//lib/prism/node.rb#13647 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13499 + # source://prism//lib/prism/node.rb#13652 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13509 + # source://prism//lib/prism/node.rb#13662 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13504 + # source://prism//lib/prism/node.rb#13657 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> NilNode # - # source://prism//lib/prism/node.rb#13514 + # source://prism//lib/prism/node.rb#13667 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::NilNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13519 + # source://prism//lib/prism/node.rb#13672 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#13522 + # source://prism//lib/prism/node.rb#13675 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -26560,20 +26586,20 @@ class Prism::NilNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13527 + # source://prism//lib/prism/node.rb#13680 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13532 + # source://prism//lib/prism/node.rb#13685 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13537 + # source://prism//lib/prism/node.rb#13690 def type; end end end @@ -26584,13 +26610,13 @@ end # ^^^^^ # end # -# source://prism//lib/prism/node.rb#13553 +# source://prism//lib/prism/node.rb#13706 class Prism::NoKeywordsParameterNode < ::Prism::Node # Initialize a new NoKeywordsParameterNode node. # # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode # - # source://prism//lib/prism/node.rb#13555 + # source://prism//lib/prism/node.rb#13708 sig do params( source: Prism::Source, @@ -26606,36 +26632,36 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13650 + # source://prism//lib/prism/node.rb#13803 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13565 + # source://prism//lib/prism/node.rb#13718 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13570 + # source://prism//lib/prism/node.rb#13723 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13580 + # source://prism//lib/prism/node.rb#13733 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13575 + # source://prism//lib/prism/node.rb#13728 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?keyword_loc: Location) -> NoKeywordsParameterNode # - # source://prism//lib/prism/node.rb#13585 + # source://prism//lib/prism/node.rb#13738 sig do params( node_id: Integer, @@ -26647,16 +26673,16 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), operator_loc: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13590 + # source://prism//lib/prism/node.rb#13743 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, keyword_loc: Location } # - # source://prism//lib/prism/node.rb#13593 + # source://prism//lib/prism/node.rb#13746 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -26665,56 +26691,56 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13634 + # source://prism//lib/prism/node.rb#13787 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#13629 + # source://prism//lib/prism/node.rb#13782 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#13611 + # source://prism//lib/prism/node.rb#13764 sig { returns(Prism::Location) } def keyword_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13624 + # source://prism//lib/prism/node.rb#13777 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#13598 + # source://prism//lib/prism/node.rb#13751 sig { returns(Prism::Location) } def operator_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13619 + # source://prism//lib/prism/node.rb#13772 def save_keyword_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13606 + # source://prism//lib/prism/node.rb#13759 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13639 + # source://prism//lib/prism/node.rb#13792 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13644 + # source://prism//lib/prism/node.rb#13797 def type; end end end @@ -26722,7 +26748,7 @@ end # This represents a node in the tree. It is the parent class of all of the # various node types. # -# source://prism//lib/prism/node.rb#12 +# source://prism//lib/prism/node.rb#15 class Prism::Node abstract! @@ -26730,7 +26756,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#258 + # source://prism//lib/prism/node.rb#261 sig { abstract.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -26740,32 +26766,32 @@ class Prism::Node # # node.breadth_first_search { |node| node.node_id == node_id } # - # source://prism//lib/prism/node.rb#228 + # source://prism//lib/prism/node.rb#231 sig { params(block: T.proc.params(node: Prism::Node).returns(T::Boolean)).returns(T.nilable(Prism::Node)) } def breadth_first_search(&block); end # Delegates to the cached_end_code_units_column of the associated location # object. # - # source://prism//lib/prism/node.rb#115 + # source://prism//lib/prism/node.rb#118 def cached_end_code_units_column(cache); end # Delegates to the cached_end_code_units_offset of the associated location # object. # - # source://prism//lib/prism/node.rb#83 + # source://prism//lib/prism/node.rb#86 def cached_end_code_units_offset(cache); end # Delegates to the cached_start_code_units_column of the associated location # object. # - # source://prism//lib/prism/node.rb#109 + # source://prism//lib/prism/node.rb#112 def cached_start_code_units_column(cache); end # Delegates to the cached_start_code_units_offset of the associated location # object. # - # source://prism//lib/prism/node.rb#77 + # source://prism//lib/prism/node.rb#80 def cached_start_code_units_offset(cache); end # Returns an array of child nodes, including `nil`s in the place of optional @@ -26773,7 +26799,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#264 + # source://prism//lib/prism/node.rb#267 sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end @@ -26782,13 +26808,13 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#278 + # source://prism//lib/prism/node.rb#281 sig { abstract.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # Delegates to the comments of the associated location object. # - # source://prism//lib/prism/node.rb#130 + # source://prism//lib/prism/node.rb#133 def comments; end # Returns an array of child nodes, excluding any `nil`s in the place of @@ -26796,7 +26822,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#272 + # source://prism//lib/prism/node.rb#275 sig { abstract.returns(T::Array[Prism::Node]) } def compact_child_nodes; end @@ -26805,37 +26831,37 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#268 + # source://prism//lib/prism/node.rb#271 sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # source://prism//lib/prism/node_ext.rb#7 + # source://prism//lib/prism/node_ext.rb#10 def deprecated(*replacements); end # Delegates to the end_character_column of the associated location object. # - # source://prism//lib/prism/node.rb#103 + # source://prism//lib/prism/node.rb#106 def end_character_column; end # Delegates to the end_character_offset of the associated location object. # - # source://prism//lib/prism/node.rb#71 + # source://prism//lib/prism/node.rb#74 def end_character_offset; end # Delegates to the end_column of the associated location object. # - # source://prism//lib/prism/node.rb#93 + # source://prism//lib/prism/node.rb#96 def end_column; end # Delegates to the end_line of the associated location object. # - # source://prism//lib/prism/node.rb#47 + # source://prism//lib/prism/node.rb#50 def end_line; end # The end offset of the node in the source. This method is effectively a # delegate method to the location object. # - # source://prism//lib/prism/node.rb#60 + # source://prism//lib/prism/node.rb#63 sig { returns(Integer) } def end_offset; end @@ -26846,19 +26872,19 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#283 + # source://prism//lib/prism/node.rb#286 sig { abstract.returns(String) } def inspect; end # Delegates to the leading_comments of the associated location object. # - # source://prism//lib/prism/node.rb#120 + # source://prism//lib/prism/node.rb#123 def leading_comments; end # A Location instance that represents the location of this node in the # source. # - # source://prism//lib/prism/node.rb#30 + # source://prism//lib/prism/node.rb#33 sig { returns(Prism::Location) } def location; end @@ -26866,16 +26892,16 @@ class Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#161 + # source://prism//lib/prism/node.rb#164 sig { returns(T::Boolean) } def newline?; end - # source://prism//lib/prism/parse_result/newlines.rb#69 + # source://prism//lib/prism/parse_result/newlines.rb#70 def newline_flag!(lines); end # @return [Boolean] # - # source://prism//lib/prism/parse_result/newlines.rb#65 + # source://prism//lib/prism/parse_result/newlines.rb#66 def newline_flag?; end # A unique identifier for this node. This is used in a very specific @@ -26883,38 +26909,38 @@ class Prism::Node # having to keep around the syntax tree in memory. This unique identifier # will be consistent across multiple parses of the same source code. # - # source://prism//lib/prism/node.rb#21 + # source://prism//lib/prism/node.rb#24 sig { returns(Integer) } def node_id; end # Similar to inspect, but respects the current level of indentation given by # the pretty print object. # - # source://prism//lib/prism/node.rb#172 + # source://prism//lib/prism/node.rb#175 sig { params(q: T.untyped).void } def pretty_print(q); end # Save this node using a saved source so that it can be retrieved later. # - # source://prism//lib/prism/node.rb#24 + # source://prism//lib/prism/node.rb#27 def save(repository); end # Save the location using a saved source so that it can be retrieved later. # - # source://prism//lib/prism/node.rb#37 + # source://prism//lib/prism/node.rb#40 def save_location(repository); end # Returns all of the lines of the source code associated with this node. # An alias for source_lines, used to mimic the API from # RubyVM::AbstractSyntaxTree to make it easier to migrate. # - # source://prism//lib/prism/node.rb#141 + # source://prism//lib/prism/node.rb#144 sig { returns(T::Array[String]) } def script_lines; end # Slice the location of the node from the source. # - # source://prism//lib/prism/node.rb#144 + # source://prism//lib/prism/node.rb#147 sig { returns(String) } def slice; end @@ -26922,40 +26948,40 @@ class Prism::Node # of the line that the location starts on, ending at the end of the line # that the location ends on. # - # source://prism//lib/prism/node.rb#151 + # source://prism//lib/prism/node.rb#154 sig { returns(String) } def slice_lines; end # Returns all of the lines of the source code associated with this node. # - # source://prism//lib/prism/node.rb#135 + # source://prism//lib/prism/node.rb#138 sig { returns(T::Array[String]) } def source_lines; end # Delegates to the start_character_column of the associated location object. # - # source://prism//lib/prism/node.rb#98 + # source://prism//lib/prism/node.rb#101 def start_character_column; end # Delegates to the start_character_offset of the associated location object. # - # source://prism//lib/prism/node.rb#66 + # source://prism//lib/prism/node.rb#69 def start_character_offset; end # Delegates to the start_column of the associated location object. # - # source://prism//lib/prism/node.rb#88 + # source://prism//lib/prism/node.rb#91 def start_column; end # Delegates to the start_line of the associated location object. # - # source://prism//lib/prism/node.rb#42 + # source://prism//lib/prism/node.rb#45 def start_line; end # The start offset of the node in the source. This method is effectively a # delegate method to the location object. # - # source://prism//lib/prism/node.rb#53 + # source://prism//lib/prism/node.rb#56 sig { returns(Integer) } def start_offset; end @@ -26963,19 +26989,19 @@ class Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#166 + # source://prism//lib/prism/node.rb#169 sig { returns(T::Boolean) } def static_literal?; end # Convert this node into a graphviz dot graph string. # - # source://prism//lib/prism/node.rb#180 + # source://prism//lib/prism/node.rb#183 sig { returns(String) } def to_dot; end # Delegates to the trailing_comments of the associated location object. # - # source://prism//lib/prism/node.rb#125 + # source://prism//lib/prism/node.rb#128 def trailing_comments; end # Returns a list of nodes that are descendants of this node that contain the @@ -26985,7 +27011,7 @@ class Prism::Node # Important to note is that the column given to this method should be in # bytes, as opposed to characters or code units. # - # source://prism//lib/prism/node.rb#191 + # source://prism//lib/prism/node.rb#194 sig { params(line: Integer, column: Integer).returns(T::Array[Prism::Node]) } def tunnel(line, column); end @@ -27004,7 +27030,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#299 + # source://prism//lib/prism/node.rb#302 sig { abstract.returns(Symbol) } def type; end @@ -27013,7 +27039,7 @@ class Prism::Node # An bitset of flags for this node. There are certain flags that are common # for all nodes, and then some nodes have specific flags. # - # source://prism//lib/prism/node.rb#157 + # source://prism//lib/prism/node.rb#160 sig { returns(Integer) } def flags; end @@ -27021,7 +27047,7 @@ class Prism::Node # A pointer to the source that this node was created from. # - # source://prism//lib/prism/node.rb#14 + # source://prism//lib/prism/node.rb#17 sig { returns(Prism::Source) } def source; end @@ -27032,7 +27058,7 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#242 + # source://prism//lib/prism/node.rb#245 def fields; end # Similar to #type, this method returns a symbol that you can use for @@ -27042,26 +27068,26 @@ class Prism::Node # # @raise [NoMethodError] # - # source://prism//lib/prism/node.rb#307 + # source://prism//lib/prism/node.rb#310 def type; end end end # The flags that are common to all nodes. # -# source://prism//lib/prism/node.rb#18636 +# source://prism//lib/prism/node.rb#18807 module Prism::NodeFlags; end # A flag to indicate that the node is a candidate to emit a :line event # through tracepoint when compiled. # -# source://prism//lib/prism/node.rb#18639 +# source://prism//lib/prism/node.rb#18810 Prism::NodeFlags::NEWLINE = T.let(T.unsafe(nil), Integer) # A flag to indicate that the value that the node represents is a value that # can be determined at parse-time. # -# source://prism//lib/prism/node.rb#18643 +# source://prism//lib/prism/node.rb#18814 Prism::NodeFlags::STATIC_LITERAL = T.let(T.unsafe(nil), Integer) # Represents an implicit set of parameters through the use of numbered parameters within a block or lambda. @@ -27069,13 +27095,13 @@ Prism::NodeFlags::STATIC_LITERAL = T.let(T.unsafe(nil), Integer) # -> { _1 + _2 } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13661 +# source://prism//lib/prism/node.rb#13814 class Prism::NumberedParametersNode < ::Prism::Node # Initialize a new NumberedParametersNode node. # # @return [NumberedParametersNode] a new instance of NumberedParametersNode # - # source://prism//lib/prism/node.rb#13663 + # source://prism//lib/prism/node.rb#13816 sig do params( source: Prism::Source, @@ -27090,36 +27116,36 @@ class Prism::NumberedParametersNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13724 + # source://prism//lib/prism/node.rb#13877 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13672 + # source://prism//lib/prism/node.rb#13825 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13677 + # source://prism//lib/prism/node.rb#13830 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13687 + # source://prism//lib/prism/node.rb#13840 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13682 + # source://prism//lib/prism/node.rb#13835 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?maximum: Integer) -> NumberedParametersNode # - # source://prism//lib/prism/node.rb#13692 + # source://prism//lib/prism/node.rb#13845 sig do params( node_id: Integer, @@ -27130,16 +27156,16 @@ class Prism::NumberedParametersNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), maximum: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13697 + # source://prism//lib/prism/node.rb#13850 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, maximum: Integer } # - # source://prism//lib/prism/node.rb#13700 + # source://prism//lib/prism/node.rb#13853 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27148,26 +27174,26 @@ class Prism::NumberedParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13708 + # source://prism//lib/prism/node.rb#13861 sig { override.returns(String) } def inspect; end # attr_reader maximum: Integer # - # source://prism//lib/prism/node.rb#13705 + # source://prism//lib/prism/node.rb#13858 sig { returns(Integer) } def maximum; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13713 + # source://prism//lib/prism/node.rb#13866 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13718 + # source://prism//lib/prism/node.rb#13871 def type; end end end @@ -27177,13 +27203,13 @@ end # $1 # ^^ # -# source://prism//lib/prism/node.rb#13734 +# source://prism//lib/prism/node.rb#13887 class Prism::NumberedReferenceReadNode < ::Prism::Node # Initialize a new NumberedReferenceReadNode node. # # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode # - # source://prism//lib/prism/node.rb#13736 + # source://prism//lib/prism/node.rb#13889 sig do params( source: Prism::Source, @@ -27198,36 +27224,36 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13803 + # source://prism//lib/prism/node.rb#13956 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13745 + # source://prism//lib/prism/node.rb#13898 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13750 + # source://prism//lib/prism/node.rb#13903 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13760 + # source://prism//lib/prism/node.rb#13913 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13755 + # source://prism//lib/prism/node.rb#13908 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?number: Integer) -> NumberedReferenceReadNode # - # source://prism//lib/prism/node.rb#13765 + # source://prism//lib/prism/node.rb#13918 sig do params( node_id: Integer, @@ -27238,16 +27264,16 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), number: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13770 + # source://prism//lib/prism/node.rb#13923 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, number: Integer } # - # source://prism//lib/prism/node.rb#13773 + # source://prism//lib/prism/node.rb#13926 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27256,7 +27282,7 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13787 + # source://prism//lib/prism/node.rb#13940 sig { override.returns(String) } def inspect; end @@ -27268,20 +27294,20 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # $4294967296 # number `0` # - # source://prism//lib/prism/node.rb#13784 + # source://prism//lib/prism/node.rb#13937 sig { returns(Integer) } def number; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13792 + # source://prism//lib/prism/node.rb#13945 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13797 + # source://prism//lib/prism/node.rb#13950 def type; end end end @@ -27292,13 +27318,13 @@ end # ^^^^ # end # -# source://prism//lib/prism/node.rb#13814 +# source://prism//lib/prism/node.rb#13967 class Prism::OptionalKeywordParameterNode < ::Prism::Node # Initialize a new OptionalKeywordParameterNode node. # # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode # - # source://prism//lib/prism/node.rb#13816 + # source://prism//lib/prism/node.rb#13969 sig do params( source: Prism::Source, @@ -27315,36 +27341,36 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#13900 + # source://prism//lib/prism/node.rb#14053 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13827 + # source://prism//lib/prism/node.rb#13980 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13832 + # source://prism//lib/prism/node.rb#13985 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13842 + # source://prism//lib/prism/node.rb#13995 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13837 + # source://prism//lib/prism/node.rb#13990 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node) -> OptionalKeywordParameterNode # - # source://prism//lib/prism/node.rb#13847 + # source://prism//lib/prism/node.rb#14000 sig do params( node_id: Integer, @@ -27357,16 +27383,16 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13852 + # source://prism//lib/prism/node.rb#14005 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#13855 + # source://prism//lib/prism/node.rb#14008 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27375,19 +27401,19 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#13884 + # source://prism//lib/prism/node.rb#14037 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13865 + # source://prism//lib/prism/node.rb#14018 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#13868 + # source://prism//lib/prism/node.rb#14021 sig { returns(Prism::Location) } def name_loc; end @@ -27395,32 +27421,32 @@ class Prism::OptionalKeywordParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#13860 + # source://prism//lib/prism/node.rb#14013 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13876 + # source://prism//lib/prism/node.rb#14029 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#13889 + # source://prism//lib/prism/node.rb#14042 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#13881 + # source://prism//lib/prism/node.rb#14034 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#13894 + # source://prism//lib/prism/node.rb#14047 def type; end end end @@ -27431,13 +27457,13 @@ end # ^^^^^ # end # -# source://prism//lib/prism/node.rb#13914 +# source://prism//lib/prism/node.rb#14067 class Prism::OptionalParameterNode < ::Prism::Node # Initialize a new OptionalParameterNode node. # # @return [OptionalParameterNode] a new instance of OptionalParameterNode # - # source://prism//lib/prism/node.rb#13916 + # source://prism//lib/prism/node.rb#14069 sig do params( source: Prism::Source, @@ -27455,36 +27481,36 @@ class Prism::OptionalParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14019 + # source://prism//lib/prism/node.rb#14172 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13928 + # source://prism//lib/prism/node.rb#14081 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13933 + # source://prism//lib/prism/node.rb#14086 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#13943 + # source://prism//lib/prism/node.rb#14096 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#13938 + # source://prism//lib/prism/node.rb#14091 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node) -> OptionalParameterNode # - # source://prism//lib/prism/node.rb#13948 + # source://prism//lib/prism/node.rb#14101 sig do params( node_id: Integer, @@ -27498,16 +27524,16 @@ class Prism::OptionalParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#13953 + # source://prism//lib/prism/node.rb#14106 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node } # - # source://prism//lib/prism/node.rb#13956 + # source://prism//lib/prism/node.rb#14109 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27516,31 +27542,31 @@ class Prism::OptionalParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14003 + # source://prism//lib/prism/node.rb#14156 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13966 + # source://prism//lib/prism/node.rb#14119 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#13969 + # source://prism//lib/prism/node.rb#14122 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13998 + # source://prism//lib/prism/node.rb#14151 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#13982 + # source://prism//lib/prism/node.rb#14135 sig { returns(Prism::Location) } def operator_loc; end @@ -27548,38 +27574,38 @@ class Prism::OptionalParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#13961 + # source://prism//lib/prism/node.rb#14114 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13977 + # source://prism//lib/prism/node.rb#14130 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#13990 + # source://prism//lib/prism/node.rb#14143 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14008 + # source://prism//lib/prism/node.rb#14161 sig { override.returns(Symbol) } def type; end # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#13995 + # source://prism//lib/prism/node.rb#14148 sig { returns(Prism::Node) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14013 + # source://prism//lib/prism/node.rb#14166 def type; end end end @@ -27589,13 +27615,13 @@ end # left or right # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14033 +# source://prism//lib/prism/node.rb#14186 class Prism::OrNode < ::Prism::Node # Initialize a new OrNode node. # # @return [OrNode] a new instance of OrNode # - # source://prism//lib/prism/node.rb#14035 + # source://prism//lib/prism/node.rb#14188 sig do params( source: Prism::Source, @@ -27612,36 +27638,36 @@ class Prism::OrNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14134 + # source://prism//lib/prism/node.rb#14287 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14046 + # source://prism//lib/prism/node.rb#14199 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14051 + # source://prism//lib/prism/node.rb#14204 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14061 + # source://prism//lib/prism/node.rb#14214 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14056 + # source://prism//lib/prism/node.rb#14209 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node, ?right: Prism::node, ?operator_loc: Location) -> OrNode # - # source://prism//lib/prism/node.rb#14066 + # source://prism//lib/prism/node.rb#14219 sig do params( node_id: Integer, @@ -27654,16 +27680,16 @@ class Prism::OrNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14071 + # source://prism//lib/prism/node.rb#14224 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node, right: Prism::node, operator_loc: Location } # - # source://prism//lib/prism/node.rb#14074 + # source://prism//lib/prism/node.rb#14227 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -27672,7 +27698,7 @@ class Prism::OrNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14118 + # source://prism//lib/prism/node.rb#14271 sig { override.returns(String) } def inspect; end @@ -27684,13 +27710,13 @@ class Prism::OrNode < ::Prism::Node # 1 || 2 # ^ # - # source://prism//lib/prism/node.rb#14085 + # source://prism//lib/prism/node.rb#14238 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14113 + # source://prism//lib/prism/node.rb#14266 sig { returns(String) } def operator; end @@ -27699,7 +27725,7 @@ class Prism::OrNode < ::Prism::Node # left or right # ^^ # - # source://prism//lib/prism/node.rb#14100 + # source://prism//lib/prism/node.rb#14253 sig { returns(Prism::Location) } def operator_loc; end @@ -27711,281 +27737,281 @@ class Prism::OrNode < ::Prism::Node # 1 or 2 # ^ # - # source://prism//lib/prism/node.rb#14094 + # source://prism//lib/prism/node.rb#14247 sig { returns(Prism::Node) } def right; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14108 + # source://prism//lib/prism/node.rb#14261 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14123 + # source://prism//lib/prism/node.rb#14276 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14128 + # source://prism//lib/prism/node.rb#14281 def type; end end end # A parser for the pack template language. # -# source://prism//lib/prism/pack.rb#6 +# source://prism//lib/prism/pack.rb#8 module Prism::Pack class << self - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def parse(_arg0, _arg1, _arg2); end end end -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::BER = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol) # A directive in the pack template language. # -# source://prism//lib/prism/pack.rb#60 +# source://prism//lib/prism/pack.rb#62 class Prism::Pack::Directive # Initialize a new directive with the given values. # # @return [Directive] a new instance of Directive # - # source://prism//lib/prism/pack.rb#89 + # source://prism//lib/prism/pack.rb#91 def initialize(version, variant, source, type, signed, endian, size, length_type, length); end # Provide a human-readable description of the directive. # - # source://prism//lib/prism/pack.rb#131 + # source://prism//lib/prism/pack.rb#133 def describe; end # The type of endianness of the directive. # - # source://prism//lib/prism/pack.rb#77 + # source://prism//lib/prism/pack.rb#79 def endian; end # The length of this directive (used for integers). # - # source://prism//lib/prism/pack.rb#86 + # source://prism//lib/prism/pack.rb#88 def length; end # The length type of this directive (used for integers). # - # source://prism//lib/prism/pack.rb#83 + # source://prism//lib/prism/pack.rb#85 def length_type; end # The type of signedness of the directive. # - # source://prism//lib/prism/pack.rb#74 + # source://prism//lib/prism/pack.rb#76 def signed; end # The size of the directive. # - # source://prism//lib/prism/pack.rb#80 + # source://prism//lib/prism/pack.rb#82 def size; end # A byteslice of the source string that this directive represents. # - # source://prism//lib/prism/pack.rb#68 + # source://prism//lib/prism/pack.rb#70 def source; end # The type of the directive. # - # source://prism//lib/prism/pack.rb#71 + # source://prism//lib/prism/pack.rb#73 def type; end # A symbol representing whether or not we are packing or unpacking. # - # source://prism//lib/prism/pack.rb#65 + # source://prism//lib/prism/pack.rb#67 def variant; end # A symbol representing the version of Ruby. # - # source://prism//lib/prism/pack.rb#62 + # source://prism//lib/prism/pack.rb#64 def version; end end # The descriptions of the various types of endianness. # -# source://prism//lib/prism/pack.rb#102 +# source://prism//lib/prism/pack.rb#104 Prism::Pack::Directive::ENDIAN_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) # The descriptions of the various types of signedness. # -# source://prism//lib/prism/pack.rb#111 +# source://prism//lib/prism/pack.rb#113 Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) # The descriptions of the various types of sizes. # -# source://prism//lib/prism/pack.rb#118 +# source://prism//lib/prism/pack.rb#120 Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol) # The result of parsing a pack template. # -# source://prism//lib/prism/pack.rb#198 +# source://prism//lib/prism/pack.rb#200 class Prism::Pack::Format # Create a new Format with the given directives and encoding. # # @return [Format] a new instance of Format # - # source://prism//lib/prism/pack.rb#206 + # source://prism//lib/prism/pack.rb#208 def initialize(directives, encoding); end # Provide a human-readable description of the format. # - # source://prism//lib/prism/pack.rb#212 + # source://prism//lib/prism/pack.rb#214 def describe; end # A list of the directives in the template. # - # source://prism//lib/prism/pack.rb#200 + # source://prism//lib/prism/pack.rb#202 def directives; end # The encoding of the template. # - # source://prism//lib/prism/pack.rb#203 + # source://prism//lib/prism/pack.rb#205 def encoding; end end -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol) -# source://prism//lib/prism/pack.rb#56 +# source://prism//lib/prism/pack.rb#58 Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) # Flags for parameter nodes. # -# source://prism//lib/prism/node.rb#18543 +# source://prism//lib/prism/node.rb#18714 module Prism::ParameterFlags; end # a parameter name that has been repeated in the method signature # -# source://prism//lib/prism/node.rb#18545 +# source://prism//lib/prism/node.rb#18716 Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) # Represents the list of parameters on a method, block, or lambda definition. @@ -27994,13 +28020,13 @@ Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) # ^^^^^^^ # end # -# source://prism//lib/prism/node.rb#14147 +# source://prism//lib/prism/node.rb#14300 class Prism::ParametersNode < ::Prism::Node # Initialize a new ParametersNode node. # # @return [ParametersNode] a new instance of ParametersNode # - # source://prism//lib/prism/node.rb#14149 + # source://prism//lib/prism/node.rb#14302 sig do params( source: Prism::Source, @@ -28021,42 +28047,42 @@ class Prism::ParametersNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14242 + # source://prism//lib/prism/node.rb#14395 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14164 + # source://prism//lib/prism/node.rb#14317 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader block: BlockParameterNode? # - # source://prism//lib/prism/node.rb#14223 + # source://prism//lib/prism/node.rb#14376 sig { returns(T.nilable(Prism::BlockParameterNode)) } def block; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14169 + # source://prism//lib/prism/node.rb#14322 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14187 + # source://prism//lib/prism/node.rb#14340 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14174 + # source://prism//lib/prism/node.rb#14327 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?requireds: Array[RequiredParameterNode | MultiTargetNode], ?optionals: Array[OptionalParameterNode], ?rest: RestParameterNode | ImplicitRestNode | nil, ?posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], ?keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], ?keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, ?block: BlockParameterNode?) -> ParametersNode # - # source://prism//lib/prism/node.rb#14192 + # source://prism//lib/prism/node.rb#14345 sig do params( node_id: Integer, @@ -28073,16 +28099,16 @@ class Prism::ParametersNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), requireds: T.unsafe(nil), optionals: T.unsafe(nil), rest: T.unsafe(nil), posts: T.unsafe(nil), keywords: T.unsafe(nil), keyword_rest: T.unsafe(nil), block: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14197 + # source://prism//lib/prism/node.rb#14350 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, requireds: Array[RequiredParameterNode | MultiTargetNode], optionals: Array[OptionalParameterNode], rest: RestParameterNode | ImplicitRestNode | nil, posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode], keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode], keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil, block: BlockParameterNode? } # - # source://prism//lib/prism/node.rb#14200 + # source://prism//lib/prism/node.rb#14353 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28091,13 +28117,13 @@ class Prism::ParametersNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14226 + # source://prism//lib/prism/node.rb#14379 sig { override.returns(String) } def inspect; end # attr_reader keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil # - # source://prism//lib/prism/node.rb#14220 + # source://prism//lib/prism/node.rb#14373 sig do returns(T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode))) end @@ -28105,19 +28131,19 @@ class Prism::ParametersNode < ::Prism::Node # attr_reader keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode] # - # source://prism//lib/prism/node.rb#14217 + # source://prism//lib/prism/node.rb#14370 sig { returns(T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)]) } def keywords; end # attr_reader optionals: Array[OptionalParameterNode] # - # source://prism//lib/prism/node.rb#14208 + # source://prism//lib/prism/node.rb#14361 sig { returns(T::Array[Prism::OptionalParameterNode]) } def optionals; end # attr_reader posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode] # - # source://prism//lib/prism/node.rb#14214 + # source://prism//lib/prism/node.rb#14367 sig do returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)]) end @@ -28125,32 +28151,32 @@ class Prism::ParametersNode < ::Prism::Node # attr_reader requireds: Array[RequiredParameterNode | MultiTargetNode] # - # source://prism//lib/prism/node.rb#14205 + # source://prism//lib/prism/node.rb#14358 sig { returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)]) } def requireds; end # attr_reader rest: RestParameterNode | ImplicitRestNode | nil # - # source://prism//lib/prism/node.rb#14211 + # source://prism//lib/prism/node.rb#14364 sig { returns(T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode))) } def rest; end # Mirrors the Method#parameters method. # - # source://prism//lib/prism/node_ext.rb#269 + # source://prism//lib/prism/node_ext.rb#272 sig { returns(T::Array[T.any([Symbol, Symbol], [Symbol])]) } def signature; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14231 + # source://prism//lib/prism/node.rb#14384 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14236 + # source://prism//lib/prism/node.rb#14389 def type; end end end @@ -28160,13 +28186,13 @@ end # (10 + 34) # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14262 +# source://prism//lib/prism/node.rb#14415 class Prism::ParenthesesNode < ::Prism::Node # Initialize a new ParenthesesNode node. # # @return [ParenthesesNode] a new instance of ParenthesesNode # - # source://prism//lib/prism/node.rb#14264 + # source://prism//lib/prism/node.rb#14417 sig do params( source: Prism::Source, @@ -28183,54 +28209,54 @@ class Prism::ParenthesesNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14370 + # source://prism//lib/prism/node.rb#14523 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14275 + # source://prism//lib/prism/node.rb#14428 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#14315 + # source://prism//lib/prism/node.rb#14468 sig { returns(T.nilable(Prism::Node)) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14280 + # source://prism//lib/prism/node.rb#14433 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#14349 + # source://prism//lib/prism/node.rb#14502 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#14331 + # source://prism//lib/prism/node.rb#14484 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14292 + # source://prism//lib/prism/node.rb#14445 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14285 + # source://prism//lib/prism/node.rb#14438 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location) -> ParenthesesNode # - # source://prism//lib/prism/node.rb#14297 + # source://prism//lib/prism/node.rb#14450 sig do params( node_id: Integer, @@ -28243,16 +28269,16 @@ class Prism::ParenthesesNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), body: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14302 + # source://prism//lib/prism/node.rb#14455 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Prism::node?, opening_loc: Location, closing_loc: Location } # - # source://prism//lib/prism/node.rb#14305 + # source://prism//lib/prism/node.rb#14458 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -28261,7 +28287,7 @@ class Prism::ParenthesesNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14354 + # source://prism//lib/prism/node.rb#14507 sig { override.returns(String) } def inspect; end @@ -28269,120 +28295,120 @@ class Prism::ParenthesesNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#14310 + # source://prism//lib/prism/node.rb#14463 sig { returns(T::Boolean) } def multiple_statements?; end - # source://prism//lib/prism/parse_result/newlines.rb#85 + # source://prism//lib/prism/parse_result/newlines.rb#86 def newline_flag!(lines); end # def opening: () -> String # - # source://prism//lib/prism/node.rb#14344 + # source://prism//lib/prism/node.rb#14497 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#14318 + # source://prism//lib/prism/node.rb#14471 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14339 + # source://prism//lib/prism/node.rb#14492 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14326 + # source://prism//lib/prism/node.rb#14479 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14359 + # source://prism//lib/prism/node.rb#14512 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14364 + # source://prism//lib/prism/node.rb#14517 def type; end end end # Flags for parentheses nodes. # -# source://prism//lib/prism/node.rb#18549 +# source://prism//lib/prism/node.rb#18720 module Prism::ParenthesesNodeFlags; end # parentheses that contain multiple potentially void statements # -# source://prism//lib/prism/node.rb#18551 +# source://prism//lib/prism/node.rb#18722 Prism::ParenthesesNodeFlags::MULTIPLE_STATEMENTS = T.let(T.unsafe(nil), Integer) # This represents an error that was encountered during parsing. # -# source://prism//lib/prism/parse_result.rb#609 +# source://prism//lib/prism/parse_result.rb#610 class Prism::ParseError # Create a new error object with the given message and location. # # @return [ParseError] a new instance of ParseError # - # source://prism//lib/prism/parse_result.rb#624 + # source://prism//lib/prism/parse_result.rb#625 sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void } def initialize(type, message, location, level); end # Implement the hash pattern matching interface for ParseError. # - # source://prism//lib/prism/parse_result.rb#632 + # source://prism//lib/prism/parse_result.rb#633 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Returns a string representation of this error. # - # source://prism//lib/prism/parse_result.rb#637 + # source://prism//lib/prism/parse_result.rb#638 sig { returns(String) } def inspect; end # The level of this error. # - # source://prism//lib/prism/parse_result.rb#621 + # source://prism//lib/prism/parse_result.rb#622 sig { returns(Symbol) } def level; end # A Location object representing the location of this error in the source. # - # source://prism//lib/prism/parse_result.rb#618 + # source://prism//lib/prism/parse_result.rb#619 sig { returns(Prism::Location) } def location; end # The message associated with this error. # - # source://prism//lib/prism/parse_result.rb#615 + # source://prism//lib/prism/parse_result.rb#616 sig { returns(String) } def message; end # The type of error. This is an _internal_ symbol that is used for # communicating with translation layers. It is not meant to be public API. # - # source://prism//lib/prism/parse_result.rb#612 + # source://prism//lib/prism/parse_result.rb#613 sig { returns(Symbol) } def type; end end # This is a result specific to the `parse_lex` and `parse_lex_file` methods. # -# source://prism//lib/prism/parse_result.rb#798 +# source://prism//lib/prism/parse_result.rb#799 class Prism::ParseLexResult < ::Prism::Result # Create a new parse lex result object with the given values. # # @return [ParseLexResult] a new instance of ParseLexResult # - # source://prism//lib/prism/parse_result.rb#804 + # source://prism//lib/prism/parse_result.rb#805 sig do params( value: [Prism::ProgramNode, T::Array[T.untyped]], @@ -28398,27 +28424,27 @@ class Prism::ParseLexResult < ::Prism::Result # Implement the hash pattern matching interface for ParseLexResult. # - # source://prism//lib/prism/parse_result.rb#810 + # source://prism//lib/prism/parse_result.rb#811 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # A tuple of the syntax tree and the list of tokens that were parsed from # the source code. # - # source://prism//lib/prism/parse_result.rb#801 + # source://prism//lib/prism/parse_result.rb#802 sig { returns([Prism::ProgramNode, T::Array[T.untyped]]) } def value; end end # This is a result specific to the `parse` and `parse_file` methods. # -# source://prism//lib/prism/parse_result.rb#739 +# source://prism//lib/prism/parse_result.rb#740 class Prism::ParseResult < ::Prism::Result # Create a new parse result object with the given values. # # @return [ParseResult] a new instance of ParseResult # - # source://prism//lib/prism/parse_result.rb#752 + # source://prism//lib/prism/parse_result.rb#753 sig do params( value: Prism::ProgramNode, @@ -28434,30 +28460,30 @@ class Prism::ParseResult < ::Prism::Result # Attach the list of comments to their respective locations in the tree. # - # source://prism//lib/prism/parse_result.rb#763 + # source://prism//lib/prism/parse_result.rb#764 def attach_comments!; end # Implement the hash pattern matching interface for ParseResult. # - # source://prism//lib/prism/parse_result.rb#758 + # source://prism//lib/prism/parse_result.rb#759 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Returns a string representation of the syntax tree with the errors # displayed inline. # - # source://prism//lib/prism/parse_result.rb#775 + # source://prism//lib/prism/parse_result.rb#776 def errors_format; end # Walk the tree and mark nodes that are on a new line, loosely emulating # the behavior of CRuby's `:line` tracepoint event. # - # source://prism//lib/prism/parse_result.rb#769 + # source://prism//lib/prism/parse_result.rb#770 def mark_newlines!; end # The syntax tree that was parsed from the source code. # - # source://prism//lib/prism/parse_result.rb#749 + # source://prism//lib/prism/parse_result.rb#750 sig { returns(Prism::ProgramNode) } def value; end end @@ -28477,25 +28503,25 @@ end # the comment. Otherwise it will favor attaching to the nearest location # that is after the comment. # -# source://prism//lib/prism/parse_result/comments.rb#19 +# source://prism//lib/prism/parse_result/comments.rb#20 class Prism::ParseResult::Comments # Create a new Comments object that will attach comments to the given # parse result. # # @return [Comments] a new instance of Comments # - # source://prism//lib/prism/parse_result/comments.rb#86 + # source://prism//lib/prism/parse_result/comments.rb#87 def initialize(parse_result); end # Attach the comments to their respective locations in the tree by # mutating the parse result. # - # source://prism//lib/prism/parse_result/comments.rb#92 + # source://prism//lib/prism/parse_result/comments.rb#93 def attach!; end # The parse result that we are attaching comments to. # - # source://prism//lib/prism/parse_result/comments.rb#82 + # source://prism//lib/prism/parse_result/comments.rb#83 def parse_result; end private @@ -28503,92 +28529,92 @@ class Prism::ParseResult::Comments # Responsible for finding the nearest targets to the given comment within # the context of the given encapsulating node. # - # source://prism//lib/prism/parse_result/comments.rb#119 + # source://prism//lib/prism/parse_result/comments.rb#120 def nearest_targets(node, comment); end end # A target for attaching comments that is based on a location field on a # node. For example, the `end` token of a ClassNode. # -# source://prism//lib/prism/parse_result/comments.rb#53 +# source://prism//lib/prism/parse_result/comments.rb#54 class Prism::ParseResult::Comments::LocationTarget # @return [LocationTarget] a new instance of LocationTarget # - # source://prism//lib/prism/parse_result/comments.rb#56 + # source://prism//lib/prism/parse_result/comments.rb#57 def initialize(location); end # @return [Boolean] # - # source://prism//lib/prism/parse_result/comments.rb#68 + # source://prism//lib/prism/parse_result/comments.rb#69 def encloses?(comment); end - # source://prism//lib/prism/parse_result/comments.rb#64 + # source://prism//lib/prism/parse_result/comments.rb#65 def end_offset; end - # source://prism//lib/prism/parse_result/comments.rb#72 + # source://prism//lib/prism/parse_result/comments.rb#73 def leading_comment(comment); end - # source://prism//lib/prism/parse_result/comments.rb#54 + # source://prism//lib/prism/parse_result/comments.rb#55 def location; end - # source://prism//lib/prism/parse_result/comments.rb#60 + # source://prism//lib/prism/parse_result/comments.rb#61 def start_offset; end - # source://prism//lib/prism/parse_result/comments.rb#76 + # source://prism//lib/prism/parse_result/comments.rb#77 def trailing_comment(comment); end end # A target for attaching comments that is based on a specific node's # location. # -# source://prism//lib/prism/parse_result/comments.rb#22 +# source://prism//lib/prism/parse_result/comments.rb#23 class Prism::ParseResult::Comments::NodeTarget # @return [NodeTarget] a new instance of NodeTarget # - # source://prism//lib/prism/parse_result/comments.rb#25 + # source://prism//lib/prism/parse_result/comments.rb#26 def initialize(node); end # @return [Boolean] # - # source://prism//lib/prism/parse_result/comments.rb#37 + # source://prism//lib/prism/parse_result/comments.rb#38 def encloses?(comment); end - # source://prism//lib/prism/parse_result/comments.rb#33 + # source://prism//lib/prism/parse_result/comments.rb#34 def end_offset; end - # source://prism//lib/prism/parse_result/comments.rb#42 + # source://prism//lib/prism/parse_result/comments.rb#43 def leading_comment(comment); end - # source://prism//lib/prism/parse_result/comments.rb#23 + # source://prism//lib/prism/parse_result/comments.rb#24 def node; end - # source://prism//lib/prism/parse_result/comments.rb#29 + # source://prism//lib/prism/parse_result/comments.rb#30 def start_offset; end - # source://prism//lib/prism/parse_result/comments.rb#46 + # source://prism//lib/prism/parse_result/comments.rb#47 def trailing_comment(comment); end end # An object to represent the set of errors on a parse result. This object # can be used to format the errors in a human-readable way. # -# source://prism//lib/prism/parse_result/errors.rb#9 +# source://prism//lib/prism/parse_result/errors.rb#10 class Prism::ParseResult::Errors # Initialize a new set of errors from the given parse result. # # @return [Errors] a new instance of Errors # - # source://prism//lib/prism/parse_result/errors.rb#14 + # source://prism//lib/prism/parse_result/errors.rb#15 def initialize(parse_result); end # Formats the errors in a human-readable way and return them as a string. # - # source://prism//lib/prism/parse_result/errors.rb#19 + # source://prism//lib/prism/parse_result/errors.rb#20 def format; end # The parse result that contains the errors. # - # source://prism//lib/prism/parse_result/errors.rb#11 + # source://prism//lib/prism/parse_result/errors.rb#12 def parse_result; end end @@ -28613,87 +28639,87 @@ end # that case. We do that to avoid storing the extra `@newline` instance # variable on every node if we don't need it. # -# source://prism//lib/prism/parse_result/newlines.rb#25 +# source://prism//lib/prism/parse_result/newlines.rb#26 class Prism::ParseResult::Newlines < ::Prism::Visitor # Create a new Newlines visitor with the given newline offsets. # # @return [Newlines] a new instance of Newlines # - # source://prism//lib/prism/parse_result/newlines.rb#27 + # source://prism//lib/prism/parse_result/newlines.rb#28 def initialize(lines); end # Permit block/lambda nodes to mark newlines within themselves. # - # source://prism//lib/prism/parse_result/newlines.rb#33 + # source://prism//lib/prism/parse_result/newlines.rb#34 def visit_block_node(node); end # Mark if/unless nodes as newlines. # - # source://prism//lib/prism/parse_result/newlines.rb#47 + # source://prism//lib/prism/parse_result/newlines.rb#48 def visit_if_node(node); end # Permit block/lambda nodes to mark newlines within themselves. # - # source://prism//lib/prism/parse_result/newlines.rb#44 + # source://prism//lib/prism/parse_result/newlines.rb#45 def visit_lambda_node(node); end # Permit statements lists to mark newlines within themselves. # - # source://prism//lib/prism/parse_result/newlines.rb#55 + # source://prism//lib/prism/parse_result/newlines.rb#56 def visit_statements_node(node); end # Mark if/unless nodes as newlines. # - # source://prism//lib/prism/parse_result/newlines.rb#52 + # source://prism//lib/prism/parse_result/newlines.rb#53 def visit_unless_node(node); end end # This represents a warning that was encountered during parsing. # -# source://prism//lib/prism/parse_result.rb#643 +# source://prism//lib/prism/parse_result.rb#644 class Prism::ParseWarning # Create a new warning object with the given message and location. # # @return [ParseWarning] a new instance of ParseWarning # - # source://prism//lib/prism/parse_result.rb#658 + # source://prism//lib/prism/parse_result.rb#659 sig { params(type: Symbol, message: String, location: Prism::Location, level: Symbol).void } def initialize(type, message, location, level); end # Implement the hash pattern matching interface for ParseWarning. # - # source://prism//lib/prism/parse_result.rb#666 + # source://prism//lib/prism/parse_result.rb#667 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Returns a string representation of this warning. # - # source://prism//lib/prism/parse_result.rb#671 + # source://prism//lib/prism/parse_result.rb#672 sig { returns(String) } def inspect; end # The level of this warning. # - # source://prism//lib/prism/parse_result.rb#655 + # source://prism//lib/prism/parse_result.rb#656 sig { returns(Symbol) } def level; end # A Location object representing the location of this warning in the source. # - # source://prism//lib/prism/parse_result.rb#652 + # source://prism//lib/prism/parse_result.rb#653 sig { returns(Prism::Location) } def location; end # The message associated with this warning. # - # source://prism//lib/prism/parse_result.rb#649 + # source://prism//lib/prism/parse_result.rb#650 sig { returns(String) } def message; end # The type of warning. This is an _internal_ symbol that is used for # communicating with translation layers. It is not meant to be public API. # - # source://prism//lib/prism/parse_result.rb#646 + # source://prism//lib/prism/parse_result.rb#647 sig { returns(Symbol) } def type; end end @@ -28732,14 +28758,14 @@ end # do not yet support) then a Prism::Pattern::CompilationError will be # raised. # -# source://prism//lib/prism/pattern.rb#37 +# source://prism//lib/prism/pattern.rb#38 class Prism::Pattern # Create a new pattern with the given query. The query should be a string # containing a Ruby pattern matching expression. # # @return [Pattern] a new instance of Pattern # - # source://prism//lib/prism/pattern.rb#63 + # source://prism//lib/prism/pattern.rb#64 def initialize(query); end # Compile the query into a callable object that can be used to match against @@ -28747,12 +28773,12 @@ class Prism::Pattern # # @raise [CompilationError] # - # source://prism//lib/prism/pattern.rb#70 + # source://prism//lib/prism/pattern.rb#71 def compile; end # The query that this pattern was initialized with. # - # source://prism//lib/prism/pattern.rb#59 + # source://prism//lib/prism/pattern.rb#60 def query; end # Scan the given node and all of its children for nodes that match the @@ -28760,7 +28786,7 @@ class Prism::Pattern # matches the pattern. If no block is given, an enumerator will be returned # that will yield each node that matches the pattern. # - # source://prism//lib/prism/pattern.rb#86 + # source://prism//lib/prism/pattern.rb#87 def scan(root); end private @@ -28768,94 +28794,94 @@ class Prism::Pattern # Shortcut for combining two procs into one that returns true if both return # true. # - # source://prism//lib/prism/pattern.rb#102 + # source://prism//lib/prism/pattern.rb#103 def combine_and(left, right); end # Shortcut for combining two procs into one that returns true if either # returns true. # - # source://prism//lib/prism/pattern.rb#108 + # source://prism//lib/prism/pattern.rb#109 def combine_or(left, right); end # in foo | bar # - # source://prism//lib/prism/pattern.rb#143 + # source://prism//lib/prism/pattern.rb#144 def compile_alternation_pattern_node(node); end # in [foo, bar, baz] # - # source://prism//lib/prism/pattern.rb#118 + # source://prism//lib/prism/pattern.rb#119 def compile_array_pattern_node(node); end # Compile a name associated with a constant. # - # source://prism//lib/prism/pattern.rb#168 + # source://prism//lib/prism/pattern.rb#169 def compile_constant_name(node, name); end # in Prism::ConstantReadNode # - # source://prism//lib/prism/pattern.rb#148 + # source://prism//lib/prism/pattern.rb#149 def compile_constant_path_node(node); end # in ConstantReadNode # in String # - # source://prism//lib/prism/pattern.rb#163 + # source://prism//lib/prism/pattern.rb#164 def compile_constant_read_node(node); end # Raise an error because the given node is not supported. # # @raise [CompilationError] # - # source://prism//lib/prism/pattern.rb#113 + # source://prism//lib/prism/pattern.rb#114 def compile_error(node); end # in InstanceVariableReadNode[name: Symbol] # in { name: Symbol } # - # source://prism//lib/prism/pattern.rb#184 + # source://prism//lib/prism/pattern.rb#185 def compile_hash_pattern_node(node); end # in nil # - # source://prism//lib/prism/pattern.rb#214 + # source://prism//lib/prism/pattern.rb#215 def compile_nil_node(node); end # Compile any kind of node. Dispatch out to the individual compilation # methods based on the type of node. # - # source://prism//lib/prism/pattern.rb#243 + # source://prism//lib/prism/pattern.rb#244 def compile_node(node); end # in /foo/ # - # source://prism//lib/prism/pattern.rb#219 + # source://prism//lib/prism/pattern.rb#220 def compile_regular_expression_node(node); end # in "" # in "foo" # - # source://prism//lib/prism/pattern.rb#227 + # source://prism//lib/prism/pattern.rb#228 def compile_string_node(node); end # in :+ # in :foo # - # source://prism//lib/prism/pattern.rb#235 + # source://prism//lib/prism/pattern.rb#236 def compile_symbol_node(node); end end # Raised when the query given to a pattern is either invalid Ruby syntax or # is using syntax that we don't yet support. # -# source://prism//lib/prism/pattern.rb#40 +# source://prism//lib/prism/pattern.rb#41 class Prism::Pattern::CompilationError < ::StandardError # Create a new CompilationError with the given representation of the node # that caused the error. # # @return [CompilationError] a new instance of CompilationError # - # source://prism//lib/prism/pattern.rb#43 + # source://prism//lib/prism/pattern.rb#44 def initialize(repr); end end @@ -28864,13 +28890,13 @@ end # foo in ^(bar) # ^^^^^^ # -# source://prism//lib/prism/node.rb#14383 +# source://prism//lib/prism/node.rb#14536 class Prism::PinnedExpressionNode < ::Prism::Node # Initialize a new PinnedExpressionNode node. # # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode # - # source://prism//lib/prism/node.rb#14385 + # source://prism//lib/prism/node.rb#14538 sig do params( source: Prism::Source, @@ -28888,36 +28914,36 @@ class Prism::PinnedExpressionNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14503 + # source://prism//lib/prism/node.rb#14668 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14397 + # source://prism//lib/prism/node.rb#14550 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14402 + # source://prism//lib/prism/node.rb#14555 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14412 + # source://prism//lib/prism/node.rb#14565 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14407 + # source://prism//lib/prism/node.rb#14560 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?operator_loc: Location, ?lparen_loc: Location, ?rparen_loc: Location) -> PinnedExpressionNode # - # source://prism//lib/prism/node.rb#14417 + # source://prism//lib/prism/node.rb#14570 sig do params( node_id: Integer, @@ -28931,22 +28957,25 @@ class Prism::PinnedExpressionNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), expression: T.unsafe(nil), operator_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14422 + # source://prism//lib/prism/node.rb#14575 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location } # - # source://prism//lib/prism/node.rb#14425 + # source://prism//lib/prism/node.rb#14578 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader expression: Prism::node + # The expression used in the pinned expression + # + # foo in ^(bar) + # ^^^ # - # source://prism//lib/prism/node.rb#14430 + # source://prism//lib/prism/node.rb#14586 sig { returns(Prism::Node) } def expression; end @@ -28955,74 +28984,83 @@ class Prism::PinnedExpressionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14487 + # source://prism//lib/prism/node.rb#14652 sig { override.returns(String) } def inspect; end # def lparen: () -> String # - # source://prism//lib/prism/node.rb#14477 + # source://prism//lib/prism/node.rb#14642 sig { returns(String) } def lparen; end - # attr_reader lparen_loc: Location + # The location of the opening parenthesis. # - # source://prism//lib/prism/node.rb#14446 + # foo in ^(bar) + # ^ + # + # source://prism//lib/prism/node.rb#14608 sig { returns(Prism::Location) } def lparen_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14472 + # source://prism//lib/prism/node.rb#14637 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `^` operator # - # source://prism//lib/prism/node.rb#14433 + # foo in ^(bar) + # ^ + # + # source://prism//lib/prism/node.rb#14592 sig { returns(Prism::Location) } def operator_loc; end # def rparen: () -> String # - # source://prism//lib/prism/node.rb#14482 + # source://prism//lib/prism/node.rb#14647 sig { returns(String) } def rparen; end - # attr_reader rparen_loc: Location + # The location of the closing parenthesis. + # + # foo in ^(bar) + # ^ # - # source://prism//lib/prism/node.rb#14459 + # source://prism//lib/prism/node.rb#14624 sig { returns(Prism::Location) } def rparen_loc; end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14454 + # source://prism//lib/prism/node.rb#14616 def save_lparen_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14441 + # source://prism//lib/prism/node.rb#14600 def save_operator_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14467 + # source://prism//lib/prism/node.rb#14632 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14492 + # source://prism//lib/prism/node.rb#14657 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14497 + # source://prism//lib/prism/node.rb#14662 def type; end end end @@ -29032,13 +29070,13 @@ end # foo in ^bar # ^^^^ # -# source://prism//lib/prism/node.rb#14516 +# source://prism//lib/prism/node.rb#14681 class Prism::PinnedVariableNode < ::Prism::Node # Initialize a new PinnedVariableNode node. # # @return [PinnedVariableNode] a new instance of PinnedVariableNode # - # source://prism//lib/prism/node.rb#14518 + # source://prism//lib/prism/node.rb#14683 sig do params( source: Prism::Source, @@ -29054,36 +29092,36 @@ class Prism::PinnedVariableNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14598 + # source://prism//lib/prism/node.rb#14769 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14528 + # source://prism//lib/prism/node.rb#14693 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14533 + # source://prism//lib/prism/node.rb#14698 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14543 + # source://prism//lib/prism/node.rb#14708 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14538 + # source://prism//lib/prism/node.rb#14703 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, ?operator_loc: Location) -> PinnedVariableNode # - # source://prism//lib/prism/node.rb#14548 + # source://prism//lib/prism/node.rb#14713 sig do params( node_id: Integer, @@ -29095,16 +29133,16 @@ class Prism::PinnedVariableNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), variable: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14553 + # source://prism//lib/prism/node.rb#14718 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode, operator_loc: Location } # - # source://prism//lib/prism/node.rb#14556 + # source://prism//lib/prism/node.rb#14721 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29113,37 +29151,43 @@ class Prism::PinnedVariableNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14582 + # source://prism//lib/prism/node.rb#14753 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#14577 + # source://prism//lib/prism/node.rb#14748 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `^` operator # - # source://prism//lib/prism/node.rb#14564 + # foo in ^bar + # ^ + # + # source://prism//lib/prism/node.rb#14735 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14572 + # source://prism//lib/prism/node.rb#14743 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14587 + # source://prism//lib/prism/node.rb#14758 sig { override.returns(Symbol) } def type; end - # attr_reader variable: LocalVariableReadNode | InstanceVariableReadNode | ClassVariableReadNode | GlobalVariableReadNode | BackReferenceReadNode | NumberedReferenceReadNode | ItLocalVariableReadNode | MissingNode + # The variable used in the pinned expression + # + # foo in ^bar + # ^^^ # - # source://prism//lib/prism/node.rb#14561 + # source://prism//lib/prism/node.rb#14729 sig do returns(T.any(Prism::LocalVariableReadNode, Prism::InstanceVariableReadNode, Prism::ClassVariableReadNode, Prism::GlobalVariableReadNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::ItLocalVariableReadNode, Prism::MissingNode)) end @@ -29152,7 +29196,7 @@ class Prism::PinnedVariableNode < ::Prism::Node class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14592 + # source://prism//lib/prism/node.rb#14763 def type; end end end @@ -29162,13 +29206,13 @@ end # END { foo } # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14609 +# source://prism//lib/prism/node.rb#14780 class Prism::PostExecutionNode < ::Prism::Node # Initialize a new PostExecutionNode node. # # @return [PostExecutionNode] a new instance of PostExecutionNode # - # source://prism//lib/prism/node.rb#14611 + # source://prism//lib/prism/node.rb#14782 sig do params( source: Prism::Source, @@ -29186,48 +29230,48 @@ class Prism::PostExecutionNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14731 + # source://prism//lib/prism/node.rb#14902 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14623 + # source://prism//lib/prism/node.rb#14794 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14628 + # source://prism//lib/prism/node.rb#14799 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#14710 + # source://prism//lib/prism/node.rb#14881 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#14687 + # source://prism//lib/prism/node.rb#14858 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14640 + # source://prism//lib/prism/node.rb#14811 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14633 + # source://prism//lib/prism/node.rb#14804 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PostExecutionNode # - # source://prism//lib/prism/node.rb#14645 + # source://prism//lib/prism/node.rb#14816 sig do params( node_id: Integer, @@ -29241,16 +29285,16 @@ class Prism::PostExecutionNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), statements: T.unsafe(nil), keyword_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14650 + # source://prism//lib/prism/node.rb#14821 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location } # - # source://prism//lib/prism/node.rb#14653 + # source://prism//lib/prism/node.rb#14824 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29259,68 +29303,68 @@ class Prism::PostExecutionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14715 + # source://prism//lib/prism/node.rb#14886 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#14700 + # source://prism//lib/prism/node.rb#14871 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#14661 + # source://prism//lib/prism/node.rb#14832 sig { returns(Prism::Location) } def keyword_loc; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#14705 + # source://prism//lib/prism/node.rb#14876 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#14674 + # source://prism//lib/prism/node.rb#14845 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14695 + # source://prism//lib/prism/node.rb#14866 def save_closing_loc(repository); end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14669 + # source://prism//lib/prism/node.rb#14840 def save_keyword_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14682 + # source://prism//lib/prism/node.rb#14853 def save_opening_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#14658 + # source://prism//lib/prism/node.rb#14829 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14720 + # source://prism//lib/prism/node.rb#14891 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14725 + # source://prism//lib/prism/node.rb#14896 def type; end end end @@ -29330,13 +29374,13 @@ end # BEGIN { foo } # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14744 +# source://prism//lib/prism/node.rb#14915 class Prism::PreExecutionNode < ::Prism::Node # Initialize a new PreExecutionNode node. # # @return [PreExecutionNode] a new instance of PreExecutionNode # - # source://prism//lib/prism/node.rb#14746 + # source://prism//lib/prism/node.rb#14917 sig do params( source: Prism::Source, @@ -29354,48 +29398,48 @@ class Prism::PreExecutionNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14866 + # source://prism//lib/prism/node.rb#15037 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14758 + # source://prism//lib/prism/node.rb#14929 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14763 + # source://prism//lib/prism/node.rb#14934 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#14845 + # source://prism//lib/prism/node.rb#15016 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#14822 + # source://prism//lib/prism/node.rb#14993 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14775 + # source://prism//lib/prism/node.rb#14946 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14768 + # source://prism//lib/prism/node.rb#14939 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location) -> PreExecutionNode # - # source://prism//lib/prism/node.rb#14780 + # source://prism//lib/prism/node.rb#14951 sig do params( node_id: Integer, @@ -29409,16 +29453,16 @@ class Prism::PreExecutionNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), statements: T.unsafe(nil), keyword_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14785 + # source://prism//lib/prism/node.rb#14956 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location } # - # source://prism//lib/prism/node.rb#14788 + # source://prism//lib/prism/node.rb#14959 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29427,81 +29471,81 @@ class Prism::PreExecutionNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14850 + # source://prism//lib/prism/node.rb#15021 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#14835 + # source://prism//lib/prism/node.rb#15006 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#14796 + # source://prism//lib/prism/node.rb#14967 sig { returns(Prism::Location) } def keyword_loc; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#14840 + # source://prism//lib/prism/node.rb#15011 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#14809 + # source://prism//lib/prism/node.rb#14980 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14830 + # source://prism//lib/prism/node.rb#15001 def save_closing_loc(repository); end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14804 + # source://prism//lib/prism/node.rb#14975 def save_keyword_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#14817 + # source://prism//lib/prism/node.rb#14988 def save_opening_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#14793 + # source://prism//lib/prism/node.rb#14964 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14855 + # source://prism//lib/prism/node.rb#15026 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14860 + # source://prism//lib/prism/node.rb#15031 def type; end end end # The top level node of any parse tree. # -# source://prism//lib/prism/node.rb#14876 +# source://prism//lib/prism/node.rb#15047 class Prism::ProgramNode < ::Prism::Node # Initialize a new ProgramNode node. # # @return [ProgramNode] a new instance of ProgramNode # - # source://prism//lib/prism/node.rb#14878 + # source://prism//lib/prism/node.rb#15049 sig do params( source: Prism::Source, @@ -29517,36 +29561,36 @@ class Prism::ProgramNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#14943 + # source://prism//lib/prism/node.rb#15114 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14888 + # source://prism//lib/prism/node.rb#15059 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14893 + # source://prism//lib/prism/node.rb#15064 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14903 + # source://prism//lib/prism/node.rb#15074 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14898 + # source://prism//lib/prism/node.rb#15069 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?statements: StatementsNode) -> ProgramNode # - # source://prism//lib/prism/node.rb#14908 + # source://prism//lib/prism/node.rb#15079 sig do params( node_id: Integer, @@ -29558,16 +29602,16 @@ class Prism::ProgramNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), statements: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14913 + # source://prism//lib/prism/node.rb#15084 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], statements: StatementsNode } # - # source://prism//lib/prism/node.rb#14916 + # source://prism//lib/prism/node.rb#15087 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29576,44 +29620,44 @@ class Prism::ProgramNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#14927 + # source://prism//lib/prism/node.rb#15098 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#14921 + # source://prism//lib/prism/node.rb#15092 sig { returns(T::Array[Symbol]) } def locals; end # attr_reader statements: StatementsNode # - # source://prism//lib/prism/node.rb#14924 + # source://prism//lib/prism/node.rb#15095 sig { returns(Prism::StatementsNode) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#14932 + # source://prism//lib/prism/node.rb#15103 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#14937 + # source://prism//lib/prism/node.rb#15108 def type; end end end # Flags for range and flip-flop nodes. # -# source://prism//lib/prism/node.rb#18555 +# source://prism//lib/prism/node.rb#18726 module Prism::RangeFlags; end # ... operator # -# source://prism//lib/prism/node.rb#18557 +# source://prism//lib/prism/node.rb#18728 Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) # Represents the use of the `..` or `...` operators. @@ -29624,13 +29668,13 @@ Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) # c if a =~ /left/ ... b =~ /right/ # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14958 +# source://prism//lib/prism/node.rb#15129 class Prism::RangeNode < ::Prism::Node # Initialize a new RangeNode node. # # @return [RangeNode] a new instance of RangeNode # - # source://prism//lib/prism/node.rb#14960 + # source://prism//lib/prism/node.rb#15131 sig do params( source: Prism::Source, @@ -29647,36 +29691,36 @@ class Prism::RangeNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15065 + # source://prism//lib/prism/node.rb#15236 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14971 + # source://prism//lib/prism/node.rb#15142 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14976 + # source://prism//lib/prism/node.rb#15147 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14989 + # source://prism//lib/prism/node.rb#15160 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#14981 + # source://prism//lib/prism/node.rb#15152 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location) -> RangeNode # - # source://prism//lib/prism/node.rb#14994 + # source://prism//lib/prism/node.rb#15165 sig do params( node_id: Integer, @@ -29689,16 +29733,16 @@ class Prism::RangeNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#14999 + # source://prism//lib/prism/node.rb#15170 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, left: Prism::node?, right: Prism::node?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#15002 + # source://prism//lib/prism/node.rb#15173 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29706,7 +29750,7 @@ class Prism::RangeNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15007 + # source://prism//lib/prism/node.rb#15178 sig { returns(T::Boolean) } def exclude_end?; end @@ -29715,7 +29759,7 @@ class Prism::RangeNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15049 + # source://prism//lib/prism/node.rb#15220 sig { override.returns(String) } def inspect; end @@ -29727,19 +29771,19 @@ class Prism::RangeNode < ::Prism::Node # hello...goodbye # ^^^^^ # - # source://prism//lib/prism/node.rb#15018 + # source://prism//lib/prism/node.rb#15189 sig { returns(T.nilable(Prism::Node)) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#15044 + # source://prism//lib/prism/node.rb#15215 sig { returns(String) } def operator; end # The location of the `..` or `...` operator. # - # source://prism//lib/prism/node.rb#15031 + # source://prism//lib/prism/node.rb#15202 sig { returns(Prism::Location) } def operator_loc; end @@ -29752,26 +29796,26 @@ class Prism::RangeNode < ::Prism::Node # ^^^ # If neither right-hand or left-hand side was included, this will be a MissingNode. # - # source://prism//lib/prism/node.rb#15028 + # source://prism//lib/prism/node.rb#15199 sig { returns(T.nilable(Prism::Node)) } def right; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15039 + # source://prism//lib/prism/node.rb#15210 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15054 + # source://prism//lib/prism/node.rb#15225 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15059 + # source://prism//lib/prism/node.rb#15230 def type; end end end @@ -29781,13 +29825,13 @@ end # 1.0r # ^^^^ # -# source://prism//lib/prism/node.rb#15078 +# source://prism//lib/prism/node.rb#15249 class Prism::RationalNode < ::Prism::Node # Initialize a new RationalNode node. # # @return [RationalNode] a new instance of RationalNode # - # source://prism//lib/prism/node.rb#15080 + # source://prism//lib/prism/node.rb#15251 sig do params( source: Prism::Source, @@ -29803,12 +29847,12 @@ class Prism::RationalNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15169 + # source://prism//lib/prism/node.rb#15340 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15090 + # source://prism//lib/prism/node.rb#15261 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -29816,31 +29860,31 @@ class Prism::RationalNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15123 + # source://prism//lib/prism/node.rb#15294 sig { returns(T::Boolean) } def binary?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15095 + # source://prism//lib/prism/node.rb#15266 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15105 + # source://prism//lib/prism/node.rb#15276 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15100 + # source://prism//lib/prism/node.rb#15271 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?numerator: Integer, ?denominator: Integer) -> RationalNode # - # source://prism//lib/prism/node.rb#15110 + # source://prism//lib/prism/node.rb#15281 sig do params( node_id: Integer, @@ -29856,20 +29900,20 @@ class Prism::RationalNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15128 + # source://prism//lib/prism/node.rb#15299 sig { returns(T::Boolean) } def decimal?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15115 + # source://prism//lib/prism/node.rb#15286 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, numerator: Integer, denominator: Integer } # - # source://prism//lib/prism/node.rb#15118 + # source://prism//lib/prism/node.rb#15289 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -29877,7 +29921,7 @@ class Prism::RationalNode < ::Prism::Node # # 1.5r # denominator 2 # - # source://prism//lib/prism/node.rb#15150 + # source://prism//lib/prism/node.rb#15321 sig { returns(Integer) } def denominator; end @@ -29888,13 +29932,13 @@ class Prism::RationalNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15138 + # source://prism//lib/prism/node.rb#15309 sig { returns(T::Boolean) } def hexadecimal?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#15153 + # source://prism//lib/prism/node.rb#15324 sig { override.returns(String) } def inspect; end @@ -29902,40 +29946,40 @@ class Prism::RationalNode < ::Prism::Node # # 1.5r # numerator 3 # - # source://prism//lib/prism/node.rb#15145 + # source://prism//lib/prism/node.rb#15316 sig { returns(Integer) } def numerator; end # Returns the value of the node as an IntegerNode or a FloatNode. This # method is deprecated in favor of #value or #numerator/#denominator. # - # source://prism//lib/prism/node_ext.rb#120 + # source://prism//lib/prism/node_ext.rb#123 def numeric; end # def octal?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15133 + # source://prism//lib/prism/node.rb#15304 sig { returns(T::Boolean) } def octal?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15158 + # source://prism//lib/prism/node.rb#15329 sig { override.returns(Symbol) } def type; end # Returns the value of the node as a Ruby Rational. # - # source://prism//lib/prism/node_ext.rb#114 + # source://prism//lib/prism/node_ext.rb#117 sig { returns(Rational) } def value; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15163 + # source://prism//lib/prism/node.rb#15334 def type; end end end @@ -29945,62 +29989,62 @@ end # redo # ^^^^ # -# source://prism//lib/prism/node.rb#15181 +# source://prism//lib/prism/node.rb#15352 class Prism::RedoNode < ::Prism::Node # Initialize a new RedoNode node. # # @return [RedoNode] a new instance of RedoNode # - # source://prism//lib/prism/node.rb#15183 + # source://prism//lib/prism/node.rb#15354 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15240 + # source://prism//lib/prism/node.rb#15411 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15191 + # source://prism//lib/prism/node.rb#15362 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15196 + # source://prism//lib/prism/node.rb#15367 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15206 + # source://prism//lib/prism/node.rb#15377 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15201 + # source://prism//lib/prism/node.rb#15372 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RedoNode # - # source://prism//lib/prism/node.rb#15211 + # source://prism//lib/prism/node.rb#15382 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RedoNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15216 + # source://prism//lib/prism/node.rb#15387 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#15219 + # source://prism//lib/prism/node.rb#15390 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30009,20 +30053,20 @@ class Prism::RedoNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15224 + # source://prism//lib/prism/node.rb#15395 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15229 + # source://prism//lib/prism/node.rb#15400 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15234 + # source://prism//lib/prism/node.rb#15405 def type; end end end @@ -30031,12 +30075,12 @@ end # the syntax tree itself, as opposed to looking at a single syntax tree. This # is useful in metaprogramming contexts. # -# source://prism//lib/prism/reflection.rb#13 +# source://prism//lib/prism/reflection.rb#16 module Prism::Reflection class << self # Returns the fields for the given node. # - # source://prism//lib/prism/reflection.rb#104 + # source://prism//lib/prism/reflection.rb#107 sig { params(node: T.class_of(Prism::Node)).returns(T::Array[Prism::Reflection::Field]) } def fields_for(node); end end @@ -30046,31 +30090,31 @@ end # represents an identifier found within the source. It resolves to a symbol # in Ruby. # -# source://prism//lib/prism/reflection.rb#45 +# source://prism//lib/prism/reflection.rb#48 class Prism::Reflection::ConstantField < ::Prism::Reflection::Field; end # A constant list field represents a list of constant values on a node. It # resolves to an array of symbols in Ruby. # -# source://prism//lib/prism/reflection.rb#55 +# source://prism//lib/prism/reflection.rb#58 class Prism::Reflection::ConstantListField < ::Prism::Reflection::Field; end # A field represents a single piece of data on a node. It is the base class # for all other field types. # -# source://prism//lib/prism/reflection.rb#16 +# source://prism//lib/prism/reflection.rb#19 class Prism::Reflection::Field # Initializes the field with the given name. # # @return [Field] a new instance of Field # - # source://prism//lib/prism/reflection.rb#21 + # source://prism//lib/prism/reflection.rb#24 sig { params(name: Symbol).void } def initialize(name); end # The name of the field. # - # source://prism//lib/prism/reflection.rb#18 + # source://prism//lib/prism/reflection.rb#21 sig { returns(Symbol) } def name; end end @@ -30080,19 +30124,19 @@ end # node because the integer is kept private. Instead, the various flags in # the bitset should be accessed through their query methods. # -# source://prism//lib/prism/reflection.rb#92 +# source://prism//lib/prism/reflection.rb#95 class Prism::Reflection::FlagsField < ::Prism::Reflection::Field # Initializes the flags field with the given name and flags. # # @return [FlagsField] a new instance of FlagsField # - # source://prism//lib/prism/reflection.rb#97 + # source://prism//lib/prism/reflection.rb#100 sig { params(name: Symbol, flags: T::Array[Symbol]).void } def initialize(name, flags); end # The names of the flags in the bitset. # - # source://prism//lib/prism/reflection.rb#94 + # source://prism//lib/prism/reflection.rb#97 sig { returns(T::Array[Symbol]) } def flags; end end @@ -30101,120 +30145,120 @@ end # used exclusively to represent the value of a floating point literal. It # resolves to a Float in Ruby. # -# source://prism//lib/prism/reflection.rb#85 +# source://prism//lib/prism/reflection.rb#88 class Prism::Reflection::FloatField < ::Prism::Reflection::Field; end # An integer field represents an integer value. It is used to represent the # value of an integer literal, the depth of local variables, and the number # of a numbered reference. It resolves to an Integer in Ruby. # -# source://prism//lib/prism/reflection.rb#79 +# source://prism//lib/prism/reflection.rb#82 class Prism::Reflection::IntegerField < ::Prism::Reflection::Field; end # A location field represents the location of some part of the node in the # source code. For example, the location of a keyword or an operator. It # resolves to a Prism::Location in Ruby. # -# source://prism//lib/prism/reflection.rb#67 +# source://prism//lib/prism/reflection.rb#70 class Prism::Reflection::LocationField < ::Prism::Reflection::Field; end # A node field represents a single child node in the syntax tree. It # resolves to a Prism::Node in Ruby. # -# source://prism//lib/prism/reflection.rb#28 +# source://prism//lib/prism/reflection.rb#31 class Prism::Reflection::NodeField < ::Prism::Reflection::Field; end # A node list field represents a list of child nodes in the syntax tree. It # resolves to an array of Prism::Node instances in Ruby. # -# source://prism//lib/prism/reflection.rb#39 +# source://prism//lib/prism/reflection.rb#42 class Prism::Reflection::NodeListField < ::Prism::Reflection::Field; end # An optional constant field represents a constant value on a node that may # or may not be present. It resolves to either a symbol or nil in Ruby. # -# source://prism//lib/prism/reflection.rb#50 +# source://prism//lib/prism/reflection.rb#53 class Prism::Reflection::OptionalConstantField < ::Prism::Reflection::Field; end # An optional location field represents the location of some part of the # node in the source code that may or may not be present. It resolves to # either a Prism::Location or nil in Ruby. # -# source://prism//lib/prism/reflection.rb#73 +# source://prism//lib/prism/reflection.rb#76 class Prism::Reflection::OptionalLocationField < ::Prism::Reflection::Field; end # An optional node field represents a single child node in the syntax tree # that may or may not be present. It resolves to either a Prism::Node or nil # in Ruby. # -# source://prism//lib/prism/reflection.rb#34 +# source://prism//lib/prism/reflection.rb#37 class Prism::Reflection::OptionalNodeField < ::Prism::Reflection::Field; end # A string field represents a string value on a node. It almost always # represents the unescaped value of a string-like literal. It resolves to a # string in Ruby. # -# source://prism//lib/prism/reflection.rb#61 +# source://prism//lib/prism/reflection.rb#64 class Prism::Reflection::StringField < ::Prism::Reflection::Field; end # Flags for regular expression and match last line nodes. # -# source://prism//lib/prism/node.rb#18561 +# source://prism//lib/prism/node.rb#18732 module Prism::RegularExpressionFlags; end # n - forces the ASCII-8BIT encoding # -# source://prism//lib/prism/node.rb#18578 +# source://prism//lib/prism/node.rb#18749 Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) # e - forces the EUC-JP encoding # -# source://prism//lib/prism/node.rb#18575 +# source://prism//lib/prism/node.rb#18746 Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer) # x - ignores whitespace and allows comments in regular expressions # -# source://prism//lib/prism/node.rb#18566 +# source://prism//lib/prism/node.rb#18737 Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#18590 +# source://prism//lib/prism/node.rb#18761 Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to US-ASCII # -# source://prism//lib/prism/node.rb#18593 +# source://prism//lib/prism/node.rb#18764 Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#18587 +# source://prism//lib/prism/node.rb#18758 Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # i - ignores the case of characters when matching # -# source://prism//lib/prism/node.rb#18563 +# source://prism//lib/prism/node.rb#18734 Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer) # m - allows $ to match the end of lines within strings # -# source://prism//lib/prism/node.rb#18569 +# source://prism//lib/prism/node.rb#18740 Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer) # o - only interpolates values into the regular expression once # -# source://prism//lib/prism/node.rb#18572 +# source://prism//lib/prism/node.rb#18743 Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) # u - forces the UTF-8 encoding # -# source://prism//lib/prism/node.rb#18584 +# source://prism//lib/prism/node.rb#18755 Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) # s - forces the Windows-31J encoding # -# source://prism//lib/prism/node.rb#18581 +# source://prism//lib/prism/node.rb#18752 Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) # Represents a regular expression literal with no interpolation. @@ -30222,7 +30266,7 @@ Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) # /foo/i # ^^^^^^ # -# source://prism//lib/prism/node.rb#15249 +# source://prism//lib/prism/node.rb#15420 class Prism::RegularExpressionNode < ::Prism::Node include ::Prism::RegularExpressionOptions @@ -30230,7 +30274,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [RegularExpressionNode] a new instance of RegularExpressionNode # - # source://prism//lib/prism/node.rb#15251 + # source://prism//lib/prism/node.rb#15422 sig do params( source: Prism::Source, @@ -30248,12 +30292,12 @@ class Prism::RegularExpressionNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15424 + # source://prism//lib/prism/node.rb#15595 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15263 + # source://prism//lib/prism/node.rb#15434 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -30261,55 +30305,55 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15321 + # source://prism//lib/prism/node.rb#15492 sig { returns(T::Boolean) } def ascii_8bit?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15268 + # source://prism//lib/prism/node.rb#15439 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#15403 + # source://prism//lib/prism/node.rb#15574 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#15377 + # source://prism//lib/prism/node.rb#15548 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15278 + # source://prism//lib/prism/node.rb#15449 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15273 + # source://prism//lib/prism/node.rb#15444 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#15398 + # source://prism//lib/prism/node.rb#15569 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#15364 + # source://prism//lib/prism/node.rb#15535 sig { returns(Prism::Location) } def content_loc; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> RegularExpressionNode # - # source://prism//lib/prism/node.rb#15283 + # source://prism//lib/prism/node.rb#15454 sig do params( node_id: Integer, @@ -30323,16 +30367,16 @@ class Prism::RegularExpressionNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15288 + # source://prism//lib/prism/node.rb#15459 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String } # - # source://prism//lib/prism/node.rb#15291 + # source://prism//lib/prism/node.rb#15462 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -30340,7 +30384,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15316 + # source://prism//lib/prism/node.rb#15487 sig { returns(T::Boolean) } def euc_jp?; end @@ -30348,7 +30392,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15301 + # source://prism//lib/prism/node.rb#15472 sig { returns(T::Boolean) } def extended?; end @@ -30359,7 +30403,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15341 + # source://prism//lib/prism/node.rb#15512 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -30367,7 +30411,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15346 + # source://prism//lib/prism/node.rb#15517 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -30375,7 +30419,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15336 + # source://prism//lib/prism/node.rb#15507 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -30383,13 +30427,13 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15296 + # source://prism//lib/prism/node.rb#15467 sig { returns(T::Boolean) } def ignore_case?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#15408 + # source://prism//lib/prism/node.rb#15579 sig { override.returns(String) } def inspect; end @@ -30397,7 +30441,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15306 + # source://prism//lib/prism/node.rb#15477 sig { returns(T::Boolean) } def multi_line?; end @@ -30405,19 +30449,19 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15311 + # source://prism//lib/prism/node.rb#15482 sig { returns(T::Boolean) } def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#15393 + # source://prism//lib/prism/node.rb#15564 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#15351 + # source://prism//lib/prism/node.rb#15522 sig { returns(Prism::Location) } def opening_loc; end @@ -30427,30 +30471,30 @@ class Prism::RegularExpressionNode < ::Prism::Node # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15385 + # source://prism//lib/prism/node.rb#15556 def save_closing_loc(repository); end # Save the content_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15372 + # source://prism//lib/prism/node.rb#15543 def save_content_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15359 + # source://prism//lib/prism/node.rb#15530 def save_opening_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15413 + # source://prism//lib/prism/node.rb#15584 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#15390 + # source://prism//lib/prism/node.rb#15561 sig { returns(String) } def unescaped; end @@ -30458,7 +30502,7 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15331 + # source://prism//lib/prism/node.rb#15502 sig { returns(T::Boolean) } def utf_8?; end @@ -30466,24 +30510,24 @@ class Prism::RegularExpressionNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15326 + # source://prism//lib/prism/node.rb#15497 sig { returns(T::Boolean) } def windows_31j?; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15418 + # source://prism//lib/prism/node.rb#15589 def type; end end end -# source://prism//lib/prism/node_ext.rb#20 +# source://prism//lib/prism/node_ext.rb#23 module Prism::RegularExpressionOptions # Returns a numeric value that represents the flags that were used to create # the regular expression. # - # source://prism//lib/prism/node_ext.rb#23 + # source://prism//lib/prism/node_ext.rb#26 def options; end end @@ -30497,276 +30541,276 @@ end # "save" nodes and locations using a minimal amount of memory (just the # node_id and a field identifier) and then reify them later. # -# source://prism//lib/prism/relocation.rb#13 +# source://prism//lib/prism/relocation.rb#14 module Prism::Relocation class << self # Create a new repository for the given filepath. # - # source://prism//lib/prism/relocation.rb#495 + # source://prism//lib/prism/relocation.rb#496 def filepath(value); end # Create a new repository for the given string. # - # source://prism//lib/prism/relocation.rb#500 + # source://prism//lib/prism/relocation.rb#501 def string(value); end end end # A field representing the start and end character columns. # -# source://prism//lib/prism/relocation.rb#269 +# source://prism//lib/prism/relocation.rb#270 class Prism::Relocation::CharacterColumnsField # Fetches the start and end character column of a value. # - # source://prism//lib/prism/relocation.rb#271 + # source://prism//lib/prism/relocation.rb#272 def fields(value); end end # A field representing the start and end character offsets. # -# source://prism//lib/prism/relocation.rb#217 +# source://prism//lib/prism/relocation.rb#218 class Prism::Relocation::CharacterOffsetsField # Fetches the start and end character offset of a value. # - # source://prism//lib/prism/relocation.rb#219 + # source://prism//lib/prism/relocation.rb#220 def fields(value); end end # A field representing the start and end code unit columns for a specific # encoding. # -# source://prism//lib/prism/relocation.rb#281 +# source://prism//lib/prism/relocation.rb#282 class Prism::Relocation::CodeUnitColumnsField # Initialize a new field with the associated repository and encoding. # # @return [CodeUnitColumnsField] a new instance of CodeUnitColumnsField # - # source://prism//lib/prism/relocation.rb#290 + # source://prism//lib/prism/relocation.rb#291 def initialize(repository, encoding); end # The associated encoding for the code units. # - # source://prism//lib/prism/relocation.rb#287 + # source://prism//lib/prism/relocation.rb#288 def encoding; end # Fetches the start and end code units column of a value for a particular # encoding. # - # source://prism//lib/prism/relocation.rb#298 + # source://prism//lib/prism/relocation.rb#299 def fields(value); end # The repository object that is used for lazily creating a code units # cache. # - # source://prism//lib/prism/relocation.rb#284 + # source://prism//lib/prism/relocation.rb#285 def repository; end private # Lazily create a code units cache for the associated encoding. # - # source://prism//lib/prism/relocation.rb#308 + # source://prism//lib/prism/relocation.rb#309 def cache; end end # A field representing the start and end code unit offsets. # -# source://prism//lib/prism/relocation.rb#228 +# source://prism//lib/prism/relocation.rb#229 class Prism::Relocation::CodeUnitOffsetsField # Initialize a new field with the associated repository and encoding. # # @return [CodeUnitOffsetsField] a new instance of CodeUnitOffsetsField # - # source://prism//lib/prism/relocation.rb#237 + # source://prism//lib/prism/relocation.rb#238 def initialize(repository, encoding); end # The associated encoding for the code units. # - # source://prism//lib/prism/relocation.rb#234 + # source://prism//lib/prism/relocation.rb#235 def encoding; end # Fetches the start and end code units offset of a value for a particular # encoding. # - # source://prism//lib/prism/relocation.rb#245 + # source://prism//lib/prism/relocation.rb#246 def fields(value); end # A pointer to the repository object that is used for lazily creating a # code units cache. # - # source://prism//lib/prism/relocation.rb#231 + # source://prism//lib/prism/relocation.rb#232 def repository; end private # Lazily create a code units cache for the associated encoding. # - # source://prism//lib/prism/relocation.rb#255 + # source://prism//lib/prism/relocation.rb#256 def cache; end end # A field representing the start and end byte columns. # -# source://prism//lib/prism/relocation.rb#261 +# source://prism//lib/prism/relocation.rb#262 class Prism::Relocation::ColumnsField # Fetches the start and end byte column of a value. # - # source://prism//lib/prism/relocation.rb#263 + # source://prism//lib/prism/relocation.rb#264 def fields(value); end end # An abstract field used as the parent class of the two comments fields. # -# source://prism//lib/prism/relocation.rb#314 +# source://prism//lib/prism/relocation.rb#315 class Prism::Relocation::CommentsField private # Create comment objects from the given values. # - # source://prism//lib/prism/relocation.rb#329 + # source://prism//lib/prism/relocation.rb#330 def comments(values); end end # An object that represents a slice of a comment. # -# source://prism//lib/prism/relocation.rb#316 +# source://prism//lib/prism/relocation.rb#317 class Prism::Relocation::CommentsField::Comment # Initialize a new comment with the given slice. # # @return [Comment] a new instance of Comment # - # source://prism//lib/prism/relocation.rb#321 + # source://prism//lib/prism/relocation.rb#322 def initialize(slice); end # The slice of the comment. # - # source://prism//lib/prism/relocation.rb#318 + # source://prism//lib/prism/relocation.rb#319 def slice; end end # An entry in a repository that will lazily reify its values when they are # first accessed. # -# source://prism//lib/prism/relocation.rb#16 +# source://prism//lib/prism/relocation.rb#17 class Prism::Relocation::Entry # Initialize a new entry with the given repository. # # @return [Entry] a new instance of Entry # - # source://prism//lib/prism/relocation.rb#24 + # source://prism//lib/prism/relocation.rb#25 def initialize(repository); end # Fetch the leading and trailing comments of the value. # - # source://prism//lib/prism/relocation.rb#119 + # source://prism//lib/prism/relocation.rb#120 def comments; end # Fetch the end character column of the value. # - # source://prism//lib/prism/relocation.rb#92 + # source://prism//lib/prism/relocation.rb#93 def end_character_column; end # Fetch the end character offset of the value. # - # source://prism//lib/prism/relocation.rb#60 + # source://prism//lib/prism/relocation.rb#61 def end_character_offset; end # Fetch the end code units column of the value, for the encoding that was # configured on the repository. # - # source://prism//lib/prism/relocation.rb#104 + # source://prism//lib/prism/relocation.rb#105 def end_code_units_column; end # Fetch the end code units offset of the value, for the encoding that was # configured on the repository. # - # source://prism//lib/prism/relocation.rb#72 + # source://prism//lib/prism/relocation.rb#73 def end_code_units_offset; end # Fetch the end byte column of the value. # - # source://prism//lib/prism/relocation.rb#82 + # source://prism//lib/prism/relocation.rb#83 def end_column; end # Fetch the end line of the value. # - # source://prism//lib/prism/relocation.rb#40 + # source://prism//lib/prism/relocation.rb#41 def end_line; end # Fetch the end byte offset of the value. # - # source://prism//lib/prism/relocation.rb#50 + # source://prism//lib/prism/relocation.rb#51 def end_offset; end # Fetch the filepath of the value. # - # source://prism//lib/prism/relocation.rb#30 + # source://prism//lib/prism/relocation.rb#31 def filepath; end # Fetch the leading comments of the value. # - # source://prism//lib/prism/relocation.rb#109 + # source://prism//lib/prism/relocation.rb#110 def leading_comments; end # Reify the values on this entry with the given values. This is an # internal-only API that is called from the repository when it is time to # reify the values. # - # source://prism//lib/prism/relocation.rb#126 + # source://prism//lib/prism/relocation.rb#127 def reify!(values); end # Fetch the start character column of the value. # - # source://prism//lib/prism/relocation.rb#87 + # source://prism//lib/prism/relocation.rb#88 def start_character_column; end # Fetch the start character offset of the value. # - # source://prism//lib/prism/relocation.rb#55 + # source://prism//lib/prism/relocation.rb#56 def start_character_offset; end # Fetch the start code units column of the value, for the encoding that # was configured on the repository. # - # source://prism//lib/prism/relocation.rb#98 + # source://prism//lib/prism/relocation.rb#99 def start_code_units_column; end # Fetch the start code units offset of the value, for the encoding that # was configured on the repository. # - # source://prism//lib/prism/relocation.rb#66 + # source://prism//lib/prism/relocation.rb#67 def start_code_units_offset; end # Fetch the start byte column of the value. # - # source://prism//lib/prism/relocation.rb#77 + # source://prism//lib/prism/relocation.rb#78 def start_column; end # Fetch the start line of the value. # - # source://prism//lib/prism/relocation.rb#35 + # source://prism//lib/prism/relocation.rb#36 def start_line; end # Fetch the start byte offset of the value. # - # source://prism//lib/prism/relocation.rb#45 + # source://prism//lib/prism/relocation.rb#46 def start_offset; end # Fetch the trailing comments of the value. # - # source://prism//lib/prism/relocation.rb#114 + # source://prism//lib/prism/relocation.rb#115 def trailing_comments; end private # Fetch a value from the entry, raising an error if it is missing. # - # source://prism//lib/prism/relocation.rb#134 + # source://prism//lib/prism/relocation.rb#135 def fetch_value(name); end # Return the values from the repository, reifying them if necessary. # - # source://prism//lib/prism/relocation.rb#142 + # source://prism//lib/prism/relocation.rb#143 def values; end end @@ -30774,170 +30818,170 @@ end # because it was either not configured on the repository or it has not yet # been fetched. # -# source://prism//lib/prism/relocation.rb#20 +# source://prism//lib/prism/relocation.rb#21 class Prism::Relocation::Entry::MissingValueError < ::StandardError; end # A field that represents the file path. # -# source://prism//lib/prism/relocation.rb#185 +# source://prism//lib/prism/relocation.rb#186 class Prism::Relocation::FilepathField # Initialize a new field with the given file path. # # @return [FilepathField] a new instance of FilepathField # - # source://prism//lib/prism/relocation.rb#190 + # source://prism//lib/prism/relocation.rb#191 def initialize(value); end # Fetch the file path. # - # source://prism//lib/prism/relocation.rb#195 + # source://prism//lib/prism/relocation.rb#196 def fields(_value); end # The file path that this field represents. # - # source://prism//lib/prism/relocation.rb#187 + # source://prism//lib/prism/relocation.rb#188 def value; end end # A field representing the leading comments. # -# source://prism//lib/prism/relocation.rb#335 +# source://prism//lib/prism/relocation.rb#336 class Prism::Relocation::LeadingCommentsField < ::Prism::Relocation::CommentsField # Fetches the leading comments of a value. # - # source://prism//lib/prism/relocation.rb#337 + # source://prism//lib/prism/relocation.rb#338 def fields(value); end end # A field representing the start and end lines. # -# source://prism//lib/prism/relocation.rb#201 +# source://prism//lib/prism/relocation.rb#202 class Prism::Relocation::LinesField # Fetches the start and end line of a value. # - # source://prism//lib/prism/relocation.rb#203 + # source://prism//lib/prism/relocation.rb#204 def fields(value); end end # A field representing the start and end byte offsets. # -# source://prism//lib/prism/relocation.rb#209 +# source://prism//lib/prism/relocation.rb#210 class Prism::Relocation::OffsetsField # Fetches the start and end byte offset of a value. # - # source://prism//lib/prism/relocation.rb#211 + # source://prism//lib/prism/relocation.rb#212 def fields(value); end end # A repository is a configured collection of fields and a set of entries # that knows how to reparse a source and reify the values. # -# source://prism//lib/prism/relocation.rb#352 +# source://prism//lib/prism/relocation.rb#353 class Prism::Relocation::Repository # Initialize a new repository with the given source. # # @return [Repository] a new instance of Repository # - # source://prism//lib/prism/relocation.rb#369 + # source://prism//lib/prism/relocation.rb#370 def initialize(source); end # Configure the character columns field for this repository and return # self. # - # source://prism//lib/prism/relocation.rb#415 + # source://prism//lib/prism/relocation.rb#416 def character_columns; end # Configure the character offsets field for this repository and return # self. # - # source://prism//lib/prism/relocation.rb#398 + # source://prism//lib/prism/relocation.rb#399 def character_offsets; end # Configure the code unit columns field for this repository for a specific # encoding and return self. # - # source://prism//lib/prism/relocation.rb#421 + # source://prism//lib/prism/relocation.rb#422 def code_unit_columns(encoding); end # Configure the code unit offsets field for this repository for a specific # encoding and return self. # - # source://prism//lib/prism/relocation.rb#404 + # source://prism//lib/prism/relocation.rb#405 def code_unit_offsets(encoding); end # Create a code units cache for the given encoding from the source. # - # source://prism//lib/prism/relocation.rb#376 + # source://prism//lib/prism/relocation.rb#377 def code_units_cache(encoding); end # Configure the columns field for this repository and return self. # - # source://prism//lib/prism/relocation.rb#409 + # source://prism//lib/prism/relocation.rb#410 def columns; end # Configure both the leading and trailing comment fields for this # repository and return self. # - # source://prism//lib/prism/relocation.rb#439 + # source://prism//lib/prism/relocation.rb#440 def comments; end # This method is called from nodes and locations when they want to enter # themselves into the repository. It it internal-only and meant to be # called from the #save* APIs. # - # source://prism//lib/prism/relocation.rb#446 + # source://prism//lib/prism/relocation.rb#447 def enter(node_id, field_name); end # The entries that have been saved on this repository. # - # source://prism//lib/prism/relocation.rb#366 + # source://prism//lib/prism/relocation.rb#367 def entries; end # The fields that have been configured on this repository. # - # source://prism//lib/prism/relocation.rb#363 + # source://prism//lib/prism/relocation.rb#364 def fields; end # Configure the filepath field for this repository and return self. # # @raise [ConfigurationError] # - # source://prism//lib/prism/relocation.rb#381 + # source://prism//lib/prism/relocation.rb#382 def filepath; end # Configure the leading comments field for this repository and return # self. # - # source://prism//lib/prism/relocation.rb#427 + # source://prism//lib/prism/relocation.rb#428 def leading_comments; end # Configure the lines field for this repository and return self. # - # source://prism//lib/prism/relocation.rb#387 + # source://prism//lib/prism/relocation.rb#388 def lines; end # Configure the offsets field for this repository and return self. # - # source://prism//lib/prism/relocation.rb#392 + # source://prism//lib/prism/relocation.rb#393 def offsets; end # This method is called from the entries in the repository when they need # to reify their values. It is internal-only and meant to be called from # the various value APIs. # - # source://prism//lib/prism/relocation.rb#455 + # source://prism//lib/prism/relocation.rb#456 def reify!; end # The source associated with this repository. This will be either a # SourceFilepath (the most common use case) or a SourceString. # - # source://prism//lib/prism/relocation.rb#360 + # source://prism//lib/prism/relocation.rb#361 def source; end # Configure the trailing comments field for this repository and return # self. # - # source://prism//lib/prism/relocation.rb#433 + # source://prism//lib/prism/relocation.rb#434 def trailing_comments; end private @@ -30947,72 +30991,72 @@ class Prism::Relocation::Repository # # @raise [ConfigurationError] # - # source://prism//lib/prism/relocation.rb#487 + # source://prism//lib/prism/relocation.rb#488 def field(name, value); end end # Raised when multiple fields of the same type are configured on the same # repository. # -# source://prism//lib/prism/relocation.rb#355 +# source://prism//lib/prism/relocation.rb#356 class Prism::Relocation::Repository::ConfigurationError < ::StandardError; end # Represents the source of a repository that will be reparsed. # -# source://prism//lib/prism/relocation.rb#148 +# source://prism//lib/prism/relocation.rb#149 class Prism::Relocation::Source # Initialize the source with the given value. # # @return [Source] a new instance of Source # - # source://prism//lib/prism/relocation.rb#153 + # source://prism//lib/prism/relocation.rb#154 def initialize(value); end # Create a code units cache for the given encoding. # - # source://prism//lib/prism/relocation.rb#163 + # source://prism//lib/prism/relocation.rb#164 def code_units_cache(encoding); end # Reparse the value and return the parse result. # # @raise [NotImplementedError] # - # source://prism//lib/prism/relocation.rb#158 + # source://prism//lib/prism/relocation.rb#159 def result; end # The value that will need to be reparsed. # - # source://prism//lib/prism/relocation.rb#150 + # source://prism//lib/prism/relocation.rb#151 def value; end end # A source that is represented by a file path. # -# source://prism//lib/prism/relocation.rb#169 +# source://prism//lib/prism/relocation.rb#170 class Prism::Relocation::SourceFilepath < ::Prism::Relocation::Source # Reparse the file and return the parse result. # - # source://prism//lib/prism/relocation.rb#171 + # source://prism//lib/prism/relocation.rb#172 def result; end end # A source that is represented by a string. # -# source://prism//lib/prism/relocation.rb#177 +# source://prism//lib/prism/relocation.rb#178 class Prism::Relocation::SourceString < ::Prism::Relocation::Source # Reparse the string and return the parse result. # - # source://prism//lib/prism/relocation.rb#179 + # source://prism//lib/prism/relocation.rb#180 def result; end end # A field representing the trailing comments. # -# source://prism//lib/prism/relocation.rb#343 +# source://prism//lib/prism/relocation.rb#344 class Prism::Relocation::TrailingCommentsField < ::Prism::Relocation::CommentsField # Fetches the trailing comments of a value. # - # source://prism//lib/prism/relocation.rb#345 + # source://prism//lib/prism/relocation.rb#346 def fields(value); end end @@ -31022,13 +31066,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#15439 +# source://prism//lib/prism/node.rb#15610 class Prism::RequiredKeywordParameterNode < ::Prism::Node # Initialize a new RequiredKeywordParameterNode node. # # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15441 + # source://prism//lib/prism/node.rb#15612 sig do params( source: Prism::Source, @@ -31044,36 +31088,36 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15521 + # source://prism//lib/prism/node.rb#15692 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15451 + # source://prism//lib/prism/node.rb#15622 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15456 + # source://prism//lib/prism/node.rb#15627 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15466 + # source://prism//lib/prism/node.rb#15637 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15461 + # source://prism//lib/prism/node.rb#15632 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol, ?name_loc: Location) -> RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15471 + # source://prism//lib/prism/node.rb#15642 sig do params( node_id: Integer, @@ -31085,16 +31129,16 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15476 + # source://prism//lib/prism/node.rb#15647 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol, name_loc: Location } # - # source://prism//lib/prism/node.rb#15479 + # source://prism//lib/prism/node.rb#15650 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31103,19 +31147,19 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15505 + # source://prism//lib/prism/node.rb#15676 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#15489 + # source://prism//lib/prism/node.rb#15660 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#15492 + # source://prism//lib/prism/node.rb#15663 sig { returns(Prism::Location) } def name_loc; end @@ -31123,26 +31167,26 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15484 + # source://prism//lib/prism/node.rb#15655 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15500 + # source://prism//lib/prism/node.rb#15671 def save_name_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15510 + # source://prism//lib/prism/node.rb#15681 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15515 + # source://prism//lib/prism/node.rb#15686 def type; end end end @@ -31153,49 +31197,49 @@ end # ^ # end # -# source://prism//lib/prism/node.rb#15534 +# source://prism//lib/prism/node.rb#15705 class Prism::RequiredParameterNode < ::Prism::Node # Initialize a new RequiredParameterNode node. # # @return [RequiredParameterNode] a new instance of RequiredParameterNode # - # source://prism//lib/prism/node.rb#15536 + # source://prism//lib/prism/node.rb#15707 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer, name: Symbol).void } def initialize(source, node_id, location, flags, name); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15602 + # source://prism//lib/prism/node.rb#15773 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15545 + # source://prism//lib/prism/node.rb#15716 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15550 + # source://prism//lib/prism/node.rb#15721 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15560 + # source://prism//lib/prism/node.rb#15731 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15555 + # source://prism//lib/prism/node.rb#15726 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol) -> RequiredParameterNode # - # source://prism//lib/prism/node.rb#15565 + # source://prism//lib/prism/node.rb#15736 sig do params( node_id: Integer, @@ -31206,16 +31250,16 @@ class Prism::RequiredParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15570 + # source://prism//lib/prism/node.rb#15741 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol } # - # source://prism//lib/prism/node.rb#15573 + # source://prism//lib/prism/node.rb#15744 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31224,13 +31268,13 @@ class Prism::RequiredParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15586 + # source://prism//lib/prism/node.rb#15757 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#15583 + # source://prism//lib/prism/node.rb#15754 sig { returns(Symbol) } def name; end @@ -31238,20 +31282,20 @@ class Prism::RequiredParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15578 + # source://prism//lib/prism/node.rb#15749 sig { returns(T::Boolean) } def repeated_parameter?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15591 + # source://prism//lib/prism/node.rb#15762 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15596 + # source://prism//lib/prism/node.rb#15767 def type; end end end @@ -31261,13 +31305,13 @@ end # foo rescue nil # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#15613 +# source://prism//lib/prism/node.rb#15784 class Prism::RescueModifierNode < ::Prism::Node # Initialize a new RescueModifierNode node. # # @return [RescueModifierNode] a new instance of RescueModifierNode # - # source://prism//lib/prism/node.rb#15615 + # source://prism//lib/prism/node.rb#15786 sig do params( source: Prism::Source, @@ -31284,36 +31328,36 @@ class Prism::RescueModifierNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15699 + # source://prism//lib/prism/node.rb#15870 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15626 + # source://prism//lib/prism/node.rb#15797 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15631 + # source://prism//lib/prism/node.rb#15802 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15641 + # source://prism//lib/prism/node.rb#15812 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15636 + # source://prism//lib/prism/node.rb#15807 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?expression: Prism::node, ?keyword_loc: Location, ?rescue_expression: Prism::node) -> RescueModifierNode # - # source://prism//lib/prism/node.rb#15646 + # source://prism//lib/prism/node.rb#15817 sig do params( node_id: Integer, @@ -31326,22 +31370,22 @@ class Prism::RescueModifierNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), expression: T.unsafe(nil), keyword_loc: T.unsafe(nil), rescue_expression: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15651 + # source://prism//lib/prism/node.rb#15822 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, expression: Prism::node, keyword_loc: Location, rescue_expression: Prism::node } # - # source://prism//lib/prism/node.rb#15654 + # source://prism//lib/prism/node.rb#15825 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#15659 + # source://prism//lib/prism/node.rb#15830 sig { returns(Prism::Node) } def expression; end @@ -31350,47 +31394,47 @@ class Prism::RescueModifierNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15683 + # source://prism//lib/prism/node.rb#15854 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#15678 + # source://prism//lib/prism/node.rb#15849 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#15662 + # source://prism//lib/prism/node.rb#15833 sig { returns(Prism::Location) } def keyword_loc; end - # source://prism//lib/prism/parse_result/newlines.rb#115 + # source://prism//lib/prism/parse_result/newlines.rb#116 def newline_flag!(lines); end # attr_reader rescue_expression: Prism::node # - # source://prism//lib/prism/node.rb#15675 + # source://prism//lib/prism/node.rb#15846 sig { returns(Prism::Node) } def rescue_expression; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15670 + # source://prism//lib/prism/node.rb#15841 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15688 + # source://prism//lib/prism/node.rb#15859 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15693 + # source://prism//lib/prism/node.rb#15864 def type; end end end @@ -31405,13 +31449,13 @@ end # # `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `reference` field. # -# source://prism//lib/prism/node.rb#15716 +# source://prism//lib/prism/node.rb#15887 class Prism::RescueNode < ::Prism::Node # Initialize a new RescueNode node. # # @return [RescueNode] a new instance of RescueNode # - # source://prism//lib/prism/node.rb#15718 + # source://prism//lib/prism/node.rb#15889 sig do params( source: Prism::Source, @@ -31432,42 +31476,42 @@ class Prism::RescueNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15865 + # source://prism//lib/prism/node.rb#16036 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15733 + # source://prism//lib/prism/node.rb#15904 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15738 + # source://prism//lib/prism/node.rb#15909 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15753 + # source://prism//lib/prism/node.rb#15924 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15743 + # source://prism//lib/prism/node.rb#15914 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # Returns the subsequent rescue clause of the rescue node. This method is # deprecated in favor of #subsequent. # - # source://prism//lib/prism/node_ext.rb#494 + # source://prism//lib/prism/node_ext.rb#497 def consequent; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?exceptions: Array[Prism::node], ?operator_loc: Location?, ?reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?subsequent: RescueNode?) -> RescueNode # - # source://prism//lib/prism/node.rb#15758 + # source://prism//lib/prism/node.rb#15929 sig do params( node_id: Integer, @@ -31484,22 +31528,22 @@ class Prism::RescueNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), exceptions: T.unsafe(nil), operator_loc: T.unsafe(nil), reference: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), subsequent: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15763 + # source://prism//lib/prism/node.rb#15934 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, exceptions: Array[Prism::node], operator_loc: Location?, reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil, then_keyword_loc: Location?, statements: StatementsNode?, subsequent: RescueNode? } # - # source://prism//lib/prism/node.rb#15766 + # source://prism//lib/prism/node.rb#15937 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader exceptions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#15784 + # source://prism//lib/prism/node.rb#15955 sig { returns(T::Array[Prism::Node]) } def exceptions; end @@ -31508,37 +31552,37 @@ class Prism::RescueNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15849 + # source://prism//lib/prism/node.rb#16020 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#15834 + # source://prism//lib/prism/node.rb#16005 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#15771 + # source://prism//lib/prism/node.rb#15942 sig { returns(Prism::Location) } def keyword_loc; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#15839 + # source://prism//lib/prism/node.rb#16010 sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//lib/prism/node.rb#15787 + # source://prism//lib/prism/node.rb#15958 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader reference: LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | BackReferenceReadNode | NumberedReferenceReadNode | MissingNode | nil # - # source://prism//lib/prism/node.rb#15806 + # source://prism//lib/prism/node.rb#15977 sig do returns(T.nilable(T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::BackReferenceReadNode, Prism::NumberedReferenceReadNode, Prism::MissingNode))) end @@ -31547,55 +31591,55 @@ class Prism::RescueNode < ::Prism::Node # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15779 + # source://prism//lib/prism/node.rb#15950 def save_keyword_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15801 + # source://prism//lib/prism/node.rb#15972 def save_operator_loc(repository); end # Save the then_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15823 + # source://prism//lib/prism/node.rb#15994 def save_then_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#15828 + # source://prism//lib/prism/node.rb#15999 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # attr_reader subsequent: RescueNode? # - # source://prism//lib/prism/node.rb#15831 + # source://prism//lib/prism/node.rb#16002 sig { returns(T.nilable(Prism::RescueNode)) } def subsequent; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#15844 + # source://prism//lib/prism/node.rb#16015 sig { returns(T.nilable(String)) } def then_keyword; end # attr_reader then_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#15809 + # source://prism//lib/prism/node.rb#15980 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15854 + # source://prism//lib/prism/node.rb#16025 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15859 + # source://prism//lib/prism/node.rb#16030 def type; end end end @@ -31606,13 +31650,13 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#15883 +# source://prism//lib/prism/node.rb#16054 class Prism::RestParameterNode < ::Prism::Node # Initialize a new RestParameterNode node. # # @return [RestParameterNode] a new instance of RestParameterNode # - # source://prism//lib/prism/node.rb#15885 + # source://prism//lib/prism/node.rb#16056 sig do params( source: Prism::Source, @@ -31629,36 +31673,36 @@ class Prism::RestParameterNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#15990 + # source://prism//lib/prism/node.rb#16161 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15896 + # source://prism//lib/prism/node.rb#16067 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15901 + # source://prism//lib/prism/node.rb#16072 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15911 + # source://prism//lib/prism/node.rb#16082 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15906 + # source://prism//lib/prism/node.rb#16077 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location) -> RestParameterNode # - # source://prism//lib/prism/node.rb#15916 + # source://prism//lib/prism/node.rb#16087 sig do params( node_id: Integer, @@ -31671,16 +31715,16 @@ class Prism::RestParameterNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#15921 + # source://prism//lib/prism/node.rb#16092 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, name: Symbol?, name_loc: Location?, operator_loc: Location } # - # source://prism//lib/prism/node.rb#15924 + # source://prism//lib/prism/node.rb#16095 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31689,31 +31733,31 @@ class Prism::RestParameterNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#15974 + # source://prism//lib/prism/node.rb#16145 sig { override.returns(String) } def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#15934 + # source://prism//lib/prism/node.rb#16105 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#15937 + # source://prism//lib/prism/node.rb#16108 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#15969 + # source://prism//lib/prism/node.rb#16140 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#15956 + # source://prism//lib/prism/node.rb#16127 sig { returns(Prism::Location) } def operator_loc; end @@ -31721,32 +31765,32 @@ class Prism::RestParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#15929 + # source://prism//lib/prism/node.rb#16100 sig { returns(T::Boolean) } def repeated_parameter?; end # Save the name_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15951 + # source://prism//lib/prism/node.rb#16122 def save_name_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#15964 + # source://prism//lib/prism/node.rb#16135 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#15979 + # source://prism//lib/prism/node.rb#16150 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#15984 + # source://prism//lib/prism/node.rb#16155 def type; end end end @@ -31755,13 +31799,13 @@ end # the requested structure, any comments that were encounters, and any errors # that were encountered. # -# source://prism//lib/prism/parse_result.rb#679 +# source://prism//lib/prism/parse_result.rb#680 class Prism::Result # Create a new result object with the given values. # # @return [Result] a new instance of Result # - # source://prism//lib/prism/parse_result.rb#701 + # source://prism//lib/prism/parse_result.rb#702 sig do params( comments: T::Array[Prism::Comment], @@ -31776,7 +31820,7 @@ class Prism::Result # Create a code units cache for the given encoding. # - # source://prism//lib/prism/parse_result.rb#733 + # source://prism//lib/prism/parse_result.rb#734 sig do params( encoding: Encoding @@ -31786,7 +31830,7 @@ class Prism::Result # The list of comments that were encountered during parsing. # - # source://prism//lib/prism/parse_result.rb#681 + # source://prism//lib/prism/parse_result.rb#682 sig { returns(T::Array[Prism::Comment]) } def comments; end @@ -31794,25 +31838,25 @@ class Prism::Result # and the rest of the content of the file. This content is loaded into the # DATA constant when the file being parsed is the main file being executed. # - # source://prism//lib/prism/parse_result.rb#689 + # source://prism//lib/prism/parse_result.rb#690 sig { returns(T.nilable(Prism::Location)) } def data_loc; end # Implement the hash pattern matching interface for Result. # - # source://prism//lib/prism/parse_result.rb#711 + # source://prism//lib/prism/parse_result.rb#712 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Returns the encoding of the source code that was parsed. # - # source://prism//lib/prism/parse_result.rb#716 + # source://prism//lib/prism/parse_result.rb#717 sig { returns(Encoding) } def encoding; end # The list of errors that were generated during parsing. # - # source://prism//lib/prism/parse_result.rb#692 + # source://prism//lib/prism/parse_result.rb#693 sig { returns(T::Array[Prism::ParseError]) } def errors; end @@ -31821,19 +31865,19 @@ class Prism::Result # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#728 + # source://prism//lib/prism/parse_result.rb#729 sig { returns(T::Boolean) } def failure?; end # The list of magic comments that were encountered during parsing. # - # source://prism//lib/prism/parse_result.rb#684 + # source://prism//lib/prism/parse_result.rb#685 sig { returns(T::Array[Prism::MagicComment]) } def magic_comments; end # A Source instance that represents the source code that was parsed. # - # source://prism//lib/prism/parse_result.rb#698 + # source://prism//lib/prism/parse_result.rb#699 sig { returns(Prism::Source) } def source; end @@ -31842,13 +31886,13 @@ class Prism::Result # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#722 + # source://prism//lib/prism/parse_result.rb#723 sig { returns(T::Boolean) } def success?; end # The list of warnings that were generated during parsing. # - # source://prism//lib/prism/parse_result.rb#695 + # source://prism//lib/prism/parse_result.rb#696 sig { returns(T::Array[Prism::ParseWarning]) } def warnings; end end @@ -31858,62 +31902,62 @@ end # retry # ^^^^^ # -# source://prism//lib/prism/node.rb#16003 +# source://prism//lib/prism/node.rb#16174 class Prism::RetryNode < ::Prism::Node # Initialize a new RetryNode node. # # @return [RetryNode] a new instance of RetryNode # - # source://prism//lib/prism/node.rb#16005 + # source://prism//lib/prism/node.rb#16176 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16062 + # source://prism//lib/prism/node.rb#16233 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16013 + # source://prism//lib/prism/node.rb#16184 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16018 + # source://prism//lib/prism/node.rb#16189 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16028 + # source://prism//lib/prism/node.rb#16199 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16023 + # source://prism//lib/prism/node.rb#16194 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> RetryNode # - # source://prism//lib/prism/node.rb#16033 + # source://prism//lib/prism/node.rb#16204 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::RetryNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16038 + # source://prism//lib/prism/node.rb#16209 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#16041 + # source://prism//lib/prism/node.rb#16212 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -31922,20 +31966,20 @@ class Prism::RetryNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16046 + # source://prism//lib/prism/node.rb#16217 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16051 + # source://prism//lib/prism/node.rb#16222 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16056 + # source://prism//lib/prism/node.rb#16227 def type; end end end @@ -31945,13 +31989,13 @@ end # return 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16071 +# source://prism//lib/prism/node.rb#16242 class Prism::ReturnNode < ::Prism::Node # Initialize a new ReturnNode node. # # @return [ReturnNode] a new instance of ReturnNode # - # source://prism//lib/prism/node.rb#16073 + # source://prism//lib/prism/node.rb#16244 sig do params( source: Prism::Source, @@ -31967,42 +32011,42 @@ class Prism::ReturnNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16155 + # source://prism//lib/prism/node.rb#16326 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16083 + # source://prism//lib/prism/node.rb#16254 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#16131 + # source://prism//lib/prism/node.rb#16302 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16088 + # source://prism//lib/prism/node.rb#16259 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16100 + # source://prism//lib/prism/node.rb#16271 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16093 + # source://prism//lib/prism/node.rb#16264 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?) -> ReturnNode # - # source://prism//lib/prism/node.rb#16105 + # source://prism//lib/prism/node.rb#16276 sig do params( node_id: Integer, @@ -32014,16 +32058,16 @@ class Prism::ReturnNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), arguments: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16110 + # source://prism//lib/prism/node.rb#16281 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, arguments: ArgumentsNode? } # - # source://prism//lib/prism/node.rb#16113 + # source://prism//lib/prism/node.rb#16284 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -32032,38 +32076,38 @@ class Prism::ReturnNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16139 + # source://prism//lib/prism/node.rb#16310 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#16134 + # source://prism//lib/prism/node.rb#16305 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#16118 + # source://prism//lib/prism/node.rb#16289 sig { returns(Prism::Location) } def keyword_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16126 + # source://prism//lib/prism/node.rb#16297 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16144 + # source://prism//lib/prism/node.rb#16315 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16149 + # source://prism//lib/prism/node.rb#16320 def type; end end end @@ -32073,13 +32117,13 @@ end # variables visible at that scope as well as the forwarding parameters # available at that scope. # -# source://prism//lib/prism/parse_result.rb#887 +# source://prism//lib/prism/parse_result.rb#888 class Prism::Scope # Create a new scope object with the given locals and forwarding. # # @return [Scope] a new instance of Scope # - # source://prism//lib/prism/parse_result.rb#898 + # source://prism//lib/prism/parse_result.rb#899 sig { params(locals: T::Array[Symbol], forwarding: T::Array[Symbol]).void } def initialize(locals, forwarding); end @@ -32087,14 +32131,14 @@ class Prism::Scope # should by defined as an array of symbols containing the specific values of # :*, :**, :&, or :"...". # - # source://prism//lib/prism/parse_result.rb#895 + # source://prism//lib/prism/parse_result.rb#896 sig { returns(T::Array[Symbol]) } def forwarding; end # The list of local variables that are defined in this scope. This should be # defined as an array of symbols. # - # source://prism//lib/prism/parse_result.rb#890 + # source://prism//lib/prism/parse_result.rb#891 sig { returns(T::Array[Symbol]) } def locals; end end @@ -32104,62 +32148,62 @@ end # self # ^^^^ # -# source://prism//lib/prism/node.rb#16166 +# source://prism//lib/prism/node.rb#16337 class Prism::SelfNode < ::Prism::Node # Initialize a new SelfNode node. # # @return [SelfNode] a new instance of SelfNode # - # source://prism//lib/prism/node.rb#16168 + # source://prism//lib/prism/node.rb#16339 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16225 + # source://prism//lib/prism/node.rb#16396 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16176 + # source://prism//lib/prism/node.rb#16347 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16181 + # source://prism//lib/prism/node.rb#16352 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16191 + # source://prism//lib/prism/node.rb#16362 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16186 + # source://prism//lib/prism/node.rb#16357 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SelfNode # - # source://prism//lib/prism/node.rb#16196 + # source://prism//lib/prism/node.rb#16367 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SelfNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16201 + # source://prism//lib/prism/node.rb#16372 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#16204 + # source://prism//lib/prism/node.rb#16375 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -32168,27 +32212,27 @@ class Prism::SelfNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16209 + # source://prism//lib/prism/node.rb#16380 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16214 + # source://prism//lib/prism/node.rb#16385 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16219 + # source://prism//lib/prism/node.rb#16390 def type; end end end # A module responsible for deserializing parse results. # -# source://prism//lib/prism/serialize.rb#14 +# source://prism//lib/prism/serialize.rb#17 module Prism::Serialize class << self # Deserialize the dumped output from a request to lex or lex_file. @@ -32196,7 +32240,7 @@ module Prism::Serialize # The formatting of the source of this method is purposeful to illustrate # the structure of the serialized data. # - # source://prism//lib/prism/serialize.rb#84 + # source://prism//lib/prism/serialize.rb#87 def load_lex(input, serialized, freeze); end # Deserialize the dumped output from a request to parse or parse_file. @@ -32204,7 +32248,7 @@ module Prism::Serialize # The formatting of the source of this method is purposeful to illustrate # the structure of the serialized data. # - # source://prism//lib/prism/serialize.rb#31 + # source://prism//lib/prism/serialize.rb#34 def load_parse(input, serialized, freeze); end # Deserialize the dumped output from a request to parse_comments or @@ -32213,7 +32257,7 @@ module Prism::Serialize # The formatting of the source of this method is purposeful to illustrate # the structure of the serialized data. # - # source://prism//lib/prism/serialize.rb#128 + # source://prism//lib/prism/serialize.rb#131 def load_parse_comments(input, serialized, freeze); end # Deserialize the dumped output from a request to parse_lex or @@ -32222,165 +32266,165 @@ module Prism::Serialize # The formatting of the source of this method is purposeful to illustrate # the structure of the serialized data. # - # source://prism//lib/prism/serialize.rb#150 + # source://prism//lib/prism/serialize.rb#153 def load_parse_lex(input, serialized, freeze); end end end -# source://prism//lib/prism/serialize.rb#199 +# source://prism//lib/prism/serialize.rb#202 class Prism::Serialize::ConstantPool # @return [ConstantPool] a new instance of ConstantPool # - # source://prism//lib/prism/serialize.rb#202 + # source://prism//lib/prism/serialize.rb#205 def initialize(input, serialized, base, size); end - # source://prism//lib/prism/serialize.rb#210 + # source://prism//lib/prism/serialize.rb#213 def get(index, encoding); end # Returns the value of attribute size. # - # source://prism//lib/prism/serialize.rb#200 + # source://prism//lib/prism/serialize.rb#203 def size; end end # StringIO is synchronized and that adds a high overhead on TruffleRuby. # -# source://prism//lib/prism/serialize.rb#253 +# source://prism//lib/prism/serialize.rb#256 Prism::Serialize::FastStringIO = StringIO -# source://prism//lib/prism/serialize.rb#256 +# source://prism//lib/prism/serialize.rb#259 class Prism::Serialize::Loader # @return [Loader] a new instance of Loader # - # source://prism//lib/prism/serialize.rb#259 + # source://prism//lib/prism/serialize.rb#262 def initialize(source, serialized); end # @return [Boolean] # - # source://prism//lib/prism/serialize.rb#267 + # source://prism//lib/prism/serialize.rb#270 def eof?; end # Returns the value of attribute input. # - # source://prism//lib/prism/serialize.rb#257 + # source://prism//lib/prism/serialize.rb#260 def input; end # Returns the value of attribute io. # - # source://prism//lib/prism/serialize.rb#257 + # source://prism//lib/prism/serialize.rb#260 def io; end - # source://prism//lib/prism/serialize.rb#301 + # source://prism//lib/prism/serialize.rb#304 def load_comments(freeze); end - # source://prism//lib/prism/serialize.rb#823 + # source://prism//lib/prism/serialize.rb#829 def load_constant(constant_pool, encoding); end - # source://prism//lib/prism/serialize.rb#272 + # source://prism//lib/prism/serialize.rb#275 def load_constant_pool(constant_pool); end - # source://prism//lib/prism/serialize.rb#774 + # source://prism//lib/prism/serialize.rb#780 def load_double; end - # source://prism//lib/prism/serialize.rb#789 + # source://prism//lib/prism/serialize.rb#795 def load_embedded_string(encoding); end - # source://prism//lib/prism/serialize.rb#289 + # source://prism//lib/prism/serialize.rb#292 def load_encoding; end - # source://prism//lib/prism/serialize.rb#659 + # source://prism//lib/prism/serialize.rb#665 def load_error_level; end - # source://prism//lib/prism/serialize.rb#674 + # source://prism//lib/prism/serialize.rb#680 def load_errors(encoding, freeze); end - # source://prism//lib/prism/serialize.rb#283 + # source://prism//lib/prism/serialize.rb#286 def load_header; end - # source://prism//lib/prism/serialize.rb#763 + # source://prism//lib/prism/serialize.rb#769 def load_integer; end - # source://prism//lib/prism/serialize.rb#295 + # source://prism//lib/prism/serialize.rb#298 def load_line_offsets(freeze); end - # source://prism//lib/prism/serialize.rb#810 + # source://prism//lib/prism/serialize.rb#816 def load_location(freeze); end - # source://prism//lib/prism/serialize.rb#804 + # source://prism//lib/prism/serialize.rb#810 def load_location_object(freeze); end - # source://prism//lib/prism/serialize.rb#318 + # source://prism//lib/prism/serialize.rb#321 def load_magic_comments(freeze); end - # source://prism//lib/prism/serialize.rb#834 + # source://prism//lib/prism/serialize.rb#840 def load_node(constant_pool, encoding, freeze); end - # source://prism//lib/prism/serialize.rb#828 + # source://prism//lib/prism/serialize.rb#834 def load_optional_constant(constant_pool, encoding); end - # source://prism//lib/prism/serialize.rb#815 + # source://prism//lib/prism/serialize.rb#821 def load_optional_location(freeze); end - # source://prism//lib/prism/serialize.rb#819 + # source://prism//lib/prism/serialize.rb#825 def load_optional_location_object(freeze); end - # source://prism//lib/prism/serialize.rb#782 + # source://prism//lib/prism/serialize.rb#788 def load_optional_node(constant_pool, encoding, freeze); end - # source://prism//lib/prism/serialize.rb#793 + # source://prism//lib/prism/serialize.rb#799 def load_string(encoding); end - # source://prism//lib/prism/serialize.rb#725 + # source://prism//lib/prism/serialize.rb#731 def load_tokens; end - # source://prism//lib/prism/serialize.rb#778 + # source://prism//lib/prism/serialize.rb#784 def load_uint32; end - # source://prism//lib/prism/serialize.rb#758 + # source://prism//lib/prism/serialize.rb#764 def load_varsint; end # variable-length integer using https://en.wikipedia.org/wiki/LEB128 # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints # - # source://prism//lib/prism/serialize.rb#744 + # source://prism//lib/prism/serialize.rb#750 def load_varuint; end - # source://prism//lib/prism/serialize.rb#693 + # source://prism//lib/prism/serialize.rb#699 def load_warning_level; end - # source://prism//lib/prism/serialize.rb#706 + # source://prism//lib/prism/serialize.rb#712 def load_warnings(encoding, freeze); end # Returns the value of attribute source. # - # source://prism//lib/prism/serialize.rb#257 + # source://prism//lib/prism/serialize.rb#260 def source; end end -# source://prism//lib/prism/serialize.rb#335 +# source://prism//lib/prism/serialize.rb#338 Prism::Serialize::Loader::DIAGNOSTIC_TYPES = T.let(T.unsafe(nil), Array) # The major version of prism that we are expecting to find in the serialized # strings. # -# source://prism//lib/prism/serialize.rb#17 +# source://prism//lib/prism/serialize.rb#20 Prism::Serialize::MAJOR_VERSION = T.let(T.unsafe(nil), Integer) # The minor version of prism that we are expecting to find in the serialized # strings. # -# source://prism//lib/prism/serialize.rb#21 +# source://prism//lib/prism/serialize.rb#24 Prism::Serialize::MINOR_VERSION = T.let(T.unsafe(nil), Integer) # The patch version of prism that we are expecting to find in the serialized # strings. # -# source://prism//lib/prism/serialize.rb#25 +# source://prism//lib/prism/serialize.rb#28 Prism::Serialize::PATCH_VERSION = T.let(T.unsafe(nil), Integer) # The token types that can be indexed by their enum values. # -# source://prism//lib/prism/serialize.rb#2219 +# source://prism//lib/prism/serialize.rb#2225 Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) # This node wraps a constant write to indicate that when the value is written, it should have its shareability state modified. @@ -32388,13 +32432,13 @@ Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) # C = { a: 1 } # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16235 +# source://prism//lib/prism/node.rb#16406 class Prism::ShareableConstantNode < ::Prism::Node # Initialize a new ShareableConstantNode node. # # @return [ShareableConstantNode] a new instance of ShareableConstantNode # - # source://prism//lib/prism/node.rb#16237 + # source://prism//lib/prism/node.rb#16408 sig do params( source: Prism::Source, @@ -32409,36 +32453,36 @@ class Prism::ShareableConstantNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16313 + # source://prism//lib/prism/node.rb#16484 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16246 + # source://prism//lib/prism/node.rb#16417 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16251 + # source://prism//lib/prism/node.rb#16422 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16261 + # source://prism//lib/prism/node.rb#16432 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16256 + # source://prism//lib/prism/node.rb#16427 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode) -> ShareableConstantNode # - # source://prism//lib/prism/node.rb#16266 + # source://prism//lib/prism/node.rb#16437 sig do params( node_id: Integer, @@ -32449,16 +32493,16 @@ class Prism::ShareableConstantNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), write: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16271 + # source://prism//lib/prism/node.rb#16442 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode } # - # source://prism//lib/prism/node.rb#16274 + # source://prism//lib/prism/node.rb#16445 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -32466,7 +32510,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16289 + # source://prism//lib/prism/node.rb#16460 sig { returns(T::Boolean) } def experimental_copy?; end @@ -32474,7 +32518,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16284 + # source://prism//lib/prism/node.rb#16455 sig { returns(T::Boolean) } def experimental_everything?; end @@ -32483,7 +32527,7 @@ class Prism::ShareableConstantNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16297 + # source://prism//lib/prism/node.rb#16468 sig { override.returns(String) } def inspect; end @@ -32491,19 +32535,19 @@ class Prism::ShareableConstantNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16279 + # source://prism//lib/prism/node.rb#16450 sig { returns(T::Boolean) } def literal?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16302 + # source://prism//lib/prism/node.rb#16473 sig { override.returns(Symbol) } def type; end # The constant write that should be modified with the shareability state. # - # source://prism//lib/prism/node.rb#16294 + # source://prism//lib/prism/node.rb#16465 sig do returns(T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)) end @@ -32512,29 +32556,29 @@ class Prism::ShareableConstantNode < ::Prism::Node class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16307 + # source://prism//lib/prism/node.rb#16478 def type; end end end # Flags for shareable constant nodes. # -# source://prism//lib/prism/node.rb#18597 +# source://prism//lib/prism/node.rb#18768 module Prism::ShareableConstantNodeFlags; end # constant writes that should be modified with shareable constant value experimental copy # -# source://prism//lib/prism/node.rb#18605 +# source://prism//lib/prism/node.rb#18776 Prism::ShareableConstantNodeFlags::EXPERIMENTAL_COPY = T.let(T.unsafe(nil), Integer) # constant writes that should be modified with shareable constant value experimental everything # -# source://prism//lib/prism/node.rb#18602 +# source://prism//lib/prism/node.rb#18773 Prism::ShareableConstantNodeFlags::EXPERIMENTAL_EVERYTHING = T.let(T.unsafe(nil), Integer) # constant writes that should be modified with shareable constant value literal # -# source://prism//lib/prism/node.rb#18599 +# source://prism//lib/prism/node.rb#18770 Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer) # Represents a singleton class declaration involving the `class` keyword. @@ -32542,13 +32586,13 @@ Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer) # class << self end # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16324 +# source://prism//lib/prism/node.rb#16495 class Prism::SingletonClassNode < ::Prism::Node # Initialize a new SingletonClassNode node. # # @return [SingletonClassNode] a new instance of SingletonClassNode # - # source://prism//lib/prism/node.rb#16326 + # source://prism//lib/prism/node.rb#16497 sig do params( source: Prism::Source, @@ -32568,54 +32612,54 @@ class Prism::SingletonClassNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16455 + # source://prism//lib/prism/node.rb#16626 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16340 + # source://prism//lib/prism/node.rb#16511 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: StatementsNode | BeginNode | nil # - # source://prism//lib/prism/node.rb#16408 + # source://prism//lib/prism/node.rb#16579 sig { returns(T.nilable(T.any(Prism::StatementsNode, Prism::BeginNode))) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16345 + # source://prism//lib/prism/node.rb#16516 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//lib/prism/node.rb#16424 + # source://prism//lib/prism/node.rb#16595 sig { returns(String) } def class_keyword; end # attr_reader class_keyword_loc: Location # - # source://prism//lib/prism/node.rb#16379 + # source://prism//lib/prism/node.rb#16550 sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16358 + # source://prism//lib/prism/node.rb#16529 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16350 + # source://prism//lib/prism/node.rb#16521 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?locals: Array[Symbol], ?class_keyword_loc: Location, ?operator_loc: Location, ?expression: Prism::node, ?body: StatementsNode | BeginNode | nil, ?end_keyword_loc: Location) -> SingletonClassNode # - # source://prism//lib/prism/node.rb#16363 + # source://prism//lib/prism/node.rb#16534 sig do params( node_id: Integer, @@ -32631,34 +32675,34 @@ class Prism::SingletonClassNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), locals: T.unsafe(nil), class_keyword_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), expression: T.unsafe(nil), body: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16368 + # source://prism//lib/prism/node.rb#16539 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Prism::node, body: StatementsNode | BeginNode | nil, end_keyword_loc: Location } # - # source://prism//lib/prism/node.rb#16371 + # source://prism//lib/prism/node.rb#16542 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#16434 + # source://prism//lib/prism/node.rb#16605 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#16411 + # source://prism//lib/prism/node.rb#16582 sig { returns(Prism::Location) } def end_keyword_loc; end # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#16405 + # source://prism//lib/prism/node.rb#16576 sig { returns(Prism::Node) } def expression; end @@ -32667,56 +32711,56 @@ class Prism::SingletonClassNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16439 + # source://prism//lib/prism/node.rb#16610 sig { override.returns(String) } def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#16376 + # source://prism//lib/prism/node.rb#16547 sig { returns(T::Array[Symbol]) } def locals; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#16429 + # source://prism//lib/prism/node.rb#16600 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#16392 + # source://prism//lib/prism/node.rb#16563 sig { returns(Prism::Location) } def operator_loc; end # Save the class_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16387 + # source://prism//lib/prism/node.rb#16558 def save_class_keyword_loc(repository); end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16419 + # source://prism//lib/prism/node.rb#16590 def save_end_keyword_loc(repository); end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16400 + # source://prism//lib/prism/node.rb#16571 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16444 + # source://prism//lib/prism/node.rb#16615 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16449 + # source://prism//lib/prism/node.rb#16620 def type; end end end @@ -32725,32 +32769,32 @@ end # conjunction with locations to allow them to resolve line numbers and source # ranges. # -# source://prism//lib/prism/parse_result.rb#7 +# source://prism//lib/prism/parse_result.rb#8 class Prism::Source # Create a new source object with the given source code. # # @return [Source] a new instance of Source # - # source://prism//lib/prism/parse_result.rb#45 + # source://prism//lib/prism/parse_result.rb#46 sig { params(source: String, start_line: Integer, offsets: T::Array[Integer]).void } def initialize(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end # Return the column number in characters for the given byte offset. # - # source://prism//lib/prism/parse_result.rb#107 + # source://prism//lib/prism/parse_result.rb#108 sig { params(byte_offset: Integer).returns(Integer) } def character_column(byte_offset); end # Return the character offset for the given byte offset. # - # source://prism//lib/prism/parse_result.rb#102 + # source://prism//lib/prism/parse_result.rb#103 sig { params(byte_offset: Integer).returns(Integer) } def character_offset(byte_offset); end # Generate a cache that targets a specific encoding for calculating code # unit offsets. # - # source://prism//lib/prism/parse_result.rb#135 + # source://prism//lib/prism/parse_result.rb#136 sig do params( encoding: Encoding @@ -32761,7 +32805,7 @@ class Prism::Source # Returns the column number in code units for the given encoding for the # given byte offset. # - # source://prism//lib/prism/parse_result.rb#141 + # source://prism//lib/prism/parse_result.rb#142 sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } def code_units_column(byte_offset, encoding); end @@ -32778,88 +32822,88 @@ class Prism::Source # boundary. Second, it's possible that the source code will contain a # character that has no equivalent in the given encoding. # - # source://prism//lib/prism/parse_result.rb#123 + # source://prism//lib/prism/parse_result.rb#124 sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } def code_units_offset(byte_offset, encoding); end # Return the column number for the given byte offset. # - # source://prism//lib/prism/parse_result.rb#97 + # source://prism//lib/prism/parse_result.rb#98 sig { params(byte_offset: Integer).returns(Integer) } def column(byte_offset); end # Freeze this object and the objects it contains. # - # source://prism//lib/prism/parse_result.rb#146 + # source://prism//lib/prism/parse_result.rb#147 def deep_freeze; end # Returns the encoding of the source code, which is set by parameters to the # parser or by the encoding magic comment. # - # source://prism//lib/prism/parse_result.rb#63 + # source://prism//lib/prism/parse_result.rb#64 sig { returns(Encoding) } def encoding; end # Binary search through the offsets to find the line number for the given # byte offset. # - # source://prism//lib/prism/parse_result.rb#80 + # source://prism//lib/prism/parse_result.rb#81 sig { params(byte_offset: Integer).returns(Integer) } def line(byte_offset); end # Returns the byte offset of the end of the line corresponding to the given # byte offset. # - # source://prism//lib/prism/parse_result.rb#92 + # source://prism//lib/prism/parse_result.rb#93 def line_end(byte_offset); end # Return the byte offset of the start of the line corresponding to the given # byte offset. # - # source://prism//lib/prism/parse_result.rb#86 + # source://prism//lib/prism/parse_result.rb#87 sig { params(byte_offset: Integer).returns(Integer) } def line_start(byte_offset); end # Returns the lines of the source code as an array of strings. # - # source://prism//lib/prism/parse_result.rb#68 + # source://prism//lib/prism/parse_result.rb#69 sig { returns(T::Array[String]) } def lines; end # The list of newline byte offsets in the source code. # - # source://prism//lib/prism/parse_result.rb#42 + # source://prism//lib/prism/parse_result.rb#43 sig { returns(T::Array[Integer]) } def offsets; end # Replace the value of offsets with the given value. # - # source://prism//lib/prism/parse_result.rb#57 + # source://prism//lib/prism/parse_result.rb#58 sig { params(offsets: T::Array[Integer]).void } def replace_offsets(offsets); end # Replace the value of start_line with the given value. # - # source://prism//lib/prism/parse_result.rb#52 + # source://prism//lib/prism/parse_result.rb#53 sig { params(start_line: Integer).void } def replace_start_line(start_line); end # Perform a byteslice on the source code using the given byte offset and # byte length. # - # source://prism//lib/prism/parse_result.rb#74 + # source://prism//lib/prism/parse_result.rb#75 sig { params(byte_offset: Integer, length: Integer).returns(String) } def slice(byte_offset, length); end # The source code that this source object represents. # - # source://prism//lib/prism/parse_result.rb#36 + # source://prism//lib/prism/parse_result.rb#37 sig { returns(String) } def source; end # The line number where this source starts. # - # source://prism//lib/prism/parse_result.rb#39 + # source://prism//lib/prism/parse_result.rb#40 sig { returns(Integer) } def start_line; end @@ -32868,7 +32912,7 @@ class Prism::Source # Binary search through the offsets to find the line number for the given # byte offset. # - # source://prism//lib/prism/parse_result.rb#156 + # source://prism//lib/prism/parse_result.rb#157 def find_line(byte_offset); end class << self @@ -32877,7 +32921,7 @@ class Prism::Source # specialized and more performant `ASCIISource` if no multibyte characters # are present in the source code. # - # source://prism//lib/prism/parse_result.rb#12 + # source://prism//lib/prism/parse_result.rb#13 def for(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end end end @@ -32887,62 +32931,62 @@ end # __ENCODING__ # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16471 +# source://prism//lib/prism/node.rb#16642 class Prism::SourceEncodingNode < ::Prism::Node # Initialize a new SourceEncodingNode node. # # @return [SourceEncodingNode] a new instance of SourceEncodingNode # - # source://prism//lib/prism/node.rb#16473 + # source://prism//lib/prism/node.rb#16644 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16530 + # source://prism//lib/prism/node.rb#16701 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16481 + # source://prism//lib/prism/node.rb#16652 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16486 + # source://prism//lib/prism/node.rb#16657 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16496 + # source://prism//lib/prism/node.rb#16667 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16491 + # source://prism//lib/prism/node.rb#16662 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceEncodingNode # - # source://prism//lib/prism/node.rb#16501 + # source://prism//lib/prism/node.rb#16672 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceEncodingNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16506 + # source://prism//lib/prism/node.rb#16677 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#16509 + # source://prism//lib/prism/node.rb#16680 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -32951,20 +32995,20 @@ class Prism::SourceEncodingNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16514 + # source://prism//lib/prism/node.rb#16685 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16519 + # source://prism//lib/prism/node.rb#16690 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16524 + # source://prism//lib/prism/node.rb#16695 def type; end end end @@ -32974,13 +33018,13 @@ end # __FILE__ # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16539 +# source://prism//lib/prism/node.rb#16710 class Prism::SourceFileNode < ::Prism::Node # Initialize a new SourceFileNode node. # # @return [SourceFileNode] a new instance of SourceFileNode # - # source://prism//lib/prism/node.rb#16541 + # source://prism//lib/prism/node.rb#16712 sig do params( source: Prism::Source, @@ -32995,36 +33039,36 @@ class Prism::SourceFileNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16622 + # source://prism//lib/prism/node.rb#16793 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16550 + # source://prism//lib/prism/node.rb#16721 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16555 + # source://prism//lib/prism/node.rb#16726 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16565 + # source://prism//lib/prism/node.rb#16736 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16560 + # source://prism//lib/prism/node.rb#16731 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?filepath: String) -> SourceFileNode # - # source://prism//lib/prism/node.rb#16570 + # source://prism//lib/prism/node.rb#16741 sig do params( node_id: Integer, @@ -33035,16 +33079,16 @@ class Prism::SourceFileNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), filepath: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16575 + # source://prism//lib/prism/node.rb#16746 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, filepath: String } # - # source://prism//lib/prism/node.rb#16578 + # source://prism//lib/prism/node.rb#16749 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -33053,7 +33097,7 @@ class Prism::SourceFileNode < ::Prism::Node # Represents the file path being parsed. This corresponds directly to the `filepath` option given to the various `Prism::parse*` APIs. # - # source://prism//lib/prism/node.rb#16603 + # source://prism//lib/prism/node.rb#16774 sig { returns(String) } def filepath; end @@ -33061,7 +33105,7 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16588 + # source://prism//lib/prism/node.rb#16759 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -33069,7 +33113,7 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16583 + # source://prism//lib/prism/node.rb#16754 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -33077,13 +33121,13 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16593 + # source://prism//lib/prism/node.rb#16764 sig { returns(T::Boolean) } def frozen?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#16606 + # source://prism//lib/prism/node.rb#16777 sig { override.returns(String) } def inspect; end @@ -33091,20 +33135,20 @@ class Prism::SourceFileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16598 + # source://prism//lib/prism/node.rb#16769 sig { returns(T::Boolean) } def mutable?; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16611 + # source://prism//lib/prism/node.rb#16782 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16616 + # source://prism//lib/prism/node.rb#16787 def type; end end end @@ -33114,62 +33158,62 @@ end # __LINE__ # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16633 +# source://prism//lib/prism/node.rb#16804 class Prism::SourceLineNode < ::Prism::Node # Initialize a new SourceLineNode node. # # @return [SourceLineNode] a new instance of SourceLineNode # - # source://prism//lib/prism/node.rb#16635 + # source://prism//lib/prism/node.rb#16806 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16692 + # source://prism//lib/prism/node.rb#16863 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16643 + # source://prism//lib/prism/node.rb#16814 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16648 + # source://prism//lib/prism/node.rb#16819 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16658 + # source://prism//lib/prism/node.rb#16829 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16653 + # source://prism//lib/prism/node.rb#16824 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> SourceLineNode # - # source://prism//lib/prism/node.rb#16663 + # source://prism//lib/prism/node.rb#16834 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::SourceLineNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16668 + # source://prism//lib/prism/node.rb#16839 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#16671 + # source://prism//lib/prism/node.rb#16842 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -33178,20 +33222,20 @@ class Prism::SourceLineNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16676 + # source://prism//lib/prism/node.rb#16847 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16681 + # source://prism//lib/prism/node.rb#16852 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16686 + # source://prism//lib/prism/node.rb#16857 def type; end end end @@ -33201,13 +33245,13 @@ end # [*a] # ^^ # -# source://prism//lib/prism/node.rb#16701 +# source://prism//lib/prism/node.rb#16872 class Prism::SplatNode < ::Prism::Node # Initialize a new SplatNode node. # # @return [SplatNode] a new instance of SplatNode # - # source://prism//lib/prism/node.rb#16703 + # source://prism//lib/prism/node.rb#16874 sig do params( source: Prism::Source, @@ -33223,36 +33267,36 @@ class Prism::SplatNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16785 + # source://prism//lib/prism/node.rb#16956 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16713 + # source://prism//lib/prism/node.rb#16884 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16718 + # source://prism//lib/prism/node.rb#16889 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16730 + # source://prism//lib/prism/node.rb#16901 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16723 + # source://prism//lib/prism/node.rb#16894 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?operator_loc: Location, ?expression: Prism::node?) -> SplatNode # - # source://prism//lib/prism/node.rb#16735 + # source://prism//lib/prism/node.rb#16906 sig do params( node_id: Integer, @@ -33264,22 +33308,22 @@ class Prism::SplatNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), operator_loc: T.unsafe(nil), expression: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16740 + # source://prism//lib/prism/node.rb#16911 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, operator_loc: Location, expression: Prism::node? } # - # source://prism//lib/prism/node.rb#16743 + # source://prism//lib/prism/node.rb#16914 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader expression: Prism::node? # - # source://prism//lib/prism/node.rb#16761 + # source://prism//lib/prism/node.rb#16932 sig { returns(T.nilable(Prism::Node)) } def expression; end @@ -33288,38 +33332,38 @@ class Prism::SplatNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16769 + # source://prism//lib/prism/node.rb#16940 sig { override.returns(String) } def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#16764 + # source://prism//lib/prism/node.rb#16935 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#16748 + # source://prism//lib/prism/node.rb#16919 sig { returns(Prism::Location) } def operator_loc; end # Save the operator_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16756 + # source://prism//lib/prism/node.rb#16927 def save_operator_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16774 + # source://prism//lib/prism/node.rb#16945 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16779 + # source://prism//lib/prism/node.rb#16950 def type; end end end @@ -33329,13 +33373,13 @@ end # foo; bar; baz # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16796 +# source://prism//lib/prism/node.rb#16967 class Prism::StatementsNode < ::Prism::Node # Initialize a new StatementsNode node. # # @return [StatementsNode] a new instance of StatementsNode # - # source://prism//lib/prism/node.rb#16798 + # source://prism//lib/prism/node.rb#16969 sig do params( source: Prism::Source, @@ -33350,42 +33394,42 @@ class Prism::StatementsNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#16859 + # source://prism//lib/prism/node.rb#17030 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16807 + # source://prism//lib/prism/node.rb#16978 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader body: Array[Prism::node] # - # source://prism//lib/prism/node.rb#16840 + # source://prism//lib/prism/node.rb#17011 sig { returns(T::Array[Prism::Node]) } def body; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16812 + # source://prism//lib/prism/node.rb#16983 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16822 + # source://prism//lib/prism/node.rb#16993 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16817 + # source://prism//lib/prism/node.rb#16988 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?body: Array[Prism::node]) -> StatementsNode # - # source://prism//lib/prism/node.rb#16827 + # source://prism//lib/prism/node.rb#16998 sig do params( node_id: Integer, @@ -33396,16 +33440,16 @@ class Prism::StatementsNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), body: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16832 + # source://prism//lib/prism/node.rb#17003 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, body: Array[Prism::node] } # - # source://prism//lib/prism/node.rb#16835 + # source://prism//lib/prism/node.rb#17006 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -33414,43 +33458,43 @@ class Prism::StatementsNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#16843 + # source://prism//lib/prism/node.rb#17014 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#16848 + # source://prism//lib/prism/node.rb#17019 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#16853 + # source://prism//lib/prism/node.rb#17024 def type; end end end # Flags for string nodes. # -# source://prism//lib/prism/node.rb#18609 +# source://prism//lib/prism/node.rb#18780 module Prism::StringFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#18614 +# source://prism//lib/prism/node.rb#18785 Prism::StringFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#18611 +# source://prism//lib/prism/node.rb#18782 Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#18617 +# source://prism//lib/prism/node.rb#18788 Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/node.rb#18620 +# source://prism//lib/prism/node.rb#18791 Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # Represents a string literal, a string contained within a `%w` list, or plain string content within an interpolated string. @@ -33464,7 +33508,7 @@ Prism::StringFlags::MUTABLE = T.let(T.unsafe(nil), Integer) # "foo #{bar} baz" # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#16876 +# source://prism//lib/prism/node.rb#17047 class Prism::StringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -33472,7 +33516,7 @@ class Prism::StringNode < ::Prism::Node # # @return [StringNode] a new instance of StringNode # - # source://prism//lib/prism/node.rb#16878 + # source://prism//lib/prism/node.rb#17049 sig do params( source: Prism::Source, @@ -33490,60 +33534,60 @@ class Prism::StringNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17028 + # source://prism//lib/prism/node.rb#17199 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16890 + # source://prism//lib/prism/node.rb#17061 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16895 + # source://prism//lib/prism/node.rb#17066 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#17007 + # source://prism//lib/prism/node.rb#17178 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#16975 + # source://prism//lib/prism/node.rb#17146 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16905 + # source://prism//lib/prism/node.rb#17076 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#16900 + # source://prism//lib/prism/node.rb#17071 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#17002 + # source://prism//lib/prism/node.rb#17173 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#16962 + # source://prism//lib/prism/node.rb#17133 sig { returns(Prism::Location) } def content_loc; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?content_loc: Location, ?closing_loc: Location?, ?unescaped: String) -> StringNode # - # source://prism//lib/prism/node.rb#16910 + # source://prism//lib/prism/node.rb#17081 sig do params( node_id: Integer, @@ -33557,16 +33601,16 @@ class Prism::StringNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#16915 + # source://prism//lib/prism/node.rb#17086 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String } # - # source://prism//lib/prism/node.rb#16918 + # source://prism//lib/prism/node.rb#17089 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -33577,7 +33621,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16928 + # source://prism//lib/prism/node.rb#17099 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -33585,7 +33629,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16923 + # source://prism//lib/prism/node.rb#17094 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -33593,7 +33637,7 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16933 + # source://prism//lib/prism/node.rb#17104 sig { returns(T::Boolean) } def frozen?; end @@ -33602,7 +33646,7 @@ class Prism::StringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17012 + # source://prism//lib/prism/node.rb#17183 sig { override.returns(String) } def inspect; end @@ -33610,63 +33654,63 @@ class Prism::StringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16938 + # source://prism//lib/prism/node.rb#17109 sig { returns(T::Boolean) } def mutable?; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#16997 + # source://prism//lib/prism/node.rb#17168 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#16943 + # source://prism//lib/prism/node.rb#17114 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16989 + # source://prism//lib/prism/node.rb#17160 def save_closing_loc(repository); end # Save the content_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16970 + # source://prism//lib/prism/node.rb#17141 def save_content_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#16957 + # source://prism//lib/prism/node.rb#17128 def save_opening_loc(repository); end # Occasionally it's helpful to treat a string as if it were interpolated so # that there's a consistent interface for working with strings. # - # source://prism//lib/prism/node_ext.rb#72 + # source://prism//lib/prism/node_ext.rb#75 sig { returns(Prism::InterpolatedStringNode) } def to_interpolated; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17017 + # source://prism//lib/prism/node.rb#17188 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#16994 + # source://prism//lib/prism/node.rb#17165 sig { returns(String) } def unescaped; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17022 + # source://prism//lib/prism/node.rb#17193 def type; end end end @@ -33674,39 +33718,39 @@ end # Query methods that allow categorizing strings based on their context for # where they could be valid in a Ruby syntax tree. # -# source://prism//lib/prism/string_query.rb#6 +# source://prism//lib/prism/string_query.rb#7 class Prism::StringQuery # Initialize a new query with the given string. # # @return [StringQuery] a new instance of StringQuery # - # source://prism//lib/prism/string_query.rb#11 + # source://prism//lib/prism/string_query.rb#12 def initialize(string); end # Whether or not this string is a valid constant name. # # @return [Boolean] # - # source://prism//lib/prism/string_query.rb#21 + # source://prism//lib/prism/string_query.rb#22 def constant?; end # Whether or not this string is a valid local variable name. # # @return [Boolean] # - # source://prism//lib/prism/string_query.rb#16 + # source://prism//lib/prism/string_query.rb#17 def local?; end # Whether or not this string is a valid method name. # # @return [Boolean] # - # source://prism//lib/prism/string_query.rb#26 + # source://prism//lib/prism/string_query.rb#27 def method_name?; end # The string that this query is wrapping. # - # source://prism//lib/prism/string_query.rb#8 + # source://prism//lib/prism/string_query.rb#9 def string; end class << self @@ -33714,21 +33758,21 @@ class Prism::StringQuery # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def constant?(_arg0); end # Mirrors the C extension's StringQuery::local? method. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def local?(_arg0); end # Mirrors the C extension's StringQuery::method_name? method. # # @return [Boolean] # - # source://prism//lib/prism.rb#83 + # source://prism//lib/prism.rb#106 def method_name?(_arg0); end end end @@ -33741,13 +33785,13 @@ end # super foo, bar # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17045 +# source://prism//lib/prism/node.rb#17216 class Prism::SuperNode < ::Prism::Node # Initialize a new SuperNode node. # # @return [SuperNode] a new instance of SuperNode # - # source://prism//lib/prism/node.rb#17047 + # source://prism//lib/prism/node.rb#17218 sig do params( source: Prism::Source, @@ -33766,48 +33810,48 @@ class Prism::SuperNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17184 + # source://prism//lib/prism/node.rb#17355 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17060 + # source://prism//lib/prism/node.rb#17231 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#17128 + # source://prism//lib/prism/node.rb#17299 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # attr_reader block: BlockNode | BlockArgumentNode | nil # - # source://prism//lib/prism/node.rb#17150 + # source://prism//lib/prism/node.rb#17321 sig { returns(T.nilable(T.any(Prism::BlockNode, Prism::BlockArgumentNode))) } def block; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17065 + # source://prism//lib/prism/node.rb#17236 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17078 + # source://prism//lib/prism/node.rb#17249 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17070 + # source://prism//lib/prism/node.rb#17241 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?block: BlockNode | BlockArgumentNode | nil) -> SuperNode # - # source://prism//lib/prism/node.rb#17083 + # source://prism//lib/prism/node.rb#17254 sig do params( node_id: Integer, @@ -33822,16 +33866,16 @@ class Prism::SuperNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), arguments: T.unsafe(nil), rparen_loc: T.unsafe(nil), block: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17088 + # source://prism//lib/prism/node.rb#17259 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: BlockNode | BlockArgumentNode | nil } # - # source://prism//lib/prism/node.rb#17091 + # source://prism//lib/prism/node.rb#17262 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -33840,96 +33884,96 @@ class Prism::SuperNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17168 + # source://prism//lib/prism/node.rb#17339 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17153 + # source://prism//lib/prism/node.rb#17324 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17096 + # source://prism//lib/prism/node.rb#17267 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#17158 + # source://prism//lib/prism/node.rb#17329 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#17109 + # source://prism//lib/prism/node.rb#17280 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#17163 + # source://prism//lib/prism/node.rb#17334 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#17131 + # source://prism//lib/prism/node.rb#17302 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17104 + # source://prism//lib/prism/node.rb#17275 def save_keyword_loc(repository); end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17123 + # source://prism//lib/prism/node.rb#17294 def save_lparen_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17145 + # source://prism//lib/prism/node.rb#17316 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17173 + # source://prism//lib/prism/node.rb#17344 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17178 + # source://prism//lib/prism/node.rb#17349 def type; end end end # Flags for symbol nodes. # -# source://prism//lib/prism/node.rb#18624 +# source://prism//lib/prism/node.rb#18795 module Prism::SymbolFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#18629 +# source://prism//lib/prism/node.rb#18800 Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to US-ASCII # -# source://prism//lib/prism/node.rb#18632 +# source://prism//lib/prism/node.rb#18803 Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) # internal bytes forced the encoding to UTF-8 # -# source://prism//lib/prism/node.rb#18626 +# source://prism//lib/prism/node.rb#18797 Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # Represents a symbol literal or a symbol contained within a `%i` list. @@ -33940,13 +33984,13 @@ Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # %i[foo] # ^^^ # -# source://prism//lib/prism/node.rb#17201 +# source://prism//lib/prism/node.rb#17372 class Prism::SymbolNode < ::Prism::Node # Initialize a new SymbolNode node. # # @return [SymbolNode] a new instance of SymbolNode # - # source://prism//lib/prism/node.rb#17203 + # source://prism//lib/prism/node.rb#17374 sig do params( source: Prism::Source, @@ -33964,48 +34008,48 @@ class Prism::SymbolNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17354 + # source://prism//lib/prism/node.rb#17525 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17215 + # source://prism//lib/prism/node.rb#17386 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17220 + # source://prism//lib/prism/node.rb#17391 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#17333 + # source://prism//lib/prism/node.rb#17504 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#17301 + # source://prism//lib/prism/node.rb#17472 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17230 + # source://prism//lib/prism/node.rb#17401 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17225 + # source://prism//lib/prism/node.rb#17396 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location?, ?value_loc: Location?, ?closing_loc: Location?, ?unescaped: String) -> SymbolNode # - # source://prism//lib/prism/node.rb#17235 + # source://prism//lib/prism/node.rb#17406 sig do params( node_id: Integer, @@ -34019,16 +34063,16 @@ class Prism::SymbolNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), value_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17240 + # source://prism//lib/prism/node.rb#17411 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String } # - # source://prism//lib/prism/node.rb#17243 + # source://prism//lib/prism/node.rb#17414 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -34039,7 +34083,7 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17253 + # source://prism//lib/prism/node.rb#17424 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -34047,7 +34091,7 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17258 + # source://prism//lib/prism/node.rb#17429 sig { returns(T::Boolean) } def forced_us_ascii_encoding?; end @@ -34055,133 +34099,133 @@ class Prism::SymbolNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17248 + # source://prism//lib/prism/node.rb#17419 sig { returns(T::Boolean) } def forced_utf8_encoding?; end # def inspect -> String # - # source://prism//lib/prism/node.rb#17338 + # source://prism//lib/prism/node.rb#17509 sig { override.returns(String) } def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#17323 + # source://prism//lib/prism/node.rb#17494 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#17263 + # source://prism//lib/prism/node.rb#17434 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17315 + # source://prism//lib/prism/node.rb#17486 def save_closing_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17277 + # source://prism//lib/prism/node.rb#17448 def save_opening_loc(repository); end # Save the value_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17296 + # source://prism//lib/prism/node.rb#17467 def save_value_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17343 + # source://prism//lib/prism/node.rb#17514 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#17320 + # source://prism//lib/prism/node.rb#17491 sig { returns(String) } def unescaped; end # def value: () -> String? # - # source://prism//lib/prism/node.rb#17328 + # source://prism//lib/prism/node.rb#17499 sig { returns(T.nilable(String)) } def value; end # attr_reader value_loc: Location? # - # source://prism//lib/prism/node.rb#17282 + # source://prism//lib/prism/node.rb#17453 sig { returns(T.nilable(Prism::Location)) } def value_loc; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17348 + # source://prism//lib/prism/node.rb#17519 def type; end end end # This represents a token from the Ruby source. # -# source://prism//lib/prism/parse_result.rb#816 +# source://prism//lib/prism/parse_result.rb#817 class Prism::Token # Create a new token object with the given type, value, and location. # # @return [Token] a new instance of Token # - # source://prism//lib/prism/parse_result.rb#828 + # source://prism//lib/prism/parse_result.rb#829 sig { params(source: Prism::Source, type: Symbol, value: String, location: T.any(Integer, Prism::Location)).void } def initialize(source, type, value, location); end # Returns true if the given other token is equal to this token. # - # source://prism//lib/prism/parse_result.rb#863 + # source://prism//lib/prism/parse_result.rb#864 sig { params(other: T.untyped).returns(T::Boolean) } def ==(other); end # Implement the hash pattern matching interface for Token. # - # source://prism//lib/prism/parse_result.rb#836 + # source://prism//lib/prism/parse_result.rb#837 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # Freeze this object and the objects it contains. # - # source://prism//lib/prism/parse_result.rb#876 + # source://prism//lib/prism/parse_result.rb#877 def deep_freeze; end # Returns a string representation of this token. # - # source://prism//lib/prism/parse_result.rb#870 + # source://prism//lib/prism/parse_result.rb#871 def inspect; end # A Location object representing the location of this token in the source. # - # source://prism//lib/prism/parse_result.rb#841 + # source://prism//lib/prism/parse_result.rb#842 sig { returns(Prism::Location) } def location; end # Implement the pretty print interface for Token. # - # source://prism//lib/prism/parse_result.rb#848 + # source://prism//lib/prism/parse_result.rb#849 sig { params(q: T.untyped).void } def pretty_print(q); end # The type of token that this token is. # - # source://prism//lib/prism/parse_result.rb#822 + # source://prism//lib/prism/parse_result.rb#823 sig { returns(Symbol) } def type; end # A byteslice of the source that this token represents. # - # source://prism//lib/prism/parse_result.rb#825 + # source://prism//lib/prism/parse_result.rb#826 sig { returns(String) } def value; end @@ -34189,7 +34233,7 @@ class Prism::Token # The Source object that represents the source this token came from. # - # source://prism//lib/prism/parse_result.rb#818 + # source://prism//lib/prism/parse_result.rb#819 sig { returns(Prism::Source) } def source; end end @@ -34197,7 +34241,7 @@ end # This module is responsible for converting the prism syntax tree into other # syntax trees. # -# source://prism//lib/prism/translation.rb#6 +# source://prism//lib/prism/translation.rb#7 module Prism::Translation; end # This class is the entry-point for converting a prism syntax tree into the @@ -34205,7 +34249,14 @@ module Prism::Translation; end # the parser gem, and overrides the parse* methods to parse with prism and # then translate. # -# source://prism//lib/prism/translation/parser.rb#16 +# Note that this version of the parser always parses using the latest +# version of Ruby syntax supported by Prism. If you want specific version +# support, use one of the version-specific subclasses, such as +# `Prism::Translation::Parser34`. If you want to parse using the same +# version of Ruby syntax as the currently running version of Ruby, use +# `Prism::Translation::ParserCurrent`. +# +# source://prism//lib/prism/translation/parser.rb#29 class Prism::Translation::Parser < ::Parser::Base # The `builder` argument is used to create the parser using our custom builder class by default. # @@ -34234,53 +34285,53 @@ class Prism::Translation::Parser < ::Parser::Base # # @return [Parser] a new instance of Parser # - # source://prism//lib/prism/translation/parser.rb#61 + # source://prism//lib/prism/translation/parser.rb#74 def initialize(builder = T.unsafe(nil), parser: T.unsafe(nil)); end # The default encoding for Ruby files is UTF-8. # - # source://prism//lib/prism/translation/parser.rb#72 + # source://prism//lib/prism/translation/parser.rb#91 def default_encoding; end # Parses a source buffer and returns the AST. # - # source://prism//lib/prism/translation/parser.rb#80 + # source://prism//lib/prism/translation/parser.rb#99 def parse(source_buffer); end # Parses a source buffer and returns the AST and the source code comments. # - # source://prism//lib/prism/translation/parser.rb#93 + # source://prism//lib/prism/translation/parser.rb#112 def parse_with_comments(source_buffer); end # Parses a source buffer and returns the AST, the source code comments, # and the tokens emitted by the lexer. # - # source://prism//lib/prism/translation/parser.rb#110 + # source://prism//lib/prism/translation/parser.rb#129 def tokenize(source_buffer, recover = T.unsafe(nil)); end # Since prism resolves num params for us, we don't need to support this # kind of logic here. # - # source://prism//lib/prism/translation/parser.rb#136 + # source://prism//lib/prism/translation/parser.rb#155 def try_declare_numparam(node); end - # source://prism//lib/prism/translation/parser.rb#67 + # source://prism//lib/prism/translation/parser.rb#86 sig { overridable.returns(Integer) } def version; end - # source://prism//lib/prism/translation/parser.rb#76 + # source://prism//lib/prism/translation/parser.rb#95 def yyerror; end private # Build the parser gem AST from the prism AST. # - # source://prism//lib/prism/translation/parser.rb#294 + # source://prism//lib/prism/translation/parser.rb#313 def build_ast(program, offset_cache); end # Build the parser gem comments from the prism comments. # - # source://prism//lib/prism/translation/parser.rb#299 + # source://prism//lib/prism/translation/parser.rb#318 def build_comments(comments, offset_cache); end # Prism deals with offsets in bytes, while the parser gem deals with @@ -34291,38 +34342,38 @@ class Prism::Translation::Parser < ::Parser::Base # just use the offset directly. Otherwise, we build an array where the # index is the byte offset and the value is the character offset. # - # source://prism//lib/prism/translation/parser.rb#277 + # source://prism//lib/prism/translation/parser.rb#296 def build_offset_cache(source); end # Build a range from a prism location. # - # source://prism//lib/prism/translation/parser.rb#311 + # source://prism//lib/prism/translation/parser.rb#330 def build_range(location, offset_cache); end # Build the parser gem tokens from the prism tokens. # - # source://prism//lib/prism/translation/parser.rb#306 + # source://prism//lib/prism/translation/parser.rb#325 def build_tokens(tokens, offset_cache); end # Converts the version format handled by Parser to the format handled by Prism. # - # source://prism//lib/prism/translation/parser.rb#334 + # source://prism//lib/prism/translation/parser.rb#353 def convert_for_prism(version); end # Build a diagnostic from the given prism parse error. # - # source://prism//lib/prism/translation/parser.rb#155 + # source://prism//lib/prism/translation/parser.rb#174 def error_diagnostic(error, offset_cache); end # Options for how prism should parse/lex the source. # - # source://prism//lib/prism/translation/parser.rb#320 + # source://prism//lib/prism/translation/parser.rb#339 def prism_options; end # If there was a error generated during the parse, then raise an # appropriate syntax error. Otherwise return the result. # - # source://prism//lib/prism/translation/parser.rb#255 + # source://prism//lib/prism/translation/parser.rb#274 def unwrap(result, offset_cache); end # This is a hook to allow consumers to disable some errors if they don't @@ -34330,7 +34381,7 @@ class Prism::Translation::Parser < ::Parser::Base # # @return [Boolean] # - # source://prism//lib/prism/translation/parser.rb#144 + # source://prism//lib/prism/translation/parser.rb#163 def valid_error?(error); end # This is a hook to allow consumers to disable some warnings if they don't @@ -34338,38 +34389,38 @@ class Prism::Translation::Parser < ::Parser::Base # # @return [Boolean] # - # source://prism//lib/prism/translation/parser.rb#150 + # source://prism//lib/prism/translation/parser.rb#169 def valid_warning?(warning); end # Build a diagnostic from the given prism parse warning. # - # source://prism//lib/prism/translation/parser.rb#228 + # source://prism//lib/prism/translation/parser.rb#247 def warning_diagnostic(warning, offset_cache); end end # This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`. # -# source://prism//lib/prism/translation/parser33.rb#6 +# source://prism//lib/prism/translation/parser33.rb#7 class Prism::Translation::Parser33 < ::Prism::Translation::Parser - # source://prism//lib/prism/translation/parser33.rb#7 + # source://prism//lib/prism/translation/parser33.rb#8 sig { override.returns(Integer) } def version; end end # This class is the entry-point for Ruby 3.4 of `Prism::Translation::Parser`. # -# source://prism//lib/prism/translation/parser34.rb#6 +# source://prism//lib/prism/translation/parser34.rb#7 class Prism::Translation::Parser34 < ::Prism::Translation::Parser - # source://prism//lib/prism/translation/parser34.rb#7 + # source://prism//lib/prism/translation/parser34.rb#8 sig { override.returns(Integer) } def version; end end # This class is the entry-point for Ruby 3.5 of `Prism::Translation::Parser`. # -# source://prism//lib/prism/translation/parser35.rb#6 +# source://prism//lib/prism/translation/parser35.rb#7 class Prism::Translation::Parser35 < ::Prism::Translation::Parser - # source://prism//lib/prism/translation/parser35.rb#7 + # source://prism//lib/prism/translation/parser35.rb#8 sig { override.returns(Integer) } def version; end end @@ -34377,7 +34428,7 @@ end # A builder that knows how to convert more modern Ruby syntax # into whitequark/parser gem's syntax tree. # -# source://prism//lib/prism/translation/parser/builder.rb#8 +# source://prism//lib/prism/translation/parser/builder.rb#9 class Prism::Translation::Parser::Builder < ::Parser::Builders::Default # The following three lines have been added to support the `it` block parameter syntax in the source code below. # @@ -34387,112 +34438,112 @@ class Prism::Translation::Parser::Builder < ::Parser::Builders::Default # # https://github.com/whitequark/parser/blob/v3.3.7.1/lib/parser/builders/default.rb#L1122-L1155 # - # source://prism//lib/prism/translation/parser/builder.rb#21 + # source://prism//lib/prism/translation/parser/builder.rb#22 def block(method_call, begin_t, args, body, end_t); end # It represents the `it` block argument, which is not yet implemented in the Parser gem. # - # source://prism//lib/prism/translation/parser/builder.rb#10 + # source://prism//lib/prism/translation/parser/builder.rb#11 def itarg; end end # A visitor that knows how to convert a prism syntax tree into the # whitequark/parser gem's syntax tree. # -# source://prism//lib/prism/translation/parser/compiler.rb#8 +# source://prism//lib/prism/translation/parser/compiler.rb#9 class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Initialize a new compiler with the given parser, offset cache, and # options. # # @return [Compiler] a new instance of Compiler # - # source://prism//lib/prism/translation/parser/compiler.rb#39 + # source://prism//lib/prism/translation/parser/compiler.rb#40 def initialize(parser, offset_cache, forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end # The Parser::Builders::Default instance that is being used to build the # AST. # - # source://prism//lib/prism/translation/parser/compiler.rb#18 + # source://prism//lib/prism/translation/parser/compiler.rb#19 def builder; end # The types of values that can be forwarded in the current scope. # - # source://prism//lib/prism/translation/parser/compiler.rb#29 + # source://prism//lib/prism/translation/parser/compiler.rb#30 def forwarding; end # Whether or not the current node is in a destructure. # - # source://prism//lib/prism/translation/parser/compiler.rb#32 + # source://prism//lib/prism/translation/parser/compiler.rb#33 def in_destructure; end # Whether or not the current node is in a pattern. # - # source://prism//lib/prism/translation/parser/compiler.rb#35 + # source://prism//lib/prism/translation/parser/compiler.rb#36 def in_pattern; end # The offset cache that is used to map between byte and character # offsets in the file. # - # source://prism//lib/prism/translation/parser/compiler.rb#26 + # source://prism//lib/prism/translation/parser/compiler.rb#27 def offset_cache; end # The Parser::Base instance that is being used to build the AST. # - # source://prism//lib/prism/translation/parser/compiler.rb#14 + # source://prism//lib/prism/translation/parser/compiler.rb#15 def parser; end # The Parser::Source::Buffer instance that is holding a reference to the # source code. # - # source://prism//lib/prism/translation/parser/compiler.rb#22 + # source://prism//lib/prism/translation/parser/compiler.rb#23 def source_buffer; end # alias $foo $bar # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#58 + # source://prism//lib/prism/translation/parser/compiler.rb#59 def visit_alias_global_variable_node(node); end # alias foo bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#52 + # source://prism//lib/prism/translation/parser/compiler.rb#53 def visit_alias_method_node(node); end # foo => bar | baz # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#64 + # source://prism//lib/prism/translation/parser/compiler.rb#65 def visit_alternation_pattern_node(node); end # a and b # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#70 + # source://prism//lib/prism/translation/parser/compiler.rb#71 def visit_and_node(node); end # foo(bar) # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#127 + # source://prism//lib/prism/translation/parser/compiler.rb#128 def visit_arguments_node(node); end # [] # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#76 + # source://prism//lib/prism/translation/parser/compiler.rb#77 def visit_array_node(node); end # foo => [bar] # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#104 + # source://prism//lib/prism/translation/parser/compiler.rb#105 def visit_array_pattern_node(node); end # { a: 1 } # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#133 + # source://prism//lib/prism/translation/parser/compiler.rb#134 def visit_assoc_node(node); end # def foo(**); bar(**); end @@ -34501,49 +34552,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # { **foo } # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#185 + # source://prism//lib/prism/translation/parser/compiler.rb#182 def visit_assoc_splat_node(node); end # $+ # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#197 + # source://prism//lib/prism/translation/parser/compiler.rb#194 def visit_back_reference_read_node(node); end # begin end # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#203 + # source://prism//lib/prism/translation/parser/compiler.rb#200 def visit_begin_node(node); end # foo(&bar) # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#248 + # source://prism//lib/prism/translation/parser/compiler.rb#245 def visit_block_argument_node(node); end # foo { |; bar| } # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#254 + # source://prism//lib/prism/translation/parser/compiler.rb#251 def visit_block_local_variable_node(node); end # A block on a keyword or method call. # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#259 + # source://prism//lib/prism/translation/parser/compiler.rb#256 def visit_block_node(node); end # def foo(&bar); end # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#265 + # source://prism//lib/prism/translation/parser/compiler.rb#262 def visit_block_parameter_node(node); end # A block's parameters. # - # source://prism//lib/prism/translation/parser/compiler.rb#270 + # source://prism//lib/prism/translation/parser/compiler.rb#267 def visit_block_parameters_node(node); end # break @@ -34552,13 +34603,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # break foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#279 + # source://prism//lib/prism/translation/parser/compiler.rb#276 def visit_break_node(node); end # foo.bar &&= baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#384 + # source://prism//lib/prism/translation/parser/compiler.rb#381 def visit_call_and_write_node(node); end # foo @@ -34570,133 +34621,133 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # foo.bar() {} # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#291 + # source://prism//lib/prism/translation/parser/compiler.rb#288 def visit_call_node(node); end # foo.bar += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#365 + # source://prism//lib/prism/translation/parser/compiler.rb#362 def visit_call_operator_write_node(node); end # foo.bar ||= baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#403 + # source://prism//lib/prism/translation/parser/compiler.rb#400 def visit_call_or_write_node(node); end # foo.bar, = 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#422 + # source://prism//lib/prism/translation/parser/compiler.rb#419 def visit_call_target_node(node); end # foo => bar => baz # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#434 + # source://prism//lib/prism/translation/parser/compiler.rb#431 def visit_capture_pattern_node(node); end # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#453 + # source://prism//lib/prism/translation/parser/compiler.rb#450 def visit_case_match_node(node); end # case foo; when bar; end # ^^^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#440 + # source://prism//lib/prism/translation/parser/compiler.rb#437 def visit_case_node(node); end # class Foo; end # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#466 + # source://prism//lib/prism/translation/parser/compiler.rb#463 def visit_class_node(node); end # @@foo &&= bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#505 + # source://prism//lib/prism/translation/parser/compiler.rb#502 def visit_class_variable_and_write_node(node); end # @@foo += bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#495 + # source://prism//lib/prism/translation/parser/compiler.rb#492 def visit_class_variable_operator_write_node(node); end # @@foo ||= bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#515 + # source://prism//lib/prism/translation/parser/compiler.rb#512 def visit_class_variable_or_write_node(node); end # @@foo # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#479 + # source://prism//lib/prism/translation/parser/compiler.rb#476 def visit_class_variable_read_node(node); end # @@foo, = bar # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#525 + # source://prism//lib/prism/translation/parser/compiler.rb#522 def visit_class_variable_target_node(node); end # @@foo = 1 # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#485 + # source://prism//lib/prism/translation/parser/compiler.rb#482 def visit_class_variable_write_node(node); end # Foo &&= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#556 + # source://prism//lib/prism/translation/parser/compiler.rb#553 def visit_constant_and_write_node(node); end # Foo += bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#546 + # source://prism//lib/prism/translation/parser/compiler.rb#543 def visit_constant_operator_write_node(node); end # Foo ||= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#566 + # source://prism//lib/prism/translation/parser/compiler.rb#563 def visit_constant_or_write_node(node); end # Foo::Bar &&= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#622 + # source://prism//lib/prism/translation/parser/compiler.rb#619 def visit_constant_path_and_write_node(node); end # Foo::Bar # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#582 + # source://prism//lib/prism/translation/parser/compiler.rb#579 def visit_constant_path_node(node); end # Foo::Bar += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#612 + # source://prism//lib/prism/translation/parser/compiler.rb#609 def visit_constant_path_operator_write_node(node); end # Foo::Bar ||= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#632 + # source://prism//lib/prism/translation/parser/compiler.rb#629 def visit_constant_path_or_write_node(node); end # Foo::Bar, = baz # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#642 + # source://prism//lib/prism/translation/parser/compiler.rb#639 def visit_constant_path_target_node(node); end # Foo::Bar = 1 @@ -34705,19 +34756,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Foo::Foo, Bar::Bar = 1 # ^^^^^^^^ ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#602 + # source://prism//lib/prism/translation/parser/compiler.rb#599 def visit_constant_path_write_node(node); end # Foo # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#531 + # source://prism//lib/prism/translation/parser/compiler.rb#528 def visit_constant_read_node(node); end # Foo, = bar # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#576 + # source://prism//lib/prism/translation/parser/compiler.rb#573 def visit_constant_target_node(node); end # Foo = 1 @@ -34726,7 +34777,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Foo, Bar = 1 # ^^^ ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#540 + # source://prism//lib/prism/translation/parser/compiler.rb#537 def visit_constant_write_node(node); end # def foo; end @@ -34735,7 +34786,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def self.foo; end # ^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#651 + # source://prism//lib/prism/translation/parser/compiler.rb#648 def visit_def_node(node); end # defined? a @@ -34744,25 +34795,25 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # defined?(a) # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#698 + # source://prism//lib/prism/translation/parser/compiler.rb#695 def visit_defined_node(node); end # if foo then bar else baz end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#710 + # source://prism//lib/prism/translation/parser/compiler.rb#731 def visit_else_node(node); end # "foo #{bar}" # ^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#716 + # source://prism//lib/prism/translation/parser/compiler.rb#737 def visit_embedded_statements_node(node); end # "foo #@bar" # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#726 + # source://prism//lib/prism/translation/parser/compiler.rb#747 def visit_embedded_variable_node(node); end # begin; foo; ensure; bar; end @@ -34770,19 +34821,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#732 + # source://prism//lib/prism/translation/parser/compiler.rb#753 def visit_ensure_node(node); end # false # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#738 + # source://prism//lib/prism/translation/parser/compiler.rb#759 def visit_false_node(node); end # foo => [*, bar, *] # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#744 + # source://prism//lib/prism/translation/parser/compiler.rb#765 def visit_find_pattern_node(node); end # 0..5 @@ -34790,31 +34841,31 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if foo .. bar; end # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1519 + # source://prism//lib/prism/translation/parser/compiler.rb#1541 def visit_flip_flop_node(node); end # 1.0 # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#756 + # source://prism//lib/prism/translation/parser/compiler.rb#777 def visit_float_node(node); end # for foo in bar do end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#762 + # source://prism//lib/prism/translation/parser/compiler.rb#783 def visit_for_node(node); end # def foo(...); bar(...); end # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#780 + # source://prism//lib/prism/translation/parser/compiler.rb#801 def visit_forwarding_arguments_node(node); end # def foo(...); end # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#786 + # source://prism//lib/prism/translation/parser/compiler.rb#807 def visit_forwarding_parameter_node(node); end # super @@ -34823,55 +34874,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # super {} # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#795 + # source://prism//lib/prism/translation/parser/compiler.rb#816 def visit_forwarding_super_node(node); end # $foo &&= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#833 + # source://prism//lib/prism/translation/parser/compiler.rb#854 def visit_global_variable_and_write_node(node); end # $foo += bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#823 + # source://prism//lib/prism/translation/parser/compiler.rb#844 def visit_global_variable_operator_write_node(node); end # $foo ||= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#843 + # source://prism//lib/prism/translation/parser/compiler.rb#864 def visit_global_variable_or_write_node(node); end # $foo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#807 + # source://prism//lib/prism/translation/parser/compiler.rb#828 def visit_global_variable_read_node(node); end # $foo, = bar # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#853 + # source://prism//lib/prism/translation/parser/compiler.rb#874 def visit_global_variable_target_node(node); end # $foo = 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#813 + # source://prism//lib/prism/translation/parser/compiler.rb#834 def visit_global_variable_write_node(node); end # {} # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#859 + # source://prism//lib/prism/translation/parser/compiler.rb#880 def visit_hash_node(node); end # foo => {} # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#869 + # source://prism//lib/prism/translation/parser/compiler.rb#890 def visit_hash_pattern_node(node); end # if foo then bar end @@ -34883,13 +34934,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # foo ? bar : baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#887 + # source://prism//lib/prism/translation/parser/compiler.rb#908 def visit_if_node(node); end # 1i # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#929 + # source://prism//lib/prism/translation/parser/compiler.rb#950 def visit_imaginary_node(node); end # { foo: } @@ -34897,7 +34948,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#935 + # source://prism//lib/prism/translation/parser/compiler.rb#956 def visit_implicit_node(node); end # foo { |bar,| } @@ -34905,74 +34956,74 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#941 + # source://prism//lib/prism/translation/parser/compiler.rb#962 def visit_implicit_rest_node(node); end # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#947 + # source://prism//lib/prism/translation/parser/compiler.rb#968 def visit_in_node(node); end # foo[bar] &&= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#995 + # source://prism//lib/prism/translation/parser/compiler.rb#1016 def visit_index_and_write_node(node); end # foo[bar] += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#977 + # source://prism//lib/prism/translation/parser/compiler.rb#998 def visit_index_operator_write_node(node); end # foo[bar] ||= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1013 + # source://prism//lib/prism/translation/parser/compiler.rb#1034 def visit_index_or_write_node(node); end # foo[bar], = 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1031 + # source://prism//lib/prism/translation/parser/compiler.rb#1052 def visit_index_target_node(node); end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1068 + # source://prism//lib/prism/translation/parser/compiler.rb#1089 def visit_instance_variable_and_write_node(node); end # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1058 + # source://prism//lib/prism/translation/parser/compiler.rb#1079 def visit_instance_variable_operator_write_node(node); end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1078 + # source://prism//lib/prism/translation/parser/compiler.rb#1099 def visit_instance_variable_or_write_node(node); end # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1042 + # source://prism//lib/prism/translation/parser/compiler.rb#1063 def visit_instance_variable_read_node(node); end # @foo, = bar # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1088 + # source://prism//lib/prism/translation/parser/compiler.rb#1109 def visit_instance_variable_target_node(node); end # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1048 + # source://prism//lib/prism/translation/parser/compiler.rb#1069 def visit_instance_variable_write_node(node); end # 1 # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1094 + # source://prism//lib/prism/translation/parser/compiler.rb#1115 def visit_integer_node(node); end # /foo #{bar}/ @@ -34980,49 +35031,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if /foo #{bar}/ then end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1111 + # source://prism//lib/prism/translation/parser/compiler.rb#1132 def visit_interpolated_match_last_line_node(node); end # /foo #{bar}/ # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1100 + # source://prism//lib/prism/translation/parser/compiler.rb#1121 def visit_interpolated_regular_expression_node(node); end # "foo #{bar}" # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1115 + # source://prism//lib/prism/translation/parser/compiler.rb#1136 def visit_interpolated_string_node(node); end # :"foo #{bar}" # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1129 + # source://prism//lib/prism/translation/parser/compiler.rb#1150 def visit_interpolated_symbol_node(node); end # `foo #{bar}` # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1139 + # source://prism//lib/prism/translation/parser/compiler.rb#1160 def visit_interpolated_x_string_node(node); end # -> { it } # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1153 + # source://prism//lib/prism/translation/parser/compiler.rb#1174 def visit_it_local_variable_read_node(node); end # -> { it } # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1159 + # source://prism//lib/prism/translation/parser/compiler.rb#1180 def visit_it_parameters_node(node); end # foo(bar: baz) # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1175 + # source://prism//lib/prism/translation/parser/compiler.rb#1196 def visit_keyword_hash_node(node); end # def foo(**bar); end @@ -35031,49 +35082,49 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(**); end # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1184 + # source://prism//lib/prism/translation/parser/compiler.rb#1205 def visit_keyword_rest_parameter_node(node); end # -> {} # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1193 + # source://prism//lib/prism/translation/parser/compiler.rb#1214 def visit_lambda_node(node); end # foo &&= bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1245 + # source://prism//lib/prism/translation/parser/compiler.rb#1266 def visit_local_variable_and_write_node(node); end # foo += bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1235 + # source://prism//lib/prism/translation/parser/compiler.rb#1256 def visit_local_variable_operator_write_node(node); end # foo ||= bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1255 + # source://prism//lib/prism/translation/parser/compiler.rb#1276 def visit_local_variable_or_write_node(node); end # foo # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1219 + # source://prism//lib/prism/translation/parser/compiler.rb#1240 def visit_local_variable_read_node(node); end # foo, = bar # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1265 + # source://prism//lib/prism/translation/parser/compiler.rb#1286 def visit_local_variable_target_node(node); end # foo = 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1225 + # source://prism//lib/prism/translation/parser/compiler.rb#1246 def visit_local_variable_write_node(node); end # /foo/ @@ -35081,50 +35132,50 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # if /foo/ then end # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1555 + # source://prism//lib/prism/translation/parser/compiler.rb#1577 def visit_match_last_line_node(node); end # foo in bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1275 + # source://prism//lib/prism/translation/parser/compiler.rb#1296 def visit_match_predicate_node(node); end # foo => bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1285 + # source://prism//lib/prism/translation/parser/compiler.rb#1306 def visit_match_required_node(node); end # /(?foo)/ =~ bar # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1295 + # source://prism//lib/prism/translation/parser/compiler.rb#1316 def visit_match_write_node(node); end # A node that is missing from the syntax tree. This is only used in the # case of a syntax error. The parser gem doesn't have such a concept, so # we invent our own here. # - # source://prism//lib/prism/translation/parser/compiler.rb#1306 + # source://prism//lib/prism/translation/parser/compiler.rb#1327 def visit_missing_node(node); end # module Foo; end # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1312 + # source://prism//lib/prism/translation/parser/compiler.rb#1333 def visit_module_node(node); end # foo, bar = baz # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1323 + # source://prism//lib/prism/translation/parser/compiler.rb#1344 def visit_multi_target_node(node); end # foo, bar = baz # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1333 + # source://prism//lib/prism/translation/parser/compiler.rb#1354 def visit_multi_write_node(node); end # next @@ -35133,55 +35184,55 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # next foo # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1356 + # source://prism//lib/prism/translation/parser/compiler.rb#1377 def visit_next_node(node); end # nil # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1368 + # source://prism//lib/prism/translation/parser/compiler.rb#1389 def visit_nil_node(node); end # def foo(**nil); end # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1374 + # source://prism//lib/prism/translation/parser/compiler.rb#1395 def visit_no_keywords_parameter_node(node); end # -> { _1 + _2 } # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1384 + # source://prism//lib/prism/translation/parser/compiler.rb#1405 def visit_numbered_parameters_node(node); end # $1 # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1390 + # source://prism//lib/prism/translation/parser/compiler.rb#1411 def visit_numbered_reference_read_node(node); end # def foo(bar: baz); end # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1396 + # source://prism//lib/prism/translation/parser/compiler.rb#1417 def visit_optional_keyword_parameter_node(node); end # def foo(bar = 1); end # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1402 + # source://prism//lib/prism/translation/parser/compiler.rb#1423 def visit_optional_parameter_node(node); end # a or b # ^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1408 + # source://prism//lib/prism/translation/parser/compiler.rb#1429 def visit_or_node(node); end # def foo(bar, *baz); end # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1414 + # source://prism//lib/prism/translation/parser/compiler.rb#1435 def visit_parameters_node(node); end # () @@ -35190,76 +35241,76 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # (1) # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1453 + # source://prism//lib/prism/translation/parser/compiler.rb#1474 def visit_parentheses_node(node); end # foo => ^(bar) # ^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1463 + # source://prism//lib/prism/translation/parser/compiler.rb#1484 def visit_pinned_expression_node(node); end # foo = 1 and bar => ^foo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1470 + # source://prism//lib/prism/translation/parser/compiler.rb#1492 def visit_pinned_variable_node(node); end # END {} # - # source://prism//lib/prism/translation/parser/compiler.rb#1475 + # source://prism//lib/prism/translation/parser/compiler.rb#1497 def visit_post_execution_node(node); end # BEGIN {} # - # source://prism//lib/prism/translation/parser/compiler.rb#1485 + # source://prism//lib/prism/translation/parser/compiler.rb#1507 def visit_pre_execution_node(node); end # The top-level program node. # - # source://prism//lib/prism/translation/parser/compiler.rb#1495 + # source://prism//lib/prism/translation/parser/compiler.rb#1517 def visit_program_node(node); end # 0..5 # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1501 + # source://prism//lib/prism/translation/parser/compiler.rb#1523 def visit_range_node(node); end # 1r # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1523 + # source://prism//lib/prism/translation/parser/compiler.rb#1545 def visit_rational_node(node); end # redo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1529 + # source://prism//lib/prism/translation/parser/compiler.rb#1551 def visit_redo_node(node); end # /foo/ # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1535 + # source://prism//lib/prism/translation/parser/compiler.rb#1557 def visit_regular_expression_node(node); end # def foo(bar:); end # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1559 + # source://prism//lib/prism/translation/parser/compiler.rb#1581 def visit_required_keyword_parameter_node(node); end # def foo(bar); end # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1565 + # source://prism//lib/prism/translation/parser/compiler.rb#1587 def visit_required_parameter_node(node); end # foo rescue bar # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1571 + # source://prism//lib/prism/translation/parser/compiler.rb#1593 def visit_rescue_modifier_node(node); end # begin; rescue; end @@ -35267,7 +35318,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#1589 + # source://prism//lib/prism/translation/parser/compiler.rb#1611 def visit_rescue_node(node); end # def foo(*bar); end @@ -35276,13 +35327,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(*); end # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1598 + # source://prism//lib/prism/translation/parser/compiler.rb#1620 def visit_rest_parameter_node(node); end # retry # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1604 + # source://prism//lib/prism/translation/parser/compiler.rb#1626 def visit_retry_node(node); end # return @@ -35291,42 +35342,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # return 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1613 + # source://prism//lib/prism/translation/parser/compiler.rb#1635 def visit_return_node(node); end # self # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1625 + # source://prism//lib/prism/translation/parser/compiler.rb#1647 def visit_self_node(node); end # A shareable constant. # - # source://prism//lib/prism/translation/parser/compiler.rb#1630 + # source://prism//lib/prism/translation/parser/compiler.rb#1652 def visit_shareable_constant_node(node); end # class << self; end # ^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1636 + # source://prism//lib/prism/translation/parser/compiler.rb#1658 def visit_singleton_class_node(node); end # __ENCODING__ # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1648 + # source://prism//lib/prism/translation/parser/compiler.rb#1670 def visit_source_encoding_node(node); end # __FILE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1654 + # source://prism//lib/prism/translation/parser/compiler.rb#1676 def visit_source_file_node(node); end # __LINE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1660 + # source://prism//lib/prism/translation/parser/compiler.rb#1682 def visit_source_line_node(node); end # foo(*bar) @@ -35338,42 +35389,42 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # def foo(*); bar(*); end # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1672 + # source://prism//lib/prism/translation/parser/compiler.rb#1694 def visit_splat_node(node); end # A list of statements. # - # source://prism//lib/prism/translation/parser/compiler.rb#1685 + # source://prism//lib/prism/translation/parser/compiler.rb#1707 def visit_statements_node(node); end # "foo" # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1691 + # source://prism//lib/prism/translation/parser/compiler.rb#1713 def visit_string_node(node); end # super(foo) # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1716 + # source://prism//lib/prism/translation/parser/compiler.rb#1738 def visit_super_node(node); end # :foo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1739 + # source://prism//lib/prism/translation/parser/compiler.rb#1761 def visit_symbol_node(node); end # true # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1766 + # source://prism//lib/prism/translation/parser/compiler.rb#1788 def visit_true_node(node); end # undef foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1772 + # source://prism//lib/prism/translation/parser/compiler.rb#1794 def visit_undef_node(node); end # unless foo; bar end @@ -35382,7 +35433,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar unless foo # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1781 + # source://prism//lib/prism/translation/parser/compiler.rb#1803 def visit_unless_node(node); end # until foo; bar end @@ -35391,13 +35442,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar until foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1811 + # source://prism//lib/prism/translation/parser/compiler.rb#1833 def visit_until_node(node); end # case foo; when bar; end # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1837 + # source://prism//lib/prism/translation/parser/compiler.rb#1859 def visit_when_node(node); end # while foo; bar end @@ -35406,13 +35457,13 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # bar while foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1855 + # source://prism//lib/prism/translation/parser/compiler.rb#1877 def visit_while_node(node); end # `foo` # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1881 + # source://prism//lib/prism/translation/parser/compiler.rb#1903 def visit_x_string_node(node); end # yield @@ -35421,7 +35472,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # yield 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1907 + # source://prism//lib/prism/translation/parser/compiler.rb#1929 def visit_yield_node(node); end private @@ -35429,19 +35480,19 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Initialize a new compiler with the given option overrides, used to # visit a subtree with the given options. # - # source://prism//lib/prism/translation/parser/compiler.rb#1921 + # source://prism//lib/prism/translation/parser/compiler.rb#1943 def copy_compiler(forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end # When *, **, &, or ... are used as an argument in a method call, we # check if they were allowed by the current context. To determine that # we build this lookup table. # - # source://prism//lib/prism/translation/parser/compiler.rb#1928 + # source://prism//lib/prism/translation/parser/compiler.rb#1950 def find_forwarding(node); end # Returns the set of targets for a MultiTargetNode or a MultiWriteNode. # - # source://prism//lib/prism/translation/parser/compiler.rb#1941 + # source://prism//lib/prism/translation/parser/compiler.rb#1963 def multi_target_elements(node); end # Negate the value of a numeric node. This is a special case where you @@ -35450,7 +35501,7 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # however, marks this as a numeric literal. We have to massage the tree # here to get it into the correct form. # - # source://prism//lib/prism/translation/parser/compiler.rb#1953 + # source://prism//lib/prism/translation/parser/compiler.rb#1975 def numeric_negate(message_loc, receiver); end # Blocks can have a special set of parameters that automatically expand @@ -35459,12 +35510,12 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/compiler.rb#1967 + # source://prism//lib/prism/translation/parser/compiler.rb#1989 def procarg0?(parameters); end # Constructs a new source range from the given start and end offsets. # - # source://prism//lib/prism/translation/parser/compiler.rb#1984 + # source://prism//lib/prism/translation/parser/compiler.rb#2006 def srange(location); end # Constructs a new source range by finding the given character between @@ -35474,99 +35525,99 @@ class Prism::Translation::Parser::Compiler < ::Prism::Compiler # Note that end_offset is allowed to be nil, in which case this will # search until the end of the string. # - # source://prism//lib/prism/translation/parser/compiler.rb#1999 + # source://prism//lib/prism/translation/parser/compiler.rb#2021 def srange_find(start_offset, end_offset, character); end # Constructs a new source range from the given start and end offsets. # - # source://prism//lib/prism/translation/parser/compiler.rb#1989 + # source://prism//lib/prism/translation/parser/compiler.rb#2011 def srange_offsets(start_offset, end_offset); end # When the content of a string node is split across multiple lines, the # parser gem creates individual string nodes for each line the content is part of. # - # source://prism//lib/prism/translation/parser/compiler.rb#2116 + # source://prism//lib/prism/translation/parser/compiler.rb#2138 def string_nodes_from_interpolation(node, opening); end # Create parser string nodes from a single prism node. The parser gem # "glues" strings together when a line continuation is encountered. # - # source://prism//lib/prism/translation/parser/compiler.rb#2128 + # source://prism//lib/prism/translation/parser/compiler.rb#2150 def string_nodes_from_line_continuations(unescaped, escaped, start_offset, opening); end # Transform a location into a token that the parser gem expects. # - # source://prism//lib/prism/translation/parser/compiler.rb#2007 + # source://prism//lib/prism/translation/parser/compiler.rb#2029 def token(location); end # Visit a block node on a call. # - # source://prism//lib/prism/translation/parser/compiler.rb#2012 + # source://prism//lib/prism/translation/parser/compiler.rb#2034 def visit_block(call, block); end # Visit a heredoc that can be either a string or an xstring. # - # source://prism//lib/prism/translation/parser/compiler.rb#2047 + # source://prism//lib/prism/translation/parser/compiler.rb#2069 def visit_heredoc(node); end # Visit a numeric node and account for the optional sign. # - # source://prism//lib/prism/translation/parser/compiler.rb#2093 + # source://prism//lib/prism/translation/parser/compiler.rb#2115 def visit_numeric(node, value); end # Within the given block, track that we're within a pattern. # - # source://prism//lib/prism/translation/parser/compiler.rb#2105 + # source://prism//lib/prism/translation/parser/compiler.rb#2127 def within_pattern; end end # Raised when the tree is malformed or there is a bug in the compiler. # -# source://prism//lib/prism/translation/parser/compiler.rb#10 +# source://prism//lib/prism/translation/parser/compiler.rb#11 class Prism::Translation::Parser::Compiler::CompilationError < ::StandardError; end # Locations in the parser gem AST are generated using this class. We # store a reference to its constant to make it slightly faster to look # up. # -# source://prism//lib/prism/translation/parser/compiler.rb#1981 +# source://prism//lib/prism/translation/parser/compiler.rb#2003 Prism::Translation::Parser::Compiler::Range = Parser::Source::Range -# source://prism//lib/prism/translation/parser.rb#17 +# source://prism//lib/prism/translation/parser.rb#30 Prism::Translation::Parser::Diagnostic = Parser::Diagnostic # Accepts a list of prism tokens and converts them into the expected # format for the parser gem. # -# source://prism//lib/prism/translation/parser/lexer.rb#11 +# source://prism//lib/prism/translation/parser/lexer.rb#13 class Prism::Translation::Parser::Lexer # Initialize the lexer with the given source buffer, prism tokens, and # offset cache. # # @return [Lexer] a new instance of Lexer # - # source://prism//lib/prism/translation/parser/lexer.rb#229 + # source://prism//lib/prism/translation/parser/lexer.rb#231 def initialize(source_buffer, lexed, offset_cache); end # An array of tuples that contain prism tokens and their associated lex # state when they were lexed. # - # source://prism//lib/prism/translation/parser/lexer.rb#222 + # source://prism//lib/prism/translation/parser/lexer.rb#224 def lexed; end # A hash that maps offsets in bytes to offsets in characters. # - # source://prism//lib/prism/translation/parser/lexer.rb#225 + # source://prism//lib/prism/translation/parser/lexer.rb#227 def offset_cache; end # The Parser::Source::Buffer that the tokens were lexed from. # - # source://prism//lib/prism/translation/parser/lexer.rb#218 + # source://prism//lib/prism/translation/parser/lexer.rb#220 def source_buffer; end # Convert the prism tokens into the expected format for the parser gem. # - # source://prism//lib/prism/translation/parser/lexer.rb#239 + # source://prism//lib/prism/translation/parser/lexer.rb#241 def to_a; end private @@ -35574,111 +35625,111 @@ class Prism::Translation::Parser::Lexer # Wonky heredoc tab/spaces rules. # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L10548-L10558 # - # source://prism//lib/prism/translation/parser/lexer.rb#585 + # source://prism//lib/prism/translation/parser/lexer.rb#593 def calculate_heredoc_whitespace(heredoc_token_index); end # Escape a byte value, given the control and meta flags. # - # source://prism//lib/prism/translation/parser/lexer.rb#727 + # source://prism//lib/prism/translation/parser/lexer.rb#735 def escape_build(value, control, meta); end # Read an escape out of the string scanner, given the control and meta # flags, and push the unescaped value into the result. # - # source://prism//lib/prism/translation/parser/lexer.rb#735 + # source://prism//lib/prism/translation/parser/lexer.rb#743 def escape_read(result, scanner, control, meta); end # Determine if characters preceeded by a backslash should be escaped or not # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/lexer.rb#796 + # source://prism//lib/prism/translation/parser/lexer.rb#804 def interpolation?(quote); end # Parse a complex from the string representation. # - # source://prism//lib/prism/translation/parser/lexer.rb#556 + # source://prism//lib/prism/translation/parser/lexer.rb#564 def parse_complex(value); end # Parse a float from the string representation. # - # source://prism//lib/prism/translation/parser/lexer.rb#549 + # source://prism//lib/prism/translation/parser/lexer.rb#557 def parse_float(value); end # Parse an integer from the string representation. # - # source://prism//lib/prism/translation/parser/lexer.rb#542 + # source://prism//lib/prism/translation/parser/lexer.rb#550 def parse_integer(value); end # Parse a rational from the string representation. # - # source://prism//lib/prism/translation/parser/lexer.rb#571 + # source://prism//lib/prism/translation/parser/lexer.rb#579 def parse_rational(value); end # Determine if the string is part of a %-style array. # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/lexer.rb#806 + # source://prism//lib/prism/translation/parser/lexer.rb#814 def percent_array?(quote); end # For %-arrays whitespace, the parser gem only considers whitespace before the newline. # - # source://prism//lib/prism/translation/parser/lexer.rb#784 + # source://prism//lib/prism/translation/parser/lexer.rb#792 def percent_array_leading_whitespace(string); end # In a percent array, certain whitespace can be preceeded with a backslash, # causing the following characters to be part of the previous element. # - # source://prism//lib/prism/translation/parser/lexer.rb#776 + # source://prism//lib/prism/translation/parser/lexer.rb#784 def percent_array_unescape(string); end # Creates a new parser range, taking prisms byte offsets into account # - # source://prism//lib/prism/translation/parser/lexer.rb#537 + # source://prism//lib/prism/translation/parser/lexer.rb#545 def range(start_offset, end_offset); end # Regexp allow interpolation but are handled differently during unescaping # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/lexer.rb#801 + # source://prism//lib/prism/translation/parser/lexer.rb#809 def regexp?(quote); end # Certain strings are merged into a single string token. # # @return [Boolean] # - # source://prism//lib/prism/translation/parser/lexer.rb#710 + # source://prism//lib/prism/translation/parser/lexer.rb#718 def simplify_string?(value, quote); end # Wonky heredoc tab/spaces rules. # https://github.com/ruby/prism/blob/v1.3.0/src/prism.c#L16528-L16545 # - # source://prism//lib/prism/translation/parser/lexer.rb#632 + # source://prism//lib/prism/translation/parser/lexer.rb#640 def trim_heredoc_whitespace(string, heredoc); end # Apply Ruby string escaping rules # - # source://prism//lib/prism/translation/parser/lexer.rb#667 + # source://prism//lib/prism/translation/parser/lexer.rb#675 def unescape_string(string, quote); end end # Types of tokens that are allowed to continue a method call with comments in-between. # For these, the parser gem doesn't emit a newline token after the last comment. # -# source://prism//lib/prism/translation/parser/lexer.rb#209 +# source://prism//lib/prism/translation/parser/lexer.rb#211 Prism::Translation::Parser::Lexer::COMMENT_CONTINUATION_TYPES = T.let(T.unsafe(nil), Set) # When one of these delimiters is encountered, then the other # one is allowed to be escaped as well. # -# source://prism//lib/prism/translation/parser/lexer.rb#658 +# source://prism//lib/prism/translation/parser/lexer.rb#666 Prism::Translation::Parser::Lexer::DELIMITER_SYMETRY = T.let(T.unsafe(nil), Hash) # Escape sequences that have special and should appear unescaped in the resulting string. # -# source://prism//lib/prism/translation/parser/lexer.rb#649 +# source://prism//lib/prism/translation/parser/lexer.rb#657 Prism::Translation::Parser::Lexer::ESCAPES = T.let(T.unsafe(nil), Hash) # These constants represent flags in our lex state. We really, really @@ -35689,21 +35740,21 @@ Prism::Translation::Parser::Lexer::ESCAPES = T.let(T.unsafe(nil), Hash) # meantime we'll hide them from the documentation and mark them as # private constants. # -# source://prism//lib/prism/translation/parser/lexer.rb#191 +# source://prism//lib/prism/translation/parser/lexer.rb#193 Prism::Translation::Parser::Lexer::EXPR_BEG = T.let(T.unsafe(nil), Integer) -# source://prism//lib/prism/translation/parser/lexer.rb#192 +# source://prism//lib/prism/translation/parser/lexer.rb#194 Prism::Translation::Parser::Lexer::EXPR_LABEL = T.let(T.unsafe(nil), Integer) # Heredocs are complex and require us to keep track of a bit of info to refer to later # -# source://prism//lib/prism/translation/parser/lexer.rb#213 +# source://prism//lib/prism/translation/parser/lexer.rb#215 class Prism::Translation::Parser::Lexer::HeredocData < ::Struct # Returns the value of attribute common_whitespace # # @return [Object] the current value of common_whitespace # - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def common_whitespace; end # Sets the attribute common_whitespace @@ -35711,14 +35762,14 @@ class Prism::Translation::Parser::Lexer::HeredocData < ::Struct # @param value [Object] the value to set the attribute common_whitespace to. # @return [Object] the newly set value # - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def common_whitespace=(_); end # Returns the value of attribute identifier # # @return [Object] the current value of identifier # - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def identifier; end # Sets the attribute identifier @@ -35726,23 +35777,23 @@ class Prism::Translation::Parser::Lexer::HeredocData < ::Struct # @param value [Object] the value to set the attribute identifier to. # @return [Object] the newly set value # - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def identifier=(_); end class << self - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def [](*_arg0); end - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def inspect; end - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def keyword_init?; end - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def members; end - # source://prism//lib/prism/translation/parser/lexer.rb#213 + # source://prism//lib/prism/translation/parser/lexer.rb#215 def new(*_arg0); end end end @@ -35752,55 +35803,58 @@ end # NOTE: In edge cases like `-> (foo = -> (bar) {}) do end`, please note that `kDO` is still returned # instead of `kDO_LAMBDA`, which is expected: https://github.com/ruby/prism/pull/3046 # -# source://prism//lib/prism/translation/parser/lexer.rb#198 +# source://prism//lib/prism/translation/parser/lexer.rb#200 Prism::Translation::Parser::Lexer::LAMBDA_TOKEN_TYPES = T.let(T.unsafe(nil), Set) # The `PARENTHESIS_LEFT` token in Prism is classified as either `tLPAREN` or `tLPAREN2` in the Parser gem. # The following token types are listed as those classified as `tLPAREN`. # -# source://prism//lib/prism/translation/parser/lexer.rb#202 +# source://prism//lib/prism/translation/parser/lexer.rb#204 Prism::Translation::Parser::Lexer::LPAREN_CONVERSION_TOKEN_TYPES = T.let(T.unsafe(nil), Set) # https://github.com/whitequark/parser/blob/v3.3.6.0/lib/parser/lexer-strings.rl#L14 # -# source://prism//lib/prism/translation/parser/lexer.rb#663 +# source://prism//lib/prism/translation/parser/lexer.rb#671 Prism::Translation::Parser::Lexer::REGEXP_META_CHARACTERS = T.let(T.unsafe(nil), Array) -# source://prism//lib/prism/translation/parser/lexer.rb#235 +# source://prism//lib/prism/translation/parser/lexer.rb#237 Prism::Translation::Parser::Lexer::Range = Parser::Source::Range # The direct translating of types between the two lexers. # -# source://prism//lib/prism/translation/parser/lexer.rb#17 +# source://prism//lib/prism/translation/parser/lexer.rb#19 Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash) # These tokens are always skipped # -# source://prism//lib/prism/translation/parser/lexer.rb#13 +# source://prism//lib/prism/translation/parser/lexer.rb#15 Prism::Translation::Parser::Lexer::TYPES_ALWAYS_SKIP = T.let(T.unsafe(nil), Set) # The parser gem has a list of diagnostics with a hard-coded set of error # messages. We create our own diagnostic class in order to set our own # error messages. # -# source://prism//lib/prism/translation/parser.rb#23 +# source://prism//lib/prism/translation/parser.rb#36 class Prism::Translation::Parser::PrismDiagnostic < ::Parser::Diagnostic # Initialize a new diagnostic with the given message and location. # # @return [PrismDiagnostic] a new instance of PrismDiagnostic # - # source://prism//lib/prism/translation/parser.rb#28 + # source://prism//lib/prism/translation/parser.rb#41 def initialize(message, level, reason, location); end # This is the cached message coming from prism. # - # source://prism//lib/prism/translation/parser.rb#25 + # source://prism//lib/prism/translation/parser.rb#38 def message; end end -# source://prism//lib/prism/translation/parser.rb#34 +# source://prism//lib/prism/translation/parser.rb#47 Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) +# source://prism//lib/prism/translation/parser_current.rb#12 +Prism::Translation::ParserCurrent = Prism::Translation::Parser34 + # This class provides a compatibility layer between prism and Ripper. It # functions by parsing the entire tree first and then walking it and # executing each of the Ripper callbacks as it goes. To use this class, you @@ -35837,95 +35891,95 @@ Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) # - on_tstring_beg # - on_tstring_end # -# source://prism//lib/prism/translation/ripper.rb#43 +# source://prism//lib/prism/translation/ripper.rb#44 class Prism::Translation::Ripper < ::Prism::Compiler # Create a new Translation::Ripper object with the given source. # # @return [Ripper] a new instance of Ripper # - # source://prism//lib/prism/translation/ripper.rb#444 + # source://prism//lib/prism/translation/ripper.rb#445 def initialize(source, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end # The current column number of the parser. # - # source://prism//lib/prism/translation/ripper.rb#441 + # source://prism//lib/prism/translation/ripper.rb#442 def column; end # True if the parser encountered an error during parsing. # # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#457 + # source://prism//lib/prism/translation/ripper.rb#458 sig { returns(T::Boolean) } def error?; end # The filename of the source being parsed. # - # source://prism//lib/prism/translation/ripper.rb#435 + # source://prism//lib/prism/translation/ripper.rb#436 def filename; end # The current line number of the parser. # - # source://prism//lib/prism/translation/ripper.rb#438 + # source://prism//lib/prism/translation/ripper.rb#439 def lineno; end # Parse the source and return the result. # - # source://prism//lib/prism/translation/ripper.rb#462 + # source://prism//lib/prism/translation/ripper.rb#463 sig { returns(T.untyped) } def parse; end # The source that is being parsed. # - # source://prism//lib/prism/translation/ripper.rb#432 + # source://prism//lib/prism/translation/ripper.rb#433 def source; end # alias $foo $bar # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#561 + # source://prism//lib/prism/translation/ripper.rb#562 def visit_alias_global_variable_node(node); end # alias foo bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#551 + # source://prism//lib/prism/translation/ripper.rb#552 def visit_alias_method_node(node); end # foo => bar | baz # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#585 + # source://prism//lib/prism/translation/ripper.rb#586 def visit_alternation_pattern_node(node); end # a and b # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#605 + # source://prism//lib/prism/translation/ripper.rb#606 def visit_and_node(node); end # foo(bar) # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#796 + # source://prism//lib/prism/translation/ripper.rb#797 def visit_arguments_node(node); end # [] # ^^ # - # source://prism//lib/prism/translation/ripper.rb#615 + # source://prism//lib/prism/translation/ripper.rb#616 def visit_array_node(node); end # foo => [bar] # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#775 + # source://prism//lib/prism/translation/ripper.rb#776 def visit_array_pattern_node(node); end # { a: 1 } # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#803 + # source://prism//lib/prism/translation/ripper.rb#804 def visit_assoc_node(node); end # def foo(**); bar(**); end @@ -35934,47 +35988,47 @@ class Prism::Translation::Ripper < ::Prism::Compiler # { **foo } # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#816 + # source://prism//lib/prism/translation/ripper.rb#817 def visit_assoc_splat_node(node); end # $+ # ^^ # - # source://prism//lib/prism/translation/ripper.rb#825 + # source://prism//lib/prism/translation/ripper.rb#826 def visit_back_reference_read_node(node); end # begin end # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#832 + # source://prism//lib/prism/translation/ripper.rb#833 def visit_begin_node(node); end # foo(&bar) # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#896 + # source://prism//lib/prism/translation/ripper.rb#897 def visit_block_argument_node(node); end # foo { |; bar| } # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#902 + # source://prism//lib/prism/translation/ripper.rb#903 def visit_block_local_variable_node(node); end # Visit a BlockNode. # - # source://prism//lib/prism/translation/ripper.rb#908 + # source://prism//lib/prism/translation/ripper.rb#909 def visit_block_node(node); end # def foo(&bar); end # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#944 + # source://prism//lib/prism/translation/ripper.rb#945 def visit_block_parameter_node(node); end # A block's parameters. # - # source://prism//lib/prism/translation/ripper.rb#958 + # source://prism//lib/prism/translation/ripper.rb#959 def visit_block_parameters_node(node); end # break @@ -35983,13 +36037,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # break foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#982 + # source://prism//lib/prism/translation/ripper.rb#983 def visit_break_node(node); end # foo.bar &&= baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1204 + # source://prism//lib/prism/translation/ripper.rb#1205 def visit_call_and_write_node(node); end # foo @@ -36001,79 +36055,79 @@ class Prism::Translation::Ripper < ::Prism::Compiler # foo.bar() {} # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1002 + # source://prism//lib/prism/translation/ripper.rb#1003 def visit_call_node(node); end # foo.bar += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1182 + # source://prism//lib/prism/translation/ripper.rb#1183 def visit_call_operator_write_node(node); end # foo.bar ||= baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1226 + # source://prism//lib/prism/translation/ripper.rb#1227 def visit_call_or_write_node(node); end # foo.bar, = 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1248 + # source://prism//lib/prism/translation/ripper.rb#1249 def visit_call_target_node(node); end # foo => bar => baz # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1273 + # source://prism//lib/prism/translation/ripper.rb#1274 def visit_capture_pattern_node(node); end # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1296 + # source://prism//lib/prism/translation/ripper.rb#1297 def visit_case_match_node(node); end # case foo; when bar; end # ^^^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1283 + # source://prism//lib/prism/translation/ripper.rb#1284 def visit_case_node(node); end # class Foo; end # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1309 + # source://prism//lib/prism/translation/ripper.rb#1310 def visit_class_node(node); end # @@foo &&= bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1362 + # source://prism//lib/prism/translation/ripper.rb#1363 def visit_class_variable_and_write_node(node); end # @@foo += bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1348 + # source://prism//lib/prism/translation/ripper.rb#1349 def visit_class_variable_operator_write_node(node); end # @@foo ||= bar # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1376 + # source://prism//lib/prism/translation/ripper.rb#1377 def visit_class_variable_or_write_node(node); end # @@foo # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1327 + # source://prism//lib/prism/translation/ripper.rb#1328 def visit_class_variable_read_node(node); end # @@foo, = bar # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1390 + # source://prism//lib/prism/translation/ripper.rb#1391 def visit_class_variable_target_node(node); end # @@foo = 1 @@ -36082,55 +36136,55 @@ class Prism::Translation::Ripper < ::Prism::Compiler # @@foo, @@bar = 1 # ^^^^^ ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1337 + # source://prism//lib/prism/translation/ripper.rb#1338 def visit_class_variable_write_node(node); end # Foo &&= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1432 + # source://prism//lib/prism/translation/ripper.rb#1433 def visit_constant_and_write_node(node); end # Foo += bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1418 + # source://prism//lib/prism/translation/ripper.rb#1419 def visit_constant_operator_write_node(node); end # Foo ||= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1446 + # source://prism//lib/prism/translation/ripper.rb#1447 def visit_constant_or_write_node(node); end # Foo::Bar &&= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1533 + # source://prism//lib/prism/translation/ripper.rb#1534 def visit_constant_path_and_write_node(node); end # Foo::Bar # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1467 + # source://prism//lib/prism/translation/ripper.rb#1468 def visit_constant_path_node(node); end # Foo::Bar += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1519 + # source://prism//lib/prism/translation/ripper.rb#1520 def visit_constant_path_operator_write_node(node); end # Foo::Bar ||= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1547 + # source://prism//lib/prism/translation/ripper.rb#1548 def visit_constant_path_or_write_node(node); end # Foo::Bar, = baz # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1561 + # source://prism//lib/prism/translation/ripper.rb#1562 def visit_constant_path_target_node(node); end # Foo::Bar = 1 @@ -36139,19 +36193,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler # Foo::Foo, Bar::Bar = 1 # ^^^^^^^^ ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1490 + # source://prism//lib/prism/translation/ripper.rb#1491 def visit_constant_path_write_node(node); end # Foo # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1397 + # source://prism//lib/prism/translation/ripper.rb#1398 def visit_constant_read_node(node); end # Foo, = bar # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1460 + # source://prism//lib/prism/translation/ripper.rb#1461 def visit_constant_target_node(node); end # Foo = 1 @@ -36160,7 +36214,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # Foo, Bar = 1 # ^^^ ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1407 + # source://prism//lib/prism/translation/ripper.rb#1408 def visit_constant_write_node(node); end # def foo; end @@ -36169,7 +36223,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def self.foo; end # ^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1570 + # source://prism//lib/prism/translation/ripper.rb#1571 def visit_def_node(node); end # defined? a @@ -36178,72 +36232,72 @@ class Prism::Translation::Ripper < ::Prism::Compiler # defined?(a) # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1617 + # source://prism//lib/prism/translation/ripper.rb#1618 def visit_defined_node(node); end # if foo then bar else baz end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1624 + # source://prism//lib/prism/translation/ripper.rb#1640 def visit_else_node(node); end # "foo #{bar}" # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1640 + # source://prism//lib/prism/translation/ripper.rb#1656 def visit_embedded_statements_node(node); end # "foo #@bar" # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1661 + # source://prism//lib/prism/translation/ripper.rb#1677 def visit_embedded_variable_node(node); end # Visit an EnsureNode node. # - # source://prism//lib/prism/translation/ripper.rb#1672 + # source://prism//lib/prism/translation/ripper.rb#1688 def visit_ensure_node(node); end # false # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1690 + # source://prism//lib/prism/translation/ripper.rb#1706 def visit_false_node(node); end # foo => [*, bar, *] # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1697 + # source://prism//lib/prism/translation/ripper.rb#1713 def visit_find_pattern_node(node); end # if foo .. bar; end # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1722 + # source://prism//lib/prism/translation/ripper.rb#1738 def visit_flip_flop_node(node); end # 1.0 # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1736 + # source://prism//lib/prism/translation/ripper.rb#1752 def visit_float_node(node); end # for foo in bar do end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1742 + # source://prism//lib/prism/translation/ripper.rb#1758 def visit_for_node(node); end # def foo(...); bar(...); end # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1759 + # source://prism//lib/prism/translation/ripper.rb#1775 def visit_forwarding_arguments_node(node); end # def foo(...); end # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#1766 + # source://prism//lib/prism/translation/ripper.rb#1782 def visit_forwarding_parameter_node(node); end # super @@ -36252,37 +36306,37 @@ class Prism::Translation::Ripper < ::Prism::Compiler # super {} # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1776 + # source://prism//lib/prism/translation/ripper.rb#1792 def visit_forwarding_super_node(node); end # $foo &&= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1825 + # source://prism//lib/prism/translation/ripper.rb#1841 def visit_global_variable_and_write_node(node); end # $foo += bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1811 + # source://prism//lib/prism/translation/ripper.rb#1827 def visit_global_variable_operator_write_node(node); end # $foo ||= bar # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1839 + # source://prism//lib/prism/translation/ripper.rb#1855 def visit_global_variable_or_write_node(node); end # $foo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1790 + # source://prism//lib/prism/translation/ripper.rb#1806 def visit_global_variable_read_node(node); end # $foo, = bar # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1853 + # source://prism//lib/prism/translation/ripper.rb#1869 def visit_global_variable_target_node(node); end # $foo = 1 @@ -36291,19 +36345,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler # $foo, $bar = 1 # ^^^^ ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1800 + # source://prism//lib/prism/translation/ripper.rb#1816 def visit_global_variable_write_node(node); end # {} # ^^ # - # source://prism//lib/prism/translation/ripper.rb#1860 + # source://prism//lib/prism/translation/ripper.rb#1876 def visit_hash_node(node); end # foo => {} # ^^ # - # source://prism//lib/prism/translation/ripper.rb#1875 + # source://prism//lib/prism/translation/ripper.rb#1891 def visit_hash_pattern_node(node); end # if foo then bar end @@ -36315,140 +36369,140 @@ class Prism::Translation::Ripper < ::Prism::Compiler # foo ? bar : baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1917 + # source://prism//lib/prism/translation/ripper.rb#1933 def visit_if_node(node); end # 1i # ^^ # - # source://prism//lib/prism/translation/ripper.rb#1953 + # source://prism//lib/prism/translation/ripper.rb#1969 def visit_imaginary_node(node); end # { foo: } # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1959 + # source://prism//lib/prism/translation/ripper.rb#1975 def visit_implicit_node(node); end # foo { |bar,| } # ^ # - # source://prism//lib/prism/translation/ripper.rb#1964 + # source://prism//lib/prism/translation/ripper.rb#1980 def visit_implicit_rest_node(node); end # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1971 + # source://prism//lib/prism/translation/ripper.rb#1987 def visit_in_node(node); end # foo[bar] &&= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2006 + # source://prism//lib/prism/translation/ripper.rb#2022 def visit_index_and_write_node(node); end # foo[bar] += baz # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#1989 + # source://prism//lib/prism/translation/ripper.rb#2005 def visit_index_operator_write_node(node); end # foo[bar] ||= baz # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2023 + # source://prism//lib/prism/translation/ripper.rb#2039 def visit_index_or_write_node(node); end # foo[bar], = 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2040 + # source://prism//lib/prism/translation/ripper.rb#2056 def visit_index_target_node(node); end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2082 + # source://prism//lib/prism/translation/ripper.rb#2098 def visit_instance_variable_and_write_node(node); end # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2068 + # source://prism//lib/prism/translation/ripper.rb#2084 def visit_instance_variable_operator_write_node(node); end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2096 + # source://prism//lib/prism/translation/ripper.rb#2112 def visit_instance_variable_or_write_node(node); end # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2050 + # source://prism//lib/prism/translation/ripper.rb#2066 def visit_instance_variable_read_node(node); end # @foo, = bar # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2110 + # source://prism//lib/prism/translation/ripper.rb#2126 def visit_instance_variable_target_node(node); end # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2057 + # source://prism//lib/prism/translation/ripper.rb#2073 def visit_instance_variable_write_node(node); end # 1 # ^ # - # source://prism//lib/prism/translation/ripper.rb#2117 + # source://prism//lib/prism/translation/ripper.rb#2133 def visit_integer_node(node); end # if /foo #{bar}/ then end # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2123 + # source://prism//lib/prism/translation/ripper.rb#2139 def visit_interpolated_match_last_line_node(node); end # /foo #{bar}/ # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2142 + # source://prism//lib/prism/translation/ripper.rb#2158 def visit_interpolated_regular_expression_node(node); end # "foo #{bar}" # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2161 + # source://prism//lib/prism/translation/ripper.rb#2177 def visit_interpolated_string_node(node); end # :"foo #{bar}" # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2189 + # source://prism//lib/prism/translation/ripper.rb#2205 def visit_interpolated_symbol_node(node); end # `foo #{bar}` # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2202 + # source://prism//lib/prism/translation/ripper.rb#2218 def visit_interpolated_x_string_node(node); end # -> { it } # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2232 + # source://prism//lib/prism/translation/ripper.rb#2248 def visit_it_local_variable_read_node(node); end # -> { it } # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2239 + # source://prism//lib/prism/translation/ripper.rb#2255 def visit_it_parameters_node(node); end # foo(bar: baz) # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2244 + # source://prism//lib/prism/translation/ripper.rb#2260 def visit_keyword_hash_node(node); end # def foo(**bar); end @@ -36457,96 +36511,96 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(**); end # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2256 + # source://prism//lib/prism/translation/ripper.rb#2272 def visit_keyword_rest_parameter_node(node); end # -> {} # - # source://prism//lib/prism/translation/ripper.rb#2270 + # source://prism//lib/prism/translation/ripper.rb#2286 def visit_lambda_node(node); end # foo &&= bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2362 + # source://prism//lib/prism/translation/ripper.rb#2378 def visit_local_variable_and_write_node(node); end # foo += bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2348 + # source://prism//lib/prism/translation/ripper.rb#2364 def visit_local_variable_operator_write_node(node); end # foo ||= bar # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2376 + # source://prism//lib/prism/translation/ripper.rb#2392 def visit_local_variable_or_write_node(node); end # foo # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2330 + # source://prism//lib/prism/translation/ripper.rb#2346 def visit_local_variable_read_node(node); end # foo, = bar # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2390 + # source://prism//lib/prism/translation/ripper.rb#2406 def visit_local_variable_target_node(node); end # foo = 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2337 + # source://prism//lib/prism/translation/ripper.rb#2353 def visit_local_variable_write_node(node); end # if /foo/ then end # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2397 + # source://prism//lib/prism/translation/ripper.rb#2413 def visit_match_last_line_node(node); end # foo in bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2412 + # source://prism//lib/prism/translation/ripper.rb#2428 def visit_match_predicate_node(node); end # foo => bar # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2421 + # source://prism//lib/prism/translation/ripper.rb#2437 def visit_match_required_node(node); end # /(?foo)/ =~ bar # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2430 + # source://prism//lib/prism/translation/ripper.rb#2446 def visit_match_write_node(node); end # A node that is missing from the syntax tree. This is only used in the # case of a syntax error. # - # source://prism//lib/prism/translation/ripper.rb#2436 + # source://prism//lib/prism/translation/ripper.rb#2452 def visit_missing_node(node); end # module Foo; end # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2442 + # source://prism//lib/prism/translation/ripper.rb#2458 def visit_module_node(node); end # (foo, bar), bar = qux # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2459 + # source://prism//lib/prism/translation/ripper.rb#2475 def visit_multi_target_node(node); end # foo, bar = baz # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2513 + # source://prism//lib/prism/translation/ripper.rb#2529 def visit_multi_write_node(node); end # next @@ -36555,55 +36609,55 @@ class Prism::Translation::Ripper < ::Prism::Compiler # next foo # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2533 + # source://prism//lib/prism/translation/ripper.rb#2549 def visit_next_node(node); end # nil # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2547 + # source://prism//lib/prism/translation/ripper.rb#2563 def visit_nil_node(node); end # def foo(**nil); end # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2554 + # source://prism//lib/prism/translation/ripper.rb#2570 def visit_no_keywords_parameter_node(node); end # -> { _1 + _2 } # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2563 + # source://prism//lib/prism/translation/ripper.rb#2579 def visit_numbered_parameters_node(node); end # $1 # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2568 + # source://prism//lib/prism/translation/ripper.rb#2584 def visit_numbered_reference_read_node(node); end # def foo(bar: baz); end # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2575 + # source://prism//lib/prism/translation/ripper.rb#2591 def visit_optional_keyword_parameter_node(node); end # def foo(bar = 1); end # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2585 + # source://prism//lib/prism/translation/ripper.rb#2601 def visit_optional_parameter_node(node); end # a or b # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2595 + # source://prism//lib/prism/translation/ripper.rb#2611 def visit_or_node(node); end # def foo(bar, *baz); end # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2605 + # source://prism//lib/prism/translation/ripper.rb#2621 def visit_parameters_node(node); end # () @@ -36612,84 +36666,84 @@ class Prism::Translation::Ripper < ::Prism::Compiler # (1) # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2632 + # source://prism//lib/prism/translation/ripper.rb#2648 def visit_parentheses_node(node); end # foo => ^(bar) # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2646 + # source://prism//lib/prism/translation/ripper.rb#2662 def visit_pinned_expression_node(node); end # foo = 1 and bar => ^foo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2655 + # source://prism//lib/prism/translation/ripper.rb#2671 def visit_pinned_variable_node(node); end # END {} # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2661 + # source://prism//lib/prism/translation/ripper.rb#2677 def visit_post_execution_node(node); end # BEGIN {} # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2676 + # source://prism//lib/prism/translation/ripper.rb#2692 def visit_pre_execution_node(node); end # The top-level program node. # - # source://prism//lib/prism/translation/ripper.rb#2690 + # source://prism//lib/prism/translation/ripper.rb#2706 def visit_program_node(node); end # 0..5 # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2701 + # source://prism//lib/prism/translation/ripper.rb#2717 def visit_range_node(node); end # 1r # ^^ # - # source://prism//lib/prism/translation/ripper.rb#2715 + # source://prism//lib/prism/translation/ripper.rb#2731 def visit_rational_node(node); end # redo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2721 + # source://prism//lib/prism/translation/ripper.rb#2737 def visit_redo_node(node); end # /foo/ # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2728 + # source://prism//lib/prism/translation/ripper.rb#2744 def visit_regular_expression_node(node); end # def foo(bar:); end # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2750 + # source://prism//lib/prism/translation/ripper.rb#2766 def visit_required_keyword_parameter_node(node); end # def foo(bar); end # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#2757 + # source://prism//lib/prism/translation/ripper.rb#2773 def visit_required_parameter_node(node); end # foo rescue bar # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2764 + # source://prism//lib/prism/translation/ripper.rb#2780 def visit_rescue_modifier_node(node); end # begin; rescue; end # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2774 + # source://prism//lib/prism/translation/ripper.rb#2790 def visit_rescue_node(node); end # def foo(*bar); end @@ -36698,13 +36752,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(*); end # ^ # - # source://prism//lib/prism/translation/ripper.rb#2832 + # source://prism//lib/prism/translation/ripper.rb#2848 def visit_rest_parameter_node(node); end # retry # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2844 + # source://prism//lib/prism/translation/ripper.rb#2860 def visit_retry_node(node); end # return @@ -36713,42 +36767,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler # return 1 # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2854 + # source://prism//lib/prism/translation/ripper.rb#2870 def visit_return_node(node); end # self # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2868 + # source://prism//lib/prism/translation/ripper.rb#2884 def visit_self_node(node); end # A shareable constant. # - # source://prism//lib/prism/translation/ripper.rb#2874 + # source://prism//lib/prism/translation/ripper.rb#2890 def visit_shareable_constant_node(node); end # class << self; end # ^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2880 + # source://prism//lib/prism/translation/ripper.rb#2896 def visit_singleton_class_node(node); end # __ENCODING__ # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2890 + # source://prism//lib/prism/translation/ripper.rb#2906 def visit_source_encoding_node(node); end # __FILE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2897 + # source://prism//lib/prism/translation/ripper.rb#2913 def visit_source_file_node(node); end # __LINE__ # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2904 + # source://prism//lib/prism/translation/ripper.rb#2920 def visit_source_line_node(node); end # foo(*bar) @@ -36760,42 +36814,42 @@ class Prism::Translation::Ripper < ::Prism::Compiler # def foo(*); bar(*); end # ^ # - # source://prism//lib/prism/translation/ripper.rb#2917 + # source://prism//lib/prism/translation/ripper.rb#2933 def visit_splat_node(node); end # A list of statements. # - # source://prism//lib/prism/translation/ripper.rb#2922 + # source://prism//lib/prism/translation/ripper.rb#2938 def visit_statements_node(node); end # "foo" # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#2939 + # source://prism//lib/prism/translation/ripper.rb#2955 def visit_string_node(node); end # super(foo) # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3071 + # source://prism//lib/prism/translation/ripper.rb#3087 def visit_super_node(node); end # :foo # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3092 + # source://prism//lib/prism/translation/ripper.rb#3108 def visit_symbol_node(node); end # true # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3116 + # source://prism//lib/prism/translation/ripper.rb#3132 def visit_true_node(node); end # undef foo # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3123 + # source://prism//lib/prism/translation/ripper.rb#3139 def visit_undef_node(node); end # unless foo; bar end @@ -36804,7 +36858,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar unless foo # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3135 + # source://prism//lib/prism/translation/ripper.rb#3151 def visit_unless_node(node); end # until foo; bar end @@ -36813,13 +36867,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar until foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3163 + # source://prism//lib/prism/translation/ripper.rb#3179 def visit_until_node(node); end # case foo; when bar; end # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3187 + # source://prism//lib/prism/translation/ripper.rb#3203 def visit_when_node(node); end # while foo; bar end @@ -36828,13 +36882,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # bar while foo # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3208 + # source://prism//lib/prism/translation/ripper.rb#3224 def visit_while_node(node); end # `foo` # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3232 + # source://prism//lib/prism/translation/ripper.rb#3248 def visit_x_string_node(node); end # yield @@ -36843,32 +36897,32 @@ class Prism::Translation::Ripper < ::Prism::Compiler # yield 1 # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#3255 + # source://prism//lib/prism/translation/ripper.rb#3271 def visit_yield_node(node); end private # :stopdoc: # - # source://prism//lib/prism/translation/ripper.rb#3395 + # source://prism//lib/prism/translation/ripper.rb#3411 def _dispatch_0; end - # source://prism//lib/prism/translation/ripper.rb#3396 + # source://prism//lib/prism/translation/ripper.rb#3412 def _dispatch_1(_); end - # source://prism//lib/prism/translation/ripper.rb#3397 + # source://prism//lib/prism/translation/ripper.rb#3413 def _dispatch_2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3398 + # source://prism//lib/prism/translation/ripper.rb#3414 def _dispatch_3(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3399 + # source://prism//lib/prism/translation/ripper.rb#3415 def _dispatch_4(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3400 + # source://prism//lib/prism/translation/ripper.rb#3416 def _dispatch_5(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3401 + # source://prism//lib/prism/translation/ripper.rb#3417 def _dispatch_7(_, _, _, _, _, _, _); end # This method is responsible for updating lineno and column information @@ -36877,19 +36931,19 @@ class Prism::Translation::Ripper < ::Prism::Compiler # This method could be drastically improved with some caching on the start # of every line, but for now it's good enough. # - # source://prism//lib/prism/translation/ripper.rb#3385 + # source://prism//lib/prism/translation/ripper.rb#3401 def bounds(location); end # Returns true if the given node is a command node. # # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#1173 + # source://prism//lib/prism/translation/ripper.rb#1174 def command?(node); end # This method is called when the parser found syntax error. # - # source://prism//lib/prism/translation/ripper.rb#3423 + # source://prism//lib/prism/translation/ripper.rb#3439 def compile_error(msg); end # This method is provided by the Ripper C extension. It is called when a @@ -36897,631 +36951,631 @@ class Prism::Translation::Ripper < ::Prism::Compiler # that it will modify the string in place and return the number of bytes # that were removed. # - # source://prism//lib/prism/translation/ripper.rb#3438 + # source://prism//lib/prism/translation/ripper.rb#3454 def dedent_string(string, width); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_BEGIN(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_CHAR(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_END(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on___end__(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_alias_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_aref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_aref_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_arg_ambiguous(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_arg_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_args_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_args_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_args_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_args_forward; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_args_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_array(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_aryptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_assign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_assign_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_assoc_new(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_assoc_splat(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_assoclist_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_backref(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_backtick(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_bare_assoc_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_begin(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_binary(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_block_var(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_blockarg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_bodystmt(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_brace_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_break(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_call(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_case(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_class(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_class_name_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_comma(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_command(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_command_call(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_comment(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_const(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_const_path_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_const_path_ref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_cvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_def(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_defined(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_defs(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_do_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_dot2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_dot3(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_dyna_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_else(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_elsif(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embdoc(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embdoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embdoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embexpr_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embexpr_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_embvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_ensure(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_excessed_comma; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_fcall(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_field(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_float(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_fndptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_for(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_gvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_heredoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_heredoc_dedent(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_heredoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_hshptn(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_ident(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_if(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_if_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_ifop(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_ignored_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_ignored_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_imaginary(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_in(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_int(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_ivar(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_kw(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_kwrest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_label(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_label_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_lambda(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_lbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_lbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_lparen(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_magic_comment(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_massign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_method_add_arg(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_method_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mlhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mlhs_add_post(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mlhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mlhs_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mlhs_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_module(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mrhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mrhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mrhs_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_mrhs_new_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_next(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_nokw_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_op(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_opassign(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_operator_ambiguous(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_param_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_params(_, _, _, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_parse_error(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_period(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_program(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_qsymbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_qsymbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_qsymbols_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_qwords_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_qwords_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_qwords_new; end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_rational(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_rbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_rbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_redo; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_regexp_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_regexp_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_regexp_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_regexp_literal(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_regexp_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_rescue(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_rescue_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_rest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_retry; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_return(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_return0; end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_rparen(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_sclass(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_semicolon(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_stmts_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_stmts_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_concat(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_content; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_dvar(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_embexpr(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_string_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_super(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_symbeg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_symbol_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_symbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_symbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_symbols_new; end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_tlambda(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_tlambeg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_top_const_field(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_top_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_tstring_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_tstring_content(_); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_tstring_end(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_unary(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_undef(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_unless(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_unless_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_until(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_until_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_var_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_var_field(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_var_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_vcall(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_void_stmt; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_when(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_while(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_while_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_word_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_word_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_words_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_words_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_words_new; end - # source://prism//lib/prism/translation/ripper.rb#3431 + # source://prism//lib/prism/translation/ripper.rb#3447 def on_words_sep(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_xstring_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_xstring_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_xstring_new; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_yield(_); end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_yield0; end - # source://prism//lib/prism/translation/ripper.rb#3409 + # source://prism//lib/prism/translation/ripper.rb#3425 def on_zsuper; end # Lazily initialize the parse result. # - # source://prism//lib/prism/translation/ripper.rb#3281 + # source://prism//lib/prism/translation/ripper.rb#3297 def result; end # Returns true if there is a comma between the two locations. # # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#3290 + # source://prism//lib/prism/translation/ripper.rb#3306 def trailing_comma?(left, right); end # Visit one side of an alias global variable node. # - # source://prism//lib/prism/translation/ripper.rb#570 + # source://prism//lib/prism/translation/ripper.rb#571 def visit_alias_global_variable_node_value(node); end # Visit a list of elements, like the elements of an array or arguments. # - # source://prism//lib/prism/translation/ripper.rb#756 + # source://prism//lib/prism/translation/ripper.rb#757 def visit_arguments(elements); end # Visit the clauses of a begin node to form an on_bodystmt call. # - # source://prism//lib/prism/translation/ripper.rb#840 + # source://prism//lib/prism/translation/ripper.rb#841 def visit_begin_node_clauses(location, node, allow_newline); end # Visit the body of a structure that can have either a set of statements # or statements wrapped in rescue/else/ensure. # - # source://prism//lib/prism/translation/ripper.rb#875 + # source://prism//lib/prism/translation/ripper.rb#876 def visit_body_node(location, node, allow_newline = T.unsafe(nil)); end # Visit the arguments and block of a call node and return the arguments # and block as they should be used. # - # source://prism//lib/prism/translation/ripper.rb#1146 + # source://prism//lib/prism/translation/ripper.rb#1147 def visit_call_node_arguments(arguments_node, block_node, trailing_comma); end # Visit a constant path that is part of a write node. # - # source://prism//lib/prism/translation/ripper.rb#1499 + # source://prism//lib/prism/translation/ripper.rb#1500 def visit_constant_path_write_node_target(node); end # Visit a destructured positional parameter node. # - # source://prism//lib/prism/translation/ripper.rb#2619 + # source://prism//lib/prism/translation/ripper.rb#2635 def visit_destructured_parameter_node(node); end # Visit a string that is expressed using a <<~ heredoc. # - # source://prism//lib/prism/translation/ripper.rb#2990 + # source://prism//lib/prism/translation/ripper.rb#3006 def visit_heredoc_node(parts, base); end # Ripper gives back the escaped string content but strips out the common @@ -37530,34 +37584,34 @@ class Prism::Translation::Ripper < ::Prism::Compiler # work well together, so here we need to re-derive the common leading # whitespace. # - # source://prism//lib/prism/translation/ripper.rb#2965 + # source://prism//lib/prism/translation/ripper.rb#2981 def visit_heredoc_node_whitespace(parts); end # Visit a heredoc node that is representing a string. # - # source://prism//lib/prism/translation/ripper.rb#3036 + # source://prism//lib/prism/translation/ripper.rb#3052 def visit_heredoc_string_node(node); end # Visit a heredoc node that is representing an xstring. # - # source://prism//lib/prism/translation/ripper.rb#3053 + # source://prism//lib/prism/translation/ripper.rb#3069 def visit_heredoc_x_string_node(node); end # Visit the targets of a multi-target node. # - # source://prism//lib/prism/translation/ripper.rb#2472 + # source://prism//lib/prism/translation/ripper.rb#2488 def visit_multi_target_node_targets(lefts, rest, rights, skippable); end # Visit a node that represents a number. We need to explicitly handle the # unary - operator. # - # source://prism//lib/prism/translation/ripper.rb#3329 + # source://prism//lib/prism/translation/ripper.rb#3345 def visit_number_node(node); end # Visit a pattern within a pattern match. This is used to bypass the # parenthesis node that can be used to wrap patterns. # - # source://prism//lib/prism/translation/ripper.rb#595 + # source://prism//lib/prism/translation/ripper.rb#596 def visit_pattern_node(node); end # Visit the list of statements of a statements node. We support nil @@ -37565,49 +37619,49 @@ class Prism::Translation::Ripper < ::Prism::Compiler # structure of the prism parse tree, but we manually add them here so that # we can mirror Ripper's void stmt. # - # source://prism//lib/prism/translation/ripper.rb#2931 + # source://prism//lib/prism/translation/ripper.rb#2947 def visit_statements_node_body(body); end # Visit an individual part of a string-like node. # - # source://prism//lib/prism/translation/ripper.rb#2221 + # source://prism//lib/prism/translation/ripper.rb#2237 def visit_string_content(part); end # Visit the string content of a particular node. This method is used to # split into the various token types. # - # source://prism//lib/prism/translation/ripper.rb#3302 + # source://prism//lib/prism/translation/ripper.rb#3318 def visit_token(token, allow_keywords = T.unsafe(nil)); end # Dispatch a words_sep event that contains the space between the elements # of list literals. # - # source://prism//lib/prism/translation/ripper.rb#745 + # source://prism//lib/prism/translation/ripper.rb#746 def visit_words_sep(opening_loc, previous, current); end # Visit a node that represents a write value. This is used to handle the # special case of an implicit array that is generated without brackets. # - # source://prism//lib/prism/translation/ripper.rb#3347 + # source://prism//lib/prism/translation/ripper.rb#3363 def visit_write_value(node); end # Returns true if there is a semicolon between the two locations. # # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#3295 + # source://prism//lib/prism/translation/ripper.rb#3311 def void_stmt?(left, right, allow_newline); end # This method is called when weak warning is produced by the parser. # +fmt+ and +args+ is printf style. # - # source://prism//lib/prism/translation/ripper.rb#3414 + # source://prism//lib/prism/translation/ripper.rb#3430 def warn(fmt, *args); end # This method is called when strong warning is produced by the parser. # +fmt+ and +args+ is printf style. # - # source://prism//lib/prism/translation/ripper.rb#3419 + # source://prism//lib/prism/translation/ripper.rb#3435 def warning(fmt, *args); end class << self @@ -37633,13 +37687,13 @@ class Prism::Translation::Ripper < ::Prism::Compiler # [[1, 12], :on_sp, " ", END ], # [[1, 13], :on_kw, "end", END ]] # - # source://prism//lib/prism/translation/ripper.rb#72 + # source://prism//lib/prism/translation/ripper.rb#73 def lex(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end # Parses the given Ruby program read from +src+. # +src+ must be a String or an IO or a object with a #gets method. # - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper.rb#47 def parse(src, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end # Parses +src+ and create S-exp tree. @@ -37660,7 +37714,7 @@ class Prism::Translation::Ripper < ::Prism::Compiler # [:paren, [:params, [[:@ident, "a", [1, 6]]], nil, nil, nil, nil, nil, nil]], # [:bodystmt, [[:var_ref, [:@kw, "nil", [1, 9]]]], nil, nil, nil]]]] # - # source://prism//lib/prism/translation/ripper.rb#381 + # source://prism//lib/prism/translation/ripper.rb#382 def sexp(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end # Parses +src+ and create S-exp tree. @@ -37686,637 +37740,637 @@ class Prism::Translation::Ripper < ::Prism::Compiler # nil, # nil]]]] # - # source://prism//lib/prism/translation/ripper.rb#416 + # source://prism//lib/prism/translation/ripper.rb#417 def sexp_raw(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end end end # A list of all of the Ruby binary operators. # -# source://prism//lib/prism/translation/ripper.rb#337 +# source://prism//lib/prism/translation/ripper.rb#338 Prism::Translation::Ripper::BINARY_OPERATORS = T.let(T.unsafe(nil), Array) # This array contains name of all ripper events. # -# source://prism//lib/prism/translation/ripper.rb#289 +# source://prism//lib/prism/translation/ripper.rb#290 Prism::Translation::Ripper::EVENTS = T.let(T.unsafe(nil), Array) # A list of all of the Ruby keywords. # -# source://prism//lib/prism/translation/ripper.rb#292 +# source://prism//lib/prism/translation/ripper.rb#293 Prism::Translation::Ripper::KEYWORDS = T.let(T.unsafe(nil), Array) # This array contains name of parser events. # -# source://prism//lib/prism/translation/ripper.rb#283 +# source://prism//lib/prism/translation/ripper.rb#284 Prism::Translation::Ripper::PARSER_EVENTS = T.let(T.unsafe(nil), Array) # This contains a table of all of the parser events and their # corresponding arity. # -# source://prism//lib/prism/translation/ripper.rb#84 +# source://prism//lib/prism/translation/ripper.rb#85 Prism::Translation::Ripper::PARSER_EVENT_TABLE = T.let(T.unsafe(nil), Hash) # This array contains name of scanner events. # -# source://prism//lib/prism/translation/ripper.rb#286 +# source://prism//lib/prism/translation/ripper.rb#287 Prism::Translation::Ripper::SCANNER_EVENTS = T.let(T.unsafe(nil), Array) # This contains a table of all of the scanner events and their # corresponding arity. # -# source://prism//lib/prism/translation/ripper.rb#227 +# source://prism//lib/prism/translation/ripper.rb#228 Prism::Translation::Ripper::SCANNER_EVENT_TABLE = T.let(T.unsafe(nil), Hash) # This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that # returns the arrays of [type, *children]. # -# source://prism//lib/prism/translation/ripper/sexp.rb#10 +# source://prism//lib/prism/translation/ripper/sexp.rb#11 class Prism::Translation::Ripper::SexpBuilder < ::Prism::Translation::Ripper # :stopdoc: # - # source://prism//lib/prism/translation/ripper/sexp.rb#13 + # source://prism//lib/prism/translation/ripper/sexp.rb#14 def error; end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_BEGIN(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_CHAR(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_END(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on___end__(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_alias(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_alias_error(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aref(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aref_field(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_arg_ambiguous(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_arg_paren(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add_block(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add_star(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_forward(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_array(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aryptn(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assign(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assign_error(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoc_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoc_splat(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoclist_from_args(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_backref(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_backtick(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_bare_assoc_hash(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_begin(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_binary(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_block_var(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_blockarg(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_bodystmt(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_brace_block(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_break(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_call(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_case(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_class(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_class_name_error(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_comma(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_command(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_command_call(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_comment(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_const(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_path_field(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_path_ref(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_ref(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_cvar(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_def(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_defined(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_defs(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_do_block(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dot2(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dot3(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dyna_symbol(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_else(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_elsif(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embdoc(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embdoc_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embdoc_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embexpr_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embexpr_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_embvar(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_ensure(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_excessed_comma(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_fcall(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_field(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_float(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_fndptn(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_for(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_gvar(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_hash(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_heredoc_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_heredoc_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_hshptn(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_ident(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_if(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_if_mod(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_ifop(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_ignored_nl(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_ignored_sp(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_imaginary(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_in(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_int(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_ivar(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_kw(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_kwrest_param(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_label(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_label_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_lambda(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_lbrace(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_lbracket(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_lparen(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_magic_comment(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_massign(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_method_add_arg(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_method_add_block(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add_post(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add_star(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_paren(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_module(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_add_star(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_new_from_args(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_next(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_nl(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_nokw_param(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_op(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_opassign(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_operator_ambiguous(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_param_error(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_params(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_paren(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_period(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_program(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qsymbols_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_qsymbols_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qsymbols_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qwords_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_qwords_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qwords_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_rational(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_rbrace(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_rbracket(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_redo(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_regexp_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_regexp_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_literal(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rescue(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rescue_mod(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rest_param(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_retry(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_return(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_return0(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_rparen(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_sclass(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_semicolon(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_sp(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_stmts_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_stmts_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_concat(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_content(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_dvar(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_embexpr(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_literal(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_super(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_symbeg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbol(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbol_literal(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbols_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_symbols_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbols_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_tlambda(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_tlambeg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_top_const_field(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_top_const_ref(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_tstring_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_tstring_content(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_tstring_end(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unary(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_undef(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unless(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unless_mod(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_until(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_until_mod(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_alias(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_field(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_ref(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_vcall(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_void_stmt(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_when(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_while(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_while_mod(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_word_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_word_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_words_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_words_beg(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_words_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#54 + # source://prism//lib/prism/translation/ripper/sexp.rb#55 def on_words_sep(tok); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_add(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_literal(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_new(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_yield(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_yield0(*args); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_zsuper(*args); end private - # source://prism//lib/prism/translation/ripper/sexp.rb#66 + # source://prism//lib/prism/translation/ripper/sexp.rb#67 def compile_error(mesg); end - # source://prism//lib/prism/translation/ripper/sexp.rb#17 + # source://prism//lib/prism/translation/ripper/sexp.rb#18 def dedent_element(e, width); end - # source://prism//lib/prism/translation/ripper/sexp.rb#61 + # source://prism//lib/prism/translation/ripper/sexp.rb#62 def on_error(mesg); end - # source://prism//lib/prism/translation/ripper/sexp.rb#24 + # source://prism//lib/prism/translation/ripper/sexp.rb#25 def on_heredoc_dedent(val, width); end - # source://prism//lib/prism/translation/ripper/sexp.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_parse_error(mesg); end end @@ -38324,113 +38378,113 @@ end # returns the same values as ::Ripper::SexpBuilder except with a couple of # niceties that flatten linked lists into arrays. # -# source://prism//lib/prism/translation/ripper/sexp.rb#74 +# source://prism//lib/prism/translation/ripper/sexp.rb#75 class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper::SexpBuilder private - # source://prism//lib/prism/translation/ripper/sexp.rb#92 + # source://prism//lib/prism/translation/ripper/sexp.rb#93 def _dispatch_event_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#96 + # source://prism//lib/prism/translation/ripper/sexp.rb#97 def _dispatch_event_push(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_args_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_args_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#79 + # source://prism//lib/prism/translation/ripper/sexp.rb#80 def on_heredoc_dedent(val, width); end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_mlhs_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#109 + # source://prism//lib/prism/translation/ripper/sexp.rb#110 def on_mlhs_add_post(list, post); end - # source://prism//lib/prism/translation/ripper/sexp.rb#105 + # source://prism//lib/prism/translation/ripper/sexp.rb#106 def on_mlhs_add_star(list, star); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_mlhs_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#101 + # source://prism//lib/prism/translation/ripper/sexp.rb#102 def on_mlhs_paren(list); end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_mrhs_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_mrhs_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_qsymbols_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_qsymbols_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_qwords_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_qwords_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_regexp_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_regexp_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_stmts_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_stmts_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_string_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_symbols_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_symbols_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_word_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_word_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_words_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_words_new; end - # source://prism//lib/prism/translation/ripper/sexp.rb#117 + # source://prism//lib/prism/translation/ripper/sexp.rb#118 def on_xstring_add(list, item); end - # source://prism//lib/prism/translation/ripper/sexp.rb#115 + # source://prism//lib/prism/translation/ripper/sexp.rb#116 def on_xstring_new; end end # This module is the entry-point for converting a prism syntax tree into the # seattlerb/ruby_parser gem's syntax tree. # -# source://prism//lib/prism/translation/ruby_parser.rb#14 +# source://prism//lib/prism/translation/ruby_parser.rb#15 class Prism::Translation::RubyParser # Parse the given source and translate it into the seattlerb/ruby_parser # gem's Sexp format. # - # source://prism//lib/prism/translation/ruby_parser.rb#1608 + # source://prism//lib/prism/translation/ruby_parser.rb#1891 def parse(source, filepath = T.unsafe(nil)); end # Parse the given file and translate it into the seattlerb/ruby_parser # gem's Sexp format. # - # source://prism//lib/prism/translation/ruby_parser.rb#1614 + # source://prism//lib/prism/translation/ruby_parser.rb#1897 def parse_file(filepath); end private @@ -38438,166 +38492,199 @@ class Prism::Translation::RubyParser # Translate the given parse result and filepath into the # seattlerb/ruby_parser gem's Sexp format. # - # source://prism//lib/prism/translation/ruby_parser.rb#1636 + # source://prism//lib/prism/translation/ruby_parser.rb#1919 def translate(result, filepath); end class << self # Parse the given source and translate it into the seattlerb/ruby_parser # gem's Sexp format. # - # source://prism//lib/prism/translation/ruby_parser.rb#1621 + # source://prism//lib/prism/translation/ruby_parser.rb#1904 def parse(source, filepath = T.unsafe(nil)); end # Parse the given file and translate it into the seattlerb/ruby_parser # gem's Sexp format. # - # source://prism//lib/prism/translation/ruby_parser.rb#1627 + # source://prism//lib/prism/translation/ruby_parser.rb#1910 def parse_file(filepath); end end end # A prism visitor that builds Sexp objects. # -# source://prism//lib/prism/translation/ruby_parser.rb#16 +# source://prism//lib/prism/translation/ruby_parser.rb#17 class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # Initialize a new compiler with the given file name. # # @return [Compiler] a new instance of Compiler # - # source://prism//lib/prism/translation/ruby_parser.rb#31 + # source://prism//lib/prism/translation/ruby_parser.rb#32 def initialize(file, in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end # This is the name of the file that we are compiling. We set it on every - # Sexp object that is generated, and also use it to compile __FILE__ + # Sexp object that is generated, and also use it to compile `__FILE__` # nodes. # - # source://prism//lib/prism/translation/ruby_parser.rb#20 + # source://prism//lib/prism/translation/ruby_parser.rb#21 def file; end # Class variables will change their type based on if they are inside of # a method definition or not, so we need to track that state. # - # source://prism//lib/prism/translation/ruby_parser.rb#24 + # source://prism//lib/prism/translation/ruby_parser.rb#25 def in_def; end # Some nodes will change their representation if they are inside of a # pattern, so we need to track that state. # - # source://prism//lib/prism/translation/ruby_parser.rb#28 + # source://prism//lib/prism/translation/ruby_parser.rb#29 def in_pattern; end + # ``` # alias $foo $bar # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#45 + # source://prism//lib/prism/translation/ruby_parser.rb#50 def visit_alias_global_variable_node(node); end + # ``` # alias foo bar # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#39 + # source://prism//lib/prism/translation/ruby_parser.rb#42 def visit_alias_method_node(node); end + # ``` # foo => bar | baz # ^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#51 + # source://prism//lib/prism/translation/ruby_parser.rb#58 def visit_alternation_pattern_node(node); end + # ``` # a and b # ^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#57 + # source://prism//lib/prism/translation/ruby_parser.rb#66 def visit_and_node(node); end + # ``` # foo(bar) # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#108 + # source://prism//lib/prism/translation/ruby_parser.rb#123 def visit_arguments_node(node); end + # ``` # [] # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#75 + # source://prism//lib/prism/translation/ruby_parser.rb#86 def visit_array_node(node); end + # ``` # foo => [bar] # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#85 + # source://prism//lib/prism/translation/ruby_parser.rb#98 def visit_array_pattern_node(node); end + # ``` # { a: 1 } # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#114 + # source://prism//lib/prism/translation/ruby_parser.rb#131 def visit_assoc_node(node); end + # ``` # def foo(**); bar(**); end # ^^ # # { **foo } # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#123 + # source://prism//lib/prism/translation/ruby_parser.rb#142 def visit_assoc_splat_node(node); end + # ``` # $+ # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#133 + # source://prism//lib/prism/translation/ruby_parser.rb#154 def visit_back_reference_read_node(node); end + # ``` # begin end # ^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#139 + # source://prism//lib/prism/translation/ruby_parser.rb#162 def visit_begin_node(node); end + # ``` # foo(&bar) # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#172 + # source://prism//lib/prism/translation/ruby_parser.rb#197 def visit_block_argument_node(node); end + # ``` # foo { |; bar| } # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#180 + # source://prism//lib/prism/translation/ruby_parser.rb#207 def visit_block_local_variable_node(node); end # A block on a keyword or method call. # - # source://prism//lib/prism/translation/ruby_parser.rb#185 + # source://prism//lib/prism/translation/ruby_parser.rb#212 def visit_block_node(node); end + # ``` # def foo(&bar); end # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#191 + # source://prism//lib/prism/translation/ruby_parser.rb#220 def visit_block_parameter_node(node); end # A block's parameters. # - # source://prism//lib/prism/translation/ruby_parser.rb#196 + # source://prism//lib/prism/translation/ruby_parser.rb#225 def visit_block_parameters_node(node); end + # ``` # break # ^^^^^ # # break foo # ^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#236 + # source://prism//lib/prism/translation/ruby_parser.rb#267 def visit_break_node(node); end + # ``` # foo.bar &&= baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#304 + # source://prism//lib/prism/translation/ruby_parser.rb#341 def visit_call_and_write_node(node); end + # ``` # foo # ^^^ # @@ -38606,313 +38693,409 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # # foo.bar() {} # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#254 + # source://prism//lib/prism/translation/ruby_parser.rb#287 def visit_call_node(node); end + # ``` # foo.bar += baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#294 + # source://prism//lib/prism/translation/ruby_parser.rb#329 def visit_call_operator_write_node(node); end + # ``` # foo.bar ||= baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#314 + # source://prism//lib/prism/translation/ruby_parser.rb#353 def visit_call_or_write_node(node); end + # ``` # foo.bar, = 1 # ^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#337 + # source://prism//lib/prism/translation/ruby_parser.rb#378 def visit_call_target_node(node); end + # ``` # foo => bar => baz # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#343 + # source://prism//lib/prism/translation/ruby_parser.rb#386 def visit_capture_pattern_node(node); end + # ``` # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#355 + # source://prism//lib/prism/translation/ruby_parser.rb#402 def visit_case_match_node(node); end + # ``` # case foo; when bar; end # ^^^^^^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#349 + # source://prism//lib/prism/translation/ruby_parser.rb#394 def visit_case_node(node); end + # ``` # class Foo; end # ^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#361 + # source://prism//lib/prism/translation/ruby_parser.rb#410 def visit_class_node(node); end + # ``` # @@foo &&= bar # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#402 + # source://prism//lib/prism/translation/ruby_parser.rb#459 def visit_class_variable_and_write_node(node); end + # ``` # @@foo += bar # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#396 + # source://prism//lib/prism/translation/ruby_parser.rb#451 def visit_class_variable_operator_write_node(node); end + # ``` # @@foo ||= bar # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#408 + # source://prism//lib/prism/translation/ruby_parser.rb#467 def visit_class_variable_or_write_node(node); end + # ``` # @@foo # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#381 + # source://prism//lib/prism/translation/ruby_parser.rb#432 def visit_class_variable_read_node(node); end + # ``` # @@foo, = bar # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#414 + # source://prism//lib/prism/translation/ruby_parser.rb#475 def visit_class_variable_target_node(node); end + # ``` # @@foo = 1 # ^^^^^^^^^ # # @@foo, @@bar = 1 # ^^^^^ ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#390 + # source://prism//lib/prism/translation/ruby_parser.rb#443 def visit_class_variable_write_node(node); end + # ``` # Foo &&= bar # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#447 + # source://prism//lib/prism/translation/ruby_parser.rb#516 def visit_constant_and_write_node(node); end + # ``` # Foo += bar # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#441 + # source://prism//lib/prism/translation/ruby_parser.rb#508 def visit_constant_operator_write_node(node); end + # ``` # Foo ||= bar # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#453 + # source://prism//lib/prism/translation/ruby_parser.rb#524 def visit_constant_or_write_node(node); end + # ``` # Foo::Bar &&= baz # ^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#490 + # source://prism//lib/prism/translation/ruby_parser.rb#571 def visit_constant_path_and_write_node(node); end + # ``` # Foo::Bar # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#465 + # source://prism//lib/prism/translation/ruby_parser.rb#540 def visit_constant_path_node(node); end + # ``` # Foo::Bar += baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#484 + # source://prism//lib/prism/translation/ruby_parser.rb#563 def visit_constant_path_operator_write_node(node); end + # ``` # Foo::Bar ||= baz # ^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#496 + # source://prism//lib/prism/translation/ruby_parser.rb#579 def visit_constant_path_or_write_node(node); end + # ``` # Foo::Bar, = baz # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#502 + # source://prism//lib/prism/translation/ruby_parser.rb#587 def visit_constant_path_target_node(node); end + # ``` # Foo::Bar = 1 # ^^^^^^^^^^^^ # # Foo::Foo, Bar::Bar = 1 # ^^^^^^^^ ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#478 + # source://prism//lib/prism/translation/ruby_parser.rb#555 def visit_constant_path_write_node(node); end + # ``` # Foo # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#426 + # source://prism//lib/prism/translation/ruby_parser.rb#489 def visit_constant_read_node(node); end + # ``` # Foo, = bar # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#459 + # source://prism//lib/prism/translation/ruby_parser.rb#532 def visit_constant_target_node(node); end + # ``` # Foo = 1 # ^^^^^^^ # # Foo, Bar = 1 # ^^^ ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#435 + # source://prism//lib/prism/translation/ruby_parser.rb#500 def visit_constant_write_node(node); end + # ``` # def foo; end # ^^^^^^^^^^^^ # # def self.foo; end # ^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#518 + # source://prism//lib/prism/translation/ruby_parser.rb#605 def visit_def_node(node); end + # ``` # defined? a # ^^^^^^^^^^ # # defined?(a) # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#549 + # source://prism//lib/prism/translation/ruby_parser.rb#638 def visit_defined_node(node); end + # ``` # if foo then bar else baz end # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#555 + # source://prism//lib/prism/translation/ruby_parser.rb#646 def visit_else_node(node); end + # ``` # "foo #{bar}" # ^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#561 + # source://prism//lib/prism/translation/ruby_parser.rb#654 def visit_embedded_statements_node(node); end + # ``` # "foo #@bar" # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#569 + # source://prism//lib/prism/translation/ruby_parser.rb#664 def visit_embedded_variable_node(node); end + # ``` # begin; foo; ensure; bar; end # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#575 + # source://prism//lib/prism/translation/ruby_parser.rb#672 def visit_ensure_node(node); end + # ``` # false # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#581 + # source://prism//lib/prism/translation/ruby_parser.rb#680 def visit_false_node(node); end + # ``` # foo => [*, bar, *] # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#587 + # source://prism//lib/prism/translation/ruby_parser.rb#688 def visit_find_pattern_node(node); end + # ``` # if foo .. bar; end # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#593 + # source://prism//lib/prism/translation/ruby_parser.rb#696 def visit_flip_flop_node(node); end + # ``` # 1.0 # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#603 + # source://prism//lib/prism/translation/ruby_parser.rb#708 def visit_float_node(node); end + # ``` # for foo in bar do end # ^^^^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#609 + # source://prism//lib/prism/translation/ruby_parser.rb#716 def visit_for_node(node); end + # ``` # def foo(...); bar(...); end # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#615 + # source://prism//lib/prism/translation/ruby_parser.rb#724 def visit_forwarding_arguments_node(node); end + # ``` # def foo(...); end # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#621 + # source://prism//lib/prism/translation/ruby_parser.rb#732 def visit_forwarding_parameter_node(node); end + # ``` # super # ^^^^^ # # super {} # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#630 + # source://prism//lib/prism/translation/ruby_parser.rb#743 def visit_forwarding_super_node(node); end + # ``` # $foo &&= bar # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#657 + # source://prism//lib/prism/translation/ruby_parser.rb#778 def visit_global_variable_and_write_node(node); end + # ``` # $foo += bar # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#651 + # source://prism//lib/prism/translation/ruby_parser.rb#770 def visit_global_variable_operator_write_node(node); end + # ``` # $foo ||= bar # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#663 + # source://prism//lib/prism/translation/ruby_parser.rb#786 def visit_global_variable_or_write_node(node); end + # ``` # $foo # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#636 + # source://prism//lib/prism/translation/ruby_parser.rb#751 def visit_global_variable_read_node(node); end + # ``` # $foo, = bar # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#669 + # source://prism//lib/prism/translation/ruby_parser.rb#794 def visit_global_variable_target_node(node); end + # ``` # $foo = 1 # ^^^^^^^^ # # $foo, $bar = 1 # ^^^^ ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#645 + # source://prism//lib/prism/translation/ruby_parser.rb#762 def visit_global_variable_write_node(node); end + # ``` # {} # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#675 + # source://prism//lib/prism/translation/ruby_parser.rb#802 def visit_hash_node(node); end + # ``` # foo => {} # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#681 + # source://prism//lib/prism/translation/ruby_parser.rb#810 def visit_hash_pattern_node(node); end + # ``` # if foo then bar end # ^^^^^^^^^^^^^^^^^^^ # @@ -38921,441 +39104,569 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # # foo ? bar : baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#702 + # source://prism//lib/prism/translation/ruby_parser.rb#833 def visit_if_node(node); end # 1i # - # source://prism//lib/prism/translation/ruby_parser.rb#707 + # source://prism//lib/prism/translation/ruby_parser.rb#838 def visit_imaginary_node(node); end + # ``` # { foo: } # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#713 + # source://prism//lib/prism/translation/ruby_parser.rb#846 def visit_implicit_node(node); end + # ``` # foo { |bar,| } # ^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#718 + # source://prism//lib/prism/translation/ruby_parser.rb#853 def visit_implicit_rest_node(node); end + # ``` # case foo; in bar; end # ^^^^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#723 + # source://prism//lib/prism/translation/ruby_parser.rb#860 def visit_in_node(node); end + # ``` # foo[bar] &&= baz # ^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#749 + # source://prism//lib/prism/translation/ruby_parser.rb#890 def visit_index_and_write_node(node); end + # ``` # foo[bar] += baz # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#736 + # source://prism//lib/prism/translation/ruby_parser.rb#875 def visit_index_operator_write_node(node); end + # ``` # foo[bar] ||= baz # ^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#762 + # source://prism//lib/prism/translation/ruby_parser.rb#905 def visit_index_or_write_node(node); end + # ``` # foo[bar], = 1 # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#775 + # source://prism//lib/prism/translation/ruby_parser.rb#920 def visit_index_target_node(node); end + # ``` # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#805 + # source://prism//lib/prism/translation/ruby_parser.rb#958 def visit_instance_variable_and_write_node(node); end + # ``` # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#799 + # source://prism//lib/prism/translation/ruby_parser.rb#950 def visit_instance_variable_operator_write_node(node); end + # ``` # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#811 + # source://prism//lib/prism/translation/ruby_parser.rb#966 def visit_instance_variable_or_write_node(node); end + # ``` # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#784 + # source://prism//lib/prism/translation/ruby_parser.rb#931 def visit_instance_variable_read_node(node); end + # ``` # @foo, = bar # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#817 + # source://prism//lib/prism/translation/ruby_parser.rb#974 def visit_instance_variable_target_node(node); end + # ``` # ^^^^^^^^ # # @foo, @bar = 1 # ^^^^ ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#793 + # source://prism//lib/prism/translation/ruby_parser.rb#942 def visit_instance_variable_write_node(node); end + # ``` # 1 # ^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#823 + # source://prism//lib/prism/translation/ruby_parser.rb#982 def visit_integer_node(node); end + # ``` # if /foo #{bar}/ then end # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#829 + # source://prism//lib/prism/translation/ruby_parser.rb#990 def visit_interpolated_match_last_line_node(node); end + # ``` # /foo #{bar}/ # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#846 + # source://prism//lib/prism/translation/ruby_parser.rb#1009 def visit_interpolated_regular_expression_node(node); end + # ``` # "foo #{bar}" # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#861 + # source://prism//lib/prism/translation/ruby_parser.rb#1026 def visit_interpolated_string_node(node); end + # ``` # :"foo #{bar}" # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#868 + # source://prism//lib/prism/translation/ruby_parser.rb#1035 def visit_interpolated_symbol_node(node); end + # ``` # `foo #{bar}` # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#875 + # source://prism//lib/prism/translation/ruby_parser.rb#1044 def visit_interpolated_x_string_node(node); end + # ``` # -> { it } # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#956 + # source://prism//lib/prism/translation/ruby_parser.rb#1127 def visit_it_local_variable_read_node(node); end + # ``` # foo(bar: baz) # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#962 + # source://prism//lib/prism/translation/ruby_parser.rb#1135 def visit_keyword_hash_node(node); end + # ``` # def foo(**bar); end # ^^^^^ # # def foo(**); end # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#971 + # source://prism//lib/prism/translation/ruby_parser.rb#1146 def visit_keyword_rest_parameter_node(node); end # -> {} # - # source://prism//lib/prism/translation/ruby_parser.rb#976 + # source://prism//lib/prism/translation/ruby_parser.rb#1151 def visit_lambda_node(node); end + # ``` # foo &&= bar # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1019 + # source://prism//lib/prism/translation/ruby_parser.rb#1202 def visit_local_variable_and_write_node(node); end + # ``` # foo += bar # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1013 + # source://prism//lib/prism/translation/ruby_parser.rb#1194 def visit_local_variable_operator_write_node(node); end + # ``` # foo ||= bar # ^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1025 + # source://prism//lib/prism/translation/ruby_parser.rb#1210 def visit_local_variable_or_write_node(node); end + # ``` # foo # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#994 + # source://prism//lib/prism/translation/ruby_parser.rb#1171 def visit_local_variable_read_node(node); end + # ``` # foo, = bar # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1031 + # source://prism//lib/prism/translation/ruby_parser.rb#1218 def visit_local_variable_target_node(node); end + # ``` # foo = 1 # ^^^^^^^ # # foo, bar = 1 # ^^^ ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1007 + # source://prism//lib/prism/translation/ruby_parser.rb#1186 def visit_local_variable_write_node(node); end + # ``` # if /foo/ then end # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1037 + # source://prism//lib/prism/translation/ruby_parser.rb#1226 def visit_match_last_line_node(node); end + # ``` # foo in bar # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1043 + # source://prism//lib/prism/translation/ruby_parser.rb#1234 def visit_match_predicate_node(node); end + # ``` # foo => bar # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1049 + # source://prism//lib/prism/translation/ruby_parser.rb#1242 def visit_match_required_node(node); end + # ``` # /(?foo)/ =~ bar # ^^^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1055 + # source://prism//lib/prism/translation/ruby_parser.rb#1250 def visit_match_write_node(node); end # A node that is missing from the syntax tree. This is only used in the # case of a syntax error. The parser gem doesn't have such a concept, so # we invent our own here. # - # source://prism//lib/prism/translation/ruby_parser.rb#1062 + # source://prism//lib/prism/translation/ruby_parser.rb#1257 def visit_missing_node(node); end + # ``` # module Foo; end # ^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1068 + # source://prism//lib/prism/translation/ruby_parser.rb#1265 def visit_module_node(node); end + # ``` # foo, bar = baz # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1088 + # source://prism//lib/prism/translation/ruby_parser.rb#1287 def visit_multi_target_node(node); end + # ``` # foo, bar = baz # ^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1098 + # source://prism//lib/prism/translation/ruby_parser.rb#1299 def visit_multi_write_node(node); end + # ``` # next # ^^^^ # # next foo # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1122 + # source://prism//lib/prism/translation/ruby_parser.rb#1325 def visit_next_node(node); end + # ``` # nil # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1135 + # source://prism//lib/prism/translation/ruby_parser.rb#1340 def visit_nil_node(node); end + # ``` # def foo(**nil); end # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1141 + # source://prism//lib/prism/translation/ruby_parser.rb#1348 def visit_no_keywords_parameter_node(node); end + # ``` # -> { _1 + _2 } # ^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1147 + # source://prism//lib/prism/translation/ruby_parser.rb#1356 def visit_numbered_parameters_node(node); end + # ``` # $1 # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1153 + # source://prism//lib/prism/translation/ruby_parser.rb#1364 def visit_numbered_reference_read_node(node); end + # ``` # def foo(bar: baz); end # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1159 + # source://prism//lib/prism/translation/ruby_parser.rb#1372 def visit_optional_keyword_parameter_node(node); end + # ``` # def foo(bar = 1); end # ^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1165 + # source://prism//lib/prism/translation/ruby_parser.rb#1380 def visit_optional_parameter_node(node); end + # ``` # a or b # ^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1171 + # source://prism//lib/prism/translation/ruby_parser.rb#1388 def visit_or_node(node); end + # ``` # def foo(bar, *baz); end # ^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1189 + # source://prism//lib/prism/translation/ruby_parser.rb#1408 def visit_parameters_node(node); end + # ``` # () # ^^ # # (1) # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1227 + # source://prism//lib/prism/translation/ruby_parser.rb#1450 def visit_parentheses_node(node); end + # ``` # foo => ^(bar) # ^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1237 + # source://prism//lib/prism/translation/ruby_parser.rb#1462 def visit_pinned_expression_node(node); end + # ``` # foo = 1 and bar => ^foo # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1243 + # source://prism//lib/prism/translation/ruby_parser.rb#1470 def visit_pinned_variable_node(node); end # END {} # - # source://prism//lib/prism/translation/ruby_parser.rb#1252 + # source://prism//lib/prism/translation/ruby_parser.rb#1479 def visit_post_execution_node(node); end # BEGIN {} # - # source://prism//lib/prism/translation/ruby_parser.rb#1257 + # source://prism//lib/prism/translation/ruby_parser.rb#1484 def visit_pre_execution_node(node); end # The top-level program node. # - # source://prism//lib/prism/translation/ruby_parser.rb#1262 + # source://prism//lib/prism/translation/ruby_parser.rb#1489 def visit_program_node(node); end + # ``` # 0..5 # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1268 + # source://prism//lib/prism/translation/ruby_parser.rb#1497 def visit_range_node(node); end + # ``` # 1r # ^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1290 + # source://prism//lib/prism/translation/ruby_parser.rb#1521 def visit_rational_node(node); end + # ``` # redo # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1296 + # source://prism//lib/prism/translation/ruby_parser.rb#1529 def visit_redo_node(node); end + # ``` # /foo/ # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1302 + # source://prism//lib/prism/translation/ruby_parser.rb#1537 def visit_regular_expression_node(node); end + # ``` # def foo(bar:); end # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1308 + # source://prism//lib/prism/translation/ruby_parser.rb#1545 def visit_required_keyword_parameter_node(node); end + # ``` # def foo(bar); end # ^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1314 + # source://prism//lib/prism/translation/ruby_parser.rb#1553 def visit_required_parameter_node(node); end + # ``` # foo rescue bar # ^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1320 + # source://prism//lib/prism/translation/ruby_parser.rb#1561 def visit_rescue_modifier_node(node); end + # ``` # begin; rescue; end # ^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1326 + # source://prism//lib/prism/translation/ruby_parser.rb#1569 def visit_rescue_node(node); end + # ``` # def foo(*bar); end # ^^^^ # # def foo(*); end # ^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1346 + # source://prism//lib/prism/translation/ruby_parser.rb#1591 def visit_rest_parameter_node(node); end + # ``` # retry # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1352 + # source://prism//lib/prism/translation/ruby_parser.rb#1599 def visit_retry_node(node); end + # ``` # return # ^^^^^^ # # return 1 # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1361 + # source://prism//lib/prism/translation/ruby_parser.rb#1610 def visit_return_node(node); end + # ``` # self # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1374 + # source://prism//lib/prism/translation/ruby_parser.rb#1625 def visit_self_node(node); end # A shareable constant. # - # source://prism//lib/prism/translation/ruby_parser.rb#1379 + # source://prism//lib/prism/translation/ruby_parser.rb#1630 def visit_shareable_constant_node(node); end + # ``` # class << self; end # ^^^^^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1385 + # source://prism//lib/prism/translation/ruby_parser.rb#1638 def visit_singleton_class_node(node); end + # ``` # __ENCODING__ # ^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1393 + # source://prism//lib/prism/translation/ruby_parser.rb#1648 def visit_source_encoding_node(node); end + # ``` # __FILE__ # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1400 + # source://prism//lib/prism/translation/ruby_parser.rb#1657 def visit_source_file_node(node); end + # ``` # __LINE__ # ^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1406 + # source://prism//lib/prism/translation/ruby_parser.rb#1665 def visit_source_line_node(node); end + # ``` # foo(*bar) # ^^^^ # @@ -39364,91 +39675,114 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # # def foo(*); bar(*); end # ^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1418 + # source://prism//lib/prism/translation/ruby_parser.rb#1679 def visit_splat_node(node); end # A list of statements. # - # source://prism//lib/prism/translation/ruby_parser.rb#1427 + # source://prism//lib/prism/translation/ruby_parser.rb#1688 def visit_statements_node(node); end + # ``` # "foo" # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1439 + # source://prism//lib/prism/translation/ruby_parser.rb#1702 def visit_string_node(node); end + # ``` # super(foo) # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1452 + # source://prism//lib/prism/translation/ruby_parser.rb#1717 def visit_super_node(node); end + # ``` # :foo # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1466 + # source://prism//lib/prism/translation/ruby_parser.rb#1733 def visit_symbol_node(node); end + # ``` # true # ^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1472 + # source://prism//lib/prism/translation/ruby_parser.rb#1741 def visit_true_node(node); end + # ``` # undef foo # ^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1478 + # source://prism//lib/prism/translation/ruby_parser.rb#1749 def visit_undef_node(node); end + # ``` # unless foo; bar end # ^^^^^^^^^^^^^^^^^^^ # # bar unless foo # ^^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1488 + # source://prism//lib/prism/translation/ruby_parser.rb#1761 def visit_unless_node(node); end + # ``` # until foo; bar end # ^^^^^^^^^^^^^^^^^ # # bar until foo # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1497 + # source://prism//lib/prism/translation/ruby_parser.rb#1772 def visit_until_node(node); end + # ``` # case foo; when bar; end # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1503 + # source://prism//lib/prism/translation/ruby_parser.rb#1780 def visit_when_node(node); end + # ``` # while foo; bar end # ^^^^^^^^^^^^^^^^^^ # # bar while foo # ^^^^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1512 + # source://prism//lib/prism/translation/ruby_parser.rb#1791 def visit_while_node(node); end + # ``` # `foo` # ^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1518 + # source://prism//lib/prism/translation/ruby_parser.rb#1799 def visit_x_string_node(node); end + # ``` # yield # ^^^^^ # # yield 1 # ^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1534 + # source://prism//lib/prism/translation/ruby_parser.rb#1817 def visit_yield_node(node); end private @@ -39456,12 +39790,12 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # If a class variable is written within a method definition, it has a # different type than everywhere else. # - # source://prism//lib/prism/translation/ruby_parser.rb#420 + # source://prism//lib/prism/translation/ruby_parser.rb#481 def class_variable_write_type; end # Create a new compiler with the given options. # - # source://prism//lib/prism/translation/ruby_parser.rb#1541 + # source://prism//lib/prism/translation/ruby_parser.rb#1824 def copy_compiler(in_def: T.unsafe(nil), in_pattern: T.unsafe(nil)); end # Call nodes with operators following them will either be op_asgn or @@ -39470,53 +39804,55 @@ class Prism::Translation::RubyParser::Compiler < ::Prism::Compiler # # @return [Boolean] # - # source://prism//lib/prism/translation/ruby_parser.rb#325 + # source://prism//lib/prism/translation/ruby_parser.rb#364 def op_asgn?(node); end # Call nodes with operators following them can use &. as an operator, # which changes their type by prefixing "safe_". # - # source://prism//lib/prism/translation/ruby_parser.rb#331 + # source://prism//lib/prism/translation/ruby_parser.rb#370 def op_asgn_type(node, type); end # Create a new Sexp object from the given prism node and arguments. # - # source://prism//lib/prism/translation/ruby_parser.rb#1546 + # source://prism//lib/prism/translation/ruby_parser.rb#1829 def s(node, *arguments); end # Visit a block node, which will modify the AST by wrapping the given # visited node in an iter node. # - # source://prism//lib/prism/translation/ruby_parser.rb#1556 + # source://prism//lib/prism/translation/ruby_parser.rb#1839 def visit_block(node, sexp, block); end + # ``` # def foo((bar, baz)); end # ^^^^^^^^^^ + # ``` # - # source://prism//lib/prism/translation/ruby_parser.rb#1204 + # source://prism//lib/prism/translation/ruby_parser.rb#1425 def visit_destructured_parameter(node); end # Visit the interpolated content of the string-like node. # - # source://prism//lib/prism/translation/ruby_parser.rb#882 + # source://prism//lib/prism/translation/ruby_parser.rb#1051 def visit_interpolated_parts(parts); end # Pattern constants get wrapped in another layer of :const. # - # source://prism//lib/prism/translation/ruby_parser.rb#1577 + # source://prism//lib/prism/translation/ruby_parser.rb#1860 def visit_pattern_constant(node); end # If the bounds of a range node are empty parentheses, then they do not # get replaced by their usual s(:nil), but instead are s(:begin). # - # source://prism//lib/prism/translation/ruby_parser.rb#1280 + # source://prism//lib/prism/translation/ruby_parser.rb#1509 def visit_range_bounds_node(node); end # Visit the value of a write, which will be on the right-hand side of # a write operator. Because implicit arrays can have splats, those could # potentially be wrapped in an svalue node. # - # source://prism//lib/prism/translation/ruby_parser.rb#1591 + # source://prism//lib/prism/translation/ruby_parser.rb#1874 def visit_write_value(node); end end @@ -39525,62 +39861,62 @@ end # true # ^^^^ # -# source://prism//lib/prism/node.rb#17368 +# source://prism//lib/prism/node.rb#17539 class Prism::TrueNode < ::Prism::Node # Initialize a new TrueNode node. # # @return [TrueNode] a new instance of TrueNode # - # source://prism//lib/prism/node.rb#17370 + # source://prism//lib/prism/node.rb#17541 sig { params(source: Prism::Source, node_id: Integer, location: Prism::Location, flags: Integer).void } def initialize(source, node_id, location, flags); end # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17427 + # source://prism//lib/prism/node.rb#17598 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17378 + # source://prism//lib/prism/node.rb#17549 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17383 + # source://prism//lib/prism/node.rb#17554 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17393 + # source://prism//lib/prism/node.rb#17564 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17388 + # source://prism//lib/prism/node.rb#17559 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer) -> TrueNode # - # source://prism//lib/prism/node.rb#17398 + # source://prism//lib/prism/node.rb#17569 sig { params(node_id: Integer, location: Prism::Location, flags: Integer).returns(Prism::TrueNode) } def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17403 + # source://prism//lib/prism/node.rb#17574 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location } # - # source://prism//lib/prism/node.rb#17406 + # source://prism//lib/prism/node.rb#17577 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -39589,20 +39925,20 @@ class Prism::TrueNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17411 + # source://prism//lib/prism/node.rb#17582 sig { override.returns(String) } def inspect; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17416 + # source://prism//lib/prism/node.rb#17587 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17421 + # source://prism//lib/prism/node.rb#17592 def type; end end end @@ -39612,13 +39948,13 @@ end # undef :foo, :bar, :baz # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17436 +# source://prism//lib/prism/node.rb#17607 class Prism::UndefNode < ::Prism::Node # Initialize a new UndefNode node. # # @return [UndefNode] a new instance of UndefNode # - # source://prism//lib/prism/node.rb#17438 + # source://prism//lib/prism/node.rb#17609 sig do params( source: Prism::Source, @@ -39634,36 +39970,36 @@ class Prism::UndefNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17518 + # source://prism//lib/prism/node.rb#17689 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17448 + # source://prism//lib/prism/node.rb#17619 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17453 + # source://prism//lib/prism/node.rb#17624 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17463 + # source://prism//lib/prism/node.rb#17634 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17458 + # source://prism//lib/prism/node.rb#17629 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?names: Array[SymbolNode | InterpolatedSymbolNode], ?keyword_loc: Location) -> UndefNode # - # source://prism//lib/prism/node.rb#17468 + # source://prism//lib/prism/node.rb#17639 sig do params( node_id: Integer, @@ -39675,16 +40011,16 @@ class Prism::UndefNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), names: T.unsafe(nil), keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17473 + # source://prism//lib/prism/node.rb#17644 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, names: Array[SymbolNode | InterpolatedSymbolNode], keyword_loc: Location } # - # source://prism//lib/prism/node.rb#17476 + # source://prism//lib/prism/node.rb#17647 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -39693,44 +40029,44 @@ class Prism::UndefNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17502 + # source://prism//lib/prism/node.rb#17673 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17497 + # source://prism//lib/prism/node.rb#17668 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17484 + # source://prism//lib/prism/node.rb#17655 sig { returns(Prism::Location) } def keyword_loc; end # attr_reader names: Array[SymbolNode | InterpolatedSymbolNode] # - # source://prism//lib/prism/node.rb#17481 + # source://prism//lib/prism/node.rb#17652 sig { returns(T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)]) } def names; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17492 + # source://prism//lib/prism/node.rb#17663 def save_keyword_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17507 + # source://prism//lib/prism/node.rb#17678 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17512 + # source://prism//lib/prism/node.rb#17683 def type; end end end @@ -39743,13 +40079,13 @@ end # unless foo then bar end # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17533 +# source://prism//lib/prism/node.rb#17704 class Prism::UnlessNode < ::Prism::Node # Initialize a new UnlessNode node. # # @return [UnlessNode] a new instance of UnlessNode # - # source://prism//lib/prism/node.rb#17535 + # source://prism//lib/prism/node.rb#17706 sig do params( source: Prism::Source, @@ -39769,42 +40105,42 @@ class Prism::UnlessNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17702 + # source://prism//lib/prism/node.rb#17873 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17549 + # source://prism//lib/prism/node.rb#17720 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17554 + # source://prism//lib/prism/node.rb#17725 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17568 + # source://prism//lib/prism/node.rb#17739 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17559 + # source://prism//lib/prism/node.rb#17730 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # Returns the else clause of the unless node. This method is deprecated in # favor of #else_clause. # - # source://prism//lib/prism/node_ext.rb#503 + # source://prism//lib/prism/node_ext.rb#506 def consequent; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?else_clause: ElseNode?, ?end_keyword_loc: Location?) -> UnlessNode # - # source://prism//lib/prism/node.rb#17573 + # source://prism//lib/prism/node.rb#17744 sig do params( node_id: Integer, @@ -39820,16 +40156,16 @@ class Prism::UnlessNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), predicate: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), else_clause: T.unsafe(nil), end_keyword_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17578 + # source://prism//lib/prism/node.rb#17749 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, else_clause: ElseNode?, end_keyword_loc: Location? } # - # source://prism//lib/prism/node.rb#17581 + # source://prism//lib/prism/node.rb#17752 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -39838,13 +40174,13 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar else baz end # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#17646 + # source://prism//lib/prism/node.rb#17817 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#17681 + # source://prism//lib/prism/node.rb#17852 sig { returns(T.nilable(String)) } def end_keyword; end @@ -39853,7 +40189,7 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar end # ^^^ # - # source://prism//lib/prism/node.rb#17652 + # source://prism//lib/prism/node.rb#17823 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end @@ -39862,13 +40198,13 @@ class Prism::UnlessNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17686 + # source://prism//lib/prism/node.rb#17857 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17671 + # source://prism//lib/prism/node.rb#17842 sig { returns(String) } def keyword; end @@ -39880,11 +40216,11 @@ class Prism::UnlessNode < ::Prism::Node # bar unless cond # ^^^^^^ # - # source://prism//lib/prism/node.rb#17592 + # source://prism//lib/prism/node.rb#17763 sig { returns(Prism::Location) } def keyword_loc; end - # source://prism//lib/prism/parse_result/newlines.rb#97 + # source://prism//lib/prism/parse_result/newlines.rb#98 def newline_flag!(lines); end # The condition to be evaluated for the unless expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). @@ -39895,26 +40231,26 @@ class Prism::UnlessNode < ::Prism::Node # bar unless cond # ^^^^ # - # source://prism//lib/prism/node.rb#17611 + # source://prism//lib/prism/node.rb#17782 sig { returns(Prism::Node) } def predicate; end # Save the end_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17666 + # source://prism//lib/prism/node.rb#17837 def save_end_keyword_loc(repository); end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17600 + # source://prism//lib/prism/node.rb#17771 def save_keyword_loc(repository); end # Save the then_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17631 + # source://prism//lib/prism/node.rb#17802 def save_then_keyword_loc(repository); end # The body of statements that will executed if the unless condition is @@ -39923,13 +40259,13 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar end # ^^^ # - # source://prism//lib/prism/node.rb#17640 + # source://prism//lib/prism/node.rb#17811 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#17676 + # source://prism//lib/prism/node.rb#17847 sig { returns(T.nilable(String)) } def then_keyword; end @@ -39938,20 +40274,20 @@ class Prism::UnlessNode < ::Prism::Node # unless cond then bar end # ^^^^ # - # source://prism//lib/prism/node.rb#17617 + # source://prism//lib/prism/node.rb#17788 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17691 + # source://prism//lib/prism/node.rb#17862 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17696 + # source://prism//lib/prism/node.rb#17867 def type; end end end @@ -39964,13 +40300,13 @@ end # until foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#17720 +# source://prism//lib/prism/node.rb#17891 class Prism::UntilNode < ::Prism::Node # Initialize a new UntilNode node. # # @return [UntilNode] a new instance of UntilNode # - # source://prism//lib/prism/node.rb#17722 + # source://prism//lib/prism/node.rb#17893 sig do params( source: Prism::Source, @@ -39989,12 +40325,12 @@ class Prism::UntilNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17864 + # source://prism//lib/prism/node.rb#18035 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17735 + # source://prism//lib/prism/node.rb#17906 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -40002,43 +40338,43 @@ class Prism::UntilNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#17771 + # source://prism//lib/prism/node.rb#17942 sig { returns(T::Boolean) } def begin_modifier?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17740 + # source://prism//lib/prism/node.rb#17911 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#17843 + # source://prism//lib/prism/node.rb#18014 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#17808 + # source://prism//lib/prism/node.rb#17979 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17753 + # source://prism//lib/prism/node.rb#17924 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17745 + # source://prism//lib/prism/node.rb#17916 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?do_keyword_loc: Location?, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> UntilNode # - # source://prism//lib/prism/node.rb#17758 + # source://prism//lib/prism/node.rb#17929 sig do params( node_id: Integer, @@ -40053,28 +40389,28 @@ class Prism::UntilNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), do_keyword_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), predicate: T.unsafe(nil), statements: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17763 + # source://prism//lib/prism/node.rb#17934 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, do_keyword_loc: Location?, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? } # - # source://prism//lib/prism/node.rb#17766 + # source://prism//lib/prism/node.rb#17937 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def do_keyword: () -> String? # - # source://prism//lib/prism/node.rb#17838 + # source://prism//lib/prism/node.rb#18009 sig { returns(T.nilable(String)) } def do_keyword; end # attr_reader do_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#17789 + # source://prism//lib/prism/node.rb#17960 sig { returns(T.nilable(Prism::Location)) } def do_keyword_loc; end @@ -40083,65 +40419,65 @@ class Prism::UntilNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17848 + # source://prism//lib/prism/node.rb#18019 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17833 + # source://prism//lib/prism/node.rb#18004 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17776 + # source://prism//lib/prism/node.rb#17947 sig { returns(Prism::Location) } def keyword_loc; end - # source://prism//lib/prism/parse_result/newlines.rb#103 + # source://prism//lib/prism/parse_result/newlines.rb#104 def newline_flag!(lines); end # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#17827 + # source://prism//lib/prism/node.rb#17998 sig { returns(Prism::Node) } def predicate; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17822 + # source://prism//lib/prism/node.rb#17993 def save_closing_loc(repository); end # Save the do_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17803 + # source://prism//lib/prism/node.rb#17974 def save_do_keyword_loc(repository); end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17784 + # source://prism//lib/prism/node.rb#17955 def save_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#17830 + # source://prism//lib/prism/node.rb#18001 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17853 + # source://prism//lib/prism/node.rb#18024 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17858 + # source://prism//lib/prism/node.rb#18029 def type; end end end @@ -40159,7 +40495,7 @@ Prism::VERSION = T.let(T.unsafe(nil), String) # # class FooCalls < Prism::Visitor # def visit_call_node(node) -# if node.name == "foo" +# if node.name == :foo # # Do something with the node # end # @@ -40168,911 +40504,911 @@ Prism::VERSION = T.let(T.unsafe(nil), String) # end # end # -# source://prism//lib/prism/visitor.rb#54 +# source://prism//lib/prism/visitor.rb#57 class Prism::Visitor < ::Prism::BasicVisitor # Visit a AliasGlobalVariableNode node # - # source://prism//lib/prism/visitor.rb#56 + # source://prism//lib/prism/visitor.rb#59 sig { params(node: Prism::AliasGlobalVariableNode).void } def visit_alias_global_variable_node(node); end # Visit a AliasMethodNode node # - # source://prism//lib/prism/visitor.rb#59 + # source://prism//lib/prism/visitor.rb#64 sig { params(node: Prism::AliasMethodNode).void } def visit_alias_method_node(node); end # Visit a AlternationPatternNode node # - # source://prism//lib/prism/visitor.rb#62 + # source://prism//lib/prism/visitor.rb#69 sig { params(node: Prism::AlternationPatternNode).void } def visit_alternation_pattern_node(node); end # Visit a AndNode node # - # source://prism//lib/prism/visitor.rb#65 + # source://prism//lib/prism/visitor.rb#74 sig { params(node: Prism::AndNode).void } def visit_and_node(node); end # Visit a ArgumentsNode node # - # source://prism//lib/prism/visitor.rb#68 + # source://prism//lib/prism/visitor.rb#79 sig { params(node: Prism::ArgumentsNode).void } def visit_arguments_node(node); end # Visit a ArrayNode node # - # source://prism//lib/prism/visitor.rb#71 + # source://prism//lib/prism/visitor.rb#84 sig { params(node: Prism::ArrayNode).void } def visit_array_node(node); end # Visit a ArrayPatternNode node # - # source://prism//lib/prism/visitor.rb#74 + # source://prism//lib/prism/visitor.rb#89 sig { params(node: Prism::ArrayPatternNode).void } def visit_array_pattern_node(node); end # Visit a AssocNode node # - # source://prism//lib/prism/visitor.rb#77 + # source://prism//lib/prism/visitor.rb#94 sig { params(node: Prism::AssocNode).void } def visit_assoc_node(node); end # Visit a AssocSplatNode node # - # source://prism//lib/prism/visitor.rb#80 + # source://prism//lib/prism/visitor.rb#99 sig { params(node: Prism::AssocSplatNode).void } def visit_assoc_splat_node(node); end # Visit a BackReferenceReadNode node # - # source://prism//lib/prism/visitor.rb#83 + # source://prism//lib/prism/visitor.rb#104 sig { params(node: Prism::BackReferenceReadNode).void } def visit_back_reference_read_node(node); end # Visit a BeginNode node # - # source://prism//lib/prism/visitor.rb#86 + # source://prism//lib/prism/visitor.rb#109 sig { params(node: Prism::BeginNode).void } def visit_begin_node(node); end # Visit a BlockArgumentNode node # - # source://prism//lib/prism/visitor.rb#89 + # source://prism//lib/prism/visitor.rb#114 sig { params(node: Prism::BlockArgumentNode).void } def visit_block_argument_node(node); end # Visit a BlockLocalVariableNode node # - # source://prism//lib/prism/visitor.rb#92 + # source://prism//lib/prism/visitor.rb#119 sig { params(node: Prism::BlockLocalVariableNode).void } def visit_block_local_variable_node(node); end # Visit a BlockNode node # - # source://prism//lib/prism/visitor.rb#95 + # source://prism//lib/prism/visitor.rb#124 sig { params(node: Prism::BlockNode).void } def visit_block_node(node); end # Visit a BlockParameterNode node # - # source://prism//lib/prism/visitor.rb#98 + # source://prism//lib/prism/visitor.rb#129 sig { params(node: Prism::BlockParameterNode).void } def visit_block_parameter_node(node); end # Visit a BlockParametersNode node # - # source://prism//lib/prism/visitor.rb#101 + # source://prism//lib/prism/visitor.rb#134 sig { params(node: Prism::BlockParametersNode).void } def visit_block_parameters_node(node); end # Visit a BreakNode node # - # source://prism//lib/prism/visitor.rb#104 + # source://prism//lib/prism/visitor.rb#139 sig { params(node: Prism::BreakNode).void } def visit_break_node(node); end # Visit a CallAndWriteNode node # - # source://prism//lib/prism/visitor.rb#107 + # source://prism//lib/prism/visitor.rb#144 sig { params(node: Prism::CallAndWriteNode).void } def visit_call_and_write_node(node); end # Visit a CallNode node # - # source://prism//lib/prism/visitor.rb#110 + # source://prism//lib/prism/visitor.rb#149 sig { params(node: Prism::CallNode).void } def visit_call_node(node); end # Visit a CallOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#113 + # source://prism//lib/prism/visitor.rb#154 sig { params(node: Prism::CallOperatorWriteNode).void } def visit_call_operator_write_node(node); end # Visit a CallOrWriteNode node # - # source://prism//lib/prism/visitor.rb#116 + # source://prism//lib/prism/visitor.rb#159 sig { params(node: Prism::CallOrWriteNode).void } def visit_call_or_write_node(node); end # Visit a CallTargetNode node # - # source://prism//lib/prism/visitor.rb#119 + # source://prism//lib/prism/visitor.rb#164 sig { params(node: Prism::CallTargetNode).void } def visit_call_target_node(node); end # Visit a CapturePatternNode node # - # source://prism//lib/prism/visitor.rb#122 + # source://prism//lib/prism/visitor.rb#169 sig { params(node: Prism::CapturePatternNode).void } def visit_capture_pattern_node(node); end # Visit a CaseMatchNode node # - # source://prism//lib/prism/visitor.rb#125 + # source://prism//lib/prism/visitor.rb#174 sig { params(node: Prism::CaseMatchNode).void } def visit_case_match_node(node); end # Visit a CaseNode node # - # source://prism//lib/prism/visitor.rb#128 + # source://prism//lib/prism/visitor.rb#179 sig { params(node: Prism::CaseNode).void } def visit_case_node(node); end # Visit a ClassNode node # - # source://prism//lib/prism/visitor.rb#131 + # source://prism//lib/prism/visitor.rb#184 sig { params(node: Prism::ClassNode).void } def visit_class_node(node); end # Visit a ClassVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#134 + # source://prism//lib/prism/visitor.rb#189 sig { params(node: Prism::ClassVariableAndWriteNode).void } def visit_class_variable_and_write_node(node); end # Visit a ClassVariableOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#137 + # source://prism//lib/prism/visitor.rb#194 sig { params(node: Prism::ClassVariableOperatorWriteNode).void } def visit_class_variable_operator_write_node(node); end # Visit a ClassVariableOrWriteNode node # - # source://prism//lib/prism/visitor.rb#140 + # source://prism//lib/prism/visitor.rb#199 sig { params(node: Prism::ClassVariableOrWriteNode).void } def visit_class_variable_or_write_node(node); end # Visit a ClassVariableReadNode node # - # source://prism//lib/prism/visitor.rb#143 + # source://prism//lib/prism/visitor.rb#204 sig { params(node: Prism::ClassVariableReadNode).void } def visit_class_variable_read_node(node); end # Visit a ClassVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#146 + # source://prism//lib/prism/visitor.rb#209 sig { params(node: Prism::ClassVariableTargetNode).void } def visit_class_variable_target_node(node); end # Visit a ClassVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#149 + # source://prism//lib/prism/visitor.rb#214 sig { params(node: Prism::ClassVariableWriteNode).void } def visit_class_variable_write_node(node); end # Visit a ConstantAndWriteNode node # - # source://prism//lib/prism/visitor.rb#152 + # source://prism//lib/prism/visitor.rb#219 sig { params(node: Prism::ConstantAndWriteNode).void } def visit_constant_and_write_node(node); end # Visit a ConstantOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#155 + # source://prism//lib/prism/visitor.rb#224 sig { params(node: Prism::ConstantOperatorWriteNode).void } def visit_constant_operator_write_node(node); end # Visit a ConstantOrWriteNode node # - # source://prism//lib/prism/visitor.rb#158 + # source://prism//lib/prism/visitor.rb#229 sig { params(node: Prism::ConstantOrWriteNode).void } def visit_constant_or_write_node(node); end # Visit a ConstantPathAndWriteNode node # - # source://prism//lib/prism/visitor.rb#161 + # source://prism//lib/prism/visitor.rb#234 sig { params(node: Prism::ConstantPathAndWriteNode).void } def visit_constant_path_and_write_node(node); end # Visit a ConstantPathNode node # - # source://prism//lib/prism/visitor.rb#164 + # source://prism//lib/prism/visitor.rb#239 sig { params(node: Prism::ConstantPathNode).void } def visit_constant_path_node(node); end # Visit a ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#167 + # source://prism//lib/prism/visitor.rb#244 sig { params(node: Prism::ConstantPathOperatorWriteNode).void } def visit_constant_path_operator_write_node(node); end # Visit a ConstantPathOrWriteNode node # - # source://prism//lib/prism/visitor.rb#170 + # source://prism//lib/prism/visitor.rb#249 sig { params(node: Prism::ConstantPathOrWriteNode).void } def visit_constant_path_or_write_node(node); end # Visit a ConstantPathTargetNode node # - # source://prism//lib/prism/visitor.rb#173 + # source://prism//lib/prism/visitor.rb#254 sig { params(node: Prism::ConstantPathTargetNode).void } def visit_constant_path_target_node(node); end # Visit a ConstantPathWriteNode node # - # source://prism//lib/prism/visitor.rb#176 + # source://prism//lib/prism/visitor.rb#259 sig { params(node: Prism::ConstantPathWriteNode).void } def visit_constant_path_write_node(node); end # Visit a ConstantReadNode node # - # source://prism//lib/prism/visitor.rb#179 + # source://prism//lib/prism/visitor.rb#264 sig { params(node: Prism::ConstantReadNode).void } def visit_constant_read_node(node); end # Visit a ConstantTargetNode node # - # source://prism//lib/prism/visitor.rb#182 + # source://prism//lib/prism/visitor.rb#269 sig { params(node: Prism::ConstantTargetNode).void } def visit_constant_target_node(node); end # Visit a ConstantWriteNode node # - # source://prism//lib/prism/visitor.rb#185 + # source://prism//lib/prism/visitor.rb#274 sig { params(node: Prism::ConstantWriteNode).void } def visit_constant_write_node(node); end # Visit a DefNode node # - # source://prism//lib/prism/visitor.rb#188 + # source://prism//lib/prism/visitor.rb#279 sig { params(node: Prism::DefNode).void } def visit_def_node(node); end # Visit a DefinedNode node # - # source://prism//lib/prism/visitor.rb#191 + # source://prism//lib/prism/visitor.rb#284 sig { params(node: Prism::DefinedNode).void } def visit_defined_node(node); end # Visit a ElseNode node # - # source://prism//lib/prism/visitor.rb#194 + # source://prism//lib/prism/visitor.rb#289 sig { params(node: Prism::ElseNode).void } def visit_else_node(node); end # Visit a EmbeddedStatementsNode node # - # source://prism//lib/prism/visitor.rb#197 + # source://prism//lib/prism/visitor.rb#294 sig { params(node: Prism::EmbeddedStatementsNode).void } def visit_embedded_statements_node(node); end # Visit a EmbeddedVariableNode node # - # source://prism//lib/prism/visitor.rb#200 + # source://prism//lib/prism/visitor.rb#299 sig { params(node: Prism::EmbeddedVariableNode).void } def visit_embedded_variable_node(node); end # Visit a EnsureNode node # - # source://prism//lib/prism/visitor.rb#203 + # source://prism//lib/prism/visitor.rb#304 sig { params(node: Prism::EnsureNode).void } def visit_ensure_node(node); end # Visit a FalseNode node # - # source://prism//lib/prism/visitor.rb#206 + # source://prism//lib/prism/visitor.rb#309 sig { params(node: Prism::FalseNode).void } def visit_false_node(node); end # Visit a FindPatternNode node # - # source://prism//lib/prism/visitor.rb#209 + # source://prism//lib/prism/visitor.rb#314 sig { params(node: Prism::FindPatternNode).void } def visit_find_pattern_node(node); end # Visit a FlipFlopNode node # - # source://prism//lib/prism/visitor.rb#212 + # source://prism//lib/prism/visitor.rb#319 sig { params(node: Prism::FlipFlopNode).void } def visit_flip_flop_node(node); end # Visit a FloatNode node # - # source://prism//lib/prism/visitor.rb#215 + # source://prism//lib/prism/visitor.rb#324 sig { params(node: Prism::FloatNode).void } def visit_float_node(node); end # Visit a ForNode node # - # source://prism//lib/prism/visitor.rb#218 + # source://prism//lib/prism/visitor.rb#329 sig { params(node: Prism::ForNode).void } def visit_for_node(node); end # Visit a ForwardingArgumentsNode node # - # source://prism//lib/prism/visitor.rb#221 + # source://prism//lib/prism/visitor.rb#334 sig { params(node: Prism::ForwardingArgumentsNode).void } def visit_forwarding_arguments_node(node); end # Visit a ForwardingParameterNode node # - # source://prism//lib/prism/visitor.rb#224 + # source://prism//lib/prism/visitor.rb#339 sig { params(node: Prism::ForwardingParameterNode).void } def visit_forwarding_parameter_node(node); end # Visit a ForwardingSuperNode node # - # source://prism//lib/prism/visitor.rb#227 + # source://prism//lib/prism/visitor.rb#344 sig { params(node: Prism::ForwardingSuperNode).void } def visit_forwarding_super_node(node); end # Visit a GlobalVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#230 + # source://prism//lib/prism/visitor.rb#349 sig { params(node: Prism::GlobalVariableAndWriteNode).void } def visit_global_variable_and_write_node(node); end # Visit a GlobalVariableOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#233 + # source://prism//lib/prism/visitor.rb#354 sig { params(node: Prism::GlobalVariableOperatorWriteNode).void } def visit_global_variable_operator_write_node(node); end # Visit a GlobalVariableOrWriteNode node # - # source://prism//lib/prism/visitor.rb#236 + # source://prism//lib/prism/visitor.rb#359 sig { params(node: Prism::GlobalVariableOrWriteNode).void } def visit_global_variable_or_write_node(node); end # Visit a GlobalVariableReadNode node # - # source://prism//lib/prism/visitor.rb#239 + # source://prism//lib/prism/visitor.rb#364 sig { params(node: Prism::GlobalVariableReadNode).void } def visit_global_variable_read_node(node); end # Visit a GlobalVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#242 + # source://prism//lib/prism/visitor.rb#369 sig { params(node: Prism::GlobalVariableTargetNode).void } def visit_global_variable_target_node(node); end # Visit a GlobalVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#245 + # source://prism//lib/prism/visitor.rb#374 sig { params(node: Prism::GlobalVariableWriteNode).void } def visit_global_variable_write_node(node); end # Visit a HashNode node # - # source://prism//lib/prism/visitor.rb#248 + # source://prism//lib/prism/visitor.rb#379 sig { params(node: Prism::HashNode).void } def visit_hash_node(node); end # Visit a HashPatternNode node # - # source://prism//lib/prism/visitor.rb#251 + # source://prism//lib/prism/visitor.rb#384 sig { params(node: Prism::HashPatternNode).void } def visit_hash_pattern_node(node); end # Visit a IfNode node # - # source://prism//lib/prism/visitor.rb#254 + # source://prism//lib/prism/visitor.rb#389 sig { params(node: Prism::IfNode).void } def visit_if_node(node); end # Visit a ImaginaryNode node # - # source://prism//lib/prism/visitor.rb#257 + # source://prism//lib/prism/visitor.rb#394 sig { params(node: Prism::ImaginaryNode).void } def visit_imaginary_node(node); end # Visit a ImplicitNode node # - # source://prism//lib/prism/visitor.rb#260 + # source://prism//lib/prism/visitor.rb#399 sig { params(node: Prism::ImplicitNode).void } def visit_implicit_node(node); end # Visit a ImplicitRestNode node # - # source://prism//lib/prism/visitor.rb#263 + # source://prism//lib/prism/visitor.rb#404 sig { params(node: Prism::ImplicitRestNode).void } def visit_implicit_rest_node(node); end # Visit a InNode node # - # source://prism//lib/prism/visitor.rb#266 + # source://prism//lib/prism/visitor.rb#409 sig { params(node: Prism::InNode).void } def visit_in_node(node); end # Visit a IndexAndWriteNode node # - # source://prism//lib/prism/visitor.rb#269 + # source://prism//lib/prism/visitor.rb#414 sig { params(node: Prism::IndexAndWriteNode).void } def visit_index_and_write_node(node); end # Visit a IndexOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#272 + # source://prism//lib/prism/visitor.rb#419 sig { params(node: Prism::IndexOperatorWriteNode).void } def visit_index_operator_write_node(node); end # Visit a IndexOrWriteNode node # - # source://prism//lib/prism/visitor.rb#275 + # source://prism//lib/prism/visitor.rb#424 sig { params(node: Prism::IndexOrWriteNode).void } def visit_index_or_write_node(node); end # Visit a IndexTargetNode node # - # source://prism//lib/prism/visitor.rb#278 + # source://prism//lib/prism/visitor.rb#429 sig { params(node: Prism::IndexTargetNode).void } def visit_index_target_node(node); end # Visit a InstanceVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#281 + # source://prism//lib/prism/visitor.rb#434 sig { params(node: Prism::InstanceVariableAndWriteNode).void } def visit_instance_variable_and_write_node(node); end # Visit a InstanceVariableOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#284 + # source://prism//lib/prism/visitor.rb#439 sig { params(node: Prism::InstanceVariableOperatorWriteNode).void } def visit_instance_variable_operator_write_node(node); end # Visit a InstanceVariableOrWriteNode node # - # source://prism//lib/prism/visitor.rb#287 + # source://prism//lib/prism/visitor.rb#444 sig { params(node: Prism::InstanceVariableOrWriteNode).void } def visit_instance_variable_or_write_node(node); end # Visit a InstanceVariableReadNode node # - # source://prism//lib/prism/visitor.rb#290 + # source://prism//lib/prism/visitor.rb#449 sig { params(node: Prism::InstanceVariableReadNode).void } def visit_instance_variable_read_node(node); end # Visit a InstanceVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#293 + # source://prism//lib/prism/visitor.rb#454 sig { params(node: Prism::InstanceVariableTargetNode).void } def visit_instance_variable_target_node(node); end # Visit a InstanceVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#296 + # source://prism//lib/prism/visitor.rb#459 sig { params(node: Prism::InstanceVariableWriteNode).void } def visit_instance_variable_write_node(node); end # Visit a IntegerNode node # - # source://prism//lib/prism/visitor.rb#299 + # source://prism//lib/prism/visitor.rb#464 sig { params(node: Prism::IntegerNode).void } def visit_integer_node(node); end # Visit a InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/visitor.rb#302 + # source://prism//lib/prism/visitor.rb#469 sig { params(node: Prism::InterpolatedMatchLastLineNode).void } def visit_interpolated_match_last_line_node(node); end # Visit a InterpolatedRegularExpressionNode node # - # source://prism//lib/prism/visitor.rb#305 + # source://prism//lib/prism/visitor.rb#474 sig { params(node: Prism::InterpolatedRegularExpressionNode).void } def visit_interpolated_regular_expression_node(node); end # Visit a InterpolatedStringNode node # - # source://prism//lib/prism/visitor.rb#308 + # source://prism//lib/prism/visitor.rb#479 sig { params(node: Prism::InterpolatedStringNode).void } def visit_interpolated_string_node(node); end # Visit a InterpolatedSymbolNode node # - # source://prism//lib/prism/visitor.rb#311 + # source://prism//lib/prism/visitor.rb#484 sig { params(node: Prism::InterpolatedSymbolNode).void } def visit_interpolated_symbol_node(node); end # Visit a InterpolatedXStringNode node # - # source://prism//lib/prism/visitor.rb#314 + # source://prism//lib/prism/visitor.rb#489 sig { params(node: Prism::InterpolatedXStringNode).void } def visit_interpolated_x_string_node(node); end # Visit a ItLocalVariableReadNode node # - # source://prism//lib/prism/visitor.rb#317 + # source://prism//lib/prism/visitor.rb#494 sig { params(node: Prism::ItLocalVariableReadNode).void } def visit_it_local_variable_read_node(node); end # Visit a ItParametersNode node # - # source://prism//lib/prism/visitor.rb#320 + # source://prism//lib/prism/visitor.rb#499 sig { params(node: Prism::ItParametersNode).void } def visit_it_parameters_node(node); end # Visit a KeywordHashNode node # - # source://prism//lib/prism/visitor.rb#323 + # source://prism//lib/prism/visitor.rb#504 sig { params(node: Prism::KeywordHashNode).void } def visit_keyword_hash_node(node); end # Visit a KeywordRestParameterNode node # - # source://prism//lib/prism/visitor.rb#326 + # source://prism//lib/prism/visitor.rb#509 sig { params(node: Prism::KeywordRestParameterNode).void } def visit_keyword_rest_parameter_node(node); end # Visit a LambdaNode node # - # source://prism//lib/prism/visitor.rb#329 + # source://prism//lib/prism/visitor.rb#514 sig { params(node: Prism::LambdaNode).void } def visit_lambda_node(node); end # Visit a LocalVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#332 + # source://prism//lib/prism/visitor.rb#519 sig { params(node: Prism::LocalVariableAndWriteNode).void } def visit_local_variable_and_write_node(node); end # Visit a LocalVariableOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#335 + # source://prism//lib/prism/visitor.rb#524 sig { params(node: Prism::LocalVariableOperatorWriteNode).void } def visit_local_variable_operator_write_node(node); end # Visit a LocalVariableOrWriteNode node # - # source://prism//lib/prism/visitor.rb#338 + # source://prism//lib/prism/visitor.rb#529 sig { params(node: Prism::LocalVariableOrWriteNode).void } def visit_local_variable_or_write_node(node); end # Visit a LocalVariableReadNode node # - # source://prism//lib/prism/visitor.rb#341 + # source://prism//lib/prism/visitor.rb#534 sig { params(node: Prism::LocalVariableReadNode).void } def visit_local_variable_read_node(node); end # Visit a LocalVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#344 + # source://prism//lib/prism/visitor.rb#539 sig { params(node: Prism::LocalVariableTargetNode).void } def visit_local_variable_target_node(node); end # Visit a LocalVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#347 + # source://prism//lib/prism/visitor.rb#544 sig { params(node: Prism::LocalVariableWriteNode).void } def visit_local_variable_write_node(node); end # Visit a MatchLastLineNode node # - # source://prism//lib/prism/visitor.rb#350 + # source://prism//lib/prism/visitor.rb#549 sig { params(node: Prism::MatchLastLineNode).void } def visit_match_last_line_node(node); end # Visit a MatchPredicateNode node # - # source://prism//lib/prism/visitor.rb#353 + # source://prism//lib/prism/visitor.rb#554 sig { params(node: Prism::MatchPredicateNode).void } def visit_match_predicate_node(node); end # Visit a MatchRequiredNode node # - # source://prism//lib/prism/visitor.rb#356 + # source://prism//lib/prism/visitor.rb#559 sig { params(node: Prism::MatchRequiredNode).void } def visit_match_required_node(node); end # Visit a MatchWriteNode node # - # source://prism//lib/prism/visitor.rb#359 + # source://prism//lib/prism/visitor.rb#564 sig { params(node: Prism::MatchWriteNode).void } def visit_match_write_node(node); end # Visit a MissingNode node # - # source://prism//lib/prism/visitor.rb#362 + # source://prism//lib/prism/visitor.rb#569 sig { params(node: Prism::MissingNode).void } def visit_missing_node(node); end # Visit a ModuleNode node # - # source://prism//lib/prism/visitor.rb#365 + # source://prism//lib/prism/visitor.rb#574 sig { params(node: Prism::ModuleNode).void } def visit_module_node(node); end # Visit a MultiTargetNode node # - # source://prism//lib/prism/visitor.rb#368 + # source://prism//lib/prism/visitor.rb#579 sig { params(node: Prism::MultiTargetNode).void } def visit_multi_target_node(node); end # Visit a MultiWriteNode node # - # source://prism//lib/prism/visitor.rb#371 + # source://prism//lib/prism/visitor.rb#584 sig { params(node: Prism::MultiWriteNode).void } def visit_multi_write_node(node); end # Visit a NextNode node # - # source://prism//lib/prism/visitor.rb#374 + # source://prism//lib/prism/visitor.rb#589 sig { params(node: Prism::NextNode).void } def visit_next_node(node); end # Visit a NilNode node # - # source://prism//lib/prism/visitor.rb#377 + # source://prism//lib/prism/visitor.rb#594 sig { params(node: Prism::NilNode).void } def visit_nil_node(node); end # Visit a NoKeywordsParameterNode node # - # source://prism//lib/prism/visitor.rb#380 + # source://prism//lib/prism/visitor.rb#599 sig { params(node: Prism::NoKeywordsParameterNode).void } def visit_no_keywords_parameter_node(node); end # Visit a NumberedParametersNode node # - # source://prism//lib/prism/visitor.rb#383 + # source://prism//lib/prism/visitor.rb#604 sig { params(node: Prism::NumberedParametersNode).void } def visit_numbered_parameters_node(node); end # Visit a NumberedReferenceReadNode node # - # source://prism//lib/prism/visitor.rb#386 + # source://prism//lib/prism/visitor.rb#609 sig { params(node: Prism::NumberedReferenceReadNode).void } def visit_numbered_reference_read_node(node); end # Visit a OptionalKeywordParameterNode node # - # source://prism//lib/prism/visitor.rb#389 + # source://prism//lib/prism/visitor.rb#614 sig { params(node: Prism::OptionalKeywordParameterNode).void } def visit_optional_keyword_parameter_node(node); end # Visit a OptionalParameterNode node # - # source://prism//lib/prism/visitor.rb#392 + # source://prism//lib/prism/visitor.rb#619 sig { params(node: Prism::OptionalParameterNode).void } def visit_optional_parameter_node(node); end # Visit a OrNode node # - # source://prism//lib/prism/visitor.rb#395 + # source://prism//lib/prism/visitor.rb#624 sig { params(node: Prism::OrNode).void } def visit_or_node(node); end # Visit a ParametersNode node # - # source://prism//lib/prism/visitor.rb#398 + # source://prism//lib/prism/visitor.rb#629 sig { params(node: Prism::ParametersNode).void } def visit_parameters_node(node); end # Visit a ParenthesesNode node # - # source://prism//lib/prism/visitor.rb#401 + # source://prism//lib/prism/visitor.rb#634 sig { params(node: Prism::ParenthesesNode).void } def visit_parentheses_node(node); end # Visit a PinnedExpressionNode node # - # source://prism//lib/prism/visitor.rb#404 + # source://prism//lib/prism/visitor.rb#639 sig { params(node: Prism::PinnedExpressionNode).void } def visit_pinned_expression_node(node); end # Visit a PinnedVariableNode node # - # source://prism//lib/prism/visitor.rb#407 + # source://prism//lib/prism/visitor.rb#644 sig { params(node: Prism::PinnedVariableNode).void } def visit_pinned_variable_node(node); end # Visit a PostExecutionNode node # - # source://prism//lib/prism/visitor.rb#410 + # source://prism//lib/prism/visitor.rb#649 sig { params(node: Prism::PostExecutionNode).void } def visit_post_execution_node(node); end # Visit a PreExecutionNode node # - # source://prism//lib/prism/visitor.rb#413 + # source://prism//lib/prism/visitor.rb#654 sig { params(node: Prism::PreExecutionNode).void } def visit_pre_execution_node(node); end # Visit a ProgramNode node # - # source://prism//lib/prism/visitor.rb#416 + # source://prism//lib/prism/visitor.rb#659 sig { params(node: Prism::ProgramNode).void } def visit_program_node(node); end # Visit a RangeNode node # - # source://prism//lib/prism/visitor.rb#419 + # source://prism//lib/prism/visitor.rb#664 sig { params(node: Prism::RangeNode).void } def visit_range_node(node); end # Visit a RationalNode node # - # source://prism//lib/prism/visitor.rb#422 + # source://prism//lib/prism/visitor.rb#669 sig { params(node: Prism::RationalNode).void } def visit_rational_node(node); end # Visit a RedoNode node # - # source://prism//lib/prism/visitor.rb#425 + # source://prism//lib/prism/visitor.rb#674 sig { params(node: Prism::RedoNode).void } def visit_redo_node(node); end # Visit a RegularExpressionNode node # - # source://prism//lib/prism/visitor.rb#428 + # source://prism//lib/prism/visitor.rb#679 sig { params(node: Prism::RegularExpressionNode).void } def visit_regular_expression_node(node); end # Visit a RequiredKeywordParameterNode node # - # source://prism//lib/prism/visitor.rb#431 + # source://prism//lib/prism/visitor.rb#684 sig { params(node: Prism::RequiredKeywordParameterNode).void } def visit_required_keyword_parameter_node(node); end # Visit a RequiredParameterNode node # - # source://prism//lib/prism/visitor.rb#434 + # source://prism//lib/prism/visitor.rb#689 sig { params(node: Prism::RequiredParameterNode).void } def visit_required_parameter_node(node); end # Visit a RescueModifierNode node # - # source://prism//lib/prism/visitor.rb#437 + # source://prism//lib/prism/visitor.rb#694 sig { params(node: Prism::RescueModifierNode).void } def visit_rescue_modifier_node(node); end # Visit a RescueNode node # - # source://prism//lib/prism/visitor.rb#440 + # source://prism//lib/prism/visitor.rb#699 sig { params(node: Prism::RescueNode).void } def visit_rescue_node(node); end # Visit a RestParameterNode node # - # source://prism//lib/prism/visitor.rb#443 + # source://prism//lib/prism/visitor.rb#704 sig { params(node: Prism::RestParameterNode).void } def visit_rest_parameter_node(node); end # Visit a RetryNode node # - # source://prism//lib/prism/visitor.rb#446 + # source://prism//lib/prism/visitor.rb#709 sig { params(node: Prism::RetryNode).void } def visit_retry_node(node); end # Visit a ReturnNode node # - # source://prism//lib/prism/visitor.rb#449 + # source://prism//lib/prism/visitor.rb#714 sig { params(node: Prism::ReturnNode).void } def visit_return_node(node); end # Visit a SelfNode node # - # source://prism//lib/prism/visitor.rb#452 + # source://prism//lib/prism/visitor.rb#719 sig { params(node: Prism::SelfNode).void } def visit_self_node(node); end # Visit a ShareableConstantNode node # - # source://prism//lib/prism/visitor.rb#455 + # source://prism//lib/prism/visitor.rb#724 sig { params(node: Prism::ShareableConstantNode).void } def visit_shareable_constant_node(node); end # Visit a SingletonClassNode node # - # source://prism//lib/prism/visitor.rb#458 + # source://prism//lib/prism/visitor.rb#729 sig { params(node: Prism::SingletonClassNode).void } def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node # - # source://prism//lib/prism/visitor.rb#461 + # source://prism//lib/prism/visitor.rb#734 sig { params(node: Prism::SourceEncodingNode).void } def visit_source_encoding_node(node); end # Visit a SourceFileNode node # - # source://prism//lib/prism/visitor.rb#464 + # source://prism//lib/prism/visitor.rb#739 sig { params(node: Prism::SourceFileNode).void } def visit_source_file_node(node); end # Visit a SourceLineNode node # - # source://prism//lib/prism/visitor.rb#467 + # source://prism//lib/prism/visitor.rb#744 sig { params(node: Prism::SourceLineNode).void } def visit_source_line_node(node); end # Visit a SplatNode node # - # source://prism//lib/prism/visitor.rb#470 + # source://prism//lib/prism/visitor.rb#749 sig { params(node: Prism::SplatNode).void } def visit_splat_node(node); end # Visit a StatementsNode node # - # source://prism//lib/prism/visitor.rb#473 + # source://prism//lib/prism/visitor.rb#754 sig { params(node: Prism::StatementsNode).void } def visit_statements_node(node); end # Visit a StringNode node # - # source://prism//lib/prism/visitor.rb#476 + # source://prism//lib/prism/visitor.rb#759 sig { params(node: Prism::StringNode).void } def visit_string_node(node); end # Visit a SuperNode node # - # source://prism//lib/prism/visitor.rb#479 + # source://prism//lib/prism/visitor.rb#764 sig { params(node: Prism::SuperNode).void } def visit_super_node(node); end # Visit a SymbolNode node # - # source://prism//lib/prism/visitor.rb#482 + # source://prism//lib/prism/visitor.rb#769 sig { params(node: Prism::SymbolNode).void } def visit_symbol_node(node); end # Visit a TrueNode node # - # source://prism//lib/prism/visitor.rb#485 + # source://prism//lib/prism/visitor.rb#774 sig { params(node: Prism::TrueNode).void } def visit_true_node(node); end # Visit a UndefNode node # - # source://prism//lib/prism/visitor.rb#488 + # source://prism//lib/prism/visitor.rb#779 sig { params(node: Prism::UndefNode).void } def visit_undef_node(node); end # Visit a UnlessNode node # - # source://prism//lib/prism/visitor.rb#491 + # source://prism//lib/prism/visitor.rb#784 sig { params(node: Prism::UnlessNode).void } def visit_unless_node(node); end # Visit a UntilNode node # - # source://prism//lib/prism/visitor.rb#494 + # source://prism//lib/prism/visitor.rb#789 sig { params(node: Prism::UntilNode).void } def visit_until_node(node); end # Visit a WhenNode node # - # source://prism//lib/prism/visitor.rb#497 + # source://prism//lib/prism/visitor.rb#794 sig { params(node: Prism::WhenNode).void } def visit_when_node(node); end # Visit a WhileNode node # - # source://prism//lib/prism/visitor.rb#500 + # source://prism//lib/prism/visitor.rb#799 sig { params(node: Prism::WhileNode).void } def visit_while_node(node); end # Visit a XStringNode node # - # source://prism//lib/prism/visitor.rb#503 + # source://prism//lib/prism/visitor.rb#804 sig { params(node: Prism::XStringNode).void } def visit_x_string_node(node); end # Visit a YieldNode node # - # source://prism//lib/prism/visitor.rb#506 + # source://prism//lib/prism/visitor.rb#809 sig { params(node: Prism::YieldNode).void } def visit_yield_node(node); end end @@ -41084,13 +41420,13 @@ end # ^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#17881 +# source://prism//lib/prism/node.rb#18052 class Prism::WhenNode < ::Prism::Node # Initialize a new WhenNode node. # # @return [WhenNode] a new instance of WhenNode # - # source://prism//lib/prism/node.rb#17883 + # source://prism//lib/prism/node.rb#18054 sig do params( source: Prism::Source, @@ -41108,42 +41444,42 @@ class Prism::WhenNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#17995 + # source://prism//lib/prism/node.rb#18166 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17895 + # source://prism//lib/prism/node.rb#18066 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17900 + # source://prism//lib/prism/node.rb#18071 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17913 + # source://prism//lib/prism/node.rb#18084 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#17905 + # source://prism//lib/prism/node.rb#18076 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#17944 + # source://prism//lib/prism/node.rb#18115 sig { returns(T::Array[Prism::Node]) } def conditions; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?conditions: Array[Prism::node], ?then_keyword_loc: Location?, ?statements: StatementsNode?) -> WhenNode # - # source://prism//lib/prism/node.rb#17918 + # source://prism//lib/prism/node.rb#18089 sig do params( node_id: Integer, @@ -41157,16 +41493,16 @@ class Prism::WhenNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), conditions: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#17923 + # source://prism//lib/prism/node.rb#18094 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, conditions: Array[Prism::node], then_keyword_loc: Location?, statements: StatementsNode? } # - # source://prism//lib/prism/node.rb#17926 + # source://prism//lib/prism/node.rb#18097 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -41175,62 +41511,62 @@ class Prism::WhenNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#17979 + # source://prism//lib/prism/node.rb#18150 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17969 + # source://prism//lib/prism/node.rb#18140 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17931 + # source://prism//lib/prism/node.rb#18102 sig { returns(Prism::Location) } def keyword_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17939 + # source://prism//lib/prism/node.rb#18110 def save_keyword_loc(repository); end # Save the then_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#17961 + # source://prism//lib/prism/node.rb#18132 def save_then_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#17966 + # source://prism//lib/prism/node.rb#18137 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#17974 + # source://prism//lib/prism/node.rb#18145 sig { returns(T.nilable(String)) } def then_keyword; end # attr_reader then_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#17947 + # source://prism//lib/prism/node.rb#18118 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#17984 + # source://prism//lib/prism/node.rb#18155 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#17989 + # source://prism//lib/prism/node.rb#18160 def type; end end end @@ -41243,13 +41579,13 @@ end # while foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18012 +# source://prism//lib/prism/node.rb#18183 class Prism::WhileNode < ::Prism::Node # Initialize a new WhileNode node. # # @return [WhileNode] a new instance of WhileNode # - # source://prism//lib/prism/node.rb#18014 + # source://prism//lib/prism/node.rb#18185 sig do params( source: Prism::Source, @@ -41268,12 +41604,12 @@ class Prism::WhileNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#18156 + # source://prism//lib/prism/node.rb#18327 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18027 + # source://prism//lib/prism/node.rb#18198 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end @@ -41281,43 +41617,43 @@ class Prism::WhileNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18063 + # source://prism//lib/prism/node.rb#18234 sig { returns(T::Boolean) } def begin_modifier?; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18032 + # source://prism//lib/prism/node.rb#18203 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18135 + # source://prism//lib/prism/node.rb#18306 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18100 + # source://prism//lib/prism/node.rb#18271 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18045 + # source://prism//lib/prism/node.rb#18216 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18037 + # source://prism//lib/prism/node.rb#18208 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?do_keyword_loc: Location?, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?) -> WhileNode # - # source://prism//lib/prism/node.rb#18050 + # source://prism//lib/prism/node.rb#18221 sig do params( node_id: Integer, @@ -41332,28 +41668,28 @@ class Prism::WhileNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), do_keyword_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), predicate: T.unsafe(nil), statements: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18055 + # source://prism//lib/prism/node.rb#18226 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, do_keyword_loc: Location?, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode? } # - # source://prism//lib/prism/node.rb#18058 + # source://prism//lib/prism/node.rb#18229 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def do_keyword: () -> String? # - # source://prism//lib/prism/node.rb#18130 + # source://prism//lib/prism/node.rb#18301 sig { returns(T.nilable(String)) } def do_keyword; end # attr_reader do_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#18081 + # source://prism//lib/prism/node.rb#18252 sig { returns(T.nilable(Prism::Location)) } def do_keyword_loc; end @@ -41362,65 +41698,65 @@ class Prism::WhileNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18140 + # source://prism//lib/prism/node.rb#18311 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18125 + # source://prism//lib/prism/node.rb#18296 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18068 + # source://prism//lib/prism/node.rb#18239 sig { returns(Prism::Location) } def keyword_loc; end - # source://prism//lib/prism/parse_result/newlines.rb#109 + # source://prism//lib/prism/parse_result/newlines.rb#110 def newline_flag!(lines); end # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#18119 + # source://prism//lib/prism/node.rb#18290 sig { returns(Prism::Node) } def predicate; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18114 + # source://prism//lib/prism/node.rb#18285 def save_closing_loc(repository); end # Save the do_keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18095 + # source://prism//lib/prism/node.rb#18266 def save_do_keyword_loc(repository); end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18076 + # source://prism//lib/prism/node.rb#18247 def save_keyword_loc(repository); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18122 + # source://prism//lib/prism/node.rb#18293 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#18145 + # source://prism//lib/prism/node.rb#18316 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#18150 + # source://prism//lib/prism/node.rb#18321 def type; end end end @@ -41430,7 +41766,7 @@ end # `foo` # ^^^^^ # -# source://prism//lib/prism/node.rb#18171 +# source://prism//lib/prism/node.rb#18342 class Prism::XStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -41438,7 +41774,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [XStringNode] a new instance of XStringNode # - # source://prism//lib/prism/node.rb#18173 + # source://prism//lib/prism/node.rb#18344 sig do params( source: Prism::Source, @@ -41456,60 +41792,60 @@ class Prism::XStringNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#18301 + # source://prism//lib/prism/node.rb#18472 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18185 + # source://prism//lib/prism/node.rb#18356 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18190 + # source://prism//lib/prism/node.rb#18361 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#18280 + # source://prism//lib/prism/node.rb#18451 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#18254 + # source://prism//lib/prism/node.rb#18425 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18200 + # source://prism//lib/prism/node.rb#18371 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18195 + # source://prism//lib/prism/node.rb#18366 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#18275 + # source://prism//lib/prism/node.rb#18446 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#18241 + # source://prism//lib/prism/node.rb#18412 sig { returns(Prism::Location) } def content_loc; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String) -> XStringNode # - # source://prism//lib/prism/node.rb#18205 + # source://prism//lib/prism/node.rb#18376 sig do params( node_id: Integer, @@ -41523,16 +41859,16 @@ class Prism::XStringNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18210 + # source://prism//lib/prism/node.rb#18381 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String } # - # source://prism//lib/prism/node.rb#18213 + # source://prism//lib/prism/node.rb#18384 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -41543,7 +41879,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18223 + # source://prism//lib/prism/node.rb#18394 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -41551,7 +41887,7 @@ class Prism::XStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18218 + # source://prism//lib/prism/node.rb#18389 sig { returns(T::Boolean) } def forced_utf8_encoding?; end @@ -41560,63 +41896,63 @@ class Prism::XStringNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18285 + # source://prism//lib/prism/node.rb#18456 sig { override.returns(String) } def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#18270 + # source://prism//lib/prism/node.rb#18441 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#18228 + # source://prism//lib/prism/node.rb#18399 sig { returns(Prism::Location) } def opening_loc; end # Save the closing_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18262 + # source://prism//lib/prism/node.rb#18433 def save_closing_loc(repository); end # Save the content_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18249 + # source://prism//lib/prism/node.rb#18420 def save_content_loc(repository); end # Save the opening_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18236 + # source://prism//lib/prism/node.rb#18407 def save_opening_loc(repository); end # Occasionally it's helpful to treat a string as if it were interpolated so # that there's a consistent interface for working with strings. # - # source://prism//lib/prism/node_ext.rb#90 + # source://prism//lib/prism/node_ext.rb#93 sig { returns(Prism::InterpolatedXStringNode) } def to_interpolated; end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#18290 + # source://prism//lib/prism/node.rb#18461 sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#18267 + # source://prism//lib/prism/node.rb#18438 sig { returns(String) } def unescaped; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#18295 + # source://prism//lib/prism/node.rb#18466 def type; end end end @@ -41626,13 +41962,13 @@ end # yield 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#18315 +# source://prism//lib/prism/node.rb#18486 class Prism::YieldNode < ::Prism::Node # Initialize a new YieldNode node. # # @return [YieldNode] a new instance of YieldNode # - # source://prism//lib/prism/node.rb#18317 + # source://prism//lib/prism/node.rb#18488 sig do params( source: Prism::Source, @@ -41650,42 +41986,42 @@ class Prism::YieldNode < ::Prism::Node # Implements case-equality for the node. This is effectively == but without # comparing the value of locations. Locations are checked only for presence. # - # source://prism//lib/prism/node.rb#18449 + # source://prism//lib/prism/node.rb#18620 def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18329 + # source://prism//lib/prism/node.rb#18500 sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#18396 + # source://prism//lib/prism/node.rb#18567 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end - # def child_nodes: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18334 + # source://prism//lib/prism/node.rb#18505 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18346 + # source://prism//lib/prism/node.rb#18517 sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#18339 + # source://prism//lib/prism/node.rb#18510 sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def copy: (?node_id: Integer, ?location: Location, ?flags: Integer, ?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?) -> YieldNode # - # source://prism//lib/prism/node.rb#18351 + # source://prism//lib/prism/node.rb#18522 sig do params( node_id: Integer, @@ -41699,16 +42035,16 @@ class Prism::YieldNode < ::Prism::Node end def copy(node_id: T.unsafe(nil), location: T.unsafe(nil), flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), arguments: T.unsafe(nil), rparen_loc: T.unsafe(nil)); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def child_nodes: () -> Array[Node?] + # def deconstruct: () -> Array[Node?] # - # source://prism//lib/prism/node.rb#18356 + # source://prism//lib/prism/node.rb#18527 sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { node_id: Integer, location: Location, keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location? } # - # source://prism//lib/prism/node.rb#18359 + # source://prism//lib/prism/node.rb#18530 sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end @@ -41717,74 +42053,74 @@ class Prism::YieldNode < ::Prism::Node # def inspect -> String # - # source://prism//lib/prism/node.rb#18433 + # source://prism//lib/prism/node.rb#18604 sig { override.returns(String) } def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18418 + # source://prism//lib/prism/node.rb#18589 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18364 + # source://prism//lib/prism/node.rb#18535 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#18423 + # source://prism//lib/prism/node.rb#18594 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#18377 + # source://prism//lib/prism/node.rb#18548 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#18428 + # source://prism//lib/prism/node.rb#18599 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#18399 + # source://prism//lib/prism/node.rb#18570 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Save the keyword_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18372 + # source://prism//lib/prism/node.rb#18543 def save_keyword_loc(repository); end # Save the lparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18391 + # source://prism//lib/prism/node.rb#18562 def save_lparen_loc(repository); end # Save the rparen_loc location using the given saved source so that # it can be retrieved later. # - # source://prism//lib/prism/node.rb#18413 + # source://prism//lib/prism/node.rb#18584 def save_rparen_loc(repository); end # Return a symbol representation of this node type. See `Node#type`. # - # source://prism//lib/prism/node.rb#18438 + # source://prism//lib/prism/node.rb#18609 sig { override.returns(Symbol) } def type; end class << self # Return a symbol representation of this node type. See `Node::type`. # - # source://prism//lib/prism/node.rb#18443 + # source://prism//lib/prism/node.rb#18614 def type; end end end diff --git a/sorbet/tapioca/require.rb b/sorbet/tapioca/require.rb index a546bd683d..36dd0a2df3 100644 --- a/sorbet/tapioca/require.rb +++ b/sorbet/tapioca/require.rb @@ -20,4 +20,3 @@ require "test/unit/ui/testrunnermediator" require "test/unit/ui/console/testrunner" require "lint_roller" -require "package_url" diff --git a/test/integration_test.rb b/test/integration_test.rb index 9361ea49ca..850fbc7eed 100644 --- a/test/integration_test.rb +++ b/test/integration_test.rb @@ -5,6 +5,8 @@ class IntegrationTest < Minitest::Test def setup + Bundler.reset! + Bundler.setup @bundle_path = Bundler.bundle_path.to_s end @@ -472,9 +474,9 @@ def launch(workspace_path, exec = "ruby-lsp-launcher", extra_env = {}) }) # First message is the log of initializing Ruby LSP - read_message(stdout) + read_message(stdout, stderr) # Verify that initialization didn't fail - initialize_response = read_message(stdout) + initialize_response = read_message(stdout, stderr) refute(initialize_response[:error], initialize_response.dig(:error, :message)) send_message(stdin, { id: 2, method: "shutdown" }) @@ -504,8 +506,10 @@ def send_message(stdin, message) stdin.flush end - def read_message(stdout) + def read_message(stdout, stderr) headers = stdout.gets("\r\n\r\n") + flunk(stderr.read) unless headers + length = headers[/Content-Length: (\d+)/i, 1].to_i JSON.parse(stdout.read(length), symbolize_names: true) end