From c85210da7baa9bd24affb51e879b82d57427fecc Mon Sep 17 00:00:00 2001 From: Max VelDink Date: Tue, 28 May 2024 14:46:22 -0400 Subject: [PATCH 1/3] feat!: Add serializer, serialize_to and deserialize_from to structs --- lib/sorbet-schema/t/struct.rb | 32 +++++++++++++++++++++++++++++--- lib/typed/serializer.rb | 2 +- test/t/struct_test.rb | 26 ++++++++++++++++++++++++++ 3 files changed, 56 insertions(+), 4 deletions(-) diff --git a/lib/sorbet-schema/t/struct.rb b/lib/sorbet-schema/t/struct.rb index 351f045..d5a96c5 100644 --- a/lib/sorbet-schema/t/struct.rb +++ b/lib/sorbet-schema/t/struct.rb @@ -4,9 +4,35 @@ module T class Struct extend T::Sig - sig { overridable.returns(Typed::Schema) } - def self.schema - Typed::Schema.from_struct(self) + class << self + extend T::Sig + + sig { overridable.returns(Typed::Schema) } + def schema + Typed::Schema.from_struct(self) + end + + sig { params(type: Symbol).returns(Typed::Serializer[T.untyped, T.untyped]) } + def serializer(type) + case type + when :hash + Typed::HashSerializer.new(schema:) + when :json + Typed::JSONSerializer.new(schema:) + else + raise ArgumentError, "unknown serializer for #{type}" + end + end + + sig { params(serializer_type: Symbol, source: T.untyped).returns(Typed::Serializer::DeserializeResult) } + def deserialize_from(serializer_type, source) + serializer(serializer_type).deserialize(source) + end + end + + sig { params(serializer_type: Symbol).returns(Typed::Result[T.untyped, Typed::SerializeError]) } + def serialize_to(serializer_type) + self.class.serializer(serializer_type).serialize(self) end end end diff --git a/lib/typed/serializer.rb b/lib/typed/serializer.rb index 21e91ca..0e97520 100644 --- a/lib/typed/serializer.rb +++ b/lib/typed/serializer.rb @@ -10,7 +10,7 @@ class Serializer Input = type_member Output = type_member Params = T.type_alias { T::Hash[Symbol, T.untyped] } - DeserializeResult = T.type_alias { Typed::Result[T::Struct, DeserializeError] } + DeserializeResult = T.type_alias { Result[T::Struct, DeserializeError] } sig { returns(Schema) } attr_reader :schema diff --git a/test/t/struct_test.rb b/test/t/struct_test.rb index bd7af05..6bd342b 100644 --- a/test/t/struct_test.rb +++ b/test/t/struct_test.rb @@ -12,4 +12,30 @@ def test_schema_can_be_derived_from_struct assert_equal(expected_schema, City.schema) end + + def test_serializer_returns_hash_serializer + assert_kind_of(Typed::HashSerializer, City.serializer(:hash)) + end + + def test_serializer_returns_json_serializer + assert_kind_of(Typed::JSONSerializer, City.serializer(:json)) + end + + def test_serializer_raises_argument_error_when_unknown_serializer + assert_raises(ArgumentError) { City.serializer(:banana) } + end + + def test_deserialize_from_works + result = City.deserialize_from(:hash, {name: "New York", capital: false}) + + assert_success(result) + assert_payload(NEW_YORK_CITY, result) + end + + def test_serialize_to_works + result = NEW_YORK_CITY.serialize_to(:json) + + assert_success(result) + assert_payload("{\"name\":\"New York\",\"capital\":false}", result) + end end From 1ebe933081a8acd2f6d9592b73a7c3048c56c851 Mon Sep 17 00:00:00 2001 From: Max VelDink Date: Tue, 28 May 2024 14:48:37 -0400 Subject: [PATCH 2/3] docs: update docs --- README.md | 12 +++++++++++- 1 file changed, 11 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 59cbc93..505674c 100644 --- a/README.md +++ b/README.md @@ -18,7 +18,7 @@ Sorbet Schema is designed to be compatible with Sorbet's `T::Struct` class, and ### Getting Started -While you can directly define a `Typed::Schema` to be used for your serialization needs, you'll typically use the provider helper class method to generate a `Schema` from an existing `T::Struct`. +While you can directly define a `Typed::Schema` to be used for your serialization needs, you'll typically use the provided helper class method to generate a `Schema` from an existing `T::Struct`. ```ruby class Person < T::Struct @@ -44,6 +44,16 @@ result = json_serializer.serialize(max) result.payload # == '{"name":"Max","age":29}' ``` +Alternatively, you can use the built-in helper methods added to `T::Struct`s to quickly use the built-in serializers. + +```ruby +result = Person.deserialize_from(:json, '{"name":"Max","age":29}') +max = result.payload # == Person.new(name: "Max", age: 29) + +result = max.serialize_to(:json) +result.payload # == '{"name":"Max","age":29}' +``` + Notice that both `deserialize` and `serialize` return `Typed::Result`s (from the [sorbet-result gem](https://github.com/maxveldink/sorbet-result)) that need to be checked for success or failure before being used. Check out that gem's README for more information on how to interact with `Result`s. One benefit of using `Result`s is we can add much more details information about why a format is unsuccessfully deserialized or serialized, to provide call sites with more information for error handling, messaging and formatting. From 0d54b82780ba092eb624959de66481332ce4447a Mon Sep 17 00:00:00 2001 From: Max VelDink Date: Tue, 28 May 2024 15:03:32 -0400 Subject: [PATCH 3/3] chore: Update deps --- Gemfile.lock | 70 +- sorbet/rbi/gems/ansi@1.5.0.rbi | 1 + sorbet/rbi/gems/ast@2.4.2.rbi | 1 + ...decimal@3.1.7.rbi => bigdecimal@3.1.8.rbi} | 1 + sorbet/rbi/gems/builder@3.2.4.rbi | 1 + sorbet/rbi/gems/erubi@1.12.0.rbi | 1 + sorbet/rbi/gems/io-console@0.7.2.rbi | 1 + sorbet/rbi/gems/json@2.7.2.rbi | 1 + .../language_server-protocol@3.17.0.3.rbi | 1 + sorbet/rbi/gems/lint_roller@1.1.0.rbi | 1 + sorbet/rbi/gems/minitest-focus@1.4.0.rbi | 27 +- sorbet/rbi/gems/minitest-reporters@1.6.1.rbi | 53 +- ...initest@5.22.3.rbi => minitest@5.23.1.rbi} | 301 +- sorbet/rbi/gems/netrc@0.11.0.rbi | 1 + sorbet/rbi/gems/parallel@1.24.0.rbi | 1 + ...{parser@3.3.0.5.rbi => parser@3.3.1.0.rbi} | 419 +- .../{prism@0.24.0.rbi => prism@0.29.0.rbi} | 31323 ++++++++++------ sorbet/rbi/gems/psych@5.1.2.rbi | 1 + .../gems/{racc@1.7.3.rbi => racc@1.8.0.rbi} | 71 +- sorbet/rbi/gems/rainbow@3.1.1.rbi | 1 + sorbet/rbi/gems/rake@13.2.1.rbi | 1 + .../gems/{rbi@0.1.10.rbi => rbi@0.1.13.rbi} | 41 +- ...rser@2.9.0.rbi => regexp_parser@2.9.2.rbi} | 5 +- .../{reline@0.5.2.rbi => reline@0.5.7.rbi} | 1 + .../gems/{rexml@3.2.6.rbi => rexml@3.2.8.rbi} | 229 +- ...-ast@1.31.2.rbi => rubocop-ast@1.31.3.rbi} | 10 +- ...0.2.rbi => rubocop-performance@1.21.0.rbi} | 1 + sorbet/rbi/gems/rubocop-sorbet@0.7.8.rbi | 1 + ...{rubocop@1.62.1.rbi => rubocop@1.63.5.rbi} | 983 +- sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi | 1 + sorbet/rbi/gems/sorbet-result@1.1.0.rbi | 165 +- .../gems/sorbet-struct-comparable@1.3.0.rbi | 1 + .../gems/{spoom@1.3.0.rbi => spoom@1.3.2.rbi} | 37 +- sorbet/rbi/gems/standard-custom@1.0.2.rbi | 1 + ...3.1.rbi => standard-performance@1.4.0.rbi} | 1 + sorbet/rbi/gems/standard-sorbet@0.0.2.rbi | 1 + ...tandard@1.35.1.rbi => standard@1.36.0.rbi} | 121 +- sorbet/rbi/gems/stringio@3.1.0.rbi | 1 + sorbet/rbi/gems/strscan@3.1.0.rbi | 9 + ...{tapioca@0.13.3.rbi => tapioca@0.14.2.rbi} | 196 +- sorbet/rbi/gems/thor@1.3.1.rbi | 1 + .../rbi/gems/unicode-display_width@2.5.0.rbi | 1 + sorbet/rbi/gems/yard-sorbet@0.8.1.rbi | 3 +- sorbet/rbi/gems/yard@0.9.36.rbi | 1 + ...eitwerk@2.6.13.rbi => zeitwerk@2.6.15.rbi} | 83 +- 45 files changed, 20759 insertions(+), 13413 deletions(-) rename sorbet/rbi/gems/{bigdecimal@3.1.7.rbi => bigdecimal@3.1.8.rbi} (99%) rename sorbet/rbi/gems/{minitest@5.22.3.rbi => minitest@5.23.1.rbi} (90%) rename sorbet/rbi/gems/{parser@3.3.0.5.rbi => parser@3.3.1.0.rbi} (93%) rename sorbet/rbi/gems/{prism@0.24.0.rbi => prism@0.29.0.rbi} (52%) rename sorbet/rbi/gems/{racc@1.7.3.rbi => racc@1.8.0.rbi} (66%) rename sorbet/rbi/gems/{rbi@0.1.10.rbi => rbi@0.1.13.rbi} (98%) rename sorbet/rbi/gems/{regexp_parser@2.9.0.rbi => regexp_parser@2.9.2.rbi} (99%) rename sorbet/rbi/gems/{reline@0.5.2.rbi => reline@0.5.7.rbi} (99%) rename sorbet/rbi/gems/{rexml@3.2.6.rbi => rexml@3.2.8.rbi} (96%) rename sorbet/rbi/gems/{rubocop-ast@1.31.2.rbi => rubocop-ast@1.31.3.rbi} (99%) rename sorbet/rbi/gems/{rubocop-performance@1.20.2.rbi => rubocop-performance@1.21.0.rbi} (99%) rename sorbet/rbi/gems/{rubocop@1.62.1.rbi => rubocop@1.63.5.rbi} (98%) rename sorbet/rbi/gems/{spoom@1.3.0.rbi => spoom@1.3.2.rbi} (99%) rename sorbet/rbi/gems/{standard-performance@1.3.1.rbi => standard-performance@1.4.0.rbi} (99%) rename sorbet/rbi/gems/{standard@1.35.1.rbi => standard@1.36.0.rbi} (87%) create mode 100644 sorbet/rbi/gems/strscan@3.1.0.rbi rename sorbet/rbi/gems/{tapioca@0.13.3.rbi => tapioca@0.14.2.rbi} (95%) rename sorbet/rbi/gems/{zeitwerk@2.6.13.rbi => zeitwerk@2.6.15.rbi} (92%) diff --git a/Gemfile.lock b/Gemfile.lock index 1b22a53..1f5379e 100644 --- a/Gemfile.lock +++ b/Gemfile.lock @@ -12,20 +12,20 @@ GEM specs: ansi (1.5.0) ast (2.4.2) - bigdecimal (3.1.7) + bigdecimal (3.1.8) builder (3.2.4) debug (1.9.2) irb (~> 1.10) reline (>= 0.3.8) erubi (1.12.0) io-console (0.7.2) - irb (1.12.0) - rdoc + irb (1.13.1) + rdoc (>= 4.0.0) reline (>= 0.4.2) json (2.7.2) language_server-protocol (3.17.0.3) lint_roller (1.1.0) - minitest (5.22.3) + minitest (5.23.1) minitest-focus (1.4.0) minitest (>= 4, < 6) minitest-reporters (1.6.1) @@ -35,25 +35,26 @@ GEM ruby-progressbar netrc (0.11.0) parallel (1.24.0) - parser (3.3.0.5) + parser (3.3.1.0) ast (~> 2.4.1) racc - prism (0.24.0) + prism (0.29.0) psych (5.1.2) stringio - racc (1.7.3) + racc (1.8.0) rainbow (3.1.1) rake (13.2.1) - rbi (0.1.10) - prism (>= 0.18.0, < 0.25) + rbi (0.1.13) + prism (>= 0.18.0, < 1.0.0) sorbet-runtime (>= 0.5.9204) - rdoc (6.6.3.1) + rdoc (6.7.0) psych (>= 4.0.0) - regexp_parser (2.9.0) - reline (0.5.2) + regexp_parser (2.9.2) + reline (0.5.7) io-console (~> 0.5) - rexml (3.2.6) - rubocop (1.62.1) + rexml (3.2.8) + strscan (>= 3.0.9) + rubocop (1.63.5) json (~> 2.3) language_server-protocol (>= 3.17.0) parallel (~> 1.10) @@ -64,48 +65,49 @@ GEM rubocop-ast (>= 1.31.1, < 2.0) ruby-progressbar (~> 1.7) unicode-display_width (>= 2.4.0, < 3.0) - rubocop-ast (1.31.2) - parser (>= 3.3.0.4) - rubocop-performance (1.20.2) + rubocop-ast (1.31.3) + parser (>= 3.3.1.0) + rubocop-performance (1.21.0) rubocop (>= 1.48.1, < 2.0) - rubocop-ast (>= 1.30.0, < 2.0) + rubocop-ast (>= 1.31.1, < 2.0) rubocop-sorbet (0.7.8) rubocop (>= 0.90.0) ruby-progressbar (1.13.0) - sorbet (0.5.11347) - sorbet-static (= 0.5.11347) + sorbet (0.5.11391) + sorbet-static (= 0.5.11391) sorbet-result (1.1.0) sorbet-runtime (~> 0.5) - sorbet-runtime (0.5.11347) - sorbet-static (0.5.11347-universal-darwin) - sorbet-static (0.5.11347-x86_64-linux) - sorbet-static-and-runtime (0.5.11347) - sorbet (= 0.5.11347) - sorbet-runtime (= 0.5.11347) + sorbet-runtime (0.5.11391) + sorbet-static (0.5.11391-universal-darwin) + sorbet-static (0.5.11391-x86_64-linux) + sorbet-static-and-runtime (0.5.11391) + sorbet (= 0.5.11391) + sorbet-runtime (= 0.5.11391) sorbet-struct-comparable (1.3.0) sorbet-runtime (>= 0.5) - spoom (1.3.0) + spoom (1.3.2) erubi (>= 1.10.0) prism (>= 0.19.0) sorbet-static-and-runtime (>= 0.5.10187) thor (>= 0.19.2) - standard (1.35.1) + standard (1.36.0) language_server-protocol (~> 3.17.0.2) lint_roller (~> 1.0) - rubocop (~> 1.62.0) + rubocop (~> 1.63.0) standard-custom (~> 1.0.0) - standard-performance (~> 1.3) + standard-performance (~> 1.4) standard-custom (1.0.2) lint_roller (~> 1.0) rubocop (~> 1.50) - standard-performance (1.3.1) + standard-performance (1.4.0) lint_roller (~> 1.1) - rubocop-performance (~> 1.20.2) + rubocop-performance (~> 1.21.0) standard-sorbet (0.0.2) lint_roller (~> 1.1) rubocop-sorbet (~> 0.7.0) stringio (3.1.0) - tapioca (0.13.3) + strscan (3.1.0) + tapioca (0.14.2) bundler (>= 2.2.25) netrc (>= 0.11.0) parallel (>= 1.21.0) @@ -120,7 +122,7 @@ GEM yard-sorbet (0.8.1) sorbet-runtime (>= 0.5) yard (>= 0.9) - zeitwerk (2.6.13) + zeitwerk (2.6.15) PLATFORMS arm64-darwin-22 diff --git a/sorbet/rbi/gems/ansi@1.5.0.rbi b/sorbet/rbi/gems/ansi@1.5.0.rbi index 89d322c..7fc7dfd 100644 --- a/sorbet/rbi/gems/ansi@1.5.0.rbi +++ b/sorbet/rbi/gems/ansi@1.5.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `ansi` gem. # Please instead update this file by running `bin/tapioca gem ansi`. + # ANSI namespace module contains all the ANSI related classes. # # source://ansi//lib/ansi/code.rb#1 diff --git a/sorbet/rbi/gems/ast@2.4.2.rbi b/sorbet/rbi/gems/ast@2.4.2.rbi index 3fc4495..e0ae88e 100644 --- a/sorbet/rbi/gems/ast@2.4.2.rbi +++ b/sorbet/rbi/gems/ast@2.4.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `ast` gem. # Please instead update this file by running `bin/tapioca gem ast`. + # {AST} is a library for manipulating abstract syntax trees. # # It embraces immutability; each AST node is inherently frozen at diff --git a/sorbet/rbi/gems/bigdecimal@3.1.7.rbi b/sorbet/rbi/gems/bigdecimal@3.1.8.rbi similarity index 99% rename from sorbet/rbi/gems/bigdecimal@3.1.7.rbi rename to sorbet/rbi/gems/bigdecimal@3.1.8.rbi index 24b5f4e..c52d9ff 100644 --- a/sorbet/rbi/gems/bigdecimal@3.1.7.rbi +++ b/sorbet/rbi/gems/bigdecimal@3.1.8.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `bigdecimal` gem. # Please instead update this file by running `bin/tapioca gem bigdecimal`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/builder@3.2.4.rbi b/sorbet/rbi/gems/builder@3.2.4.rbi index f99d492..6e29b77 100644 --- a/sorbet/rbi/gems/builder@3.2.4.rbi +++ b/sorbet/rbi/gems/builder@3.2.4.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `builder` gem. # Please instead update this file by running `bin/tapioca gem builder`. + # If the Builder::XChar module is not currently defined, fail on any # name clashes in standard library classes. # diff --git a/sorbet/rbi/gems/erubi@1.12.0.rbi b/sorbet/rbi/gems/erubi@1.12.0.rbi index c52738f..d16b610 100644 --- a/sorbet/rbi/gems/erubi@1.12.0.rbi +++ b/sorbet/rbi/gems/erubi@1.12.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `erubi` gem. # Please instead update this file by running `bin/tapioca gem erubi`. + # source://erubi//lib/erubi.rb#3 module Erubi class << self diff --git a/sorbet/rbi/gems/io-console@0.7.2.rbi b/sorbet/rbi/gems/io-console@0.7.2.rbi index ffc1f7a..73616ab 100644 --- a/sorbet/rbi/gems/io-console@0.7.2.rbi +++ b/sorbet/rbi/gems/io-console@0.7.2.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `io-console` gem. # Please instead update this file by running `bin/tapioca gem io-console`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/json@2.7.2.rbi b/sorbet/rbi/gems/json@2.7.2.rbi index 3ef0f88..1558aa4 100644 --- a/sorbet/rbi/gems/json@2.7.2.rbi +++ b/sorbet/rbi/gems/json@2.7.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `json` gem. # Please instead update this file by running `bin/tapioca gem json`. + # Extends any Class to include _json_creatable?_ method. # # source://json//lib/json/common.rb#690 diff --git a/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi b/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi index f6b1d8e..a0375c0 100644 --- a/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi +++ b/sorbet/rbi/gems/language_server-protocol@3.17.0.3.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `language_server-protocol` gem. # Please instead update this file by running `bin/tapioca gem language_server-protocol`. + # source://language_server-protocol//lib/language_server/protocol/version.rb#1 module LanguageServer; end diff --git a/sorbet/rbi/gems/lint_roller@1.1.0.rbi b/sorbet/rbi/gems/lint_roller@1.1.0.rbi index 5362605..0e21c6f 100644 --- a/sorbet/rbi/gems/lint_roller@1.1.0.rbi +++ b/sorbet/rbi/gems/lint_roller@1.1.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `lint_roller` gem. # Please instead update this file by running `bin/tapioca gem lint_roller`. + # source://lint_roller//lib/lint_roller/version.rb#1 module LintRoller; end diff --git a/sorbet/rbi/gems/minitest-focus@1.4.0.rbi b/sorbet/rbi/gems/minitest-focus@1.4.0.rbi index 19a6cde..b308b2f 100644 --- a/sorbet/rbi/gems/minitest-focus@1.4.0.rbi +++ b/sorbet/rbi/gems/minitest-focus@1.4.0.rbi @@ -4,27 +4,28 @@ # This is an autogenerated file for types exported from the `minitest-focus` gem. # Please instead update this file by running `bin/tapioca gem minitest-focus`. + # source://minitest-focus//lib/minitest/focus.rb#3 class Minitest::Test < ::Minitest::Runnable - # source://minitest/5.22.3/lib/minitest/test.rb#191 + # source://minitest/5.23.1/lib/minitest/test.rb#191 def capture_exceptions; end - # source://minitest/5.22.3/lib/minitest/test.rb#15 + # source://minitest/5.23.1/lib/minitest/test.rb#15 def class_name; end - # source://minitest/5.22.3/lib/minitest/test.rb#208 + # source://minitest/5.23.1/lib/minitest/test.rb#208 def neuter_exception(e); end - # source://minitest/5.22.3/lib/minitest/test.rb#219 + # source://minitest/5.23.1/lib/minitest/test.rb#219 def new_exception(klass, msg, bt, kill = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/test.rb#87 + # source://minitest/5.23.1/lib/minitest/test.rb#87 def run; end - # source://minitest/5.22.3/lib/minitest/test.rb#201 + # source://minitest/5.23.1/lib/minitest/test.rb#201 def sanitize_exception(e); end - # source://minitest/5.22.3/lib/minitest/test.rb#233 + # source://minitest/5.23.1/lib/minitest/test.rb#233 def with_info_handler(&block); end class << self @@ -58,22 +59,22 @@ class Minitest::Test < ::Minitest::Runnable # source://minitest-focus//lib/minitest/focus.rb#40 def focus(name = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/test.rb#35 + # source://minitest/5.23.1/lib/minitest/test.rb#35 def i_suck_and_my_tests_are_order_dependent!; end - # source://minitest/5.22.3/lib/minitest/test.rb#26 + # source://minitest/5.23.1/lib/minitest/test.rb#26 def io_lock; end - # source://minitest/5.22.3/lib/minitest/test.rb#26 + # source://minitest/5.23.1/lib/minitest/test.rb#26 def io_lock=(_arg0); end - # source://minitest/5.22.3/lib/minitest/test.rb#48 + # source://minitest/5.23.1/lib/minitest/test.rb#48 def make_my_diffs_pretty!; end - # source://minitest/5.22.3/lib/minitest/test.rb#60 + # source://minitest/5.23.1/lib/minitest/test.rb#60 def parallelize_me!; end - # source://minitest/5.22.3/lib/minitest/test.rb#70 + # source://minitest/5.23.1/lib/minitest/test.rb#70 def runnable_methods; end # Sets a one-off method_added callback to set focus on the method diff --git a/sorbet/rbi/gems/minitest-reporters@1.6.1.rbi b/sorbet/rbi/gems/minitest-reporters@1.6.1.rbi index eb78a48..aaf99c5 100644 --- a/sorbet/rbi/gems/minitest-reporters@1.6.1.rbi +++ b/sorbet/rbi/gems/minitest-reporters@1.6.1.rbi @@ -4,85 +4,86 @@ # This is an autogenerated file for types exported from the `minitest-reporters` gem. # Please instead update this file by running `bin/tapioca gem minitest-reporters`. + # source://minitest-reporters//lib/minitest/reporters.rb#3 module Minitest class << self - # source://minitest/5.22.3/lib/minitest.rb#197 + # source://minitest/5.23.1/lib/minitest.rb#197 def __run(reporter, options); end - # source://minitest/5.22.3/lib/minitest.rb#97 + # source://minitest/5.23.1/lib/minitest.rb#97 def after_run(&block); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def allow_fork; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def allow_fork=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#69 + # source://minitest/5.23.1/lib/minitest.rb#69 def autorun; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def backtrace_filter; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def backtrace_filter=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#18 + # source://minitest/5.23.1/lib/minitest.rb#18 def cattr_accessor(name); end - # source://minitest/5.22.3/lib/minitest.rb#1146 + # source://minitest/5.23.1/lib/minitest.rb#1178 def clock_time; end - # source://minitest/5.22.3/lib/minitest.rb#177 + # source://minitest/5.23.1/lib/minitest.rb#177 def empty_run!(options); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def extensions; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def extensions=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#292 + # source://minitest/5.23.1/lib/minitest.rb#306 def filter_backtrace(bt); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def info_signal; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def info_signal=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#101 + # source://minitest/5.23.1/lib/minitest.rb#101 def init_plugins(options); end - # source://minitest/5.22.3/lib/minitest.rb#108 + # source://minitest/5.23.1/lib/minitest.rb#108 def load_plugins; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def parallel_executor; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def parallel_executor=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#210 + # source://minitest/5.23.1/lib/minitest.rb#210 def process_args(args = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def reporter; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def reporter=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#143 + # source://minitest/5.23.1/lib/minitest.rb#143 def run(args = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest.rb#1137 + # source://minitest/5.23.1/lib/minitest.rb#1169 def run_one_method(klass, method_name); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def seed; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def seed=(_arg0); end end end diff --git a/sorbet/rbi/gems/minitest@5.22.3.rbi b/sorbet/rbi/gems/minitest@5.23.1.rbi similarity index 90% rename from sorbet/rbi/gems/minitest@5.22.3.rbi rename to sorbet/rbi/gems/minitest@5.23.1.rbi index 4f9fc1a..480a14a 100644 --- a/sorbet/rbi/gems/minitest@5.22.3.rbi +++ b/sorbet/rbi/gems/minitest@5.23.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `minitest` gem. # Please instead update this file by running `bin/tapioca gem minitest`. + # Kernel extensions for minitest # # source://minitest//lib/minitest/spec.rb#46 @@ -87,7 +88,7 @@ module Minitest # source://minitest//lib/minitest.rb#18 def cattr_accessor(name); end - # source://minitest//lib/minitest.rb#1146 + # source://minitest//lib/minitest.rb#1178 def clock_time; end # source://minitest//lib/minitest.rb#177 @@ -99,7 +100,7 @@ module Minitest # source://minitest//lib/minitest.rb#19 def extensions=(_arg0); end - # source://minitest//lib/minitest.rb#292 + # source://minitest//lib/minitest.rb#306 def filter_backtrace(bt); end # source://minitest//lib/minitest.rb#19 @@ -148,7 +149,7 @@ module Minitest # source://minitest//lib/minitest.rb#143 def run(args = T.unsafe(nil)); end - # source://minitest//lib/minitest.rb#1137 + # source://minitest//lib/minitest.rb#1169 def run_one_method(klass, method_name); end # source://minitest//lib/minitest.rb#19 @@ -162,24 +163,24 @@ end # Defines the API for Reporters. Subclass this and override whatever # you want. Go nuts. # -# source://minitest//lib/minitest.rb#638 +# source://minitest//lib/minitest.rb#652 class Minitest::AbstractReporter # @return [AbstractReporter] a new instance of AbstractReporter # - # source://minitest//lib/minitest.rb#640 + # source://minitest//lib/minitest.rb#654 def initialize; end # Did this run pass? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#675 + # source://minitest//lib/minitest.rb#689 def passed?; end # About to start running a test. This allows a reporter to show # that it is starting or that we are in the middle of a test run. # - # source://minitest//lib/minitest.rb#654 + # source://minitest//lib/minitest.rb#668 def prerecord(klass, name); end # Output and record the result of the test. Call @@ -187,43 +188,43 @@ class Minitest::AbstractReporter # result character string. Stores the result of the run if the run # did not pass. # - # source://minitest//lib/minitest.rb#663 + # source://minitest//lib/minitest.rb#677 def record(result); end # Outputs the summary of the run. # - # source://minitest//lib/minitest.rb#669 + # source://minitest//lib/minitest.rb#683 def report; end # Starts reporting on the run. # - # source://minitest//lib/minitest.rb#647 + # source://minitest//lib/minitest.rb#661 def start; end - # source://minitest//lib/minitest.rb#679 + # source://minitest//lib/minitest.rb#693 def synchronize(&block); end end # Represents run failures. # -# source://minitest//lib/minitest.rb#962 +# source://minitest//lib/minitest.rb#985 class Minitest::Assertion < ::Exception - # source://minitest//lib/minitest.rb#965 + # source://minitest//lib/minitest.rb#988 def error; end # Where was this run before an assertion was raised? # - # source://minitest//lib/minitest.rb#972 + # source://minitest//lib/minitest.rb#995 def location; end - # source://minitest//lib/minitest.rb#980 + # source://minitest//lib/minitest.rb#1003 def result_code; end - # source://minitest//lib/minitest.rb#984 + # source://minitest//lib/minitest.rb#1007 def result_label; end end -# source://minitest//lib/minitest.rb#963 +# source://minitest//lib/minitest.rb#986 Minitest::Assertion::RE = T.let(T.unsafe(nil), Regexp) # Minitest Assertions. All assertion methods accept a +msg+ which is @@ -699,77 +700,77 @@ Minitest::Assertions::UNDEFINED = T.let(T.unsafe(nil), Object) # # See Minitest.backtrace_filter=. # -# source://minitest//lib/minitest.rb#1108 +# source://minitest//lib/minitest.rb#1140 class Minitest::BacktraceFilter # @return [BacktraceFilter] a new instance of BacktraceFilter # - # source://minitest//lib/minitest.rb#1114 + # source://minitest//lib/minitest.rb#1146 def initialize(regexp = T.unsafe(nil)); end # Filter +bt+ to something useful. Returns the whole thing if # $DEBUG (ruby) or $MT_DEBUG (env). # - # source://minitest//lib/minitest.rb#1122 + # source://minitest//lib/minitest.rb#1154 def filter(bt); end # Returns the value of attribute regexp. # - # source://minitest//lib/minitest.rb#1112 + # source://minitest//lib/minitest.rb#1144 def regexp; end # Sets the attribute regexp # # @param value the value to set the attribute regexp to. # - # source://minitest//lib/minitest.rb#1112 + # source://minitest//lib/minitest.rb#1144 def regexp=(_arg0); end end -# source://minitest//lib/minitest.rb#1110 +# source://minitest//lib/minitest.rb#1142 Minitest::BacktraceFilter::MT_RE = T.let(T.unsafe(nil), Regexp) # Dispatch to multiple reporters as one. # -# source://minitest//lib/minitest.rb#911 +# source://minitest//lib/minitest.rb#934 class Minitest::CompositeReporter < ::Minitest::AbstractReporter # @return [CompositeReporter] a new instance of CompositeReporter # - # source://minitest//lib/minitest.rb#917 + # source://minitest//lib/minitest.rb#940 def initialize(*reporters); end # Add another reporter to the mix. # - # source://minitest//lib/minitest.rb#929 + # source://minitest//lib/minitest.rb#952 def <<(reporter); end - # source://minitest//lib/minitest.rb#922 + # source://minitest//lib/minitest.rb#945 def io; end # @return [Boolean] # - # source://minitest//lib/minitest.rb#933 + # source://minitest//lib/minitest.rb#956 def passed?; end - # source://minitest//lib/minitest.rb#941 + # source://minitest//lib/minitest.rb#964 def prerecord(klass, name); end - # source://minitest//lib/minitest.rb#948 + # source://minitest//lib/minitest.rb#971 def record(result); end - # source://minitest//lib/minitest.rb#954 + # source://minitest//lib/minitest.rb#977 def report; end # The list of reporters to dispatch to. # - # source://minitest//lib/minitest.rb#915 + # source://minitest//lib/minitest.rb#938 def reporters; end # The list of reporters to dispatch to. # - # source://minitest//lib/minitest.rb#915 + # source://minitest//lib/minitest.rb#938 def reporters=(_arg0); end - # source://minitest//lib/minitest.rb#937 + # source://minitest//lib/minitest.rb#960 def start; end end @@ -1040,48 +1041,48 @@ end # # ... lots of test methods ... # end # -# source://minitest//lib/minitest.rb#1052 +# source://minitest//lib/minitest.rb#1084 module Minitest::Guard # Is this running on jruby? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1057 + # source://minitest//lib/minitest.rb#1089 def jruby?(platform = T.unsafe(nil)); end # Is this running on maglev? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1064 + # source://minitest//lib/minitest.rb#1096 def maglev?(platform = T.unsafe(nil)); end # Is this running on mri? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1074 + # source://minitest//lib/minitest.rb#1106 def mri?(platform = T.unsafe(nil)); end # Is this running on macOS? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1081 + # source://minitest//lib/minitest.rb#1113 def osx?(platform = T.unsafe(nil)); end # Is this running on rubinius? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1088 + # source://minitest//lib/minitest.rb#1120 def rubinius?(platform = T.unsafe(nil)); end # Is this running on windows? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1098 + # source://minitest//lib/minitest.rb#1130 def windows?(platform = T.unsafe(nil)); end end @@ -1244,36 +1245,36 @@ end # plugin, pull this out of the composite and replace it with your # own. # -# source://minitest//lib/minitest.rb#710 +# source://minitest//lib/minitest.rb#724 class Minitest::ProgressReporter < ::Minitest::Reporter - # source://minitest//lib/minitest.rb#711 + # source://minitest//lib/minitest.rb#725 def prerecord(klass, name); end - # source://minitest//lib/minitest.rb#718 + # source://minitest//lib/minitest.rb#732 def record(result); end end # Shared code for anything that can get passed to a Reporter. See # Minitest::Test & Minitest::Result. # -# source://minitest//lib/minitest.rb#532 +# source://minitest//lib/minitest.rb#546 module Minitest::Reportable # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#554 + # source://minitest//lib/minitest.rb#568 def class_name; end # Did this run error? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#575 + # source://minitest//lib/minitest.rb#589 def error?; end # The location identifier of this test. Depends on a method # existing called class_name. # - # source://minitest//lib/minitest.rb#549 + # source://minitest//lib/minitest.rb#563 def location; end # Did this run pass? @@ -1283,50 +1284,50 @@ module Minitest::Reportable # # @return [Boolean] # - # source://minitest//lib/minitest.rb#539 + # source://minitest//lib/minitest.rb#553 def passed?; end # Returns ".", "F", or "E" based on the result of the run. # - # source://minitest//lib/minitest.rb#561 + # source://minitest//lib/minitest.rb#575 def result_code; end # Was this run skipped? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#568 + # source://minitest//lib/minitest.rb#582 def skipped?; end end -# source://minitest//lib/minitest.rb#543 +# source://minitest//lib/minitest.rb#557 Minitest::Reportable::BASE_DIR = T.let(T.unsafe(nil), String) -# source://minitest//lib/minitest.rb#686 +# source://minitest//lib/minitest.rb#700 class Minitest::Reporter < ::Minitest::AbstractReporter # @return [Reporter] a new instance of Reporter # - # source://minitest//lib/minitest.rb#695 + # source://minitest//lib/minitest.rb#709 def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end # The IO used to report. # - # source://minitest//lib/minitest.rb#688 + # source://minitest//lib/minitest.rb#702 def io; end # The IO used to report. # - # source://minitest//lib/minitest.rb#688 + # source://minitest//lib/minitest.rb#702 def io=(_arg0); end # Command-line options for this run. # - # source://minitest//lib/minitest.rb#693 + # source://minitest//lib/minitest.rb#707 def options; end # Command-line options for this run. # - # source://minitest//lib/minitest.rb#693 + # source://minitest//lib/minitest.rb#707 def options=(_arg0); end end @@ -1336,80 +1337,80 @@ end # blow up. By using Result.from(a_test) you can be reasonably sure # that the test result can be marshalled. # -# source://minitest//lib/minitest.rb#587 +# source://minitest//lib/minitest.rb#601 class Minitest::Result < ::Minitest::Runnable include ::Minitest::Reportable - # source://minitest//lib/minitest.rb#621 + # source://minitest//lib/minitest.rb#635 def class_name; end # The class name of the test result. # - # source://minitest//lib/minitest.rb#596 + # source://minitest//lib/minitest.rb#610 def klass; end # The class name of the test result. # - # source://minitest//lib/minitest.rb#596 + # source://minitest//lib/minitest.rb#610 def klass=(_arg0); end # The location of the test method. # - # source://minitest//lib/minitest.rb#601 + # source://minitest//lib/minitest.rb#615 def source_location; end # The location of the test method. # - # source://minitest//lib/minitest.rb#601 + # source://minitest//lib/minitest.rb#615 def source_location=(_arg0); end - # source://minitest//lib/minitest.rb#625 + # source://minitest//lib/minitest.rb#639 def to_s; end class << self # Create a new test result from a Runnable instance. # - # source://minitest//lib/minitest.rb#606 + # source://minitest//lib/minitest.rb#620 def from(runnable); end end end # re-open # -# source://minitest//lib/minitest.rb#305 +# source://minitest//lib/minitest.rb#319 class Minitest::Runnable # @return [Runnable] a new instance of Runnable # - # source://minitest//lib/minitest.rb#463 + # source://minitest//lib/minitest.rb#477 def initialize(name); end # Number of assertions executed in this run. # - # source://minitest//lib/minitest.rb#309 + # source://minitest//lib/minitest.rb#323 def assertions; end # Number of assertions executed in this run. # - # source://minitest//lib/minitest.rb#309 + # source://minitest//lib/minitest.rb#323 def assertions=(_arg0); end - # source://minitest//lib/minitest.rb#459 + # source://minitest//lib/minitest.rb#473 def failure; end # An assertion raised during the run, if any. # - # source://minitest//lib/minitest.rb#314 + # source://minitest//lib/minitest.rb#328 def failures; end # An assertion raised during the run, if any. # - # source://minitest//lib/minitest.rb#314 + # source://minitest//lib/minitest.rb#328 def failures=(_arg0); end - # source://minitest//lib/minitest.rb#445 + # source://minitest//lib/minitest.rb#459 def marshal_dump; end - # source://minitest//lib/minitest.rb#455 + # source://minitest//lib/minitest.rb#469 def marshal_load(ary); end # Metadata you attach to the test results that get sent to the reporter. @@ -1419,29 +1420,29 @@ class Minitest::Runnable # NOTE: this data *must* be plain (read: marshal-able) data! # Hashes! Arrays! Strings! # - # source://minitest//lib/minitest.rb#478 + # source://minitest//lib/minitest.rb#492 def metadata; end # Sets metadata, mainly used for +Result.from+. # - # source://minitest//lib/minitest.rb#485 + # source://minitest//lib/minitest.rb#499 def metadata=(_arg0); end # Returns true if metadata exists. # # @return [Boolean] # - # source://minitest//lib/minitest.rb#490 + # source://minitest//lib/minitest.rb#504 def metadata?; end # Name of the run. # - # source://minitest//lib/minitest.rb#332 + # source://minitest//lib/minitest.rb#346 def name; end # Set the name of the run. # - # source://minitest//lib/minitest.rb#339 + # source://minitest//lib/minitest.rb#353 def name=(o); end # Did this run pass? @@ -1452,7 +1453,7 @@ class Minitest::Runnable # @raise [NotImplementedError] # @return [Boolean] # - # source://minitest//lib/minitest.rb#507 + # source://minitest//lib/minitest.rb#521 def passed?; end # Returns a single character string to print based on the result @@ -1461,14 +1462,14 @@ class Minitest::Runnable # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#516 + # source://minitest//lib/minitest.rb#530 def result_code; end # Runs a single method. Needs to return self. # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#497 + # source://minitest//lib/minitest.rb#511 def run; end # Was this run skipped? See #passed? for more information. @@ -1476,42 +1477,42 @@ class Minitest::Runnable # @raise [NotImplementedError] # @return [Boolean] # - # source://minitest//lib/minitest.rb#523 + # source://minitest//lib/minitest.rb#537 def skipped?; end # The time it took to run. # - # source://minitest//lib/minitest.rb#319 + # source://minitest//lib/minitest.rb#333 def time; end # The time it took to run. # - # source://minitest//lib/minitest.rb#319 + # source://minitest//lib/minitest.rb#333 def time=(_arg0); end - # source://minitest//lib/minitest.rb#321 + # source://minitest//lib/minitest.rb#335 def time_it; end class << self - # source://minitest//lib/minitest.rb#1156 + # source://minitest//lib/minitest.rb#1188 def inherited(klass); end # Returns all instance methods matching the pattern +re+. # - # source://minitest//lib/minitest.rb#346 + # source://minitest//lib/minitest.rb#360 def methods_matching(re); end - # source://minitest//lib/minitest.rb#415 + # source://minitest//lib/minitest.rb#429 def on_signal(name, action); end - # source://minitest//lib/minitest.rb#350 + # source://minitest//lib/minitest.rb#364 def reset; end # Responsible for running all runnable methods in a given class, # each in its own instance. Each instance is passed to the # reporter to record. # - # source://minitest//lib/minitest.rb#361 + # source://minitest//lib/minitest.rb#375 def run(reporter, options = T.unsafe(nil)); end # Runs a single method and has the reporter record the result. @@ -1519,7 +1520,7 @@ class Minitest::Runnable # that subclasses can specialize the running of an individual # test. See Minitest::ParallelTest::ClassMethods for an example. # - # source://minitest//lib/minitest.rb#387 + # source://minitest//lib/minitest.rb#401 def run_one_method(klass, method_name, reporter); end # Each subclass of Runnable is responsible for overriding this @@ -1527,33 +1528,33 @@ class Minitest::Runnable # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#432 + # source://minitest//lib/minitest.rb#446 def runnable_methods; end # Returns all subclasses of Runnable. # - # source://minitest//lib/minitest.rb#439 + # source://minitest//lib/minitest.rb#453 def runnables; end # Defines the order to run tests (:random by default). Override # this or use a convenience method to change it for your tests. # - # source://minitest//lib/minitest.rb#396 + # source://minitest//lib/minitest.rb#410 def test_order; end - # source://minitest//lib/minitest.rb#400 + # source://minitest//lib/minitest.rb#414 def with_info_handler(reporter, &block); end end end -# source://minitest//lib/minitest.rb#413 +# source://minitest//lib/minitest.rb#427 Minitest::Runnable::SIGNALS = T.let(T.unsafe(nil), Hash) # Assertion raised when skipping a run. # -# source://minitest//lib/minitest.rb#992 +# source://minitest//lib/minitest.rb#1015 class Minitest::Skip < ::Minitest::Assertion - # source://minitest//lib/minitest.rb#993 + # source://minitest//lib/minitest.rb#1016 def result_label; end end @@ -1810,114 +1811,124 @@ Minitest::Spec::TYPES = T.let(T.unsafe(nil), Array) # end # end # -# source://minitest//lib/minitest.rb#746 +# source://minitest//lib/minitest.rb#760 class Minitest::StatisticsReporter < ::Minitest::Reporter # @return [StatisticsReporter] a new instance of StatisticsReporter # - # source://minitest//lib/minitest.rb#790 + # source://minitest//lib/minitest.rb#809 def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end # Total number of assertions. # - # source://minitest//lib/minitest.rb#750 + # source://minitest//lib/minitest.rb#764 def assertions; end # Total number of assertions. # - # source://minitest//lib/minitest.rb#750 + # source://minitest//lib/minitest.rb#764 def assertions=(_arg0); end # Total number of test cases. # - # source://minitest//lib/minitest.rb#755 + # source://minitest//lib/minitest.rb#769 def count; end # Total number of test cases. # - # source://minitest//lib/minitest.rb#755 + # source://minitest//lib/minitest.rb#769 def count=(_arg0); end # Total number of tests that erred. # - # source://minitest//lib/minitest.rb#783 + # source://minitest//lib/minitest.rb#797 def errors; end # Total number of tests that erred. # - # source://minitest//lib/minitest.rb#783 + # source://minitest//lib/minitest.rb#797 def errors=(_arg0); end # Total number of tests that failed. # - # source://minitest//lib/minitest.rb#778 + # source://minitest//lib/minitest.rb#792 def failures; end # Total number of tests that failed. # - # source://minitest//lib/minitest.rb#778 + # source://minitest//lib/minitest.rb#792 def failures=(_arg0); end # @return [Boolean] # - # source://minitest//lib/minitest.rb#803 + # source://minitest//lib/minitest.rb#823 def passed?; end - # source://minitest//lib/minitest.rb#811 + # source://minitest//lib/minitest.rb#831 def record(result); end # Report on the tracked statistics. # - # source://minitest//lib/minitest.rb#821 + # source://minitest//lib/minitest.rb#841 def report; end # An +Array+ of test cases that failed or were skipped. # - # source://minitest//lib/minitest.rb#760 + # source://minitest//lib/minitest.rb#774 def results; end # An +Array+ of test cases that failed or were skipped. # - # source://minitest//lib/minitest.rb#760 + # source://minitest//lib/minitest.rb#774 def results=(_arg0); end # Total number of tests that where skipped. # - # source://minitest//lib/minitest.rb#788 + # source://minitest//lib/minitest.rb#807 def skips; end # Total number of tests that where skipped. # - # source://minitest//lib/minitest.rb#788 + # source://minitest//lib/minitest.rb#807 def skips=(_arg0); end - # source://minitest//lib/minitest.rb#807 + # source://minitest//lib/minitest.rb#827 def start; end # Time the test run started. If available, the monotonic clock is # used and this is a +Float+, otherwise it's an instance of # +Time+. # - # source://minitest//lib/minitest.rb#767 + # source://minitest//lib/minitest.rb#781 def start_time; end # Time the test run started. If available, the monotonic clock is # used and this is a +Float+, otherwise it's an instance of # +Time+. # - # source://minitest//lib/minitest.rb#767 + # source://minitest//lib/minitest.rb#781 def start_time=(_arg0); end # Test run time. If available, the monotonic clock is used and # this is a +Float+, otherwise it's an instance of +Time+. # - # source://minitest//lib/minitest.rb#773 + # source://minitest//lib/minitest.rb#787 def total_time; end # Test run time. If available, the monotonic clock is used and # this is a +Float+, otherwise it's an instance of +Time+. # - # source://minitest//lib/minitest.rb#773 + # source://minitest//lib/minitest.rb#787 def total_time=(_arg0); end + + # Total number of tests that warned. + # + # source://minitest//lib/minitest.rb#802 + def warnings; end + + # Total number of tests that warned. + # + # source://minitest//lib/minitest.rb#802 + def warnings=(_arg0); end end # A reporter that prints the header, summary, and failure details at @@ -1928,48 +1939,48 @@ end # plugin, pull this out of the composite and replace it with your # own. # -# source://minitest//lib/minitest.rb#841 +# source://minitest//lib/minitest.rb#862 class Minitest::SummaryReporter < ::Minitest::StatisticsReporter - # source://minitest//lib/minitest.rb#876 + # source://minitest//lib/minitest.rb#897 def aggregated_results(io); end # Returns the value of attribute old_sync. # - # source://minitest//lib/minitest.rb#844 + # source://minitest//lib/minitest.rb#865 def old_sync; end # Sets the attribute old_sync # # @param value the value to set the attribute old_sync to. # - # source://minitest//lib/minitest.rb#844 + # source://minitest//lib/minitest.rb#865 def old_sync=(_arg0); end - # source://minitest//lib/minitest.rb#859 + # source://minitest//lib/minitest.rb#880 def report; end # :startdoc: # - # source://minitest//lib/minitest.rb#847 + # source://minitest//lib/minitest.rb#868 def start; end - # source://minitest//lib/minitest.rb#871 + # source://minitest//lib/minitest.rb#892 def statistics; end - # source://minitest//lib/minitest.rb#896 + # source://minitest//lib/minitest.rb#917 def summary; end # :stopdoc: # - # source://minitest//lib/minitest.rb#843 + # source://minitest//lib/minitest.rb#864 def sync; end # :stopdoc: # - # source://minitest//lib/minitest.rb#843 + # source://minitest//lib/minitest.rb#864 def sync=(_arg0); end - # source://minitest//lib/minitest.rb#892 + # source://minitest//lib/minitest.rb#913 def to_s; end end @@ -2160,38 +2171,46 @@ Minitest::Test::TEARDOWN_METHODS = T.let(T.unsafe(nil), Array) # Assertion wrapping an unexpected error that was raised during a run. # -# source://minitest//lib/minitest.rb#1001 +# source://minitest//lib/minitest.rb#1024 class Minitest::UnexpectedError < ::Minitest::Assertion include ::Minitest::Compress # @return [UnexpectedError] a new instance of UnexpectedError # - # source://minitest//lib/minitest.rb#1007 + # source://minitest//lib/minitest.rb#1030 def initialize(error); end - # source://minitest//lib/minitest.rb#1020 + # source://minitest//lib/minitest.rb#1043 def backtrace; end # TODO: figure out how to use `cause` instead # - # source://minitest//lib/minitest.rb#1005 + # source://minitest//lib/minitest.rb#1028 def error; end # TODO: figure out how to use `cause` instead # - # source://minitest//lib/minitest.rb#1005 + # source://minitest//lib/minitest.rb#1028 def error=(_arg0); end - # source://minitest//lib/minitest.rb#1026 + # source://minitest//lib/minitest.rb#1049 def message; end - # source://minitest//lib/minitest.rb#1032 + # source://minitest//lib/minitest.rb#1055 def result_label; end end -# source://minitest//lib/minitest.rb#1024 +# source://minitest//lib/minitest.rb#1047 Minitest::UnexpectedError::BASE_RE = T.let(T.unsafe(nil), Regexp) +# Assertion raised on warning when running in -Werror mode. +# +# source://minitest//lib/minitest.rb#1063 +class Minitest::UnexpectedWarning < ::Minitest::Assertion + # source://minitest//lib/minitest.rb#1064 + def result_label; end +end + # source://minitest//lib/minitest.rb#12 Minitest::VERSION = T.let(T.unsafe(nil), String) diff --git a/sorbet/rbi/gems/netrc@0.11.0.rbi b/sorbet/rbi/gems/netrc@0.11.0.rbi index 062a557..4ae989b 100644 --- a/sorbet/rbi/gems/netrc@0.11.0.rbi +++ b/sorbet/rbi/gems/netrc@0.11.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `netrc` gem. # Please instead update this file by running `bin/tapioca gem netrc`. + # source://netrc//lib/netrc.rb#3 class Netrc # @return [Netrc] a new instance of Netrc diff --git a/sorbet/rbi/gems/parallel@1.24.0.rbi b/sorbet/rbi/gems/parallel@1.24.0.rbi index 5dd7375..ebdb060 100644 --- a/sorbet/rbi/gems/parallel@1.24.0.rbi +++ b/sorbet/rbi/gems/parallel@1.24.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `parallel` gem. # Please instead update this file by running `bin/tapioca gem parallel`. + # source://parallel//lib/parallel/version.rb#2 module Parallel class << self diff --git a/sorbet/rbi/gems/parser@3.3.0.5.rbi b/sorbet/rbi/gems/parser@3.3.1.0.rbi similarity index 93% rename from sorbet/rbi/gems/parser@3.3.0.5.rbi rename to sorbet/rbi/gems/parser@3.3.1.0.rbi index 0acdc76..e5a2bb4 100644 --- a/sorbet/rbi/gems/parser@3.3.0.5.rbi +++ b/sorbet/rbi/gems/parser@3.3.1.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `parser` gem. # Please instead update this file by running `bin/tapioca gem parser`. + # @api public # # source://parser//lib/parser.rb#19 @@ -52,603 +53,605 @@ end # @api public # # source://parser//lib/parser/ast/processor.rb#9 -class Parser::AST::Processor < ::AST::Processor +class Parser::AST::Processor + include ::AST::Processor::Mixin + # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_alias(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_and(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_and_asgn(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_arg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_arg_expr(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_args(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#103 + # source://parser//lib/parser/ast/processor.rb#105 def on_argument(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_array(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_array_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_array_pattern_with_tail(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_back_ref(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_begin(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_block(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_block_pass(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_blockarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_blockarg_expr(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_break(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_case(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_case_match(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#87 + # source://parser//lib/parser/ast/processor.rb#89 def on_casgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_class(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#79 + # source://parser//lib/parser/ast/processor.rb#81 def on_const(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_const_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#179 + # source://parser//lib/parser/ast/processor.rb#181 def on_csend(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_cvar(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#56 + # source://parser//lib/parser/ast/processor.rb#58 def on_cvasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#158 + # source://parser//lib/parser/ast/processor.rb#160 def on_def(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_defined?(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#167 + # source://parser//lib/parser/ast/processor.rb#169 def on_defs(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_dstr(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_dsym(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_eflipflop(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#286 + # source://parser//lib/parser/ast/processor.rb#288 def on_empty_else(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_ensure(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_erange(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_find_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_for(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_forward_arg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_forwarded_kwrestarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_forwarded_restarg(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_gvar(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#56 + # source://parser//lib/parser/ast/processor.rb#58 def on_gvasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_hash(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_hash_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_if(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_if_guard(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_iflipflop(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_in_match(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_in_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_index(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_indexasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_irange(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_ivar(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#56 + # source://parser//lib/parser/ast/processor.rb#58 def on_ivasgn(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_kwarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_kwargs(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_kwbegin(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_kwoptarg(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_kwrestarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_kwsplat(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_lambda(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_lvar(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#56 + # source://parser//lib/parser/ast/processor.rb#58 def on_lvasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_masgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_alt(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_as(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_current_line(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_pattern(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_pattern_p(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_rest(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_match_var(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_match_with_lvasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_mlhs(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_module(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_next(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_not(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#32 + # source://parser//lib/parser/ast/processor.rb#34 def on_nth_ref(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#196 + # source://parser//lib/parser/ast/processor.rb#198 def on_numblock(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#68 + # source://parser//lib/parser/ast/processor.rb#70 def on_op_asgn(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_optarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_or(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_or_asgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_pair(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_pin(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_postexe(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_preexe(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#130 + # source://parser//lib/parser/ast/processor.rb#132 def on_procarg0(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_redo(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_regexp(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_resbody(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_rescue(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_restarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_restarg_expr(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_retry(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_return(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_sclass(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#179 + # source://parser//lib/parser/ast/processor.rb#181 def on_send(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#116 + # source://parser//lib/parser/ast/processor.rb#118 def on_shadowarg(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_splat(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_super(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_undef(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_unless_guard(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_until(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_until_post(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#27 + # source://parser//lib/parser/ast/processor.rb#29 def on_var(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#43 + # source://parser//lib/parser/ast/processor.rb#45 def on_vasgn(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_when(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_while(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_while_post(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_xstr(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def on_yield(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#279 + # source://parser//lib/parser/ast/processor.rb#281 def process_argument_node(node); end # @api public # - # source://parser//lib/parser/ast/processor.rb#10 + # source://parser//lib/parser/ast/processor.rb#12 def process_regular_node(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#271 + # source://parser//lib/parser/ast/processor.rb#273 def process_var_asgn_node(node); end # @api public # @private # - # source://parser//lib/parser/ast/processor.rb#263 + # source://parser//lib/parser/ast/processor.rb#265 def process_variable_node(node); end end @@ -861,7 +864,7 @@ end # @api public # -# source://parser//lib/parser.rb#77 +# source://parser//lib/parser.rb#78 module Parser::Builders; end # source://parser//lib/parser/builders/default.rb#8 @@ -3329,7 +3332,7 @@ class Parser::Source::Buffer # @api public # @return [Buffer] a new instance of Buffer # - # source://parser//lib/parser/source/buffer.rb#105 + # source://parser//lib/parser/source/buffer.rb#110 def initialize(name, first_line = T.unsafe(nil), source: T.unsafe(nil)); end # Convert a character index into the source to a column number. @@ -3338,7 +3341,7 @@ class Parser::Source::Buffer # @param position [Integer] # @return [Integer] column # - # source://parser//lib/parser/source/buffer.rb#242 + # source://parser//lib/parser/source/buffer.rb#247 def column_for_position(position); end # Convert a character index into the source to a `[line, column]` tuple. @@ -3347,7 +3350,7 @@ class Parser::Source::Buffer # @param position [Integer] # @return [[Integer, Integer]] `[line, column]` # - # source://parser//lib/parser/source/buffer.rb#217 + # source://parser//lib/parser/source/buffer.rb#222 def decompose_position(position); end # First line of the buffer, 1 by default. @@ -3360,12 +3363,12 @@ class Parser::Source::Buffer # @api public # - # source://parser//lib/parser/source/buffer.rb#312 + # source://parser//lib/parser/source/buffer.rb#317 def freeze; end # @api public # - # source://parser//lib/parser/source/buffer.rb#318 + # source://parser//lib/parser/source/buffer.rb#323 def inspect; end # Number of last line in the buffer @@ -3373,7 +3376,7 @@ class Parser::Source::Buffer # @api public # @return [Integer] # - # source://parser//lib/parser/source/buffer.rb#307 + # source://parser//lib/parser/source/buffer.rb#312 def last_line; end # Convert a character index into the source to a line number. @@ -3382,7 +3385,7 @@ class Parser::Source::Buffer # @param position [Integer] # @return [Integer] line # - # source://parser//lib/parser/source/buffer.rb#231 + # source://parser//lib/parser/source/buffer.rb#236 def line_for_position(position); end # Extract line `lineno` as a new `Range`, taking `first_line` into account. @@ -3392,7 +3395,7 @@ class Parser::Source::Buffer # @raise [IndexError] if `lineno` is out of bounds # @return [Range] # - # source://parser//lib/parser/source/buffer.rb#284 + # source://parser//lib/parser/source/buffer.rb#289 def line_range(lineno); end # Buffer name. If the buffer was created from a file, the name corresponds @@ -3411,7 +3414,7 @@ class Parser::Source::Buffer # @raise [ArgumentError] if already populated # @return [String] # - # source://parser//lib/parser/source/buffer.rb#180 + # source://parser//lib/parser/source/buffer.rb#185 def raw_source=(input); end # Populate this buffer from correspondingly named file. @@ -3422,12 +3425,12 @@ class Parser::Source::Buffer # @raise [ArgumentError] if already populated # @return [Buffer] self # - # source://parser//lib/parser/source/buffer.rb#131 + # source://parser//lib/parser/source/buffer.rb#136 def read; end # @api public # - # source://parser//lib/parser/source/buffer.rb#194 + # source://parser//lib/parser/source/buffer.rb#199 def slice(start, length = T.unsafe(nil)); end # Source code contained in this buffer. @@ -3436,7 +3439,7 @@ class Parser::Source::Buffer # @raise [RuntimeError] if buffer is not populated yet # @return [String] source code # - # source://parser//lib/parser/source/buffer.rb#145 + # source://parser//lib/parser/source/buffer.rb#150 def source; end # Populate this buffer from a string with encoding autodetection. @@ -3448,7 +3451,7 @@ class Parser::Source::Buffer # @raise [EncodingError] if `input` includes invalid byte sequence for the encoding # @return [String] # - # source://parser//lib/parser/source/buffer.rb#162 + # source://parser//lib/parser/source/buffer.rb#167 def source=(input); end # Extract line `lineno` from source, taking `first_line` into account. @@ -3458,7 +3461,7 @@ class Parser::Source::Buffer # @raise [IndexError] if `lineno` is out of bounds # @return [String] # - # source://parser//lib/parser/source/buffer.rb#273 + # source://parser//lib/parser/source/buffer.rb#278 def source_line(lineno); end # Return an `Array` of source code lines. @@ -3466,30 +3469,30 @@ class Parser::Source::Buffer # @api public # @return [Array] # - # source://parser//lib/parser/source/buffer.rb#252 + # source://parser//lib/parser/source/buffer.rb#257 def source_lines; end # @api public # @return [Range] A range covering the whole source # - # source://parser//lib/parser/source/buffer.rb#298 + # source://parser//lib/parser/source/buffer.rb#303 def source_range; end private # @api public # - # source://parser//lib/parser/source/buffer.rb#348 + # source://parser//lib/parser/source/buffer.rb#353 def bsearch(line_begins, position); end # @api public # - # source://parser//lib/parser/source/buffer.rb#325 + # source://parser//lib/parser/source/buffer.rb#330 def line_begins; end # @api public # - # source://parser//lib/parser/source/buffer.rb#339 + # source://parser//lib/parser/source/buffer.rb#344 def line_index_for_position(position); end class << self @@ -3498,9 +3501,10 @@ class Parser::Source::Buffer # # @api public # @param string [String] + # @raise [Parser::UnknownEncodingInMagicComment] if the encoding is not recognized # @return [String, nil] encoding name, if recognized # - # source://parser//lib/parser/source/buffer.rb#51 + # source://parser//lib/parser/source/buffer.rb#52 def recognize_encoding(string); end # Recognize encoding of `input` and process it so it could be lexed. @@ -3518,7 +3522,7 @@ class Parser::Source::Buffer # @raise [EncodingError] # @return [String] # - # source://parser//lib/parser/source/buffer.rb#90 + # source://parser//lib/parser/source/buffer.rb#95 def reencode_string(input); end end end @@ -5124,80 +5128,80 @@ end # source://parser//lib/parser/source/tree_rewriter.rb#391 Parser::Source::TreeRewriter::ACTIONS = T.let(T.unsafe(nil), Array) -# source://parser//lib/parser/source/tree_rewriter/action.rb#13 +# source://parser//lib/parser/source/tree_rewriter/action.rb#14 class Parser::Source::TreeRewriter::Action - # source://parser//lib/parser/source/tree_rewriter/action.rb#16 + # source://parser//lib/parser/source/tree_rewriter/action.rb#17 def initialize(range, enforcer, insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil), children: T.unsafe(nil)); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#28 + # source://parser//lib/parser/source/tree_rewriter/action.rb#29 def combine(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#67 + # source://parser//lib/parser/source/tree_rewriter/action.rb#68 def contract; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#33 + # source://parser//lib/parser/source/tree_rewriter/action.rb#34 def empty?; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#14 + # source://parser//lib/parser/source/tree_rewriter/action.rb#15 def insert_after; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#14 + # source://parser//lib/parser/source/tree_rewriter/action.rb#15 def insert_before; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#57 + # source://parser//lib/parser/source/tree_rewriter/action.rb#58 def insertion?; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#80 + # source://parser//lib/parser/source/tree_rewriter/action.rb#81 def moved(source_buffer, offset); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#49 + # source://parser//lib/parser/source/tree_rewriter/action.rb#50 def nested_actions; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#40 + # source://parser//lib/parser/source/tree_rewriter/action.rb#41 def ordered_replacements; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#14 + # source://parser//lib/parser/source/tree_rewriter/action.rb#15 def range; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#14 + # source://parser//lib/parser/source/tree_rewriter/action.rb#15 def replacement; end protected - # source://parser//lib/parser/source/tree_rewriter/action.rb#158 + # source://parser//lib/parser/source/tree_rewriter/action.rb#159 def analyse_hierarchy(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#145 + # source://parser//lib/parser/source/tree_rewriter/action.rb#146 def bsearch_child_index(from = T.unsafe(nil)); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#224 + # source://parser//lib/parser/source/tree_rewriter/action.rb#225 def call_enforcer_for_merge(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#204 + # source://parser//lib/parser/source/tree_rewriter/action.rb#205 def check_fusible(action, *fusible); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#94 + # source://parser//lib/parser/source/tree_rewriter/action.rb#95 def children; end - # source://parser//lib/parser/source/tree_rewriter/action.rb#129 + # source://parser//lib/parser/source/tree_rewriter/action.rb#130 def combine_children(more_children); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#102 + # source://parser//lib/parser/source/tree_rewriter/action.rb#103 def do_combine(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#135 + # source://parser//lib/parser/source/tree_rewriter/action.rb#136 def fuse_deletions(action, fusible, other_sibblings); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#215 + # source://parser//lib/parser/source/tree_rewriter/action.rb#216 def merge(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#110 + # source://parser//lib/parser/source/tree_rewriter/action.rb#111 def place_in_hierarchy(action); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#232 + # source://parser//lib/parser/source/tree_rewriter/action.rb#233 def swallow(children); end - # source://parser//lib/parser/source/tree_rewriter/action.rb#96 + # source://parser//lib/parser/source/tree_rewriter/action.rb#97 def with(range: T.unsafe(nil), enforcer: T.unsafe(nil), children: T.unsafe(nil), insert_before: T.unsafe(nil), replacement: T.unsafe(nil), insert_after: T.unsafe(nil)); end end @@ -5215,90 +5219,122 @@ Parser::Source::TreeRewriter::POLICY_TO_LEVEL = T.let(T.unsafe(nil), Hash) class Parser::StaticEnvironment # @return [StaticEnvironment] a new instance of StaticEnvironment # - # source://parser//lib/parser/static_environment.rb#11 + # source://parser//lib/parser/static_environment.rb#17 def initialize; end - # source://parser//lib/parser/static_environment.rb#40 + # source://parser//lib/parser/static_environment.rb#55 def declare(name); end - # source://parser//lib/parser/static_environment.rb#58 + # Anonymous blockarg + # + # source://parser//lib/parser/static_environment.rb#77 def declare_anonymous_blockarg; end - # source://parser//lib/parser/static_environment.rb#82 + # Anonymous kwresarg + # + # source://parser//lib/parser/static_environment.rb#113 def declare_anonymous_kwrestarg; end - # source://parser//lib/parser/static_environment.rb#70 + # Anonymous restarg + # + # source://parser//lib/parser/static_environment.rb#95 def declare_anonymous_restarg; end - # source://parser//lib/parser/static_environment.rb#50 + # Forward args + # + # source://parser//lib/parser/static_environment.rb#67 def declare_forward_args; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#46 + # source://parser//lib/parser/static_environment.rb#61 def declared?(name); end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#62 + # source://parser//lib/parser/static_environment.rb#81 def declared_anonymous_blockarg?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#86 + # source://parser//lib/parser/static_environment.rb#85 + def declared_anonymous_blockarg_in_current_scpe?; end + + # @return [Boolean] + # + # source://parser//lib/parser/static_environment.rb#117 def declared_anonymous_kwrestarg?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#74 + # source://parser//lib/parser/static_environment.rb#121 + def declared_anonymous_kwrestarg_in_current_scope?; end + + # @return [Boolean] + # + # source://parser//lib/parser/static_environment.rb#99 def declared_anonymous_restarg?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#54 + # source://parser//lib/parser/static_environment.rb#103 + def declared_anonymous_restarg_in_current_scope?; end + + # @return [Boolean] + # + # source://parser//lib/parser/static_environment.rb#71 def declared_forward_args?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#94 + # source://parser//lib/parser/static_environment.rb#129 def empty?; end - # source://parser//lib/parser/static_environment.rb#27 + # source://parser//lib/parser/static_environment.rb#33 def extend_dynamic; end - # source://parser//lib/parser/static_environment.rb#20 + # source://parser//lib/parser/static_environment.rb#26 def extend_static; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#66 + # source://parser//lib/parser/static_environment.rb#89 def parent_has_anonymous_blockarg?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#90 + # source://parser//lib/parser/static_environment.rb#125 def parent_has_anonymous_kwrestarg?; end # @return [Boolean] # - # source://parser//lib/parser/static_environment.rb#78 + # source://parser//lib/parser/static_environment.rb#107 def parent_has_anonymous_restarg?; end - # source://parser//lib/parser/static_environment.rb#15 + # source://parser//lib/parser/static_environment.rb#21 def reset; end - # source://parser//lib/parser/static_environment.rb#34 + # source://parser//lib/parser/static_environment.rb#49 def unextend; end end -# source://parser//lib/parser/static_environment.rb#7 -Parser::StaticEnvironment::ANONYMOUS_BLOCKARG = T.let(T.unsafe(nil), Symbol) +# source://parser//lib/parser/static_environment.rb#15 +Parser::StaticEnvironment::ANONYMOUS_BLOCKARG_INHERITED = T.let(T.unsafe(nil), Symbol) + +# source://parser//lib/parser/static_environment.rb#14 +Parser::StaticEnvironment::ANONYMOUS_BLOCKARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol) + +# source://parser//lib/parser/static_environment.rb#12 +Parser::StaticEnvironment::ANONYMOUS_KWRESTARG_INHERITED = T.let(T.unsafe(nil), Symbol) + +# source://parser//lib/parser/static_environment.rb#11 +Parser::StaticEnvironment::ANONYMOUS_KWRESTARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol) # source://parser//lib/parser/static_environment.rb#9 -Parser::StaticEnvironment::ANONYMOUS_KWRESTARG = T.let(T.unsafe(nil), Symbol) +Parser::StaticEnvironment::ANONYMOUS_RESTARG_INHERITED = T.let(T.unsafe(nil), Symbol) # source://parser//lib/parser/static_environment.rb#8 -Parser::StaticEnvironment::ANONYMOUS_RESTARG = T.let(T.unsafe(nil), Symbol) +Parser::StaticEnvironment::ANONYMOUS_RESTARG_IN_CURRENT_SCOPE = T.let(T.unsafe(nil), Symbol) # source://parser//lib/parser/static_environment.rb#6 Parser::StaticEnvironment::FORWARD_ARGS = T.let(T.unsafe(nil), Symbol) @@ -5438,6 +5474,17 @@ class Parser::TreeRewriter < ::Parser::AST::Processor def wrap(range, before, after); end end +# {Parser::UnknownEncodingInMagicComment} is raised when a magic encoding +# comment is encountered that the currently running Ruby version doesn't +# recognize. It inherits from {ArgumentError} since that is the exception +# Ruby itself raises when trying to execute a file with an unknown encoding. +# As such, it is also not a {Parser::SyntaxError}. +# +# @api public +# +# source://parser//lib/parser/unknown_encoding_in_magic_comment_error.rb#13 +class Parser::UnknownEncodingInMagicComment < ::ArgumentError; end + # source://parser//lib/parser/version.rb#4 Parser::VERSION = T.let(T.unsafe(nil), String) diff --git a/sorbet/rbi/gems/prism@0.24.0.rbi b/sorbet/rbi/gems/prism@0.29.0.rbi similarity index 52% rename from sorbet/rbi/gems/prism@0.24.0.rbi rename to sorbet/rbi/gems/prism@0.29.0.rbi index 07688d1..df5bddc 100644 --- a/sorbet/rbi/gems/prism@0.24.0.rbi +++ b/sorbet/rbi/gems/prism@0.29.0.rbi @@ -4,12 +4,26 @@ # This is an autogenerated file for types exported from the `prism` gem. # Please instead update this file by running `bin/tapioca gem prism`. + +# typed: strict + +# =begin +# This file is generated by the templates/template.rb script and should not be +# modified manually. See templates/rbi/prism/node.rbi.erb +# if you are looking to modify the template +# =end # =begin # This file is generated by the templates/template.rb script and should not be -# modified manually. See templates/rbi/prism.rbi.erb +# modified manually. See templates/rbi/prism/visitor.rbi.erb # if you are looking to modify the template # =end +# We keep these shims in here because our client libraries might not have parser +# in their bundle. +module Parser; end + +class Parser::Base; end + # The Prism Ruby parser. # # "Parsing Ruby is suddenly manageable!" @@ -28,7 +42,7 @@ module Prism def lex(*_arg0); end # :call-seq: - # Prism::lex_compat(source, **options) -> ParseResult + # Prism::lex_compat(source, **options) -> LexCompat::Result # # Returns a parse result whose value is an array of tokens that closely # resembles the return value of Ripper::lex. The main difference is that the @@ -36,7 +50,8 @@ module Prism # # For supported options, see Prism::parse. # - # source://prism//lib/prism.rb#46 + # source://prism//lib/prism.rb#47 + 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. @@ -49,7 +64,8 @@ module Prism # returns the same tokens. Raises SyntaxError if the syntax in source is # invalid. # - # source://prism//lib/prism.rb#56 + # source://prism//lib/prism.rb#57 + sig { params(source: String).returns(T::Array[T.untyped]) } def lex_ripper(source); end # :call-seq: @@ -57,7 +73,8 @@ module Prism # # Load the serialized AST using the source as a reference into a tree. # - # source://prism//lib/prism.rb#64 + # source://prism//lib/prism.rb#65 + sig { params(source: String, serialized: String).returns(Prism::ParseResult) } def load(source, serialized); end # Mirror the Prism.parse API by using the serialization API. @@ -66,19 +83,14 @@ module Prism # Mirror the Prism.parse_comments API by using the serialization API. def parse_comments(*_arg0); end - # :call-seq: - # Prism::parse_failure?(source, **options) -> bool - # - # Returns true if the source parses with errors. + # Mirror the Prism.parse_failure? API by using the serialization API. # # @return [Boolean] - # - # source://prism//lib/prism.rb#72 - def parse_failure?(source, **options); end + 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. + # native strings instead of Ruby strings because it allows us to use mmap + # when it is available. def parse_file(*_arg0); end # Mirror the Prism.parse_file_comments API by using the serialization @@ -86,15 +98,10 @@ module Prism # to use mmap when it is available. def parse_file_comments(*_arg0); end - # :call-seq: - # Prism::parse_file_failure?(filepath, **options) -> bool - # - # Returns true if the file at filepath parses with errors. + # Mirror the Prism.parse_file_failure? API by using the serialization API. # # @return [Boolean] - # - # source://prism//lib/prism.rb#80 - def parse_file_failure?(filepath, **options); end + def parse_file_failure?(*_arg0); end # Mirror the Prism.parse_file_success? API by using the serialization API. # @@ -107,6 +114,9 @@ module Prism # Mirror the Prism.parse_lex_file API by using the serialization API. def parse_lex_file(*_arg0); end + # Mirror the Prism.parse_stream API by using the serialization API. + def parse_stream(*_arg0); end + # Mirror the Prism.parse_success? API by using the serialization API. # # @return [Boolean] @@ -114,91 +124,163 @@ module Prism end end +# Specialized version of Prism::Source for source code that includes ASCII +# characters only. This class is used to apply performance optimizations that +# cannot be applied to sources that include multibyte characters. Sources that +# include multibyte characters are represented by the Prism::Source class. +# +# source://prism//lib/prism/parse_result.rb#126 +class Prism::ASCIISource < ::Prism::Source + # Return the column number in characters for the given byte offset. + # + # source://prism//lib/prism/parse_result.rb#133 + 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#128 + sig { params(byte_offset: Integer).returns(Integer) } + def character_offset(byte_offset); end + + # Specialized version of `code_units_column` that does not depend on + # `code_units_offset`, which is a more expensive operation. This is + # essentialy the same as `Prism::Source#column`. + # + # source://prism//lib/prism/parse_result.rb#150 + sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } + def code_units_column(byte_offset, encoding); end + + # Returns the offset from the start of the file for the given byte offset + # counting in code units for the given encoding. + # + # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the + # 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#143 + sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } + def code_units_offset(byte_offset, encoding); end +end + # Represents the use of the `alias` keyword to alias a global variable. # # alias $foo $bar # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#97 +# source://prism//lib/prism/node.rb#188 class Prism::AliasGlobalVariableNode < ::Prism::Node - # def initialize: (Node new_name, Node old_name, Location keyword_loc, Location location) -> void + # def initialize: (Prism::node new_name, Prism::node old_name, Location keyword_loc, Location location) -> void # # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#99 + # source://prism//lib/prism/node.rb#190 + sig do + params( + source: Prism::Source, + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, new_name, old_name, keyword_loc, location); 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#294 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#109 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#200 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#114 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#205 + 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#124 + # source://prism//lib/prism/node.rb#215 + 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#119 + # source://prism//lib/prism/node.rb#210 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AliasGlobalVariableNode + # def copy: (?new_name: Prism::node, ?old_name: Prism::node, ?keyword_loc: Location, ?location: Location) -> AliasGlobalVariableNode # - # source://prism//lib/prism/node.rb#129 - sig { params(params: T.untyped).returns(Prism::AliasGlobalVariableNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#220 + sig do + params( + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::AliasGlobalVariableNode) + end + def copy(new_name: T.unsafe(nil), old_name: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#114 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#205 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Node, old_name: Node, keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Prism::node, old_name: Prism::node, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#143 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#228 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#166 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#260 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#161 + # source://prism//lib/prism/node.rb#255 sig { returns(String) } def keyword; end - # attr_reader keyword_loc: Location + # The location of the `alias` keyword. + # + # alias $foo $bar + # ^^^^^ # - # source://prism//lib/prism/node.rb#154 + # source://prism//lib/prism/node.rb#248 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader new_name: Node + # Represents the new name of the global variable that can be used after aliasing. This can be either a global variable, a back reference, or a numbered reference. + # + # alias $foo $bar + # ^^^^ # - # source://prism//lib/prism/node.rb#148 + # source://prism//lib/prism/node.rb#236 sig { returns(Prism::Node) } def new_name; end - # attr_reader old_name: Node + # Represents the old name of the global variable that could be used before aliasing. This can be either a global variable, a back reference, or a numbered reference. + # + # alias $foo $bar + # ^^^^ # - # source://prism//lib/prism/node.rb#151 + # source://prism//lib/prism/node.rb#242 sig { returns(Prism::Node) } def old_name; end @@ -217,7 +299,8 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#190 + # source://prism//lib/prism/node.rb#278 + sig { override.returns(Symbol) } def type; end class << self @@ -228,7 +311,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#200 + # source://prism//lib/prism/node.rb#288 def type; end end end @@ -238,86 +321,110 @@ end # alias foo bar # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#209 +# source://prism//lib/prism/node.rb#306 class Prism::AliasMethodNode < ::Prism::Node - # def initialize: (Node new_name, Node old_name, Location keyword_loc, Location location) -> void + # def initialize: (Prism::node new_name, Prism::node old_name, Location keyword_loc, Location location) -> void # # @return [AliasMethodNode] a new instance of AliasMethodNode # - # source://prism//lib/prism/node.rb#211 + # source://prism//lib/prism/node.rb#308 + sig do + params( + source: Prism::Source, + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, new_name, old_name, keyword_loc, location); 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#403 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#221 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#318 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#226 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#323 + 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#236 + # source://prism//lib/prism/node.rb#333 + 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#231 + # source://prism//lib/prism/node.rb#328 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AliasMethodNode + # def copy: (?new_name: Prism::node, ?old_name: Prism::node, ?keyword_loc: Location, ?location: Location) -> AliasMethodNode # - # source://prism//lib/prism/node.rb#241 - sig { params(params: T.untyped).returns(Prism::AliasMethodNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#338 + sig do + params( + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::AliasMethodNode) + end + def copy(new_name: T.unsafe(nil), old_name: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#226 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#323 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Node, old_name: Node, keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Prism::node, old_name: Prism::node, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#255 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#346 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#278 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#369 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#273 + # source://prism//lib/prism/node.rb#364 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#266 + # source://prism//lib/prism/node.rb#357 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader new_name: Node + # attr_reader new_name: Prism::node # - # source://prism//lib/prism/node.rb#260 + # source://prism//lib/prism/node.rb#351 sig { returns(Prism::Node) } def new_name; end - # attr_reader old_name: Node + # attr_reader old_name: Prism::node # - # source://prism//lib/prism/node.rb#263 + # source://prism//lib/prism/node.rb#354 sig { returns(Prism::Node) } def old_name; end @@ -336,7 +443,8 @@ class Prism::AliasMethodNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#302 + # source://prism//lib/prism/node.rb#387 + sig { override.returns(Symbol) } def type; end class << self @@ -347,7 +455,7 @@ class Prism::AliasMethodNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#312 + # source://prism//lib/prism/node.rb#397 def type; end end end @@ -357,86 +465,110 @@ end # foo => bar | baz # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#321 +# source://prism//lib/prism/node.rb#415 class Prism::AlternationPatternNode < ::Prism::Node - # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void + # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void # # @return [AlternationPatternNode] a new instance of AlternationPatternNode # - # source://prism//lib/prism/node.rb#323 + # source://prism//lib/prism/node.rb#417 + sig do + params( + source: Prism::Source, + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, left, right, operator_loc, location); 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#512 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#333 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#427 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#338 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#432 + 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#348 + # source://prism//lib/prism/node.rb#442 + 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#343 + # source://prism//lib/prism/node.rb#437 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AlternationPatternNode + # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> AlternationPatternNode # - # source://prism//lib/prism/node.rb#353 - sig { params(params: T.untyped).returns(Prism::AlternationPatternNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#447 + sig do + params( + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::AlternationPatternNode) + end + def copy(left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#338 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#432 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#367 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#455 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#390 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#478 + sig { override.returns(String) } + def inspect; end - # attr_reader left: Node + # attr_reader left: Prism::node # - # source://prism//lib/prism/node.rb#372 + # source://prism//lib/prism/node.rb#460 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#385 + # source://prism//lib/prism/node.rb#473 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#378 + # source://prism//lib/prism/node.rb#466 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader right: Node + # attr_reader right: Prism::node # - # source://prism//lib/prism/node.rb#375 + # source://prism//lib/prism/node.rb#463 sig { returns(Prism::Node) } def right; end @@ -455,7 +587,8 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#414 + # source://prism//lib/prism/node.rb#496 + sig { override.returns(Symbol) } def type; end class << self @@ -466,7 +599,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#424 + # source://prism//lib/prism/node.rb#506 def type; end end end @@ -476,64 +609,88 @@ end # left and right # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#433 +# source://prism//lib/prism/node.rb#524 class Prism::AndNode < ::Prism::Node - # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void + # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void # # @return [AndNode] a new instance of AndNode # - # source://prism//lib/prism/node.rb#435 + # source://prism//lib/prism/node.rb#526 + sig do + params( + source: Prism::Source, + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, left, right, operator_loc, location); 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#636 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#445 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#536 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#450 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#541 + 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#460 + # source://prism//lib/prism/node.rb#551 + 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#455 + # source://prism//lib/prism/node.rb#546 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AndNode + # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> AndNode # - # source://prism//lib/prism/node.rb#465 - sig { params(params: T.untyped).returns(Prism::AndNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#556 + sig do + params( + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::AndNode) + end + def copy(left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#450 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#541 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#479 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#564 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#517 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#602 + sig { override.returns(String) } + def inspect; end # Represents the left side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # @@ -543,13 +700,13 @@ class Prism::AndNode < ::Prism::Node # 1 && 2 # ^ # - # source://prism//lib/prism/node.rb#490 + # source://prism//lib/prism/node.rb#575 sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#512 + # source://prism//lib/prism/node.rb#597 sig { returns(String) } def operator; end @@ -558,7 +715,7 @@ class Prism::AndNode < ::Prism::Node # left and right # ^^^ # - # source://prism//lib/prism/node.rb#505 + # source://prism//lib/prism/node.rb#590 sig { returns(Prism::Location) } def operator_loc; end @@ -570,7 +727,7 @@ class Prism::AndNode < ::Prism::Node # 1 and 2 # ^ # - # source://prism//lib/prism/node.rb#499 + # source://prism//lib/prism/node.rb#584 sig { returns(Prism::Node) } def right; end @@ -589,7 +746,8 @@ class Prism::AndNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#541 + # source://prism//lib/prism/node.rb#620 + sig { override.returns(Symbol) } def type; end class << self @@ -600,7 +758,7 @@ class Prism::AndNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#551 + # source://prism//lib/prism/node.rb#630 def type; end end end @@ -610,78 +768,108 @@ end # return foo, bar, baz # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#560 +# source://prism//lib/prism/node.rb#648 class Prism::ArgumentsNode < ::Prism::Node - # def initialize: (Integer flags, Array[Node] arguments, Location location) -> void + # def initialize: (Integer flags, Array[Prism::node] arguments, Location location) -> void # # @return [ArgumentsNode] a new instance of ArgumentsNode # - # source://prism//lib/prism/node.rb#562 + # source://prism//lib/prism/node.rb#650 + sig do + params( + source: Prism::Source, + flags: Integer, + arguments: T::Array[Prism::Node], + location: Prism::Location + ).void + end def initialize(source, flags, arguments, location); 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#743 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#571 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#659 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader arguments: Array[Node] + # attr_reader arguments: Array[Prism::node] # - # source://prism//lib/prism/node.rb#613 + # source://prism//lib/prism/node.rb#696 sig { returns(T::Array[Prism::Node]) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#576 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#664 + 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#586 + # source://prism//lib/prism/node.rb#674 + 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#581 + # source://prism//lib/prism/node.rb#669 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def contains_keyword_splat?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#617 + # source://prism//lib/prism/node.rb#704 sig { returns(T::Boolean) } def contains_keyword_splat?; end - # def copy: (**params) -> ArgumentsNode + # def contains_keywords?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#699 + sig { returns(T::Boolean) } + def contains_keywords?; end + + # def copy: (?flags: Integer, ?arguments: Array[Prism::node], ?location: Location) -> ArgumentsNode # - # source://prism//lib/prism/node.rb#591 - sig { params(params: T.untyped).returns(Prism::ArgumentsNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#679 + sig do + params( + flags: Integer, + arguments: T::Array[Prism::Node], + location: Prism::Location + ).returns(Prism::ArgumentsNode) + end + def copy(flags: T.unsafe(nil), arguments: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#576 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#664 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, arguments: Array[Node], location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, arguments: Array[Prism::node], location: Location } # - # source://prism//lib/prism/node.rb#604 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#687 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#622 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#709 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -698,14 +886,15 @@ class Prism::ArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#644 + # source://prism//lib/prism/node.rb#727 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#609 + # source://prism//lib/prism/node.rb#692 sig { returns(Integer) } def flags; end @@ -717,19 +906,24 @@ class Prism::ArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#654 + # source://prism//lib/prism/node.rb#737 def type; end end end # Flags for arguments nodes. # -# source://prism//lib/prism/node.rb#19241 +# source://prism//lib/prism/node.rb#19202 module Prism::ArgumentsNodeFlags; end +# if arguments contain keywords +# +# source://prism//lib/prism/node.rb#19204 +Prism::ArgumentsNodeFlags::CONTAINS_KEYWORDS = T.let(T.unsafe(nil), Integer) + # if arguments contain keyword splat # -# source://prism//lib/prism/node.rb#19243 +# source://prism//lib/prism/node.rb#19207 Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_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. @@ -737,100 +931,136 @@ Prism::ArgumentsNodeFlags::CONTAINS_KEYWORD_SPLAT = T.let(T.unsafe(nil), Integer # [1, 2, 3] # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#663 +# source://prism//lib/prism/node.rb#755 class Prism::ArrayNode < ::Prism::Node - # def initialize: (Integer flags, Array[Node] elements, Location? opening_loc, Location? closing_loc, Location location) -> void + # def initialize: (Integer flags, Array[Prism::node] elements, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayNode] a new instance of ArrayNode # - # source://prism//lib/prism/node.rb#665 + # source://prism//lib/prism/node.rb#757 + sig do + params( + source: Prism::Source, + flags: Integer, + elements: T::Array[Prism::Node], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, flags, elements, opening_loc, closing_loc, location); 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#893 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#676 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#768 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#681 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#773 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#758 + # source://prism//lib/prism/node.rb#854 sig { returns(T.nilable(String)) } def closing; end - # attr_reader closing_loc: Location? + # Represents the optional source location for the closing token. + # + # [1,2,3] # "]" + # %w[foo bar baz] # "]" + # %I(apple orange banana) # ")" + # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#735 + # source://prism//lib/prism/node.rb#831 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#691 + # source://prism//lib/prism/node.rb#783 + 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#686 + # source://prism//lib/prism/node.rb#778 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def contains_splat?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#748 + # source://prism//lib/prism/node.rb#844 sig { returns(T::Boolean) } def contains_splat?; end - # def copy: (**params) -> ArrayNode + # def copy: (?flags: Integer, ?elements: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> ArrayNode # - # source://prism//lib/prism/node.rb#696 - sig { params(params: T.untyped).returns(Prism::ArrayNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#788 + sig do + params( + flags: Integer, + elements: T::Array[Prism::Node], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::ArrayNode) + end + def copy(flags: T.unsafe(nil), elements: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#681 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#773 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Prism::node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#711 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#796 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader elements: Array[Node] + # 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#720 + # source://prism//lib/prism/node.rb#805 sig { returns(T::Array[Prism::Node]) } def elements; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#763 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#859 + sig { override.returns(String) } + def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#753 + # source://prism//lib/prism/node.rb#849 sig { returns(T.nilable(String)) } def opening; end - # attr_reader opening_loc: Location? + # Represents the optional source location for the opening token. + # + # [1,2,3] # "[" + # %w[foo bar baz] # "%w[" + # %I(apple orange banana) # "%I(" + # foo = 1, 2, 3 # nil # - # source://prism//lib/prism/node.rb#723 + # source://prism//lib/prism/node.rb#813 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -849,14 +1079,15 @@ class Prism::ArrayNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#787 + # source://prism//lib/prism/node.rb#877 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#716 + # source://prism//lib/prism/node.rb#801 sig { returns(Integer) } def flags; end @@ -868,19 +1099,19 @@ class Prism::ArrayNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#797 + # source://prism//lib/prism/node.rb#887 def type; end end end # Flags for array nodes. # -# source://prism//lib/prism/node.rb#19247 +# source://prism//lib/prism/node.rb#19211 module Prism::ArrayNodeFlags; end # if array contains splat nodes # -# source://prism//lib/prism/node.rb#19249 +# source://prism//lib/prism/node.rb#19213 Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array pattern in pattern matching. @@ -900,110 +1131,140 @@ Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # foo in Bar[1, 2, 3] # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#818 +# source://prism//lib/prism/node.rb#919 class Prism::ArrayPatternNode < ::Prism::Node - # def initialize: (Node? constant, Array[Node] requireds, Node? rest, Array[Node] posts, Location? opening_loc, Location? closing_loc, Location location) -> void + # def initialize: (Prism::node? constant, Array[Prism::node] requireds, Prism::node? rest, Array[Prism::node] posts, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayPatternNode] a new instance of ArrayPatternNode # - # source://prism//lib/prism/node.rb#820 + # source://prism//lib/prism/node.rb#921 + sig do + params( + source: Prism::Source, + constant: T.nilable(Prism::Node), + requireds: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + posts: T::Array[Prism::Node], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, constant, requireds, rest, posts, opening_loc, closing_loc, location); 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#1054 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#833 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#934 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#838 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#939 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#922 + # source://prism//lib/prism/node.rb#1015 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#904 + # source://prism//lib/prism/node.rb#997 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#853 + # source://prism//lib/prism/node.rb#954 + 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#843 + # source://prism//lib/prism/node.rb#944 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: Node? + # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#880 + # source://prism//lib/prism/node.rb#972 sig { returns(T.nilable(Prism::Node)) } def constant; end - # def copy: (**params) -> ArrayPatternNode + # def copy: (?constant: Prism::node?, ?requireds: Array[Prism::node], ?rest: Prism::node?, ?posts: Array[Prism::node], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> ArrayPatternNode # - # source://prism//lib/prism/node.rb#858 - sig { params(params: T.untyped).returns(Prism::ArrayPatternNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#959 + sig do + params( + constant: T.nilable(Prism::Node), + requireds: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + posts: T::Array[Prism::Node], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::ArrayPatternNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#838 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#939 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, requireds: Array[Node], rest: Node?, posts: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, requireds: Array[Prism::node], rest: Prism::node?, posts: Array[Prism::node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#875 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#967 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#927 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1020 + sig { override.returns(String) } + def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#917 + # source://prism//lib/prism/node.rb#1010 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#892 + # source://prism//lib/prism/node.rb#984 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader posts: Array[Node] + # attr_reader posts: Array[Prism::node] # - # source://prism//lib/prism/node.rb#889 + # source://prism//lib/prism/node.rb#981 sig { returns(T::Array[Prism::Node]) } def posts; end - # attr_reader requireds: Array[Node] + # attr_reader requireds: Array[Prism::node] # - # source://prism//lib/prism/node.rb#883 + # source://prism//lib/prism/node.rb#975 sig { returns(T::Array[Prism::Node]) } def requireds; end - # attr_reader rest: Node? + # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#886 + # source://prism//lib/prism/node.rb#978 sig { returns(T.nilable(Prism::Node)) } def rest; end @@ -1022,7 +1283,8 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#962 + # source://prism//lib/prism/node.rb#1038 + sig { override.returns(Symbol) } def type; end class << self @@ -1033,7 +1295,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#972 + # source://prism//lib/prism/node.rb#1048 def type; end end end @@ -1043,64 +1305,88 @@ end # { a => b } # ^^^^^^ # -# source://prism//lib/prism/node.rb#981 +# source://prism//lib/prism/node.rb#1071 class Prism::AssocNode < ::Prism::Node - # def initialize: (Node key, Node value, Location? operator_loc, Location location) -> void + # def initialize: (Prism::node key, Prism::node value, Location? operator_loc, Location location) -> void # # @return [AssocNode] a new instance of AssocNode # - # source://prism//lib/prism/node.rb#983 + # source://prism//lib/prism/node.rb#1073 + sig do + params( + source: Prism::Source, + key: Prism::Node, + value: Prism::Node, + operator_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, key, value, operator_loc, location); 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#1192 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#993 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1083 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#998 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1088 + 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#1008 + # source://prism//lib/prism/node.rb#1098 + 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#1003 + # source://prism//lib/prism/node.rb#1093 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AssocNode + # def copy: (?key: Prism::node, ?value: Prism::node, ?operator_loc: Location?, ?location: Location) -> AssocNode # - # source://prism//lib/prism/node.rb#1013 - sig { params(params: T.untyped).returns(Prism::AssocNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1103 + sig do + params( + key: Prism::Node, + value: Prism::Node, + operator_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::AssocNode) + end + def copy(key: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#998 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1088 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { key: Node, value: Node, operator_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { key: Prism::node, value: Prism::node, operator_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#1027 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1111 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1074 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1158 + sig { override.returns(String) } + def inspect; end # The key of the association. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # @@ -1113,13 +1399,13 @@ class Prism::AssocNode < ::Prism::Node # { def a; end => 1 } # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#1041 + # source://prism//lib/prism/node.rb#1125 sig { returns(Prism::Node) } def key; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#1069 + # source://prism//lib/prism/node.rb#1153 sig { returns(T.nilable(String)) } def operator; end @@ -1128,7 +1414,7 @@ class Prism::AssocNode < ::Prism::Node # { foo => bar } # ^^ # - # source://prism//lib/prism/node.rb#1056 + # source://prism//lib/prism/node.rb#1140 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end @@ -1147,7 +1433,8 @@ class Prism::AssocNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1098 + # source://prism//lib/prism/node.rb#1176 + sig { override.returns(Symbol) } def type; end # The value of the association, if present. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). @@ -1158,7 +1445,7 @@ class Prism::AssocNode < ::Prism::Node # { x: 1 } # ^ # - # source://prism//lib/prism/node.rb#1050 + # source://prism//lib/prism/node.rb#1134 sig { returns(Prism::Node) } def value; end @@ -1170,7 +1457,7 @@ class Prism::AssocNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1108 + # source://prism//lib/prism/node.rb#1186 def type; end end end @@ -1180,68 +1467,90 @@ end # { **foo } # ^^^^^ # -# source://prism//lib/prism/node.rb#1117 +# source://prism//lib/prism/node.rb#1204 class Prism::AssocSplatNode < ::Prism::Node - # def initialize: (Node? value, Location operator_loc, Location location) -> void + # def initialize: (Prism::node? value, Location operator_loc, Location location) -> void # # @return [AssocSplatNode] a new instance of AssocSplatNode # - # source://prism//lib/prism/node.rb#1119 + # source://prism//lib/prism/node.rb#1206 + sig do + params( + source: Prism::Source, + value: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, value, operator_loc, location); 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#1305 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1128 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1215 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1133 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1220 + 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#1145 + # source://prism//lib/prism/node.rb#1232 + 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#1138 + # source://prism//lib/prism/node.rb#1225 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> AssocSplatNode + # def copy: (?value: Prism::node?, ?operator_loc: Location, ?location: Location) -> AssocSplatNode # - # source://prism//lib/prism/node.rb#1150 - sig { params(params: T.untyped).returns(Prism::AssocSplatNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1237 + sig do + params( + value: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::AssocSplatNode) + end + def copy(value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1133 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1220 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node?, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1163 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1245 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1189 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1271 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1184 + # source://prism//lib/prism/node.rb#1266 sig { returns(String) } def operator; end @@ -1250,7 +1559,7 @@ class Prism::AssocSplatNode < ::Prism::Node # { **x } # ^^ # - # source://prism//lib/prism/node.rb#1177 + # source://prism//lib/prism/node.rb#1259 sig { returns(Prism::Location) } def operator_loc; end @@ -1269,7 +1578,8 @@ class Prism::AssocSplatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1215 + # source://prism//lib/prism/node.rb#1289 + sig { override.returns(Symbol) } def type; end # The value to be splatted, if present. Will be missing when keyword rest argument forwarding is used. @@ -1277,7 +1587,7 @@ class Prism::AssocSplatNode < ::Prism::Node # { **foo } # ^^^ # - # source://prism//lib/prism/node.rb#1171 + # source://prism//lib/prism/node.rb#1253 sig { returns(T.nilable(Prism::Node)) } def value; end @@ -1289,11 +1599,14 @@ class Prism::AssocSplatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1225 + # source://prism//lib/prism/node.rb#1299 def type; end end end +# The FFI backend is used on other Ruby implementations. +# +# source://prism//lib/prism.rb#85 Prism::BACKEND = T.let(T.unsafe(nil), Symbol) # Represents reading a reference to a field in the previous match. @@ -1301,64 +1614,73 @@ Prism::BACKEND = T.let(T.unsafe(nil), Symbol) # $' # ^^ # -# source://prism//lib/prism/node.rb#1234 +# source://prism//lib/prism/node.rb#1316 class Prism::BackReferenceReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1236 + # source://prism//lib/prism/node.rb#1318 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#1400 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1244 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1326 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1249 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1331 + 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#1259 + # source://prism//lib/prism/node.rb#1341 + 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#1254 + # source://prism//lib/prism/node.rb#1336 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BackReferenceReadNode + # def copy: (?name: Symbol, ?location: Location) -> BackReferenceReadNode # - # source://prism//lib/prism/node.rb#1264 - sig { params(params: T.untyped).returns(Prism::BackReferenceReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1346 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::BackReferenceReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1249 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1331 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#1276 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1354 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1289 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1366 + sig { override.returns(String) } + def inspect; end # The name of the back-reference variable, including the leading `$`. # @@ -1366,7 +1688,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # $+ # name `:$+` # - # source://prism//lib/prism/node.rb#1285 + # source://prism//lib/prism/node.rb#1363 sig { returns(Symbol) } def name; end @@ -1385,7 +1707,8 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1309 + # source://prism//lib/prism/node.rb#1384 + sig { override.returns(Symbol) } def type; end class << self @@ -1396,7 +1719,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1319 + # source://prism//lib/prism/node.rb#1394 def type; end end end @@ -1406,24 +1729,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#13 +# source://prism//lib/prism/visitor.rb#14 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#16 + # source://prism//lib/prism/visitor.rb#17 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#21 + # source://prism//lib/prism/visitor.rb#23 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::Node).void } def visit_child_nodes(node); end end @@ -1435,113 +1758,143 @@ end # end # ^^^^^ # -# source://prism//lib/prism/node.rb#1330 +# source://prism//lib/prism/node.rb#1412 class Prism::BeginNode < ::Prism::Node # def initialize: (Location? begin_keyword_loc, StatementsNode? statements, RescueNode? rescue_clause, ElseNode? else_clause, EnsureNode? ensure_clause, Location? end_keyword_loc, Location location) -> void # # @return [BeginNode] a new instance of BeginNode # - # source://prism//lib/prism/node.rb#1332 + # source://prism//lib/prism/node.rb#1414 + sig do + params( + source: Prism::Source, + begin_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + rescue_clause: T.nilable(Prism::RescueNode), + else_clause: T.nilable(Prism::ElseNode), + ensure_clause: T.nilable(Prism::EnsureNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc, location); 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#1551 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1345 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1427 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def begin_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1433 + # source://prism//lib/prism/node.rb#1507 sig { returns(T.nilable(String)) } def begin_keyword; end # attr_reader begin_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#1396 + # source://prism//lib/prism/node.rb#1469 sig { returns(T.nilable(Prism::Location)) } def begin_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1354 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1436 + 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#1369 + # source://prism//lib/prism/node.rb#1451 + 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#1359 + # source://prism//lib/prism/node.rb#1441 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BeginNode + # def copy: (?begin_keyword_loc: Location?, ?statements: StatementsNode?, ?rescue_clause: RescueNode?, ?else_clause: ElseNode?, ?ensure_clause: EnsureNode?, ?end_keyword_loc: Location?, ?location: Location) -> BeginNode # - # source://prism//lib/prism/node.rb#1374 - sig { params(params: T.untyped).returns(Prism::BeginNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1456 + sig do + params( + begin_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + rescue_clause: T.nilable(Prism::RescueNode), + else_clause: T.nilable(Prism::ElseNode), + ensure_clause: T.nilable(Prism::EnsureNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::BeginNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1354 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1436 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#1391 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1464 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # attr_reader else_clause: ElseNode? # - # source://prism//lib/prism/node.rb#1414 + # source://prism//lib/prism/node.rb#1488 sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#1438 + # source://prism//lib/prism/node.rb#1512 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#1420 + # source://prism//lib/prism/node.rb#1494 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # attr_reader ensure_clause: EnsureNode? # - # source://prism//lib/prism/node.rb#1417 + # source://prism//lib/prism/node.rb#1491 sig { returns(T.nilable(Prism::EnsureNode)) } def ensure_clause; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1443 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1517 + sig { override.returns(String) } + def inspect; end # attr_reader rescue_clause: RescueNode? # - # source://prism//lib/prism/node.rb#1411 + # source://prism//lib/prism/node.rb#1485 sig { returns(T.nilable(Prism::RescueNode)) } def rescue_clause; end - # source://prism//lib/prism/node.rb#1349 + # source://prism//lib/prism/node.rb#1431 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#1408 + # source://prism//lib/prism/node.rb#1482 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -1560,7 +1913,8 @@ class Prism::BeginNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1488 + # source://prism//lib/prism/node.rb#1535 + sig { override.returns(Symbol) } def type; end class << self @@ -1571,7 +1925,7 @@ class Prism::BeginNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1498 + # source://prism//lib/prism/node.rb#1545 def type; end end end @@ -1581,80 +1935,102 @@ end # bar(&args) # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1507 +# source://prism//lib/prism/node.rb#1566 class Prism::BlockArgumentNode < ::Prism::Node - # def initialize: (Node? expression, Location operator_loc, Location location) -> void + # def initialize: (Prism::node? expression, Location operator_loc, Location location) -> void # # @return [BlockArgumentNode] a new instance of BlockArgumentNode # - # source://prism//lib/prism/node.rb#1509 + # source://prism//lib/prism/node.rb#1568 + sig do + params( + source: Prism::Source, + expression: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, expression, operator_loc, location); 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#1661 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1518 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1577 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1523 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1582 + 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#1535 + # source://prism//lib/prism/node.rb#1594 + 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#1528 + # source://prism//lib/prism/node.rb#1587 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BlockArgumentNode + # def copy: (?expression: Prism::node?, ?operator_loc: Location, ?location: Location) -> BlockArgumentNode # - # source://prism//lib/prism/node.rb#1540 - sig { params(params: T.untyped).returns(Prism::BlockArgumentNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1599 + sig do + params( + expression: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::BlockArgumentNode) + end + def copy(expression: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1523 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1582 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node?, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1553 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1607 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader expression: Node? + # attr_reader expression: Prism::node? # - # source://prism//lib/prism/node.rb#1558 + # source://prism//lib/prism/node.rb#1612 sig { returns(T.nilable(Prism::Node)) } def expression; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1573 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1627 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1568 + # source://prism//lib/prism/node.rb#1622 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#1561 + # source://prism//lib/prism/node.rb#1615 sig { returns(Prism::Location) } def operator_loc; end @@ -1673,7 +2049,8 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1599 + # source://prism//lib/prism/node.rb#1645 + sig { override.returns(Symbol) } def type; end class << self @@ -1684,7 +2061,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1609 + # source://prism//lib/prism/node.rb#1655 def type; end end end @@ -1694,68 +2071,77 @@ end # a { |; b| } # ^ # -# source://prism//lib/prism/node.rb#1618 +# source://prism//lib/prism/node.rb#1672 class Prism::BlockLocalVariableNode < ::Prism::Node # def initialize: (Integer flags, Symbol name, Location location) -> void # # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1620 + # source://prism//lib/prism/node.rb#1674 + sig { params(source: Prism::Source, flags: Integer, name: Symbol, location: Prism::Location).void } def initialize(source, flags, name, location); 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#1762 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1629 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1683 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1634 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1688 + 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#1644 + # source://prism//lib/prism/node.rb#1698 + 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#1639 + # source://prism//lib/prism/node.rb#1693 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BlockLocalVariableNode + # def copy: (?flags: Integer, ?name: Symbol, ?location: Location) -> BlockLocalVariableNode # - # source://prism//lib/prism/node.rb#1649 - sig { params(params: T.untyped).returns(Prism::BlockLocalVariableNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1703 + sig { params(flags: Integer, name: Symbol, location: Prism::Location).returns(Prism::BlockLocalVariableNode) } + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1634 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1688 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#1662 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1711 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1680 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1728 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#1671 + # source://prism//lib/prism/node.rb#1720 sig { returns(Symbol) } def name; end @@ -1763,7 +2149,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#1675 + # source://prism//lib/prism/node.rb#1723 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -1782,14 +2168,15 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1702 + # source://prism//lib/prism/node.rb#1746 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#1667 + # source://prism//lib/prism/node.rb#1716 sig { returns(Integer) } def flags; end @@ -1801,7 +2188,7 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1712 + # source://prism//lib/prism/node.rb#1756 def type; end end end @@ -1811,104 +2198,132 @@ end # [1, 2, 3].each { |i| puts x } # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#1721 +# source://prism//lib/prism/node.rb#1773 class Prism::BlockNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, Node? parameters, Node? body, Location opening_loc, Location closing_loc, Location location) -> void + # def initialize: (Array[Symbol] locals, Prism::node? parameters, Prism::node? body, Location opening_loc, Location closing_loc, Location location) -> void # # @return [BlockNode] a new instance of BlockNode # - # source://prism//lib/prism/node.rb#1723 + # source://prism//lib/prism/node.rb#1775 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + parameters: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, locals, parameters, body, opening_loc, closing_loc, location); 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#1890 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1735 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1787 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: Node? + # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#1785 + # source://prism//lib/prism/node.rb#1829 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1740 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1792 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#1806 + # source://prism//lib/prism/node.rb#1851 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#1794 + # source://prism//lib/prism/node.rb#1839 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#1753 + # source://prism//lib/prism/node.rb#1805 + 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#1745 + # source://prism//lib/prism/node.rb#1797 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BlockNode + # def copy: (?locals: Array[Symbol], ?parameters: Prism::node?, ?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> BlockNode # - # source://prism//lib/prism/node.rb#1758 - sig { params(params: T.untyped).returns(Prism::BlockNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1810 + sig do + params( + locals: T::Array[Symbol], + parameters: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::BlockNode) + end + def copy(locals: T.unsafe(nil), parameters: T.unsafe(nil), body: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1740 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1792 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], parameters: Node?, body: Node?, opening_loc: Location, closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], parameters: Prism::node?, body: Prism::node?, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1774 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1818 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1811 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1856 + sig { override.returns(String) } + def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#1779 + # source://prism//lib/prism/node.rb#1823 sig { returns(T::Array[Symbol]) } def locals; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#1801 + # source://prism//lib/prism/node.rb#1846 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#1788 + # source://prism//lib/prism/node.rb#1832 sig { returns(Prism::Location) } def opening_loc; end - # attr_reader parameters: Node? + # attr_reader parameters: Prism::node? # - # source://prism//lib/prism/node.rb#1782 + # source://prism//lib/prism/node.rb#1826 sig { returns(T.nilable(Prism::Node)) } def parameters; end @@ -1927,7 +2342,8 @@ class Prism::BlockNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1845 + # source://prism//lib/prism/node.rb#1874 + sig { override.returns(Symbol) } def type; end class << self @@ -1938,7 +2354,7 @@ class Prism::BlockNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1855 + # source://prism//lib/prism/node.rb#1884 def type; end end end @@ -1949,86 +2365,112 @@ end # ^^ # end # -# source://prism//lib/prism/node.rb#1865 +# source://prism//lib/prism/node.rb#1906 class Prism::BlockParameterNode < ::Prism::Node # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # # @return [BlockParameterNode] a new instance of BlockParameterNode # - # source://prism//lib/prism/node.rb#1867 + # source://prism//lib/prism/node.rb#1908 + sig do + params( + source: Prism::Source, + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, flags, name, name_loc, operator_loc, location); 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#2023 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#1878 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#1919 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1883 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1924 + 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#1893 + # source://prism//lib/prism/node.rb#1934 + 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#1888 + # source://prism//lib/prism/node.rb#1929 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BlockParameterNode + # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> BlockParameterNode # - # source://prism//lib/prism/node.rb#1898 - sig { params(params: T.untyped).returns(Prism::BlockParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#1939 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::BlockParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#1883 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#1924 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#1913 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#1947 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#1954 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#1989 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#1922 + # source://prism//lib/prism/node.rb#1956 sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#1925 + # source://prism//lib/prism/node.rb#1959 sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#1949 + # source://prism//lib/prism/node.rb#1984 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#1937 + # source://prism//lib/prism/node.rb#1972 sig { returns(Prism::Location) } def operator_loc; end @@ -2036,7 +2478,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#1944 + # source://prism//lib/prism/node.rb#1979 sig { returns(T::Boolean) } def repeated_parameter?; end @@ -2055,14 +2497,15 @@ class Prism::BlockParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#1982 + # source://prism//lib/prism/node.rb#2007 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#1918 + # source://prism//lib/prism/node.rb#1952 sig { returns(Integer) } def flags; end @@ -2074,7 +2517,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#1992 + # source://prism//lib/prism/node.rb#2017 def type; end end end @@ -2088,98 +2531,124 @@ end # ^^^^^^^^^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#2005 +# source://prism//lib/prism/node.rb#2040 class Prism::BlockParametersNode < ::Prism::Node - # def initialize: (ParametersNode? parameters, Array[Node] locals, Location? opening_loc, Location? closing_loc, Location location) -> void + # def initialize: (ParametersNode? parameters, Array[BlockLocalVariableNode] locals, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [BlockParametersNode] a new instance of BlockParametersNode # - # source://prism//lib/prism/node.rb#2007 + # source://prism//lib/prism/node.rb#2042 + sig do + params( + source: Prism::Source, + parameters: T.nilable(Prism::ParametersNode), + locals: T::Array[Prism::BlockLocalVariableNode], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, parameters, locals, opening_loc, closing_loc, location); 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#2165 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2018 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#2053 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2023 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2058 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2097 + # source://prism//lib/prism/node.rb#2126 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#2079 + # source://prism//lib/prism/node.rb#2108 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2036 + # source://prism//lib/prism/node.rb#2071 + 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#2028 + # source://prism//lib/prism/node.rb#2063 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BlockParametersNode + # def copy: (?parameters: ParametersNode?, ?locals: Array[BlockLocalVariableNode], ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> BlockParametersNode # - # source://prism//lib/prism/node.rb#2041 - sig { params(params: T.untyped).returns(Prism::BlockParametersNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#2076 + sig do + params( + parameters: T.nilable(Prism::ParametersNode), + locals: T::Array[Prism::BlockLocalVariableNode], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::BlockParametersNode) + end + def copy(parameters: T.unsafe(nil), locals: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2023 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2058 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { parameters: ParametersNode?, locals: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { parameters: ParametersNode?, locals: Array[BlockLocalVariableNode], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#2056 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2084 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#2102 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#2131 + sig { override.returns(String) } + def inspect; end - # attr_reader locals: Array[Node] + # attr_reader locals: Array[BlockLocalVariableNode] # - # source://prism//lib/prism/node.rb#2064 - sig { returns(T::Array[Prism::Node]) } + # source://prism//lib/prism/node.rb#2092 + sig { returns(T::Array[Prism::BlockLocalVariableNode]) } def locals; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2092 + # source://prism//lib/prism/node.rb#2121 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#2067 + # source://prism//lib/prism/node.rb#2095 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//lib/prism/node.rb#2061 + # source://prism//lib/prism/node.rb#2089 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end @@ -2198,7 +2667,8 @@ class Prism::BlockParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2130 + # source://prism//lib/prism/node.rb#2149 + sig { override.returns(Symbol) } def type; end class << self @@ -2209,7 +2679,7 @@ class Prism::BlockParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2140 + # source://prism//lib/prism/node.rb#2159 def type; end end end @@ -2219,80 +2689,108 @@ end # break foo # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2149 +# source://prism//lib/prism/node.rb#2179 class Prism::BreakNode < ::Prism::Node # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void # # @return [BreakNode] a new instance of BreakNode # - # source://prism//lib/prism/node.rb#2151 + # source://prism//lib/prism/node.rb#2181 + sig do + params( + source: Prism::Source, + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, arguments, keyword_loc, location); 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#2280 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2160 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#2190 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? + # The arguments to the break statement, if present. These can be any [non-void expressions](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/node.rb#2200 + # break foo + # ^^^ + # + # source://prism//lib/prism/node.rb#2228 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2165 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2195 + 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#2177 + # source://prism//lib/prism/node.rb#2207 + 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#2170 + # source://prism//lib/prism/node.rb#2200 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> BreakNode + # def copy: (?arguments: ArgumentsNode?, ?keyword_loc: Location, ?location: Location) -> BreakNode # - # source://prism//lib/prism/node.rb#2182 - sig { params(params: T.untyped).returns(Prism::BreakNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#2212 + sig do + params( + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::BreakNode) + end + def copy(arguments: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2165 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2195 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#2195 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2220 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#2215 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#2246 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#2210 + # source://prism//lib/prism/node.rb#2241 sig { returns(String) } def keyword; end - # attr_reader keyword_loc: Location + # The location of the `break` keyword. + # + # break foo + # ^^^^^ # - # source://prism//lib/prism/node.rb#2203 + # source://prism//lib/prism/node.rb#2234 sig { returns(Prism::Location) } def keyword_loc; end @@ -2311,7 +2809,8 @@ class Prism::BreakNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2241 + # source://prism//lib/prism/node.rb#2264 + sig { override.returns(Symbol) } def type; end class << self @@ -2322,7 +2821,7 @@ class Prism::BreakNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2251 + # source://prism//lib/prism/node.rb#2274 def type; end end end @@ -2332,126 +2831,160 @@ end # foo.bar &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2260 +# source://prism//lib/prism/node.rb#2291 class Prism::CallAndWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Prism::node value, Location location) -> void # # @return [CallAndWriteNode] a new instance of CallAndWriteNode # - # source://prism//lib/prism/node.rb#2262 + # source://prism//lib/prism/node.rb#2293 + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); 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#2462 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2277 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#2308 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2381 + # source://prism//lib/prism/node.rb#2403 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2391 + # source://prism//lib/prism/node.rb#2413 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2331 + # source://prism//lib/prism/node.rb#2351 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2282 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2313 + 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#2295 + # source://prism//lib/prism/node.rb#2326 + 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#2287 + # source://prism//lib/prism/node.rb#2318 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CallAndWriteNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> CallAndWriteNode # - # source://prism//lib/prism/node.rb#2300 - sig { params(params: T.untyped).returns(Prism::CallAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#2331 + sig do + params( + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::CallAndWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2282 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2313 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#2319 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2339 + 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#2386 + # source://prism//lib/prism/node.rb#2408 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#2406 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#2428 + sig { override.returns(String) } + def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2396 + # source://prism//lib/prism/node.rb#2418 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2343 + # source://prism//lib/prism/node.rb#2364 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#2401 + # source://prism//lib/prism/node.rb#2423 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#2361 + # source://prism//lib/prism/node.rb#2383 sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#2355 + # source://prism//lib/prism/node.rb#2377 sig { returns(Symbol) } def read_name; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2328 + # source://prism//lib/prism/node.rb#2348 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -2459,7 +2992,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2371 + # source://prism//lib/prism/node.rb#2393 sig { returns(T::Boolean) } def safe_navigation?; end @@ -2478,12 +3011,13 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2440 + # source://prism//lib/prism/node.rb#2446 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#2367 + # source://prism//lib/prism/node.rb#2390 sig { returns(Prism::Node) } def value; end @@ -2491,21 +3025,21 @@ class Prism::CallAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2376 + # source://prism//lib/prism/node.rb#2398 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#2358 + # source://prism//lib/prism/node.rb#2380 sig { returns(Symbol) } def write_name; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2324 + # source://prism//lib/prism/node.rb#2344 sig { returns(Integer) } def flags; end @@ -2517,7 +3051,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2450 + # source://prism//lib/prism/node.rb#2456 def type; end end end @@ -2542,24 +3076,45 @@ end # foo&.bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#2474 +# source://prism//lib/prism/node.rb#2494 class Prism::CallNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Symbol name, Location? message_loc, Location? opening_loc, ArgumentsNode? arguments, Location? closing_loc, Node? block, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Symbol name, Location? message_loc, Location? opening_loc, ArgumentsNode? arguments, Location? closing_loc, Prism::node? block, Location location) -> void # # @return [CallNode] a new instance of CallNode # - # source://prism//lib/prism/node.rb#2476 + # source://prism//lib/prism/node.rb#2496 + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + name: Symbol, + message_loc: T.nilable(Prism::Location), + opening_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: T.nilable(Prism::Location), + block: T.nilable(Prism::Node), + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, block, location); 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#2700 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2492 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#2512 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#2596 + # source://prism//lib/prism/node.rb#2607 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -2567,119 +3122,148 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2625 + # source://prism//lib/prism/node.rb#2636 sig { returns(T::Boolean) } def attribute_write?; end - # attr_reader block: Node? + # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#2611 + # source://prism//lib/prism/node.rb#2623 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2635 + # source://prism//lib/prism/node.rb#2646 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2557 + # source://prism//lib/prism/node.rb#2565 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2497 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2517 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#2650 + # source://prism//lib/prism/node.rb#2661 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#2599 + # source://prism//lib/prism/node.rb#2610 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#2511 + # source://prism//lib/prism/node.rb#2531 + 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#2502 + # source://prism//lib/prism/node.rb#2522 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CallNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?name: Symbol, ?message_loc: Location?, ?opening_loc: Location?, ?arguments: ArgumentsNode?, ?closing_loc: Location?, ?block: Prism::node?, ?location: Location) -> CallNode # - # source://prism//lib/prism/node.rb#2516 - sig { params(params: T.untyped).returns(Prism::CallNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#2536 + sig do + params( + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + name: Symbol, + message_loc: T.nilable(Prism::Location), + opening_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: T.nilable(Prism::Location), + block: T.nilable(Prism::Node), + location: Prism::Location + ).returns(Prism::CallNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2497 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2517 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, block: Node?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, name: Symbol, message_loc: Location?, opening_loc: Location?, arguments: ArgumentsNode?, closing_loc: Location?, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#2536 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2544 + 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 + + # When a call node has the attribute_write flag set, it means that the call + # is using the attribute write syntax. This is either a method call to []= + # or a method call to a method that ends with =. Either way, the = sign is + # present in the source. + # + # Prism returns the message_loc _without_ the = sign attached, because there + # can be any amount of space between the message and the = sign. However, + # 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#299 + sig { returns(T.nilable(Prism::Location)) } + def full_message_loc; end + # def ignore_visibility?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2630 + # source://prism//lib/prism/node.rb#2641 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#2655 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#2666 + sig { override.returns(String) } + def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2640 + # source://prism//lib/prism/node.rb#2651 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2572 + # source://prism//lib/prism/node.rb#2581 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#2569 + # source://prism//lib/prism/node.rb#2578 sig { returns(Symbol) } def name; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#2645 + # source://prism//lib/prism/node.rb#2656 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#2584 + # source://prism//lib/prism/node.rb#2594 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end @@ -2694,7 +3278,7 @@ class Prism::CallNode < ::Prism::Node # foo + bar # ^^^ # - # source://prism//lib/prism/node.rb#2554 + # source://prism//lib/prism/node.rb#2562 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -2702,7 +3286,7 @@ class Prism::CallNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2615 + # source://prism//lib/prism/node.rb#2626 sig { returns(T::Boolean) } def safe_navigation?; end @@ -2721,22 +3305,23 @@ class Prism::CallNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2699 + # source://prism//lib/prism/node.rb#2684 + sig { override.returns(Symbol) } def type; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2620 + # source://prism//lib/prism/node.rb#2631 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2541 + # source://prism//lib/prism/node.rb#2549 sig { returns(Integer) } def flags; end @@ -2748,34 +3333,34 @@ class Prism::CallNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2709 + # source://prism//lib/prism/node.rb#2694 def type; end end end # Flags for call nodes. # -# source://prism//lib/prism/node.rb#19253 +# source://prism//lib/prism/node.rb#19217 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#19261 +# source://prism//lib/prism/node.rb#19225 Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer) # a call that ignores method visibility # -# source://prism//lib/prism/node.rb#19264 +# source://prism//lib/prism/node.rb#19228 Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer) # &. operator # -# source://prism//lib/prism/node.rb#19255 +# source://prism//lib/prism/node.rb#19219 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#19258 +# source://prism//lib/prism/node.rb#19222 Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # Represents the use of an assignment operator on a call. @@ -2785,124 +3370,172 @@ Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # # source://prism//lib/prism/node.rb#2718 class Prism::CallOperatorWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Symbol operator, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Symbol binary_operator, Location binary_operator_loc, Prism::node value, Location location) -> void # # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode # # source://prism//lib/prism/node.rb#2720 - def initialize(source, flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator, operator_loc, value, location); end + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + binary_operator: Symbol, + binary_operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, flags, receiver, call_operator_loc, message_loc, read_name, write_name, binary_operator, binary_operator_loc, value, location); 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#2888 + def ===(other); end # def accept: (Visitor visitor) -> void # # source://prism//lib/prism/node.rb#2736 - sig { params(visitor: Prism::Visitor).void } + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2844 + # source://prism//lib/prism/node.rb#2834 sig { returns(T::Boolean) } def attribute_write?; end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#2811 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#2814 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#2854 + # source://prism//lib/prism/node.rb#2844 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2791 + # source://prism//lib/prism/node.rb#2779 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # # source://prism//lib/prism/node.rb#2741 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + 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#2754 + 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#2746 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CallOperatorWriteNode + # def copy: (?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, ?location: Location) -> CallOperatorWriteNode # # source://prism//lib/prism/node.rb#2759 - sig { params(params: T.untyped).returns(Prism::CallOperatorWriteNode) } - def copy(**params); end + sig do + params( + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + binary_operator: Symbol, + binary_operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::CallOperatorWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # # source://prism//lib/prism/node.rb#2741 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator: Symbol, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { 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, location: Location } # - # source://prism//lib/prism/node.rb#2779 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2767 + 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#2849 + # source://prism//lib/prism/node.rb#2839 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#2864 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#2854 + sig { override.returns(String) } + def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#2859 + # source://prism//lib/prism/node.rb#2849 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#2803 + # source://prism//lib/prism/node.rb#2792 sig { returns(T.nilable(Prism::Location)) } def message_loc; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#2821 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#307 def operator; end - # attr_reader operator_loc: Location + # 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.rb#2824 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#314 def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#2815 + # source://prism//lib/prism/node.rb#2805 sig { returns(Symbol) } def read_name; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2788 + # source://prism//lib/prism/node.rb#2776 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -2910,7 +3543,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2834 + # source://prism//lib/prism/node.rb#2824 sig { returns(T::Boolean) } def safe_navigation?; end @@ -2929,12 +3562,13 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#2899 + # source://prism//lib/prism/node.rb#2872 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#2830 + # source://prism//lib/prism/node.rb#2821 sig { returns(Prism::Node) } def value; end @@ -2942,21 +3576,21 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#2839 + # source://prism//lib/prism/node.rb#2829 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#2818 + # source://prism//lib/prism/node.rb#2808 sig { returns(Symbol) } def write_name; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2784 + # source://prism//lib/prism/node.rb#2772 sig { returns(Integer) } def flags; end @@ -2968,7 +3602,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#2909 + # source://prism//lib/prism/node.rb#2882 def type; end end end @@ -2978,126 +3612,160 @@ end # foo.bar ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#2918 +# source://prism//lib/prism/node.rb#2906 class Prism::CallOrWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location? message_loc, Symbol read_name, Symbol write_name, Location operator_loc, Prism::node value, Location location) -> void # # @return [CallOrWriteNode] a new instance of CallOrWriteNode # - # source://prism//lib/prism/node.rb#2920 + # source://prism//lib/prism/node.rb#2908 + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); 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#3077 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#2935 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#2923 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3039 + # source://prism//lib/prism/node.rb#3018 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#3049 + # source://prism//lib/prism/node.rb#3028 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#2989 + # source://prism//lib/prism/node.rb#2966 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2940 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2928 + 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#2953 + # source://prism//lib/prism/node.rb#2941 + 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#2945 + # source://prism//lib/prism/node.rb#2933 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CallOrWriteNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?message_loc: Location?, ?read_name: Symbol, ?write_name: Symbol, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> CallOrWriteNode # - # source://prism//lib/prism/node.rb#2958 - sig { params(params: T.untyped).returns(Prism::CallOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#2946 + sig do + params( + flags: Integer, + receiver: T.nilable(Prism::Node), + call_operator_loc: T.nilable(Prism::Location), + message_loc: T.nilable(Prism::Location), + read_name: Symbol, + write_name: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::CallOrWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#2940 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#2928 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#2977 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#2954 + 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#3044 + # source://prism//lib/prism/node.rb#3023 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#3064 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3043 + sig { override.returns(String) } + def inspect; end # def message: () -> String? # - # source://prism//lib/prism/node.rb#3054 + # source://prism//lib/prism/node.rb#3033 sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//lib/prism/node.rb#3001 + # source://prism//lib/prism/node.rb#2979 sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3059 + # source://prism//lib/prism/node.rb#3038 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#3019 + # source://prism//lib/prism/node.rb#2998 sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//lib/prism/node.rb#3013 + # source://prism//lib/prism/node.rb#2992 sig { returns(Symbol) } def read_name; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#2986 + # source://prism//lib/prism/node.rb#2963 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -3105,7 +3773,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3029 + # source://prism//lib/prism/node.rb#3008 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3124,12 +3792,13 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3098 + # source://prism//lib/prism/node.rb#3061 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3025 + # source://prism//lib/prism/node.rb#3005 sig { returns(Prism::Node) } def value; end @@ -3137,21 +3806,21 @@ class Prism::CallOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3034 + # source://prism//lib/prism/node.rb#3013 sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//lib/prism/node.rb#3016 + # source://prism//lib/prism/node.rb#2995 sig { returns(Symbol) } def write_name; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#2982 + # source://prism//lib/prism/node.rb#2959 sig { returns(Integer) } def flags; end @@ -3163,7 +3832,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3108 + # source://prism//lib/prism/node.rb#3071 def type; end end end @@ -3181,114 +3850,142 @@ end # for foo.bar in baz do end # ^^^^^^^ # -# source://prism//lib/prism/node.rb#3125 +# source://prism//lib/prism/node.rb#3102 class Prism::CallTargetNode < ::Prism::Node - # def initialize: (Integer flags, Node receiver, Location call_operator_loc, Symbol name, Location message_loc, Location location) -> void + # def initialize: (Integer flags, Prism::node receiver, Location call_operator_loc, Symbol name, Location message_loc, Location location) -> void # # @return [CallTargetNode] a new instance of CallTargetNode # - # source://prism//lib/prism/node.rb#3127 + # source://prism//lib/prism/node.rb#3104 + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: Prism::Node, + call_operator_loc: Prism::Location, + name: Symbol, + message_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, name, message_loc, location); 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#3237 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3139 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3116 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3213 + # source://prism//lib/prism/node.rb#3183 sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String # - # source://prism//lib/prism/node.rb#3223 + # source://prism//lib/prism/node.rb#3193 sig { returns(String) } def call_operator; end # attr_reader call_operator_loc: Location # - # source://prism//lib/prism/node.rb#3187 + # source://prism//lib/prism/node.rb#3156 sig { returns(Prism::Location) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3144 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3121 + 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#3154 + # source://prism//lib/prism/node.rb#3131 + 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#3149 + # source://prism//lib/prism/node.rb#3126 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CallTargetNode + # def copy: (?flags: Integer, ?receiver: Prism::node, ?call_operator_loc: Location, ?name: Symbol, ?message_loc: Location, ?location: Location) -> CallTargetNode # - # source://prism//lib/prism/node.rb#3159 - sig { params(params: T.untyped).returns(Prism::CallTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3136 + sig do + params( + flags: Integer, + receiver: Prism::Node, + call_operator_loc: Prism::Location, + name: Symbol, + message_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::CallTargetNode) + end + def copy(flags: T.unsafe(nil), receiver: T.unsafe(nil), call_operator_loc: T.unsafe(nil), name: T.unsafe(nil), message_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3144 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3121 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3175 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3144 + 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#3218 + # source://prism//lib/prism/node.rb#3188 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#3233 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3203 + sig { override.returns(String) } + def inspect; end # def message: () -> String # - # source://prism//lib/prism/node.rb#3228 + # source://prism//lib/prism/node.rb#3198 sig { returns(String) } def message; end # attr_reader message_loc: Location # - # source://prism//lib/prism/node.rb#3196 + # source://prism//lib/prism/node.rb#3166 sig { returns(Prism::Location) } def message_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3193 + # source://prism//lib/prism/node.rb#3163 sig { returns(Symbol) } def name; end - # attr_reader receiver: Node + # attr_reader receiver: Prism::node # - # source://prism//lib/prism/node.rb#3184 + # source://prism//lib/prism/node.rb#3153 sig { returns(Prism::Node) } def receiver; end @@ -3296,7 +3993,7 @@ class Prism::CallTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3203 + # source://prism//lib/prism/node.rb#3173 sig { returns(T::Boolean) } def safe_navigation?; end @@ -3315,22 +4012,23 @@ class Prism::CallTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3259 + # source://prism//lib/prism/node.rb#3221 + sig { override.returns(Symbol) } def type; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#3208 + # source://prism//lib/prism/node.rb#3178 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#3180 + # source://prism//lib/prism/node.rb#3149 sig { returns(Integer) } def flags; end @@ -3342,7 +4040,7 @@ class Prism::CallTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3269 + # source://prism//lib/prism/node.rb#3231 def type; end end end @@ -3352,80 +4050,104 @@ end # foo => [bar => baz] # ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3278 +# source://prism//lib/prism/node.rb#3251 class Prism::CapturePatternNode < ::Prism::Node - # def initialize: (Node value, Node target, Location operator_loc, Location location) -> void + # def initialize: (Prism::node value, Prism::node target, Location operator_loc, Location location) -> void # # @return [CapturePatternNode] a new instance of CapturePatternNode # - # source://prism//lib/prism/node.rb#3280 + # source://prism//lib/prism/node.rb#3253 + sig do + params( + source: Prism::Source, + value: Prism::Node, + target: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, value, target, operator_loc, location); 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#3348 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3290 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3263 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3295 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3268 + 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#3305 + # source://prism//lib/prism/node.rb#3278 + 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#3300 + # source://prism//lib/prism/node.rb#3273 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> CapturePatternNode + # def copy: (?value: Prism::node, ?target: Prism::node, ?operator_loc: Location, ?location: Location) -> CapturePatternNode # - # source://prism//lib/prism/node.rb#3310 - sig { params(params: T.untyped).returns(Prism::CapturePatternNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3283 + sig do + params( + value: Prism::Node, + target: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::CapturePatternNode) + end + def copy(value: T.unsafe(nil), target: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3295 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3268 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, target: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, target: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3324 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3291 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#3347 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3314 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3342 + # source://prism//lib/prism/node.rb#3309 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#3335 + # source://prism//lib/prism/node.rb#3302 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader target: Node + # attr_reader target: Prism::node # - # source://prism//lib/prism/node.rb#3332 + # source://prism//lib/prism/node.rb#3299 sig { returns(Prism::Node) } def target; end @@ -3444,12 +4166,13 @@ class Prism::CapturePatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3371 + # source://prism//lib/prism/node.rb#3332 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3329 + # source://prism//lib/prism/node.rb#3296 sig { returns(Prism::Node) } def value; end @@ -3461,7 +4184,7 @@ class Prism::CapturePatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3381 + # source://prism//lib/prism/node.rb#3342 def type; end end end @@ -3473,104 +4196,132 @@ end # end # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3392 +# source://prism//lib/prism/node.rb#3362 class Prism::CaseMatchNode < ::Prism::Node - # def initialize: (Node? predicate, Array[Node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void + # def initialize: (Prism::node? predicate, Array[Prism::node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseMatchNode] a new instance of CaseMatchNode # - # source://prism//lib/prism/node.rb#3394 + # source://prism//lib/prism/node.rb#3364 + sig do + params( + source: Prism::Source, + predicate: T.nilable(Prism::Node), + conditions: T::Array[Prism::Node], + consequent: T.nilable(Prism::ElseNode), + case_keyword_loc: Prism::Location, + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); 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#3480 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3406 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3376 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3473 + # source://prism//lib/prism/node.rb#3436 sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3460 + # source://prism//lib/prism/node.rb#3422 sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3411 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3381 + 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#3425 + # source://prism//lib/prism/node.rb#3395 + 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#3416 + # source://prism//lib/prism/node.rb#3386 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader conditions: Array[Node] + # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#3454 + # source://prism//lib/prism/node.rb#3416 sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//lib/prism/node.rb#3457 + # source://prism//lib/prism/node.rb#3419 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end - # def copy: (**params) -> CaseMatchNode + # def copy: (?predicate: Prism::node?, ?conditions: Array[Prism::node], ?consequent: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location, ?location: Location) -> CaseMatchNode # - # source://prism//lib/prism/node.rb#3430 - sig { params(params: T.untyped).returns(Prism::CaseMatchNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3400 + sig do + params( + predicate: T.nilable(Prism::Node), + conditions: T::Array[Prism::Node], + consequent: T.nilable(Prism::ElseNode), + case_keyword_loc: Prism::Location, + end_keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::CaseMatchNode) + end + def copy(predicate: T.unsafe(nil), conditions: T.unsafe(nil), consequent: T.unsafe(nil), case_keyword_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3411 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3381 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Prism::node?, conditions: Array[Prism::node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3446 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3408 + 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#3478 + # source://prism//lib/prism/node.rb#3441 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3466 + # source://prism//lib/prism/node.rb#3429 sig { returns(Prism::Location) } def end_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#3483 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3446 + sig { override.returns(String) } + def inspect; end - # attr_reader predicate: Node? + # attr_reader predicate: Prism::node? # - # source://prism//lib/prism/node.rb#3451 + # source://prism//lib/prism/node.rb#3413 sig { returns(T.nilable(Prism::Node)) } def predicate; end @@ -3589,7 +4340,8 @@ class Prism::CaseMatchNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3517 + # source://prism//lib/prism/node.rb#3464 + sig { override.returns(Symbol) } def type; end class << self @@ -3600,7 +4352,7 @@ class Prism::CaseMatchNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3527 + # source://prism//lib/prism/node.rb#3474 def type; end end end @@ -3612,104 +4364,132 @@ end # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3538 +# source://prism//lib/prism/node.rb#3497 class Prism::CaseNode < ::Prism::Node - # def initialize: (Node? predicate, Array[Node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void + # def initialize: (Prism::node? predicate, Array[Prism::node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseNode] a new instance of CaseNode # - # source://prism//lib/prism/node.rb#3540 + # source://prism//lib/prism/node.rb#3499 + sig do + params( + source: Prism::Source, + predicate: T.nilable(Prism::Node), + conditions: T::Array[Prism::Node], + consequent: T.nilable(Prism::ElseNode), + case_keyword_loc: Prism::Location, + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); 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#3615 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3552 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3511 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//lib/prism/node.rb#3619 + # source://prism//lib/prism/node.rb#3571 sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3606 + # source://prism//lib/prism/node.rb#3557 sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3557 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3516 + 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#3571 + # source://prism//lib/prism/node.rb#3530 + 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#3562 + # source://prism//lib/prism/node.rb#3521 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader conditions: Array[Node] + # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#3600 + # source://prism//lib/prism/node.rb#3551 sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//lib/prism/node.rb#3603 + # source://prism//lib/prism/node.rb#3554 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end - # def copy: (**params) -> CaseNode + # def copy: (?predicate: Prism::node?, ?conditions: Array[Prism::node], ?consequent: ElseNode?, ?case_keyword_loc: Location, ?end_keyword_loc: Location, ?location: Location) -> CaseNode # - # source://prism//lib/prism/node.rb#3576 - sig { params(params: T.untyped).returns(Prism::CaseNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3535 + sig do + params( + predicate: T.nilable(Prism::Node), + conditions: T::Array[Prism::Node], + consequent: T.nilable(Prism::ElseNode), + case_keyword_loc: Prism::Location, + end_keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::CaseNode) + end + def copy(predicate: T.unsafe(nil), conditions: T.unsafe(nil), consequent: T.unsafe(nil), case_keyword_loc: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3557 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3516 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Prism::node?, conditions: Array[Prism::node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#3592 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3543 + 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#3624 + # source://prism//lib/prism/node.rb#3576 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3612 + # source://prism//lib/prism/node.rb#3564 sig { returns(Prism::Location) } def end_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#3629 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3581 + sig { override.returns(String) } + def inspect; end - # attr_reader predicate: Node? + # attr_reader predicate: Prism::node? # - # source://prism//lib/prism/node.rb#3597 + # source://prism//lib/prism/node.rb#3548 sig { returns(T.nilable(Prism::Node)) } def predicate; end @@ -3728,7 +4508,8 @@ class Prism::CaseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3663 + # source://prism//lib/prism/node.rb#3599 + sig { override.returns(Symbol) } def type; end class << self @@ -3739,7 +4520,7 @@ class Prism::CaseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3673 + # source://prism//lib/prism/node.rb#3609 def type; end end end @@ -3749,128 +4530,162 @@ end # class Foo end # ^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3682 +# source://prism//lib/prism/node.rb#3630 class Prism::ClassNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Node constant_path, Location? inheritance_operator_loc, Node? superclass, Node? body, Location end_keyword_loc, Symbol name, Location location) -> void + # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Prism::node constant_path, Location? inheritance_operator_loc, Prism::node? superclass, Prism::node? body, Location end_keyword_loc, Symbol name, Location location) -> void # # @return [ClassNode] a new instance of ClassNode # - # source://prism//lib/prism/node.rb#3684 + # source://prism//lib/prism/node.rb#3632 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + class_keyword_loc: Prism::Location, + constant_path: Prism::Node, + inheritance_operator_loc: T.nilable(Prism::Location), + superclass: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + name: Symbol, + location: Prism::Location + ).void + end def initialize(source, locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location); 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#3775 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3699 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3647 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: Node? + # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#3774 + # source://prism//lib/prism/node.rb#3713 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3704 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3652 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//lib/prism/node.rb#3787 + # source://prism//lib/prism/node.rb#3726 sig { returns(String) } def class_keyword; end # attr_reader class_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3750 + # source://prism//lib/prism/node.rb#3687 sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#3718 + # source://prism//lib/prism/node.rb#3666 + 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#3709 + # source://prism//lib/prism/node.rb#3657 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant_path: Node + # attr_reader constant_path: Prism::node # - # source://prism//lib/prism/node.rb#3756 + # source://prism//lib/prism/node.rb#3694 sig { returns(Prism::Node) } def constant_path; end - # def copy: (**params) -> ClassNode + # def copy: (?locals: Array[Symbol], ?class_keyword_loc: Location, ?constant_path: Prism::node, ?inheritance_operator_loc: Location?, ?superclass: Prism::node?, ?body: Prism::node?, ?end_keyword_loc: Location, ?name: Symbol, ?location: Location) -> ClassNode # - # source://prism//lib/prism/node.rb#3723 - sig { params(params: T.untyped).returns(Prism::ClassNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3671 + sig do + params( + locals: T::Array[Symbol], + class_keyword_loc: Prism::Location, + constant_path: Prism::Node, + inheritance_operator_loc: T.nilable(Prism::Location), + superclass: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + name: Symbol, + location: Prism::Location + ).returns(Prism::ClassNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3704 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3652 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, constant_path: Node, inheritance_operator_loc: Location?, superclass: Node?, body: Node?, end_keyword_loc: Location, name: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, constant_path: Prism::node, inheritance_operator_loc: Location?, superclass: Prism::node?, body: Prism::node?, end_keyword_loc: Location, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#3742 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3679 + 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#3797 + # source://prism//lib/prism/node.rb#3736 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#3777 + # source://prism//lib/prism/node.rb#3716 sig { returns(Prism::Location) } def end_keyword_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + # def inheritance_operator: () -> String? # - # source://prism//lib/prism/node.rb#3792 + # source://prism//lib/prism/node.rb#3731 sig { returns(T.nilable(String)) } def inheritance_operator; end # attr_reader inheritance_operator_loc: Location? # - # source://prism//lib/prism/node.rb#3759 + # source://prism//lib/prism/node.rb#3697 sig { returns(T.nilable(Prism::Location)) } def inheritance_operator_loc; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#3802 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3741 + sig { override.returns(String) } + def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#3747 + # source://prism//lib/prism/node.rb#3684 sig { returns(T::Array[Symbol]) } def locals; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3783 + # source://prism//lib/prism/node.rb#3723 sig { returns(Symbol) } def name; end - # attr_reader superclass: Node? + # attr_reader superclass: Prism::node? # - # source://prism//lib/prism/node.rb#3771 + # source://prism//lib/prism/node.rb#3710 sig { returns(T.nilable(Prism::Node)) } def superclass; end @@ -3889,7 +4704,8 @@ class Prism::ClassNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3840 + # source://prism//lib/prism/node.rb#3759 + sig { override.returns(Symbol) } def type; end class << self @@ -3900,7 +4716,7 @@ class Prism::ClassNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3850 + # source://prism//lib/prism/node.rb#3769 def type; end end end @@ -3910,89 +4726,115 @@ end # @@target &&= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3859 +# source://prism//lib/prism/node.rb#3793 class Prism::ClassVariableAndWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#3861 + # source://prism//lib/prism/node.rb#3795 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#3898 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3872 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3806 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3877 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3811 + 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#3887 + # source://prism//lib/prism/node.rb#3821 + 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#3882 + # source://prism//lib/prism/node.rb#3816 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableAndWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ClassVariableAndWriteNode # - # source://prism//lib/prism/node.rb#3892 - sig { params(params: T.untyped).returns(Prism::ClassVariableAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3826 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ClassVariableAndWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3877 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3811 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#3907 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3834 + 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#125 + # source://prism//lib/prism/desugar_compiler.rb#127 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#3936 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3864 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#3912 + # source://prism//lib/prism/node.rb#3839 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#3915 + # source://prism//lib/prism/node.rb#3842 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#3931 + # source://prism//lib/prism/node.rb#3859 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#3921 + # source://prism//lib/prism/node.rb#3849 sig { returns(Prism::Location) } def operator_loc; end @@ -4011,12 +4853,13 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#3960 + # source://prism//lib/prism/node.rb#3882 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#3927 + # source://prism//lib/prism/node.rb#3856 sig { returns(Prism::Node) } def value; end @@ -4028,7 +4871,7 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#3970 + # source://prism//lib/prism/node.rb#3892 def type; end end end @@ -4038,90 +4881,130 @@ end # @@target += value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#3979 +# source://prism//lib/prism/node.rb#3911 class Prism::ClassVariableOperatorWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#3981 - def initialize(source, name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#3913 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, binary_operator_loc, value, binary_operator, location); 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#4015 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#3993 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#3925 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#3978 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#3968 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3998 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3930 + 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#4008 + # source://prism//lib/prism/node.rb#3940 + 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#4003 + # source://prism//lib/prism/node.rb#3935 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableOperatorWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ClassVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#4013 - sig { params(params: T.untyped).returns(Prism::ClassVariableOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#3945 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).returns(Prism::ClassVariableOperatorWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#3998 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#3930 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4029 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#3953 + 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#137 + # source://prism//lib/prism/desugar_compiler.rb#139 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4056 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#3981 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4034 + # source://prism//lib/prism/node.rb#3958 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4037 + # source://prism//lib/prism/node.rb#3961 sig { returns(Prism::Location) } def name_loc; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#4052 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#323 def operator; end - # attr_reader operator_loc: Location + # 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.rb#4043 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#330 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -4139,12 +5022,13 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4081 + # source://prism//lib/prism/node.rb#3999 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4049 + # source://prism//lib/prism/node.rb#3975 sig { returns(Prism::Node) } def value; end @@ -4156,7 +5040,7 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4091 + # source://prism//lib/prism/node.rb#4009 def type; end end end @@ -4166,89 +5050,115 @@ end # @@target ||= value # ^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4100 +# source://prism//lib/prism/node.rb#4029 class Prism::ClassVariableOrWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4102 + # source://prism//lib/prism/node.rb#4031 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#4134 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4113 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4042 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4118 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4047 + 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#4128 + # source://prism//lib/prism/node.rb#4057 + 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#4123 + # source://prism//lib/prism/node.rb#4052 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableOrWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ClassVariableOrWriteNode # - # source://prism//lib/prism/node.rb#4133 - sig { params(params: T.untyped).returns(Prism::ClassVariableOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4062 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ClassVariableOrWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4118 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4047 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4148 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4070 + 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#131 + # source://prism//lib/prism/desugar_compiler.rb#133 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4177 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4100 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4153 + # source://prism//lib/prism/node.rb#4075 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4156 + # source://prism//lib/prism/node.rb#4078 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4172 + # source://prism//lib/prism/node.rb#4095 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4162 + # source://prism//lib/prism/node.rb#4085 sig { returns(Prism::Location) } def operator_loc; end @@ -4267,12 +5177,13 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4201 + # source://prism//lib/prism/node.rb#4118 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4168 + # source://prism//lib/prism/node.rb#4092 sig { returns(Prism::Node) } def value; end @@ -4284,7 +5195,7 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4211 + # source://prism//lib/prism/node.rb#4128 def type; end end end @@ -4294,64 +5205,73 @@ end # @@foo # ^^^^^ # -# source://prism//lib/prism/node.rb#4220 +# source://prism//lib/prism/node.rb#4147 class Prism::ClassVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode # - # source://prism//lib/prism/node.rb#4222 + # source://prism//lib/prism/node.rb#4149 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#4231 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4230 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4157 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4235 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4162 + 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#4245 + # source://prism//lib/prism/node.rb#4172 + 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#4240 + # source://prism//lib/prism/node.rb#4167 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableReadNode + # def copy: (?name: Symbol, ?location: Location) -> ClassVariableReadNode # - # source://prism//lib/prism/node.rb#4250 - sig { params(params: T.untyped).returns(Prism::ClassVariableReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4177 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::ClassVariableReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4235 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4162 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4262 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4185 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4275 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4197 + sig { override.returns(String) } + def inspect; end # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). # @@ -4359,7 +5279,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # @@_test # name `:@@_test` # - # source://prism//lib/prism/node.rb#4271 + # source://prism//lib/prism/node.rb#4194 sig { returns(Symbol) } def name; end @@ -4378,7 +5298,8 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4295 + # source://prism//lib/prism/node.rb#4215 + sig { override.returns(Symbol) } def type; end class << self @@ -4389,7 +5310,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4305 + # source://prism//lib/prism/node.rb#4225 def type; end end end @@ -4399,68 +5320,77 @@ end # @@foo, @@bar = baz # ^^^^^ ^^^^^ # -# source://prism//lib/prism/node.rb#4314 +# source://prism//lib/prism/node.rb#4241 class Prism::ClassVariableTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode # - # source://prism//lib/prism/node.rb#4316 + # source://prism//lib/prism/node.rb#4243 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#4321 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4324 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4251 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4329 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4256 + 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#4339 + # source://prism//lib/prism/node.rb#4266 + 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#4334 + # source://prism//lib/prism/node.rb#4261 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableTargetNode + # def copy: (?name: Symbol, ?location: Location) -> ClassVariableTargetNode # - # source://prism//lib/prism/node.rb#4344 - sig { params(params: T.untyped).returns(Prism::ClassVariableTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4271 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::ClassVariableTargetNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4329 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4256 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4356 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4279 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4365 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4287 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4361 + # source://prism//lib/prism/node.rb#4284 sig { returns(Symbol) } def name; end @@ -4479,7 +5409,8 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4385 + # source://prism//lib/prism/node.rb#4305 + sig { override.returns(Symbol) } def type; end class << self @@ -4490,7 +5421,7 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4395 + # source://prism//lib/prism/node.rb#4315 def type; end end end @@ -4500,87 +5431,123 @@ end # @@foo = 1 # ^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4404 +# source://prism//lib/prism/node.rb#4331 class Prism::ClassVariableWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Node value, Location? operator_loc, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4406 + # source://prism//lib/prism/node.rb#4333 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, value, operator_loc, location); 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#4452 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4417 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4344 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4422 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4349 + 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#4432 + # source://prism//lib/prism/node.rb#4359 + 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#4427 + # source://prism//lib/prism/node.rb#4354 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ClassVariableWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> ClassVariableWriteNode # - # source://prism//lib/prism/node.rb#4437 - sig { params(params: T.untyped).returns(Prism::ClassVariableWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4364 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ClassVariableWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4422 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4349 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#4452 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4372 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4487 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4418 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # The name of the class variable, which is a `@@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). # - # source://prism//lib/prism/node.rb#4457 + # @@abc = 123 # name `@@abc` + # + # @@_test = :test # name `@@_test` + # + # source://prism//lib/prism/node.rb#4381 sig { returns(Symbol) } def name; end - # attr_reader name_loc: Location + # The location of the variable name. + # + # @@foo = :bar + # ^^^^^ # - # source://prism//lib/prism/node.rb#4460 + # source://prism//lib/prism/node.rb#4387 sig { returns(Prism::Location) } def name_loc; end - # def operator: () -> String? + # def operator: () -> String # - # source://prism//lib/prism/node.rb#4482 - sig { returns(T.nilable(String)) } + # source://prism//lib/prism/node.rb#4413 + sig { returns(String) } def operator; end - # attr_reader operator_loc: Location? + # The location of the `=` operator. # - # source://prism//lib/prism/node.rb#4469 - sig { returns(T.nilable(Prism::Location)) } + # @@foo = :bar + # ^ + # + # source://prism//lib/prism/node.rb#4406 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -4598,12 +5565,19 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4511 + # source://prism//lib/prism/node.rb#4436 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # The value to write to the class variable. This can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/node.rb#4466 + # @@foo = :bar + # ^^^^ + # + # @@_xyz = 123 + # ^^^ + # + # source://prism//lib/prism/node.rb#4400 sig { returns(Prism::Node) } def value; end @@ -4615,7 +5589,7 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4521 + # source://prism//lib/prism/node.rb#4446 def type; end end end @@ -4623,27 +5597,37 @@ 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#258 +# source://prism//lib/prism/parse_result.rb#366 class Prism::Comment + abstract! + # Create a new comment object with the given location. # # @return [Comment] a new instance of Comment # - # source://prism//lib/prism/parse_result.rb#263 + # source://prism//lib/prism/parse_result.rb#371 + 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#268 + # source://prism//lib/prism/parse_result.rb#376 + 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#260 + # source://prism//lib/prism/parse_result.rb#368 sig { returns(Prism::Location) } def location; end - sig { returns(T::Boolean) } + # Returns the content of the comment by slicing it from the source code. + # + # source://prism//lib/prism/parse_result.rb#381 + sig { returns(String) } + def slice; end + + sig { abstract.returns(T::Boolean) } def trailing?; end end @@ -4664,909 +5648,924 @@ end # Prism.parse("1 + 2").value.accept(SExpressions.new) # # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]] # -# source://prism//lib/prism/compiler.rb#26 -class Prism::Compiler +# source://prism//lib/prism/compiler.rb#27 +class Prism::Compiler < ::Prism::Visitor # Visit an individual node. # - # source://prism//lib/prism/compiler.rb#28 + # source://prism//lib/prism/compiler.rb#29 + 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_alias_method_node(node); end # Visit a list of nodes. # - # source://prism//lib/prism/compiler.rb#33 + # source://prism//lib/prism/compiler.rb#34 + 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_and_node(node); end # Visit the child nodes of the given node. # Compile a ArgumentsNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_arguments_node(node); end # Visit the child nodes of the given node. # Compile a ArrayNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_array_node(node); end # Visit the child nodes of the given node. # Compile a ArrayPatternNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_assoc_node(node); end # Visit the child nodes of the given node. # Compile a AssocSplatNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_begin_node(node); end # Visit the child nodes of the given node. # Compile a BlockArgumentNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_block_node(node); end # Visit the child nodes of the given node. # Compile a BlockParameterNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_break_node(node); end # Visit the child nodes of the given node. # Compile a CallAndWriteNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_call_node(node); end # Visit the child nodes of the given node. # Compile a CallOperatorWriteNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_case_node(node); end # Visit the child nodes of the given node. # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 + 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_class_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_def_node(node); end # Visit the child nodes of the given node. # Compile a DefinedNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_defined_node(node); end # Visit the child nodes of the given node. # Compile a ElseNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_else_node(node); end # Visit the child nodes of the given node. # Compile a EmbeddedStatementsNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_ensure_node(node); end # Visit the child nodes of the given node. # Compile a FalseNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_false_node(node); end # Visit the child nodes of the given node. # Compile a FindPatternNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_float_node(node); end # Visit the child nodes of the given node. # Compile a ForNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_for_node(node); end # Visit the child nodes of the given node. # Compile a ForwardingArgumentsNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_hash_node(node); end # Visit the child nodes of the given node. # Compile a HashPatternNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_if_node(node); end # Visit the child nodes of the given node. # Compile a ImaginaryNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_imaginary_node(node); end # Visit the child nodes of the given node. # Compile a ImplicitNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_implicit_node(node); end # Visit the child nodes of the given node. # Compile a ImplicitRestNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_in_node(node); end # Visit the child nodes of the given node. # Compile a IndexAndWriteNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_integer_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_interpolated_x_string_node(node); end + # Visit the child nodes of the given node. + # Compile a ItParametersNode node + # + # source://prism//lib/prism/compiler.rb#39 + 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_lambda_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableAndWriteNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_missing_node(node); end # Visit the child nodes of the given node. # Compile a ModuleNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_module_node(node); end # Visit the child nodes of the given node. # Compile a MultiTargetNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_next_node(node); end # Visit the child nodes of the given node. # Compile a NilNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_nil_node(node); end # Visit the child nodes of the given node. # Compile a NoKeywordsParameterNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_or_node(node); end # Visit the child nodes of the given node. # Compile a ParametersNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_parameters_node(node); end # Visit the child nodes of the given node. # Compile a ParenthesesNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_parentheses_node(node); end # Visit the child nodes of the given node. # Compile a PinnedExpressionNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_program_node(node); end # Visit the child nodes of the given node. # Compile a RangeNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_range_node(node); end # Visit the child nodes of the given node. # Compile a RationalNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_rational_node(node); end # Visit the child nodes of the given node. # Compile a RedoNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_redo_node(node); end # Visit the child nodes of the given node. # Compile a RegularExpressionNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_rescue_node(node); end # Visit the child nodes of the given node. # Compile a RestParameterNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_retry_node(node); end # Visit the child nodes of the given node. # Compile a ReturnNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_return_node(node); end # Visit the child nodes of the given node. # Compile a SelfNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_self_node(node); end + # Visit the child nodes of the given node. + # Compile a ShareableConstantNode node + # + # source://prism//lib/prism/compiler.rb#39 + 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_splat_node(node); end # Visit the child nodes of the given node. # Compile a StatementsNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_statements_node(node); end # Visit the child nodes of the given node. # Compile a StringNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_string_node(node); end # Visit the child nodes of the given node. # Compile a SuperNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_super_node(node); end # Visit the child nodes of the given node. # Compile a SymbolNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_symbol_node(node); end # Visit the child nodes of the given node. # Compile a TrueNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_true_node(node); end # Visit the child nodes of the given node. # Compile a UndefNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_undef_node(node); end # Visit the child nodes of the given node. # Compile a UnlessNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_unless_node(node); end # Visit the child nodes of the given node. # Compile a UntilNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_until_node(node); end # Visit the child nodes of the given node. # Compile a WhenNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_when_node(node); end # Visit the child nodes of the given node. # Compile a WhileNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 def visit_while_node(node); end # Visit the child nodes of the given node. # Compile a XStringNode node # - # source://prism//lib/prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#39 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#38 + # source://prism//lib/prism/compiler.rb#39 def visit_yield_node(node); end end @@ -5575,89 +6574,115 @@ end # Target &&= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4530 +# source://prism//lib/prism/node.rb#4465 class Prism::ConstantAndWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4532 + # source://prism//lib/prism/node.rb#4467 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#4570 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4543 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4478 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4548 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4483 + 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#4558 + # source://prism//lib/prism/node.rb#4493 + 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#4553 + # source://prism//lib/prism/node.rb#4488 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantAndWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantAndWriteNode # - # source://prism//lib/prism/node.rb#4563 - sig { params(params: T.untyped).returns(Prism::ConstantAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4498 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ConstantAndWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4548 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4483 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4578 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4506 + 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#143 + # source://prism//lib/prism/desugar_compiler.rb#145 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4607 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4536 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4583 + # source://prism//lib/prism/node.rb#4511 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4586 + # source://prism//lib/prism/node.rb#4514 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4602 + # source://prism//lib/prism/node.rb#4531 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4592 + # source://prism//lib/prism/node.rb#4521 sig { returns(Prism::Location) } def operator_loc; end @@ -5676,12 +6701,13 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4631 + # source://prism//lib/prism/node.rb#4554 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4598 + # source://prism//lib/prism/node.rb#4528 sig { returns(Prism::Node) } def value; end @@ -5693,7 +6719,7 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4641 + # source://prism//lib/prism/node.rb#4564 def type; end end end @@ -5703,90 +6729,130 @@ end # Target += value # ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4650 +# source://prism//lib/prism/node.rb#4583 class Prism::ConstantOperatorWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4652 - def initialize(source, name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#4585 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, binary_operator_loc, value, binary_operator, location); 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#4687 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4664 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4597 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#4650 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#4640 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4669 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4602 + 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#4679 + # source://prism//lib/prism/node.rb#4612 + 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#4674 + # source://prism//lib/prism/node.rb#4607 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantOperatorWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ConstantOperatorWriteNode # - # source://prism//lib/prism/node.rb#4684 - sig { params(params: T.untyped).returns(Prism::ConstantOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4617 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).returns(Prism::ConstantOperatorWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4669 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4602 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#4700 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4625 + 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#155 + # source://prism//lib/prism/desugar_compiler.rb#157 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4727 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4653 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4705 + # source://prism//lib/prism/node.rb#4630 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4708 + # source://prism//lib/prism/node.rb#4633 sig { returns(Prism::Location) } def name_loc; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#4723 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#339 def operator; end - # attr_reader operator_loc: Location + # 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.rb#4714 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#346 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -5804,12 +6870,13 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4752 + # source://prism//lib/prism/node.rb#4671 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4720 + # source://prism//lib/prism/node.rb#4647 sig { returns(Prism::Node) } def value; end @@ -5821,7 +6888,7 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4762 + # source://prism//lib/prism/node.rb#4681 def type; end end end @@ -5831,89 +6898,115 @@ end # Target ||= value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4771 +# source://prism//lib/prism/node.rb#4701 class Prism::ConstantOrWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4773 + # source://prism//lib/prism/node.rb#4703 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#4806 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#4784 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4714 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4789 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4719 + 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#4799 + # source://prism//lib/prism/node.rb#4729 + 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#4794 + # source://prism//lib/prism/node.rb#4724 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantOrWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantOrWriteNode # - # source://prism//lib/prism/node.rb#4804 - sig { params(params: T.untyped).returns(Prism::ConstantOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4734 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ConstantOrWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4789 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4719 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4819 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4742 + 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#149 + # source://prism//lib/prism/desugar_compiler.rb#151 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4848 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4772 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#4824 + # source://prism//lib/prism/node.rb#4747 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#4827 + # source://prism//lib/prism/node.rb#4750 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4843 + # source://prism//lib/prism/node.rb#4767 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4833 + # source://prism//lib/prism/node.rb#4757 sig { returns(Prism::Location) } def operator_loc; end @@ -5932,12 +7025,13 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4872 + # source://prism//lib/prism/node.rb#4790 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4839 + # source://prism//lib/prism/node.rb#4764 sig { returns(Prism::Node) } def value; end @@ -5949,7 +7043,7 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4882 + # source://prism//lib/prism/node.rb#4800 def type; end end end @@ -5959,80 +7053,104 @@ end # Parent::Child &&= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#4891 +# source://prism//lib/prism/node.rb#4819 class Prism::ConstantPathAndWriteNode < ::Prism::Node - # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4893 + # source://prism//lib/prism/node.rb#4821 + sig do + params( + source: Prism::Source, + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, target, operator_loc, value, location); end - # def accept: (Visitor visitor) -> void + # 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#4903 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4916 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#4831 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4908 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4836 + 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#4918 + # source://prism//lib/prism/node.rb#4846 + 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#4913 + # source://prism//lib/prism/node.rb#4841 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathAndWriteNode + # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathAndWriteNode # - # source://prism//lib/prism/node.rb#4923 - sig { params(params: T.untyped).returns(Prism::ConstantPathAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4851 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ConstantPathAndWriteNode) + end + def copy(target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#4908 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4836 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#4937 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4859 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#4960 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#4882 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#4955 + # source://prism//lib/prism/node.rb#4877 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#4945 + # source://prism//lib/prism/node.rb#4867 sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#4942 + # source://prism//lib/prism/node.rb#4864 sig { returns(Prism::ConstantPathNode) } def target; end @@ -6051,12 +7169,13 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#4984 + # source://prism//lib/prism/node.rb#4900 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#4951 + # source://prism//lib/prism/node.rb#4874 sig { returns(Prism::Node) } def value; end @@ -6068,7 +7187,7 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#4994 + # source://prism//lib/prism/node.rb#4910 def type; end end end @@ -6078,97 +7197,159 @@ end # Foo::Bar # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#5003 +# source://prism//lib/prism/node.rb#4928 class Prism::ConstantPathNode < ::Prism::Node - # def initialize: (Node? parent, Node child, Location delimiter_loc, Location location) -> void + # def initialize: (Prism::node? parent, Symbol? name, Location delimiter_loc, Location name_loc, Location location) -> void # # @return [ConstantPathNode] a new instance of ConstantPathNode # - # source://prism//lib/prism/node.rb#5005 - def initialize(source, parent, child, delimiter_loc, location); end + # source://prism//lib/prism/node.rb#4930 + sig do + params( + source: Prism::Source, + parent: T.nilable(Prism::Node), + name: T.nilable(Symbol), + delimiter_loc: Prism::Location, + name_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, parent, name, delimiter_loc, name_loc, location); 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#5056 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5015 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#4941 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader child: Node + # Previously, we had a child node on this class that contained either a + # constant read or a missing node. To not cause a breaking change, we + # continue to supply that API. # - # source://prism//lib/prism/node.rb#5060 - sig { returns(Prism::Node) } + # source://prism//lib/prism/node_ext.rb#181 def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5020 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4946 + 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#5033 + # source://prism//lib/prism/node.rb#4958 + 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#5025 + # source://prism//lib/prism/node.rb#4951 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathNode + # def copy: (?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location, ?location: Location) -> ConstantPathNode # - # source://prism//lib/prism/node.rb#5038 - sig { params(params: T.untyped).returns(Prism::ConstantPathNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#4963 + sig do + params( + parent: T.nilable(Prism::Node), + name: T.nilable(Symbol), + delimiter_loc: Prism::Location, + name_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ConstantPathNode) + end + def copy(parent: T.unsafe(nil), name: T.unsafe(nil), delimiter_loc: T.unsafe(nil), name_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5020 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#4946 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Node?, child: Node, delimiter_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#5052 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#4971 + 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#5070 + # source://prism//lib/prism/node.rb#5017 sig { returns(String) } def delimiter; end - # attr_reader delimiter_loc: Location + # The location of the `::` delimiter. + # + # ::Foo + # ^^ # - # source://prism//lib/prism/node.rb#5063 + # One::Two + # ^^ + # + # source://prism//lib/prism/node.rb#4997 sig { returns(Prism::Location) } def delimiter_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//lib/prism/node_ext.rb#129 + # source://prism//lib/prism/node_ext.rb#174 + 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#112 + # source://prism//lib/prism/node_ext.rb#152 + sig { returns(T::Array[Symbol]) } def full_name_parts; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String + # + # source://prism//lib/prism/node.rb#5022 + 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#4988 + sig { returns(T.nilable(Symbol)) } + def name; end + + # The location of the name of the constant. + # + # ::Foo + # ^^^ # - # source://prism//lib/prism/node.rb#5075 - def inspect(inspector = T.unsafe(nil)); end + # One::Two + # ^^^ + # + # source://prism//lib/prism/node.rb#5010 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parent: Node? + # The left-hand node of the path, if present. It can be `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). It will be `nil` when the constant lookup is at the root of the module tree. # - # source://prism//lib/prism/node.rb#5057 + # Foo::Bar + # ^^^ + # + # self::Test + # ^^^^ + # + # a.b::C + # ^^^ + # + # source://prism//lib/prism/node.rb#4985 sig { returns(T.nilable(Prism::Node)) } def parent; end @@ -6187,7 +7368,8 @@ class Prism::ConstantPathNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5103 + # source://prism//lib/prism/node.rb#5040 + sig { override.returns(Symbol) } def type; end class << self @@ -6198,7 +7380,7 @@ class Prism::ConstantPathNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5113 + # source://prism//lib/prism/node.rb#5050 def type; end end end @@ -6210,88 +7392,133 @@ end # var::Bar::Baz -> raises because the first part of the constant path is a # local variable # -# source://prism//lib/prism/node_ext.rb#108 +# source://prism//lib/prism/node_ext.rb#143 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#148 +class Prism::ConstantPathNode::MissingNodesInConstantPathError < ::StandardError; end + # Represents assigning to a constant path using an operator that isn't `=`. # # Parent::Child += value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5122 +# source://prism//lib/prism/node.rb#5069 class Prism::ConstantPathOperatorWriteNode < ::Prism::Node - # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Symbol operator, Location location) -> void + # def initialize: (ConstantPathNode target, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5124 - def initialize(source, target, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#5071 + sig do + params( + source: Prism::Source, + target: Prism::ConstantPathNode, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).void + end + def initialize(source, target, binary_operator_loc, value, binary_operator, location); 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#5165 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5135 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5082 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#5128 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#5118 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5140 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5087 + 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#5150 + # source://prism//lib/prism/node.rb#5097 + 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#5145 + # source://prism//lib/prism/node.rb#5092 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathOperatorWriteNode + # def copy: (?target: ConstantPathNode, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> ConstantPathOperatorWriteNode # - # source://prism//lib/prism/node.rb#5155 - sig { params(params: T.untyped).returns(Prism::ConstantPathOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5102 + sig do + params( + target: Prism::ConstantPathNode, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).returns(Prism::ConstantPathOperatorWriteNode) + end + def copy(target: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5140 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5087 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, operator: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5170 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5110 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#5191 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5131 + sig { override.returns(String) } + def inspect; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#5187 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#355 def operator; end - # attr_reader operator_loc: Location + # 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.rb#5178 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#362 def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5175 + # source://prism//lib/prism/node.rb#5115 sig { returns(Prism::ConstantPathNode) } def target; end @@ -6310,12 +7537,13 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5216 + # source://prism//lib/prism/node.rb#5149 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5184 + # source://prism//lib/prism/node.rb#5125 sig { returns(Prism::Node) } def value; end @@ -6327,7 +7555,7 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5226 + # source://prism//lib/prism/node.rb#5159 def type; end end end @@ -6337,80 +7565,104 @@ end # Parent::Child ||= value # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5235 +# source://prism//lib/prism/node.rb#5178 class Prism::ConstantPathOrWriteNode < ::Prism::Node - # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5237 + # source://prism//lib/prism/node.rb#5180 + sig do + params( + source: Prism::Source, + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, target, operator_loc, value, location); 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#5275 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5247 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5190 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5252 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5195 + 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#5262 + # source://prism//lib/prism/node.rb#5205 + 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#5257 + # source://prism//lib/prism/node.rb#5200 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathOrWriteNode + # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathOrWriteNode # - # source://prism//lib/prism/node.rb#5267 - sig { params(params: T.untyped).returns(Prism::ConstantPathOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5210 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ConstantPathOrWriteNode) + end + def copy(target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5252 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5195 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#5281 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5218 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#5304 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5241 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5299 + # source://prism//lib/prism/node.rb#5236 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#5289 + # source://prism//lib/prism/node.rb#5226 sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//lib/prism/node.rb#5286 + # source://prism//lib/prism/node.rb#5223 sig { returns(Prism::ConstantPathNode) } def target; end @@ -6429,12 +7681,13 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5328 + # source://prism//lib/prism/node.rb#5259 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#5295 + # source://prism//lib/prism/node.rb#5233 sig { returns(Prism::Node) } def value; end @@ -6446,7 +7699,7 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5338 + # source://prism//lib/prism/node.rb#5269 def type; end end end @@ -6456,97 +7709,138 @@ end # Foo::Foo, Bar::Bar = baz # ^^^^^^^^ ^^^^^^^^ # -# source://prism//lib/prism/node.rb#5347 +# source://prism//lib/prism/node.rb#5287 class Prism::ConstantPathTargetNode < ::Prism::Node - # def initialize: (Node? parent, Node child, Location delimiter_loc, Location location) -> void + # def initialize: (Prism::node? parent, Symbol? name, Location delimiter_loc, Location name_loc, Location location) -> void # # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5349 - def initialize(source, parent, child, delimiter_loc, location); end + # source://prism//lib/prism/node.rb#5289 + sig do + params( + source: Prism::Source, + parent: T.nilable(Prism::Node), + name: T.nilable(Symbol), + delimiter_loc: Prism::Location, + name_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, parent, name, delimiter_loc, name_loc, location); 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#5394 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5359 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5300 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader child: Node + # Previously, we had a child node on this class that contained either a + # constant read or a missing node. To not cause a breaking change, we + # continue to supply that API. # - # source://prism//lib/prism/node.rb#5404 - sig { returns(Prism::Node) } + # source://prism//lib/prism/node_ext.rb#217 def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5364 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5305 + 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#5377 + # source://prism//lib/prism/node.rb#5317 + 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#5369 + # source://prism//lib/prism/node.rb#5310 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathTargetNode + # def copy: (?parent: Prism::node?, ?name: Symbol?, ?delimiter_loc: Location, ?name_loc: Location, ?location: Location) -> ConstantPathTargetNode # - # source://prism//lib/prism/node.rb#5382 - sig { params(params: T.untyped).returns(Prism::ConstantPathTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5322 + sig do + params( + parent: T.nilable(Prism::Node), + name: T.nilable(Symbol), + delimiter_loc: Prism::Location, + name_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ConstantPathTargetNode) + end + def copy(parent: T.unsafe(nil), name: T.unsafe(nil), delimiter_loc: T.unsafe(nil), name_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5364 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5305 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Node?, child: Node, delimiter_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Prism::node?, name: Symbol?, delimiter_loc: Location, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#5396 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5330 + 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#5414 + # source://prism//lib/prism/node.rb#5355 sig { returns(String) } def delimiter; end # attr_reader delimiter_loc: Location # - # source://prism//lib/prism/node.rb#5407 + # source://prism//lib/prism/node.rb#5341 sig { returns(Prism::Location) } def delimiter_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//lib/prism/node_ext.rb#152 + # source://prism//lib/prism/node_ext.rb#210 + 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#137 + # source://prism//lib/prism/node_ext.rb#190 + sig { returns(T::Array[Symbol]) } def full_name_parts; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String + # + # source://prism//lib/prism/node.rb#5360 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol? + # + # source://prism//lib/prism/node.rb#5338 + sig { returns(T.nilable(Symbol)) } + def name; end + + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5419 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5348 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parent: Node? + # attr_reader parent: Prism::node? # - # source://prism//lib/prism/node.rb#5401 + # source://prism//lib/prism/node.rb#5335 sig { returns(T.nilable(Prism::Node)) } def parent; end @@ -6565,7 +7859,8 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5447 + # source://prism//lib/prism/node.rb#5378 + sig { override.returns(Symbol) } def type; end class << self @@ -6576,7 +7871,7 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5457 + # source://prism//lib/prism/node.rb#5388 def type; end end end @@ -6592,80 +7887,113 @@ end # ::Foo::Bar = 1 # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5472 +# source://prism//lib/prism/node.rb#5413 class Prism::ConstantPathWriteNode < ::Prism::Node - # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Prism::node value, Location location) -> void # # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5474 + # source://prism//lib/prism/node.rb#5415 + sig do + params( + source: Prism::Source, + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, target, operator_loc, value, location); 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#5522 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5484 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5425 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5489 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5430 + 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#5499 + # source://prism//lib/prism/node.rb#5440 + 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#5494 + # source://prism//lib/prism/node.rb#5435 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantPathWriteNode + # def copy: (?target: ConstantPathNode, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> ConstantPathWriteNode # - # source://prism//lib/prism/node.rb#5504 - sig { params(params: T.untyped).returns(Prism::ConstantPathWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5445 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::ConstantPathWriteNode) + end + def copy(target: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5489 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5430 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#5518 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5453 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#5541 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5488 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5536 + # source://prism//lib/prism/node.rb#5483 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `=` operator. # - # source://prism//lib/prism/node.rb#5526 + # ::ABC = 123 + # ^ + # + # source://prism//lib/prism/node.rb#5470 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader target: ConstantPathNode + # A node representing the constant path being written to. + # + # Foo::Bar = 1 + # ^^^^^^^^ + # + # ::Foo = :abc + # ^^^^^ # - # source://prism//lib/prism/node.rb#5523 + # source://prism//lib/prism/node.rb#5464 sig { returns(Prism::ConstantPathNode) } def target; end @@ -6684,12 +8012,16 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5565 + # source://prism//lib/prism/node.rb#5506 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # The value to write to the constant path. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # + # FOO::BAR = :abc + # ^^^^ # - # source://prism//lib/prism/node.rb#5532 + # source://prism//lib/prism/node.rb#5480 sig { returns(Prism::Node) } def value; end @@ -6701,7 +8033,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5575 + # source://prism//lib/prism/node.rb#5516 def type; end end end @@ -6711,75 +8043,86 @@ end # Foo # ^^^ # -# source://prism//lib/prism/node.rb#5584 +# source://prism//lib/prism/node.rb#5534 class Prism::ConstantReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ConstantReadNode] a new instance of ConstantReadNode # - # source://prism//lib/prism/node.rb#5586 + # source://prism//lib/prism/node.rb#5536 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#5618 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5594 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5544 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5599 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5549 + 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#5609 + # source://prism//lib/prism/node.rb#5559 + 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#5604 + # source://prism//lib/prism/node.rb#5554 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantReadNode + # def copy: (?name: Symbol, ?location: Location) -> ConstantReadNode # - # source://prism//lib/prism/node.rb#5614 - sig { params(params: T.untyped).returns(Prism::ConstantReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5564 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::ConstantReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5599 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5549 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5626 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5572 + 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 + # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#96 + # source://prism//lib/prism/node_ext.rb#118 + 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#91 + # source://prism//lib/prism/node_ext.rb#113 + sig { returns(T::Array[Symbol]) } def full_name_parts; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#5639 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5584 + sig { override.returns(String) } + def inspect; end # The name of the [constant](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#constants). # @@ -6787,7 +8130,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # SOME_CONSTANT # name `:SOME_CONSTANT` # - # source://prism//lib/prism/node.rb#5635 + # source://prism//lib/prism/node.rb#5581 sig { returns(Symbol) } def name; end @@ -6806,7 +8149,8 @@ class Prism::ConstantReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5659 + # source://prism//lib/prism/node.rb#5602 + sig { override.returns(Symbol) } def type; end class << self @@ -6817,7 +8161,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5669 + # source://prism//lib/prism/node.rb#5612 def type; end end end @@ -6827,79 +8171,90 @@ end # Foo, Bar = baz # ^^^ ^^^ # -# source://prism//lib/prism/node.rb#5678 +# source://prism//lib/prism/node.rb#5628 class Prism::ConstantTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [ConstantTargetNode] a new instance of ConstantTargetNode # - # source://prism//lib/prism/node.rb#5680 + # source://prism//lib/prism/node.rb#5630 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#5708 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5688 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5638 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5693 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5643 + 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#5703 + # source://prism//lib/prism/node.rb#5653 + 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#5698 + # source://prism//lib/prism/node.rb#5648 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantTargetNode + # def copy: (?name: Symbol, ?location: Location) -> ConstantTargetNode # - # source://prism//lib/prism/node.rb#5708 - sig { params(params: T.untyped).returns(Prism::ConstantTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5658 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::ConstantTargetNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5693 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5643 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#5720 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5666 + 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 + # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node_ext.rb#165 + # source://prism//lib/prism/node_ext.rb#231 + 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#160 + # source://prism//lib/prism/node_ext.rb#226 + sig { returns(T::Array[Symbol]) } def full_name_parts; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#5729 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#5674 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5725 + # source://prism//lib/prism/node.rb#5671 sig { returns(Symbol) } def name; end @@ -6918,7 +8273,8 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5749 + # source://prism//lib/prism/node.rb#5692 + sig { override.returns(Symbol) } def type; end class << self @@ -6929,7 +8285,7 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5759 + # source://prism//lib/prism/node.rb#5702 def type; end end end @@ -6939,86 +8295,135 @@ end # Foo = 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#5768 +# source://prism//lib/prism/node.rb#5718 class Prism::ConstantWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [ConstantWriteNode] a new instance of ConstantWriteNode # - # source://prism//lib/prism/node.rb#5770 + # source://prism//lib/prism/node.rb#5720 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, value, operator_loc, location); 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#5839 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5781 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5731 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5786 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5736 + 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#5796 + # source://prism//lib/prism/node.rb#5746 + 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#5791 + # source://prism//lib/prism/node.rb#5741 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ConstantWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> ConstantWriteNode # - # source://prism//lib/prism/node.rb#5801 - sig { params(params: T.untyped).returns(Prism::ConstantWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5751 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ConstantWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5786 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5736 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#5816 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5759 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # Returns the full name of this constant. For example: "Foo" # - # source://prism//lib/prism/node.rb#5845 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node_ext.rb#131 + sig { returns(String) } + def full_name; end - # attr_reader name: Symbol + # Returns the list of parts for the full name of this constant. + # For example: [:Foo] # - # source://prism//lib/prism/node.rb#5821 + # source://prism//lib/prism/node_ext.rb#126 + sig { returns(T::Array[Symbol]) } + def full_name_parts; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#5805 + sig { override.returns(String) } + def inspect; end + + # The name of the [constant](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#constants). + # + # Foo = :bar # name `:Foo` + # + # XYZ = 1 # name `:XYZ` + # + # source://prism//lib/prism/node.rb#5768 sig { returns(Symbol) } def name; end - # attr_reader name_loc: Location + # The location of the constant name. + # + # FOO = 1 + # ^^^ # - # source://prism//lib/prism/node.rb#5824 + # source://prism//lib/prism/node.rb#5774 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#5840 + # source://prism//lib/prism/node.rb#5800 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `=` operator. + # + # FOO = :bar + # ^ # - # source://prism//lib/prism/node.rb#5833 + # source://prism//lib/prism/node.rb#5793 sig { returns(Prism::Location) } def operator_loc; end @@ -7037,12 +8442,19 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#5869 + # source://prism//lib/prism/node.rb#5823 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # The value to write to the constant. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/node.rb#5830 + # FOO = :bar + # ^^^^ + # + # MyClass = Class.new + # ^^^^^^^^^ + # + # source://prism//lib/prism/node.rb#5787 sig { returns(Prism::Node) } def value; end @@ -7054,22 +8466,21 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#5879 + # source://prism//lib/prism/node.rb#5833 def type; end end end -class Prism::DATAComment < Prism::Comment; 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: # -# source = Prism::Source.new("[1]") +# source = Prism::Source.for("[1]") # # Prism::ArrayNode.new( # [ # Prism::IntegerNode.new( # Prism::IntegerBaseFlags::DECIMAL, +# 1, # Prism::Location.new(source, 1, 1), # source # ) @@ -7081,10 +8492,10 @@ class Prism::DATAComment < Prism::Comment; end # # you could instead write: # -# source = Prism::Source.new("[1]") +# source = Prism::Source.for("[1]") # # ArrayNode( -# IntegerNode(Prism::IntegerBaseFlags::DECIMAL, Location(source, 1, 1)), source), +# IntegerNode(Prism::IntegerBaseFlags::DECIMAL, 1, Location(source, 1, 1)), source), # Location(source, 0, 1), # Location(source, 2, 1), # source @@ -7093,753 +8504,763 @@ class Prism::DATAComment < Prism::Comment; end # This is mostly helpful in the context of writing tests, but can also be used # to generate trees programmatically. # -# source://prism//lib/prism/dsl.rb#40 +# source://prism//lib/prism/dsl.rb#42 module Prism::DSL private # Create a new AliasGlobalVariableNode node # - # source://prism//lib/prism/dsl.rb#49 + # source://prism//lib/prism/dsl.rb#51 def AliasGlobalVariableNode(new_name, old_name, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new AliasMethodNode node # - # source://prism//lib/prism/dsl.rb#54 + # source://prism//lib/prism/dsl.rb#56 def AliasMethodNode(new_name, old_name, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new AlternationPatternNode node # - # source://prism//lib/prism/dsl.rb#59 + # source://prism//lib/prism/dsl.rb#61 def AlternationPatternNode(left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new AndNode node # - # source://prism//lib/prism/dsl.rb#64 + # source://prism//lib/prism/dsl.rb#66 def AndNode(left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ArgumentsNode node # - # source://prism//lib/prism/dsl.rb#69 + # source://prism//lib/prism/dsl.rb#71 def ArgumentsNode(flags, arguments, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ArrayNode node # - # source://prism//lib/prism/dsl.rb#74 + # source://prism//lib/prism/dsl.rb#76 def ArrayNode(flags, elements, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ArrayPatternNode node # - # source://prism//lib/prism/dsl.rb#79 + # source://prism//lib/prism/dsl.rb#81 def ArrayPatternNode(constant, requireds, rest, posts, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new AssocNode node # - # source://prism//lib/prism/dsl.rb#84 + # source://prism//lib/prism/dsl.rb#86 def AssocNode(key, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new AssocSplatNode node # - # source://prism//lib/prism/dsl.rb#89 + # source://prism//lib/prism/dsl.rb#91 def AssocSplatNode(value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BackReferenceReadNode node # - # source://prism//lib/prism/dsl.rb#94 + # source://prism//lib/prism/dsl.rb#96 def BackReferenceReadNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BeginNode node # - # source://prism//lib/prism/dsl.rb#99 + # source://prism//lib/prism/dsl.rb#101 def BeginNode(begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BlockArgumentNode node # - # source://prism//lib/prism/dsl.rb#104 + # source://prism//lib/prism/dsl.rb#106 def BlockArgumentNode(expression, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BlockLocalVariableNode node # - # source://prism//lib/prism/dsl.rb#109 + # source://prism//lib/prism/dsl.rb#111 def BlockLocalVariableNode(flags, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BlockNode node # - # source://prism//lib/prism/dsl.rb#114 + # source://prism//lib/prism/dsl.rb#116 def BlockNode(locals, parameters, body, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BlockParameterNode node # - # source://prism//lib/prism/dsl.rb#119 + # source://prism//lib/prism/dsl.rb#121 def BlockParameterNode(flags, name, name_loc, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BlockParametersNode node # - # source://prism//lib/prism/dsl.rb#124 + # source://prism//lib/prism/dsl.rb#126 def BlockParametersNode(parameters, locals, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new BreakNode node # - # source://prism//lib/prism/dsl.rb#129 + # source://prism//lib/prism/dsl.rb#131 def BreakNode(arguments, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CallAndWriteNode node # - # source://prism//lib/prism/dsl.rb#134 + # source://prism//lib/prism/dsl.rb#136 def CallAndWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CallNode node # - # source://prism//lib/prism/dsl.rb#139 + # source://prism//lib/prism/dsl.rb#141 def CallNode(flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CallOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#144 - def CallOperatorWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#146 + def CallOperatorWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, binary_operator, binary_operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CallOrWriteNode node # - # source://prism//lib/prism/dsl.rb#149 + # source://prism//lib/prism/dsl.rb#151 def CallOrWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CallTargetNode node # - # source://prism//lib/prism/dsl.rb#154 + # source://prism//lib/prism/dsl.rb#156 def CallTargetNode(flags, receiver, call_operator_loc, name, message_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CapturePatternNode node # - # source://prism//lib/prism/dsl.rb#159 + # source://prism//lib/prism/dsl.rb#161 def CapturePatternNode(value, target, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CaseMatchNode node # - # source://prism//lib/prism/dsl.rb#164 + # source://prism//lib/prism/dsl.rb#166 def CaseMatchNode(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new CaseNode node # - # source://prism//lib/prism/dsl.rb#169 + # source://prism//lib/prism/dsl.rb#171 def CaseNode(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassNode node # - # source://prism//lib/prism/dsl.rb#174 + # source://prism//lib/prism/dsl.rb#176 def ClassNode(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableAndWriteNode node # - # source://prism//lib/prism/dsl.rb#179 + # source://prism//lib/prism/dsl.rb#181 def ClassVariableAndWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#184 - def ClassVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#186 + def ClassVariableOperatorWriteNode(name, name_loc, binary_operator_loc, value, binary_operator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableOrWriteNode node # - # source://prism//lib/prism/dsl.rb#189 + # source://prism//lib/prism/dsl.rb#191 def ClassVariableOrWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableReadNode node # - # source://prism//lib/prism/dsl.rb#194 + # source://prism//lib/prism/dsl.rb#196 def ClassVariableReadNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableTargetNode node # - # source://prism//lib/prism/dsl.rb#199 + # source://prism//lib/prism/dsl.rb#201 def ClassVariableTargetNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ClassVariableWriteNode node # - # source://prism//lib/prism/dsl.rb#204 + # source://prism//lib/prism/dsl.rb#206 def ClassVariableWriteNode(name, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantAndWriteNode node # - # source://prism//lib/prism/dsl.rb#209 + # source://prism//lib/prism/dsl.rb#211 def ConstantAndWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#214 - def ConstantOperatorWriteNode(name, name_loc, operator_loc, value, operator, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#216 + def ConstantOperatorWriteNode(name, name_loc, binary_operator_loc, value, binary_operator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantOrWriteNode node # - # source://prism//lib/prism/dsl.rb#219 + # source://prism//lib/prism/dsl.rb#221 def ConstantOrWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathAndWriteNode node # - # source://prism//lib/prism/dsl.rb#224 + # source://prism//lib/prism/dsl.rb#226 def ConstantPathAndWriteNode(target, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathNode node # - # source://prism//lib/prism/dsl.rb#229 - def ConstantPathNode(parent, child, delimiter_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#231 + def ConstantPathNode(parent, name, delimiter_loc, name_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#234 - def ConstantPathOperatorWriteNode(target, operator_loc, value, operator, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#236 + def ConstantPathOperatorWriteNode(target, binary_operator_loc, value, binary_operator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathOrWriteNode node # - # source://prism//lib/prism/dsl.rb#239 + # source://prism//lib/prism/dsl.rb#241 def ConstantPathOrWriteNode(target, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathTargetNode node # - # source://prism//lib/prism/dsl.rb#244 - def ConstantPathTargetNode(parent, child, delimiter_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#246 + def ConstantPathTargetNode(parent, name, delimiter_loc, name_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantPathWriteNode node # - # source://prism//lib/prism/dsl.rb#249 + # source://prism//lib/prism/dsl.rb#251 def ConstantPathWriteNode(target, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantReadNode node # - # source://prism//lib/prism/dsl.rb#254 + # source://prism//lib/prism/dsl.rb#256 def ConstantReadNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantTargetNode node # - # source://prism//lib/prism/dsl.rb#259 + # source://prism//lib/prism/dsl.rb#261 def ConstantTargetNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ConstantWriteNode node # - # source://prism//lib/prism/dsl.rb#264 + # source://prism//lib/prism/dsl.rb#266 def ConstantWriteNode(name, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new DefNode node # - # source://prism//lib/prism/dsl.rb#269 + # source://prism//lib/prism/dsl.rb#271 def DefNode(name, name_loc, receiver, parameters, body, locals, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new DefinedNode node # - # source://prism//lib/prism/dsl.rb#274 + # source://prism//lib/prism/dsl.rb#276 def DefinedNode(lparen_loc, value, rparen_loc, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ElseNode node # - # source://prism//lib/prism/dsl.rb#279 + # source://prism//lib/prism/dsl.rb#281 def ElseNode(else_keyword_loc, statements, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new EmbeddedStatementsNode node # - # source://prism//lib/prism/dsl.rb#284 + # source://prism//lib/prism/dsl.rb#286 def EmbeddedStatementsNode(opening_loc, statements, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new EmbeddedVariableNode node # - # source://prism//lib/prism/dsl.rb#289 + # source://prism//lib/prism/dsl.rb#291 def EmbeddedVariableNode(operator_loc, variable, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new EnsureNode node # - # source://prism//lib/prism/dsl.rb#294 + # source://prism//lib/prism/dsl.rb#296 def EnsureNode(ensure_keyword_loc, statements, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new FalseNode node # - # source://prism//lib/prism/dsl.rb#299 + # source://prism//lib/prism/dsl.rb#301 def FalseNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new FindPatternNode node # - # source://prism//lib/prism/dsl.rb#304 + # source://prism//lib/prism/dsl.rb#306 def FindPatternNode(constant, left, requireds, right, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new FlipFlopNode node # - # source://prism//lib/prism/dsl.rb#309 + # source://prism//lib/prism/dsl.rb#311 def FlipFlopNode(flags, left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new FloatNode node # - # source://prism//lib/prism/dsl.rb#314 - def FloatNode(source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#316 + def FloatNode(value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ForNode node # - # source://prism//lib/prism/dsl.rb#319 + # source://prism//lib/prism/dsl.rb#321 def ForNode(index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ForwardingArgumentsNode node # - # source://prism//lib/prism/dsl.rb#324 + # source://prism//lib/prism/dsl.rb#326 def ForwardingArgumentsNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ForwardingParameterNode node # - # source://prism//lib/prism/dsl.rb#329 + # source://prism//lib/prism/dsl.rb#331 def ForwardingParameterNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ForwardingSuperNode node # - # source://prism//lib/prism/dsl.rb#334 + # source://prism//lib/prism/dsl.rb#336 def ForwardingSuperNode(block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableAndWriteNode node # - # source://prism//lib/prism/dsl.rb#339 + # source://prism//lib/prism/dsl.rb#341 def GlobalVariableAndWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#344 - def GlobalVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#346 + def GlobalVariableOperatorWriteNode(name, name_loc, binary_operator_loc, value, binary_operator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableOrWriteNode node # - # source://prism//lib/prism/dsl.rb#349 + # source://prism//lib/prism/dsl.rb#351 def GlobalVariableOrWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableReadNode node # - # source://prism//lib/prism/dsl.rb#354 + # source://prism//lib/prism/dsl.rb#356 def GlobalVariableReadNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableTargetNode node # - # source://prism//lib/prism/dsl.rb#359 + # source://prism//lib/prism/dsl.rb#361 def GlobalVariableTargetNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new GlobalVariableWriteNode node # - # source://prism//lib/prism/dsl.rb#364 + # source://prism//lib/prism/dsl.rb#366 def GlobalVariableWriteNode(name, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new HashNode node # - # source://prism//lib/prism/dsl.rb#369 + # source://prism//lib/prism/dsl.rb#371 def HashNode(opening_loc, elements, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new HashPatternNode node # - # source://prism//lib/prism/dsl.rb#374 + # source://prism//lib/prism/dsl.rb#376 def HashPatternNode(constant, elements, rest, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IfNode node # - # source://prism//lib/prism/dsl.rb#379 + # source://prism//lib/prism/dsl.rb#381 def IfNode(if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ImaginaryNode node # - # source://prism//lib/prism/dsl.rb#384 + # source://prism//lib/prism/dsl.rb#386 def ImaginaryNode(numeric, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ImplicitNode node # - # source://prism//lib/prism/dsl.rb#389 + # source://prism//lib/prism/dsl.rb#391 def ImplicitNode(value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ImplicitRestNode node # - # source://prism//lib/prism/dsl.rb#394 + # source://prism//lib/prism/dsl.rb#396 def ImplicitRestNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InNode node # - # source://prism//lib/prism/dsl.rb#399 + # source://prism//lib/prism/dsl.rb#401 def InNode(pattern, statements, in_loc, then_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IndexAndWriteNode node # - # source://prism//lib/prism/dsl.rb#404 + # source://prism//lib/prism/dsl.rb#406 def IndexAndWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IndexOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#409 - def IndexOperatorWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#411 + def IndexOperatorWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, binary_operator, binary_operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IndexOrWriteNode node # - # source://prism//lib/prism/dsl.rb#414 + # source://prism//lib/prism/dsl.rb#416 def IndexOrWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IndexTargetNode node # - # source://prism//lib/prism/dsl.rb#419 + # source://prism//lib/prism/dsl.rb#421 def IndexTargetNode(flags, receiver, opening_loc, arguments, closing_loc, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableAndWriteNode node # - # source://prism//lib/prism/dsl.rb#424 + # source://prism//lib/prism/dsl.rb#426 def InstanceVariableAndWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#429 - def InstanceVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#431 + def InstanceVariableOperatorWriteNode(name, name_loc, binary_operator_loc, value, binary_operator, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableOrWriteNode node # - # source://prism//lib/prism/dsl.rb#434 + # source://prism//lib/prism/dsl.rb#436 def InstanceVariableOrWriteNode(name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableReadNode node # - # source://prism//lib/prism/dsl.rb#439 + # source://prism//lib/prism/dsl.rb#441 def InstanceVariableReadNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableTargetNode node # - # source://prism//lib/prism/dsl.rb#444 + # source://prism//lib/prism/dsl.rb#446 def InstanceVariableTargetNode(name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InstanceVariableWriteNode node # - # source://prism//lib/prism/dsl.rb#449 + # source://prism//lib/prism/dsl.rb#451 def InstanceVariableWriteNode(name, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new IntegerNode node # - # source://prism//lib/prism/dsl.rb#454 - def IntegerNode(flags, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#456 + def IntegerNode(flags, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/dsl.rb#459 + # source://prism//lib/prism/dsl.rb#461 def InterpolatedMatchLastLineNode(flags, opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InterpolatedRegularExpressionNode node # - # source://prism//lib/prism/dsl.rb#464 + # source://prism//lib/prism/dsl.rb#466 def InterpolatedRegularExpressionNode(flags, opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InterpolatedStringNode node # - # source://prism//lib/prism/dsl.rb#469 - def InterpolatedStringNode(opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#471 + def InterpolatedStringNode(flags, opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InterpolatedSymbolNode node # - # source://prism//lib/prism/dsl.rb#474 + # source://prism//lib/prism/dsl.rb#476 def InterpolatedSymbolNode(opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new InterpolatedXStringNode node # - # source://prism//lib/prism/dsl.rb#479 + # source://prism//lib/prism/dsl.rb#481 def InterpolatedXStringNode(opening_loc, parts, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end + # Create a new ItParametersNode node + # + # source://prism//lib/prism/dsl.rb#486 + def ItParametersNode(source = T.unsafe(nil), location = T.unsafe(nil)); end + # Create a new KeywordHashNode node # - # source://prism//lib/prism/dsl.rb#484 + # source://prism//lib/prism/dsl.rb#491 def KeywordHashNode(flags, elements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new KeywordRestParameterNode node # - # source://prism//lib/prism/dsl.rb#489 + # source://prism//lib/prism/dsl.rb#496 def KeywordRestParameterNode(flags, name, name_loc, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LambdaNode node # - # source://prism//lib/prism/dsl.rb#494 + # source://prism//lib/prism/dsl.rb#501 def LambdaNode(locals, operator_loc, opening_loc, closing_loc, parameters, body, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableAndWriteNode node # - # source://prism//lib/prism/dsl.rb#499 + # source://prism//lib/prism/dsl.rb#506 def LocalVariableAndWriteNode(name_loc, operator_loc, value, name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableOperatorWriteNode node # - # source://prism//lib/prism/dsl.rb#504 - def LocalVariableOperatorWriteNode(name_loc, operator_loc, value, name, operator, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#511 + def LocalVariableOperatorWriteNode(name_loc, binary_operator_loc, value, name, binary_operator, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableOrWriteNode node # - # source://prism//lib/prism/dsl.rb#509 + # source://prism//lib/prism/dsl.rb#516 def LocalVariableOrWriteNode(name_loc, operator_loc, value, name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableReadNode node # - # source://prism//lib/prism/dsl.rb#514 + # source://prism//lib/prism/dsl.rb#521 def LocalVariableReadNode(name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableTargetNode node # - # source://prism//lib/prism/dsl.rb#519 + # source://prism//lib/prism/dsl.rb#526 def LocalVariableTargetNode(name, depth, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new LocalVariableWriteNode node # - # source://prism//lib/prism/dsl.rb#524 + # source://prism//lib/prism/dsl.rb#531 def LocalVariableWriteNode(name, depth, name_loc, value, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new Location object # - # source://prism//lib/prism/dsl.rb#44 + # source://prism//lib/prism/dsl.rb#46 def Location(source = T.unsafe(nil), start_offset = T.unsafe(nil), length = T.unsafe(nil)); end # Create a new MatchLastLineNode node # - # source://prism//lib/prism/dsl.rb#529 + # source://prism//lib/prism/dsl.rb#536 def MatchLastLineNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchPredicateNode node # - # source://prism//lib/prism/dsl.rb#534 + # source://prism//lib/prism/dsl.rb#541 def MatchPredicateNode(value, pattern, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchRequiredNode node # - # source://prism//lib/prism/dsl.rb#539 + # source://prism//lib/prism/dsl.rb#546 def MatchRequiredNode(value, pattern, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MatchWriteNode node # - # source://prism//lib/prism/dsl.rb#544 + # source://prism//lib/prism/dsl.rb#551 def MatchWriteNode(call, targets, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MissingNode node # - # source://prism//lib/prism/dsl.rb#549 + # source://prism//lib/prism/dsl.rb#556 def MissingNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ModuleNode node # - # source://prism//lib/prism/dsl.rb#554 + # source://prism//lib/prism/dsl.rb#561 def ModuleNode(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MultiTargetNode node # - # source://prism//lib/prism/dsl.rb#559 + # source://prism//lib/prism/dsl.rb#566 def MultiTargetNode(lefts, rest, rights, lparen_loc, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new MultiWriteNode node # - # source://prism//lib/prism/dsl.rb#564 + # source://prism//lib/prism/dsl.rb#571 def MultiWriteNode(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NextNode node # - # source://prism//lib/prism/dsl.rb#569 + # source://prism//lib/prism/dsl.rb#576 def NextNode(arguments, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NilNode node # - # source://prism//lib/prism/dsl.rb#574 + # source://prism//lib/prism/dsl.rb#581 def NilNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NoKeywordsParameterNode node # - # source://prism//lib/prism/dsl.rb#579 + # source://prism//lib/prism/dsl.rb#586 def NoKeywordsParameterNode(operator_loc, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NumberedParametersNode node # - # source://prism//lib/prism/dsl.rb#584 + # source://prism//lib/prism/dsl.rb#591 def NumberedParametersNode(maximum, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new NumberedReferenceReadNode node # - # source://prism//lib/prism/dsl.rb#589 + # source://prism//lib/prism/dsl.rb#596 def NumberedReferenceReadNode(number, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OptionalKeywordParameterNode node # - # source://prism//lib/prism/dsl.rb#594 + # source://prism//lib/prism/dsl.rb#601 def OptionalKeywordParameterNode(flags, name, name_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OptionalParameterNode node # - # source://prism//lib/prism/dsl.rb#599 + # source://prism//lib/prism/dsl.rb#606 def OptionalParameterNode(flags, name, name_loc, operator_loc, value, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new OrNode node # - # source://prism//lib/prism/dsl.rb#604 + # source://prism//lib/prism/dsl.rb#611 def OrNode(left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ParametersNode node # - # source://prism//lib/prism/dsl.rb#609 + # source://prism//lib/prism/dsl.rb#616 def ParametersNode(requireds, optionals, rest, posts, keywords, keyword_rest, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ParenthesesNode node # - # source://prism//lib/prism/dsl.rb#614 + # source://prism//lib/prism/dsl.rb#621 def ParenthesesNode(body, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PinnedExpressionNode node # - # source://prism//lib/prism/dsl.rb#619 + # source://prism//lib/prism/dsl.rb#626 def PinnedExpressionNode(expression, operator_loc, lparen_loc, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PinnedVariableNode node # - # source://prism//lib/prism/dsl.rb#624 + # source://prism//lib/prism/dsl.rb#631 def PinnedVariableNode(variable, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PostExecutionNode node # - # source://prism//lib/prism/dsl.rb#629 + # source://prism//lib/prism/dsl.rb#636 def PostExecutionNode(statements, keyword_loc, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new PreExecutionNode node # - # source://prism//lib/prism/dsl.rb#634 + # source://prism//lib/prism/dsl.rb#641 def PreExecutionNode(statements, keyword_loc, opening_loc, closing_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ProgramNode node # - # source://prism//lib/prism/dsl.rb#639 + # source://prism//lib/prism/dsl.rb#646 def ProgramNode(locals, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RangeNode node # - # source://prism//lib/prism/dsl.rb#644 + # source://prism//lib/prism/dsl.rb#651 def RangeNode(flags, left, right, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RationalNode node # - # source://prism//lib/prism/dsl.rb#649 + # source://prism//lib/prism/dsl.rb#656 def RationalNode(numeric, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RedoNode node # - # source://prism//lib/prism/dsl.rb#654 + # source://prism//lib/prism/dsl.rb#661 def RedoNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RegularExpressionNode node # - # source://prism//lib/prism/dsl.rb#659 + # source://prism//lib/prism/dsl.rb#666 def RegularExpressionNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RequiredKeywordParameterNode node # - # source://prism//lib/prism/dsl.rb#664 + # source://prism//lib/prism/dsl.rb#671 def RequiredKeywordParameterNode(flags, name, name_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RequiredParameterNode node # - # source://prism//lib/prism/dsl.rb#669 + # source://prism//lib/prism/dsl.rb#676 def RequiredParameterNode(flags, name, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RescueModifierNode node # - # source://prism//lib/prism/dsl.rb#674 + # source://prism//lib/prism/dsl.rb#681 def RescueModifierNode(expression, keyword_loc, rescue_expression, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RescueNode node # - # source://prism//lib/prism/dsl.rb#679 + # source://prism//lib/prism/dsl.rb#686 def RescueNode(keyword_loc, exceptions, operator_loc, reference, statements, consequent, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RestParameterNode node # - # source://prism//lib/prism/dsl.rb#684 + # source://prism//lib/prism/dsl.rb#691 def RestParameterNode(flags, name, name_loc, operator_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new RetryNode node # - # source://prism//lib/prism/dsl.rb#689 + # source://prism//lib/prism/dsl.rb#696 def RetryNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new ReturnNode node # - # source://prism//lib/prism/dsl.rb#694 - def ReturnNode(keyword_loc, arguments, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#701 + def ReturnNode(flags, keyword_loc, arguments, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SelfNode node # - # source://prism//lib/prism/dsl.rb#699 + # source://prism//lib/prism/dsl.rb#706 def SelfNode(source = T.unsafe(nil), location = T.unsafe(nil)); end + # Create a new ShareableConstantNode node + # + # source://prism//lib/prism/dsl.rb#711 + def ShareableConstantNode(flags, write, source = T.unsafe(nil), location = T.unsafe(nil)); end + # Create a new SingletonClassNode node # - # source://prism//lib/prism/dsl.rb#704 + # source://prism//lib/prism/dsl.rb#716 def SingletonClassNode(locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceEncodingNode node # - # source://prism//lib/prism/dsl.rb#709 + # source://prism//lib/prism/dsl.rb#721 def SourceEncodingNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceFileNode node # - # source://prism//lib/prism/dsl.rb#714 - def SourceFileNode(filepath, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#726 + def SourceFileNode(flags, filepath, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SourceLineNode node # - # source://prism//lib/prism/dsl.rb#719 + # source://prism//lib/prism/dsl.rb#731 def SourceLineNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SplatNode node # - # source://prism//lib/prism/dsl.rb#724 + # source://prism//lib/prism/dsl.rb#736 def SplatNode(operator_loc, expression, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new StatementsNode node # - # source://prism//lib/prism/dsl.rb#729 + # source://prism//lib/prism/dsl.rb#741 def StatementsNode(body, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new StringNode node # - # source://prism//lib/prism/dsl.rb#734 + # source://prism//lib/prism/dsl.rb#746 def StringNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SuperNode node # - # source://prism//lib/prism/dsl.rb#739 + # source://prism//lib/prism/dsl.rb#751 def SuperNode(keyword_loc, lparen_loc, arguments, rparen_loc, block, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new SymbolNode node # - # source://prism//lib/prism/dsl.rb#744 + # source://prism//lib/prism/dsl.rb#756 def SymbolNode(flags, opening_loc, value_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new TrueNode node # - # source://prism//lib/prism/dsl.rb#749 + # source://prism//lib/prism/dsl.rb#761 def TrueNode(source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UndefNode node # - # source://prism//lib/prism/dsl.rb#754 + # source://prism//lib/prism/dsl.rb#766 def UndefNode(names, keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UnlessNode node # - # source://prism//lib/prism/dsl.rb#759 + # source://prism//lib/prism/dsl.rb#771 def UnlessNode(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new UntilNode node # - # source://prism//lib/prism/dsl.rb#764 + # source://prism//lib/prism/dsl.rb#776 def UntilNode(flags, keyword_loc, closing_loc, predicate, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new WhenNode node # - # source://prism//lib/prism/dsl.rb#769 - def WhenNode(keyword_loc, conditions, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#781 + def WhenNode(keyword_loc, conditions, then_keyword_loc, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new WhileNode node # - # source://prism//lib/prism/dsl.rb#774 + # source://prism//lib/prism/dsl.rb#786 def WhileNode(flags, keyword_loc, closing_loc, predicate, statements, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new XStringNode node # - # source://prism//lib/prism/dsl.rb#779 + # source://prism//lib/prism/dsl.rb#791 def XStringNode(flags, opening_loc, content_loc, closing_loc, unescaped, source = T.unsafe(nil), location = T.unsafe(nil)); end # Create a new YieldNode node # - # source://prism//lib/prism/dsl.rb#784 + # source://prism//lib/prism/dsl.rb#796 def YieldNode(keyword_loc, lparen_loc, arguments, rparen_loc, source = T.unsafe(nil), location = T.unsafe(nil)); end end @@ -7860,6 +9281,7 @@ module Prism::Debug def format_errors(_arg0, _arg1); end def inspect_node(_arg0); end + def integer_parse(_arg0); end def memsize(_arg0); end def named_captures(_arg0); end @@ -7882,6 +9304,7 @@ module Prism::Debug def prism_locals(source); end def profile_file(_arg0); end + def static_inspect(*_arg0); end end end @@ -7893,6 +9316,70 @@ end # source://prism//lib/prism/debug.rb#90 Prism::Debug::AnonymousLocal = T.let(T.unsafe(nil), Object) +# A wrapping around prism's internal encoding data structures. This is used +# for reflection and debugging purposes. +# +# source://prism//lib/prism/debug.rb#208 +class Prism::Debug::Encoding + # Initialize a new encoding with the given name and whether or not it is + # a multibyte encoding. + # + # @return [Encoding] a new instance of Encoding + # + # source://prism//lib/prism/debug.rb#214 + def initialize(name, multibyte); end + + # Returns true if the first character in the source string is a valid + # alphanumeric character for the encoding. + # + # @return [Boolean] + # + # source://prism//lib/prism/debug.rb#232 + def alnum?(source); end + + # Returns true if the first character in the source string is a valid + # alphabetic character for the encoding. + # + # @return [Boolean] + # + # source://prism//lib/prism/debug.rb#238 + def alpha?(source); end + + # Whether or not the encoding is a multibyte encoding. + # + # @return [Boolean] + # + # source://prism//lib/prism/debug.rb#220 + def multibyte?; end + + # The name of the encoding, that can be passed to Encoding.find. + # + # source://prism//lib/prism/debug.rb#210 + def name; end + + # Returns true if the first character in the source string is a valid + # uppercase character for the encoding. + # + # @return [Boolean] + # + # source://prism//lib/prism/debug.rb#244 + def upper?(source); end + + # Returns the number of bytes of the first character in the source string, + # if it is valid for the encoding. Otherwise, returns 0. + # + # source://prism//lib/prism/debug.rb#226 + def width(source); end + + class << self + def _alnum?(_arg0, _arg1); end + def _alpha?(_arg0, _arg1); end + def _upper?(_arg0, _arg1); end + def _width(_arg0, _arg1); end + def all; end + end +end + # A wrapper around a RubyVM::InstructionSequence that provides a more # convenient interface for accessing parts of the iseq. # @@ -7925,170 +9412,212 @@ end # end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#5889 +# source://prism//lib/prism/node.rb#5853 class Prism::DefNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Node? receiver, ParametersNode? parameters, Node? body, Array[Symbol] locals, Location def_keyword_loc, Location? operator_loc, Location? lparen_loc, Location? rparen_loc, Location? equal_loc, Location? end_keyword_loc, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Prism::node? receiver, ParametersNode? parameters, Prism::node? body, Array[Symbol] locals, Location def_keyword_loc, Location? operator_loc, Location? lparen_loc, Location? rparen_loc, Location? equal_loc, Location? end_keyword_loc, Location location) -> void # # @return [DefNode] a new instance of DefNode # - # source://prism//lib/prism/node.rb#5891 + # source://prism//lib/prism/node.rb#5855 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + receiver: T.nilable(Prism::Node), + parameters: T.nilable(Prism::ParametersNode), + body: T.nilable(Prism::Node), + locals: T::Array[Symbol], + def_keyword_loc: Prism::Location, + operator_loc: T.nilable(Prism::Location), + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + equal_loc: T.nilable(Prism::Location), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, name, name_loc, receiver, parameters, body, locals, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, location); 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#6069 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#5910 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#5874 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: Node? + # attr_reader body: Prism::node? # - # source://prism//lib/prism/node.rb#5977 + # source://prism//lib/prism/node.rb#5927 sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5915 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5879 + 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#5929 + # source://prism//lib/prism/node.rb#5893 + 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#5920 + # source://prism//lib/prism/node.rb#5884 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> DefNode + # def copy: (?name: Symbol, ?name_loc: Location, ?receiver: Prism::node?, ?parameters: ParametersNode?, ?body: Prism::node?, ?locals: Array[Symbol], ?def_keyword_loc: Location, ?operator_loc: Location?, ?lparen_loc: Location?, ?rparen_loc: Location?, ?equal_loc: Location?, ?end_keyword_loc: Location?, ?location: Location) -> DefNode # - # source://prism//lib/prism/node.rb#5934 - sig { params(params: T.untyped).returns(Prism::DefNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#5898 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + receiver: T.nilable(Prism::Node), + parameters: T.nilable(Prism::ParametersNode), + body: T.nilable(Prism::Node), + locals: T::Array[Symbol], + def_keyword_loc: Prism::Location, + operator_loc: T.nilable(Prism::Location), + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + equal_loc: T.nilable(Prism::Location), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::DefNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#5915 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#5879 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, receiver: Node?, parameters: ParametersNode?, body: Node?, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, receiver: Prism::node?, parameters: ParametersNode?, body: Prism::node?, locals: Array[Symbol], def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#5957 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#5906 + 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#6050 + # source://prism//lib/prism/node.rb#6005 sig { returns(String) } def def_keyword; end # attr_reader def_keyword_loc: Location # - # source://prism//lib/prism/node.rb#5983 + # source://prism//lib/prism/node.rb#5933 sig { returns(Prism::Location) } def def_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6075 + # source://prism//lib/prism/node.rb#6030 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#6037 + # source://prism//lib/prism/node.rb#5992 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # def equal: () -> String? # - # source://prism//lib/prism/node.rb#6070 + # source://prism//lib/prism/node.rb#6025 sig { returns(T.nilable(String)) } def equal; end # attr_reader equal_loc: Location? # - # source://prism//lib/prism/node.rb#6025 + # source://prism//lib/prism/node.rb#5979 sig { returns(T.nilable(Prism::Location)) } def equal_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6080 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6035 + sig { override.returns(String) } + def inspect; end # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#5980 + # source://prism//lib/prism/node.rb#5930 sig { returns(T::Array[Symbol]) } def locals; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6060 + # source://prism//lib/prism/node.rb#6015 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#6001 + # source://prism//lib/prism/node.rb#5953 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#5962 + # source://prism//lib/prism/node.rb#5911 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#5965 + # source://prism//lib/prism/node.rb#5914 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String? # - # source://prism//lib/prism/node.rb#6055 + # source://prism//lib/prism/node.rb#6010 sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//lib/prism/node.rb#5989 + # source://prism//lib/prism/node.rb#5940 sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//lib/prism/node.rb#5974 + # source://prism//lib/prism/node.rb#5924 sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#5971 + # source://prism//lib/prism/node.rb#5921 sig { returns(T.nilable(Prism::Node)) } def receiver; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6065 + # source://prism//lib/prism/node.rb#6020 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#6013 + # source://prism//lib/prism/node.rb#5966 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -8107,7 +9636,8 @@ class Prism::DefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6126 + # source://prism//lib/prism/node.rb#6053 + sig { override.returns(Symbol) } def type; end class << self @@ -8118,7 +9648,7 @@ class Prism::DefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6136 + # source://prism//lib/prism/node.rb#6063 def type; end end end @@ -8128,98 +9658,124 @@ end # defined?(a) # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6145 +# source://prism//lib/prism/node.rb#6091 class Prism::DefinedNode < ::Prism::Node - # def initialize: (Location? lparen_loc, Node value, Location? rparen_loc, Location keyword_loc, Location location) -> void + # def initialize: (Location? lparen_loc, Prism::node value, Location? rparen_loc, Location keyword_loc, Location location) -> void # # @return [DefinedNode] a new instance of DefinedNode # - # source://prism//lib/prism/node.rb#6147 + # source://prism//lib/prism/node.rb#6093 + sig do + params( + source: Prism::Source, + lparen_loc: T.nilable(Prism::Location), + value: Prism::Node, + rparen_loc: T.nilable(Prism::Location), + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, lparen_loc, value, rparen_loc, keyword_loc, location); 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#6222 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6158 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6104 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6163 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6109 + 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#6173 + # source://prism//lib/prism/node.rb#6119 + 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#6168 + # source://prism//lib/prism/node.rb#6114 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> DefinedNode + # def copy: (?lparen_loc: Location?, ?value: Prism::node, ?rparen_loc: Location?, ?keyword_loc: Location, ?location: Location) -> DefinedNode # - # source://prism//lib/prism/node.rb#6178 - sig { params(params: T.untyped).returns(Prism::DefinedNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6124 + sig do + params( + lparen_loc: T.nilable(Prism::Location), + value: Prism::Node, + rparen_loc: T.nilable(Prism::Location), + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::DefinedNode) + end + def copy(lparen_loc: T.unsafe(nil), value: T.unsafe(nil), rparen_loc: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6163 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6109 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { lparen_loc: Location?, value: Node, rparen_loc: Location?, keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { lparen_loc: Location?, value: Prism::node, rparen_loc: Location?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6193 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6132 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6247 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6188 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#6242 + # source://prism//lib/prism/node.rb#6183 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#6225 + # source://prism//lib/prism/node.rb#6166 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#6232 + # source://prism//lib/prism/node.rb#6173 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#6198 + # source://prism//lib/prism/node.rb#6137 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#6237 + # source://prism//lib/prism/node.rb#6178 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#6213 + # source://prism//lib/prism/node.rb#6153 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -8238,12 +9794,13 @@ class Prism::DefinedNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6271 + # source://prism//lib/prism/node.rb#6206 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#6210 + # source://prism//lib/prism/node.rb#6150 sig { returns(Prism::Node) } def value; end @@ -8255,7 +9812,7 @@ class Prism::DefinedNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6281 + # source://prism//lib/prism/node.rb#6216 def type; end end end @@ -8301,7 +9858,7 @@ 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#216 +# source://prism//lib/prism/desugar_compiler.rb#218 class Prism::DesugarCompiler < ::Prism::MutationCompiler # @@foo &&= bar # @@ -8309,7 +9866,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo && @@foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#222 + # source://prism//lib/prism/desugar_compiler.rb#224 def visit_class_variable_and_write_node(node); end # @@foo += bar @@ -8318,7 +9875,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo = @@foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#240 + # source://prism//lib/prism/desugar_compiler.rb#242 def visit_class_variable_operator_write_node(node); end # @@foo ||= bar @@ -8327,7 +9884,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(@@foo) ? @@foo : @@foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#231 + # source://prism//lib/prism/desugar_compiler.rb#233 def visit_class_variable_or_write_node(node); end # Foo &&= bar @@ -8336,7 +9893,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo && Foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#249 + # source://prism//lib/prism/desugar_compiler.rb#251 def visit_constant_and_write_node(node); end # Foo += bar @@ -8345,7 +9902,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo = Foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#267 + # source://prism//lib/prism/desugar_compiler.rb#269 def visit_constant_operator_write_node(node); end # Foo ||= bar @@ -8354,7 +9911,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(Foo) ? Foo : Foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#258 + # source://prism//lib/prism/desugar_compiler.rb#260 def visit_constant_or_write_node(node); end # $foo &&= bar @@ -8363,7 +9920,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo && $foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#276 + # source://prism//lib/prism/desugar_compiler.rb#278 def visit_global_variable_and_write_node(node); end # $foo += bar @@ -8372,7 +9929,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo = $foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#294 + # source://prism//lib/prism/desugar_compiler.rb#296 def visit_global_variable_operator_write_node(node); end # $foo ||= bar @@ -8381,22 +9938,22 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?($foo) ? $foo : $foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#285 + # source://prism//lib/prism/desugar_compiler.rb#287 def visit_global_variable_or_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#303 + # source://prism//lib/prism/desugar_compiler.rb#305 def visit_instance_variable_and_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#321 + # source://prism//lib/prism/desugar_compiler.rb#323 def visit_instance_variable_operator_write_node(node); end # becomes # - # source://prism//lib/prism/desugar_compiler.rb#312 + # source://prism//lib/prism/desugar_compiler.rb#314 def visit_instance_variable_or_write_node(node); end # foo &&= bar @@ -8405,7 +9962,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo && foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#330 + # source://prism//lib/prism/desugar_compiler.rb#332 def visit_local_variable_and_write_node(node); end # foo += bar @@ -8414,7 +9971,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo = foo + bar # - # source://prism//lib/prism/desugar_compiler.rb#348 + # source://prism//lib/prism/desugar_compiler.rb#350 def visit_local_variable_operator_write_node(node); end # foo ||= bar @@ -8423,7 +9980,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo || foo = bar # - # source://prism//lib/prism/desugar_compiler.rb#339 + # source://prism//lib/prism/desugar_compiler.rb#341 def visit_local_variable_or_write_node(node); end end @@ -8503,41 +10060,41 @@ class Prism::DesugarOrWriteDefinedNode def write_class; end end -# source://prism//lib/prism/desugar_compiler.rb#99 +# source://prism//lib/prism/desugar_compiler.rb#101 class Prism::DesugarOrWriteNode # @return [DesugarOrWriteNode] a new instance of DesugarOrWriteNode # - # source://prism//lib/prism/desugar_compiler.rb#102 + # source://prism//lib/prism/desugar_compiler.rb#104 def initialize(node, source, read_class, write_class, *arguments); end # Returns the value of attribute arguments. # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#102 def arguments; end # Desugar `x ||= y` to `x || x = y` # - # source://prism//lib/prism/desugar_compiler.rb#111 + # source://prism//lib/prism/desugar_compiler.rb#113 def compile; end # Returns the value of attribute node. # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#102 def node; end # Returns the value of attribute read_class. # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#102 def read_class; end # Returns the value of attribute source. # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#102 def source; end # Returns the value of attribute write_class. # - # source://prism//lib/prism/desugar_compiler.rb#100 + # source://prism//lib/prism/desugar_compiler.rb#102 def write_class; end end @@ -8572,2443 +10129,2475 @@ end # integer = result.value.statements.body.first.receiver.receiver # dispatcher.dispatch_once(integer) # -# source://prism//lib/prism/dispatcher.rb#40 +# source://prism//lib/prism/dispatcher.rb#41 class Prism::Dispatcher < ::Prism::Visitor # Initialize a new dispatcher. # # @return [Dispatcher] a new instance of Dispatcher # - # source://prism//lib/prism/dispatcher.rb#45 + # source://prism//lib/prism/dispatcher.rb#46 def initialize; end # Walks `root` dispatching events to all registered listeners. # # def dispatch: (Node) -> void # - # source://prism//lib/prism/visitor.rb#16 + # source://prism//lib/prism/visitor.rb#17 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#64 + # source://prism//lib/prism/dispatcher.rb#65 def dispatch_once(node); end # attr_reader listeners: Hash[Symbol, Array[Listener]] # - # source://prism//lib/prism/dispatcher.rb#42 + # source://prism//lib/prism/dispatcher.rb#43 def listeners; end # Register a listener for one or more events. # # def register: (Listener, *Symbol) -> void # - # source://prism//lib/prism/dispatcher.rb#52 + # source://prism//lib/prism/dispatcher.rb#53 def register(listener, *events); end # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue # walking the tree. # - # source://prism//lib/prism/dispatcher.rb#70 + # source://prism//lib/prism/dispatcher.rb#71 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#78 + # source://prism//lib/prism/dispatcher.rb#79 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#86 + # source://prism//lib/prism/dispatcher.rb#87 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#94 + # source://prism//lib/prism/dispatcher.rb#95 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#102 + # source://prism//lib/prism/dispatcher.rb#103 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#110 + # source://prism//lib/prism/dispatcher.rb#111 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#118 + # source://prism//lib/prism/dispatcher.rb#119 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#126 + # source://prism//lib/prism/dispatcher.rb#127 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#134 + # source://prism//lib/prism/dispatcher.rb#135 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#142 + # source://prism//lib/prism/dispatcher.rb#143 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#150 + # source://prism//lib/prism/dispatcher.rb#151 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#158 + # source://prism//lib/prism/dispatcher.rb#159 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#166 + # source://prism//lib/prism/dispatcher.rb#167 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#174 + # source://prism//lib/prism/dispatcher.rb#175 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#182 + # source://prism//lib/prism/dispatcher.rb#183 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#190 + # source://prism//lib/prism/dispatcher.rb#191 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#198 + # source://prism//lib/prism/dispatcher.rb#199 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#206 + # source://prism//lib/prism/dispatcher.rb#207 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#214 + # source://prism//lib/prism/dispatcher.rb#215 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#222 + # source://prism//lib/prism/dispatcher.rb#223 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#230 + # source://prism//lib/prism/dispatcher.rb#231 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#238 + # source://prism//lib/prism/dispatcher.rb#239 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#246 + # source://prism//lib/prism/dispatcher.rb#247 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#254 + # source://prism//lib/prism/dispatcher.rb#255 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#262 + # source://prism//lib/prism/dispatcher.rb#263 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#270 + # source://prism//lib/prism/dispatcher.rb#271 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#278 + # source://prism//lib/prism/dispatcher.rb#279 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#286 + # source://prism//lib/prism/dispatcher.rb#287 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#294 + # source://prism//lib/prism/dispatcher.rb#295 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#302 + # source://prism//lib/prism/dispatcher.rb#303 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#310 + # source://prism//lib/prism/dispatcher.rb#311 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#318 + # source://prism//lib/prism/dispatcher.rb#319 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#326 + # source://prism//lib/prism/dispatcher.rb#327 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#334 + # source://prism//lib/prism/dispatcher.rb#335 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#342 + # source://prism//lib/prism/dispatcher.rb#343 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#350 + # source://prism//lib/prism/dispatcher.rb#351 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#358 + # source://prism//lib/prism/dispatcher.rb#359 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#366 + # source://prism//lib/prism/dispatcher.rb#367 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#374 + # source://prism//lib/prism/dispatcher.rb#375 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#382 + # source://prism//lib/prism/dispatcher.rb#383 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#390 + # source://prism//lib/prism/dispatcher.rb#391 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#398 + # source://prism//lib/prism/dispatcher.rb#399 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#406 + # source://prism//lib/prism/dispatcher.rb#407 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#414 + # source://prism//lib/prism/dispatcher.rb#415 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#422 + # source://prism//lib/prism/dispatcher.rb#423 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#430 + # source://prism//lib/prism/dispatcher.rb#431 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#438 + # source://prism//lib/prism/dispatcher.rb#439 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#446 + # source://prism//lib/prism/dispatcher.rb#447 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#454 + # source://prism//lib/prism/dispatcher.rb#455 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#462 + # source://prism//lib/prism/dispatcher.rb#463 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#470 + # source://prism//lib/prism/dispatcher.rb#471 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#478 + # source://prism//lib/prism/dispatcher.rb#479 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#486 + # source://prism//lib/prism/dispatcher.rb#487 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#494 + # source://prism//lib/prism/dispatcher.rb#495 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#502 + # source://prism//lib/prism/dispatcher.rb#503 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#510 + # source://prism//lib/prism/dispatcher.rb#511 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#518 + # source://prism//lib/prism/dispatcher.rb#519 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#526 + # source://prism//lib/prism/dispatcher.rb#527 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#534 + # source://prism//lib/prism/dispatcher.rb#535 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#542 + # source://prism//lib/prism/dispatcher.rb#543 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#550 + # source://prism//lib/prism/dispatcher.rb#551 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#558 + # source://prism//lib/prism/dispatcher.rb#559 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#566 + # source://prism//lib/prism/dispatcher.rb#567 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#574 + # source://prism//lib/prism/dispatcher.rb#575 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#582 + # source://prism//lib/prism/dispatcher.rb#583 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#590 + # source://prism//lib/prism/dispatcher.rb#591 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#598 + # source://prism//lib/prism/dispatcher.rb#599 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#606 + # source://prism//lib/prism/dispatcher.rb#607 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#614 + # source://prism//lib/prism/dispatcher.rb#615 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#622 + # source://prism//lib/prism/dispatcher.rb#623 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#630 + # source://prism//lib/prism/dispatcher.rb#631 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#638 + # source://prism//lib/prism/dispatcher.rb#639 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#646 + # source://prism//lib/prism/dispatcher.rb#647 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#654 + # source://prism//lib/prism/dispatcher.rb#655 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#662 + # source://prism//lib/prism/dispatcher.rb#663 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#670 + # source://prism//lib/prism/dispatcher.rb#671 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#678 + # source://prism//lib/prism/dispatcher.rb#679 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#686 + # source://prism//lib/prism/dispatcher.rb#687 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#694 + # source://prism//lib/prism/dispatcher.rb#695 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#702 + # source://prism//lib/prism/dispatcher.rb#703 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#710 + # source://prism//lib/prism/dispatcher.rb#711 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#718 + # source://prism//lib/prism/dispatcher.rb#719 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#726 + # source://prism//lib/prism/dispatcher.rb#727 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#734 + # source://prism//lib/prism/dispatcher.rb#735 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#742 + # source://prism//lib/prism/dispatcher.rb#743 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#750 + # source://prism//lib/prism/dispatcher.rb#751 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#758 + # source://prism//lib/prism/dispatcher.rb#759 def visit_interpolated_x_string_node(node); end + # Dispatch enter and leave events for ItParametersNode nodes and continue + # walking the tree. + # + # source://prism//lib/prism/dispatcher.rb#767 + 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#766 + # source://prism//lib/prism/dispatcher.rb#775 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#774 + # source://prism//lib/prism/dispatcher.rb#783 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#782 + # source://prism//lib/prism/dispatcher.rb#791 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#790 + # source://prism//lib/prism/dispatcher.rb#799 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#798 + # source://prism//lib/prism/dispatcher.rb#807 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#806 + # source://prism//lib/prism/dispatcher.rb#815 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#814 + # source://prism//lib/prism/dispatcher.rb#823 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#822 + # source://prism//lib/prism/dispatcher.rb#831 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#830 + # source://prism//lib/prism/dispatcher.rb#839 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#838 + # source://prism//lib/prism/dispatcher.rb#847 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#846 + # source://prism//lib/prism/dispatcher.rb#855 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#854 + # source://prism//lib/prism/dispatcher.rb#863 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#862 + # source://prism//lib/prism/dispatcher.rb#871 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#870 + # source://prism//lib/prism/dispatcher.rb#879 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#878 + # source://prism//lib/prism/dispatcher.rb#887 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#886 + # source://prism//lib/prism/dispatcher.rb#895 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#894 + # source://prism//lib/prism/dispatcher.rb#903 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#902 + # source://prism//lib/prism/dispatcher.rb#911 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#910 + # source://prism//lib/prism/dispatcher.rb#919 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#918 + # source://prism//lib/prism/dispatcher.rb#927 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#926 + # source://prism//lib/prism/dispatcher.rb#935 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#934 + # source://prism//lib/prism/dispatcher.rb#943 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#942 + # source://prism//lib/prism/dispatcher.rb#951 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#950 + # source://prism//lib/prism/dispatcher.rb#959 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#958 + # source://prism//lib/prism/dispatcher.rb#967 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#966 + # source://prism//lib/prism/dispatcher.rb#975 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#974 + # source://prism//lib/prism/dispatcher.rb#983 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#982 + # source://prism//lib/prism/dispatcher.rb#991 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#990 + # source://prism//lib/prism/dispatcher.rb#999 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#998 + # source://prism//lib/prism/dispatcher.rb#1007 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#1006 + # source://prism//lib/prism/dispatcher.rb#1015 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#1014 + # source://prism//lib/prism/dispatcher.rb#1023 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#1022 + # source://prism//lib/prism/dispatcher.rb#1031 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#1030 + # source://prism//lib/prism/dispatcher.rb#1039 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#1038 + # source://prism//lib/prism/dispatcher.rb#1047 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#1046 + # source://prism//lib/prism/dispatcher.rb#1055 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#1054 + # source://prism//lib/prism/dispatcher.rb#1063 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#1062 + # source://prism//lib/prism/dispatcher.rb#1071 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#1070 + # source://prism//lib/prism/dispatcher.rb#1079 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#1078 + # source://prism//lib/prism/dispatcher.rb#1087 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#1086 + # source://prism//lib/prism/dispatcher.rb#1095 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#1094 + # source://prism//lib/prism/dispatcher.rb#1103 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#1102 + # source://prism//lib/prism/dispatcher.rb#1111 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#1110 + # source://prism//lib/prism/dispatcher.rb#1119 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#1127 + 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#1118 + # source://prism//lib/prism/dispatcher.rb#1135 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#1126 + # source://prism//lib/prism/dispatcher.rb#1143 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#1134 + # source://prism//lib/prism/dispatcher.rb#1151 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#1142 + # source://prism//lib/prism/dispatcher.rb#1159 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#1150 + # source://prism//lib/prism/dispatcher.rb#1167 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#1158 + # source://prism//lib/prism/dispatcher.rb#1175 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#1166 + # source://prism//lib/prism/dispatcher.rb#1183 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#1174 + # source://prism//lib/prism/dispatcher.rb#1191 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#1182 + # source://prism//lib/prism/dispatcher.rb#1199 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#1190 + # source://prism//lib/prism/dispatcher.rb#1207 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#1198 + # source://prism//lib/prism/dispatcher.rb#1215 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#1206 + # source://prism//lib/prism/dispatcher.rb#1223 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#1214 + # source://prism//lib/prism/dispatcher.rb#1231 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#1222 + # source://prism//lib/prism/dispatcher.rb#1239 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#1230 + # source://prism//lib/prism/dispatcher.rb#1247 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#1238 + # source://prism//lib/prism/dispatcher.rb#1255 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#1246 + # source://prism//lib/prism/dispatcher.rb#1263 def visit_yield_node(node); end end -# source://prism//lib/prism/dispatcher.rb#1252 +# source://prism//lib/prism/dispatcher.rb#1269 class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor # @return [DispatchOnce] a new instance of DispatchOnce # - # source://prism//lib/prism/dispatcher.rb#1255 + # source://prism//lib/prism/dispatcher.rb#1272 def initialize(listeners); end # Returns the value of attribute listeners. # - # source://prism//lib/prism/dispatcher.rb#1253 + # source://prism//lib/prism/dispatcher.rb#1270 def listeners; end # Dispatch enter and leave events for AliasGlobalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1260 + # source://prism//lib/prism/dispatcher.rb#1277 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1266 + # source://prism//lib/prism/dispatcher.rb#1283 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1272 + # source://prism//lib/prism/dispatcher.rb#1289 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1278 + # source://prism//lib/prism/dispatcher.rb#1295 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1284 + # source://prism//lib/prism/dispatcher.rb#1301 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1290 + # source://prism//lib/prism/dispatcher.rb#1307 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1296 + # source://prism//lib/prism/dispatcher.rb#1313 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1302 + # source://prism//lib/prism/dispatcher.rb#1319 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1308 + # source://prism//lib/prism/dispatcher.rb#1325 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1314 + # source://prism//lib/prism/dispatcher.rb#1331 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1320 + # source://prism//lib/prism/dispatcher.rb#1337 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1326 + # source://prism//lib/prism/dispatcher.rb#1343 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1332 + # source://prism//lib/prism/dispatcher.rb#1349 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1338 + # source://prism//lib/prism/dispatcher.rb#1355 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1344 + # source://prism//lib/prism/dispatcher.rb#1361 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1350 + # source://prism//lib/prism/dispatcher.rb#1367 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1356 + # source://prism//lib/prism/dispatcher.rb#1373 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1362 + # source://prism//lib/prism/dispatcher.rb#1379 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1368 + # source://prism//lib/prism/dispatcher.rb#1385 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1374 + # source://prism//lib/prism/dispatcher.rb#1391 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1380 + # source://prism//lib/prism/dispatcher.rb#1397 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1386 + # source://prism//lib/prism/dispatcher.rb#1403 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1392 + # source://prism//lib/prism/dispatcher.rb#1409 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1398 + # source://prism//lib/prism/dispatcher.rb#1415 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1404 + # source://prism//lib/prism/dispatcher.rb#1421 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1410 + # source://prism//lib/prism/dispatcher.rb#1427 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1416 + # source://prism//lib/prism/dispatcher.rb#1433 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1422 + # source://prism//lib/prism/dispatcher.rb#1439 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1428 + # source://prism//lib/prism/dispatcher.rb#1445 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1434 + # source://prism//lib/prism/dispatcher.rb#1451 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1440 + # source://prism//lib/prism/dispatcher.rb#1457 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1446 + # source://prism//lib/prism/dispatcher.rb#1463 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1452 + # source://prism//lib/prism/dispatcher.rb#1469 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1458 + # source://prism//lib/prism/dispatcher.rb#1475 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1464 + # source://prism//lib/prism/dispatcher.rb#1481 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1470 + # source://prism//lib/prism/dispatcher.rb#1487 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1476 + # source://prism//lib/prism/dispatcher.rb#1493 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1482 + # source://prism//lib/prism/dispatcher.rb#1499 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1488 + # source://prism//lib/prism/dispatcher.rb#1505 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1494 + # source://prism//lib/prism/dispatcher.rb#1511 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1500 + # source://prism//lib/prism/dispatcher.rb#1517 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1506 + # source://prism//lib/prism/dispatcher.rb#1523 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1512 + # source://prism//lib/prism/dispatcher.rb#1529 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1518 + # source://prism//lib/prism/dispatcher.rb#1535 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1524 + # source://prism//lib/prism/dispatcher.rb#1541 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1530 + # source://prism//lib/prism/dispatcher.rb#1547 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1536 + # source://prism//lib/prism/dispatcher.rb#1553 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1542 + # source://prism//lib/prism/dispatcher.rb#1559 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1548 + # source://prism//lib/prism/dispatcher.rb#1565 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1554 + # source://prism//lib/prism/dispatcher.rb#1571 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1560 + # source://prism//lib/prism/dispatcher.rb#1577 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1566 + # source://prism//lib/prism/dispatcher.rb#1583 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1572 + # source://prism//lib/prism/dispatcher.rb#1589 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1578 + # source://prism//lib/prism/dispatcher.rb#1595 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1584 + # source://prism//lib/prism/dispatcher.rb#1601 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1590 + # source://prism//lib/prism/dispatcher.rb#1607 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1596 + # source://prism//lib/prism/dispatcher.rb#1613 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1602 + # source://prism//lib/prism/dispatcher.rb#1619 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1608 + # source://prism//lib/prism/dispatcher.rb#1625 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1614 + # source://prism//lib/prism/dispatcher.rb#1631 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1620 + # source://prism//lib/prism/dispatcher.rb#1637 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1626 + # source://prism//lib/prism/dispatcher.rb#1643 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1632 + # source://prism//lib/prism/dispatcher.rb#1649 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1638 + # source://prism//lib/prism/dispatcher.rb#1655 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1644 + # source://prism//lib/prism/dispatcher.rb#1661 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1650 + # source://prism//lib/prism/dispatcher.rb#1667 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1656 + # source://prism//lib/prism/dispatcher.rb#1673 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1662 + # source://prism//lib/prism/dispatcher.rb#1679 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1668 + # source://prism//lib/prism/dispatcher.rb#1685 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1674 + # source://prism//lib/prism/dispatcher.rb#1691 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1680 + # source://prism//lib/prism/dispatcher.rb#1697 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1686 + # source://prism//lib/prism/dispatcher.rb#1703 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1692 + # source://prism//lib/prism/dispatcher.rb#1709 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1698 + # source://prism//lib/prism/dispatcher.rb#1715 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1704 + # source://prism//lib/prism/dispatcher.rb#1721 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1710 + # source://prism//lib/prism/dispatcher.rb#1727 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1716 + # source://prism//lib/prism/dispatcher.rb#1733 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1722 + # source://prism//lib/prism/dispatcher.rb#1739 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1728 + # source://prism//lib/prism/dispatcher.rb#1745 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1734 + # source://prism//lib/prism/dispatcher.rb#1751 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1740 + # source://prism//lib/prism/dispatcher.rb#1757 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1746 + # source://prism//lib/prism/dispatcher.rb#1763 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1752 + # source://prism//lib/prism/dispatcher.rb#1769 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1758 + # source://prism//lib/prism/dispatcher.rb#1775 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1764 + # source://prism//lib/prism/dispatcher.rb#1781 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1770 + # source://prism//lib/prism/dispatcher.rb#1787 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1776 + # source://prism//lib/prism/dispatcher.rb#1793 def visit_interpolated_x_string_node(node); end + # Dispatch enter and leave events for ItParametersNode nodes. + # + # source://prism//lib/prism/dispatcher.rb#1799 + def visit_it_parameters_node(node); end + # Dispatch enter and leave events for KeywordHashNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1782 + # source://prism//lib/prism/dispatcher.rb#1805 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1788 + # source://prism//lib/prism/dispatcher.rb#1811 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1794 + # source://prism//lib/prism/dispatcher.rb#1817 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1800 + # source://prism//lib/prism/dispatcher.rb#1823 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1806 + # source://prism//lib/prism/dispatcher.rb#1829 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1812 + # source://prism//lib/prism/dispatcher.rb#1835 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1818 + # source://prism//lib/prism/dispatcher.rb#1841 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1824 + # source://prism//lib/prism/dispatcher.rb#1847 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1830 + # source://prism//lib/prism/dispatcher.rb#1853 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1836 + # source://prism//lib/prism/dispatcher.rb#1859 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1842 + # source://prism//lib/prism/dispatcher.rb#1865 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1848 + # source://prism//lib/prism/dispatcher.rb#1871 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1854 + # source://prism//lib/prism/dispatcher.rb#1877 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1860 + # source://prism//lib/prism/dispatcher.rb#1883 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1866 + # source://prism//lib/prism/dispatcher.rb#1889 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1872 + # source://prism//lib/prism/dispatcher.rb#1895 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1878 + # source://prism//lib/prism/dispatcher.rb#1901 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1884 + # source://prism//lib/prism/dispatcher.rb#1907 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1890 + # source://prism//lib/prism/dispatcher.rb#1913 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1896 + # source://prism//lib/prism/dispatcher.rb#1919 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1902 + # source://prism//lib/prism/dispatcher.rb#1925 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1908 + # source://prism//lib/prism/dispatcher.rb#1931 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1914 + # source://prism//lib/prism/dispatcher.rb#1937 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1920 + # source://prism//lib/prism/dispatcher.rb#1943 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1926 + # source://prism//lib/prism/dispatcher.rb#1949 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1932 + # source://prism//lib/prism/dispatcher.rb#1955 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1938 + # source://prism//lib/prism/dispatcher.rb#1961 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1944 + # source://prism//lib/prism/dispatcher.rb#1967 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1950 + # source://prism//lib/prism/dispatcher.rb#1973 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1956 + # source://prism//lib/prism/dispatcher.rb#1979 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1962 + # source://prism//lib/prism/dispatcher.rb#1985 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1968 + # source://prism//lib/prism/dispatcher.rb#1991 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1974 + # source://prism//lib/prism/dispatcher.rb#1997 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1980 + # source://prism//lib/prism/dispatcher.rb#2003 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1986 + # source://prism//lib/prism/dispatcher.rb#2009 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1992 + # source://prism//lib/prism/dispatcher.rb#2015 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#1998 + # source://prism//lib/prism/dispatcher.rb#2021 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2004 + # source://prism//lib/prism/dispatcher.rb#2027 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2010 + # source://prism//lib/prism/dispatcher.rb#2033 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2016 + # source://prism//lib/prism/dispatcher.rb#2039 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2022 + # source://prism//lib/prism/dispatcher.rb#2045 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2028 + # source://prism//lib/prism/dispatcher.rb#2051 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2034 + # source://prism//lib/prism/dispatcher.rb#2057 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2040 + # source://prism//lib/prism/dispatcher.rb#2063 def visit_self_node(node); end + # Dispatch enter and leave events for ShareableConstantNode nodes. + # + # source://prism//lib/prism/dispatcher.rb#2069 + def visit_shareable_constant_node(node); end + # Dispatch enter and leave events for SingletonClassNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2046 + # source://prism//lib/prism/dispatcher.rb#2075 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2052 + # source://prism//lib/prism/dispatcher.rb#2081 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2058 + # source://prism//lib/prism/dispatcher.rb#2087 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2064 + # source://prism//lib/prism/dispatcher.rb#2093 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2070 + # source://prism//lib/prism/dispatcher.rb#2099 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2076 + # source://prism//lib/prism/dispatcher.rb#2105 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2082 + # source://prism//lib/prism/dispatcher.rb#2111 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2088 + # source://prism//lib/prism/dispatcher.rb#2117 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2094 + # source://prism//lib/prism/dispatcher.rb#2123 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2100 + # source://prism//lib/prism/dispatcher.rb#2129 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2106 + # source://prism//lib/prism/dispatcher.rb#2135 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2112 + # source://prism//lib/prism/dispatcher.rb#2141 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2118 + # source://prism//lib/prism/dispatcher.rb#2147 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2124 + # source://prism//lib/prism/dispatcher.rb#2153 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2130 + # source://prism//lib/prism/dispatcher.rb#2159 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2136 + # source://prism//lib/prism/dispatcher.rb#2165 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes. # - # source://prism//lib/prism/dispatcher.rb#2142 + # source://prism//lib/prism/dispatcher.rb#2171 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#13 +# source://prism//lib/prism/dot_visitor.rb#14 class Prism::DotVisitor < ::Prism::Visitor # Initialize a new dot visitor. # # @return [DotVisitor] a new instance of DotVisitor # - # source://prism//lib/prism/dot_visitor.rb#105 + # source://prism//lib/prism/dot_visitor.rb#106 def initialize; end # The digraph that is being built. # - # source://prism//lib/prism/dot_visitor.rb#102 + # source://prism//lib/prism/dot_visitor.rb#103 def digraph; end # Convert this visitor into a graphviz dot graph string. # - # source://prism//lib/prism/dot_visitor.rb#110 + # source://prism//lib/prism/dot_visitor.rb#111 def to_dot; end # Visit a AliasGlobalVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#115 + # source://prism//lib/prism/dot_visitor.rb#116 def visit_alias_global_variable_node(node); end # Visit a AliasMethodNode node. # - # source://prism//lib/prism/dot_visitor.rb#140 + # source://prism//lib/prism/dot_visitor.rb#141 def visit_alias_method_node(node); end # Visit a AlternationPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#165 + # source://prism//lib/prism/dot_visitor.rb#166 def visit_alternation_pattern_node(node); end # Visit a AndNode node. # - # source://prism//lib/prism/dot_visitor.rb#190 + # source://prism//lib/prism/dot_visitor.rb#191 def visit_and_node(node); end # Visit a ArgumentsNode node. # - # source://prism//lib/prism/dot_visitor.rb#215 + # source://prism//lib/prism/dot_visitor.rb#216 def visit_arguments_node(node); end # Visit a ArrayNode node. # - # source://prism//lib/prism/dot_visitor.rb#245 + # source://prism//lib/prism/dot_visitor.rb#246 def visit_array_node(node); end # Visit a ArrayPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#285 + # source://prism//lib/prism/dot_visitor.rb#286 def visit_array_pattern_node(node); end # Visit a AssocNode node. # - # source://prism//lib/prism/dot_visitor.rb#347 + # source://prism//lib/prism/dot_visitor.rb#348 def visit_assoc_node(node); end # Visit a AssocSplatNode node. # - # source://prism//lib/prism/dot_visitor.rb#374 + # source://prism//lib/prism/dot_visitor.rb#375 def visit_assoc_splat_node(node); end # Visit a BackReferenceReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#397 + # source://prism//lib/prism/dot_visitor.rb#398 def visit_back_reference_read_node(node); end # Visit a BeginNode node. # - # source://prism//lib/prism/dot_visitor.rb#414 + # source://prism//lib/prism/dot_visitor.rb#415 def visit_begin_node(node); end # Visit a BlockArgumentNode node. # - # source://prism//lib/prism/dot_visitor.rb#462 + # source://prism//lib/prism/dot_visitor.rb#463 def visit_block_argument_node(node); end # Visit a BlockLocalVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#485 + # source://prism//lib/prism/dot_visitor.rb#486 def visit_block_local_variable_node(node); end # Visit a BlockNode node. # - # source://prism//lib/prism/dot_visitor.rb#505 + # source://prism//lib/prism/dot_visitor.rb#506 def visit_block_node(node); end # Visit a BlockParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#540 + # source://prism//lib/prism/dot_visitor.rb#541 def visit_block_parameter_node(node); end # Visit a BlockParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#568 + # source://prism//lib/prism/dot_visitor.rb#569 def visit_block_parameters_node(node); end # Visit a BreakNode node. # - # source://prism//lib/prism/dot_visitor.rb#611 + # source://prism//lib/prism/dot_visitor.rb#612 def visit_break_node(node); end # Visit a CallAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#634 + # source://prism//lib/prism/dot_visitor.rb#635 def visit_call_and_write_node(node); end # Visit a CallNode node. # - # source://prism//lib/prism/dot_visitor.rb#680 + # source://prism//lib/prism/dot_visitor.rb#681 def visit_call_node(node); end # Visit a CallOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#738 + # source://prism//lib/prism/dot_visitor.rb#739 def visit_call_operator_write_node(node); end # Visit a CallOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#787 + # source://prism//lib/prism/dot_visitor.rb#788 def visit_call_or_write_node(node); end # Visit a CallTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#833 + # source://prism//lib/prism/dot_visitor.rb#834 def visit_call_target_node(node); end # Visit a CapturePatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#863 + # source://prism//lib/prism/dot_visitor.rb#864 def visit_capture_pattern_node(node); end # Visit a CaseMatchNode node. # - # source://prism//lib/prism/dot_visitor.rb#888 + # source://prism//lib/prism/dot_visitor.rb#889 def visit_case_match_node(node); end # Visit a CaseNode node. # - # source://prism//lib/prism/dot_visitor.rb#933 + # source://prism//lib/prism/dot_visitor.rb#934 def visit_case_node(node); end # Visit a ClassNode node. # - # source://prism//lib/prism/dot_visitor.rb#978 + # source://prism//lib/prism/dot_visitor.rb#979 def visit_class_node(node); end # Visit a ClassVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1025 + # source://prism//lib/prism/dot_visitor.rb#1026 def visit_class_variable_and_write_node(node); end # Visit a ClassVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1052 + # source://prism//lib/prism/dot_visitor.rb#1053 def visit_class_variable_operator_write_node(node); end # Visit a ClassVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1082 + # source://prism//lib/prism/dot_visitor.rb#1083 def visit_class_variable_or_write_node(node); end # Visit a ClassVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1109 + # source://prism//lib/prism/dot_visitor.rb#1110 def visit_class_variable_read_node(node); end # Visit a ClassVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1126 + # source://prism//lib/prism/dot_visitor.rb#1127 def visit_class_variable_target_node(node); end # Visit a ClassVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1143 + # source://prism//lib/prism/dot_visitor.rb#1144 def visit_class_variable_write_node(node); end # Visit a ConstantAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1172 + # source://prism//lib/prism/dot_visitor.rb#1171 def visit_constant_and_write_node(node); end # Visit a ConstantOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1199 + # source://prism//lib/prism/dot_visitor.rb#1198 def visit_constant_operator_write_node(node); end # Visit a ConstantOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1229 + # source://prism//lib/prism/dot_visitor.rb#1228 def visit_constant_or_write_node(node); end # Visit a ConstantPathAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1256 + # source://prism//lib/prism/dot_visitor.rb#1255 def visit_constant_path_and_write_node(node); end # Visit a ConstantPathNode node. # - # source://prism//lib/prism/dot_visitor.rb#1281 + # source://prism//lib/prism/dot_visitor.rb#1280 def visit_constant_path_node(node); end # Visit a ConstantPathOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1308 + # source://prism//lib/prism/dot_visitor.rb#1309 def visit_constant_path_operator_write_node(node); end # Visit a ConstantPathOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1336 + # source://prism//lib/prism/dot_visitor.rb#1337 def visit_constant_path_or_write_node(node); end # Visit a ConstantPathTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1361 + # source://prism//lib/prism/dot_visitor.rb#1362 def visit_constant_path_target_node(node); end # Visit a ConstantPathWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1388 + # source://prism//lib/prism/dot_visitor.rb#1391 def visit_constant_path_write_node(node); end # Visit a ConstantReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1413 + # source://prism//lib/prism/dot_visitor.rb#1416 def visit_constant_read_node(node); end # Visit a ConstantTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1430 + # source://prism//lib/prism/dot_visitor.rb#1433 def visit_constant_target_node(node); end # Visit a ConstantWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1447 + # source://prism//lib/prism/dot_visitor.rb#1450 def visit_constant_write_node(node); end # Visit a DefNode node. # - # source://prism//lib/prism/dot_visitor.rb#1474 + # source://prism//lib/prism/dot_visitor.rb#1477 def visit_def_node(node); end # Visit a DefinedNode node. # - # source://prism//lib/prism/dot_visitor.rb#1543 + # source://prism//lib/prism/dot_visitor.rb#1546 def visit_defined_node(node); end # Visit a ElseNode node. # - # source://prism//lib/prism/dot_visitor.rb#1574 + # source://prism//lib/prism/dot_visitor.rb#1577 def visit_else_node(node); end # Visit a EmbeddedStatementsNode node. # - # source://prism//lib/prism/dot_visitor.rb#1602 + # source://prism//lib/prism/dot_visitor.rb#1605 def visit_embedded_statements_node(node); end # Visit a EmbeddedVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#1628 + # source://prism//lib/prism/dot_visitor.rb#1631 def visit_embedded_variable_node(node); end # Visit a EnsureNode node. # - # source://prism//lib/prism/dot_visitor.rb#1649 + # source://prism//lib/prism/dot_visitor.rb#1652 def visit_ensure_node(node); end # Visit a FalseNode node. # - # source://prism//lib/prism/dot_visitor.rb#1675 + # source://prism//lib/prism/dot_visitor.rb#1678 def visit_false_node(node); end # Visit a FindPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#1689 + # source://prism//lib/prism/dot_visitor.rb#1692 def visit_find_pattern_node(node); end # Visit a FlipFlopNode node. # - # source://prism//lib/prism/dot_visitor.rb#1740 + # source://prism//lib/prism/dot_visitor.rb#1743 def visit_flip_flop_node(node); end # Visit a FloatNode node. # - # source://prism//lib/prism/dot_visitor.rb#1772 + # source://prism//lib/prism/dot_visitor.rb#1775 def visit_float_node(node); end # Visit a ForNode node. # - # source://prism//lib/prism/dot_visitor.rb#1786 + # source://prism//lib/prism/dot_visitor.rb#1792 def visit_for_node(node); end # Visit a ForwardingArgumentsNode node. # - # source://prism//lib/prism/dot_visitor.rb#1828 + # source://prism//lib/prism/dot_visitor.rb#1834 def visit_forwarding_arguments_node(node); end # Visit a ForwardingParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#1842 + # source://prism//lib/prism/dot_visitor.rb#1848 def visit_forwarding_parameter_node(node); end # Visit a ForwardingSuperNode node. # - # source://prism//lib/prism/dot_visitor.rb#1856 + # source://prism//lib/prism/dot_visitor.rb#1862 def visit_forwarding_super_node(node); end # Visit a GlobalVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1876 + # source://prism//lib/prism/dot_visitor.rb#1882 def visit_global_variable_and_write_node(node); end # Visit a GlobalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1903 + # source://prism//lib/prism/dot_visitor.rb#1909 def visit_global_variable_operator_write_node(node); end # Visit a GlobalVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1933 + # source://prism//lib/prism/dot_visitor.rb#1939 def visit_global_variable_or_write_node(node); end # Visit a GlobalVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#1960 + # source://prism//lib/prism/dot_visitor.rb#1966 def visit_global_variable_read_node(node); end # Visit a GlobalVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#1977 + # source://prism//lib/prism/dot_visitor.rb#1983 def visit_global_variable_target_node(node); end # Visit a GlobalVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#1994 + # source://prism//lib/prism/dot_visitor.rb#2000 def visit_global_variable_write_node(node); end # Visit a HashNode node. # - # source://prism//lib/prism/dot_visitor.rb#2021 + # source://prism//lib/prism/dot_visitor.rb#2027 def visit_hash_node(node); end # Visit a HashPatternNode node. # - # source://prism//lib/prism/dot_visitor.rb#2054 + # source://prism//lib/prism/dot_visitor.rb#2060 def visit_hash_pattern_node(node); end # Visit a IfNode node. # - # source://prism//lib/prism/dot_visitor.rb#2103 + # source://prism//lib/prism/dot_visitor.rb#2109 def visit_if_node(node); end # Visit a ImaginaryNode node. # - # source://prism//lib/prism/dot_visitor.rb#2148 + # source://prism//lib/prism/dot_visitor.rb#2154 def visit_imaginary_node(node); end # Visit a ImplicitNode node. # - # source://prism//lib/prism/dot_visitor.rb#2166 + # source://prism//lib/prism/dot_visitor.rb#2172 def visit_implicit_node(node); end # Visit a ImplicitRestNode node. # - # source://prism//lib/prism/dot_visitor.rb#2184 + # source://prism//lib/prism/dot_visitor.rb#2190 def visit_implicit_rest_node(node); end # Visit a InNode node. # - # source://prism//lib/prism/dot_visitor.rb#2198 + # source://prism//lib/prism/dot_visitor.rb#2204 def visit_in_node(node); end # Visit a IndexAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2230 + # source://prism//lib/prism/dot_visitor.rb#2236 def visit_index_and_write_node(node); end # Visit a IndexOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2283 + # source://prism//lib/prism/dot_visitor.rb#2289 def visit_index_operator_write_node(node); end # Visit a IndexOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2339 + # source://prism//lib/prism/dot_visitor.rb#2345 def visit_index_or_write_node(node); end # Visit a IndexTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#2392 + # source://prism//lib/prism/dot_visitor.rb#2398 def visit_index_target_node(node); end # Visit a InstanceVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2431 + # source://prism//lib/prism/dot_visitor.rb#2437 def visit_instance_variable_and_write_node(node); end # Visit a InstanceVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2458 + # source://prism//lib/prism/dot_visitor.rb#2464 def visit_instance_variable_operator_write_node(node); end # Visit a InstanceVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2488 + # source://prism//lib/prism/dot_visitor.rb#2494 def visit_instance_variable_or_write_node(node); end # Visit a InstanceVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#2515 + # source://prism//lib/prism/dot_visitor.rb#2521 def visit_instance_variable_read_node(node); end # Visit a InstanceVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#2532 + # source://prism//lib/prism/dot_visitor.rb#2538 def visit_instance_variable_target_node(node); end # Visit a InstanceVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2549 + # source://prism//lib/prism/dot_visitor.rb#2555 def visit_instance_variable_write_node(node); end # Visit a IntegerNode node. # - # source://prism//lib/prism/dot_visitor.rb#2576 + # source://prism//lib/prism/dot_visitor.rb#2582 def visit_integer_node(node); end # Visit a InterpolatedMatchLastLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#2593 + # source://prism//lib/prism/dot_visitor.rb#2602 def visit_interpolated_match_last_line_node(node); end # Visit a InterpolatedRegularExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#2629 + # source://prism//lib/prism/dot_visitor.rb#2638 def visit_interpolated_regular_expression_node(node); end # Visit a InterpolatedStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#2665 + # source://prism//lib/prism/dot_visitor.rb#2674 def visit_interpolated_string_node(node); end # Visit a InterpolatedSymbolNode node. # - # source://prism//lib/prism/dot_visitor.rb#2702 + # source://prism//lib/prism/dot_visitor.rb#2714 def visit_interpolated_symbol_node(node); end # Visit a InterpolatedXStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#2739 + # source://prism//lib/prism/dot_visitor.rb#2751 def visit_interpolated_x_string_node(node); end + # Visit a ItParametersNode node. + # + # source://prism//lib/prism/dot_visitor.rb#2784 + def visit_it_parameters_node(node); end + # Visit a KeywordHashNode node. # - # source://prism//lib/prism/dot_visitor.rb#2772 + # source://prism//lib/prism/dot_visitor.rb#2798 def visit_keyword_hash_node(node); end # Visit a KeywordRestParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#2802 + # source://prism//lib/prism/dot_visitor.rb#2828 def visit_keyword_rest_parameter_node(node); end # Visit a LambdaNode node. # - # source://prism//lib/prism/dot_visitor.rb#2830 + # source://prism//lib/prism/dot_visitor.rb#2856 def visit_lambda_node(node); end # Visit a LocalVariableAndWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2868 + # source://prism//lib/prism/dot_visitor.rb#2894 def visit_local_variable_and_write_node(node); end # Visit a LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2898 + # source://prism//lib/prism/dot_visitor.rb#2924 def visit_local_variable_operator_write_node(node); end # Visit a LocalVariableOrWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#2931 + # source://prism//lib/prism/dot_visitor.rb#2957 def visit_local_variable_or_write_node(node); end # Visit a LocalVariableReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#2961 + # source://prism//lib/prism/dot_visitor.rb#2987 def visit_local_variable_read_node(node); end # Visit a LocalVariableTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#2981 + # source://prism//lib/prism/dot_visitor.rb#3007 def visit_local_variable_target_node(node); end # Visit a LocalVariableWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3001 + # source://prism//lib/prism/dot_visitor.rb#3027 def visit_local_variable_write_node(node); end # Visit a MatchLastLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#3031 + # source://prism//lib/prism/dot_visitor.rb#3057 def visit_match_last_line_node(node); end # Visit a MatchPredicateNode node. # - # source://prism//lib/prism/dot_visitor.rb#3060 + # source://prism//lib/prism/dot_visitor.rb#3086 def visit_match_predicate_node(node); end # Visit a MatchRequiredNode node. # - # source://prism//lib/prism/dot_visitor.rb#3085 + # source://prism//lib/prism/dot_visitor.rb#3111 def visit_match_required_node(node); end # Visit a MatchWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3110 + # source://prism//lib/prism/dot_visitor.rb#3136 def visit_match_write_node(node); end # Visit a MissingNode node. # - # source://prism//lib/prism/dot_visitor.rb#3141 + # source://prism//lib/prism/dot_visitor.rb#3167 def visit_missing_node(node); end # Visit a ModuleNode node. # - # source://prism//lib/prism/dot_visitor.rb#3155 + # source://prism//lib/prism/dot_visitor.rb#3181 def visit_module_node(node); end # Visit a MultiTargetNode node. # - # source://prism//lib/prism/dot_visitor.rb#3191 + # source://prism//lib/prism/dot_visitor.rb#3217 def visit_multi_target_node(node); end # Visit a MultiWriteNode node. # - # source://prism//lib/prism/dot_visitor.rb#3247 + # source://prism//lib/prism/dot_visitor.rb#3273 def visit_multi_write_node(node); end # Visit a NextNode node. # - # source://prism//lib/prism/dot_visitor.rb#3310 + # source://prism//lib/prism/dot_visitor.rb#3336 def visit_next_node(node); end # Visit a NilNode node. # - # source://prism//lib/prism/dot_visitor.rb#3333 + # source://prism//lib/prism/dot_visitor.rb#3359 def visit_nil_node(node); end # Visit a NoKeywordsParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3347 + # source://prism//lib/prism/dot_visitor.rb#3373 def visit_no_keywords_parameter_node(node); end # Visit a NumberedParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#3367 + # source://prism//lib/prism/dot_visitor.rb#3393 def visit_numbered_parameters_node(node); end # Visit a NumberedReferenceReadNode node. # - # source://prism//lib/prism/dot_visitor.rb#3384 + # source://prism//lib/prism/dot_visitor.rb#3410 def visit_numbered_reference_read_node(node); end # Visit a OptionalKeywordParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3401 + # source://prism//lib/prism/dot_visitor.rb#3427 def visit_optional_keyword_parameter_node(node); end # Visit a OptionalParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3428 + # source://prism//lib/prism/dot_visitor.rb#3454 def visit_optional_parameter_node(node); end # Visit a OrNode node. # - # source://prism//lib/prism/dot_visitor.rb#3458 + # source://prism//lib/prism/dot_visitor.rb#3484 def visit_or_node(node); end # Visit a ParametersNode node. # - # source://prism//lib/prism/dot_visitor.rb#3483 + # source://prism//lib/prism/dot_visitor.rb#3509 def visit_parameters_node(node); end # Visit a ParenthesesNode node. # - # source://prism//lib/prism/dot_visitor.rb#3567 + # source://prism//lib/prism/dot_visitor.rb#3593 def visit_parentheses_node(node); end # Visit a PinnedExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3593 + # source://prism//lib/prism/dot_visitor.rb#3619 def visit_pinned_expression_node(node); end # Visit a PinnedVariableNode node. # - # source://prism//lib/prism/dot_visitor.rb#3620 + # source://prism//lib/prism/dot_visitor.rb#3646 def visit_pinned_variable_node(node); end # Visit a PostExecutionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3641 + # source://prism//lib/prism/dot_visitor.rb#3667 def visit_post_execution_node(node); end # Visit a PreExecutionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3670 + # source://prism//lib/prism/dot_visitor.rb#3696 def visit_pre_execution_node(node); end # Visit a ProgramNode node. # - # source://prism//lib/prism/dot_visitor.rb#3699 + # source://prism//lib/prism/dot_visitor.rb#3725 def visit_program_node(node); end # Visit a RangeNode node. # - # source://prism//lib/prism/dot_visitor.rb#3720 + # source://prism//lib/prism/dot_visitor.rb#3746 def visit_range_node(node); end # Visit a RationalNode node. # - # source://prism//lib/prism/dot_visitor.rb#3752 + # source://prism//lib/prism/dot_visitor.rb#3778 def visit_rational_node(node); end # Visit a RedoNode node. # - # source://prism//lib/prism/dot_visitor.rb#3770 + # source://prism//lib/prism/dot_visitor.rb#3796 def visit_redo_node(node); end # Visit a RegularExpressionNode node. # - # source://prism//lib/prism/dot_visitor.rb#3784 + # source://prism//lib/prism/dot_visitor.rb#3810 def visit_regular_expression_node(node); end # Visit a RequiredKeywordParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3813 + # source://prism//lib/prism/dot_visitor.rb#3839 def visit_required_keyword_parameter_node(node); end # Visit a RequiredParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3836 + # source://prism//lib/prism/dot_visitor.rb#3862 def visit_required_parameter_node(node); end # Visit a RescueModifierNode node. # - # source://prism//lib/prism/dot_visitor.rb#3856 + # source://prism//lib/prism/dot_visitor.rb#3882 def visit_rescue_modifier_node(node); end # Visit a RescueNode node. # - # source://prism//lib/prism/dot_visitor.rb#3881 + # source://prism//lib/prism/dot_visitor.rb#3907 def visit_rescue_node(node); end # Visit a RestParameterNode node. # - # source://prism//lib/prism/dot_visitor.rb#3934 + # source://prism//lib/prism/dot_visitor.rb#3960 def visit_rest_parameter_node(node); end # Visit a RetryNode node. # - # source://prism//lib/prism/dot_visitor.rb#3962 + # source://prism//lib/prism/dot_visitor.rb#3988 def visit_retry_node(node); end # Visit a ReturnNode node. # - # source://prism//lib/prism/dot_visitor.rb#3976 + # source://prism//lib/prism/dot_visitor.rb#4002 def visit_return_node(node); end # Visit a SelfNode node. # - # source://prism//lib/prism/dot_visitor.rb#3999 + # source://prism//lib/prism/dot_visitor.rb#4028 def visit_self_node(node); end + # Visit a ShareableConstantNode node. + # + # source://prism//lib/prism/dot_visitor.rb#4042 + def visit_shareable_constant_node(node); end + # Visit a SingletonClassNode node. # - # source://prism//lib/prism/dot_visitor.rb#4013 + # source://prism//lib/prism/dot_visitor.rb#4063 def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node. # - # source://prism//lib/prism/dot_visitor.rb#4049 + # source://prism//lib/prism/dot_visitor.rb#4099 def visit_source_encoding_node(node); end # Visit a SourceFileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4063 + # source://prism//lib/prism/dot_visitor.rb#4113 def visit_source_file_node(node); end # Visit a SourceLineNode node. # - # source://prism//lib/prism/dot_visitor.rb#4080 + # source://prism//lib/prism/dot_visitor.rb#4133 def visit_source_line_node(node); end # Visit a SplatNode node. # - # source://prism//lib/prism/dot_visitor.rb#4094 + # source://prism//lib/prism/dot_visitor.rb#4147 def visit_splat_node(node); end # Visit a StatementsNode node. # - # source://prism//lib/prism/dot_visitor.rb#4117 + # source://prism//lib/prism/dot_visitor.rb#4170 def visit_statements_node(node); end # Visit a StringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4144 + # source://prism//lib/prism/dot_visitor.rb#4197 def visit_string_node(node); end # Visit a SuperNode node. # - # source://prism//lib/prism/dot_visitor.rb#4177 + # source://prism//lib/prism/dot_visitor.rb#4230 def visit_super_node(node); end # Visit a SymbolNode node. # - # source://prism//lib/prism/dot_visitor.rb#4216 + # source://prism//lib/prism/dot_visitor.rb#4269 def visit_symbol_node(node); end # Visit a TrueNode node. # - # source://prism//lib/prism/dot_visitor.rb#4251 + # source://prism//lib/prism/dot_visitor.rb#4304 def visit_true_node(node); end # Visit a UndefNode node. # - # source://prism//lib/prism/dot_visitor.rb#4265 + # source://prism//lib/prism/dot_visitor.rb#4318 def visit_undef_node(node); end # Visit a UnlessNode node. # - # source://prism//lib/prism/dot_visitor.rb#4295 + # source://prism//lib/prism/dot_visitor.rb#4348 def visit_unless_node(node); end # Visit a UntilNode node. # - # source://prism//lib/prism/dot_visitor.rb#4338 + # source://prism//lib/prism/dot_visitor.rb#4391 def visit_until_node(node); end # Visit a WhenNode node. # - # source://prism//lib/prism/dot_visitor.rb#4373 + # source://prism//lib/prism/dot_visitor.rb#4426 def visit_when_node(node); end # Visit a WhileNode node. # - # source://prism//lib/prism/dot_visitor.rb#4409 + # source://prism//lib/prism/dot_visitor.rb#4467 def visit_while_node(node); end # Visit a XStringNode node. # - # source://prism//lib/prism/dot_visitor.rb#4444 + # source://prism//lib/prism/dot_visitor.rb#4502 def visit_x_string_node(node); end # Visit a YieldNode node. # - # source://prism//lib/prism/dot_visitor.rb#4473 + # source://prism//lib/prism/dot_visitor.rb#4531 def visit_yield_node(node); end private @@ -11016,168 +12605,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#4519 + # source://prism//lib/prism/dot_visitor.rb#4577 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#4527 + # source://prism//lib/prism/dot_visitor.rb#4586 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#4535 + # source://prism//lib/prism/dot_visitor.rb#4594 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#4546 + # source://prism//lib/prism/dot_visitor.rb#4605 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#4555 + # source://prism//lib/prism/dot_visitor.rb#4614 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#4625 + 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#4566 + # source://prism//lib/prism/dot_visitor.rb#4634 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#4513 + # source://prism//lib/prism/dot_visitor.rb#4571 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#4574 + # source://prism//lib/prism/dot_visitor.rb#4642 def loop_flags_inspect(node); end # Generate a unique node ID for a node throughout the digraph. # - # source://prism//lib/prism/dot_visitor.rb#4508 + # source://prism//lib/prism/dot_visitor.rb#4566 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#4582 + # source://prism//lib/prism/dot_visitor.rb#4650 def parameter_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#4590 + # source://prism//lib/prism/dot_visitor.rb#4658 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#4598 + # source://prism//lib/prism/dot_visitor.rb#4666 def regular_expression_flags_inspect(node); end + # Inspect a node that has return_node_flags flags to display the flags as a + # comma-separated list. + # + # source://prism//lib/prism/dot_visitor.rb#4684 + def return_node_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#4692 + 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#4616 + # source://prism//lib/prism/dot_visitor.rb#4702 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#4626 + # source://prism//lib/prism/dot_visitor.rb#4713 def symbol_flags_inspect(node); end end -# source://prism//lib/prism/dot_visitor.rb#58 +# source://prism//lib/prism/dot_visitor.rb#59 class Prism::DotVisitor::Digraph # @return [Digraph] a new instance of Digraph # - # source://prism//lib/prism/dot_visitor.rb#61 + # source://prism//lib/prism/dot_visitor.rb#62 def initialize; end - # source://prism//lib/prism/dot_visitor.rb#75 + # source://prism//lib/prism/dot_visitor.rb#76 def edge(value); end # Returns the value of attribute edges. # - # source://prism//lib/prism/dot_visitor.rb#59 + # source://prism//lib/prism/dot_visitor.rb#60 def edges; end - # source://prism//lib/prism/dot_visitor.rb#67 + # source://prism//lib/prism/dot_visitor.rb#68 def node(value); end # Returns the value of attribute nodes. # - # source://prism//lib/prism/dot_visitor.rb#59 + # source://prism//lib/prism/dot_visitor.rb#60 def nodes; end - # source://prism//lib/prism/dot_visitor.rb#79 + # source://prism//lib/prism/dot_visitor.rb#80 def to_dot; end - # source://prism//lib/prism/dot_visitor.rb#71 + # source://prism//lib/prism/dot_visitor.rb#72 def waypoint(value); end # Returns the value of attribute waypoints. # - # source://prism//lib/prism/dot_visitor.rb#59 + # source://prism//lib/prism/dot_visitor.rb#60 def waypoints; end end -# source://prism//lib/prism/dot_visitor.rb#14 +# source://prism//lib/prism/dot_visitor.rb#15 class Prism::DotVisitor::Field # @return [Field] a new instance of Field # - # source://prism//lib/prism/dot_visitor.rb#17 + # source://prism//lib/prism/dot_visitor.rb#18 def initialize(name, value, port); end # Returns the value of attribute name. # - # source://prism//lib/prism/dot_visitor.rb#15 + # source://prism//lib/prism/dot_visitor.rb#16 def name; end # Returns the value of attribute port. # - # source://prism//lib/prism/dot_visitor.rb#15 + # source://prism//lib/prism/dot_visitor.rb#16 def port; end - # source://prism//lib/prism/dot_visitor.rb#23 + # source://prism//lib/prism/dot_visitor.rb#24 def to_dot; end # Returns the value of attribute value. # - # source://prism//lib/prism/dot_visitor.rb#15 + # source://prism//lib/prism/dot_visitor.rb#16 def value; end end -# source://prism//lib/prism/dot_visitor.rb#32 +# source://prism//lib/prism/dot_visitor.rb#33 class Prism::DotVisitor::Table # @return [Table] a new instance of Table # - # source://prism//lib/prism/dot_visitor.rb#35 + # source://prism//lib/prism/dot_visitor.rb#36 def initialize(name); end - # source://prism//lib/prism/dot_visitor.rb#40 + # source://prism//lib/prism/dot_visitor.rb#41 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#33 + # source://prism//lib/prism/dot_visitor.rb#34 def fields; end # Returns the value of attribute name. # - # source://prism//lib/prism/dot_visitor.rb#33 + # source://prism//lib/prism/dot_visitor.rb#34 def name; end - # source://prism//lib/prism/dot_visitor.rb#44 + # source://prism//lib/prism/dot_visitor.rb#45 def to_dot; end end @@ -11186,92 +12793,116 @@ end # if a then b else c end # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6290 +# source://prism//lib/prism/node.rb#6235 class Prism::ElseNode < ::Prism::Node # def initialize: (Location else_keyword_loc, StatementsNode? statements, Location? end_keyword_loc, Location location) -> void # # @return [ElseNode] a new instance of ElseNode # - # source://prism//lib/prism/node.rb#6292 + # source://prism//lib/prism/node.rb#6237 + sig do + params( + source: Prism::Source, + else_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, else_keyword_loc, statements, end_keyword_loc, location); 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#6349 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6302 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6247 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6307 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6252 + 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#6319 + # source://prism//lib/prism/node.rb#6264 + 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#6312 + # source://prism//lib/prism/node.rb#6257 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ElseNode + # def copy: (?else_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location?, ?location: Location) -> ElseNode # - # source://prism//lib/prism/node.rb#6324 - sig { params(params: T.untyped).returns(Prism::ElseNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6269 + sig do + params( + else_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::ElseNode) + end + def copy(else_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6307 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6252 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#6338 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6277 + 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#6365 + # source://prism//lib/prism/node.rb#6305 sig { returns(String) } def else_keyword; end # attr_reader else_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6343 + # source://prism//lib/prism/node.rb#6282 sig { returns(Prism::Location) } def else_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//lib/prism/node.rb#6370 + # source://prism//lib/prism/node.rb#6310 sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#6352 + # source://prism//lib/prism/node.rb#6292 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6375 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6315 + sig { override.returns(String) } + def inspect; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6349 + # source://prism//lib/prism/node.rb#6289 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -11290,7 +12921,8 @@ class Prism::ElseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6402 + # source://prism//lib/prism/node.rb#6333 + sig { override.returns(Symbol) } def type; end class << self @@ -11301,7 +12933,7 @@ class Prism::ElseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6412 + # source://prism//lib/prism/node.rb#6343 def type; end end end @@ -11309,18 +12941,20 @@ end # EmbDocComment objects correspond to comments that are surrounded by =begin # and =end. # -# source://prism//lib/prism/parse_result.rb#290 +# source://prism//lib/prism/parse_result.rb#403 class Prism::EmbDocComment < ::Prism::Comment # Returns a string representation of this comment. # - # source://prism//lib/prism/parse_result.rb#297 + # source://prism//lib/prism/parse_result.rb#410 + sig { returns(String) } def inspect; end # This can only be true for inline comments. # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#292 + # source://prism//lib/prism/parse_result.rb#405 + sig { override.returns(T::Boolean) } def trailing?; end end @@ -11329,92 +12963,116 @@ end # "foo #{bar}" # ^^^^^^ # -# source://prism//lib/prism/node.rb#6421 +# source://prism//lib/prism/node.rb#6361 class Prism::EmbeddedStatementsNode < ::Prism::Node # def initialize: (Location opening_loc, StatementsNode? statements, Location closing_loc, Location location) -> void # # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6423 + # source://prism//lib/prism/node.rb#6363 + sig do + params( + source: Prism::Source, + opening_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + closing_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, opening_loc, statements, closing_loc, location); 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#6469 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6433 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6373 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6438 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6378 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#6495 + # source://prism//lib/prism/node.rb#6430 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#6483 + # source://prism//lib/prism/node.rb#6418 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6450 + # source://prism//lib/prism/node.rb#6390 + 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#6443 + # source://prism//lib/prism/node.rb#6383 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> EmbeddedStatementsNode + # def copy: (?opening_loc: Location, ?statements: StatementsNode?, ?closing_loc: Location, ?location: Location) -> EmbeddedStatementsNode # - # source://prism//lib/prism/node.rb#6455 - sig { params(params: T.untyped).returns(Prism::EmbeddedStatementsNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6395 + sig do + params( + opening_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::EmbeddedStatementsNode) + end + def copy(opening_loc: T.unsafe(nil), statements: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6438 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6378 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, statements: StatementsNode?, closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6469 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6403 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6500 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6435 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#6490 + # source://prism//lib/prism/node.rb#6425 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#6474 + # source://prism//lib/prism/node.rb#6408 sig { returns(Prism::Location) } def opening_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6480 + # source://prism//lib/prism/node.rb#6415 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -11433,7 +13091,8 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6527 + # source://prism//lib/prism/node.rb#6453 + sig { override.returns(Symbol) } def type; end class << self @@ -11444,7 +13103,7 @@ class Prism::EmbeddedStatementsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6537 + # source://prism//lib/prism/node.rb#6463 def type; end end end @@ -11454,74 +13113,96 @@ end # "foo #@bar" # ^^^^^ # -# source://prism//lib/prism/node.rb#6546 +# source://prism//lib/prism/node.rb#6481 class Prism::EmbeddedVariableNode < ::Prism::Node - # def initialize: (Location operator_loc, Node variable, Location location) -> void + # def initialize: (Location operator_loc, Prism::node variable, Location location) -> void # # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6548 + # source://prism//lib/prism/node.rb#6483 + sig do + params( + source: Prism::Source, + operator_loc: Prism::Location, + variable: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, operator_loc, variable, location); 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#6574 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6557 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6492 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6562 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6497 + 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#6572 + # source://prism//lib/prism/node.rb#6507 + 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#6567 + # source://prism//lib/prism/node.rb#6502 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> EmbeddedVariableNode + # def copy: (?operator_loc: Location, ?variable: Prism::node, ?location: Location) -> EmbeddedVariableNode # - # source://prism//lib/prism/node.rb#6577 - sig { params(params: T.untyped).returns(Prism::EmbeddedVariableNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6512 + sig do + params( + operator_loc: Prism::Location, + variable: Prism::Node, + location: Prism::Location + ).returns(Prism::EmbeddedVariableNode) + end + def copy(operator_loc: T.unsafe(nil), variable: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6562 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6497 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, variable: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, variable: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#6590 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6520 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6610 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6540 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#6605 + # source://prism//lib/prism/node.rb#6535 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#6595 + # source://prism//lib/prism/node.rb#6525 sig { returns(Prism::Location) } def operator_loc; end @@ -11540,12 +13221,13 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6632 + # source://prism//lib/prism/node.rb#6558 + sig { override.returns(Symbol) } def type; end - # attr_reader variable: Node + # attr_reader variable: Prism::node # - # source://prism//lib/prism/node.rb#6601 + # source://prism//lib/prism/node.rb#6532 sig { returns(Prism::Node) } def variable; end @@ -11557,24 +13239,24 @@ class Prism::EmbeddedVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6642 + # source://prism//lib/prism/node.rb#6568 def type; end end end # Flags for nodes that have unescaped content. # -# source://prism//lib/prism/node.rb#19268 +# source://prism//lib/prism/node.rb#19232 module Prism::EncodingFlags; end # internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#19273 +# source://prism//lib/prism/node.rb#19237 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#19270 +# source://prism//lib/prism/node.rb#19234 Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # Represents an `ensure` clause in a `begin` statement. @@ -11586,92 +13268,116 @@ Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) # bar # end # -# source://prism//lib/prism/node.rb#6655 +# source://prism//lib/prism/node.rb#6589 class Prism::EnsureNode < ::Prism::Node # def initialize: (Location ensure_keyword_loc, StatementsNode? statements, Location end_keyword_loc, Location location) -> void # # @return [EnsureNode] a new instance of EnsureNode # - # source://prism//lib/prism/node.rb#6657 + # source://prism//lib/prism/node.rb#6591 + sig do + params( + source: Prism::Source, + ensure_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, ensure_keyword_loc, statements, end_keyword_loc, location); 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#6697 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6667 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6601 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6672 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6606 + 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#6684 + # source://prism//lib/prism/node.rb#6618 + 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#6677 + # source://prism//lib/prism/node.rb#6611 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> EnsureNode + # def copy: (?ensure_keyword_loc: Location, ?statements: StatementsNode?, ?end_keyword_loc: Location, ?location: Location) -> EnsureNode # - # source://prism//lib/prism/node.rb#6689 - sig { params(params: T.untyped).returns(Prism::EnsureNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6623 + sig do + params( + ensure_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::EnsureNode) + end + def copy(ensure_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6672 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6606 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#6703 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6631 + 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#6729 + # source://prism//lib/prism/node.rb#6658 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6717 + # source://prism//lib/prism/node.rb#6646 sig { returns(Prism::Location) } def end_keyword_loc; end # def ensure_keyword: () -> String # - # source://prism//lib/prism/node.rb#6724 + # source://prism//lib/prism/node.rb#6653 sig { returns(String) } def ensure_keyword; end # attr_reader ensure_keyword_loc: Location # - # source://prism//lib/prism/node.rb#6708 + # source://prism//lib/prism/node.rb#6636 sig { returns(Prism::Location) } def ensure_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6734 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6663 + sig { override.returns(String) } + def inspect; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#6714 + # source://prism//lib/prism/node.rb#6643 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -11690,7 +13396,8 @@ class Prism::EnsureNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6761 + # source://prism//lib/prism/node.rb#6681 + sig { override.returns(Symbol) } def type; end class << self @@ -11701,7 +13408,7 @@ class Prism::EnsureNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6771 + # source://prism//lib/prism/node.rb#6691 def type; end end end @@ -11711,64 +13418,73 @@ end # false # ^^^^^ # -# source://prism//lib/prism/node.rb#6780 +# source://prism//lib/prism/node.rb#6709 class Prism::FalseNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [FalseNode] a new instance of FalseNode # - # source://prism//lib/prism/node.rb#6782 + # source://prism//lib/prism/node.rb#6711 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#6785 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6789 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6718 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6794 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6723 + 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#6804 + # source://prism//lib/prism/node.rb#6733 + 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#6799 + # source://prism//lib/prism/node.rb#6728 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> FalseNode + # def copy: (?location: Location) -> FalseNode # - # source://prism//lib/prism/node.rb#6809 - sig { params(params: T.untyped).returns(Prism::FalseNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6738 + sig { params(location: Prism::Location).returns(Prism::FalseNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6794 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6723 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#6820 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6746 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6826 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6751 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -11785,7 +13501,8 @@ class Prism::FalseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#6845 + # source://prism//lib/prism/node.rb#6769 + sig { override.returns(Symbol) } def type; end class << self @@ -11796,7 +13513,7 @@ class Prism::FalseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#6855 + # source://prism//lib/prism/node.rb#6779 def type; end end end @@ -11812,110 +13529,140 @@ end # foo in Foo(*bar, baz, *qux) # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#6870 +# source://prism//lib/prism/node.rb#6800 class Prism::FindPatternNode < ::Prism::Node - # def initialize: (Node? constant, Node left, Array[Node] requireds, Node right, Location? opening_loc, Location? closing_loc, Location location) -> void + # def initialize: (Prism::node? constant, Prism::node left, Array[Prism::node] requireds, Prism::node right, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [FindPatternNode] a new instance of FindPatternNode # - # source://prism//lib/prism/node.rb#6872 + # source://prism//lib/prism/node.rb#6802 + sig do + params( + source: Prism::Source, + constant: T.nilable(Prism::Node), + left: Prism::Node, + requireds: T::Array[Prism::Node], + right: Prism::Node, + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, constant, left, requireds, right, opening_loc, closing_loc, location); 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#6935 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#6885 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6815 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6890 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6820 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#6974 + # source://prism//lib/prism/node.rb#6896 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#6956 + # source://prism//lib/prism/node.rb#6878 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#6905 + # source://prism//lib/prism/node.rb#6835 + 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#6895 + # source://prism//lib/prism/node.rb#6825 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: Node? + # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#6932 + # source://prism//lib/prism/node.rb#6853 sig { returns(T.nilable(Prism::Node)) } def constant; end - # def copy: (**params) -> FindPatternNode + # def copy: (?constant: Prism::node?, ?left: Prism::node, ?requireds: Array[Prism::node], ?right: Prism::node, ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> FindPatternNode # - # source://prism//lib/prism/node.rb#6910 - sig { params(params: T.untyped).returns(Prism::FindPatternNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6840 + sig do + params( + constant: T.nilable(Prism::Node), + left: Prism::Node, + requireds: T::Array[Prism::Node], + right: Prism::Node, + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::FindPatternNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#6890 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6820 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, left: Node, requireds: Array[Node], right: Node, opening_loc: Location?, closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, left: Prism::node, requireds: Array[Prism::node], right: Prism::node, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#6927 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6848 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#6979 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6901 + sig { override.returns(String) } + def inspect; end - # attr_reader left: Node + # attr_reader left: Prism::node # - # source://prism//lib/prism/node.rb#6935 + # source://prism//lib/prism/node.rb#6856 sig { returns(Prism::Node) } def left; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#6969 + # source://prism//lib/prism/node.rb#6891 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#6944 + # source://prism//lib/prism/node.rb#6865 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader requireds: Array[Node] + # attr_reader requireds: Array[Prism::node] # - # source://prism//lib/prism/node.rb#6938 + # source://prism//lib/prism/node.rb#6859 sig { returns(T::Array[Prism::Node]) } def requireds; end - # attr_reader right: Node + # attr_reader right: Prism::node # - # source://prism//lib/prism/node.rb#6941 + # source://prism//lib/prism/node.rb#6862 sig { returns(Prism::Node) } def right; end @@ -11934,7 +13681,8 @@ class Prism::FindPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7011 + # source://prism//lib/prism/node.rb#6919 + sig { override.returns(Symbol) } def type; end class << self @@ -11945,7 +13693,7 @@ class Prism::FindPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7021 + # source://prism//lib/prism/node.rb#6929 def type; end end end @@ -11955,94 +13703,120 @@ end # baz if foo .. bar # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7030 +# source://prism//lib/prism/node.rb#6951 class Prism::FlipFlopNode < ::Prism::Node - # def initialize: (Integer flags, Node? left, Node? right, Location operator_loc, Location location) -> void + # def initialize: (Integer flags, Prism::node? left, Prism::node? right, Location operator_loc, Location location) -> void # # @return [FlipFlopNode] a new instance of FlipFlopNode # - # source://prism//lib/prism/node.rb#7032 + # source://prism//lib/prism/node.rb#6953 + sig do + params( + source: Prism::Source, + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, flags, left, right, operator_loc, location); 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#7061 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7043 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#6964 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7048 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6969 + 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#7061 + # source://prism//lib/prism/node.rb#6982 + 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#7053 + # source://prism//lib/prism/node.rb#6974 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> FlipFlopNode + # def copy: (?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location, ?location: Location) -> FlipFlopNode # - # source://prism//lib/prism/node.rb#7066 - sig { params(params: T.untyped).returns(Prism::FlipFlopNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#6987 + sig do + params( + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::FlipFlopNode) + end + def copy(flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7048 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#6969 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Prism::node?, right: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#7081 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#6995 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # def exclude_end?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#7103 + # source://prism//lib/prism/node.rb#7017 sig { returns(T::Boolean) } def exclude_end?; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7113 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7027 + sig { override.returns(String) } + def inspect; end - # attr_reader left: Node? + # attr_reader left: Prism::node? # - # source://prism//lib/prism/node.rb#7090 + # source://prism//lib/prism/node.rb#7004 sig { returns(T.nilable(Prism::Node)) } def left; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7108 + # source://prism//lib/prism/node.rb#7022 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7096 + # source://prism//lib/prism/node.rb#7010 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader right: Node? + # attr_reader right: Prism::node? # - # source://prism//lib/prism/node.rb#7093 + # source://prism//lib/prism/node.rb#7007 sig { returns(T.nilable(Prism::Node)) } def right; end @@ -12061,14 +13835,15 @@ class Prism::FlipFlopNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7147 + # source://prism//lib/prism/node.rb#7045 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#7086 + # source://prism//lib/prism/node.rb#7000 sig { returns(Integer) } def flags; end @@ -12080,7 +13855,7 @@ class Prism::FlipFlopNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7157 + # source://prism//lib/prism/node.rb#7055 def type; end end end @@ -12090,64 +13865,73 @@ end # 1.0 # ^^^ # -# source://prism//lib/prism/node.rb#7166 +# source://prism//lib/prism/node.rb#7074 class Prism::FloatNode < ::Prism::Node - # def initialize: (Location location) -> void + # def initialize: (Float value, Location location) -> void # # @return [FloatNode] a new instance of FloatNode # - # source://prism//lib/prism/node.rb#7168 - def initialize(source, location); end + # source://prism//lib/prism/node.rb#7076 + sig { params(source: Prism::Source, value: Float, location: Prism::Location).void } + def initialize(source, value, location); 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#7154 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7175 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7084 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7180 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7089 + 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#7190 + # source://prism//lib/prism/node.rb#7099 + 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#7185 + # source://prism//lib/prism/node.rb#7094 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> FloatNode + # def copy: (?value: Float, ?location: Location) -> FloatNode # - # source://prism//lib/prism/node.rb#7195 - sig { params(params: T.untyped).returns(Prism::FloatNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7104 + sig { params(value: Float, location: Prism::Location).returns(Prism::FloatNode) } + def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7180 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7089 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Float, location: Location } # - # source://prism//lib/prism/node.rb#7206 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7112 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7212 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7120 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -12164,12 +13948,14 @@ class Prism::FloatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7231 + # source://prism//lib/prism/node.rb#7138 + sig { override.returns(Symbol) } def type; end - # Returns the value of the node as a Ruby Float. + # The value of the floating point number as a Float. # - # source://prism//lib/prism/node_ext.rb#62 + # source://prism//lib/prism/node.rb#7117 + sig { returns(Float) } def value; end class << self @@ -12180,7 +13966,7 @@ class Prism::FloatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7241 + # source://prism//lib/prism/node.rb#7148 def type; end end end @@ -12190,128 +13976,160 @@ end # for i in a end # ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7250 +# source://prism//lib/prism/node.rb#7164 class Prism::ForNode < ::Prism::Node - # def initialize: (Node index, Node collection, StatementsNode? statements, Location for_keyword_loc, Location in_keyword_loc, Location? do_keyword_loc, Location end_keyword_loc, Location location) -> void + # def initialize: (Prism::node index, Prism::node collection, StatementsNode? statements, Location for_keyword_loc, Location in_keyword_loc, Location? do_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [ForNode] a new instance of ForNode # - # source://prism//lib/prism/node.rb#7252 + # source://prism//lib/prism/node.rb#7166 + sig do + params( + source: Prism::Source, + index: Prism::Node, + collection: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + for_keyword_loc: Prism::Location, + in_keyword_loc: Prism::Location, + do_keyword_loc: T.nilable(Prism::Location), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc, location); 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#7314 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7266 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7180 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7271 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7185 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # attr_reader collection: Node + # attr_reader collection: Prism::node # - # source://prism//lib/prism/node.rb#7316 + # source://prism//lib/prism/node.rb#7220 sig { returns(Prism::Node) } def collection; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#7285 + # source://prism//lib/prism/node.rb#7199 + 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#7276 + # source://prism//lib/prism/node.rb#7190 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ForNode + # def copy: (?index: Prism::node, ?collection: Prism::node, ?statements: StatementsNode?, ?for_keyword_loc: Location, ?in_keyword_loc: Location, ?do_keyword_loc: Location?, ?end_keyword_loc: Location, ?location: Location) -> ForNode # - # source://prism//lib/prism/node.rb#7290 - sig { params(params: T.untyped).returns(Prism::ForNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7204 + sig do + params( + index: Prism::Node, + collection: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + for_keyword_loc: Prism::Location, + in_keyword_loc: Prism::Location, + do_keyword_loc: T.nilable(Prism::Location), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ForNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7271 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7185 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { index: Node, collection: Node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { index: Prism::node, collection: Prism::node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#7308 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7212 + 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#7363 + # source://prism//lib/prism/node.rb#7270 sig { returns(T.nilable(String)) } def do_keyword; end # attr_reader do_keyword_loc: Location? # - # source://prism//lib/prism/node.rb#7334 + # source://prism//lib/prism/node.rb#7240 sig { returns(T.nilable(Prism::Location)) } def do_keyword_loc; end # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#7368 + # source://prism//lib/prism/node.rb#7275 sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#7346 + # source://prism//lib/prism/node.rb#7253 sig { returns(Prism::Location) } def end_keyword_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + # def for_keyword: () -> String # - # source://prism//lib/prism/node.rb#7353 + # source://prism//lib/prism/node.rb#7260 sig { returns(String) } def for_keyword; end # attr_reader for_keyword_loc: Location # - # source://prism//lib/prism/node.rb#7322 + # source://prism//lib/prism/node.rb#7226 sig { returns(Prism::Location) } def for_keyword_loc; end # def in_keyword: () -> String # - # source://prism//lib/prism/node.rb#7358 + # source://prism//lib/prism/node.rb#7265 sig { returns(String) } def in_keyword; end # attr_reader in_keyword_loc: Location # - # source://prism//lib/prism/node.rb#7328 + # source://prism//lib/prism/node.rb#7233 sig { returns(Prism::Location) } def in_keyword_loc; end - # attr_reader index: Node + # attr_reader index: Prism::node # - # source://prism//lib/prism/node.rb#7313 + # source://prism//lib/prism/node.rb#7217 sig { returns(Prism::Node) } def index; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#7373 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7280 + sig { override.returns(String) } + def inspect; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#7319 + # source://prism//lib/prism/node.rb#7223 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -12330,7 +14148,8 @@ class Prism::ForNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7406 + # source://prism//lib/prism/node.rb#7298 + sig { override.returns(Symbol) } def type; end class << self @@ -12341,7 +14160,7 @@ class Prism::ForNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7416 + # source://prism//lib/prism/node.rb#7308 def type; end end end @@ -12353,64 +14172,73 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7427 +# source://prism//lib/prism/node.rb#7332 class Prism::ForwardingArgumentsNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7429 + # source://prism//lib/prism/node.rb#7334 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#7408 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7436 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7341 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7441 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7346 + 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#7451 + # source://prism//lib/prism/node.rb#7356 + 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#7446 + # source://prism//lib/prism/node.rb#7351 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ForwardingArgumentsNode + # def copy: (?location: Location) -> ForwardingArgumentsNode # - # source://prism//lib/prism/node.rb#7456 - sig { params(params: T.untyped).returns(Prism::ForwardingArgumentsNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7361 + sig { params(location: Prism::Location).returns(Prism::ForwardingArgumentsNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7441 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7346 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#7467 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7369 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7473 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7374 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -12427,7 +14255,8 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7492 + # source://prism//lib/prism/node.rb#7392 + sig { override.returns(Symbol) } def type; end class << self @@ -12438,7 +14267,7 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7502 + # source://prism//lib/prism/node.rb#7402 def type; end end end @@ -12449,64 +14278,73 @@ end # ^^^ # end # -# source://prism//lib/prism/node.rb#7512 +# source://prism//lib/prism/node.rb#7418 class Prism::ForwardingParameterNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7514 + # source://prism//lib/prism/node.rb#7420 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#7494 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7521 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7427 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7526 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7432 + 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#7536 + # source://prism//lib/prism/node.rb#7442 + 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#7531 + # source://prism//lib/prism/node.rb#7437 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ForwardingParameterNode + # def copy: (?location: Location) -> ForwardingParameterNode # - # source://prism//lib/prism/node.rb#7541 - sig { params(params: T.untyped).returns(Prism::ForwardingParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7447 + sig { params(location: Prism::Location).returns(Prism::ForwardingParameterNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7526 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7432 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#7552 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7455 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7558 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7460 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -12523,7 +14361,8 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7577 + # source://prism//lib/prism/node.rb#7478 + sig { override.returns(Symbol) } def type; end class << self @@ -12534,7 +14373,7 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7587 + # source://prism//lib/prism/node.rb#7488 def type; end end end @@ -12544,70 +14383,79 @@ end # super # ^^^^^ # -# source://prism//lib/prism/node.rb#7596 +# source://prism//lib/prism/node.rb#7503 class Prism::ForwardingSuperNode < ::Prism::Node # def initialize: (BlockNode? block, Location location) -> void # # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7598 + # source://prism//lib/prism/node.rb#7505 + sig { params(source: Prism::Source, block: T.nilable(Prism::BlockNode), location: Prism::Location).void } def initialize(source, block, location); 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#7585 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7606 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7513 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader block: BlockNode? # - # source://prism//lib/prism/node.rb#7645 + # source://prism//lib/prism/node.rb#7548 sig { returns(T.nilable(Prism::BlockNode)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7611 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7518 + 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#7623 + # source://prism//lib/prism/node.rb#7530 + 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#7616 + # source://prism//lib/prism/node.rb#7523 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ForwardingSuperNode + # def copy: (?block: BlockNode?, ?location: Location) -> ForwardingSuperNode # - # source://prism//lib/prism/node.rb#7628 - sig { params(params: T.untyped).returns(Prism::ForwardingSuperNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7535 + sig { params(block: T.nilable(Prism::BlockNode), location: Prism::Location).returns(Prism::ForwardingSuperNode) } + def copy(block: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7611 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7518 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { block: BlockNode?, location: Location } # - # source://prism//lib/prism/node.rb#7640 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7543 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7649 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7551 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -12624,7 +14472,8 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7674 + # source://prism//lib/prism/node.rb#7569 + sig { override.returns(Symbol) } def type; end class << self @@ -12635,7 +14484,7 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7684 + # source://prism//lib/prism/node.rb#7579 def type; end end end @@ -12645,89 +14494,115 @@ end # $target &&= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7693 +# source://prism//lib/prism/node.rb#7595 class Prism::GlobalVariableAndWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7695 + # source://prism//lib/prism/node.rb#7597 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#7700 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7706 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7608 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7711 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7613 + 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#7721 + # source://prism//lib/prism/node.rb#7623 + 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#7716 + # source://prism//lib/prism/node.rb#7618 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableAndWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> GlobalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#7726 - sig { params(params: T.untyped).returns(Prism::GlobalVariableAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7628 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::GlobalVariableAndWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7711 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7613 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#7741 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7636 + 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#161 + # source://prism//lib/prism/desugar_compiler.rb#163 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7770 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7666 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7746 + # source://prism//lib/prism/node.rb#7641 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7749 + # source://prism//lib/prism/node.rb#7644 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#7765 + # source://prism//lib/prism/node.rb#7661 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7755 + # source://prism//lib/prism/node.rb#7651 sig { returns(Prism::Location) } def operator_loc; end @@ -12746,12 +14621,13 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7794 + # source://prism//lib/prism/node.rb#7684 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7761 + # source://prism//lib/prism/node.rb#7658 sig { returns(Prism::Node) } def value; end @@ -12763,7 +14639,7 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7804 + # source://prism//lib/prism/node.rb#7694 def type; end end end @@ -12773,90 +14649,130 @@ end # $target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7813 +# source://prism//lib/prism/node.rb#7713 class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7815 - def initialize(source, name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#7715 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, binary_operator_loc, value, binary_operator, location); 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#7817 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7827 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7727 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#7780 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#7770 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7832 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7732 + 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#7842 + # source://prism//lib/prism/node.rb#7742 + 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#7837 + # source://prism//lib/prism/node.rb#7737 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableOperatorWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> GlobalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#7847 - sig { params(params: T.untyped).returns(Prism::GlobalVariableOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7747 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).returns(Prism::GlobalVariableOperatorWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7832 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7732 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#7863 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7755 + 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#173 + # source://prism//lib/prism/desugar_compiler.rb#175 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#7890 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7783 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7868 + # source://prism//lib/prism/node.rb#7760 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7871 + # source://prism//lib/prism/node.rb#7763 sig { returns(Prism::Location) } def name_loc; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#7886 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#371 def operator; end - # attr_reader operator_loc: Location + # 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.rb#7877 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#378 def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -12874,12 +14790,13 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#7915 + # source://prism//lib/prism/node.rb#7801 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#7883 + # source://prism//lib/prism/node.rb#7777 sig { returns(Prism::Node) } def value; end @@ -12891,7 +14808,7 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#7925 + # source://prism//lib/prism/node.rb#7811 def type; end end end @@ -12901,89 +14818,115 @@ end # $target ||= value # ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#7934 +# source://prism//lib/prism/node.rb#7831 class Prism::GlobalVariableOrWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7936 + # source://prism//lib/prism/node.rb#7833 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, operator_loc, value, location); 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#7936 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#7947 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7844 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7952 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7849 + 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#7962 + # source://prism//lib/prism/node.rb#7859 + 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#7957 + # source://prism//lib/prism/node.rb#7854 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableOrWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> GlobalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#7967 - sig { params(params: T.untyped).returns(Prism::GlobalVariableOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7864 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::GlobalVariableOrWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#7952 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7849 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#7982 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7872 + 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#167 + # source://prism//lib/prism/desugar_compiler.rb#169 def desugar; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8011 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7902 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#7987 + # source://prism//lib/prism/node.rb#7877 sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#7990 + # source://prism//lib/prism/node.rb#7880 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#8006 + # source://prism//lib/prism/node.rb#7897 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#7996 + # source://prism//lib/prism/node.rb#7887 sig { returns(Prism::Location) } def operator_loc; end @@ -13002,12 +14945,13 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8035 + # source://prism//lib/prism/node.rb#7920 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#8002 + # source://prism//lib/prism/node.rb#7894 sig { returns(Prism::Node) } def value; end @@ -13019,7 +14963,7 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8045 + # source://prism//lib/prism/node.rb#7930 def type; end end end @@ -13029,64 +14973,73 @@ end # $foo # ^^^^ # -# source://prism//lib/prism/node.rb#8054 +# source://prism//lib/prism/node.rb#7949 class Prism::GlobalVariableReadNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#8056 + # source://prism//lib/prism/node.rb#7951 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#8033 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8064 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#7959 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8069 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7964 + 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#8079 + # source://prism//lib/prism/node.rb#7974 + 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#8074 + # source://prism//lib/prism/node.rb#7969 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableReadNode + # def copy: (?name: Symbol, ?location: Location) -> GlobalVariableReadNode # - # source://prism//lib/prism/node.rb#8084 - sig { params(params: T.untyped).returns(Prism::GlobalVariableReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#7979 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::GlobalVariableReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8069 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#7964 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#8096 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#7987 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8109 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7999 + sig { override.returns(String) } + def inspect; end # The name of the global variable, which is a `$` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifier). Alternatively, it can be one of the special global variables designated by a symbol. # @@ -13094,7 +15047,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # $_Test # name `:$_Test` # - # source://prism//lib/prism/node.rb#8105 + # source://prism//lib/prism/node.rb#7996 sig { returns(Symbol) } def name; end @@ -13113,7 +15066,8 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8129 + # source://prism//lib/prism/node.rb#8017 + sig { override.returns(Symbol) } def type; end class << self @@ -13124,7 +15078,7 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8139 + # source://prism//lib/prism/node.rb#8027 def type; end end end @@ -13134,68 +15088,77 @@ end # $foo, $bar = baz # ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#8148 +# source://prism//lib/prism/node.rb#8043 class Prism::GlobalVariableTargetNode < ::Prism::Node # def initialize: (Symbol name, Location location) -> void # # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#8150 + # source://prism//lib/prism/node.rb#8045 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } def initialize(source, name, location); 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#8123 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8158 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8053 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8163 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8058 + 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#8173 + # source://prism//lib/prism/node.rb#8068 + 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#8168 + # source://prism//lib/prism/node.rb#8063 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableTargetNode + # def copy: (?name: Symbol, ?location: Location) -> GlobalVariableTargetNode # - # source://prism//lib/prism/node.rb#8178 - sig { params(params: T.untyped).returns(Prism::GlobalVariableTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8073 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::GlobalVariableTargetNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8163 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8058 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#8190 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8081 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8199 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8089 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#8195 + # source://prism//lib/prism/node.rb#8086 sig { returns(Symbol) } def name; end @@ -13214,7 +15177,8 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8219 + # source://prism//lib/prism/node.rb#8107 + sig { override.returns(Symbol) } def type; end class << self @@ -13225,7 +15189,7 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8229 + # source://prism//lib/prism/node.rb#8117 def type; end end end @@ -13235,86 +15199,122 @@ end # $foo = 1 # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#8238 +# source://prism//lib/prism/node.rb#8133 class Prism::GlobalVariableWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void + # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8240 + # source://prism//lib/prism/node.rb#8135 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, name, name_loc, value, operator_loc, location); 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#8254 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8251 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8146 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8256 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8151 + 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#8266 + # source://prism//lib/prism/node.rb#8161 + 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#8261 + # source://prism//lib/prism/node.rb#8156 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableWriteNode + # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> GlobalVariableWriteNode # - # source://prism//lib/prism/node.rb#8271 - sig { params(params: T.untyped).returns(Prism::GlobalVariableWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8166 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::GlobalVariableWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8256 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8151 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#8286 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8174 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8315 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8220 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # The name of the global variable, which is a `$` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifier). Alternatively, it can be one of the special global variables designated by a symbol. + # + # $foo = :bar # name `:$foo` # - # source://prism//lib/prism/node.rb#8291 + # $_Test = 123 # name `:$_Test` + # + # source://prism//lib/prism/node.rb#8183 sig { returns(Symbol) } def name; end - # attr_reader name_loc: Location + # The location of the global variable's name. # - # source://prism//lib/prism/node.rb#8294 + # $foo = :bar + # ^^^^ + # + # source://prism//lib/prism/node.rb#8189 sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#8310 + # source://prism//lib/prism/node.rb#8215 sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `=` operator. + # + # $foo = :bar + # ^ # - # source://prism//lib/prism/node.rb#8303 + # source://prism//lib/prism/node.rb#8208 sig { returns(Prism::Location) } def operator_loc; end @@ -13333,12 +15333,19 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8339 + # source://prism//lib/prism/node.rb#8238 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # The value to write to the global variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/node.rb#8300 + # $foo = :bar + # ^^^^ + # + # $-xyz = 123 + # ^^^ + # + # source://prism//lib/prism/node.rb#8202 sig { returns(Prism::Node) } def value; end @@ -13350,7 +15357,7 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8349 + # source://prism//lib/prism/node.rb#8248 def type; end end end @@ -13360,30 +15367,45 @@ end # { a => b } # ^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8358 +# source://prism//lib/prism/node.rb#8267 class Prism::HashNode < ::Prism::Node - # def initialize: (Location opening_loc, Array[Node] elements, Location closing_loc, Location location) -> void + # def initialize: (Location opening_loc, Array[AssocNode | AssocSplatNode] elements, Location closing_loc, Location location) -> void # # @return [HashNode] a new instance of HashNode # - # source://prism//lib/prism/node.rb#8360 + # source://prism//lib/prism/node.rb#8269 + sig do + params( + source: Prism::Source, + opening_loc: Prism::Location, + elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, opening_loc, elements, closing_loc, location); 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#8385 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8370 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8279 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8375 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8284 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#8442 + # source://prism//lib/prism/node.rb#8346 sig { returns(String) } def closing; end @@ -13392,41 +15414,46 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8430 + # source://prism//lib/prism/node.rb#8334 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8385 + # source://prism//lib/prism/node.rb#8294 + 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#8380 + # source://prism//lib/prism/node.rb#8289 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> HashNode + # def copy: (?opening_loc: Location, ?elements: Array[AssocNode | AssocSplatNode], ?closing_loc: Location, ?location: Location) -> HashNode # - # source://prism//lib/prism/node.rb#8390 - sig { params(params: T.untyped).returns(Prism::HashNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8299 + sig do + params( + opening_loc: Prism::Location, + elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::HashNode) + end + def copy(opening_loc: T.unsafe(nil), elements: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8375 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8284 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, elements: Array[Node], closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, elements: Array[AssocNode | AssocSplatNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#8404 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8307 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end # The elements of the hash. These can be either `AssocNode`s or `AssocSplatNode`s. @@ -13437,18 +15464,22 @@ class Prism::HashNode < ::Prism::Node # { **foo } # ^^^^^ # - # source://prism//lib/prism/node.rb#8424 - sig { returns(T::Array[Prism::Node]) } + # source://prism//lib/prism/node.rb#8328 + sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } def elements; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8447 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8351 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#8437 + # source://prism//lib/prism/node.rb#8341 sig { returns(String) } def opening; end @@ -13457,7 +15488,7 @@ class Prism::HashNode < ::Prism::Node # { a => b } # ^ # - # source://prism//lib/prism/node.rb#8412 + # source://prism//lib/prism/node.rb#8315 sig { returns(Prism::Location) } def opening_loc; end @@ -13476,7 +15507,8 @@ class Prism::HashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8469 + # source://prism//lib/prism/node.rb#8369 + sig { override.returns(Symbol) } def type; end class << self @@ -13487,7 +15519,7 @@ class Prism::HashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8479 + # source://prism//lib/prism/node.rb#8379 def type; end end end @@ -13500,105 +15532,133 @@ end # foo => { a: 1, b: 2, **c } # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8491 +# source://prism//lib/prism/node.rb#8401 class Prism::HashPatternNode < ::Prism::Node - # def initialize: (Node? constant, Array[Node] elements, Node? rest, Location? opening_loc, Location? closing_loc, Location location) -> void + # def initialize: (Prism::node? constant, Array[AssocNode] elements, AssocSplatNode | NoKeywordsParameterNode | nil rest, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [HashPatternNode] a new instance of HashPatternNode # - # source://prism//lib/prism/node.rb#8493 + # source://prism//lib/prism/node.rb#8403 + sig do + params( + source: Prism::Source, + constant: T.nilable(Prism::Node), + elements: T::Array[Prism::AssocNode], + rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)), + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, constant, elements, rest, opening_loc, closing_loc, location); 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#8531 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8505 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8415 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8510 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8420 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#8589 + # source://prism//lib/prism/node.rb#8492 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#8571 + # source://prism//lib/prism/node.rb#8474 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#8524 + # source://prism//lib/prism/node.rb#8434 + 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#8515 + # source://prism//lib/prism/node.rb#8425 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant: Node? + # attr_reader constant: Prism::node? # - # source://prism//lib/prism/node.rb#8550 + # source://prism//lib/prism/node.rb#8452 sig { returns(T.nilable(Prism::Node)) } def constant; end - # def copy: (**params) -> HashPatternNode + # def copy: (?constant: Prism::node?, ?elements: Array[AssocNode], ?rest: AssocSplatNode | NoKeywordsParameterNode | nil, ?opening_loc: Location?, ?closing_loc: Location?, ?location: Location) -> HashPatternNode # - # source://prism//lib/prism/node.rb#8529 - sig { params(params: T.untyped).returns(Prism::HashPatternNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8439 + sig do + params( + constant: T.nilable(Prism::Node), + elements: T::Array[Prism::AssocNode], + rest: T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode)), + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::HashPatternNode) + end + def copy(constant: T.unsafe(nil), elements: T.unsafe(nil), rest: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8510 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8420 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, elements: Array[Node], rest: Node?, opening_loc: Location?, closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Prism::node?, elements: Array[AssocNode], rest: AssocSplatNode | NoKeywordsParameterNode | nil, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#8545 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8447 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader elements: Array[Node] + # attr_reader elements: Array[AssocNode] # - # source://prism//lib/prism/node.rb#8553 - sig { returns(T::Array[Prism::Node]) } + # source://prism//lib/prism/node.rb#8455 + sig { returns(T::Array[Prism::AssocNode]) } def elements; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8594 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8497 + sig { override.returns(String) } + def inspect; end # def opening: () -> String? # - # source://prism//lib/prism/node.rb#8584 + # source://prism//lib/prism/node.rb#8487 sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#8559 + # source://prism//lib/prism/node.rb#8461 sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader rest: Node? + # attr_reader rest: AssocSplatNode | NoKeywordsParameterNode | nil # - # source://prism//lib/prism/node.rb#8556 - sig { returns(T.nilable(Prism::Node)) } + # source://prism//lib/prism/node.rb#8458 + sig { returns(T.nilable(T.any(Prism::AssocSplatNode, Prism::NoKeywordsParameterNode))) } def rest; end # Sometimes you want to check an instance of a node against a list of @@ -13616,7 +15676,8 @@ class Prism::HashPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8628 + # source://prism//lib/prism/node.rb#8515 + sig { override.returns(Symbol) } def type; end class << self @@ -13627,22 +15688,22 @@ class Prism::HashPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8638 + # source://prism//lib/prism/node.rb#8525 def type; end end end -# source://prism//lib/prism/node_ext.rb#35 +# source://prism//lib/prism/node_ext.rb#46 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#37 + # source://prism//lib/prism/node_ext.rb#48 def heredoc?; end end -# Represents the use of the `if` keyword, either in the block form or the modifier form. +# Represents the use of the `if` keyword, either in the block form or the modifier form, or a ternary expression. # # bar if foo # ^^^^^^^^^^ @@ -13650,119 +15711,198 @@ end # if foo then bar end # ^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#8650 +# foo ? bar : baz +# ^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8552 class Prism::IfNode < ::Prism::Node - # def initialize: (Location? if_keyword_loc, Node predicate, Location? then_keyword_loc, StatementsNode? statements, Node? consequent, Location? end_keyword_loc, Location location) -> void + # def initialize: (Location? if_keyword_loc, Prism::node predicate, Location? then_keyword_loc, StatementsNode? statements, Prism::node? consequent, Location? end_keyword_loc, Location location) -> void # # @return [IfNode] a new instance of IfNode # - # source://prism//lib/prism/node.rb#8652 + # source://prism//lib/prism/node.rb#8554 + sig do + params( + source: Prism::Source, + if_keyword_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::Node), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); 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#8751 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8665 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8567 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8674 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8576 + 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#8688 + # source://prism//lib/prism/node.rb#8590 + 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#8679 + # source://prism//lib/prism/node.rb#8581 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader consequent: Node? + # Represents an `ElseNode` or an `IfNode` when there is an `else` or an `elsif` in the `if` statement. + # + # if foo + # bar + # elsif baz + # ^^^^^^^^^ + # qux + # ^^^ + # end + # ^^^ # - # source://prism//lib/prism/node.rb#8745 + # if foo then bar else baz end + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/node.rb#8681 sig { returns(T.nilable(Prism::Node)) } def consequent; end - # def copy: (**params) -> IfNode + # def copy: (?if_keyword_loc: Location?, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?consequent: Prism::node?, ?end_keyword_loc: Location?, ?location: Location) -> IfNode # - # source://prism//lib/prism/node.rb#8693 - sig { params(params: T.untyped).returns(Prism::IfNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8595 + sig do + params( + if_keyword_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::Node), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::IfNode) + end + def copy(if_keyword_loc: T.unsafe(nil), predicate: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8674 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8576 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { if_keyword_loc: Location?, predicate: Node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: Node?, end_keyword_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { if_keyword_loc: Location?, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: Prism::node?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#8710 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8603 + 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#8771 + # source://prism//lib/prism/node.rb#8712 sig { returns(T.nilable(String)) } def end_keyword; end - # attr_reader end_keyword_loc: Location? + # The location of the `end` keyword if present, `nil` otherwise. # - # source://prism//lib/prism/node.rb#8748 + # if foo + # bar + # end + # ^^^ + # + # source://prism//lib/prism/node.rb#8689 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + # def if_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8761 + # source://prism//lib/prism/node.rb#8702 sig { returns(T.nilable(String)) } def if_keyword; end - # attr_reader if_keyword_loc: Location? + # The location of the `if` keyword if present. # - # source://prism//lib/prism/node.rb#8715 + # bar if foo + # ^^ + # + # The `if_keyword_loc` field will be `nil` when the `IfNode` represents a ternary expression. + # + # source://prism//lib/prism/node.rb#8613 sig { returns(T.nilable(Prism::Location)) } def if_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#8776 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8717 + sig { override.returns(String) } + def inspect; end - # attr_reader predicate: Node + # The node for the condition the `IfNode` is testing. + # + # if foo + # ^^^ + # bar + # end + # + # bar if foo + # ^^^ + # + # foo ? bar : baz + # ^^^ # - # source://prism//lib/prism/node.rb#8727 + # source://prism//lib/prism/node.rb#8637 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#8669 + # source://prism//lib/prism/node.rb#8571 def set_newline_flag(newline_marked); end - # attr_reader statements: StatementsNode? + # Represents the body of statements that will be executed when the predicate is evaluated as truthy. Will be `nil` when no body is provided. + # + # if foo + # bar + # ^^^ + # baz + # ^^^ + # end # - # source://prism//lib/prism/node.rb#8742 + # source://prism//lib/prism/node.rb#8666 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#8766 + # source://prism//lib/prism/node.rb#8707 sig { returns(T.nilable(String)) } def then_keyword; end - # attr_reader then_keyword_loc: Location? + # The location of the `then` keyword (if present) or the `?` in a ternary expression, `nil` otherwise. + # + # if foo then bar end + # ^^^^ # - # source://prism//lib/prism/node.rb#8730 + # a ? b : c + # ^ + # + # source://prism//lib/prism/node.rb#8646 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end @@ -13781,7 +15921,8 @@ class Prism::IfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8812 + # source://prism//lib/prism/node.rb#8735 + sig { override.returns(Symbol) } def type; end class << self @@ -13792,7 +15933,7 @@ class Prism::IfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8822 + # source://prism//lib/prism/node.rb#8745 def type; end end end @@ -13802,69 +15943,89 @@ end # 1.0i # ^^^^ # -# source://prism//lib/prism/node.rb#8831 +# source://prism//lib/prism/node.rb#8766 class Prism::ImaginaryNode < ::Prism::Node - # def initialize: (Node numeric, Location location) -> void + # def initialize: (FloatNode | IntegerNode | RationalNode numeric, Location location) -> void # # @return [ImaginaryNode] a new instance of ImaginaryNode # - # source://prism//lib/prism/node.rb#8833 + # source://prism//lib/prism/node.rb#8768 + sig do + params( + source: Prism::Source, + numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode), + location: Prism::Location + ).void + end def initialize(source, numeric, location); 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#8846 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8841 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8776 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8846 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8781 + 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#8856 + # source://prism//lib/prism/node.rb#8791 + 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#8851 + # source://prism//lib/prism/node.rb#8786 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ImaginaryNode + # def copy: (?numeric: FloatNode | IntegerNode | RationalNode, ?location: Location) -> ImaginaryNode # - # source://prism//lib/prism/node.rb#8861 - sig { params(params: T.untyped).returns(Prism::ImaginaryNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8796 + sig do + params( + numeric: T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode), + location: Prism::Location + ).returns(Prism::ImaginaryNode) + end + def copy(numeric: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8846 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8781 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: FloatNode | IntegerNode | RationalNode, location: Location } # - # source://prism//lib/prism/node.rb#8873 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8804 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8882 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8812 + sig { override.returns(String) } + def inspect; end - # attr_reader numeric: Node + # attr_reader numeric: FloatNode | IntegerNode | RationalNode # - # source://prism//lib/prism/node.rb#8878 - sig { returns(Prism::Node) } + # source://prism//lib/prism/node.rb#8809 + sig { returns(T.any(Prism::FloatNode, Prism::IntegerNode, Prism::RationalNode)) } def numeric; end # Sometimes you want to check an instance of a node against a list of @@ -13882,12 +16043,14 @@ class Prism::ImaginaryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#8903 + # source://prism//lib/prism/node.rb#8830 + sig { override.returns(Symbol) } def type; end # Returns the value of the node as a Ruby Complex. # - # source://prism//lib/prism/node_ext.rb#69 + # source://prism//lib/prism/node_ext.rb#98 + sig { returns(Complex) } def value; end class << self @@ -13898,7 +16061,7 @@ class Prism::ImaginaryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#8913 + # source://prism//lib/prism/node.rb#8840 def type; end end end @@ -13914,64 +16077,73 @@ end # foo in { bar: } # ^^^^ # -# source://prism//lib/prism/node.rb#8928 +# source://prism//lib/prism/node.rb#8862 class Prism::ImplicitNode < ::Prism::Node - # def initialize: (Node value, Location location) -> void + # def initialize: (Prism::node value, Location location) -> void # # @return [ImplicitNode] a new instance of ImplicitNode # - # source://prism//lib/prism/node.rb#8930 + # source://prism//lib/prism/node.rb#8864 + sig { params(source: Prism::Source, value: Prism::Node, location: Prism::Location).void } def initialize(source, value, location); 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#8942 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#8938 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#8872 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8943 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8877 + 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#8953 + # source://prism//lib/prism/node.rb#8887 + 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#8948 + # source://prism//lib/prism/node.rb#8882 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ImplicitNode + # def copy: (?value: Prism::node, ?location: Location) -> ImplicitNode # - # source://prism//lib/prism/node.rb#8958 - sig { params(params: T.untyped).returns(Prism::ImplicitNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8892 + sig { params(value: Prism::Node, location: Prism::Location).returns(Prism::ImplicitNode) } + def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#8943 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8877 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#8970 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8900 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#8979 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8908 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -13988,12 +16160,13 @@ class Prism::ImplicitNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9000 + # source://prism//lib/prism/node.rb#8926 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#8975 + # source://prism//lib/prism/node.rb#8905 sig { returns(Prism::Node) } def value; end @@ -14005,7 +16178,7 @@ class Prism::ImplicitNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9010 + # source://prism//lib/prism/node.rb#8936 def type; end end end @@ -14024,64 +16197,73 @@ end # foo, = bar # ^ # -# source://prism//lib/prism/node.rb#9028 +# source://prism//lib/prism/node.rb#8961 class Prism::ImplicitRestNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [ImplicitRestNode] a new instance of ImplicitRestNode # - # source://prism//lib/prism/node.rb#9030 + # source://prism//lib/prism/node.rb#8963 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); end - # def accept: (Visitor visitor) -> void + # 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#9037 - sig { params(visitor: Prism::Visitor).void } + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#8970 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9042 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8975 + 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#9052 + # source://prism//lib/prism/node.rb#8985 + 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#9047 + # source://prism//lib/prism/node.rb#8980 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ImplicitRestNode + # def copy: (?location: Location) -> ImplicitRestNode # - # source://prism//lib/prism/node.rb#9057 - sig { params(params: T.untyped).returns(Prism::ImplicitRestNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#8990 + sig { params(location: Prism::Location).returns(Prism::ImplicitRestNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9042 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#8975 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#9068 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#8998 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#9074 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9003 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -14098,7 +16280,8 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9093 + # source://prism//lib/prism/node.rb#9021 + sig { override.returns(Symbol) } def type; end class << self @@ -14109,7 +16292,7 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9103 + # source://prism//lib/prism/node.rb#9031 def type; end end end @@ -14119,98 +16302,124 @@ end # case a; in b then c end # ^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9112 +# source://prism//lib/prism/node.rb#9046 class Prism::InNode < ::Prism::Node - # def initialize: (Node pattern, StatementsNode? statements, Location in_loc, Location? then_loc, Location location) -> void + # def initialize: (Prism::node pattern, StatementsNode? statements, Location in_loc, Location? then_loc, Location location) -> void # # @return [InNode] a new instance of InNode # - # source://prism//lib/prism/node.rb#9114 + # source://prism//lib/prism/node.rb#9048 + sig do + params( + source: Prism::Source, + pattern: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + in_loc: Prism::Location, + then_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, pattern, statements, in_loc, then_loc, location); 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#9165 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9125 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#9059 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9130 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9064 + 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#9143 + # source://prism//lib/prism/node.rb#9077 + 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#9135 + # source://prism//lib/prism/node.rb#9069 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> InNode + # def copy: (?pattern: Prism::node, ?statements: StatementsNode?, ?in_loc: Location, ?then_loc: Location?, ?location: Location) -> InNode # - # source://prism//lib/prism/node.rb#9148 - sig { params(params: T.untyped).returns(Prism::InNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#9082 + sig do + params( + pattern: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + in_loc: Prism::Location, + then_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::InNode) + end + def copy(pattern: T.unsafe(nil), statements: T.unsafe(nil), in_loc: T.unsafe(nil), then_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9130 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9064 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { pattern: Node, statements: StatementsNode?, in_loc: Location, then_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { pattern: Prism::node, statements: StatementsNode?, in_loc: Location, then_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#9163 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#9090 + 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 in: () -> String # - # source://prism//lib/prism/node.rb#9193 + # source://prism//lib/prism/node.rb#9121 sig { returns(String) } def in; end # attr_reader in_loc: Location # - # source://prism//lib/prism/node.rb#9174 + # source://prism//lib/prism/node.rb#9101 sig { returns(Prism::Location) } def in_loc; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#9203 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9131 + sig { override.returns(String) } + def inspect; end - # attr_reader pattern: Node + # attr_reader pattern: Prism::node # - # source://prism//lib/prism/node.rb#9168 + # source://prism//lib/prism/node.rb#9095 sig { returns(Prism::Node) } def pattern; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#9171 + # source://prism//lib/prism/node.rb#9098 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then: () -> String? # - # source://prism//lib/prism/node.rb#9198 + # source://prism//lib/prism/node.rb#9126 sig { returns(T.nilable(String)) } def then; end # attr_reader then_loc: Location? # - # source://prism//lib/prism/node.rb#9180 + # source://prism//lib/prism/node.rb#9108 sig { returns(T.nilable(Prism::Location)) } def then_loc; end @@ -14229,7 +16438,8 @@ class Prism::InNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9232 + # source://prism//lib/prism/node.rb#9149 + sig { override.returns(Symbol) } def type; end class << self @@ -14240,7 +16450,7 @@ class Prism::InNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9242 + # source://prism//lib/prism/node.rb#9159 def type; end end end @@ -14250,24 +16460,45 @@ end # foo.bar[baz] &&= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9251 +# source://prism//lib/prism/node.rb#9178 class Prism::IndexAndWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location operator_loc, Prism::node value, Location location) -> void # # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9253 + # source://prism//lib/prism/node.rb#9180 + sig do + params( + source: Prism::Source, + 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::Node), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); 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#9358 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9269 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#9196 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9344 + # source://prism//lib/prism/node.rb#9261 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -14275,119 +16506,134 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9376 + # source://prism//lib/prism/node.rb#9294 sig { returns(T::Boolean) } def attribute_write?; end - # attr_reader block: Node? + # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9353 + # source://prism//lib/prism/node.rb#9271 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9386 + # source://prism//lib/prism/node.rb#9304 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9326 + # source://prism//lib/prism/node.rb#9241 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9274 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9201 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9396 + # source://prism//lib/prism/node.rb#9314 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9347 + # source://prism//lib/prism/node.rb#9264 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9289 + # source://prism//lib/prism/node.rb#9216 + 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#9279 + # source://prism//lib/prism/node.rb#9206 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> IndexAndWriteNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexAndWriteNode # - # source://prism//lib/prism/node.rb#9294 - sig { params(params: T.untyped).returns(Prism::IndexAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#9221 + sig do + params( + 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::Node), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::IndexAndWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9274 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9201 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9314 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#9229 + 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#9381 + # source://prism//lib/prism/node.rb#9299 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#9406 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9324 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9391 + # source://prism//lib/prism/node.rb#9309 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9338 + # source://prism//lib/prism/node.rb#9254 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9401 + # source://prism//lib/prism/node.rb#9319 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9356 + # source://prism//lib/prism/node.rb#9274 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9323 + # source://prism//lib/prism/node.rb#9238 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -14395,7 +16641,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9366 + # source://prism//lib/prism/node.rb#9284 sig { returns(T::Boolean) } def safe_navigation?; end @@ -14414,12 +16660,13 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9451 + # source://prism//lib/prism/node.rb#9342 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9362 + # source://prism//lib/prism/node.rb#9281 sig { returns(Prism::Node) } def value; end @@ -14427,15 +16674,15 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9371 + # source://prism//lib/prism/node.rb#9289 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9319 + # source://prism//lib/prism/node.rb#9234 sig { returns(Integer) } def flags; end @@ -14447,7 +16694,7 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9461 + # source://prism//lib/prism/node.rb#9352 def type; end end end @@ -14457,24 +16704,46 @@ end # foo.bar[baz] += value # ^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9470 +# source://prism//lib/prism/node.rb#9376 class Prism::IndexOperatorWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Symbol operator, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Symbol binary_operator, Location binary_operator_loc, Prism::node value, Location location) -> void # # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9472 - def initialize(source, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#9378 + sig do + params( + source: Prism::Source, + 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::Node), + binary_operator: Symbol, + binary_operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, binary_operator, binary_operator_loc, value, location); 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#9555 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9489 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#9395 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9565 + # source://prism//lib/prism/node.rb#9460 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -14482,119 +16751,147 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9600 + # source://prism//lib/prism/node.rb#9496 sig { returns(T::Boolean) } def attribute_write?; end - # attr_reader block: Node? + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#9473 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#9574 + # source://prism//lib/prism/node.rb#9476 + sig { returns(Prism::Location) } + def binary_operator_loc; end + + # attr_reader block: Prism::node? + # + # source://prism//lib/prism/node.rb#9470 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9610 + # source://prism//lib/prism/node.rb#9506 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9547 + # source://prism//lib/prism/node.rb#9440 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9494 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9400 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9620 + # source://prism//lib/prism/node.rb#9516 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9568 + # source://prism//lib/prism/node.rb#9463 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9509 + # source://prism//lib/prism/node.rb#9415 + 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#9499 + # source://prism//lib/prism/node.rb#9405 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> IndexOperatorWriteNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?binary_operator: Symbol, ?binary_operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexOperatorWriteNode # - # source://prism//lib/prism/node.rb#9514 - sig { params(params: T.untyped).returns(Prism::IndexOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#9420 + sig do + params( + 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::Node), + binary_operator: Symbol, + binary_operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::IndexOperatorWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9494 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9400 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, operator: Symbol, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, binary_operator: Symbol, binary_operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9535 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#9428 + 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#9605 + # source://prism//lib/prism/node.rb#9501 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#9625 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9521 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9615 + # source://prism//lib/prism/node.rb#9511 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9559 + # source://prism//lib/prism/node.rb#9453 sig { returns(Prism::Location) } def opening_loc; end - # attr_reader operator: Symbol + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#9577 - sig { returns(Symbol) } + # source://prism//lib/prism/node_ext.rb#387 def operator; end - # attr_reader operator_loc: Location + # 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.rb#9580 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node_ext.rb#394 def operator_loc; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9544 + # source://prism//lib/prism/node.rb#9437 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -14602,7 +16899,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9590 + # source://prism//lib/prism/node.rb#9486 sig { returns(T::Boolean) } def safe_navigation?; end @@ -14621,12 +16918,13 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9671 + # source://prism//lib/prism/node.rb#9539 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9586 + # source://prism//lib/prism/node.rb#9483 sig { returns(Prism::Node) } def value; end @@ -14634,15 +16932,15 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9595 + # source://prism//lib/prism/node.rb#9491 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9540 + # source://prism//lib/prism/node.rb#9433 sig { returns(Integer) } def flags; end @@ -14654,7 +16952,7 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9681 + # source://prism//lib/prism/node.rb#9549 def type; end end end @@ -14664,24 +16962,45 @@ end # foo.bar[baz] ||= value # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#9690 +# source://prism//lib/prism/node.rb#9574 class Prism::IndexOrWriteNode < ::Prism::Node - # def initialize: (Integer flags, Node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Location operator_loc, Node value, Location location) -> void + # def initialize: (Integer flags, Prism::node? receiver, Location? call_operator_loc, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location operator_loc, Prism::node value, Location location) -> void # # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode # - # source://prism//lib/prism/node.rb#9692 + # source://prism//lib/prism/node.rb#9576 + sig do + params( + source: Prism::Source, + 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::Node), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(source, flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); 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#9754 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9708 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#9592 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9783 + # source://prism//lib/prism/node.rb#9657 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -14689,119 +17008,134 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9815 + # source://prism//lib/prism/node.rb#9690 sig { returns(T::Boolean) } def attribute_write?; end - # attr_reader block: Node? + # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#9792 + # source://prism//lib/prism/node.rb#9667 sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//lib/prism/node.rb#9825 + # source://prism//lib/prism/node.rb#9700 sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//lib/prism/node.rb#9765 + # source://prism//lib/prism/node.rb#9637 sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9713 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9597 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#9835 + # source://prism//lib/prism/node.rb#9710 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9786 + # source://prism//lib/prism/node.rb#9660 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9728 + # source://prism//lib/prism/node.rb#9612 + 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#9718 + # source://prism//lib/prism/node.rb#9602 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> IndexOrWriteNode + # def copy: (?flags: Integer, ?receiver: Prism::node?, ?call_operator_loc: Location?, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> IndexOrWriteNode # - # source://prism//lib/prism/node.rb#9733 - sig { params(params: T.untyped).returns(Prism::IndexOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#9617 + sig do + params( + 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::Node), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::IndexOrWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9713 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9597 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, operator_loc: Location, value: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node?, call_operator_loc: Location?, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#9753 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#9625 + 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#9820 + # source://prism//lib/prism/node.rb#9695 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#9845 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9720 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#9830 + # source://prism//lib/prism/node.rb#9705 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9777 + # source://prism//lib/prism/node.rb#9650 sig { returns(Prism::Location) } def opening_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#9840 + # source://prism//lib/prism/node.rb#9715 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#9795 + # source://prism//lib/prism/node.rb#9670 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader receiver: Node? + # attr_reader receiver: Prism::node? # - # source://prism//lib/prism/node.rb#9762 + # source://prism//lib/prism/node.rb#9634 sig { returns(T.nilable(Prism::Node)) } def receiver; end @@ -14809,7 +17143,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9805 + # source://prism//lib/prism/node.rb#9680 sig { returns(T::Boolean) } def safe_navigation?; end @@ -14828,12 +17162,13 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#9890 + # source://prism//lib/prism/node.rb#9738 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#9801 + # source://prism//lib/prism/node.rb#9677 sig { returns(Prism::Node) } def value; end @@ -14841,15 +17176,15 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#9810 + # source://prism//lib/prism/node.rb#9685 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9758 + # source://prism//lib/prism/node.rb#9630 sig { returns(Integer) } def flags; end @@ -14861,7 +17196,7 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#9900 + # source://prism//lib/prism/node.rb#9748 def type; end end end @@ -14879,24 +17214,42 @@ end # for foo[bar] in baz do end # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#9917 +# source://prism//lib/prism/node.rb#9780 class Prism::IndexTargetNode < ::Prism::Node - # def initialize: (Integer flags, Node receiver, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Location location) -> void + # def initialize: (Integer flags, Prism::node receiver, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Prism::node? block, Location location) -> void # # @return [IndexTargetNode] a new instance of IndexTargetNode # - # source://prism//lib/prism/node.rb#9919 + # source://prism//lib/prism/node.rb#9782 + sig do + params( + source: Prism::Source, + flags: Integer, + receiver: Prism::Node, + opening_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: Prism::Location, + block: T.nilable(Prism::Node), + location: Prism::Location + ).void + end def initialize(source, flags, receiver, opening_loc, arguments, closing_loc, block, location); 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#9923 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#9932 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#9795 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#9991 + # source://prism//lib/prism/node.rb#9846 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end @@ -14904,95 +17257,107 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10014 + # source://prism//lib/prism/node.rb#9869 sig { returns(T::Boolean) } def attribute_write?; end - # attr_reader block: Node? + # attr_reader block: Prism::node? # - # source://prism//lib/prism/node.rb#10000 + # source://prism//lib/prism/node.rb#9856 sig { returns(T.nilable(Prism::Node)) } def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9937 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9800 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#10029 + # source://prism//lib/prism/node.rb#9884 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#9994 + # source://prism//lib/prism/node.rb#9849 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#9951 + # source://prism//lib/prism/node.rb#9814 + 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#9942 + # source://prism//lib/prism/node.rb#9805 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> IndexTargetNode + # def copy: (?flags: Integer, ?receiver: Prism::node, ?opening_loc: Location, ?arguments: ArgumentsNode?, ?closing_loc: Location, ?block: Prism::node?, ?location: Location) -> IndexTargetNode # - # source://prism//lib/prism/node.rb#9956 - sig { params(params: T.untyped).returns(Prism::IndexTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#9819 + sig do + params( + flags: Integer, + receiver: Prism::Node, + opening_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + closing_loc: Prism::Location, + block: T.nilable(Prism::Node), + location: Prism::Location + ).returns(Prism::IndexTargetNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#9937 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#9800 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Prism::node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#9973 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#9827 + 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#10019 + # source://prism//lib/prism/node.rb#9874 sig { returns(T::Boolean) } def ignore_visibility?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#10034 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9889 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#10024 + # source://prism//lib/prism/node.rb#9879 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#9985 + # source://prism//lib/prism/node.rb#9839 sig { returns(Prism::Location) } def opening_loc; end - # attr_reader receiver: Node + # attr_reader receiver: Prism::node # - # source://prism//lib/prism/node.rb#9982 + # source://prism//lib/prism/node.rb#9836 sig { returns(Prism::Node) } def receiver; end @@ -15000,7 +17365,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10004 + # source://prism//lib/prism/node.rb#9859 sig { returns(T::Boolean) } def safe_navigation?; end @@ -15019,22 +17384,23 @@ class Prism::IndexTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#10071 + # source://prism//lib/prism/node.rb#9907 + sig { override.returns(Symbol) } def type; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#10009 + # source://prism//lib/prism/node.rb#9864 sig { returns(T::Boolean) } def variable_call?; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#9978 + # source://prism//lib/prism/node.rb#9832 sig { returns(Integer) } def flags; end @@ -15046,7 +17412,7 @@ class Prism::IndexTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#10081 + # source://prism//lib/prism/node.rb#9917 def type; end end end @@ -15054,11 +17420,12 @@ 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#275 +# source://prism//lib/prism/parse_result.rb#388 class Prism::InlineComment < ::Prism::Comment # Returns a string representation of this comment. # - # source://prism//lib/prism/parse_result.rb#283 + # source://prism//lib/prism/parse_result.rb#396 + sig { returns(String) } def inspect; end # Returns true if this comment happens on the same line as other code and @@ -15066,1061 +17433,944 @@ class Prism::InlineComment < ::Prism::Comment # # @return [Boolean] # - # source://prism//lib/prism/parse_result.rb#278 + # source://prism//lib/prism/parse_result.rb#391 sig { override.returns(T::Boolean) } def trailing?; end end -# Represents the use of the `&&=` operator for assignment to an instance variable. -# -# @target &&= value -# ^^^^^^^^^^^^^^^^^ +# 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/node.rb#10090 -class Prism::InstanceVariableAndWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void +# source://prism//lib/prism/inspect_visitor.rb#12 +class Prism::InspectVisitor < ::Prism::Visitor + # Initializes a new instance of the InspectVisitor. # - # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode + # @return [InspectVisitor] a new instance of InspectVisitor # - # source://prism//lib/prism/node.rb#10092 - def initialize(source, name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/inspect_visitor.rb#35 + sig { params(indent: String).void } + def initialize(indent = T.unsafe(nil)); end - # def accept: (Visitor visitor) -> void + # The list of commands that we need to execute in order to compose the + # final string. # - # source://prism//lib/prism/node.rb#10103 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#32 + def commands; end - # def child_nodes: () -> Array[nil | Node] + # Compose the final string. # - # source://prism//lib/prism/node.rb#10108 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#48 + sig { returns(String) } + def compose; end - # def comment_targets: () -> Array[Node | Location] + # The current prefix string. # - # source://prism//lib/prism/node.rb#10118 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#28 + def indent; end - # def compact_child_nodes: () -> Array[Node] + # Inspect a AliasGlobalVariableNode node. # - # source://prism//lib/prism/node.rb#10113 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#77 + def visit_alias_global_variable_node(node); end - # def copy: (**params) -> InstanceVariableAndWriteNode + # Inspect a AliasMethodNode node. # - # source://prism//lib/prism/node.rb#10123 - sig { params(params: T.untyped).returns(Prism::InstanceVariableAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#87 + def visit_alias_method_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a AlternationPatternNode node. # - # source://prism//lib/prism/node.rb#10108 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#97 + def visit_alternation_pattern_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # Inspect a AndNode node. # - # source://prism//lib/prism/node.rb#10138 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#107 + def visit_and_node(node); end - # source://prism//lib/prism/desugar_compiler.rb#179 - def desugar; end + # Inspect a ArgumentsNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#117 + def visit_arguments_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a ArrayNode node. # - # source://prism//lib/prism/node.rb#10167 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#133 + def visit_array_node(node); end - # attr_reader name: Symbol + # Inspect a ArrayPatternNode node. # - # source://prism//lib/prism/node.rb#10143 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#151 + def visit_array_pattern_node(node); end - # attr_reader name_loc: Location + # Inspect a AssocNode node. # - # source://prism//lib/prism/node.rb#10146 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/inspect_visitor.rb#188 + def visit_assoc_node(node); end - # def operator: () -> String + # Inspect a AssocSplatNode node. # - # source://prism//lib/prism/node.rb#10162 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/inspect_visitor.rb#198 + def visit_assoc_splat_node(node); end - # attr_reader operator_loc: Location + # Inspect a BackReferenceReadNode node. # - # source://prism//lib/prism/node.rb#10152 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/inspect_visitor.rb#210 + def visit_back_reference_read_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a BeginNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#216 + def visit_begin_node(node); end + + # Inspect a BlockArgumentNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#247 + def visit_block_argument_node(node); end + + # Inspect a BlockLocalVariableNode node. # - # source://prism//lib/prism/node.rb#10191 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#259 + def visit_block_local_variable_node(node); end - # attr_reader value: Node + # Inspect a BlockNode node. # - # source://prism//lib/prism/node.rb#10158 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/inspect_visitor.rb#267 + def visit_block_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10201 - def type; end - end -end + # Inspect a BlockParameterNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#287 + def visit_block_parameter_node(node); end -# Represents assigning to an instance variable using an operator that isn't `=`. -# -# @target += value -# ^^^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#10210 -class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void + # Inspect a BlockParametersNode node. # - # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode + # source://prism//lib/prism/inspect_visitor.rb#301 + def visit_block_parameters_node(node); end + + # Inspect a BreakNode node. # - # source://prism//lib/prism/node.rb#10212 - def initialize(source, name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/inspect_visitor.rb#323 + def visit_break_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a CallAndWriteNode node. # - # source://prism//lib/prism/node.rb#10224 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#335 + def visit_call_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a CallNode node. # - # source://prism//lib/prism/node.rb#10229 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#355 + def visit_call_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a CallOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10239 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#385 + def visit_call_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a CallOrWriteNode node. # - # source://prism//lib/prism/node.rb#10234 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#406 + def visit_call_or_write_node(node); end - # def copy: (**params) -> InstanceVariableOperatorWriteNode + # Inspect a CallTargetNode node. # - # source://prism//lib/prism/node.rb#10244 - sig { params(params: T.untyped).returns(Prism::InstanceVariableOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#426 + def visit_call_target_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a CapturePatternNode node. # - # source://prism//lib/prism/node.rb#10229 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#438 + def visit_capture_pattern_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } + # Inspect a CaseMatchNode node. # - # source://prism//lib/prism/node.rb#10260 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#448 + def visit_case_match_node(node); end - # source://prism//lib/prism/desugar_compiler.rb#191 - def desugar; end + # Inspect a CaseNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#476 + def visit_case_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a ClassNode node. # - # source://prism//lib/prism/node.rb#10287 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#504 + def visit_class_node(node); end - # attr_reader name: Symbol + # Inspect a ClassVariableAndWriteNode node. # - # source://prism//lib/prism/node.rb#10265 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#528 + def visit_class_variable_and_write_node(node); end - # attr_reader name_loc: Location + # Inspect a ClassVariableOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10268 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/inspect_visitor.rb#538 + def visit_class_variable_operator_write_node(node); end - # attr_reader operator: Symbol + # Inspect a ClassVariableOrWriteNode node. # - # source://prism//lib/prism/node.rb#10283 - sig { returns(Symbol) } - def operator; end + # source://prism//lib/prism/inspect_visitor.rb#549 + def visit_class_variable_or_write_node(node); end - # attr_reader operator_loc: Location + # Inspect a ClassVariableReadNode node. # - # source://prism//lib/prism/node.rb#10274 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/inspect_visitor.rb#559 + def visit_class_variable_read_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a ClassVariableTargetNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#565 + def visit_class_variable_target_node(node); end + + # Inspect a ClassVariableWriteNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#571 + def visit_class_variable_write_node(node); end + + # Inspect a ConstantAndWriteNode node. # - # source://prism//lib/prism/node.rb#10312 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#581 + def visit_constant_and_write_node(node); end - # attr_reader value: Node + # Inspect a ConstantOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10280 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/inspect_visitor.rb#591 + def visit_constant_operator_write_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10322 - def type; end - end -end + # Inspect a ConstantOrWriteNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#602 + def visit_constant_or_write_node(node); end -# Represents the use of the `||=` operator for assignment to an instance variable. -# -# @target ||= value -# ^^^^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#10331 -class Prism::InstanceVariableOrWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void - # - # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode + # Inspect a ConstantPathAndWriteNode node. # - # source://prism//lib/prism/node.rb#10333 - def initialize(source, name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/inspect_visitor.rb#612 + def visit_constant_path_and_write_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a ConstantPathNode node. # - # source://prism//lib/prism/node.rb#10344 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#622 + def visit_constant_path_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a ConstantPathOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10349 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#640 + def visit_constant_path_operator_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a ConstantPathOrWriteNode node. # - # source://prism//lib/prism/node.rb#10359 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#651 + def visit_constant_path_or_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a ConstantPathTargetNode node. # - # source://prism//lib/prism/node.rb#10354 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#661 + def visit_constant_path_target_node(node); end - # def copy: (**params) -> InstanceVariableOrWriteNode + # Inspect a ConstantPathWriteNode node. # - # source://prism//lib/prism/node.rb#10364 - sig { params(params: T.untyped).returns(Prism::InstanceVariableOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#679 + def visit_constant_path_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a ConstantReadNode node. # - # source://prism//lib/prism/node.rb#10349 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#689 + def visit_constant_read_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # Inspect a ConstantTargetNode node. # - # source://prism//lib/prism/node.rb#10379 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end - - # source://prism//lib/prism/desugar_compiler.rb#185 - def desugar; end + # source://prism//lib/prism/inspect_visitor.rb#695 + def visit_constant_target_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a ConstantWriteNode node. # - # source://prism//lib/prism/node.rb#10408 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#701 + def visit_constant_write_node(node); end - # attr_reader name: Symbol + # Inspect a DefNode node. # - # source://prism//lib/prism/node.rb#10384 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#711 + def visit_def_node(node); end - # attr_reader name_loc: Location + # Inspect a DefinedNode node. # - # source://prism//lib/prism/node.rb#10387 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/inspect_visitor.rb#743 + def visit_defined_node(node); end - # def operator: () -> String + # Inspect a ElseNode node. # - # source://prism//lib/prism/node.rb#10403 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/inspect_visitor.rb#753 + def visit_else_node(node); end - # attr_reader operator_loc: Location + # Inspect a EmbeddedStatementsNode node. # - # source://prism//lib/prism/node.rb#10393 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/inspect_visitor.rb#766 + def visit_embedded_statements_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a EmbeddedVariableNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#779 + def visit_embedded_variable_node(node); end + + # Inspect a EnsureNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#787 + def visit_ensure_node(node); end + + # Inspect a FalseNode node. # - # source://prism//lib/prism/node.rb#10432 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#800 + def visit_false_node(node); end - # attr_reader value: Node + # Inspect a FindPatternNode node. # - # source://prism//lib/prism/node.rb#10399 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/inspect_visitor.rb#805 + def visit_find_pattern_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10442 - def type; end - end -end + # Inspect a FlipFlopNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#831 + def visit_flip_flop_node(node); end -# Represents referencing an instance variable. -# -# @foo -# ^^^^ -# -# source://prism//lib/prism/node.rb#10451 -class Prism::InstanceVariableReadNode < ::Prism::Node - # def initialize: (Symbol name, Location location) -> void + # Inspect a FloatNode node. # - # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode + # source://prism//lib/prism/inspect_visitor.rb#851 + def visit_float_node(node); end + + # Inspect a ForNode node. # - # source://prism//lib/prism/node.rb#10453 - def initialize(source, name, location); end + # source://prism//lib/prism/inspect_visitor.rb#857 + def visit_for_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a ForwardingArgumentsNode node. # - # source://prism//lib/prism/node.rb#10461 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#876 + def visit_forwarding_arguments_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a ForwardingParameterNode node. # - # source://prism//lib/prism/node.rb#10466 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#881 + def visit_forwarding_parameter_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a ForwardingSuperNode node. # - # source://prism//lib/prism/node.rb#10476 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#886 + def visit_forwarding_super_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a GlobalVariableAndWriteNode node. # - # source://prism//lib/prism/node.rb#10471 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#897 + def visit_global_variable_and_write_node(node); end - # def copy: (**params) -> InstanceVariableReadNode + # Inspect a GlobalVariableOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10481 - sig { params(params: T.untyped).returns(Prism::InstanceVariableReadNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#907 + def visit_global_variable_operator_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a GlobalVariableOrWriteNode node. # - # source://prism//lib/prism/node.rb#10466 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#918 + def visit_global_variable_or_write_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } + # Inspect a GlobalVariableReadNode node. # - # source://prism//lib/prism/node.rb#10493 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#928 + def visit_global_variable_read_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a GlobalVariableTargetNode node. # - # source://prism//lib/prism/node.rb#10506 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#934 + def visit_global_variable_target_node(node); end - # The name of the instance variable, which is a `@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). + # Inspect a GlobalVariableWriteNode node. # - # @x # name `:@x` + # source://prism//lib/prism/inspect_visitor.rb#940 + def visit_global_variable_write_node(node); end + + # Inspect a HashNode node. # - # @_test # name `:@_test` + # source://prism//lib/prism/inspect_visitor.rb#950 + def visit_hash_node(node); end + + # Inspect a HashPatternNode node. # - # source://prism//lib/prism/node.rb#10502 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#966 + def visit_hash_pattern_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a IfNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#994 + def visit_if_node(node); end + + # Inspect a ImaginaryNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#1016 + def visit_imaginary_node(node); end + + # Inspect a ImplicitNode node. # - # source://prism//lib/prism/node.rb#10526 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#1023 + def visit_implicit_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10536 - def type; end - end -end + # Inspect a ImplicitRestNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1030 + def visit_implicit_rest_node(node); end -# Represents writing to an instance variable in a context that doesn't have an explicit value. -# -# @foo, @bar = baz -# ^^^^ ^^^^ -# -# source://prism//lib/prism/node.rb#10545 -class Prism::InstanceVariableTargetNode < ::Prism::Node - # def initialize: (Symbol name, Location location) -> void + # Inspect a InNode node. # - # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode + # source://prism//lib/prism/inspect_visitor.rb#1035 + def visit_in_node(node); end + + # Inspect a IndexAndWriteNode node. # - # source://prism//lib/prism/node.rb#10547 - def initialize(source, name, location); end + # source://prism//lib/prism/inspect_visitor.rb#1050 + def visit_index_and_write_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a IndexOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10555 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#1081 + def visit_index_operator_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a IndexOrWriteNode node. # - # source://prism//lib/prism/node.rb#10560 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1113 + def visit_index_or_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a IndexTargetNode node. # - # source://prism//lib/prism/node.rb#10570 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#1144 + def visit_index_target_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a InstanceVariableAndWriteNode node. # - # source://prism//lib/prism/node.rb#10565 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1167 + def visit_instance_variable_and_write_node(node); end - # def copy: (**params) -> InstanceVariableTargetNode + # Inspect a InstanceVariableOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10575 - sig { params(params: T.untyped).returns(Prism::InstanceVariableTargetNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#1177 + def visit_instance_variable_operator_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a InstanceVariableOrWriteNode node. # - # source://prism//lib/prism/node.rb#10560 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#1188 + def visit_instance_variable_or_write_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } + # Inspect a InstanceVariableReadNode node. # - # source://prism//lib/prism/node.rb#10587 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#1198 + def visit_instance_variable_read_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a InstanceVariableTargetNode node. # - # source://prism//lib/prism/node.rb#10596 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#1204 + def visit_instance_variable_target_node(node); end - # attr_reader name: Symbol + # Inspect a InstanceVariableWriteNode node. # - # source://prism//lib/prism/node.rb#10592 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#1210 + def visit_instance_variable_write_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a IntegerNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#1220 + def visit_integer_node(node); end + + # Inspect a InterpolatedMatchLastLineNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#1228 + def visit_interpolated_match_last_line_node(node); end + + # Inspect a InterpolatedRegularExpressionNode node. # - # source://prism//lib/prism/node.rb#10616 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#1246 + def visit_interpolated_regular_expression_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10626 - def type; end - end -end + # Inspect a InterpolatedStringNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1264 + def visit_interpolated_string_node(node); end -# Represents writing to an instance variable. -# -# @foo = 1 -# ^^^^^^^^ -# -# source://prism//lib/prism/node.rb#10635 -class Prism::InstanceVariableWriteNode < ::Prism::Node - # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void + # Inspect a InterpolatedSymbolNode node. # - # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode + # source://prism//lib/prism/inspect_visitor.rb#1282 + def visit_interpolated_symbol_node(node); end + + # Inspect a InterpolatedXStringNode node. # - # source://prism//lib/prism/node.rb#10637 - def initialize(source, name, name_loc, value, operator_loc, location); end + # source://prism//lib/prism/inspect_visitor.rb#1298 + def visit_interpolated_x_string_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a ItParametersNode node. # - # source://prism//lib/prism/node.rb#10648 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#1314 + def visit_it_parameters_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a KeywordHashNode node. # - # source://prism//lib/prism/node.rb#10653 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1319 + def visit_keyword_hash_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a KeywordRestParameterNode node. # - # source://prism//lib/prism/node.rb#10663 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#1335 + def visit_keyword_rest_parameter_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a LambdaNode node. # - # source://prism//lib/prism/node.rb#10658 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1349 + def visit_lambda_node(node); end - # def copy: (**params) -> InstanceVariableWriteNode + # Inspect a LocalVariableAndWriteNode node. # - # source://prism//lib/prism/node.rb#10668 - sig { params(params: T.untyped).returns(Prism::InstanceVariableWriteNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#1370 + def visit_local_variable_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a LocalVariableOperatorWriteNode node. # - # source://prism//lib/prism/node.rb#10653 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#1381 + def visit_local_variable_operator_write_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } + # Inspect a LocalVariableOrWriteNode node. # - # source://prism//lib/prism/node.rb#10683 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#1393 + def visit_local_variable_or_write_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a LocalVariableReadNode node. # - # source://prism//lib/prism/node.rb#10712 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#1404 + def visit_local_variable_read_node(node); end - # attr_reader name: Symbol + # Inspect a LocalVariableTargetNode node. # - # source://prism//lib/prism/node.rb#10688 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/inspect_visitor.rb#1411 + def visit_local_variable_target_node(node); end - # attr_reader name_loc: Location + # Inspect a LocalVariableWriteNode node. # - # source://prism//lib/prism/node.rb#10691 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/inspect_visitor.rb#1418 + def visit_local_variable_write_node(node); end - # def operator: () -> String + # Inspect a MatchLastLineNode node. # - # source://prism//lib/prism/node.rb#10707 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/inspect_visitor.rb#1429 + def visit_match_last_line_node(node); end - # attr_reader operator_loc: Location + # Inspect a MatchPredicateNode node. # - # source://prism//lib/prism/node.rb#10700 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/inspect_visitor.rb#1440 + def visit_match_predicate_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a MatchRequiredNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#1450 + def visit_match_required_node(node); end + + # Inspect a MatchWriteNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#1460 + def visit_match_write_node(node); end + + # Inspect a MissingNode node. # - # source://prism//lib/prism/node.rb#10736 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#1476 + def visit_missing_node(node); end - # attr_reader value: Node + # Inspect a ModuleNode node. # - # source://prism//lib/prism/node.rb#10697 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/inspect_visitor.rb#1481 + def visit_module_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10746 - def type; end - end -end + # Inspect a MultiTargetNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1498 + def visit_multi_target_node(node); end -# Flags for integer nodes that correspond to the base of the integer. -# -# source://prism//lib/prism/node.rb#19277 -module Prism::IntegerBaseFlags; end + # Inspect a MultiWriteNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1529 + def visit_multi_write_node(node); end -# 0b prefix -# -# source://prism//lib/prism/node.rb#19279 -Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) + # Inspect a NextNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1563 + def visit_next_node(node); end -# 0d or no prefix -# -# source://prism//lib/prism/node.rb#19282 -Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) + # Inspect a NilNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1575 + def visit_nil_node(node); end -# 0x prefix -# -# source://prism//lib/prism/node.rb#19288 -Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) + # Inspect a NoKeywordsParameterNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1580 + def visit_no_keywords_parameter_node(node); end -# 0o or 0 prefix -# -# source://prism//lib/prism/node.rb#19285 -Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) + # Inspect a NumberedParametersNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1587 + def visit_numbered_parameters_node(node); end -# Represents an integer number literal. -# -# 1 -# ^ -# -# source://prism//lib/prism/node.rb#10755 -class Prism::IntegerNode < ::Prism::Node - # def initialize: (Integer flags, Location location) -> void + # Inspect a NumberedReferenceReadNode node. # - # @return [IntegerNode] a new instance of IntegerNode + # source://prism//lib/prism/inspect_visitor.rb#1593 + def visit_numbered_reference_read_node(node); end + + # Inspect a OptionalKeywordParameterNode node. # - # source://prism//lib/prism/node.rb#10757 - def initialize(source, flags, location); end + # source://prism//lib/prism/inspect_visitor.rb#1599 + def visit_optional_keyword_parameter_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a OptionalParameterNode node. # - # source://prism//lib/prism/node.rb#10765 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#1610 + def visit_optional_parameter_node(node); end - # def binary?: () -> bool + # Inspect a OrNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#1622 + def visit_or_node(node); end + + # Inspect a ParametersNode node. # - # source://prism//lib/prism/node.rb#10807 - sig { returns(T::Boolean) } - def binary?; end + # source://prism//lib/prism/inspect_visitor.rb#1632 + def visit_parameters_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a ParenthesesNode node. # - # source://prism//lib/prism/node.rb#10770 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1691 + def visit_parentheses_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a PinnedExpressionNode node. # - # source://prism//lib/prism/node.rb#10780 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#1704 + def visit_pinned_expression_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a PinnedVariableNode node. # - # source://prism//lib/prism/node.rb#10775 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1714 + def visit_pinned_variable_node(node); end - # def copy: (**params) -> IntegerNode + # Inspect a PostExecutionNode node. # - # source://prism//lib/prism/node.rb#10785 - sig { params(params: T.untyped).returns(Prism::IntegerNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#1722 + def visit_post_execution_node(node); end - # def decimal?: () -> bool + # Inspect a PreExecutionNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#1736 + def visit_pre_execution_node(node); end + + # Inspect a ProgramNode node. # - # source://prism//lib/prism/node.rb#10812 - sig { returns(T::Boolean) } - def decimal?; end + # source://prism//lib/prism/inspect_visitor.rb#1750 + def visit_program_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a RangeNode node. # - # source://prism//lib/prism/node.rb#10770 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#1758 + def visit_range_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, location: Location } + # Inspect a RationalNode node. # - # source://prism//lib/prism/node.rb#10797 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#1778 + def visit_rational_node(node); end - # def hexadecimal?: () -> bool + # Inspect a RedoNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#1785 + def visit_redo_node(node); end + + # Inspect a RegularExpressionNode node. # - # source://prism//lib/prism/node.rb#10822 - sig { returns(T::Boolean) } - def hexadecimal?; end + # source://prism//lib/prism/inspect_visitor.rb#1790 + def visit_regular_expression_node(node); end - # def inspect(NodeInspector inspector) -> String + # Inspect a RequiredKeywordParameterNode node. # - # source://prism//lib/prism/node.rb#10827 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/inspect_visitor.rb#1801 + def visit_required_keyword_parameter_node(node); end - # def octal?: () -> bool + # Inspect a RequiredParameterNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#1810 + def visit_required_parameter_node(node); end + + # Inspect a RescueModifierNode node. # - # source://prism//lib/prism/node.rb#10817 - sig { returns(T::Boolean) } - def octal?; end + # source://prism//lib/prism/inspect_visitor.rb#1818 + def visit_rescue_modifier_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Inspect a RescueNode node. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/inspect_visitor.rb#1828 + def visit_rescue_node(node); end + + # Inspect a RestParameterNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/inspect_visitor.rb#1862 + def visit_rest_parameter_node(node); end + + # Inspect a RetryNode node. # - # source://prism//lib/prism/node.rb#10848 - def type; end + # source://prism//lib/prism/inspect_visitor.rb#1876 + def visit_retry_node(node); end - # Returns the value of the node as a Ruby Integer. + # Inspect a ReturnNode node. # - # source://prism//lib/prism/node_ext.rb#76 - def value; end + # source://prism//lib/prism/inspect_visitor.rb#1881 + def visit_return_node(node); end - private + # Inspect a SelfNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1895 + def visit_self_node(node); end - # private attr_reader flags: Integer + # Inspect a ShareableConstantNode node. # - # source://prism//lib/prism/node.rb#10802 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/inspect_visitor.rb#1900 + def visit_shareable_constant_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#10858 - def type; end - end -end + # Inspect a SingletonClassNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1909 + def visit_singleton_class_node(node); end -# Represents a regular expression literal that contains interpolation that is being used in the predicate of a conditional to implicitly match against the last line read by an IO object. -# -# if /foo #{bar} baz/ then end -# ^^^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#10867 -class Prism::InterpolatedMatchLastLineNode < ::Prism::Node - include ::Prism::RegularExpressionOptions + # Inspect a SourceEncodingNode node. + # + # source://prism//lib/prism/inspect_visitor.rb#1926 + def visit_source_encoding_node(node); end - # def initialize: (Integer flags, Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void + # Inspect a SourceFileNode node. # - # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode + # source://prism//lib/prism/inspect_visitor.rb#1931 + def visit_source_file_node(node); end + + # Inspect a SourceLineNode node. # - # source://prism//lib/prism/node.rb#10869 - def initialize(source, flags, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/inspect_visitor.rb#1939 + def visit_source_line_node(node); end - # def accept: (Visitor visitor) -> void + # Inspect a SplatNode node. # - # source://prism//lib/prism/node.rb#10880 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/inspect_visitor.rb#1944 + def visit_splat_node(node); end - # def ascii_8bit?: () -> bool + # Inspect a StatementsNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#1956 + def visit_statements_node(node); end + + # Inspect a StringNode node. # - # source://prism//lib/prism/node.rb#10970 - sig { returns(T::Boolean) } - def ascii_8bit?; end + # source://prism//lib/prism/inspect_visitor.rb#1970 + def visit_string_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a SuperNode node. # - # source://prism//lib/prism/node.rb#10890 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#1981 + def visit_super_node(node); end - # def closing: () -> String + # Inspect a SymbolNode node. # - # source://prism//lib/prism/node.rb#11005 - sig { returns(String) } - def closing; end + # source://prism//lib/prism/inspect_visitor.rb#2001 + def visit_symbol_node(node); end - # attr_reader closing_loc: Location + # Inspect a TrueNode node. # - # source://prism//lib/prism/node.rb#10938 - sig { returns(Prism::Location) } - def closing_loc; end + # source://prism//lib/prism/inspect_visitor.rb#2012 + def visit_true_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a UndefNode node. # - # source://prism//lib/prism/node.rb#10900 - def comment_targets; end + # source://prism//lib/prism/inspect_visitor.rb#2017 + def visit_undef_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a UnlessNode node. # - # source://prism//lib/prism/node.rb#10895 - def compact_child_nodes; end + # source://prism//lib/prism/inspect_visitor.rb#2032 + def visit_unless_node(node); end - # def copy: (**params) -> InterpolatedMatchLastLineNode + # Inspect a UntilNode node. # - # source://prism//lib/prism/node.rb#10905 - sig { params(params: T.untyped).returns(Prism::InterpolatedMatchLastLineNode) } - def copy(**params); end + # source://prism//lib/prism/inspect_visitor.rb#2054 + def visit_until_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Inspect a WhenNode node. # - # source://prism//lib/prism/node.rb#10890 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/inspect_visitor.rb#2071 + def visit_when_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } + # Inspect a WhileNode node. # - # source://prism//lib/prism/node.rb#10920 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/inspect_visitor.rb#2093 + def visit_while_node(node); end - # def euc_jp?: () -> bool + # Inspect a XStringNode node. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#2110 + def visit_x_string_node(node); end + + # Inspect a YieldNode node. # - # source://prism//lib/prism/node.rb#10965 - sig { returns(T::Boolean) } - def euc_jp?; end + # source://prism//lib/prism/inspect_visitor.rb#2121 + def visit_yield_node(node); end - # def extended?: () -> bool + private + + # Compose a string representing the given inner location field. # - # @return [Boolean] + # source://prism//lib/prism/inspect_visitor.rb#2148 + def inspect_location(location); end + + # Compose a header for the given node. # - # source://prism//lib/prism/node.rb#10950 - sig { returns(T::Boolean) } - def extended?; end + # source://prism//lib/prism/inspect_visitor.rb#2137 + def inspect_node(name, node); end - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] + class << self + # Compose an inspect string for the given node. + # + # source://prism//lib/prism/inspect_visitor.rb#41 + sig { params(node: Prism::Node).returns(String) } + def compose(node); end + end +end + +# Most of the time, we can simply pass down the indent to the next node. +# However, when we are inside a list we want some extra special formatting +# 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 +class Prism::InspectVisitor::Replace + # @return [Replace] a new instance of Replace # - # source://prism//lib/prism/node.rb#10990 - sig { returns(T::Boolean) } - def forced_binary_encoding?; end + # source://prism//lib/prism/inspect_visitor.rb#20 + def initialize(value); end - # def forced_us_ascii_encoding?: () -> bool + # source://prism//lib/prism/inspect_visitor.rb#18 + def value; end +end + +# Represents the use of the `&&=` operator for assignment to an instance variable. +# +# @target &&= value +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9938 +class Prism::InstanceVariableAndWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # - # @return [Boolean] + # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode # - # source://prism//lib/prism/node.rb#10995 - sig { returns(T::Boolean) } - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/node.rb#9940 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, operator_loc, value, location); end - # def forced_utf8_encoding?: () -> bool + # Implements case-equality for the node. This is effectively == but without + # comparing the value of locations. Locations are checked only for presence. # - # @return [Boolean] + # source://prism//lib/prism/node.rb#10043 + def ===(other); end + + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#10985 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end + # source://prism//lib/prism/node.rb#9951 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # def ignore_case?: () -> bool + # def child_nodes: () -> Array[nil | Node] # - # @return [Boolean] + # source://prism//lib/prism/node.rb#9956 + 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#10945 - sig { returns(T::Boolean) } - def ignore_case?; end + # source://prism//lib/prism/node.rb#9966 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # def inspect(NodeInspector inspector) -> String + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#11010 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#9961 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # def multi_line?: () -> bool + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> InstanceVariableAndWriteNode # - # @return [Boolean] + # source://prism//lib/prism/node.rb#9971 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::InstanceVariableAndWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#10955 - sig { returns(T::Boolean) } - def multi_line?; end + # source://prism//lib/prism/node.rb#9956 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # def once?: () -> bool + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # @return [Boolean] + # source://prism//lib/prism/node.rb#9979 + 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#181 + def desugar; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#10960 - sig { returns(T::Boolean) } - def once?; end + # source://prism//lib/prism/node.rb#10009 + sig { override.returns(String) } + def inspect; end - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11000 - sig { returns(String) } - def opening; end + # source://prism//lib/prism/node.rb#9984 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#10929 + # source://prism//lib/prism/node.rb#9987 sig { returns(Prism::Location) } - def opening_loc; end + def name_loc; end - # attr_reader parts: Array[Node] + # def operator: () -> String # - # source://prism//lib/prism/node.rb#10935 - sig { returns(T::Array[Prism::Node]) } - def parts; end + # source://prism//lib/prism/node.rb#10004 + sig { returns(String) } + def operator; end - # source://prism//lib/prism/node.rb#10884 - def set_newline_flag(newline_marked); end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#9994 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16137,32 +18387,15 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11034 + # source://prism//lib/prism/node.rb#10027 + sig { override.returns(Symbol) } def type; end - # def utf_8?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#10980 - sig { returns(T::Boolean) } - def utf_8?; end - - # def windows_31j?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#10975 - sig { returns(T::Boolean) } - def windows_31j?; end - - private - - # private attr_reader flags: Integer + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#10925 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/node.rb#10001 + sig { returns(Prism::Node) } + def value; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -16172,181 +18405,141 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11044 + # source://prism//lib/prism/node.rb#10037 def type; end end end -# Represents a regular expression literal that contains interpolation. +# Represents assigning to an instance variable using an operator that isn't `=`. # -# /foo #{bar} baz/ +# @target += value # ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11053 -class Prism::InterpolatedRegularExpressionNode < ::Prism::Node - include ::Prism::RegularExpressionOptions - - # def initialize: (Integer flags, Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#10056 +class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location binary_operator_loc, Prism::node value, Symbol binary_operator, Location location) -> void # - # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode + # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#11055 - def initialize(source, flags, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#10058 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, binary_operator_loc, value, binary_operator, location); 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#10160 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11066 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10070 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # def ascii_8bit?: () -> bool + # attr_reader binary_operator: Symbol # - # @return [Boolean] + # source://prism//lib/prism/node.rb#10123 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location # - # source://prism//lib/prism/node.rb#11156 - sig { returns(T::Boolean) } - def ascii_8bit?; end + # source://prism//lib/prism/node.rb#10113 + sig { returns(Prism::Location) } + def binary_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11076 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10075 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//lib/prism/node.rb#11191 - sig { returns(String) } - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//lib/prism/node.rb#11124 - sig { returns(Prism::Location) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11086 + # source://prism//lib/prism/node.rb#10085 + 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#11081 + # source://prism//lib/prism/node.rb#10080 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> InterpolatedRegularExpressionNode + # def copy: (?name: Symbol, ?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?binary_operator: Symbol, ?location: Location) -> InstanceVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#11091 - sig { params(params: T.untyped).returns(Prism::InterpolatedRegularExpressionNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10090 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + binary_operator: Symbol, + location: Prism::Location + ).returns(Prism::InstanceVariableOperatorWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), binary_operator_loc: T.unsafe(nil), value: T.unsafe(nil), binary_operator: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11076 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10075 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, binary_operator_loc: Location, value: Prism::node, binary_operator: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#11106 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10098 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def euc_jp?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11151 - sig { returns(T::Boolean) } - def euc_jp?; end - - # def extended?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11136 - sig { returns(T::Boolean) } - def extended?; end - - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11176 - sig { returns(T::Boolean) } - def forced_binary_encoding?; end - - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11181 - sig { returns(T::Boolean) } - def forced_us_ascii_encoding?; end - - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11171 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end - - # def ignore_case?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11131 - sig { returns(T::Boolean) } - def ignore_case?; end - - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#11196 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/desugar_compiler.rb#193 + def desugar; end - # def multi_line?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11141 - sig { returns(T::Boolean) } - def multi_line?; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def once?: () -> bool + # def inspect -> String # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11146 - sig { returns(T::Boolean) } - def once?; end + # source://prism//lib/prism/node.rb#10126 + sig { override.returns(String) } + def inspect; end - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11186 - sig { returns(String) } - def opening; end + # source://prism//lib/prism/node.rb#10103 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#11115 + # source://prism//lib/prism/node.rb#10106 sig { returns(Prism::Location) } - def opening_loc; end + def name_loc; end - # attr_reader parts: Array[Node] + # Returns the binary operator used to modify the receiver. This method is + # deprecated in favor of #binary_operator. # - # source://prism//lib/prism/node.rb#11121 - sig { returns(T::Array[Prism::Node]) } - def parts; end + # source://prism//lib/prism/node_ext.rb#403 + def operator; end - # source://prism//lib/prism/node.rb#11070 - def set_newline_flag(newline_marked); 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 + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16363,32 +18556,15 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11220 + # source://prism//lib/prism/node.rb#10144 + sig { override.returns(Symbol) } def type; end - # def utf_8?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11166 - sig { returns(T::Boolean) } - def utf_8?; end - - # def windows_31j?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#11161 - sig { returns(T::Boolean) } - def windows_31j?; end - - private - - # private attr_reader flags: Integer + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#11111 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/node.rb#10120 + sig { returns(Prism::Node) } + def value; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -16398,109 +18574,127 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11230 + # source://prism//lib/prism/node.rb#10154 def type; end end end -# Represents a string literal that contains interpolation. +# Represents the use of the `||=` operator for assignment to an instance variable. # -# "foo #{bar} baz" -# ^^^^^^^^^^^^^^^^ +# @target ||= value +# ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11239 -class Prism::InterpolatedStringNode < ::Prism::Node - include ::Prism::HeredocQuery - - # def initialize: (Location? opening_loc, Array[Node] parts, Location? closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#10174 +class Prism::InstanceVariableOrWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void # - # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode + # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#11241 - def initialize(source, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#10176 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, operator_loc, value, location); 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#10279 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11251 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10187 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11261 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10192 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String? - # - # source://prism//lib/prism/node.rb#11328 - sig { returns(T.nilable(String)) } - def closing; end - - # attr_reader closing_loc: Location? - # - # source://prism//lib/prism/node.rb#11310 - sig { returns(T.nilable(Prism::Location)) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11271 + # source://prism//lib/prism/node.rb#10202 + 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#11266 + # source://prism//lib/prism/node.rb#10197 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> InterpolatedStringNode + # def copy: (?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> InstanceVariableOrWriteNode # - # source://prism//lib/prism/node.rb#11276 - sig { params(params: T.untyped).returns(Prism::InterpolatedStringNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10207 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::InstanceVariableOrWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11261 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10192 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#11290 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10215 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # source://prism//lib/prism/desugar_compiler.rb#187 + def desugar; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#11333 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10245 + sig { override.returns(String) } + def inspect; end - # def opening: () -> String? + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11323 - sig { returns(T.nilable(String)) } - def opening; end + # source://prism//lib/prism/node.rb#10220 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location? + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#11295 - sig { returns(T.nilable(Prism::Location)) } - def opening_loc; end + # source://prism//lib/prism/node.rb#10223 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parts: Array[Node] + # def operator: () -> String # - # source://prism//lib/prism/node.rb#11307 - sig { returns(T::Array[Prism::Node]) } - def parts; end + # source://prism//lib/prism/node.rb#10240 + sig { returns(String) } + def operator; end - # source://prism//lib/prism/node.rb#11255 - def set_newline_flag(newline_marked); end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#10230 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16517,9 +18711,16 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11355 + # source://prism//lib/prism/node.rb#10263 + sig { override.returns(Symbol) } def type; end + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#10237 + sig { returns(Prism::Node) } + def value; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -16528,107 +18729,93 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11365 + # source://prism//lib/prism/node.rb#10273 def type; end end end -# Represents a symbol literal that contains interpolation. +# Represents referencing an instance variable. # -# :"foo #{bar} baz" -# ^^^^^^^^^^^^^^^^^ +# @foo +# ^^^^ # -# source://prism//lib/prism/node.rb#11374 -class Prism::InterpolatedSymbolNode < ::Prism::Node - # def initialize: (Location? opening_loc, Array[Node] parts, Location? closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#10292 +class Prism::InstanceVariableReadNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode + # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#11376 - def initialize(source, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#10294 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } + def initialize(source, name, location); 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#10376 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11386 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10302 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11396 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10307 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String? - # - # source://prism//lib/prism/node.rb#11463 - sig { returns(T.nilable(String)) } - def closing; end - - # attr_reader closing_loc: Location? - # - # source://prism//lib/prism/node.rb#11445 - sig { returns(T.nilable(Prism::Location)) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11406 + # source://prism//lib/prism/node.rb#10317 + 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#11401 + # source://prism//lib/prism/node.rb#10312 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> InterpolatedSymbolNode + # def copy: (?name: Symbol, ?location: Location) -> InstanceVariableReadNode # - # source://prism//lib/prism/node.rb#11411 - sig { params(params: T.untyped).returns(Prism::InterpolatedSymbolNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10322 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::InstanceVariableReadNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11396 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10307 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#11425 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10330 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#11468 - def inspect(inspector = T.unsafe(nil)); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def opening: () -> String? + # def inspect -> String # - # source://prism//lib/prism/node.rb#11458 - sig { returns(T.nilable(String)) } - def opening; end + # source://prism//lib/prism/node.rb#10342 + sig { override.returns(String) } + def inspect; end - # attr_reader opening_loc: Location? + # The name of the instance variable, which is a `@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). # - # source://prism//lib/prism/node.rb#11430 - sig { returns(T.nilable(Prism::Location)) } - def opening_loc; end - - # attr_reader parts: Array[Node] + # @x # name `:@x` # - # source://prism//lib/prism/node.rb#11442 - sig { returns(T::Array[Prism::Node]) } - def parts; end - - # source://prism//lib/prism/node.rb#11390 - def set_newline_flag(newline_marked); end + # @_test # name `:@_test` + # + # source://prism//lib/prism/node.rb#10339 + sig { returns(Symbol) } + def name; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16645,7 +18832,8 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11490 + # source://prism//lib/prism/node.rb#10360 + sig { override.returns(Symbol) } def type; end class << self @@ -16656,109 +18844,89 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11500 + # source://prism//lib/prism/node.rb#10370 def type; end end end -# Represents an xstring literal that contains interpolation. +# Represents writing to an instance variable in a context that doesn't have an explicit value. # -# `foo #{bar} baz` -# ^^^^^^^^^^^^^^^^ +# @foo, @bar = baz +# ^^^^ ^^^^ # -# source://prism//lib/prism/node.rb#11509 -class Prism::InterpolatedXStringNode < ::Prism::Node - include ::Prism::HeredocQuery - - # def initialize: (Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#10386 +class Prism::InstanceVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode + # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#11511 - def initialize(source, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#10388 + sig { params(source: Prism::Source, name: Symbol, location: Prism::Location).void } + def initialize(source, name, location); 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#10466 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11521 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10396 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11531 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10401 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//lib/prism/node.rb#11586 - sig { returns(String) } - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//lib/prism/node.rb#11574 - sig { returns(Prism::Location) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11541 + # source://prism//lib/prism/node.rb#10411 + 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#11536 + # source://prism//lib/prism/node.rb#10406 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> InterpolatedXStringNode + # def copy: (?name: Symbol, ?location: Location) -> InstanceVariableTargetNode # - # source://prism//lib/prism/node.rb#11546 - sig { params(params: T.untyped).returns(Prism::InterpolatedXStringNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10416 + sig { params(name: Symbol, location: Prism::Location).returns(Prism::InstanceVariableTargetNode) } + def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11531 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10401 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#11560 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10424 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#11591 - def inspect(inspector = T.unsafe(nil)); end - - # def opening: () -> String - # - # source://prism//lib/prism/node.rb#11581 - sig { returns(String) } - def opening; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader opening_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#11565 - sig { returns(Prism::Location) } - def opening_loc; end + # source://prism//lib/prism/node.rb#10432 + sig { override.returns(String) } + def inspect; end - # attr_reader parts: Array[Node] + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#11571 - sig { returns(T::Array[Prism::Node]) } - def parts; end - - # source://prism//lib/prism/node.rb#11525 - def set_newline_flag(newline_marked); end + # source://prism//lib/prism/node.rb#10429 + sig { returns(Symbol) } + def name; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16775,7 +18943,8 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11613 + # source://prism//lib/prism/node.rb#10450 + sig { override.returns(Symbol) } def type; end class << self @@ -16786,88 +18955,134 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11623 + # source://prism//lib/prism/node.rb#10460 def type; end end end -# Represents a hash literal without opening and closing braces. +# Represents writing to an instance variable. # -# foo(a: b) -# ^^^^ +# @foo = 1 +# ^^^^^^^^ # -# source://prism//lib/prism/node.rb#11632 -class Prism::KeywordHashNode < ::Prism::Node - # def initialize: (Integer flags, Array[Node] elements, Location location) -> void +# source://prism//lib/prism/node.rb#10476 +class Prism::InstanceVariableWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # - # @return [KeywordHashNode] a new instance of KeywordHashNode + # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#11634 - def initialize(source, flags, elements, location); end + # source://prism//lib/prism/node.rb#10478 + sig do + params( + source: Prism::Source, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, name, name_loc, value, operator_loc, location); 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#10597 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11643 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10489 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11648 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10494 + 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#11658 + # source://prism//lib/prism/node.rb#10504 + 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#11653 + # source://prism//lib/prism/node.rb#10499 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> KeywordHashNode + # def copy: (?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> InstanceVariableWriteNode # - # source://prism//lib/prism/node.rb#11663 - sig { params(params: T.untyped).returns(Prism::KeywordHashNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10509 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::InstanceVariableWriteNode) + end + def copy(name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11648 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10494 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Node], location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#11676 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10517 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader elements: Array[Node] + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#11685 - sig { returns(T::Array[Prism::Node]) } - def elements; end + # source://prism//lib/prism/node.rb#10563 + sig { override.returns(String) } + def inspect; end - # def inspect(NodeInspector inspector) -> String + # The name of the instance variable, which is a `@` followed by an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). + # + # @x = :y # name `:@x` # - # source://prism//lib/prism/node.rb#11694 - def inspect(inspector = T.unsafe(nil)); end + # @_foo = "bar" # name `@_foo` + # + # source://prism//lib/prism/node.rb#10526 + sig { returns(Symbol) } + def name; end - # def symbol_keys?: () -> bool + # The location of the variable name. # - # @return [Boolean] + # @_x = 1 + # ^^^ # - # source://prism//lib/prism/node.rb#11689 - sig { returns(T::Boolean) } - def symbol_keys?; end + # source://prism//lib/prism/node.rb#10532 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#10558 + sig { returns(String) } + def operator; end + + # The location of the `=` operator. + # + # @x = y + # ^ + # + # source://prism//lib/prism/node.rb#10551 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -16884,16 +19099,21 @@ class Prism::KeywordHashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11716 + # source://prism//lib/prism/node.rb#10581 + sig { override.returns(Symbol) } def type; end - private - - # private attr_reader flags: Integer + # The value to write to the instance variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/node.rb#11681 - sig { returns(Integer) } - def flags; end + # @foo = :bar + # ^^^^ + # + # @_x = 1234 + # ^^^^ + # + # source://prism//lib/prism/node.rb#10545 + sig { returns(Prism::Node) } + def value; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -16903,117 +19123,140 @@ class Prism::KeywordHashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11726 + # source://prism//lib/prism/node.rb#10591 def type; end end end -# Flags for keyword hash nodes. +# Flags for integer nodes that correspond to the base of the integer. # -# source://prism//lib/prism/node.rb#19292 -module Prism::KeywordHashNodeFlags; end +# source://prism//lib/prism/node.rb#19241 +module Prism::IntegerBaseFlags; end -# a keyword hash which only has `AssocNode` elements all with symbol keys, which means the elements can be treated as keyword arguments +# 0b prefix # -# source://prism//lib/prism/node.rb#19294 -Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) +# source://prism//lib/prism/node.rb#19243 +Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) -# Represents a keyword rest parameter to a method, block, or lambda definition. -# -# def a(**b) -# ^^^ -# end +# 0d or no prefix # -# source://prism//lib/prism/node.rb#11736 -class Prism::KeywordRestParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void - # - # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode - # - # source://prism//lib/prism/node.rb#11738 - def initialize(source, flags, name, name_loc, operator_loc, location); end +# source://prism//lib/prism/node.rb#19246 +Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) - # def accept: (Visitor visitor) -> void +# 0x prefix +# +# source://prism//lib/prism/node.rb#19252 +Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) + +# 0o or 0 prefix +# +# source://prism//lib/prism/node.rb#19249 +Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) + +# Represents an integer number literal. +# +# 1 +# ^ +# +# source://prism//lib/prism/node.rb#10610 +class Prism::IntegerNode < ::Prism::Node + # def initialize: (Integer flags, Integer value, Location location) -> void # - # source://prism//lib/prism/node.rb#11749 - sig { params(visitor: Prism::Visitor).void } + # @return [IntegerNode] a new instance of IntegerNode + # + # source://prism//lib/prism/node.rb#10612 + sig { params(source: Prism::Source, flags: Integer, value: Integer, location: Prism::Location).void } + def initialize(source, flags, value, location); 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#10715 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#10621 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # def binary?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10661 + sig { returns(T::Boolean) } + def binary?; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11754 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10626 + 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#11764 + # source://prism//lib/prism/node.rb#10636 + 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#11759 + # source://prism//lib/prism/node.rb#10631 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> KeywordRestParameterNode + # def copy: (?flags: Integer, ?value: Integer, ?location: Location) -> IntegerNode # - # source://prism//lib/prism/node.rb#11769 - sig { params(params: T.untyped).returns(Prism::KeywordRestParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10641 + sig { params(flags: Integer, value: Integer, location: Prism::Location).returns(Prism::IntegerNode) } + def copy(flags: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end + + # def decimal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10666 + sig { returns(T::Boolean) } + def decimal?; end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11754 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10626 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, value: Integer, location: Location } # - # source://prism//lib/prism/node.rb#11784 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10649 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#11825 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader name: Symbol? - # - # source://prism//lib/prism/node.rb#11793 - sig { returns(T.nilable(Symbol)) } - def name; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader name_loc: Location? + # def hexadecimal?: () -> bool # - # source://prism//lib/prism/node.rb#11796 - sig { returns(T.nilable(Prism::Location)) } - def name_loc; end - - # def operator: () -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#11820 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/node.rb#10676 + sig { returns(T::Boolean) } + def hexadecimal?; end - # attr_reader operator_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#11808 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#10681 + sig { override.returns(String) } + def inspect; end - # def repeated_parameter?: () -> bool + # def octal?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#11815 + # source://prism//lib/prism/node.rb#10671 sig { returns(T::Boolean) } - def repeated_parameter?; end + def octal?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17030,14 +19273,21 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#11853 + # source://prism//lib/prism/node.rb#10699 + sig { override.returns(Symbol) } def type; end - private + # The value of the integer literal as a number. + # + # source://prism//lib/prism/node.rb#10658 + sig { returns(Integer) } + def value; end + + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#11789 + # source://prism//lib/prism/node.rb#10654 sig { returns(Integer) } def flags; end @@ -17049,128 +19299,210 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#11863 + # source://prism//lib/prism/node.rb#10709 def type; end end end -# Represents using a lambda literal (not the lambda method call). +# Represents a regular expression literal that contains interpolation that is being used in the predicate of a conditional to implicitly match against the last line read by an IO object. # -# ->(value) { value * 2 } -# ^^^^^^^^^^^^^^^^^^^^^^^ +# if /foo #{bar} baz/ then end +# ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#11872 -class Prism::LambdaNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, Location operator_loc, Location opening_loc, Location closing_loc, Node? parameters, Node? body, Location location) -> void +# source://prism//lib/prism/node.rb#10726 +class Prism::InterpolatedMatchLastLineNode < ::Prism::Node + include ::Prism::RegularExpressionOptions + + # def initialize: (Integer flags, Location opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] parts, Location closing_loc, Location location) -> void # - # @return [LambdaNode] a new instance of LambdaNode + # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#11874 - def initialize(source, locals, operator_loc, opening_loc, closing_loc, parameters, body, location); end + # source://prism//lib/prism/node.rb#10728 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, parts, closing_loc, location); 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#10897 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#11887 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#10739 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: Node? + # def ascii_8bit?: () -> bool # - # source://prism//lib/prism/node.rb#11956 - sig { returns(T.nilable(Prism::Node)) } - def body; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10823 + sig { returns(T::Boolean) } + def ascii_8bit?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11892 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10749 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#11970 + # source://prism//lib/prism/node.rb#10858 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#11947 + # source://prism//lib/prism/node.rb#10791 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#11905 + # source://prism//lib/prism/node.rb#10759 + 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#11897 + # source://prism//lib/prism/node.rb#10754 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LambdaNode + # def copy: (?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedMatchLastLineNode # - # source://prism//lib/prism/node.rb#11910 - sig { params(params: T.untyped).returns(Prism::LambdaNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#10764 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::InterpolatedMatchLastLineNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#11892 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#10749 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: Node?, body: Node?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#11927 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#10772 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # def euc_jp?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10818 + sig { returns(T::Boolean) } + def euc_jp?; end + + # def extended?: () -> bool + # + # @return [Boolean] # - # source://prism//lib/prism/node.rb#11975 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10803 + sig { returns(T::Boolean) } + def extended?; end - # attr_reader locals: Array[Symbol] + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#11932 - sig { returns(T::Array[Symbol]) } - def locals; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10843 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end + + # def forced_us_ascii_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10848 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end + + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10838 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end + + # def ignore_case?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10798 + sig { returns(T::Boolean) } + def ignore_case?; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#10863 + sig { override.returns(String) } + def inspect; end + + # def multi_line?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10808 + sig { returns(T::Boolean) } + def multi_line?; end + + # def once?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10813 + sig { returns(T::Boolean) } + def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#11965 + # source://prism//lib/prism/node.rb#10853 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#11941 + # source://prism//lib/prism/node.rb#10781 sig { returns(Prism::Location) } def opening_loc; end - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#11960 - sig { returns(String) } - def operator; end + sig { returns(Integer) } + def options; end - # attr_reader operator_loc: Location + # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#11935 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#10788 + sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } + def parts; end - # attr_reader parameters: Node? - # - # source://prism//lib/prism/node.rb#11953 - sig { returns(T.nilable(Prism::Node)) } - def parameters; end + # source://prism//lib/prism/node.rb#10743 + def set_newline_flag(newline_marked); end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17187,9 +19519,34 @@ class Prism::LambdaNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12010 + # source://prism//lib/prism/node.rb#10881 + sig { override.returns(Symbol) } def type; end + # def utf_8?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10833 + sig { returns(T::Boolean) } + def utf_8?; end + + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10828 + sig { returns(T::Boolean) } + def windows_31j?; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#10777 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -17198,356 +19555,210 @@ class Prism::LambdaNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12020 + # source://prism//lib/prism/node.rb#10891 def type; end end end -# This class is responsible for lexing the source using prism and then -# converting those tokens to be compatible with Ripper. In the vast majority -# of cases, this is a one-to-one mapping of the token type. Everything else -# generally lines up. However, there are a few cases that require special -# handling. +# Represents a regular expression literal that contains interpolation. # -# source://prism//lib/prism/lex_compat.rb#12 -class Prism::LexCompat - # @return [LexCompat] a new instance of LexCompat +# /foo #{bar} baz/ +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10911 +class Prism::InterpolatedRegularExpressionNode < ::Prism::Node + include ::Prism::RegularExpressionOptions + + # def initialize: (Integer flags, Location opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] parts, Location closing_loc, Location location) -> void # - # source://prism//lib/prism/lex_compat.rb#600 - def initialize(source, **options); end + # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode + # + # source://prism//lib/prism/node.rb#10913 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, parts, closing_loc, location); end - # Returns the value of attribute options. + # 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/lex_compat.rb#598 - def options; end + # source://prism//lib/prism/node.rb#11082 + def ===(other); end - # source://prism//lib/prism/lex_compat.rb#605 - def result; end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#10924 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Returns the value of attribute source. + # def ascii_8bit?: () -> bool # - # source://prism//lib/prism/lex_compat.rb#598 - def source; end -end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11008 + sig { returns(T::Boolean) } + def ascii_8bit?; 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#211 -class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#212 - def ==(other); end -end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#10934 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end -# A heredoc in this case is a list of tokens that belong to the body of the -# heredoc that should be appended onto the list of tokens when the heredoc -# closes. -# -# source://prism//lib/prism/lex_compat.rb#272 -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#584 - def build(opening); end - end -end - -# Dash heredocs are a little more complicated. They are a list of tokens -# 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#296 -class Prism::LexCompat::Heredoc::DashHeredoc - # @return [DashHeredoc] a new instance of DashHeredoc + # def closing: () -> String # - # source://prism//lib/prism/lex_compat.rb#299 - def initialize(split); end - - # source://prism//lib/prism/lex_compat.rb#304 - def <<(token); end - - # source://prism//lib/prism/lex_compat.rb#297 - def split; end - - # source://prism//lib/prism/lex_compat.rb#308 - def to_a; end - - # source://prism//lib/prism/lex_compat.rb#297 - def tokens; end -end + # source://prism//lib/prism/node.rb#11043 + sig { returns(String) } + def closing; end -# Heredocs that are dedenting heredocs are a little more complicated. -# Ripper outputs on_ignored_sp tokens for the whitespace that is being -# removed from the output. prism only modifies the node itself and keeps -# the token the same. This simplifies prism, but makes comparing against -# Ripper much harder because there is a length mismatch. -# -# Fortunately, we already have to pull out the heredoc tokens in order to -# insert them into the stream in the correct order. As such, we can do -# 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#355 -class Prism::LexCompat::Heredoc::DedentingHeredoc - # @return [DedentingHeredoc] a new instance of DedentingHeredoc + # attr_reader closing_loc: Location # - # source://prism//lib/prism/lex_compat.rb#360 - def initialize; end + # source://prism//lib/prism/node.rb#10976 + sig { returns(Prism::Location) } + def closing_loc; 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. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/lex_compat.rb#371 - def <<(token); end + # source://prism//lib/prism/node.rb#10944 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Returns the value of attribute dedent. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/lex_compat.rb#358 - def dedent; end + # source://prism//lib/prism/node.rb#10939 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Returns the value of attribute dedent_next. + # def copy: (?flags: Integer, ?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedRegularExpressionNode # - # source://prism//lib/prism/lex_compat.rb#358 - def dedent_next; end + # source://prism//lib/prism/node.rb#10949 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::InterpolatedRegularExpressionNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end - # Returns the value of attribute embexpr_balance. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/lex_compat.rb#358 - def embexpr_balance; end - - # source://prism//lib/prism/lex_compat.rb#408 - def to_a; end + # source://prism//lib/prism/node.rb#10934 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Returns the value of attribute tokens. + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/lex_compat.rb#358 - def tokens; end -end - -# source://prism//lib/prism/lex_compat.rb#356 -Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer) + # source://prism//lib/prism/node.rb#10957 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end -# Heredocs that are no dash or tilde heredocs are just a list of tokens. -# We need to keep them around so that we can insert them in the correct -# 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#277 -class Prism::LexCompat::Heredoc::PlainHeredoc - # @return [PlainHeredoc] a new instance of PlainHeredoc + # def euc_jp?: () -> bool # - # source://prism//lib/prism/lex_compat.rb#280 - def initialize; end - - # source://prism//lib/prism/lex_compat.rb#284 - def <<(token); end - - # source://prism//lib/prism/lex_compat.rb#288 - def to_a; end - - # source://prism//lib/prism/lex_compat.rb#278 - def tokens; end -end - -# Ident tokens for the most part are exactly the same, except sometimes we -# know an ident is a local when ripper doesn't (when they are introduced -# through named captures in regular expressions). In that case we don't -# compare the state. -# -# source://prism//lib/prism/lex_compat.rb#229 -class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#230 - 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#219 -class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#220 - 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#240 -class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#241 - def ==(other); end -end - -# If we have an identifier that follows a method name like: -# -# def foo bar -# -# then Ripper will mark bar as END|LABEL if there is a local in a parent -# scope named bar because it hasn't pushed the local table yet. We do this -# more accurately, so we need to allow comparing against both END and -# END|LABEL. -# -# source://prism//lib/prism/lex_compat.rb#260 -class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token - # source://prism//lib/prism/lex_compat.rb#261 - def ==(other); end -end - -# This is a mapping of prism token types to Ripper token types. This is a -# many-to-one mapping because we split up our token types, whereas Ripper -# tends to group them. -# -# source://prism//lib/prism/lex_compat.rb#16 -Prism::LexCompat::RIPPER = T.let(T.unsafe(nil), Hash) - -# When we produce tokens, we produce the same arrays that Ripper does. -# 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#187 -class Prism::LexCompat::Token < ::SimpleDelegator - # The type of the token. + # @return [Boolean] # - # source://prism//lib/prism/lex_compat.rb#194 - def event; end + # source://prism//lib/prism/node.rb#11003 + sig { returns(T::Boolean) } + def euc_jp?; end - # The location of the token in the source. + # def extended?: () -> bool # - # source://prism//lib/prism/lex_compat.rb#189 - def location; end - - # The state of the lexer when this token was produced. + # @return [Boolean] # - # source://prism//lib/prism/lex_compat.rb#204 - def state; end + # source://prism//lib/prism/node.rb#10988 + sig { returns(T::Boolean) } + def extended?; end - # The slice of the source that this token represents. - # - # source://prism//lib/prism/lex_compat.rb#199 - def value; end -end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end -# This is a class that wraps the Ripper lexer to produce almost exactly the -# same tokens. -# -# source://prism//lib/prism/lex_compat.rb#853 -class Prism::LexRipper - # @return [LexRipper] a new instance of LexRipper + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/lex_compat.rb#856 - def initialize(source); end - - # source://prism//lib/prism/lex_compat.rb#860 - def result; end - - # source://prism//lib/prism/lex_compat.rb#854 - def source; end - - private - - # source://prism//lib/prism/lex_compat.rb#894 - def lex(source); end -end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11028 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end -# Represents the use of the `&&=` operator for assignment to a local variable. -# -# target &&= value -# ^^^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#12029 -class Prism::LocalVariableAndWriteNode < ::Prism::Node - # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Integer depth, Location location) -> void + # def forced_us_ascii_encoding?: () -> bool # - # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode + # @return [Boolean] # - # source://prism//lib/prism/node.rb#12031 - def initialize(source, name_loc, operator_loc, value, name, depth, location); end + # source://prism//lib/prism/node.rb#11033 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # def accept: (Visitor visitor) -> void + # def forced_utf8_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#12043 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end - - # def child_nodes: () -> Array[nil | Node] + # @return [Boolean] # - # source://prism//lib/prism/node.rb#12048 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/node.rb#11023 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # def comment_targets: () -> Array[Node | Location] + # def ignore_case?: () -> bool # - # source://prism//lib/prism/node.rb#12058 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] + # @return [Boolean] # - # source://prism//lib/prism/node.rb#12053 - def compact_child_nodes; end + # source://prism//lib/prism/node.rb#10983 + sig { returns(T::Boolean) } + def ignore_case?; end - # def copy: (**params) -> LocalVariableAndWriteNode + # def inspect -> String # - # source://prism//lib/prism/node.rb#12063 - sig { params(params: T.untyped).returns(Prism::LocalVariableAndWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11048 + sig { override.returns(String) } + def inspect; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def multi_line?: () -> bool # - # source://prism//lib/prism/node.rb#12048 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end - - # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location } + # @return [Boolean] # - # source://prism//lib/prism/node.rb#12079 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/node.rb#10993 + sig { returns(T::Boolean) } + def multi_line?; end - # attr_reader depth: Integer + # def once?: () -> bool # - # source://prism//lib/prism/node.rb#12102 - sig { returns(Integer) } - def depth; end - - # source://prism//lib/prism/desugar_compiler.rb#197 - def desugar; end - - # def inspect(NodeInspector inspector) -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#12111 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10998 + sig { returns(T::Boolean) } + def once?; end - # attr_reader name: Symbol + # def opening: () -> String # - # source://prism//lib/prism/node.rb#12099 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/node.rb#11038 + sig { returns(String) } + def opening; end - # attr_reader name_loc: Location + # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#12084 + # source://prism//lib/prism/node.rb#10966 sig { returns(Prism::Location) } - def name_loc; end + def opening_loc; end - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#12106 - sig { returns(String) } - def operator; end + sig { returns(Integer) } + def options; end - # attr_reader operator_loc: Location + # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#12090 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#10973 + sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } + def parts; end + + # source://prism//lib/prism/node.rb#10928 + def set_newline_flag(newline_marked); end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17564,14 +19775,33 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12136 + # source://prism//lib/prism/node.rb#11066 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # def utf_8?: () -> bool # - # source://prism//lib/prism/node.rb#12096 - sig { returns(Prism::Node) } - def value; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11018 + sig { returns(T::Boolean) } + def utf_8?; end + + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11013 + sig { returns(T::Boolean) } + def windows_31j?; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#10962 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -17581,107 +19811,156 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12146 + # source://prism//lib/prism/node.rb#11076 def type; end end end -# Represents assigning to a local variable using an operator that isn't `=`. +# Represents a string literal that contains interpolation. # -# target += value -# ^^^^^^^^^^^^^^^ +# "foo #{bar} baz" +# ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12155 -class Prism::LocalVariableOperatorWriteNode < ::Prism::Node - # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Symbol operator, Integer depth, Location location) -> void +# source://prism//lib/prism/node.rb#11096 +class Prism::InterpolatedStringNode < ::Prism::Node + include ::Prism::HeredocQuery + + # def initialize: (Integer flags, Location? opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode] parts, Location? closing_loc, Location location) -> void # - # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode + # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode # - # source://prism//lib/prism/node.rb#12157 - def initialize(source, name_loc, operator_loc, value, name, operator, depth, location); end + # source://prism//lib/prism/node.rb#11098 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: T.nilable(Prism::Location), + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode)], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, parts, closing_loc, location); 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#11234 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12170 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11109 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12175 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11119 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#11195 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#11167 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12185 + # source://prism//lib/prism/node.rb#11129 + 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#12180 + # source://prism//lib/prism/node.rb#11124 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LocalVariableOperatorWriteNode + # def copy: (?flags: Integer, ?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], ?closing_loc: Location?, ?location: Location) -> InterpolatedStringNode # - # source://prism//lib/prism/node.rb#12190 - sig { params(params: T.untyped).returns(Prism::LocalVariableOperatorWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11134 + sig do + params( + flags: Integer, + opening_loc: T.nilable(Prism::Location), + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode)], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::InterpolatedStringNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12175 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11119 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, operator: Symbol, depth: Integer, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode], closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#12207 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#11142 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader depth: Integer + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def frozen?: () -> bool # - # source://prism//lib/prism/node.rb#12233 - sig { returns(Integer) } - def depth; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11180 + sig { returns(T::Boolean) } + def frozen?; end - # source://prism//lib/prism/desugar_compiler.rb#209 - def desugar; end + sig { returns(T::Boolean) } + def heredoc?; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#12237 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11200 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # def mutable?: () -> bool # - # source://prism//lib/prism/node.rb#12227 - sig { returns(Symbol) } - def name; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11185 + sig { returns(T::Boolean) } + def mutable?; end - # attr_reader name_loc: Location + # def opening: () -> String? # - # source://prism//lib/prism/node.rb#12212 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/node.rb#11190 + sig { returns(T.nilable(String)) } + def opening; end - # attr_reader operator: Symbol + # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#12230 - sig { returns(Symbol) } - def operator; end + # source://prism//lib/prism/node.rb#11151 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end - # attr_reader operator_loc: Location + # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode | InterpolatedStringNode] # - # source://prism//lib/prism/node.rb#12218 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#11164 + sig do + returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode, Prism::InterpolatedStringNode)]) + end + def parts; end + + # source://prism//lib/prism/node.rb#11113 + def set_newline_flag(newline_marked); end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17698,14 +19977,17 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12263 + # source://prism//lib/prism/node.rb#11218 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + protected + + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#12224 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/node.rb#11147 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -17715,107 +19997,142 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12273 + # source://prism//lib/prism/node.rb#11228 def type; end end end -# Represents the use of the `||=` operator for assignment to a local variable. +# Flags for interpolated string nodes that indicated mutability if they are also marked as literals. # -# target ||= value -# ^^^^^^^^^^^^^^^^ +# source://prism//lib/prism/node.rb#19256 +module Prism::InterpolatedStringNodeFlags; end + +# source://prism//lib/prism/node.rb#19258 +Prism::InterpolatedStringNodeFlags::FROZEN = T.let(T.unsafe(nil), Integer) + +# source://prism//lib/prism/node.rb#19261 +Prism::InterpolatedStringNodeFlags::MUTABLE = T.let(T.unsafe(nil), Integer) + +# Represents a symbol literal that contains interpolation. # -# source://prism//lib/prism/node.rb#12282 -class Prism::LocalVariableOrWriteNode < ::Prism::Node - # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Integer depth, Location location) -> void +# :"foo #{bar} baz" +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11248 +class Prism::InterpolatedSymbolNode < ::Prism::Node + # def initialize: (Location? opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] parts, Location? closing_loc, Location location) -> void # - # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode + # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#12284 - def initialize(source, name_loc, operator_loc, value, name, depth, location); end + # source://prism//lib/prism/node.rb#11250 + sig do + params( + source: Prism::Source, + opening_loc: T.nilable(Prism::Location), + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(source, opening_loc, parts, closing_loc, location); 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#11371 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12296 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11260 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12301 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11270 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#11332 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#11314 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12311 + # source://prism//lib/prism/node.rb#11280 + 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#12306 + # source://prism//lib/prism/node.rb#11275 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LocalVariableOrWriteNode + # def copy: (?opening_loc: Location?, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location?, ?location: Location) -> InterpolatedSymbolNode # - # source://prism//lib/prism/node.rb#12316 - sig { params(params: T.untyped).returns(Prism::LocalVariableOrWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11285 + sig do + params( + opening_loc: T.nilable(Prism::Location), + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::InterpolatedSymbolNode) + end + def copy(opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12301 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11270 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#12332 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#11293 + 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#12355 - sig { returns(Integer) } - def depth; end - - # source://prism//lib/prism/desugar_compiler.rb#203 - def desugar; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#12364 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11337 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # def opening: () -> String? # - # source://prism//lib/prism/node.rb#12352 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/node.rb#11327 + sig { returns(T.nilable(String)) } + def opening; end - # attr_reader name_loc: Location + # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#12337 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/node.rb#11298 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end - # def operator: () -> String + # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # source://prism//lib/prism/node.rb#12359 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/node.rb#11311 + sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } + def parts; end - # attr_reader operator_loc: Location - # - # source://prism//lib/prism/node.rb#12343 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#11264 + def set_newline_flag(newline_marked); end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17832,15 +20149,10 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12389 + # source://prism//lib/prism/node.rb#11355 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node - # - # source://prism//lib/prism/node.rb#12349 - sig { returns(Prism::Node) } - def value; end - class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -17849,104 +20161,241 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12399 + # source://prism//lib/prism/node.rb#11365 def type; end end end -# Represents reading a local variable. Note that this requires that a local variable of the same name has already been written to in the same scope, otherwise it is parsed as a method call. +# Represents an xstring literal that contains interpolation. # -# foo -# ^^^ +# `foo #{bar} baz` +# ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12408 -class Prism::LocalVariableReadNode < ::Prism::Node - # def initialize: (Symbol name, Integer depth, Location location) -> void +# source://prism//lib/prism/node.rb#11384 +class Prism::InterpolatedXStringNode < ::Prism::Node + include ::Prism::HeredocQuery + + # def initialize: (Location opening_loc, Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] parts, Location closing_loc, Location location) -> void # - # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode + # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#12410 - def initialize(source, name, depth, location); end + # source://prism//lib/prism/node.rb#11386 + sig do + params( + source: Prism::Source, + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, opening_loc, parts, closing_loc, location); 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#11495 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12419 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11396 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12424 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11406 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#11456 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#11444 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#12434 + # source://prism//lib/prism/node.rb#11416 + 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#12429 + # source://prism//lib/prism/node.rb#11411 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LocalVariableReadNode + # def copy: (?opening_loc: Location, ?parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], ?closing_loc: Location, ?location: Location) -> InterpolatedXStringNode # - # source://prism//lib/prism/node.rb#12439 - sig { params(params: T.untyped).returns(Prism::LocalVariableReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11421 + sig do + params( + opening_loc: Prism::Location, + parts: T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)], + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::InterpolatedXStringNode) + end + def copy(opening_loc: T.unsafe(nil), parts: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12424 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11406 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode], closing_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#12452 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#11429 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # The number of visible scopes that should be searched to find the origin of this local variable. - # - # foo = 1; foo # depth 0 - # - # bar = 2; tap { bar } # depth 1 - # - # 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). + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + sig { returns(T::Boolean) } + def heredoc?; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#12478 - sig { returns(Integer) } - def depth; end + # source://prism//lib/prism/node.rb#11461 + sig { override.returns(String) } + def inspect; end - # def inspect(NodeInspector inspector) -> String + # def opening: () -> String # - # source://prism//lib/prism/node.rb#12482 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11451 + sig { returns(String) } + def opening; end - # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). + # attr_reader opening_loc: Location # - # x # name `:x` + # source://prism//lib/prism/node.rb#11434 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader parts: Array[StringNode | EmbeddedStatementsNode | EmbeddedVariableNode] # - # _Test # name `:_Test` + # source://prism//lib/prism/node.rb#11441 + sig { returns(T::Array[T.any(Prism::StringNode, Prism::EmbeddedStatementsNode, Prism::EmbeddedVariableNode)]) } + def parts; end + + # source://prism//lib/prism/node.rb#11400 + def set_newline_flag(newline_marked); end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # Note that this can also be an underscore followed by a number for the default block parameters. + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # _1 # name `:_1` + # def type: () -> Symbol # - # Finally, for the default `it` block parameter, the name is `0it`. This is to distinguish it from an `it` local variable that is explicitly declared. + # source://prism//lib/prism/node.rb#11479 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#11489 + def type; end + end +end + +# Represents an implicit set of parameters through the use of the `it` keyword within a block or lambda. +# +# -> { it + it } +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11508 +class Prism::ItParametersNode < ::Prism::Node + # def initialize: (Location location) -> void # - # it # name `:0it` + # @return [ItParametersNode] a new instance of ItParametersNode # - # source://prism//lib/prism/node.rb#12469 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/node.rb#11510 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); 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#11584 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#11517 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#11522 + 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#11532 + 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#11527 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?location: Location) -> ItParametersNode + # + # source://prism//lib/prism/node.rb#11537 + sig { params(location: Prism::Location).returns(Prism::ItParametersNode) } + def copy(location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#11522 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#11545 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#11550 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -17963,7 +20412,8 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12503 + # source://prism//lib/prism/node.rb#11568 + sig { override.returns(Symbol) } def type; end class << self @@ -17974,86 +20424,110 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12513 + # source://prism//lib/prism/node.rb#11578 def type; end end end -# Represents writing to a local variable in a context that doesn't have an explicit value. +# Represents a hash literal without opening and closing braces. # -# foo, bar = baz -# ^^^ ^^^ +# foo(a: b) +# ^^^^ # -# source://prism//lib/prism/node.rb#12522 -class Prism::LocalVariableTargetNode < ::Prism::Node - # def initialize: (Symbol name, Integer depth, Location location) -> void +# source://prism//lib/prism/node.rb#11593 +class Prism::KeywordHashNode < ::Prism::Node + # def initialize: (Integer flags, Array[AssocNode | AssocSplatNode] elements, Location location) -> void # - # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode + # @return [KeywordHashNode] a new instance of KeywordHashNode # - # source://prism//lib/prism/node.rb#12524 - def initialize(source, name, depth, location); end + # source://prism//lib/prism/node.rb#11595 + sig do + params( + source: Prism::Source, + flags: Integer, + elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)], + location: Prism::Location + ).void + end + def initialize(source, flags, elements, location); 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#11683 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12533 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11604 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12538 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11609 + 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#12548 + # source://prism//lib/prism/node.rb#11619 + 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#12543 + # source://prism//lib/prism/node.rb#11614 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LocalVariableTargetNode + # def copy: (?flags: Integer, ?elements: Array[AssocNode | AssocSplatNode], ?location: Location) -> KeywordHashNode # - # source://prism//lib/prism/node.rb#12553 - sig { params(params: T.untyped).returns(Prism::LocalVariableTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11624 + sig do + params( + flags: Integer, + elements: T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)], + location: Prism::Location + ).returns(Prism::KeywordHashNode) + end + def copy(flags: T.unsafe(nil), elements: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12538 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11609 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[AssocNode | AssocSplatNode], location: Location } # - # source://prism//lib/prism/node.rb#12566 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#11632 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader depth: Integer + # attr_reader elements: Array[AssocNode | AssocSplatNode] # - # source://prism//lib/prism/node.rb#12574 - sig { returns(Integer) } - def depth; end + # source://prism//lib/prism/node.rb#11641 + sig { returns(T::Array[T.any(Prism::AssocNode, Prism::AssocSplatNode)]) } + def elements; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#12578 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11649 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # def symbol_keys?: () -> bool # - # source://prism//lib/prism/node.rb#12571 - sig { returns(Symbol) } - def name; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11644 + sig { returns(T::Boolean) } + def symbol_keys?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -18070,9 +20544,18 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12599 + # source://prism//lib/prism/node.rb#11667 + sig { override.returns(Symbol) } def type; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#11637 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -18081,105 +20564,144 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12609 + # source://prism//lib/prism/node.rb#11677 def type; end end end -# Represents writing to a local variable. +# Flags for keyword hash nodes. # -# foo = 1 -# ^^^^^^^ +# source://prism//lib/prism/node.rb#19265 +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#12618 -class Prism::LocalVariableWriteNode < ::Prism::Node - # def initialize: (Symbol name, Integer depth, Location name_loc, Node value, Location operator_loc, Location location) -> void +# source://prism//lib/prism/node.rb#19267 +Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) + +# Represents a keyword rest parameter to a method, block, or lambda definition. +# +# def a(**b) +# ^^^ +# end +# +# source://prism//lib/prism/node.rb#11696 +class Prism::KeywordRestParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # - # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode + # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#12620 - def initialize(source, name, depth, name_loc, value, operator_loc, location); end + # source://prism//lib/prism/node.rb#11698 + sig do + params( + source: Prism::Source, + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, name, name_loc, operator_loc, location); 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#11813 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12632 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11709 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12637 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11714 + 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#12647 + # source://prism//lib/prism/node.rb#11724 + 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#12642 + # source://prism//lib/prism/node.rb#11719 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> LocalVariableWriteNode + # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> KeywordRestParameterNode # - # source://prism//lib/prism/node.rb#12652 - sig { params(params: T.untyped).returns(Prism::LocalVariableWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#11729 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::KeywordRestParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12637 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11714 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, name_loc: Location, value: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#12668 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#11737 + 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#12676 - sig { returns(Integer) } - def depth; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def inspect(NodeInspector inspector) -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#12700 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11779 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # attr_reader name: Symbol? # - # source://prism//lib/prism/node.rb#12673 - sig { returns(Symbol) } + # source://prism//lib/prism/node.rb#11746 + sig { returns(T.nilable(Symbol)) } def name; end - # attr_reader name_loc: Location + # attr_reader name_loc: Location? # - # source://prism//lib/prism/node.rb#12679 - sig { returns(Prism::Location) } + # source://prism//lib/prism/node.rb#11749 + sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#12695 + # source://prism//lib/prism/node.rb#11774 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12688 + # source://prism//lib/prism/node.rb#11762 sig { returns(Prism::Location) } def operator_loc; end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#11769 + sig { returns(T::Boolean) } + def repeated_parameter?; end + # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -18195,14 +20717,17 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#12725 + # source://prism//lib/prism/node.rb#11797 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + protected + + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#12685 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/node.rb#11742 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -18212,551 +20737,622 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#12735 + # source://prism//lib/prism/node.rb#11807 def type; end end end -# This represents a location in the source. +# Represents using a lambda literal (not the lambda method call). # -# source://prism//lib/prism/parse_result.rb#98 -class Prism::Location - # Create a new location object with the given source, start byte offset, and - # byte length. +# ->(value) { value * 2 } +# ^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11826 +class Prism::LambdaNode < ::Prism::Node + # def initialize: (Array[Symbol] locals, Location operator_loc, Location opening_loc, Location closing_loc, Prism::node? parameters, Prism::node? body, Location location) -> void # - # @return [Location] a new instance of Location + # @return [LambdaNode] a new instance of LambdaNode # - # source://prism//lib/prism/parse_result.rb#116 - sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void } - def initialize(source, start_offset, length); end + # source://prism//lib/prism/node.rb#11828 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + operator_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + parameters: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + location: Prism::Location + ).void + end + def initialize(source, locals, operator_loc, opening_loc, closing_loc, parameters, body, location); end - # Returns true if the given other location is equal to this location. + # 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/parse_result.rb#232 - def ==(other); end + # source://prism//lib/prism/node.rb#11956 + def ===(other); end - # The list of comments attached to this location + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/parse_result.rb#112 - sig { returns(T::Array[Prism::Comment]) } - def comments; end + # source://prism//lib/prism/node.rb#11841 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Create a new location object with the given options. + # attr_reader body: Prism::node? # - # source://prism//lib/prism/parse_result.rb#124 - sig { params(options: T.untyped).returns(Prism::Location) } - def copy(**options); end + # source://prism//lib/prism/node.rb#11904 + sig { returns(T.nilable(Prism::Node)) } + def body; end - # Implement the hash pattern matching interface for Location. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#222 - def deconstruct_keys(keys); end + # source://prism//lib/prism/node.rb#11846 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # The column number in characters where this location ends from the start of - # the line. + # def closing: () -> String # - # source://prism//lib/prism/parse_result.rb#211 - def end_character_column; end + # source://prism//lib/prism/node.rb#11917 + sig { returns(String) } + def closing; end - # The character offset from the beginning of the source where this location - # ends. + # attr_reader closing_loc: Location # - # source://prism//lib/prism/parse_result.rb#160 - def end_character_offset; end + # source://prism//lib/prism/node.rb#11894 + sig { returns(Prism::Location) } + def closing_loc; end - # The column number in code units of the given encoding where this location - # ends from the start of the line. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/parse_result.rb#217 - def end_code_units_column(encoding = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11859 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # The offset from the start of the file in code units of the given encoding. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/parse_result.rb#165 - def end_code_units_offset(encoding = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#11851 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # The column number in bytes where this location ends from the start of the - # line. + # def copy: (?locals: Array[Symbol], ?operator_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?parameters: Prism::node?, ?body: Prism::node?, ?location: Location) -> LambdaNode # - # source://prism//lib/prism/parse_result.rb#205 - sig { returns(Integer) } - def end_column; end + # source://prism//lib/prism/node.rb#11864 + sig do + params( + locals: T::Array[Symbol], + operator_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + parameters: T.nilable(Prism::Node), + body: T.nilable(Prism::Node), + location: Prism::Location + ).returns(Prism::LambdaNode) + end + def copy(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), location: T.unsafe(nil)); end - # The line number where this location ends. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#181 - sig { returns(Integer) } - def end_line; end + # source://prism//lib/prism/node.rb#11846 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # The byte offset from the beginning of the source where this location ends. + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: Prism::node?, body: Prism::node?, location: Location } # - # source://prism//lib/prism/parse_result.rb#154 - sig { returns(Integer) } - def end_offset; end + # source://prism//lib/prism/node.rb#11872 + 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 location. + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/parse_result.rb#133 + # source://prism//lib/prism/node.rb#11922 + sig { override.returns(String) } def inspect; end - # Returns a new location that stretches from this location to the given - # other location. Raises an error if this location is not before the other - # location or if they don't share the same source. + # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/parse_result.rb#241 - def join(other); end + # source://prism//lib/prism/node.rb#11877 + sig { returns(T::Array[Symbol]) } + def locals; end - # The length of this location in bytes. + # def opening: () -> String # - # source://prism//lib/prism/parse_result.rb#109 - def length; end + # source://prism//lib/prism/node.rb#11912 + sig { returns(String) } + def opening; end - # Implement the pretty print interface for Location. + # attr_reader opening_loc: Location # - # source://prism//lib/prism/parse_result.rb#227 - def pretty_print(q); end + # source://prism//lib/prism/node.rb#11887 + sig { returns(Prism::Location) } + def opening_loc; end - # The source code that this location represents. + # def operator: () -> String # - # source://prism//lib/prism/parse_result.rb#138 + # source://prism//lib/prism/node.rb#11907 sig { returns(String) } - def slice; end + def operator; end - # The column number in characters where this location ends from the start of - # the line. + # attr_reader operator_loc: Location # - # source://prism//lib/prism/parse_result.rb#193 - def start_character_column; end + # source://prism//lib/prism/node.rb#11880 + sig { returns(Prism::Location) } + def operator_loc; end - # The character offset from the beginning of the source where this location - # starts. + # attr_reader parameters: Prism::node? # - # source://prism//lib/prism/parse_result.rb#144 - def start_character_offset; end + # source://prism//lib/prism/node.rb#11901 + sig { returns(T.nilable(Prism::Node)) } + def parameters; end - # The column number in code units of the given encoding where this location - # starts from the start of the line. + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/parse_result.rb#199 - 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. + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/parse_result.rb#149 - 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. + # def type: () -> Symbol # - # source://prism//lib/prism/parse_result.rb#187 - sig { returns(Integer) } - def start_column; end + # source://prism//lib/prism/node.rb#11940 + sig { override.returns(Symbol) } + def type; end - # The line number where this location starts. - # - # source://prism//lib/prism/parse_result.rb#170 - sig { returns(Integer) } - def start_line; end + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#11950 + def type; end + end +end - # The content of the line where this location starts before this location. +# This class is responsible for lexing the source using prism and then +# converting those tokens to be compatible with Ripper. In the vast majority +# of cases, this is a one-to-one mapping of the token type. Everything else +# generally lines up. However, there are a few cases that require special +# handling. +# +# source://prism//lib/prism/lex_compat.rb#12 +class Prism::LexCompat + # @return [LexCompat] a new instance of LexCompat # - # source://prism//lib/prism/parse_result.rb#175 - def start_line_slice; end + # source://prism//lib/prism/lex_compat.rb#619 + def initialize(source, **options); end - # The byte offset from the beginning of the source where this location - # starts. + # Returns the value of attribute options. # - # source://prism//lib/prism/parse_result.rb#106 - sig { returns(Integer) } - def start_offset; end + # source://prism//lib/prism/lex_compat.rb#617 + def options; end - protected + # source://prism//lib/prism/lex_compat.rb#624 + def result; end - # A Source object that is used to determine more information from the given - # offset and length. + # Returns the value of attribute source. # - # source://prism//lib/prism/parse_result.rb#101 + # source://prism//lib/prism/lex_compat.rb#617 def source; end - - class << self - # Returns a null location that does not correspond to a source and points to - # the beginning of the file. Useful for when you want a location object but - # do not care where it points. - # - # source://prism//lib/prism/parse_result.rb#251 - def null; end - end end -# Flags for while and until loop nodes. +# 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/node.rb#19298 -module Prism::LoopFlags; end +# source://prism//lib/prism/lex_compat.rb#230 +class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#231 + def ==(other); end +end -# a loop after a begin statement, so the body is executed first before the condition +# A heredoc in this case is a list of tokens that belong to the body of the +# heredoc that should be appended onto the list of tokens when the heredoc +# closes. # -# source://prism//lib/prism/node.rb#19300 -Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) +# source://prism//lib/prism/lex_compat.rb#291 +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 + def build(opening); end + end +end -# This represents a magic comment that was encountered during parsing. +# Dash heredocs are a little more complicated. They are a list of tokens +# 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/parse_result.rb#303 -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#311 - def initialize(key_loc, value_loc); end - - # Implement the hash pattern matching interface for MagicComment. - # - # source://prism//lib/prism/parse_result.rb#327 - def deconstruct_keys(keys); end - - # Returns a string representation of this magic comment. +# source://prism//lib/prism/lex_compat.rb#315 +class Prism::LexCompat::Heredoc::DashHeredoc + # @return [DashHeredoc] a new instance of DashHeredoc # - # source://prism//lib/prism/parse_result.rb#332 - def inspect; end + # source://prism//lib/prism/lex_compat.rb#318 + def initialize(split); end - # Returns the key of the magic comment by slicing it from the source code. - # - # source://prism//lib/prism/parse_result.rb#317 - def key; end + # source://prism//lib/prism/lex_compat.rb#323 + def <<(token); end - # A Location object representing the location of the key in the source. - # - # source://prism//lib/prism/parse_result.rb#305 - def key_loc; end + # source://prism//lib/prism/lex_compat.rb#316 + def split; end - # Returns the value of the magic comment by slicing it from the source code. - # - # source://prism//lib/prism/parse_result.rb#322 - def value; end + # source://prism//lib/prism/lex_compat.rb#327 + def to_a; end - # A Location object representing the location of the value in the source. - # - # source://prism//lib/prism/parse_result.rb#308 - def value_loc; end + # source://prism//lib/prism/lex_compat.rb#316 + def tokens; end end -# Represents a regular expression literal used in the predicate of a conditional to implicitly match against the last line read by an IO object. +# Heredocs that are dedenting heredocs are a little more complicated. +# Ripper outputs on_ignored_sp tokens for the whitespace that is being +# removed from the output. prism only modifies the node itself and keeps +# the token the same. This simplifies prism, but makes comparing against +# Ripper much harder because there is a length mismatch. # -# if /foo/i then end -# ^^^^^^ +# Fortunately, we already have to pull out the heredoc tokens in order to +# insert them into the stream in the correct order. As such, we can do +# 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/node.rb#12744 -class Prism::MatchLastLineNode < ::Prism::Node - include ::Prism::RegularExpressionOptions - - # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void - # - # @return [MatchLastLineNode] a new instance of MatchLastLineNode - # - # source://prism//lib/prism/node.rb#12746 - def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); end - - # def accept: (Visitor visitor) -> void +# source://prism//lib/prism/lex_compat.rb#374 +class Prism::LexCompat::Heredoc::DedentingHeredoc + # @return [DedentingHeredoc] a new instance of DedentingHeredoc # - # source://prism//lib/prism/node.rb#12758 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/lex_compat.rb#379 + def initialize; end - # def ascii_8bit?: () -> bool - # - # @return [Boolean] + # 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/node.rb#12850 - sig { returns(T::Boolean) } - def ascii_8bit?; end + # source://prism//lib/prism/lex_compat.rb#390 + def <<(token); end - # def child_nodes: () -> Array[nil | Node] + # Returns the value of attribute dedent. # - # source://prism//lib/prism/node.rb#12763 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/lex_compat.rb#377 + def dedent; end - # def closing: () -> String + # Returns the value of attribute dedent_next. # - # source://prism//lib/prism/node.rb#12890 - sig { returns(String) } - def closing; end + # source://prism//lib/prism/lex_compat.rb#377 + def dedent_next; end - # attr_reader closing_loc: Location + # Returns the value of attribute embexpr_balance. # - # source://prism//lib/prism/node.rb#12815 - sig { returns(Prism::Location) } - def closing_loc; end + # source://prism//lib/prism/lex_compat.rb#377 + def embexpr_balance; end - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//lib/prism/node.rb#12773 - def comment_targets; end + # source://prism//lib/prism/lex_compat.rb#427 + def to_a; end - # def compact_child_nodes: () -> Array[Node] + # Returns the value of attribute tokens. # - # source://prism//lib/prism/node.rb#12768 - def compact_child_nodes; end + # source://prism//lib/prism/lex_compat.rb#377 + def tokens; end +end - # def content: () -> String - # - # source://prism//lib/prism/node.rb#12885 - sig { returns(String) } - def content; end +# source://prism//lib/prism/lex_compat.rb#375 +Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer) - # attr_reader content_loc: Location +# Heredocs that are no dash or tilde heredocs are just a list of tokens. +# We need to keep them around so that we can insert them in the correct +# 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 +class Prism::LexCompat::Heredoc::PlainHeredoc + # @return [PlainHeredoc] a new instance of PlainHeredoc # - # source://prism//lib/prism/node.rb#12809 - sig { returns(Prism::Location) } - def content_loc; end + # source://prism//lib/prism/lex_compat.rb#299 + def initialize; end - # def copy: (**params) -> MatchLastLineNode - # - # source://prism//lib/prism/node.rb#12778 - sig { params(params: T.untyped).returns(Prism::MatchLastLineNode) } - def copy(**params); end + # source://prism//lib/prism/lex_compat.rb#303 + def <<(token); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] - # - # source://prism//lib/prism/node.rb#12763 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/lex_compat.rb#307 + def to_a; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } - # - # source://prism//lib/prism/node.rb#12794 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/lex_compat.rb#297 + def tokens; end +end - # def euc_jp?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#12845 - sig { returns(T::Boolean) } - def euc_jp?; end +# Ident tokens for the most part are exactly the same, except sometimes we +# know an ident is a local when ripper doesn't (when they are introduced +# through named captures in regular expressions). In that case we don't +# compare the state. +# +# source://prism//lib/prism/lex_compat.rb#248 +class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#249 + def ==(other); end +end - # def extended?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#12830 - sig { returns(T::Boolean) } - def extended?; 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 +class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#239 + def ==(other); end +end - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#12870 - sig { returns(T::Boolean) } - def forced_binary_encoding?; 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 +class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#260 + def ==(other); end +end - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#12875 - sig { returns(T::Boolean) } - def forced_us_ascii_encoding?; end +# If we have an identifier that follows a method name like: +# +# def foo bar +# +# then Ripper will mark bar as END|LABEL if there is a local in a parent +# scope named bar because it hasn't pushed the local table yet. We do this +# more accurately, so we need to allow comparing against both END and +# END|LABEL. +# +# source://prism//lib/prism/lex_compat.rb#279 +class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#280 + def ==(other); end +end - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#12865 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end +# This is a mapping of prism token types to Ripper token types. This is a +# 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 +Prism::LexCompat::RIPPER = T.let(T.unsafe(nil), Hash) - # def ignore_case?: () -> bool +# A result class specialized for holding tokens produced by the lexer. +# +# source://prism//lib/prism/lex_compat.rb#14 +class Prism::LexCompat::Result < ::Prism::Result + # Create a new lex compat result object with the given values. # - # @return [Boolean] + # @return [Result] a new instance of Result # - # source://prism//lib/prism/node.rb#12825 - sig { returns(T::Boolean) } - def ignore_case?; end + # source://prism//lib/prism/lex_compat.rb#19 + def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end - # def inspect(NodeInspector inspector) -> String + # Implement the hash pattern matching interface for Result. # - # source://prism//lib/prism/node.rb#12895 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/lex_compat.rb#25 + def deconstruct_keys(keys); end - # def multi_line?: () -> bool - # - # @return [Boolean] + # The list of tokens that were produced by the lexer. # - # source://prism//lib/prism/node.rb#12835 - sig { returns(T::Boolean) } - def multi_line?; end + # source://prism//lib/prism/lex_compat.rb#16 + def value; end +end - # def once?: () -> bool - # - # @return [Boolean] +# When we produce tokens, we produce the same arrays that Ripper does. +# 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 +class Prism::LexCompat::Token < ::SimpleDelegator + # The type of the token. # - # source://prism//lib/prism/node.rb#12840 - sig { returns(T::Boolean) } - def once?; end + # source://prism//lib/prism/lex_compat.rb#213 + def event; end - # def opening: () -> String + # The location of the token in the source. # - # source://prism//lib/prism/node.rb#12880 - sig { returns(String) } - def opening; end + # source://prism//lib/prism/lex_compat.rb#208 + def location; end - # attr_reader opening_loc: Location + # The state of the lexer when this token was produced. # - # source://prism//lib/prism/node.rb#12803 - sig { returns(Prism::Location) } - def opening_loc; end + # source://prism//lib/prism/lex_compat.rb#223 + def state; end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # The slice of the source that this token represents. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/lex_compat.rb#218 + def value; end +end + +# This is a result specific to the `lex` and `lex_file` methods. +# +# source://prism//lib/prism/parse_result.rb#593 +class Prism::LexResult < ::Prism::Result + # Create a new lex result object with the given values. # - # def type: () -> Symbol + # @return [LexResult] a new instance of LexResult # - # source://prism//lib/prism/node.rb#12920 - def type; end + # source://prism//lib/prism/parse_result.rb#598 + sig do + params( + value: T::Array[T.untyped], + comments: T::Array[Prism::Comment], + magic_comments: T::Array[Prism::MagicComment], + data_loc: T.nilable(Prism::Location), + errors: T::Array[Prism::ParseError], + warnings: T::Array[Prism::ParseWarning], + source: Prism::Source + ).void + end + def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end - # attr_reader unescaped: String + # Implement the hash pattern matching interface for LexResult. # - # source://prism//lib/prism/node.rb#12821 - sig { returns(String) } - def unescaped; end + # source://prism//lib/prism/parse_result.rb#604 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # def utf_8?: () -> bool - # - # @return [Boolean] + # The list of tokens that were parsed from the source code. # - # source://prism//lib/prism/node.rb#12860 - sig { returns(T::Boolean) } - def utf_8?; end + # source://prism//lib/prism/parse_result.rb#595 + sig { returns(T::Array[T.untyped]) } + def value; end +end - # def windows_31j?: () -> bool - # - # @return [Boolean] +# This is a class that wraps the Ripper lexer to produce almost exactly the +# same tokens. +# +# source://prism//lib/prism/lex_compat.rb#872 +class Prism::LexRipper + # @return [LexRipper] a new instance of LexRipper # - # source://prism//lib/prism/node.rb#12855 - sig { returns(T::Boolean) } - def windows_31j?; end + # source://prism//lib/prism/lex_compat.rb#875 + def initialize(source); end - private + # source://prism//lib/prism/lex_compat.rb#879 + def result; end - # private attr_reader flags: Integer - # - # source://prism//lib/prism/node.rb#12799 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/lex_compat.rb#873 + def source; end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#12930 - def type; end - end + private + + # source://prism//lib/prism/lex_compat.rb#913 + def lex(source); end end -# Represents the use of the modifier `in` operator. +# Represents the use of the `&&=` operator for assignment to a local variable. # -# foo in bar -# ^^^^^^^^^^ +# target &&= value +# ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#12939 -class Prism::MatchPredicateNode < ::Prism::Node - # def initialize: (Node value, Node pattern, Location operator_loc, Location location) -> void +# source://prism//lib/prism/node.rb#11972 +class Prism::LocalVariableAndWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location operator_loc, Prism::node value, Symbol name, Integer depth, Location location) -> void # - # @return [MatchPredicateNode] a new instance of MatchPredicateNode + # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#12941 - def initialize(source, value, pattern, operator_loc, location); end + # source://prism//lib/prism/node.rb#11974 + sig do + params( + source: Prism::Source, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(source, name_loc, operator_loc, value, name, depth, location); 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#12081 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#12951 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#11986 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12956 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11991 + 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#12966 + # source://prism//lib/prism/node.rb#12001 + 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#12961 + # source://prism//lib/prism/node.rb#11996 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> MatchPredicateNode + # def copy: (?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableAndWriteNode # - # source://prism//lib/prism/node.rb#12971 - sig { params(params: T.untyped).returns(Prism::MatchPredicateNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12006 + sig do + params( + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).returns(Prism::LocalVariableAndWriteNode) + end + def copy(name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#12956 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#11991 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, pattern: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#12985 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12014 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#12039 + sig { returns(Integer) } + def depth; end + + # source://prism//lib/prism/desugar_compiler.rb#199 + def desugar; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#12047 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#12036 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#13008 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#12019 + sig { returns(Prism::Location) } + def name_loc; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#13003 + # source://prism//lib/prism/node.rb#12042 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#12996 + # source://prism//lib/prism/node.rb#12026 sig { returns(Prism::Location) } def operator_loc; end - # attr_reader pattern: Node - # - # source://prism//lib/prism/node.rb#12993 - sig { returns(Prism::Node) } - def pattern; end - # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -18772,12 +21368,13 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13032 + # source://prism//lib/prism/node.rb#12065 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#12990 + # source://prism//lib/prism/node.rb#12033 sig { returns(Prism::Node) } def value; end @@ -18789,92 +21386,149 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13042 + # source://prism//lib/prism/node.rb#12075 def type; end end end -# Represents the use of the `=>` operator. +# Represents assigning to a local variable using an operator that isn't `=`. # -# foo => bar -# ^^^^^^^^^^ +# target += value +# ^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13051 -class Prism::MatchRequiredNode < ::Prism::Node - # def initialize: (Node value, Node pattern, Location operator_loc, Location location) -> void +# source://prism//lib/prism/node.rb#12095 +class Prism::LocalVariableOperatorWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location binary_operator_loc, Prism::node value, Symbol name, Symbol binary_operator, Integer depth, Location location) -> void # - # @return [MatchRequiredNode] a new instance of MatchRequiredNode + # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#13053 - def initialize(source, value, pattern, operator_loc, location); end + # source://prism//lib/prism/node.rb#12097 + sig do + params( + source: Prism::Source, + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + binary_operator: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(source, name_loc, binary_operator_loc, value, name, binary_operator, depth, location); 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#12203 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13063 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#12110 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader binary_operator: Symbol + # + # source://prism//lib/prism/node.rb#12163 + sig { returns(Symbol) } + def binary_operator; end + + # attr_reader binary_operator_loc: Location + # + # source://prism//lib/prism/node.rb#12150 + sig { returns(Prism::Location) } + def binary_operator_loc; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13068 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12115 + 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#13078 + # source://prism//lib/prism/node.rb#12125 + 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#13073 + # source://prism//lib/prism/node.rb#12120 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> MatchRequiredNode + # def copy: (?name_loc: Location, ?binary_operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?binary_operator: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableOperatorWriteNode # - # source://prism//lib/prism/node.rb#13083 - sig { params(params: T.untyped).returns(Prism::MatchRequiredNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12130 + sig do + params( + name_loc: Prism::Location, + binary_operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + binary_operator: Symbol, + depth: Integer, + location: Prism::Location + ).returns(Prism::LocalVariableOperatorWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13068 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12115 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, pattern: Node, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, binary_operator_loc: Location, value: Prism::node, name: Symbol, binary_operator: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#13097 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12138 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#13120 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#12166 + sig { returns(Integer) } + def depth; end - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#13115 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/desugar_compiler.rb#211 + def desugar; end - # attr_reader operator_loc: Location + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#13108 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#12169 + sig { override.returns(String) } + def inspect; end - # attr_reader pattern: Node + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13105 - sig { returns(Prism::Node) } - def pattern; end + # source://prism//lib/prism/node.rb#12160 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#12143 + 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#419 + 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 + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -18891,12 +21545,13 @@ class Prism::MatchRequiredNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13144 + # source://prism//lib/prism/node.rb#12187 + sig { override.returns(Symbol) } def type; end - # attr_reader value: Node + # attr_reader value: Prism::node # - # source://prism//lib/prism/node.rb#13102 + # source://prism//lib/prism/node.rb#12157 sig { returns(Prism::Node) } def value; end @@ -18908,86 +21563,135 @@ class Prism::MatchRequiredNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13154 + # source://prism//lib/prism/node.rb#12197 def type; end end end -# Represents writing local variables using a regular expression match with named capture groups. +# Represents the use of the `||=` operator for assignment to a local variable. # -# /(?bar)/ =~ baz -# ^^^^^^^^^^^^^^^^^^^^ +# target ||= value +# ^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#13163 -class Prism::MatchWriteNode < ::Prism::Node - # def initialize: (CallNode call, Array[Node] targets, Location location) -> void +# source://prism//lib/prism/node.rb#12218 +class Prism::LocalVariableOrWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location operator_loc, Prism::node value, Symbol name, Integer depth, Location location) -> void # - # @return [MatchWriteNode] a new instance of MatchWriteNode + # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#13165 - def initialize(source, call, targets, location); end + # source://prism//lib/prism/node.rb#12220 + sig do + params( + source: Prism::Source, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(source, name_loc, operator_loc, value, name, depth, location); end - # def accept: (Visitor visitor) -> void + # 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#13174 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#12327 + def ===(other); end - # attr_reader call: CallNode + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13212 - sig { returns(Prism::CallNode) } - def call; end + # source://prism//lib/prism/node.rb#12232 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13179 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12237 + 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#13189 + # source://prism//lib/prism/node.rb#12247 + 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#13184 + # source://prism//lib/prism/node.rb#12242 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> MatchWriteNode + # def copy: (?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableOrWriteNode # - # source://prism//lib/prism/node.rb#13194 - sig { params(params: T.untyped).returns(Prism::MatchWriteNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12252 + sig do + params( + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).returns(Prism::LocalVariableOrWriteNode) + end + def copy(name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13179 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12237 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { call: CallNode, targets: Array[Node], location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Prism::node, name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#13207 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12260 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#12285 + sig { returns(Integer) } + def depth; end + + # source://prism//lib/prism/desugar_compiler.rb#205 + def desugar; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#13219 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#12293 + sig { override.returns(String) } + def inspect; end - # attr_reader targets: Array[Node] + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13215 - sig { returns(T::Array[Prism::Node]) } - def targets; end + # source://prism//lib/prism/node.rb#12282 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#12265 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#12288 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#12272 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -19004,9 +21708,16 @@ class Prism::MatchWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13241 + # source://prism//lib/prism/node.rb#12311 + sig { override.returns(Symbol) } def type; end + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#12279 + sig { returns(Prism::Node) } + def value; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -19015,71 +21726,113 @@ class Prism::MatchWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13251 + # source://prism//lib/prism/node.rb#12321 def type; end end end -# Represents a node that is missing from the source and results in a syntax error. +# Represents reading a local variable. Note that this requires that a local variable of the same name has already been written to in the same scope, otherwise it is parsed as a method call. # -# source://prism//lib/prism/node.rb#13257 -class Prism::MissingNode < ::Prism::Node - # def initialize: (Location location) -> void +# foo +# ^^^ +# +# source://prism//lib/prism/node.rb#12341 +class Prism::LocalVariableReadNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location location) -> void # - # @return [MissingNode] a new instance of MissingNode + # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode # - # source://prism//lib/prism/node.rb#13259 - def initialize(source, location); end + # source://prism//lib/prism/node.rb#12343 + sig { params(source: Prism::Source, name: Symbol, depth: Integer, location: Prism::Location).void } + def initialize(source, name, depth, location); 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#12443 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13266 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#12352 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13271 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12357 + 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#13281 + # source://prism//lib/prism/node.rb#12367 + 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#13276 + # source://prism//lib/prism/node.rb#12362 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> MissingNode + # def copy: (?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableReadNode # - # source://prism//lib/prism/node.rb#13286 - sig { params(params: T.untyped).returns(Prism::MissingNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12372 + sig { params(name: Symbol, depth: Integer, location: Prism::Location).returns(Prism::LocalVariableReadNode) } + def copy(name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13271 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12357 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#13297 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12380 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # The number of visible scopes that should be searched to find the origin of this local variable. + # + # foo = 1; foo # depth 0 + # + # bar = 2; tap { bar } # depth 1 + # + # 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#12406 + sig { returns(Integer) } + def depth; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#12409 + sig { override.returns(String) } + def inspect; end + + # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). + # + # x # name `:x` + # + # _Test # name `:_Test` + # + # Note that this can also be an underscore followed by a number for the default block parameters. + # + # _1 # name `:_1` + # + # Finally, for the default `it` block parameter, the name is `0it`. This is to distinguish it from an `it` local variable that is explicitly declared. + # + # it # name `:0it` # - # source://prism//lib/prism/node.rb#13303 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#12397 + sig { returns(Symbol) } + def name; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -19096,7 +21849,8 @@ class Prism::MissingNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13322 + # source://prism//lib/prism/node.rb#12427 + sig { override.returns(Symbol) } def type; end class << self @@ -19107,120 +21861,93 @@ class Prism::MissingNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13332 + # source://prism//lib/prism/node.rb#12437 def type; end end end -# Represents a module declaration involving the `module` keyword. +# Represents writing to a local variable in a context that doesn't have an explicit value. # -# module Foo end -# ^^^^^^^^^^^^^^ +# foo, bar = baz +# ^^^ ^^^ # -# source://prism//lib/prism/node.rb#13341 -class Prism::ModuleNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, Location module_keyword_loc, Node constant_path, Node? body, Location end_keyword_loc, Symbol name, Location location) -> void +# source://prism//lib/prism/node.rb#12454 +class Prism::LocalVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location location) -> void # - # @return [ModuleNode] a new instance of ModuleNode + # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#13343 - def initialize(source, locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location); end + # source://prism//lib/prism/node.rb#12456 + sig { params(source: Prism::Source, name: Symbol, depth: Integer, location: Prism::Location).void } + def initialize(source, name, depth, location); end - # def accept: (Visitor visitor) -> void + # 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#13356 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#12538 + def ===(other); end - # attr_reader body: Node? + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13413 - sig { returns(T.nilable(Prism::Node)) } - def body; end + # source://prism//lib/prism/node.rb#12465 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13361 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12470 + 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#13374 + # source://prism//lib/prism/node.rb#12480 + 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#13366 + # source://prism//lib/prism/node.rb#12475 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader constant_path: Node - # - # source://prism//lib/prism/node.rb#13410 - sig { returns(Prism::Node) } - def constant_path; end - - # def copy: (**params) -> ModuleNode + # def copy: (?name: Symbol, ?depth: Integer, ?location: Location) -> LocalVariableTargetNode # - # source://prism//lib/prism/node.rb#13379 - sig { params(params: T.untyped).returns(Prism::ModuleNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12485 + sig { params(name: Symbol, depth: Integer, location: Prism::Location).returns(Prism::LocalVariableTargetNode) } + def copy(name: T.unsafe(nil), depth: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13361 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12470 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], module_keyword_loc: Location, constant_path: Node, body: Node?, end_keyword_loc: Location, name: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//lib/prism/node.rb#13396 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12493 + 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#13431 - sig { returns(String) } - def end_keyword; end - - # attr_reader end_keyword_loc: Location - # - # source://prism//lib/prism/node.rb#13416 - sig { returns(Prism::Location) } - def end_keyword_loc; end - - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#13436 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader locals: Array[Symbol] + # attr_reader depth: Integer # - # source://prism//lib/prism/node.rb#13401 - sig { returns(T::Array[Symbol]) } - def locals; end + # source://prism//lib/prism/node.rb#12501 + sig { returns(Integer) } + def depth; end - # def module_keyword: () -> String - # - # source://prism//lib/prism/node.rb#13426 - sig { returns(String) } - def module_keyword; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader module_keyword_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#13404 - sig { returns(Prism::Location) } - def module_keyword_loc; end + # source://prism//lib/prism/node.rb#12504 + sig { override.returns(String) } + def inspect; end # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#13422 + # source://prism//lib/prism/node.rb#12498 sig { returns(Symbol) } def name; end @@ -19239,7 +21966,8 @@ class Prism::ModuleNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13467 + # source://prism//lib/prism/node.rb#12522 + sig { override.returns(Symbol) } def type; end class << self @@ -19250,116 +21978,148 @@ class Prism::ModuleNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13477 + # source://prism//lib/prism/node.rb#12532 def type; end end end -# Represents a multi-target expression. +# Represents writing to a local variable. # -# a, (b, c) = 1, 2, 3 -# ^^^^^^ +# foo = 1 +# ^^^^^^^ # -# source://prism//lib/prism/node.rb#13486 -class Prism::MultiTargetNode < ::Prism::Node - # def initialize: (Array[Node] lefts, Node? rest, Array[Node] rights, Location? lparen_loc, Location? rparen_loc, Location location) -> void +# source://prism//lib/prism/node.rb#12549 +class Prism::LocalVariableWriteNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location name_loc, Prism::node value, Location operator_loc, Location location) -> void # - # @return [MultiTargetNode] a new instance of MultiTargetNode + # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#13488 - def initialize(source, lefts, rest, rights, lparen_loc, rparen_loc, location); end + # source://prism//lib/prism/node.rb#12551 + sig do + params( + source: Prism::Source, + name: Symbol, + depth: Integer, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, name, depth, name_loc, value, operator_loc, location); 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#12684 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13500 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#12563 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13505 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12568 + 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#13519 + # source://prism//lib/prism/node.rb#12578 + 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#13510 + # source://prism//lib/prism/node.rb#12573 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> MultiTargetNode + # def copy: (?name: Symbol, ?depth: Integer, ?name_loc: Location, ?value: Prism::node, ?operator_loc: Location, ?location: Location) -> LocalVariableWriteNode # - # source://prism//lib/prism/node.rb#13524 - sig { params(params: T.untyped).returns(Prism::MultiTargetNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#12583 + sig do + params( + name: Symbol, + depth: Integer, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::LocalVariableWriteNode) + end + def copy(name: T.unsafe(nil), depth: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13505 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#12568 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[Node], rest: Node?, rights: Array[Node], lparen_loc: Location?, rparen_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, name_loc: Location, value: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#13540 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#12591 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # The number of semantic scopes we have to traverse to find the declaration of this variable. # - # source://prism//lib/prism/node.rb#13589 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader lefts: Array[Node] + # foo = 1 # depth 0 # - # source://prism//lib/prism/node.rb#13545 - sig { returns(T::Array[Prism::Node]) } - def lefts; end + # tap { foo = 1 } # depth 1 + # + # 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#12609 + sig { returns(Integer) } + def depth; end - # def lparen: () -> String? + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#13579 - sig { returns(T.nilable(String)) } - def lparen; end + # source://prism//lib/prism/node.rb#12650 + sig { override.returns(String) } + def inspect; end - # attr_reader lparen_loc: Location? + # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). # - # source://prism//lib/prism/node.rb#13554 - sig { returns(T.nilable(Prism::Location)) } - def lparen_loc; end + # foo = :bar # name `:foo` + # + # abc = 123 # name `:abc` + # + # source://prism//lib/prism/node.rb#12600 + sig { returns(Symbol) } + def name; end - # attr_reader rest: Node? + # The location of the variable name. # - # source://prism//lib/prism/node.rb#13548 - sig { returns(T.nilable(Prism::Node)) } - def rest; end + # foo = :bar + # ^^^ + # + # source://prism//lib/prism/node.rb#12615 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader rights: Array[Node] + # def operator: () -> String # - # source://prism//lib/prism/node.rb#13551 - sig { returns(T::Array[Prism::Node]) } - def rights; end + # source://prism//lib/prism/node.rb#12645 + sig { returns(String) } + def operator; end - # def rparen: () -> String? + # The location of the `=` operator. # - # source://prism//lib/prism/node.rb#13584 - sig { returns(T.nilable(String)) } - def rparen; end - - # attr_reader rparen_loc: Location? + # x = :y + # ^ # - # source://prism//lib/prism/node.rb#13566 - sig { returns(T.nilable(Prism::Location)) } - def rparen_loc; end + # source://prism//lib/prism/node.rb#12638 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -19376,9 +22136,26 @@ class Prism::MultiTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13618 + # source://prism//lib/prism/node.rb#12668 + sig { override.returns(Symbol) } def type; end + # The value to write to the local variable. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # + # foo = :bar + # ^^^^ + # + # abc = 1234 + # ^^^^ + # + # Note that since the name of a local variable is known before the value is parsed, it is valid for a local variable to appear within the value of its own write. + # + # foo = foo + # + # source://prism//lib/prism/node.rb#12632 + sig { returns(Prism::Node) } + def value; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -19387,994 +22164,954 @@ class Prism::MultiTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13628 + # source://prism//lib/prism/node.rb#12678 def type; end end end -# Represents a write to a multi-target expression. -# -# a, b, c = 1, 2, 3 -# ^^^^^^^^^^^^^^^^^ +# This represents a location in the source. # -# source://prism//lib/prism/node.rb#13637 -class Prism::MultiWriteNode < ::Prism::Node - # def initialize: (Array[Node] lefts, Node? rest, Array[Node] rights, Location? lparen_loc, Location? rparen_loc, Location operator_loc, Node value, Location location) -> void - # - # @return [MultiWriteNode] a new instance of MultiWriteNode +# source://prism//lib/prism/parse_result.rb#156 +class Prism::Location + # Create a new location object with the given source, start byte offset, and + # byte length. # - # source://prism//lib/prism/node.rb#13639 - def initialize(source, lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location); end - - # def accept: (Visitor visitor) -> void + # @return [Location] a new instance of Location # - # source://prism//lib/prism/node.rb#13653 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/parse_result.rb#171 + sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void } + def initialize(source, start_offset, length); end - # def child_nodes: () -> Array[nil | Node] + # Returns true if the given other location is equal to this location. # - # source://prism//lib/prism/node.rb#13658 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/parse_result.rb#335 + sig { params(other: T.untyped).returns(T::Boolean) } + def ==(other); end - # def comment_targets: () -> Array[Node | Location] + # Join this location with the first occurrence of the string in the source + # 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/node.rb#13673 - def comment_targets; end + # source://prism//lib/prism/parse_result.rb#354 + sig { params(string: String).returns(Prism::Location) } + def adjoin(string); end - # def compact_child_nodes: () -> Array[Node] + # Returns a new location that is the result of chopping off the last byte. # - # source://prism//lib/prism/node.rb#13663 - def compact_child_nodes; end + # source://prism//lib/prism/parse_result.rb#217 + sig { returns(Prism::Location) } + def chop; end - # def copy: (**params) -> MultiWriteNode + # Returns all comments that are associated with this location (both leading + # and trailing comments). # - # source://prism//lib/prism/node.rb#13678 - sig { params(params: T.untyped).returns(Prism::MultiWriteNode) } - def copy(**params); end + # source://prism//lib/prism/parse_result.rb#207 + sig { returns(T::Array[Prism::Comment]) } + def comments; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Create a new location object with the given options. # - # source://prism//lib/prism/node.rb#13658 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/parse_result.rb#212 + 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 - # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[Node], rest: Node?, rights: Array[Node], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Node, location: Location } + # Implement the hash pattern matching interface for Location. # - # source://prism//lib/prism/node.rb#13696 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/parse_result.rb#325 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # The column number in characters where this location ends from the start of + # the line. # - # source://prism//lib/prism/node.rb#13759 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/parse_result.rb#314 + sig { returns(Integer) } + def end_character_column; end - # attr_reader lefts: Array[Node] + # The character offset from the beginning of the source where this location + # ends. # - # source://prism//lib/prism/node.rb#13701 - sig { returns(T::Array[Prism::Node]) } - def lefts; end + # source://prism//lib/prism/parse_result.rb#263 + sig { returns(Integer) } + def end_character_offset; end - # def lparen: () -> String? + # The column number in code units of the given encoding where this location + # ends from the start of the line. # - # source://prism//lib/prism/node.rb#13744 - sig { returns(T.nilable(String)) } - def lparen; end + # source://prism//lib/prism/parse_result.rb#320 + sig { params(encoding: Encoding).returns(Integer) } + def end_code_units_column(encoding = T.unsafe(nil)); end - # attr_reader lparen_loc: Location? + # The offset from the start of the file in code units of the given encoding. # - # source://prism//lib/prism/node.rb#13710 - sig { returns(T.nilable(Prism::Location)) } - def lparen_loc; end + # source://prism//lib/prism/parse_result.rb#268 + sig { params(encoding: Encoding).returns(Integer) } + def end_code_units_offset(encoding = T.unsafe(nil)); end - # def operator: () -> String + # The column number in bytes where this location ends from the start of the + # line. # - # source://prism//lib/prism/node.rb#13754 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/parse_result.rb#308 + sig { returns(Integer) } + def end_column; end - # attr_reader operator_loc: Location + # The line number where this location ends. # - # source://prism//lib/prism/node.rb#13734 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/parse_result.rb#284 + sig { returns(Integer) } + def end_line; end - # attr_reader rest: Node? + # The byte offset from the beginning of the source where this location ends. # - # source://prism//lib/prism/node.rb#13704 - sig { returns(T.nilable(Prism::Node)) } - def rest; end + # source://prism//lib/prism/parse_result.rb#257 + sig { returns(Integer) } + def end_offset; end - # attr_reader rights: Array[Node] + # Returns a string representation of this location. # - # source://prism//lib/prism/node.rb#13707 - sig { returns(T::Array[Prism::Node]) } - def rights; end + # source://prism//lib/prism/parse_result.rb#222 + sig { returns(String) } + def inspect; end - # def rparen: () -> String? + # Returns a new location that stretches from this location to the given + # 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/node.rb#13749 - sig { returns(T.nilable(String)) } - def rparen; end + # source://prism//lib/prism/parse_result.rb#344 + sig { params(other: Prism::Location).returns(Prism::Location) } + def join(other); end - # attr_reader rparen_loc: Location? + # Attach a comment to the leading comments of this location. # - # source://prism//lib/prism/node.rb#13722 - sig { returns(T.nilable(Prism::Location)) } - def rparen_loc; end + # source://prism//lib/prism/parse_result.rb#190 + sig { params(comment: Prism::Comment).void } + def leading_comment(comment); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # These are the comments that are associated with this location that exist + # before the start of this location. # - # def type: () -> Symbol - # - # source://prism//lib/prism/node.rb#13791 - def type; end + # source://prism//lib/prism/parse_result.rb#185 + sig { returns(T::Array[Prism::Comment]) } + def leading_comments; end - # attr_reader value: Node + # The length of this location in bytes. # - # source://prism//lib/prism/node.rb#13740 - sig { returns(Prism::Node) } - def value; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#13801 - def type; end - end -end + # source://prism//lib/prism/parse_result.rb#167 + sig { returns(Integer) } + def length; end -# This visitor walks through the tree and copies each node as it is being -# 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#12 -class Prism::MutationCompiler < ::Prism::Compiler - # Copy a AliasGlobalVariableNode node + # Implement the pretty print interface for Location. # - # source://prism//lib/prism/mutation_compiler.rb#14 - def visit_alias_global_variable_node(node); end + # source://prism//lib/prism/parse_result.rb#330 + sig { params(q: T.untyped).void } + def pretty_print(q); end - # Copy a AliasMethodNode node + # The source code that this location represents. # - # source://prism//lib/prism/mutation_compiler.rb#19 - def visit_alias_method_node(node); end + # source://prism//lib/prism/parse_result.rb#232 + sig { returns(String) } + def slice; end - # Copy a AlternationPatternNode node + # The source code that this location represents starting from the beginning + # of the line that this location starts on to the end of the line that this + # location ends on. # - # source://prism//lib/prism/mutation_compiler.rb#24 - def visit_alternation_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#239 + def slice_lines; end - # Copy a AndNode node + # Returns all of the lines of the source code associated with this location. # - # source://prism//lib/prism/mutation_compiler.rb#29 - def visit_and_node(node); end + # source://prism//lib/prism/parse_result.rb#227 + sig { returns(T::Array[String]) } + def source_lines; end - # Copy a ArgumentsNode node + # The column number in characters where this location ends from the start of + # the line. # - # source://prism//lib/prism/mutation_compiler.rb#34 - def visit_arguments_node(node); end + # source://prism//lib/prism/parse_result.rb#296 + sig { returns(Integer) } + def start_character_column; end - # Copy a ArrayNode node + # The character offset from the beginning of the source where this location + # starts. # - # source://prism//lib/prism/mutation_compiler.rb#39 - def visit_array_node(node); end + # source://prism//lib/prism/parse_result.rb#247 + sig { returns(Integer) } + def start_character_offset; end - # Copy a ArrayPatternNode node + # The column number in code units of the given encoding where this location + # starts from the start of the line. # - # source://prism//lib/prism/mutation_compiler.rb#44 - def visit_array_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#302 + sig { params(encoding: Encoding).returns(Integer) } + def start_code_units_column(encoding = T.unsafe(nil)); end - # Copy a AssocNode node + # The offset from the start of the file in code units of the given encoding. # - # source://prism//lib/prism/mutation_compiler.rb#49 - def visit_assoc_node(node); end + # source://prism//lib/prism/parse_result.rb#252 + sig { params(encoding: Encoding).returns(Integer) } + def start_code_units_offset(encoding = T.unsafe(nil)); end - # Copy a AssocSplatNode node + # The column number in bytes where this location starts from the start of + # the line. # - # source://prism//lib/prism/mutation_compiler.rb#54 - def visit_assoc_splat_node(node); end + # source://prism//lib/prism/parse_result.rb#290 + sig { returns(Integer) } + def start_column; end - # Copy a BackReferenceReadNode node + # The line number where this location starts. # - # source://prism//lib/prism/mutation_compiler.rb#59 - def visit_back_reference_read_node(node); end + # source://prism//lib/prism/parse_result.rb#273 + sig { returns(Integer) } + def start_line; end - # Copy a BeginNode node + # The content of the line where this location starts before this location. # - # source://prism//lib/prism/mutation_compiler.rb#64 - def visit_begin_node(node); end + # source://prism//lib/prism/parse_result.rb#278 + sig { returns(String) } + def start_line_slice; end - # Copy a BlockArgumentNode node + # The byte offset from the beginning of the source where this location + # starts. # - # source://prism//lib/prism/mutation_compiler.rb#69 - def visit_block_argument_node(node); end + # source://prism//lib/prism/parse_result.rb#164 + sig { returns(Integer) } + def start_offset; end - # Copy a BlockLocalVariableNode node + # Attach a comment to the trailing comments of this location. # - # source://prism//lib/prism/mutation_compiler.rb#74 - def visit_block_local_variable_node(node); end + # source://prism//lib/prism/parse_result.rb#201 + sig { params(comment: Prism::Comment).void } + def trailing_comment(comment); end - # Copy a BlockNode node + # These are the comments that are associated with this location that exist + # after the end of this location. # - # source://prism//lib/prism/mutation_compiler.rb#79 - def visit_block_node(node); end + # source://prism//lib/prism/parse_result.rb#196 + sig { returns(T::Array[Prism::Comment]) } + def trailing_comments; end - # Copy a BlockParameterNode node - # - # source://prism//lib/prism/mutation_compiler.rb#84 - def visit_block_parameter_node(node); end + protected - # Copy a BlockParametersNode node + # A Source object that is used to determine more information from the given + # offset and length. # - # source://prism//lib/prism/mutation_compiler.rb#89 - def visit_block_parameters_node(node); end + # source://prism//lib/prism/parse_result.rb#159 + sig { returns(Prism::Source) } + def source; end +end - # Copy a BreakNode node - # - # source://prism//lib/prism/mutation_compiler.rb#94 - def visit_break_node(node); end +# Flags for while and until loop nodes. +# +# source://prism//lib/prism/node.rb#19271 +module Prism::LoopFlags; end - # Copy a CallAndWriteNode node - # - # source://prism//lib/prism/mutation_compiler.rb#99 - def visit_call_and_write_node(node); end +# a loop after a begin statement, so the body is executed first before the condition +# +# source://prism//lib/prism/node.rb#19273 +Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) - # Copy a CallNode node +# This represents a magic comment that was encountered during parsing. +# +# source://prism//lib/prism/parse_result.rb#416 +class Prism::MagicComment + # Create a new magic comment object with the given key and value locations. # - # source://prism//lib/prism/mutation_compiler.rb#104 - def visit_call_node(node); end - - # Copy a CallOperatorWriteNode node + # @return [MagicComment] a new instance of MagicComment # - # source://prism//lib/prism/mutation_compiler.rb#109 - def visit_call_operator_write_node(node); end + # source://prism//lib/prism/parse_result.rb#424 + sig { params(key_loc: Prism::Location, value_loc: Prism::Location).void } + def initialize(key_loc, value_loc); end - # Copy a CallOrWriteNode node + # Implement the hash pattern matching interface for MagicComment. # - # source://prism//lib/prism/mutation_compiler.rb#114 - def visit_call_or_write_node(node); end + # source://prism//lib/prism/parse_result.rb#440 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # Copy a CallTargetNode node + # Returns a string representation of this magic comment. # - # source://prism//lib/prism/mutation_compiler.rb#119 - def visit_call_target_node(node); end + # source://prism//lib/prism/parse_result.rb#445 + sig { returns(String) } + def inspect; end - # Copy a CapturePatternNode node + # Returns the key of the magic comment by slicing it from the source code. # - # source://prism//lib/prism/mutation_compiler.rb#124 - def visit_capture_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#430 + sig { returns(String) } + def key; end - # Copy a CaseMatchNode node + # A Location object representing the location of the key in the source. # - # source://prism//lib/prism/mutation_compiler.rb#129 - def visit_case_match_node(node); end + # source://prism//lib/prism/parse_result.rb#418 + sig { returns(Prism::Location) } + def key_loc; end - # Copy a CaseNode node + # Returns the value of the magic comment by slicing it from the source code. # - # source://prism//lib/prism/mutation_compiler.rb#134 - def visit_case_node(node); end + # source://prism//lib/prism/parse_result.rb#435 + sig { returns(String) } + def value; end - # Copy a ClassNode node + # A Location object representing the location of the value in the source. # - # source://prism//lib/prism/mutation_compiler.rb#139 - def visit_class_node(node); end + # source://prism//lib/prism/parse_result.rb#421 + sig { returns(Prism::Location) } + def value_loc; end +end - # Copy a ClassVariableAndWriteNode node - # - # source://prism//lib/prism/mutation_compiler.rb#144 - def visit_class_variable_and_write_node(node); end +# Represents a regular expression literal used in the predicate of a conditional to implicitly match against the last line read by an IO object. +# +# if /foo/i then end +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#12698 +class Prism::MatchLastLineNode < ::Prism::Node + include ::Prism::RegularExpressionOptions - # Copy a ClassVariableOperatorWriteNode node + # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void # - # source://prism//lib/prism/mutation_compiler.rb#149 - def visit_class_variable_operator_write_node(node); end - - # Copy a ClassVariableOrWriteNode node + # @return [MatchLastLineNode] a new instance of MatchLastLineNode # - # source://prism//lib/prism/mutation_compiler.rb#154 - def visit_class_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#12700 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); end - # Copy a ClassVariableReadNode 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/mutation_compiler.rb#159 - def visit_class_variable_read_node(node); end + # source://prism//lib/prism/node.rb#12877 + def ===(other); end - # Copy a ClassVariableTargetNode node + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/mutation_compiler.rb#164 - def visit_class_variable_target_node(node); end + # source://prism//lib/prism/node.rb#12712 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Copy a ClassVariableWriteNode node + # def ascii_8bit?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#169 - def visit_class_variable_write_node(node); end - - # Copy a ConstantAndWriteNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#174 - def visit_constant_and_write_node(node); end + # source://prism//lib/prism/node.rb#12798 + sig { returns(T::Boolean) } + def ascii_8bit?; end - # Copy a ConstantOperatorWriteNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#179 - def visit_constant_operator_write_node(node); end + # source://prism//lib/prism/node.rb#12717 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a ConstantOrWriteNode node + # def closing: () -> String # - # source://prism//lib/prism/mutation_compiler.rb#184 - def visit_constant_or_write_node(node); end + # source://prism//lib/prism/node.rb#12838 + sig { returns(String) } + def closing; end - # Copy a ConstantPathAndWriteNode node + # attr_reader closing_loc: Location # - # source://prism//lib/prism/mutation_compiler.rb#189 - def visit_constant_path_and_write_node(node); end + # source://prism//lib/prism/node.rb#12763 + sig { returns(Prism::Location) } + def closing_loc; end - # Copy a ConstantPathNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/mutation_compiler.rb#194 - def visit_constant_path_node(node); end + # source://prism//lib/prism/node.rb#12727 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Copy a ConstantPathOperatorWriteNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/mutation_compiler.rb#199 - def visit_constant_path_operator_write_node(node); end + # source://prism//lib/prism/node.rb#12722 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Copy a ConstantPathOrWriteNode node + # def content: () -> String # - # source://prism//lib/prism/mutation_compiler.rb#204 - def visit_constant_path_or_write_node(node); end + # source://prism//lib/prism/node.rb#12833 + sig { returns(String) } + def content; end - # Copy a ConstantPathTargetNode node + # attr_reader content_loc: Location # - # source://prism//lib/prism/mutation_compiler.rb#209 - def visit_constant_path_target_node(node); end + # source://prism//lib/prism/node.rb#12756 + sig { returns(Prism::Location) } + def content_loc; end - # Copy a ConstantPathWriteNode node + # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> MatchLastLineNode # - # source://prism//lib/prism/mutation_compiler.rb#214 - def visit_constant_path_write_node(node); end + # source://prism//lib/prism/node.rb#12732 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).returns(Prism::MatchLastLineNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil), location: T.unsafe(nil)); end - # Copy a ConstantReadNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#219 - def visit_constant_read_node(node); end + # source://prism//lib/prism/node.rb#12717 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a ConstantTargetNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/mutation_compiler.rb#224 - def visit_constant_target_node(node); end + # source://prism//lib/prism/node.rb#12740 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # Copy a ConstantWriteNode node + # def euc_jp?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#229 - def visit_constant_write_node(node); end - - # Copy a DefNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#234 - def visit_def_node(node); end + # source://prism//lib/prism/node.rb#12793 + sig { returns(T::Boolean) } + def euc_jp?; end - # Copy a DefinedNode node + # def extended?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#239 - def visit_defined_node(node); end - - # Copy a ElseNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#244 - def visit_else_node(node); end + # source://prism//lib/prism/node.rb#12778 + sig { returns(T::Boolean) } + def extended?; end - # Copy a EmbeddedStatementsNode node - # - # source://prism//lib/prism/mutation_compiler.rb#249 - def visit_embedded_statements_node(node); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # Copy a EmbeddedVariableNode node + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#254 - def visit_embedded_variable_node(node); end - - # Copy a EnsureNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#259 - def visit_ensure_node(node); end + # source://prism//lib/prism/node.rb#12818 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # Copy a FalseNode node + # def forced_us_ascii_encoding?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#264 - def visit_false_node(node); end - - # Copy a FindPatternNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#269 - def visit_find_pattern_node(node); end + # source://prism//lib/prism/node.rb#12823 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # Copy a FlipFlopNode node + # def forced_utf8_encoding?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#274 - def visit_flip_flop_node(node); end - - # Copy a FloatNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#279 - def visit_float_node(node); end + # source://prism//lib/prism/node.rb#12813 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # Copy a ForNode node + # def ignore_case?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#284 - def visit_for_node(node); end - - # Copy a ForwardingArgumentsNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#289 - def visit_forwarding_arguments_node(node); end + # source://prism//lib/prism/node.rb#12773 + sig { returns(T::Boolean) } + def ignore_case?; end - # Copy a ForwardingParameterNode node + # def inspect -> String # - # source://prism//lib/prism/mutation_compiler.rb#294 - def visit_forwarding_parameter_node(node); end + # source://prism//lib/prism/node.rb#12843 + sig { override.returns(String) } + def inspect; end - # Copy a ForwardingSuperNode node + # def multi_line?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#299 - def visit_forwarding_super_node(node); end - - # Copy a GlobalVariableAndWriteNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#304 - def visit_global_variable_and_write_node(node); end + # source://prism//lib/prism/node.rb#12783 + sig { returns(T::Boolean) } + def multi_line?; end - # Copy a GlobalVariableOperatorWriteNode node + # def once?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#309 - def visit_global_variable_operator_write_node(node); end - - # Copy a GlobalVariableOrWriteNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#314 - def visit_global_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#12788 + sig { returns(T::Boolean) } + def once?; end - # Copy a GlobalVariableReadNode node + # def opening: () -> String # - # source://prism//lib/prism/mutation_compiler.rb#319 - def visit_global_variable_read_node(node); end + # source://prism//lib/prism/node.rb#12828 + sig { returns(String) } + def opening; end - # Copy a GlobalVariableTargetNode node + # attr_reader opening_loc: Location # - # source://prism//lib/prism/mutation_compiler.rb#324 - def visit_global_variable_target_node(node); end + # source://prism//lib/prism/node.rb#12749 + sig { returns(Prism::Location) } + def opening_loc; end - # Copy a GlobalVariableWriteNode node - # - # source://prism//lib/prism/mutation_compiler.rb#329 - def visit_global_variable_write_node(node); end + sig { returns(Integer) } + def options; end - # Copy a HashNode node + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/mutation_compiler.rb#334 - def visit_hash_node(node); end - - # Copy a HashPatternNode node + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/mutation_compiler.rb#339 - def visit_hash_pattern_node(node); end - - # Copy a IfNode node + # def type: () -> Symbol # - # source://prism//lib/prism/mutation_compiler.rb#344 - def visit_if_node(node); end + # source://prism//lib/prism/node.rb#12861 + sig { override.returns(Symbol) } + def type; end - # Copy a ImaginaryNode node + # attr_reader unescaped: String # - # source://prism//lib/prism/mutation_compiler.rb#349 - def visit_imaginary_node(node); end + # source://prism//lib/prism/node.rb#12770 + sig { returns(String) } + def unescaped; end - # Copy a ImplicitNode node + # def utf_8?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#354 - def visit_implicit_node(node); end - - # Copy a ImplicitRestNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#359 - def visit_implicit_rest_node(node); end + # source://prism//lib/prism/node.rb#12808 + sig { returns(T::Boolean) } + def utf_8?; end - # Copy a InNode node + # def windows_31j?: () -> bool # - # source://prism//lib/prism/mutation_compiler.rb#364 - def visit_in_node(node); end - - # Copy a IndexAndWriteNode node + # @return [Boolean] # - # source://prism//lib/prism/mutation_compiler.rb#369 - def visit_index_and_write_node(node); end + # source://prism//lib/prism/node.rb#12803 + sig { returns(T::Boolean) } + def windows_31j?; end - # Copy a IndexOperatorWriteNode node - # - # source://prism//lib/prism/mutation_compiler.rb#374 - def visit_index_operator_write_node(node); end + protected - # Copy a IndexOrWriteNode node + # protected attr_reader flags: Integer # - # source://prism//lib/prism/mutation_compiler.rb#379 - def visit_index_or_write_node(node); end + # source://prism//lib/prism/node.rb#12745 + sig { returns(Integer) } + def flags; end - # Copy a IndexTargetNode node - # - # source://prism//lib/prism/mutation_compiler.rb#384 - def visit_index_target_node(node); end + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#12871 + def type; end + end +end - # Copy a InstanceVariableAndWriteNode node +# Represents the use of the modifier `in` operator. +# +# foo in bar +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#12891 +class Prism::MatchPredicateNode < ::Prism::Node + # def initialize: (Prism::node value, Prism::node pattern, Location operator_loc, Location location) -> void # - # source://prism//lib/prism/mutation_compiler.rb#389 - def visit_instance_variable_and_write_node(node); end - - # Copy a InstanceVariableOperatorWriteNode node + # @return [MatchPredicateNode] a new instance of MatchPredicateNode # - # source://prism//lib/prism/mutation_compiler.rb#394 - def visit_instance_variable_operator_write_node(node); end + # source://prism//lib/prism/node.rb#12893 + sig do + params( + source: Prism::Source, + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, value, pattern, operator_loc, location); end - # Copy a InstanceVariableOrWriteNode 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/mutation_compiler.rb#399 - def visit_instance_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#12988 + def ===(other); end - # Copy a InstanceVariableReadNode node + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/mutation_compiler.rb#404 - def visit_instance_variable_read_node(node); end + # source://prism//lib/prism/node.rb#12903 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Copy a InstanceVariableTargetNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#409 - def visit_instance_variable_target_node(node); end + # source://prism//lib/prism/node.rb#12908 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a InstanceVariableWriteNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/mutation_compiler.rb#414 - def visit_instance_variable_write_node(node); end + # source://prism//lib/prism/node.rb#12918 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Copy a IntegerNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/mutation_compiler.rb#419 - def visit_integer_node(node); end + # source://prism//lib/prism/node.rb#12913 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Copy a InterpolatedMatchLastLineNode node + # def copy: (?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location, ?location: Location) -> MatchPredicateNode # - # source://prism//lib/prism/mutation_compiler.rb#424 - def visit_interpolated_match_last_line_node(node); end + # source://prism//lib/prism/node.rb#12923 + sig do + params( + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::MatchPredicateNode) + end + def copy(value: T.unsafe(nil), pattern: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end - # Copy a InterpolatedRegularExpressionNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#429 - def visit_interpolated_regular_expression_node(node); end + # source://prism//lib/prism/node.rb#12908 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a InterpolatedStringNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, pattern: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/mutation_compiler.rb#434 - def visit_interpolated_string_node(node); end + # source://prism//lib/prism/node.rb#12931 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # Copy a InterpolatedSymbolNode node - # - # source://prism//lib/prism/mutation_compiler.rb#439 - def visit_interpolated_symbol_node(node); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # Copy a InterpolatedXStringNode node + # def inspect -> String # - # source://prism//lib/prism/mutation_compiler.rb#444 - def visit_interpolated_x_string_node(node); end + # source://prism//lib/prism/node.rb#12954 + sig { override.returns(String) } + def inspect; end - # Copy a KeywordHashNode node + # def operator: () -> String # - # source://prism//lib/prism/mutation_compiler.rb#449 - def visit_keyword_hash_node(node); end + # source://prism//lib/prism/node.rb#12949 + sig { returns(String) } + def operator; end - # Copy a KeywordRestParameterNode node + # attr_reader operator_loc: Location # - # source://prism//lib/prism/mutation_compiler.rb#454 - def visit_keyword_rest_parameter_node(node); end + # source://prism//lib/prism/node.rb#12942 + sig { returns(Prism::Location) } + def operator_loc; end - # Copy a LambdaNode node + # attr_reader pattern: Prism::node # - # source://prism//lib/prism/mutation_compiler.rb#459 - def visit_lambda_node(node); end + # source://prism//lib/prism/node.rb#12939 + sig { returns(Prism::Node) } + def pattern; end - # Copy a LocalVariableAndWriteNode node + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/mutation_compiler.rb#464 - def visit_local_variable_and_write_node(node); end - - # Copy a LocalVariableOperatorWriteNode node + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/mutation_compiler.rb#469 - def visit_local_variable_operator_write_node(node); end - - # Copy a LocalVariableOrWriteNode node + # def type: () -> Symbol # - # source://prism//lib/prism/mutation_compiler.rb#474 - def visit_local_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#12972 + sig { override.returns(Symbol) } + def type; end - # Copy a LocalVariableReadNode node + # attr_reader value: Prism::node # - # source://prism//lib/prism/mutation_compiler.rb#479 - def visit_local_variable_read_node(node); end + # source://prism//lib/prism/node.rb#12936 + sig { returns(Prism::Node) } + def value; end - # Copy a LocalVariableTargetNode node - # - # source://prism//lib/prism/mutation_compiler.rb#484 - def visit_local_variable_target_node(node); end + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#12982 + def type; end + end +end - # Copy a LocalVariableWriteNode node +# Represents the use of the `=>` operator. +# +# foo => bar +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#13000 +class Prism::MatchRequiredNode < ::Prism::Node + # def initialize: (Prism::node value, Prism::node pattern, Location operator_loc, Location location) -> void # - # source://prism//lib/prism/mutation_compiler.rb#489 - def visit_local_variable_write_node(node); end - - # Copy a MatchLastLineNode node + # @return [MatchRequiredNode] a new instance of MatchRequiredNode # - # source://prism//lib/prism/mutation_compiler.rb#494 - def visit_match_last_line_node(node); end + # source://prism//lib/prism/node.rb#13002 + sig do + params( + source: Prism::Source, + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, value, pattern, operator_loc, location); end - # Copy a MatchPredicateNode 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/mutation_compiler.rb#499 - def visit_match_predicate_node(node); end + # source://prism//lib/prism/node.rb#13097 + def ===(other); end - # Copy a MatchRequiredNode node + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/mutation_compiler.rb#504 - def visit_match_required_node(node); end + # source://prism//lib/prism/node.rb#13012 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Copy a MatchWriteNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#509 - def visit_match_write_node(node); end + # source://prism//lib/prism/node.rb#13017 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a MissingNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/mutation_compiler.rb#514 - def visit_missing_node(node); end + # source://prism//lib/prism/node.rb#13027 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Copy a ModuleNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/mutation_compiler.rb#519 - def visit_module_node(node); end + # source://prism//lib/prism/node.rb#13022 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Copy a MultiTargetNode node + # def copy: (?value: Prism::node, ?pattern: Prism::node, ?operator_loc: Location, ?location: Location) -> MatchRequiredNode # - # source://prism//lib/prism/mutation_compiler.rb#524 - def visit_multi_target_node(node); end + # source://prism//lib/prism/node.rb#13032 + sig do + params( + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::MatchRequiredNode) + end + def copy(value: T.unsafe(nil), pattern: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end - # Copy a MultiWriteNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/mutation_compiler.rb#529 - def visit_multi_write_node(node); end + # source://prism//lib/prism/node.rb#13017 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a NextNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Prism::node, pattern: Prism::node, operator_loc: Location, location: Location } # - # source://prism//lib/prism/mutation_compiler.rb#534 - def visit_next_node(node); end + # source://prism//lib/prism/node.rb#13040 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # Copy a NilNode node - # - # source://prism//lib/prism/mutation_compiler.rb#539 - def visit_nil_node(node); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # Copy a NoKeywordsParameterNode node + # def inspect -> String # - # source://prism//lib/prism/mutation_compiler.rb#544 - def visit_no_keywords_parameter_node(node); end + # source://prism//lib/prism/node.rb#13063 + sig { override.returns(String) } + def inspect; end - # Copy a NumberedParametersNode node + # def operator: () -> String # - # source://prism//lib/prism/mutation_compiler.rb#549 - def visit_numbered_parameters_node(node); end + # source://prism//lib/prism/node.rb#13058 + sig { returns(String) } + def operator; end - # Copy a NumberedReferenceReadNode node + # attr_reader operator_loc: Location # - # source://prism//lib/prism/mutation_compiler.rb#554 - def visit_numbered_reference_read_node(node); end + # source://prism//lib/prism/node.rb#13051 + sig { returns(Prism::Location) } + def operator_loc; end - # Copy a OptionalKeywordParameterNode node + # attr_reader pattern: Prism::node # - # source://prism//lib/prism/mutation_compiler.rb#559 - def visit_optional_keyword_parameter_node(node); end + # source://prism//lib/prism/node.rb#13048 + sig { returns(Prism::Node) } + def pattern; end - # Copy a OptionalParameterNode node + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/mutation_compiler.rb#564 - def visit_optional_parameter_node(node); end - - # Copy a OrNode node + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/mutation_compiler.rb#569 - def visit_or_node(node); end - - # Copy a ParametersNode node + # def type: () -> Symbol # - # source://prism//lib/prism/mutation_compiler.rb#574 - def visit_parameters_node(node); end + # source://prism//lib/prism/node.rb#13081 + sig { override.returns(Symbol) } + def type; end - # Copy a ParenthesesNode node + # attr_reader value: Prism::node # - # source://prism//lib/prism/mutation_compiler.rb#579 - def visit_parentheses_node(node); end + # source://prism//lib/prism/node.rb#13045 + sig { returns(Prism::Node) } + def value; end - # Copy a PinnedExpressionNode node - # - # source://prism//lib/prism/mutation_compiler.rb#584 - def visit_pinned_expression_node(node); end + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#13091 + def type; end + end +end - # Copy a PinnedVariableNode node +# Represents writing local variables using a regular expression match with named capture groups. +# +# /(?bar)/ =~ baz +# ^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#13109 +class Prism::MatchWriteNode < ::Prism::Node + # def initialize: (CallNode call, Array[LocalVariableTargetNode] targets, Location location) -> void # - # source://prism//lib/prism/mutation_compiler.rb#589 - def visit_pinned_variable_node(node); end - - # Copy a PostExecutionNode node + # @return [MatchWriteNode] a new instance of MatchWriteNode # - # source://prism//lib/prism/mutation_compiler.rb#594 - def visit_post_execution_node(node); end + # source://prism//lib/prism/node.rb#13111 + sig do + params( + source: Prism::Source, + call: Prism::CallNode, + targets: T::Array[Prism::LocalVariableTargetNode], + location: Prism::Location + ).void + end + def initialize(source, call, targets, location); end - # Copy a PreExecutionNode 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/mutation_compiler.rb#599 - def visit_pre_execution_node(node); end + # source://prism//lib/prism/node.rb#13193 + def ===(other); end - # Copy a ProgramNode node + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/mutation_compiler.rb#604 - def visit_program_node(node); end - - # Copy a RangeNode node - # - # source://prism//lib/prism/mutation_compiler.rb#609 - def visit_range_node(node); end - - # Copy a RationalNode node - # - # source://prism//lib/prism/mutation_compiler.rb#614 - def visit_rational_node(node); end - - # Copy a RedoNode node - # - # source://prism//lib/prism/mutation_compiler.rb#619 - def visit_redo_node(node); end - - # Copy a RegularExpressionNode node - # - # source://prism//lib/prism/mutation_compiler.rb#624 - def visit_regular_expression_node(node); end - - # Copy a RequiredKeywordParameterNode node - # - # source://prism//lib/prism/mutation_compiler.rb#629 - def visit_required_keyword_parameter_node(node); end - - # Copy a RequiredParameterNode node - # - # source://prism//lib/prism/mutation_compiler.rb#634 - def visit_required_parameter_node(node); end - - # Copy a RescueModifierNode node - # - # source://prism//lib/prism/mutation_compiler.rb#639 - def visit_rescue_modifier_node(node); end - - # Copy a RescueNode node - # - # source://prism//lib/prism/mutation_compiler.rb#644 - def visit_rescue_node(node); end - - # Copy a RestParameterNode node - # - # source://prism//lib/prism/mutation_compiler.rb#649 - def visit_rest_parameter_node(node); end - - # Copy a RetryNode node - # - # source://prism//lib/prism/mutation_compiler.rb#654 - def visit_retry_node(node); end - - # Copy a ReturnNode node - # - # source://prism//lib/prism/mutation_compiler.rb#659 - def visit_return_node(node); end - - # Copy a SelfNode node - # - # source://prism//lib/prism/mutation_compiler.rb#664 - def visit_self_node(node); end - - # Copy a SingletonClassNode node - # - # source://prism//lib/prism/mutation_compiler.rb#669 - def visit_singleton_class_node(node); end - - # Copy a SourceEncodingNode node - # - # source://prism//lib/prism/mutation_compiler.rb#674 - def visit_source_encoding_node(node); end - - # Copy a SourceFileNode node - # - # source://prism//lib/prism/mutation_compiler.rb#679 - def visit_source_file_node(node); end - - # Copy a SourceLineNode node - # - # source://prism//lib/prism/mutation_compiler.rb#684 - def visit_source_line_node(node); end - - # Copy a SplatNode node - # - # source://prism//lib/prism/mutation_compiler.rb#689 - def visit_splat_node(node); end - - # Copy a StatementsNode node - # - # source://prism//lib/prism/mutation_compiler.rb#694 - def visit_statements_node(node); end - - # Copy a StringNode node - # - # source://prism//lib/prism/mutation_compiler.rb#699 - def visit_string_node(node); end - - # Copy a SuperNode node - # - # source://prism//lib/prism/mutation_compiler.rb#704 - def visit_super_node(node); end - - # Copy a SymbolNode node - # - # source://prism//lib/prism/mutation_compiler.rb#709 - def visit_symbol_node(node); end - - # Copy a TrueNode node - # - # source://prism//lib/prism/mutation_compiler.rb#714 - def visit_true_node(node); end - - # Copy a UndefNode node - # - # source://prism//lib/prism/mutation_compiler.rb#719 - def visit_undef_node(node); end - - # Copy a UnlessNode node - # - # source://prism//lib/prism/mutation_compiler.rb#724 - def visit_unless_node(node); end - - # Copy a UntilNode node - # - # source://prism//lib/prism/mutation_compiler.rb#729 - def visit_until_node(node); end - - # Copy a WhenNode node - # - # source://prism//lib/prism/mutation_compiler.rb#734 - def visit_when_node(node); end - - # Copy a WhileNode node - # - # source://prism//lib/prism/mutation_compiler.rb#739 - def visit_while_node(node); end - - # Copy a XStringNode node - # - # source://prism//lib/prism/mutation_compiler.rb#744 - def visit_x_string_node(node); end - - # Copy a YieldNode node - # - # source://prism//lib/prism/mutation_compiler.rb#749 - def visit_yield_node(node); end -end - -# Represents the use of the `next` keyword. -# -# next 1 -# ^^^^^^ -# -# source://prism//lib/prism/node.rb#13810 -class Prism::NextNode < ::Prism::Node - # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void - # - # @return [NextNode] a new instance of NextNode - # - # source://prism//lib/prism/node.rb#13812 - def initialize(source, arguments, keyword_loc, location); end - - # def accept: (Visitor visitor) -> void - # - # source://prism//lib/prism/node.rb#13821 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#13120 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? + # attr_reader call: CallNode # - # source://prism//lib/prism/node.rb#13861 - sig { returns(T.nilable(Prism::ArgumentsNode)) } - def arguments; end + # source://prism//lib/prism/node.rb#13153 + sig { returns(Prism::CallNode) } + def call; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13826 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13125 + 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#13838 + # source://prism//lib/prism/node.rb#13135 + 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#13831 + # source://prism//lib/prism/node.rb#13130 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> NextNode + # def copy: (?call: CallNode, ?targets: Array[LocalVariableTargetNode], ?location: Location) -> MatchWriteNode # - # source://prism//lib/prism/node.rb#13843 - sig { params(params: T.untyped).returns(Prism::NextNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13140 + sig do + params( + call: Prism::CallNode, + targets: T::Array[Prism::LocalVariableTargetNode], + location: Prism::Location + ).returns(Prism::MatchWriteNode) + end + def copy(call: T.unsafe(nil), targets: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13826 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13125 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { call: CallNode, targets: Array[LocalVariableTargetNode], location: Location } # - # source://prism//lib/prism/node.rb#13856 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#13148 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#13876 - def inspect(inspector = T.unsafe(nil)); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def keyword: () -> String + # def inspect -> String # - # source://prism//lib/prism/node.rb#13871 - sig { returns(String) } - def keyword; end + # source://prism//lib/prism/node.rb#13159 + sig { override.returns(String) } + def inspect; end - # attr_reader keyword_loc: Location + # attr_reader targets: Array[LocalVariableTargetNode] # - # source://prism//lib/prism/node.rb#13864 - sig { returns(Prism::Location) } - def keyword_loc; end + # source://prism//lib/prism/node.rb#13156 + sig { returns(T::Array[Prism::LocalVariableTargetNode]) } + def targets; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20391,7 +23128,8 @@ class Prism::NextNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13902 + # source://prism//lib/prism/node.rb#13177 + sig { override.returns(Symbol) } def type; end class << self @@ -20402,74 +23140,80 @@ class Prism::NextNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13912 + # source://prism//lib/prism/node.rb#13187 def type; end end end -# Represents the use of the `nil` keyword. -# -# nil -# ^^^ +# Represents a node that is missing from the source and results in a syntax error. # -# source://prism//lib/prism/node.rb#13921 -class Prism::NilNode < ::Prism::Node +# source://prism//lib/prism/node.rb#13202 +class Prism::MissingNode < ::Prism::Node # def initialize: (Location location) -> void # - # @return [NilNode] a new instance of NilNode + # @return [MissingNode] a new instance of MissingNode # - # source://prism//lib/prism/node.rb#13923 + # source://prism//lib/prism/node.rb#13204 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#13278 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#13930 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#13211 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13935 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13216 + 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#13945 + # source://prism//lib/prism/node.rb#13226 + 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#13940 + # source://prism//lib/prism/node.rb#13221 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> NilNode + # def copy: (?location: Location) -> MissingNode # - # source://prism//lib/prism/node.rb#13950 - sig { params(params: T.untyped).returns(Prism::NilNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13231 + sig { params(location: Prism::Location).returns(Prism::MissingNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#13935 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13216 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#13961 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#13239 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#13967 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#13244 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20486,7 +23230,8 @@ class Prism::NilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#13986 + # source://prism//lib/prism/node.rb#13262 + sig { override.returns(Symbol) } def type; end class << self @@ -20497,99 +23242,152 @@ class Prism::NilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#13996 + # source://prism//lib/prism/node.rb#13272 def type; end end end -# Represents the use of `**nil` inside method arguments. +# Represents a module declaration involving the `module` keyword. # -# def a(**nil) -# ^^^^^ -# end +# module Foo end +# ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14006 -class Prism::NoKeywordsParameterNode < ::Prism::Node - # def initialize: (Location operator_loc, Location keyword_loc, Location location) -> void +# source://prism//lib/prism/node.rb#13287 +class Prism::ModuleNode < ::Prism::Node + # def initialize: (Array[Symbol] locals, Location module_keyword_loc, Prism::node constant_path, Prism::node? body, Location end_keyword_loc, Symbol name, Location location) -> void # - # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode + # @return [ModuleNode] a new instance of ModuleNode # - # source://prism//lib/prism/node.rb#14008 - def initialize(source, operator_loc, keyword_loc, location); end + # source://prism//lib/prism/node.rb#13289 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + module_keyword_loc: Prism::Location, + constant_path: Prism::Node, + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + name: Symbol, + location: Prism::Location + ).void + end + def initialize(source, locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location); 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#13408 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14017 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#13302 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader body: Prism::node? + # + # source://prism//lib/prism/node.rb#13351 + sig { returns(T.nilable(Prism::Node)) } + def body; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14022 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13307 + 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#14032 + # source://prism//lib/prism/node.rb#13320 + 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#14027 + # source://prism//lib/prism/node.rb#13312 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> NoKeywordsParameterNode + # attr_reader constant_path: Prism::node + # + # source://prism//lib/prism/node.rb#13348 + sig { returns(Prism::Node) } + def constant_path; end + + # def copy: (?locals: Array[Symbol], ?module_keyword_loc: Location, ?constant_path: Prism::node, ?body: Prism::node?, ?end_keyword_loc: Location, ?name: Symbol, ?location: Location) -> ModuleNode # - # source://prism//lib/prism/node.rb#14037 - sig { params(params: T.untyped).returns(Prism::NoKeywordsParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13325 + sig do + params( + locals: T::Array[Symbol], + module_keyword_loc: Prism::Location, + constant_path: Prism::Node, + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + name: Symbol, + location: Prism::Location + ).returns(Prism::ModuleNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14022 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13307 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], module_keyword_loc: Location, constant_path: Prism::node, body: Prism::node?, end_keyword_loc: Location, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#14050 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#13333 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#14078 - def inspect(inspector = T.unsafe(nil)); end - - # def keyword: () -> String + # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#14073 + # source://prism//lib/prism/node.rb#13369 sig { returns(String) } - def keyword; end + def end_keyword; end - # attr_reader keyword_loc: Location + # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#14061 + # source://prism//lib/prism/node.rb#13354 sig { returns(Prism::Location) } - def keyword_loc; end + def end_keyword_loc; end - # def operator: () -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#13374 + sig { override.returns(String) } + def inspect; end + + # attr_reader locals: Array[Symbol] + # + # source://prism//lib/prism/node.rb#13338 + sig { returns(T::Array[Symbol]) } + def locals; end + + # def module_keyword: () -> String # - # source://prism//lib/prism/node.rb#14068 + # source://prism//lib/prism/node.rb#13364 sig { returns(String) } - def operator; end + def module_keyword; end - # attr_reader operator_loc: Location + # attr_reader module_keyword_loc: Location # - # source://prism//lib/prism/node.rb#14055 + # source://prism//lib/prism/node.rb#13341 sig { returns(Prism::Location) } - def operator_loc; end + def module_keyword_loc; end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#13361 + sig { returns(Symbol) } + def name; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20606,7 +23404,8 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14099 + # source://prism//lib/prism/node.rb#13392 + sig { override.returns(Symbol) } def type; end class << self @@ -20617,243 +23416,148 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14109 + # source://prism//lib/prism/node.rb#13402 def type; end end end -# This represents a node in the tree. It is the parent class of all of the -# various node types. +# Represents a multi-target expression. # -# source://prism//lib/prism/node.rb#11 -class Prism::Node - # Accepts a visitor and calls back into the specialized visit function. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#62 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end - - # Returns an array of child nodes, including `nil`s in the place of optional - # nodes that were not present. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#68 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # Returns an array of child nodes and locations that could potentially have - # comments attached to them. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#82 - def comment_targets; end - - # Returns an array of child nodes, excluding any `nil`s in the place of - # optional nodes that were not present. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#76 - sig { returns(T::Array[Prism::Node]) } - def compact_child_nodes; end - - # Returns an array of child nodes, including `nil`s in the place of optional - # nodes that were not present. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#68 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end - - # A Location instance that represents the location of this node in the - # source. - # - # source://prism//lib/prism/node.rb#18 - sig { returns(Prism::Location) } - def location; end - - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#23 - def newline?; end - - # Similar to inspect, but respects the current level of indentation given by - # the pretty print object. - # - # source://prism//lib/prism/node.rb#42 - def pretty_print(q); end - - # source://prism//lib/prism/node.rb#27 - def set_newline_flag(newline_marked); end - - # Slice the location of the node from the source. - # - # source://prism//lib/prism/node.rb#36 - sig { returns(String) } - def slice; end - - # Convert this node into a graphviz dot graph string. - # - # source://prism//lib/prism/node.rb#50 - sig { returns(String) } - def to_dot; end - - # Returns a symbol symbolizing the type of node that this represents. This - # is particularly useful for case statements and array comparisons. - # - # @raise [NoMethodError] - # - # source://prism//lib/prism/node.rb#88 - sig { returns(Symbol) } - def type; end - - private - - # A pointer to the source that this node was created from. - # - # source://prism//lib/prism/node.rb#13 - def source; end -end - -# This object is responsible for generating the output for the inspect method -# implementations of child nodes. +# a, (b, c) = 1, 2, 3 +# ^^^^^^ # -# source://prism//lib/prism/node_inspector.rb#6 -class Prism::NodeInspector - # @return [NodeInspector] a new instance of NodeInspector +# source://prism//lib/prism/node.rb#13424 +class Prism::MultiTargetNode < ::Prism::Node + # def initialize: (Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode] lefts, Prism::node? rest, Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode] rights, Location? lparen_loc, Location? rparen_loc, Location location) -> void # - # source://prism//lib/prism/node_inspector.rb#9 - def initialize(prefix = T.unsafe(nil)); end - - # Appends a line to the output with the current prefix. + # @return [MultiTargetNode] a new instance of MultiTargetNode # - # source://prism//lib/prism/node_inspector.rb#15 - sig { params(line: String).void } - def <<(line); end + # source://prism//lib/prism/node.rb#13426 + sig do + params( + source: Prism::Source, + lefts: 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)], + rest: T.nilable(Prism::Node), + rights: 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)], + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(source, lefts, rest, rights, lparen_loc, rparen_loc, location); end - # Returns a new inspector that can be used to inspect a child 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_inspector.rb#59 - sig { params(append: String).returns(Prism::NodeInspector) } - def child_inspector(append); end + # source://prism//lib/prism/node.rb#13554 + def ===(other); end - # Generates a string that represents a child node. + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node_inspector.rb#54 - sig { params(node: Prism::Node, append: String).returns(String) } - def child_node(node, append); end + # source://prism//lib/prism/node.rb#13438 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # This generates a string that is used as the header of the inspect output - # for any given node. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node_inspector.rb#21 - # This generates a string that is used as the header of the inspect output - sig { params(node: Prism::Node).returns(String) } - def header(node); end + # source://prism//lib/prism/node.rb#13443 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Generates a string that represents a list of nodes. It handles properly - # using the box drawing characters to make the output look nice. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node_inspector.rb#31 - # Generates a string that represents a list of nodes. It handles properly - sig { params(prefix: String, nodes: T::Array[Prism::Node]).returns(String) } - def list(prefix, nodes); end + # source://prism//lib/prism/node.rb#13457 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Generates a string that represents a location field on a node. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node_inspector.rb#45 - sig { params(value: Prism::Location).returns(String) } - def location(value); end - - # source://prism//lib/prism/node_inspector.rb#7 - sig { returns(String) } - def output; end - - # source://prism//lib/prism/node_inspector.rb#7 - sig { returns(String) } - def prefix; end + # source://prism//lib/prism/node.rb#13448 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Returns the output as a string. + # def copy: (?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], ?rest: Prism::node?, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?location: Location) -> MultiTargetNode # - # source://prism//lib/prism/node_inspector.rb#64 - sig { returns(String) } - def to_str; end -end + # source://prism//lib/prism/node.rb#13462 + sig do + params( + lefts: 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)], + rest: T.nilable(Prism::Node), + rights: 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)], + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::MultiTargetNode) + end + def copy(lefts: T.unsafe(nil), rest: T.unsafe(nil), rights: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil), location: T.unsafe(nil)); end -# Represents an implicit set of parameters through the use of numbered parameters within a block or lambda. -# -# -> { _1 + _2 } -# ^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#14118 -class Prism::NumberedParametersNode < ::Prism::Node - # def initialize: (Integer maximum, Location location) -> void - # - # @return [NumberedParametersNode] a new instance of NumberedParametersNode + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14120 - def initialize(source, maximum, location); end + # source://prism//lib/prism/node.rb#13443 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # def accept: (Visitor visitor) -> void + # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode], rest: Prism::node?, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode], lparen_loc: Location?, rparen_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#14128 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#13470 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # def child_nodes: () -> Array[nil | Node] + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#14133 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/node.rb#13520 + sig { override.returns(String) } + def inspect; end - # def comment_targets: () -> Array[Node | Location] + # attr_reader lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode | NumberedReferenceReadNode] # - # source://prism//lib/prism/node.rb#14143 - def comment_targets; end + # source://prism//lib/prism/node.rb#13475 + 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 + def lefts; end - # def compact_child_nodes: () -> Array[Node] + # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#14138 - def compact_child_nodes; end + # source://prism//lib/prism/node.rb#13510 + sig { returns(T.nilable(String)) } + def lparen; end - # def copy: (**params) -> NumberedParametersNode + # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#14148 - sig { params(params: T.untyped).returns(Prism::NumberedParametersNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13484 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#14133 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#13478 + sig { returns(T.nilable(Prism::Node)) } + def rest; end - # def deconstruct_keys: (Array[Symbol] keys) -> { maximum: Integer, location: Location } + # attr_reader rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode | RequiredParameterNode | BackReferenceReadNode] # - # source://prism//lib/prism/node.rb#14160 + # source://prism//lib/prism/node.rb#13481 sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) + 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)]) end - def deconstruct_keys(keys); end + def rights; end - # def inspect(NodeInspector inspector) -> String + # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#14169 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#13515 + sig { returns(T.nilable(String)) } + def rparen; end - # attr_reader maximum: Integer + # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#14165 - sig { returns(Integer) } - def maximum; end + # source://prism//lib/prism/node.rb#13497 + sig { returns(T.nilable(Prism::Location)) } + def rparen_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20870,7 +23574,8 @@ class Prism::NumberedParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14189 + # source://prism//lib/prism/node.rb#13538 + sig { override.returns(Symbol) } def type; end class << self @@ -20881,86 +23586,164 @@ class Prism::NumberedParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14199 + # source://prism//lib/prism/node.rb#13548 def type; end end end -# Represents reading a numbered reference to a capture in the previous match. +# Represents a write to a multi-target expression. # -# $1 -# ^^ +# a, b, c = 1, 2, 3 +# ^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#14208 -class Prism::NumberedReferenceReadNode < ::Prism::Node - # def initialize: (Integer number, Location location) -> void +# source://prism//lib/prism/node.rb#13570 +class Prism::MultiWriteNode < ::Prism::Node + # def initialize: (Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] lefts, Prism::node? rest, Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] rights, Location? lparen_loc, Location? rparen_loc, Location operator_loc, Prism::node value, Location location) -> void # - # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode + # @return [MultiWriteNode] a new instance of MultiWriteNode # - # source://prism//lib/prism/node.rb#14210 - def initialize(source, number, location); end + # source://prism//lib/prism/node.rb#13572 + sig do + params( + source: Prism::Source, + lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)], + rest: T.nilable(Prism::Node), + rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)], + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location); 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#13718 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14218 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#13586 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14223 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13591 + 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#14233 + # source://prism//lib/prism/node.rb#13606 + 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#14228 + # source://prism//lib/prism/node.rb#13596 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> NumberedReferenceReadNode + # def copy: (?lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], ?rest: Prism::node?, ?rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], ?lparen_loc: Location?, ?rparen_loc: Location?, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> MultiWriteNode # - # source://prism//lib/prism/node.rb#14238 - sig { params(params: T.untyped).returns(Prism::NumberedReferenceReadNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13611 + sig do + params( + lefts: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)], + rest: T.nilable(Prism::Node), + rights: T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)], + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::MultiWriteNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14223 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13591 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { number: Integer, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], rest: Prism::node?, rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Prism::node, location: Location } + # + # source://prism//lib/prism/node.rb#13619 + 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 inspect -> String # - # source://prism//lib/prism/node.rb#14250 + # source://prism//lib/prism/node.rb#13684 + sig { override.returns(String) } + def inspect; end + + # attr_reader lefts: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] + # + # source://prism//lib/prism/node.rb#13624 sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) + returns(T::Array[T.any(Prism::LocalVariableTargetNode, Prism::InstanceVariableTargetNode, Prism::ClassVariableTargetNode, Prism::GlobalVariableTargetNode, Prism::ConstantTargetNode, Prism::ConstantPathTargetNode, Prism::CallTargetNode, Prism::IndexTargetNode, Prism::MultiTargetNode)]) end - def deconstruct_keys(keys); end + def lefts; end - # def inspect(NodeInspector inspector) -> String + # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#14265 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#13669 + sig { returns(T.nilable(String)) } + def lparen; end - # The (1-indexed, from the left) number of the capture group. Numbered references that would overflow a `uint32` result in a `number` of exactly `2**32 - 1`. + # attr_reader lparen_loc: Location? # - # $1 # number `1` + # source://prism//lib/prism/node.rb#13633 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end + + # def operator: () -> String # - # $5432 # number `5432` + # source://prism//lib/prism/node.rb#13679 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location # - # $4294967296 # number `4294967295` + # source://prism//lib/prism/node.rb#13659 + sig { returns(Prism::Location) } + def operator_loc; end + + # attr_reader rest: Prism::node? # - # source://prism//lib/prism/node.rb#14261 - sig { returns(Integer) } - def number; end + # source://prism//lib/prism/node.rb#13627 + sig { returns(T.nilable(Prism::Node)) } + def rest; end + + # attr_reader rights: Array[LocalVariableTargetNode | InstanceVariableTargetNode | ClassVariableTargetNode | GlobalVariableTargetNode | ConstantTargetNode | ConstantPathTargetNode | CallTargetNode | IndexTargetNode | MultiTargetNode] + # + # source://prism//lib/prism/node.rb#13630 + 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)]) + end + def rights; end + + # def rparen: () -> String? + # + # source://prism//lib/prism/node.rb#13674 + sig { returns(T.nilable(String)) } + def rparen; end + + # attr_reader rparen_loc: Location? + # + # source://prism//lib/prism/node.rb#13646 + sig { returns(T.nilable(Prism::Location)) } + def rparen_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -20977,9 +23760,16 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14285 + # source://prism//lib/prism/node.rb#13702 + sig { override.returns(Symbol) } def type; end + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#13666 + sig { returns(Prism::Node) } + def value; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -20988,908 +23778,871 @@ class Prism::NumberedReferenceReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14295 + # source://prism//lib/prism/node.rb#13712 def type; end end end -# Represents an optional keyword parameter to a method, block, or lambda definition. -# -# def a(b: 1) -# ^^^^ -# end +# This visitor walks through the tree and copies each node as it is being +# 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/node.rb#14305 -class Prism::OptionalKeywordParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol name, Location name_loc, Node value, Location location) -> void - # - # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode +# source://prism//lib/prism/mutation_compiler.rb#13 +class Prism::MutationCompiler < ::Prism::Compiler + # Copy a AliasGlobalVariableNode node # - # source://prism//lib/prism/node.rb#14307 - def initialize(source, flags, name, name_loc, value, location); end + # source://prism//lib/prism/mutation_compiler.rb#15 + def visit_alias_global_variable_node(node); end - # def accept: (Visitor visitor) -> void + # Copy a AliasMethodNode node # - # source://prism//lib/prism/node.rb#14318 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#20 + def visit_alias_method_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a AlternationPatternNode node # - # source://prism//lib/prism/node.rb#14323 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#25 + def visit_alternation_pattern_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a AndNode node # - # source://prism//lib/prism/node.rb#14333 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#30 + def visit_and_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a ArgumentsNode node # - # source://prism//lib/prism/node.rb#14328 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#35 + def visit_arguments_node(node); end - # def copy: (**params) -> OptionalKeywordParameterNode + # Copy a ArrayNode node # - # source://prism//lib/prism/node.rb#14338 - sig { params(params: T.untyped).returns(Prism::OptionalKeywordParameterNode) } - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#40 + def visit_array_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a ArrayPatternNode node # - # source://prism//lib/prism/node.rb#14323 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#45 + def visit_array_pattern_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, value: Node, location: Location } + # Copy a AssocNode node # - # source://prism//lib/prism/node.rb#14353 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#50 + def visit_assoc_node(node); end - # def inspect(NodeInspector inspector) -> String + # Copy a AssocSplatNode node # - # source://prism//lib/prism/node.rb#14380 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#55 + def visit_assoc_splat_node(node); end - # attr_reader name: Symbol + # Copy a BackReferenceReadNode node # - # source://prism//lib/prism/node.rb#14362 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/mutation_compiler.rb#60 + def visit_back_reference_read_node(node); end - # attr_reader name_loc: Location + # Copy a BeginNode node # - # source://prism//lib/prism/node.rb#14365 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/mutation_compiler.rb#65 + def visit_begin_node(node); end - # def repeated_parameter?: () -> bool - # - # @return [Boolean] + # Copy a BlockArgumentNode node # - # source://prism//lib/prism/node.rb#14375 - sig { returns(T::Boolean) } - def repeated_parameter?; end + # source://prism//lib/prism/mutation_compiler.rb#70 + def visit_block_argument_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # Copy a BlockLocalVariableNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#75 + def visit_block_local_variable_node(node); end + + # Copy a BlockNode node # - # source://prism//lib/prism/node.rb#14405 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#80 + def visit_block_node(node); end - # attr_reader value: Node + # Copy a BlockParameterNode node # - # source://prism//lib/prism/node.rb#14371 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/mutation_compiler.rb#85 + def visit_block_parameter_node(node); end - private + # Copy a BlockParametersNode node + # + # source://prism//lib/prism/mutation_compiler.rb#90 + def visit_block_parameters_node(node); end - # private attr_reader flags: Integer + # Copy a BreakNode node # - # source://prism//lib/prism/node.rb#14358 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/mutation_compiler.rb#95 + def visit_break_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#14415 - def type; end - end -end + # Copy a CallAndWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#100 + def visit_call_and_write_node(node); end -# Represents an optional parameter to a method, block, or lambda definition. -# -# def a(b = 1) -# ^^^^^ -# end -# -# source://prism//lib/prism/node.rb#14425 -class Prism::OptionalParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # Copy a CallNode node # - # @return [OptionalParameterNode] a new instance of OptionalParameterNode + # source://prism//lib/prism/mutation_compiler.rb#105 + def visit_call_node(node); end + + # Copy a CallOperatorWriteNode node # - # source://prism//lib/prism/node.rb#14427 - def initialize(source, flags, name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/mutation_compiler.rb#110 + def visit_call_operator_write_node(node); end - # def accept: (Visitor visitor) -> void + # Copy a CallOrWriteNode node # - # source://prism//lib/prism/node.rb#14439 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#115 + def visit_call_or_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a CallTargetNode node # - # source://prism//lib/prism/node.rb#14444 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#120 + def visit_call_target_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a CapturePatternNode node # - # source://prism//lib/prism/node.rb#14454 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#125 + def visit_capture_pattern_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a CaseMatchNode node # - # source://prism//lib/prism/node.rb#14449 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#130 + def visit_case_match_node(node); end - # def copy: (**params) -> OptionalParameterNode + # Copy a CaseNode node # - # source://prism//lib/prism/node.rb#14459 - sig { params(params: T.untyped).returns(Prism::OptionalParameterNode) } - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#135 + def visit_case_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a ClassNode node # - # source://prism//lib/prism/node.rb#14444 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#140 + def visit_class_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } + # Copy a ClassVariableAndWriteNode node # - # source://prism//lib/prism/node.rb#14475 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#145 + def visit_class_variable_and_write_node(node); end - # def inspect(NodeInspector inspector) -> String + # Copy a ClassVariableOperatorWriteNode node # - # source://prism//lib/prism/node.rb#14513 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#150 + def visit_class_variable_operator_write_node(node); end - # attr_reader name: Symbol + # Copy a ClassVariableOrWriteNode node # - # source://prism//lib/prism/node.rb#14484 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/mutation_compiler.rb#155 + def visit_class_variable_or_write_node(node); end - # attr_reader name_loc: Location + # Copy a ClassVariableReadNode node # - # source://prism//lib/prism/node.rb#14487 - sig { returns(Prism::Location) } - def name_loc; end + # source://prism//lib/prism/mutation_compiler.rb#160 + def visit_class_variable_read_node(node); end - # def operator: () -> String + # Copy a ClassVariableTargetNode node # - # source://prism//lib/prism/node.rb#14508 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/mutation_compiler.rb#165 + def visit_class_variable_target_node(node); end - # attr_reader operator_loc: Location + # Copy a ClassVariableWriteNode node # - # source://prism//lib/prism/node.rb#14493 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/mutation_compiler.rb#170 + def visit_class_variable_write_node(node); end - # def repeated_parameter?: () -> bool + # Copy a ConstantAndWriteNode node # - # @return [Boolean] + # source://prism//lib/prism/mutation_compiler.rb#175 + def visit_constant_and_write_node(node); end + + # Copy a ConstantOperatorWriteNode node # - # source://prism//lib/prism/node.rb#14503 - sig { returns(T::Boolean) } - def repeated_parameter?; end + # source://prism//lib/prism/mutation_compiler.rb#180 + def visit_constant_operator_write_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Copy a ConstantOrWriteNode node # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/mutation_compiler.rb#185 + def visit_constant_or_write_node(node); end + + # Copy a ConstantPathAndWriteNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#190 + def visit_constant_path_and_write_node(node); end + + # Copy a ConstantPathNode node # - # source://prism//lib/prism/node.rb#14539 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#195 + def visit_constant_path_node(node); end - # attr_reader value: Node + # Copy a ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/node.rb#14499 - sig { returns(Prism::Node) } - def value; end + # source://prism//lib/prism/mutation_compiler.rb#200 + def visit_constant_path_operator_write_node(node); end - private + # Copy a ConstantPathOrWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#205 + def visit_constant_path_or_write_node(node); end - # private attr_reader flags: Integer + # Copy a ConstantPathTargetNode node # - # source://prism//lib/prism/node.rb#14480 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/mutation_compiler.rb#210 + def visit_constant_path_target_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#14549 - def type; end - end -end + # Copy a ConstantPathWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#215 + def visit_constant_path_write_node(node); end -# Represents the use of the `||` operator or the `or` keyword. -# -# left or right -# ^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#14558 -class Prism::OrNode < ::Prism::Node - # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void + # Copy a ConstantReadNode node # - # @return [OrNode] a new instance of OrNode + # source://prism//lib/prism/mutation_compiler.rb#220 + def visit_constant_read_node(node); end + + # Copy a ConstantTargetNode node # - # source://prism//lib/prism/node.rb#14560 - def initialize(source, left, right, operator_loc, location); end + # source://prism//lib/prism/mutation_compiler.rb#225 + def visit_constant_target_node(node); end - # def accept: (Visitor visitor) -> void + # Copy a ConstantWriteNode node # - # source://prism//lib/prism/node.rb#14570 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#230 + def visit_constant_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a DefNode node # - # source://prism//lib/prism/node.rb#14575 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#235 + def visit_def_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a DefinedNode node # - # source://prism//lib/prism/node.rb#14585 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#240 + def visit_defined_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a ElseNode node # - # source://prism//lib/prism/node.rb#14580 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#245 + def visit_else_node(node); end - # def copy: (**params) -> OrNode + # Copy a EmbeddedStatementsNode node # - # source://prism//lib/prism/node.rb#14590 - sig { params(params: T.untyped).returns(Prism::OrNode) } - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#250 + def visit_embedded_statements_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a EmbeddedVariableNode node # - # source://prism//lib/prism/node.rb#14575 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#255 + def visit_embedded_variable_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } + # Copy a EnsureNode node # - # source://prism//lib/prism/node.rb#14604 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#260 + def visit_ensure_node(node); end - # def inspect(NodeInspector inspector) -> String + # Copy a FalseNode node # - # source://prism//lib/prism/node.rb#14642 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#265 + def visit_false_node(node); end - # Represents the left side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). - # - # left or right - # ^^^^ + # Copy a FindPatternNode node # - # 1 || 2 - # ^ + # source://prism//lib/prism/mutation_compiler.rb#270 + def visit_find_pattern_node(node); end + + # Copy a FlipFlopNode node # - # source://prism//lib/prism/node.rb#14615 - sig { returns(Prism::Node) } - def left; end + # source://prism//lib/prism/mutation_compiler.rb#275 + def visit_flip_flop_node(node); end - # def operator: () -> String + # Copy a FloatNode node # - # source://prism//lib/prism/node.rb#14637 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/mutation_compiler.rb#280 + def visit_float_node(node); end - # The location of the `or` keyword or the `||` operator. + # Copy a ForNode node # - # left or right - # ^^ + # source://prism//lib/prism/mutation_compiler.rb#285 + def visit_for_node(node); end + + # Copy a ForwardingArgumentsNode node # - # source://prism//lib/prism/node.rb#14630 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/mutation_compiler.rb#290 + def visit_forwarding_arguments_node(node); end - # Represents the right side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # Copy a ForwardingParameterNode node # - # left || right - # ^^^^^ + # source://prism//lib/prism/mutation_compiler.rb#295 + def visit_forwarding_parameter_node(node); end + + # Copy a ForwardingSuperNode node # - # 1 or 2 - # ^ + # source://prism//lib/prism/mutation_compiler.rb#300 + def visit_forwarding_super_node(node); end + + # Copy a GlobalVariableAndWriteNode node # - # source://prism//lib/prism/node.rb#14624 - sig { returns(Prism::Node) } - def right; end + # source://prism//lib/prism/mutation_compiler.rb#305 + def visit_global_variable_and_write_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Copy a GlobalVariableOperatorWriteNode node # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/mutation_compiler.rb#310 + def visit_global_variable_operator_write_node(node); end + + # Copy a GlobalVariableOrWriteNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#315 + def visit_global_variable_or_write_node(node); end + + # Copy a GlobalVariableReadNode node # - # source://prism//lib/prism/node.rb#14666 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#320 + def visit_global_variable_read_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#14676 - def type; end - end -end + # Copy a GlobalVariableTargetNode node + # + # source://prism//lib/prism/mutation_compiler.rb#325 + def visit_global_variable_target_node(node); end -# A parser for the pack template language. -# -# source://prism//lib/prism/pack.rb#5 -module Prism::Pack - class << self - def parse(_arg0, _arg1, _arg2); end - end -end + # Copy a GlobalVariableWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#330 + def visit_global_variable_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol) + # Copy a HashNode node + # + # source://prism//lib/prism/mutation_compiler.rb#335 + def visit_hash_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol) + # Copy a HashPatternNode node + # + # source://prism//lib/prism/mutation_compiler.rb#340 + def visit_hash_pattern_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::BER = T.let(T.unsafe(nil), Symbol) + # Copy a IfNode node + # + # source://prism//lib/prism/mutation_compiler.rb#345 + def visit_if_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol) + # Copy a ImaginaryNode node + # + # source://prism//lib/prism/mutation_compiler.rb#350 + def visit_imaginary_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol) + # Copy a ImplicitNode node + # + # source://prism//lib/prism/mutation_compiler.rb#355 + def visit_implicit_node(node); end -# A directive in the pack template language. -# -# source://prism//lib/prism/pack.rb#59 -class Prism::Pack::Directive - # Initialize a new directive with the given values. + # Copy a ImplicitRestNode node # - # @return [Directive] a new instance of Directive + # source://prism//lib/prism/mutation_compiler.rb#360 + def visit_implicit_rest_node(node); end + + # Copy a InNode node # - # source://prism//lib/prism/pack.rb#88 - def initialize(version, variant, source, type, signed, endian, size, length_type, length); end + # source://prism//lib/prism/mutation_compiler.rb#365 + def visit_in_node(node); end - # Provide a human-readable description of the directive. + # Copy a IndexAndWriteNode node # - # source://prism//lib/prism/pack.rb#130 - def describe; end + # source://prism//lib/prism/mutation_compiler.rb#370 + def visit_index_and_write_node(node); end - # The type of endianness of the directive. + # Copy a IndexOperatorWriteNode node # - # source://prism//lib/prism/pack.rb#76 - def endian; end + # source://prism//lib/prism/mutation_compiler.rb#375 + def visit_index_operator_write_node(node); end - # The length of this directive (used for integers). + # Copy a IndexOrWriteNode node # - # source://prism//lib/prism/pack.rb#85 - def length; end + # source://prism//lib/prism/mutation_compiler.rb#380 + def visit_index_or_write_node(node); end - # The length type of this directive (used for integers). + # Copy a IndexTargetNode node # - # source://prism//lib/prism/pack.rb#82 - def length_type; end + # source://prism//lib/prism/mutation_compiler.rb#385 + def visit_index_target_node(node); end - # The type of signedness of the directive. + # Copy a InstanceVariableAndWriteNode node # - # source://prism//lib/prism/pack.rb#73 - def signed; end + # source://prism//lib/prism/mutation_compiler.rb#390 + def visit_instance_variable_and_write_node(node); end - # The size of the directive. + # Copy a InstanceVariableOperatorWriteNode node # - # source://prism//lib/prism/pack.rb#79 - def size; end + # source://prism//lib/prism/mutation_compiler.rb#395 + def visit_instance_variable_operator_write_node(node); end - # A byteslice of the source string that this directive represents. + # Copy a InstanceVariableOrWriteNode node # - # source://prism//lib/prism/pack.rb#67 - def source; end + # source://prism//lib/prism/mutation_compiler.rb#400 + def visit_instance_variable_or_write_node(node); end - # The type of the directive. + # Copy a InstanceVariableReadNode node # - # source://prism//lib/prism/pack.rb#70 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#405 + def visit_instance_variable_read_node(node); end - # A symbol representing whether or not we are packing or unpacking. + # Copy a InstanceVariableTargetNode node # - # source://prism//lib/prism/pack.rb#64 - def variant; end + # source://prism//lib/prism/mutation_compiler.rb#410 + def visit_instance_variable_target_node(node); end - # A symbol representing the version of Ruby. + # Copy a InstanceVariableWriteNode node # - # source://prism//lib/prism/pack.rb#61 - def version; end -end + # source://prism//lib/prism/mutation_compiler.rb#415 + def visit_instance_variable_write_node(node); end -# The descriptions of the various types of endianness. -# -# source://prism//lib/prism/pack.rb#101 -Prism::Pack::Directive::ENDIAN_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) + # Copy a IntegerNode node + # + # source://prism//lib/prism/mutation_compiler.rb#420 + def visit_integer_node(node); end -# The descriptions of the various types of signedness. -# -# source://prism//lib/prism/pack.rb#110 -Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) + # Copy a InterpolatedMatchLastLineNode node + # + # source://prism//lib/prism/mutation_compiler.rb#425 + def visit_interpolated_match_last_line_node(node); end -# The descriptions of the various types of sizes. -# -# source://prism//lib/prism/pack.rb#117 -Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) + # Copy a InterpolatedRegularExpressionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#430 + def visit_interpolated_regular_expression_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol) + # Copy a InterpolatedStringNode node + # + # source://prism//lib/prism/mutation_compiler.rb#435 + def visit_interpolated_string_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol) + # Copy a InterpolatedSymbolNode node + # + # source://prism//lib/prism/mutation_compiler.rb#440 + def visit_interpolated_symbol_node(node); end -# The result of parsing a pack template. -# -# source://prism//lib/prism/pack.rb#195 -class Prism::Pack::Format - # Create a new Format with the given directives and encoding. + # Copy a InterpolatedXStringNode node # - # @return [Format] a new instance of Format + # source://prism//lib/prism/mutation_compiler.rb#445 + def visit_interpolated_x_string_node(node); end + + # Copy a ItParametersNode node # - # source://prism//lib/prism/pack.rb#203 - def initialize(directives, encoding); end + # source://prism//lib/prism/mutation_compiler.rb#450 + def visit_it_parameters_node(node); end - # Provide a human-readable description of the format. + # Copy a KeywordHashNode node # - # source://prism//lib/prism/pack.rb#209 - def describe; end + # source://prism//lib/prism/mutation_compiler.rb#455 + def visit_keyword_hash_node(node); end - # A list of the directives in the template. + # Copy a KeywordRestParameterNode node # - # source://prism//lib/prism/pack.rb#197 - def directives; end + # source://prism//lib/prism/mutation_compiler.rb#460 + def visit_keyword_rest_parameter_node(node); end - # The encoding of the template. + # Copy a LambdaNode node # - # source://prism//lib/prism/pack.rb#200 - def encoding; end -end + # source://prism//lib/prism/mutation_compiler.rb#465 + def visit_lambda_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableAndWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#470 + def visit_local_variable_and_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableOperatorWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#475 + def visit_local_variable_operator_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableOrWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#480 + def visit_local_variable_or_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableReadNode node + # + # source://prism//lib/prism/mutation_compiler.rb#485 + def visit_local_variable_read_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableTargetNode node + # + # source://prism//lib/prism/mutation_compiler.rb#490 + def visit_local_variable_target_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#495 + def visit_local_variable_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol) + # Copy a MatchLastLineNode node + # + # source://prism//lib/prism/mutation_compiler.rb#500 + def visit_match_last_line_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol) + # Copy a MatchPredicateNode node + # + # source://prism//lib/prism/mutation_compiler.rb#505 + def visit_match_predicate_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol) + # Copy a MatchRequiredNode node + # + # source://prism//lib/prism/mutation_compiler.rb#510 + def visit_match_required_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol) - -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol) + # Copy a MatchWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#515 + def visit_match_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol) + # Copy a MissingNode node + # + # source://prism//lib/prism/mutation_compiler.rb#520 + def visit_missing_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol) + # Copy a ModuleNode node + # + # source://prism//lib/prism/mutation_compiler.rb#525 + def visit_module_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol) + # Copy a MultiTargetNode node + # + # source://prism//lib/prism/mutation_compiler.rb#530 + def visit_multi_target_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol) + # Copy a MultiWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#535 + def visit_multi_write_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol) + # Copy a NextNode node + # + # source://prism//lib/prism/mutation_compiler.rb#540 + def visit_next_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol) + # Copy a NilNode node + # + # source://prism//lib/prism/mutation_compiler.rb#545 + def visit_nil_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol) + # Copy a NoKeywordsParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#550 + def visit_no_keywords_parameter_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol) + # Copy a NumberedParametersNode node + # + # source://prism//lib/prism/mutation_compiler.rb#555 + def visit_numbered_parameters_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol) + # Copy a NumberedReferenceReadNode node + # + # source://prism//lib/prism/mutation_compiler.rb#560 + def visit_numbered_reference_read_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol) + # Copy a OptionalKeywordParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#565 + def visit_optional_keyword_parameter_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol) + # Copy a OptionalParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#570 + def visit_optional_parameter_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol) + # Copy a OrNode node + # + # source://prism//lib/prism/mutation_compiler.rb#575 + def visit_or_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol) + # Copy a ParametersNode node + # + # source://prism//lib/prism/mutation_compiler.rb#580 + def visit_parameters_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol) + # Copy a ParenthesesNode node + # + # source://prism//lib/prism/mutation_compiler.rb#585 + def visit_parentheses_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol) + # Copy a PinnedExpressionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#590 + def visit_pinned_expression_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol) + # Copy a PinnedVariableNode node + # + # source://prism//lib/prism/mutation_compiler.rb#595 + def visit_pinned_variable_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol) + # Copy a PostExecutionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#600 + def visit_post_execution_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol) + # Copy a PreExecutionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#605 + def visit_pre_execution_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol) + # Copy a ProgramNode node + # + # source://prism//lib/prism/mutation_compiler.rb#610 + def visit_program_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol) + # Copy a RangeNode node + # + # source://prism//lib/prism/mutation_compiler.rb#615 + def visit_range_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol) + # Copy a RationalNode node + # + # source://prism//lib/prism/mutation_compiler.rb#620 + def visit_rational_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol) + # Copy a RedoNode node + # + # source://prism//lib/prism/mutation_compiler.rb#625 + def visit_redo_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol) + # Copy a RegularExpressionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#630 + def visit_regular_expression_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol) + # Copy a RequiredKeywordParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#635 + def visit_required_keyword_parameter_node(node); end -# source://prism//lib/prism/pack.rb#55 -Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) + # Copy a RequiredParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#640 + def visit_required_parameter_node(node); end -# Flags for parameter nodes. -# -# source://prism//lib/prism/node.rb#19304 -module Prism::ParameterFlags; end + # Copy a RescueModifierNode node + # + # source://prism//lib/prism/mutation_compiler.rb#645 + def visit_rescue_modifier_node(node); end -# a parameter name that has been repeated in the method signature -# -# source://prism//lib/prism/node.rb#19306 -Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) + # Copy a RescueNode node + # + # source://prism//lib/prism/mutation_compiler.rb#650 + def visit_rescue_node(node); end -# Represents the list of parameters on a method, block, or lambda definition. -# -# def a(b, c, d) -# ^^^^^^^ -# end -# -# source://prism//lib/prism/node.rb#14686 -class Prism::ParametersNode < ::Prism::Node - # def initialize: (Array[Node] requireds, Array[Node] optionals, Node? rest, Array[Node] posts, Array[Node] keywords, Node? keyword_rest, BlockParameterNode? block, Location location) -> void + # Copy a RestParameterNode node # - # @return [ParametersNode] a new instance of ParametersNode + # source://prism//lib/prism/mutation_compiler.rb#655 + def visit_rest_parameter_node(node); end + + # Copy a RetryNode node # - # source://prism//lib/prism/node.rb#14688 - def initialize(source, requireds, optionals, rest, posts, keywords, keyword_rest, block, location); end + # source://prism//lib/prism/mutation_compiler.rb#660 + def visit_retry_node(node); end - # def accept: (Visitor visitor) -> void + # Copy a ReturnNode node # - # source://prism//lib/prism/node.rb#14702 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#665 + def visit_return_node(node); end - # attr_reader block: BlockParameterNode? + # Copy a SelfNode node # - # source://prism//lib/prism/node.rb#14771 - sig { returns(T.nilable(Prism::BlockParameterNode)) } - def block; end + # source://prism//lib/prism/mutation_compiler.rb#670 + def visit_self_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a ShareableConstantNode node # - # source://prism//lib/prism/node.rb#14707 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#675 + def visit_shareable_constant_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a SingletonClassNode node # - # source://prism//lib/prism/node.rb#14725 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#680 + def visit_singleton_class_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a SourceEncodingNode node # - # source://prism//lib/prism/node.rb#14712 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#685 + def visit_source_encoding_node(node); end - # def copy: (**params) -> ParametersNode + # Copy a SourceFileNode node # - # source://prism//lib/prism/node.rb#14730 - sig { params(params: T.untyped).returns(Prism::ParametersNode) } - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#690 + def visit_source_file_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a SourceLineNode node # - # source://prism//lib/prism/node.rb#14707 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#695 + def visit_source_line_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { requireds: Array[Node], optionals: Array[Node], rest: Node?, posts: Array[Node], keywords: Array[Node], keyword_rest: Node?, block: BlockParameterNode?, location: Location } + # Copy a SplatNode node # - # source://prism//lib/prism/node.rb#14748 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#700 + def visit_splat_node(node); end - # def inspect(NodeInspector inspector) -> String + # Copy a StatementsNode node # - # source://prism//lib/prism/node.rb#14775 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#705 + def visit_statements_node(node); end - # attr_reader keyword_rest: Node? + # Copy a StringNode node # - # source://prism//lib/prism/node.rb#14768 - sig { returns(T.nilable(Prism::Node)) } - def keyword_rest; end + # source://prism//lib/prism/mutation_compiler.rb#710 + def visit_string_node(node); end - # attr_reader keywords: Array[Node] + # Copy a SuperNode node # - # source://prism//lib/prism/node.rb#14765 - sig { returns(T::Array[Prism::Node]) } - def keywords; end + # source://prism//lib/prism/mutation_compiler.rb#715 + def visit_super_node(node); end - # attr_reader optionals: Array[Node] + # Copy a SymbolNode node # - # source://prism//lib/prism/node.rb#14756 - sig { returns(T::Array[Prism::Node]) } - def optionals; end + # source://prism//lib/prism/mutation_compiler.rb#720 + def visit_symbol_node(node); end - # attr_reader posts: Array[Node] + # Copy a TrueNode node # - # source://prism//lib/prism/node.rb#14762 - sig { returns(T::Array[Prism::Node]) } - def posts; end + # source://prism//lib/prism/mutation_compiler.rb#725 + def visit_true_node(node); end - # attr_reader requireds: Array[Node] + # Copy a UndefNode node # - # source://prism//lib/prism/node.rb#14753 - sig { returns(T::Array[Prism::Node]) } - def requireds; end + # source://prism//lib/prism/mutation_compiler.rb#730 + def visit_undef_node(node); end - # attr_reader rest: Node? + # Copy a UnlessNode node # - # source://prism//lib/prism/node.rb#14759 - sig { returns(T.nilable(Prism::Node)) } - def rest; end + # source://prism//lib/prism/mutation_compiler.rb#735 + def visit_unless_node(node); end - # Mirrors the Method#parameters method. + # Copy a UntilNode node # - # source://prism//lib/prism/node_ext.rb#172 - def signature; end + # source://prism//lib/prism/mutation_compiler.rb#740 + def visit_until_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # Copy a WhenNode node # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/mutation_compiler.rb#745 + def visit_when_node(node); end + + # Copy a WhileNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#750 + def visit_while_node(node); end + + # Copy a XStringNode node # - # source://prism//lib/prism/node.rb#14816 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#755 + def visit_x_string_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#14826 - def type; end - end + # Copy a YieldNode node + # + # source://prism//lib/prism/mutation_compiler.rb#760 + def visit_yield_node(node); end end -# Represents a parenthesized expression +# Represents the use of the `next` keyword. # -# (10 + 34) -# ^^^^^^^^^ +# next 1 +# ^^^^^^ # -# source://prism//lib/prism/node.rb#14835 -class Prism::ParenthesesNode < ::Prism::Node - # def initialize: (Node? body, Location opening_loc, Location closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#13736 +class Prism::NextNode < ::Prism::Node + # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void # - # @return [ParenthesesNode] a new instance of ParenthesesNode + # @return [NextNode] a new instance of NextNode # - # source://prism//lib/prism/node.rb#14837 - def initialize(source, body, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#13738 + sig do + params( + source: Prism::Source, + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, arguments, keyword_loc, location); 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#13831 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14847 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#13747 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end - # attr_reader body: Node? + # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#14892 - sig { returns(T.nilable(Prism::Node)) } - def body; end + # source://prism//lib/prism/node.rb#13782 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14856 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13752 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//lib/prism/node.rb#14913 - sig { returns(String) } - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//lib/prism/node.rb#14901 - sig { returns(Prism::Location) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#14868 + # source://prism//lib/prism/node.rb#13764 + 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#14861 + # source://prism//lib/prism/node.rb#13757 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ParenthesesNode + # def copy: (?arguments: ArgumentsNode?, ?keyword_loc: Location, ?location: Location) -> NextNode # - # source://prism//lib/prism/node.rb#14873 - sig { params(params: T.untyped).returns(Prism::ParenthesesNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#13769 + sig do + params( + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::NextNode) + end + def copy(arguments: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14856 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#13752 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { body: Node?, opening_loc: Location, closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#14887 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#13777 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#14918 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#13797 + sig { override.returns(String) } + def inspect; end - # def opening: () -> String + # def keyword: () -> String # - # source://prism//lib/prism/node.rb#14908 + # source://prism//lib/prism/node.rb#13792 sig { returns(String) } - def opening; end + def keyword; end - # attr_reader opening_loc: Location + # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#14895 + # source://prism//lib/prism/node.rb#13785 sig { returns(Prism::Location) } - def opening_loc; end - - # source://prism//lib/prism/node.rb#14851 - def set_newline_flag(newline_marked); end + def keyword_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -21906,7 +24659,8 @@ class Prism::ParenthesesNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#14945 + # source://prism//lib/prism/node.rb#13815 + sig { override.returns(Symbol) } def type; end class << self @@ -21917,589 +24671,3374 @@ class Prism::ParenthesesNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#14955 + # source://prism//lib/prism/node.rb#13825 def type; end end end -# This represents an error that was encountered during parsing. +# Represents the use of the `nil` keyword. # -# source://prism//lib/prism/parse_result.rb#338 -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#349 - def initialize(message, location, level); end - - # Implement the hash pattern matching interface for ParseError. +# nil +# ^^^ +# +# source://prism//lib/prism/node.rb#13842 +class Prism::NilNode < ::Prism::Node + # def initialize: (Location location) -> void # - # source://prism//lib/prism/parse_result.rb#356 - def deconstruct_keys(keys); end - - # Returns a string representation of this error. + # @return [NilNode] a new instance of NilNode # - # source://prism//lib/prism/parse_result.rb#361 - def inspect; end + # source://prism//lib/prism/node.rb#13844 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); end - # The level of this error. + # 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/parse_result.rb#346 - def level; end + # source://prism//lib/prism/node.rb#13918 + def ===(other); end - # A Location object representing the location of this error in the source. + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/parse_result.rb#343 - sig { returns(Prism::Location) } - def location; end + # source://prism//lib/prism/node.rb#13851 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # The message associated with this error. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#340 - sig { returns(String) } - def message; end -end + # source://prism//lib/prism/node.rb#13856 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end -# This represents the result of a call to ::parse or ::parse_file. It contains -# the AST, any comments that were encounters, and any errors that were -# encountered. -# -# source://prism//lib/prism/parse_result.rb#398 -class Prism::ParseResult - # Create a new parse result object with the given values. - # - # @return [ParseResult] a new instance of ParseResult + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/parse_result.rb#425 - def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end + # source://prism//lib/prism/node.rb#13866 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Attach the list of comments to their respective locations in the tree. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/parse_result/comments.rb#173 - def attach_comments!; end + # source://prism//lib/prism/node.rb#13861 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # The list of comments that were encountered during parsing. + # def copy: (?location: Location) -> NilNode # - # source://prism//lib/prism/parse_result.rb#405 - sig { returns(T::Array[Prism::Comment]) } - def comments; end + # source://prism//lib/prism/node.rb#13871 + sig { params(location: Prism::Location).returns(Prism::NilNode) } + def copy(location: T.unsafe(nil)); end - # An optional location that represents the location of the __END__ marker - # 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. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#413 - def data_loc; end + # source://prism//lib/prism/node.rb#13856 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Implement the hash pattern matching interface for ParseResult. + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/parse_result.rb#436 + # source://prism//lib/prism/node.rb#13879 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # The list of errors that were generated during parsing. - # - # source://prism//lib/prism/parse_result.rb#416 - sig { returns(T::Array[Prism::ParseError]) } - def errors; end - - # Returns true if there were errors during parsing and false if there were - # not. - # - # @return [Boolean] - # - # source://prism//lib/prism/parse_result.rb#448 - def failure?; end - - # The list of magic comments that were encountered during parsing. - # - # source://prism//lib/prism/parse_result.rb#408 - def magic_comments; end - - # Walk the tree and mark nodes that are on a new line. - # - # source://prism//lib/prism/parse_result/newlines.rb#60 - def mark_newlines!; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # A Source instance that represents the source code that was parsed. + # def inspect -> String # - # source://prism//lib/prism/parse_result.rb#422 - sig { returns(Prism::Source) } - def source; end + # source://prism//lib/prism/node.rb#13884 + sig { override.returns(String) } + def inspect; end - # Returns true if there were no errors during parsing and false if there - # were. + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # @return [Boolean] + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/parse_result.rb#442 - def success?; end - - # The value that was generated by parsing. Normally this holds the AST, but - # it can sometimes how a list of tokens or other results passed back from - # the parser. + # def type: () -> Symbol # - # source://prism//lib/prism/parse_result.rb#402 - sig { returns(Prism::ProgramNode) } - def value; end + # source://prism//lib/prism/node.rb#13902 + sig { override.returns(Symbol) } + def type; end - # The list of warnings that were generated during parsing. - # - # source://prism//lib/prism/parse_result.rb#419 - sig { returns(T::Array[Prism::ParseWarning]) } - def warnings; end + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#13912 + def type; end + end end -# When we've parsed the source, we have both the syntax tree and the list of -# comments that we found in the source. This class is responsible for -# walking the tree and finding the nearest location to attach each comment. -# -# It does this by first finding the nearest locations to each comment. -# Locations can either come from nodes directly or from location fields on -# nodes. For example, a `ClassNode` has an overall location encompassing the -# entire class, but it also has a location for the `class` keyword. +# Represents the use of `**nil` inside method arguments. # -# Once the nearest locations are found, it determines which one to attach -# to. If it's a trailing comment (a comment on the same line as other source -# code), it will favor attaching to the nearest location that occurs before -# the comment. Otherwise it will favor attaching to the nearest location -# that is after the comment. +# def a(**nil) +# ^^^^^ +# end # -# source://prism//lib/prism/parse_result/comments.rb#19 -class Prism::ParseResult::Comments - # Create a new Comments object that will attach comments to the given - # parse result. +# source://prism//lib/prism/node.rb#13928 +class Prism::NoKeywordsParameterNode < ::Prism::Node + # def initialize: (Location operator_loc, Location keyword_loc, Location location) -> void # - # @return [Comments] a new instance of Comments + # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode # - # source://prism//lib/prism/parse_result/comments.rb#78 - def initialize(parse_result); end + # source://prism//lib/prism/node.rb#13930 + sig do + params( + source: Prism::Source, + operator_loc: Prism::Location, + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, operator_loc, keyword_loc, location); end - # Attach the comments to their respective locations in the tree by - # mutating the parse result. + # 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/parse_result/comments.rb#84 - def attach!; end + # source://prism//lib/prism/node.rb#14030 + def ===(other); end - # The parse result that we are attaching comments to. + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/parse_result/comments.rb#74 - def parse_result; end - - private + # source://prism//lib/prism/node.rb#13939 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Responsible for finding the nearest targets to the given comment within - # the context of the given encapsulating node. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result/comments.rb#103 - def nearest_targets(node, comment); end -end + # source://prism//lib/prism/node.rb#13944 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; 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#49 -class Prism::ParseResult::Comments::LocationTarget - # @return [LocationTarget] a new instance of LocationTarget + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/parse_result/comments.rb#52 - def initialize(location); end + # source://prism//lib/prism/node.rb#13954 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # source://prism//lib/prism/parse_result/comments.rb#68 - def <<(comment); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#13949 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # @return [Boolean] + # def copy: (?operator_loc: Location, ?keyword_loc: Location, ?location: Location) -> NoKeywordsParameterNode # - # source://prism//lib/prism/parse_result/comments.rb#64 - def encloses?(comment); end + # source://prism//lib/prism/node.rb#13959 + sig do + params( + operator_loc: Prism::Location, + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::NoKeywordsParameterNode) + end + def copy(operator_loc: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end - # source://prism//lib/prism/parse_result/comments.rb#60 - def end_offset; end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#13944 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//lib/prism/parse_result/comments.rb#50 - def location; end + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, keyword_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#13967 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # source://prism//lib/prism/parse_result/comments.rb#56 - def start_offset; end -end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end -# A target for attaching comments that is based on a specific node's -# location. -# -# source://prism//lib/prism/parse_result/comments.rb#22 -class Prism::ParseResult::Comments::NodeTarget - # @return [NodeTarget] a new instance of NodeTarget + # def inspect -> String # - # source://prism//lib/prism/parse_result/comments.rb#25 - def initialize(node); end + # source://prism//lib/prism/node.rb#13996 + sig { override.returns(String) } + def inspect; end - # source://prism//lib/prism/parse_result/comments.rb#42 - def <<(comment); end + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#13991 + sig { returns(String) } + def keyword; end - # @return [Boolean] + # attr_reader keyword_loc: Location # - # source://prism//lib/prism/parse_result/comments.rb#37 - def encloses?(comment); end + # source://prism//lib/prism/node.rb#13979 + sig { returns(Prism::Location) } + def keyword_loc; end - # source://prism//lib/prism/parse_result/comments.rb#33 + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#13986 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#13972 + sig { returns(Prism::Location) } + def operator_loc; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14014 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14024 + def type; end + end +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 +class Prism::Node + abstract! + + # Accepts a visitor and calls back into the specialized visit function. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#143 + sig { abstract.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # Returns an array of child nodes, including `nil`s in the place of optional + # nodes that were not present. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#149 + sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # Returns an array of child nodes and locations that could potentially have + # comments attached to them. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#163 + sig { abstract.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end + + # Returns an array of child nodes, excluding any `nil`s in the place of + # optional nodes that were not present. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#157 + sig { abstract.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # Returns an array of child nodes, including `nil`s in the place of optional + # nodes that were not present. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#149 + sig { abstract.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # source://prism//lib/prism/node_ext.rb#7 + def deprecated(*replacements); 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#34 + sig { returns(Integer) } def end_offset; end - # source://prism//lib/prism/parse_result/comments.rb#23 - def node; end + sig { abstract.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # Returns a string representation of the node. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#174 + sig { abstract.returns(String) } + def inspect; end + + # A Location instance that represents the location of this node in the + # source. + # + # source://prism//lib/prism/node.rb#19 + sig { returns(Prism::Location) } + def location; end + + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#39 + def newline?; end + + # Similar to inspect, but respects the current level of indentation given by + # the pretty print object. + # + # source://prism//lib/prism/node.rb#74 + sig { params(q: T.untyped).void } + def pretty_print(q); 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#52 + sig { returns(T::Array[String]) } + def script_lines; end + + # source://prism//lib/prism/node.rb#43 + def set_newline_flag(newline_marked); end + + # Slice the location of the node from the source. + # + # source://prism//lib/prism/node.rb#61 + sig { returns(String) } + def slice; end + + # Slice the location of the node from the source, starting at the beginning + # 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#68 + 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#52 + sig { returns(T::Array[String]) } + def source_lines; 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#27 + sig { returns(Integer) } + def start_offset; end + + # Convert this node into a graphviz dot graph string. + # + # source://prism//lib/prism/node.rb#82 + sig { returns(String) } + def to_dot; end + + # Returns a list of nodes that are descendants of this node that contain the + # given line and column. This is useful for locating a node that is selected + # based on the line and column of the source code. + # + # 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#93 + sig { params(line: Integer, column: Integer).returns(T::Array[Prism::Node]) } + def tunnel(line, column); end + + # Returns a symbol symbolizing the type of node that this represents. This + # is particularly useful for case statements and array comparisons. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#169 + sig { abstract.returns(Symbol) } + def type; end + + private + + # A pointer to the source that this node was created from. + # + # source://prism//lib/prism/node.rb#14 + sig { returns(Prism::Source) } + def source; end + + class << self + # Returns a list of the fields that exist for this node class. Fields + # describe the structure of the node. This kind of reflection is useful for + # things like recursively visiting each node _and_ field in the tree. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#127 + def fields; end + + # Returns the type of the node as a symbol. + # + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#179 + def type; end + end +end + +# Represents an implicit set of parameters through the use of numbered parameters within a block or lambda. +# +# -> { _1 + _2 } +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14041 +class Prism::NumberedParametersNode < ::Prism::Node + # def initialize: (Integer maximum, Location location) -> void + # + # @return [NumberedParametersNode] a new instance of NumberedParametersNode + # + # source://prism//lib/prism/node.rb#14043 + sig { params(source: Prism::Source, maximum: Integer, location: Prism::Location).void } + def initialize(source, maximum, location); 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#14121 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14051 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14056 + 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#14066 + 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#14061 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?maximum: Integer, ?location: Location) -> NumberedParametersNode + # + # source://prism//lib/prism/node.rb#14071 + sig { params(maximum: Integer, location: Prism::Location).returns(Prism::NumberedParametersNode) } + def copy(maximum: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14056 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { maximum: Integer, location: Location } + # + # source://prism//lib/prism/node.rb#14079 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14087 + sig { override.returns(String) } + def inspect; end + + # attr_reader maximum: Integer + # + # source://prism//lib/prism/node.rb#14084 + sig { returns(Integer) } + def maximum; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14105 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14115 + def type; end + end +end + +# Represents reading a numbered reference to a capture in the previous match. +# +# $1 +# ^^ +# +# source://prism//lib/prism/node.rb#14131 +class Prism::NumberedReferenceReadNode < ::Prism::Node + # def initialize: (Integer number, Location location) -> void + # + # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode + # + # source://prism//lib/prism/node.rb#14133 + sig { params(source: Prism::Source, number: Integer, location: Prism::Location).void } + def initialize(source, number, location); 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#14217 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14141 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14146 + 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#14156 + 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#14151 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?number: Integer, ?location: Location) -> NumberedReferenceReadNode + # + # source://prism//lib/prism/node.rb#14161 + sig { params(number: Integer, location: Prism::Location).returns(Prism::NumberedReferenceReadNode) } + def copy(number: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14146 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { number: Integer, location: Location } + # + # source://prism//lib/prism/node.rb#14169 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14183 + sig { override.returns(String) } + def inspect; end + + # The (1-indexed, from the left) number of the capture group. Numbered references that are too large result in this value being `0`. + # + # $1 # number `1` + # + # $5432 # number `5432` + # + # $4294967296 # number `0` + # + # source://prism//lib/prism/node.rb#14180 + sig { returns(Integer) } + def number; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14201 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14211 + def type; end + end +end + +# Represents an optional keyword parameter to a method, block, or lambda definition. +# +# def a(b: 1) +# ^^^^ +# end +# +# source://prism//lib/prism/node.rb#14228 +class Prism::OptionalKeywordParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Prism::node value, Location location) -> void + # + # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode + # + # source://prism//lib/prism/node.rb#14230 + sig do + params( + source: Prism::Source, + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, flags, name, name_loc, value, location); 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#14330 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14241 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14246 + 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#14256 + 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#14251 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?value: Prism::node, ?location: Location) -> OptionalKeywordParameterNode + # + # source://prism//lib/prism/node.rb#14261 + sig do + params( + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::OptionalKeywordParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14246 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, value: Prism::node, location: Location } + # + # source://prism//lib/prism/node.rb#14269 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14296 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#14278 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#14281 + sig { returns(Prism::Location) } + def name_loc; end + + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14291 + sig { returns(T::Boolean) } + def repeated_parameter?; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14314 + sig { override.returns(Symbol) } + def type; end + + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#14288 + sig { returns(Prism::Node) } + def value; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#14274 + sig { returns(Integer) } + def flags; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14324 + def type; end + end +end + +# Represents an optional parameter to a method, block, or lambda definition. +# +# def a(b = 1) +# ^^^^^ +# end +# +# source://prism//lib/prism/node.rb#14344 +class Prism::OptionalParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Location operator_loc, Prism::node value, Location location) -> void + # + # @return [OptionalParameterNode] a new instance of OptionalParameterNode + # + # source://prism//lib/prism/node.rb#14346 + sig do + params( + source: Prism::Source, + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, flags, name, name_loc, operator_loc, value, location); 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#14459 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14358 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14363 + 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#14373 + 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#14368 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?operator_loc: Location, ?value: Prism::node, ?location: Location) -> OptionalParameterNode + # + # source://prism//lib/prism/node.rb#14378 + sig do + params( + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).returns(Prism::OptionalParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14363 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, operator_loc: Location, value: Prism::node, location: Location } + # + # source://prism//lib/prism/node.rb#14386 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14425 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#14395 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#14398 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#14420 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#14405 + sig { returns(Prism::Location) } + def operator_loc; end + + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14415 + sig { returns(T::Boolean) } + def repeated_parameter?; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14443 + sig { override.returns(Symbol) } + def type; end + + # attr_reader value: Prism::node + # + # source://prism//lib/prism/node.rb#14412 + sig { returns(Prism::Node) } + def value; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#14391 + sig { returns(Integer) } + def flags; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14453 + def type; end + end +end + +# Represents the use of the `||` operator or the `or` keyword. +# +# left or right +# ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14473 +class Prism::OrNode < ::Prism::Node + # def initialize: (Prism::node left, Prism::node right, Location operator_loc, Location location) -> void + # + # @return [OrNode] a new instance of OrNode + # + # source://prism//lib/prism/node.rb#14475 + sig do + params( + source: Prism::Source, + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, left, right, operator_loc, location); 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#14585 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14485 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14490 + 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#14500 + 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#14495 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?left: Prism::node, ?right: Prism::node, ?operator_loc: Location, ?location: Location) -> OrNode + # + # source://prism//lib/prism/node.rb#14505 + sig do + params( + left: Prism::Node, + right: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::OrNode) + end + def copy(left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14490 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Prism::node, right: Prism::node, operator_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#14513 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14551 + sig { override.returns(String) } + def inspect; end + + # Represents the left side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # + # left or right + # ^^^^ + # + # 1 || 2 + # ^ + # + # source://prism//lib/prism/node.rb#14524 + sig { returns(Prism::Node) } + def left; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#14546 + sig { returns(String) } + def operator; end + + # The location of the `or` keyword or the `||` operator. + # + # left or right + # ^^ + # + # source://prism//lib/prism/node.rb#14539 + sig { returns(Prism::Location) } + def operator_loc; end + + # Represents the right side of the expression. It can be any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # + # left || right + # ^^^^^ + # + # 1 or 2 + # ^ + # + # source://prism//lib/prism/node.rb#14533 + sig { returns(Prism::Node) } + def right; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14569 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14579 + def type; end + end +end + +# A parser for the pack template language. +# +# source://prism//lib/prism/pack.rb#6 +module Prism::Pack + class << self + def parse(_arg0, _arg1, _arg2); end + end +end + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::BER = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol) + +# A directive in the pack template language. +# +# source://prism//lib/prism/pack.rb#60 +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 + 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 + def describe; end + + # The type of endianness of the directive. + # + # source://prism//lib/prism/pack.rb#77 + def endian; end + + # The length of this directive (used for integers). + # + # source://prism//lib/prism/pack.rb#86 + def length; end + + # The length type of this directive (used for integers). + # + # source://prism//lib/prism/pack.rb#83 + def length_type; end + + # The type of signedness of the directive. + # + # source://prism//lib/prism/pack.rb#74 + def signed; end + + # The size of the directive. + # + # source://prism//lib/prism/pack.rb#80 + def size; end + + # A byteslice of the source string that this directive represents. + # + # source://prism//lib/prism/pack.rb#68 + def source; end + + # The type of the directive. + # + # source://prism//lib/prism/pack.rb#71 + def type; end + + # A symbol representing whether or not we are packing or unpacking. + # + # source://prism//lib/prism/pack.rb#65 + def variant; end + + # A symbol representing the version of Ruby. + # + # source://prism//lib/prism/pack.rb#62 + def version; end +end + +# The descriptions of the various types of endianness. +# +# source://prism//lib/prism/pack.rb#102 +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 +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 +Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol) + +# The result of parsing a pack template. +# +# source://prism//lib/prism/pack.rb#198 +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 + def initialize(directives, encoding); end + + # Provide a human-readable description of the format. + # + # source://prism//lib/prism/pack.rb#212 + def describe; end + + # A list of the directives in the template. + # + # source://prism//lib/prism/pack.rb#200 + def directives; end + + # The encoding of the template. + # + # source://prism//lib/prism/pack.rb#203 + def encoding; end +end + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#56 +Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) + +# Flags for parameter nodes. +# +# source://prism//lib/prism/node.rb#19277 +module Prism::ParameterFlags; end + +# a parameter name that has been repeated in the method signature +# +# source://prism//lib/prism/node.rb#19279 +Prism::ParameterFlags::REPEATED_PARAMETER = T.let(T.unsafe(nil), Integer) + +# Represents the list of parameters on a method, block, or lambda definition. +# +# def a(b, c, d) +# ^^^^^^^ +# end +# +# source://prism//lib/prism/node.rb#14598 +class Prism::ParametersNode < ::Prism::Node + # def initialize: (Array[RequiredParameterNode | MultiTargetNode] requireds, Array[OptionalParameterNode] optionals, RestParameterNode | ImplicitRestNode | nil rest, Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode] posts, Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode] keywords, KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil keyword_rest, BlockParameterNode? block, Location location) -> void + # + # @return [ParametersNode] a new instance of ParametersNode + # + # source://prism//lib/prism/node.rb#14600 + sig do + params( + source: Prism::Source, + requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)], + optionals: T::Array[Prism::OptionalParameterNode], + rest: T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode)), + posts: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)], + keywords: T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)], + keyword_rest: T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)), + block: T.nilable(Prism::BlockParameterNode), + location: Prism::Location + ).void + end + def initialize(source, requireds, optionals, rest, posts, keywords, keyword_rest, block, location); 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#14710 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14614 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # attr_reader block: BlockParameterNode? + # + # source://prism//lib/prism/node.rb#14673 + sig { returns(T.nilable(Prism::BlockParameterNode)) } + def block; end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14619 + 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#14637 + 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#14624 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?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?, ?location: Location) -> ParametersNode + # + # source://prism//lib/prism/node.rb#14642 + sig do + params( + requireds: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode)], + optionals: T::Array[Prism::OptionalParameterNode], + rest: T.nilable(T.any(Prism::RestParameterNode, Prism::ImplicitRestNode)), + posts: T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)], + keywords: T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)], + keyword_rest: T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode)), + block: T.nilable(Prism::BlockParameterNode), + location: Prism::Location + ).returns(Prism::ParametersNode) + end + def copy(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), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14619 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { 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?, location: Location } + # + # source://prism//lib/prism/node.rb#14650 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14676 + sig { override.returns(String) } + def inspect; end + + # attr_reader keyword_rest: KeywordRestParameterNode | ForwardingParameterNode | NoKeywordsParameterNode | nil + # + # source://prism//lib/prism/node.rb#14670 + sig do + returns(T.nilable(T.any(Prism::KeywordRestParameterNode, Prism::ForwardingParameterNode, Prism::NoKeywordsParameterNode))) + end + def keyword_rest; end + + # attr_reader keywords: Array[RequiredKeywordParameterNode | OptionalKeywordParameterNode] + # + # source://prism//lib/prism/node.rb#14667 + sig { returns(T::Array[T.any(Prism::RequiredKeywordParameterNode, Prism::OptionalKeywordParameterNode)]) } + def keywords; end + + # attr_reader optionals: Array[OptionalParameterNode] + # + # source://prism//lib/prism/node.rb#14658 + sig { returns(T::Array[Prism::OptionalParameterNode]) } + def optionals; end + + # attr_reader posts: Array[RequiredParameterNode | MultiTargetNode | KeywordRestParameterNode | NoKeywordsParameterNode | ForwardingParameterNode] + # + # source://prism//lib/prism/node.rb#14664 + sig do + returns(T::Array[T.any(Prism::RequiredParameterNode, Prism::MultiTargetNode, Prism::KeywordRestParameterNode, Prism::NoKeywordsParameterNode, Prism::ForwardingParameterNode)]) + end + def posts; end + + # attr_reader requireds: Array[RequiredParameterNode | MultiTargetNode] + # + # source://prism//lib/prism/node.rb#14655 + 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#14661 + 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#238 + sig { returns(T::Array[T.any([Symbol, Symbol], [Symbol])]) } + def signature; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14694 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14704 + def type; end + end +end + +# Represents a parenthesized expression +# +# (10 + 34) +# ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14730 +class Prism::ParenthesesNode < ::Prism::Node + # def initialize: (Prism::node? body, Location opening_loc, Location closing_loc, Location location) -> void + # + # @return [ParenthesesNode] a new instance of ParenthesesNode + # + # source://prism//lib/prism/node.rb#14732 + sig do + params( + source: Prism::Source, + body: T.nilable(Prism::Node), + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, body, opening_loc, closing_loc, location); 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#14842 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14742 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # attr_reader body: Prism::node? + # + # source://prism//lib/prism/node.rb#14781 + sig { returns(T.nilable(Prism::Node)) } + def body; end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14751 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#14803 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#14791 + sig { returns(Prism::Location) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14763 + 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#14756 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?body: Prism::node?, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> ParenthesesNode + # + # source://prism//lib/prism/node.rb#14768 + sig do + params( + body: T.nilable(Prism::Node), + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::ParenthesesNode) + end + def copy(body: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14751 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { body: Prism::node?, opening_loc: Location, closing_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#14776 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#14808 + sig { override.returns(String) } + def inspect; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#14798 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#14784 + sig { returns(Prism::Location) } + def opening_loc; end + + # source://prism//lib/prism/node.rb#14746 + def set_newline_flag(newline_marked); end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14826 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14836 + def type; end + end +end + +# This represents an error that was encountered during parsing. +# +# source://prism//lib/prism/parse_result.rb#451 +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#466 + 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#474 + 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#479 + sig { returns(String) } + def inspect; end + + # The level of this error. + # + # source://prism//lib/prism/parse_result.rb#463 + 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#460 + sig { returns(Prism::Location) } + def location; end + + # The message associated with this error. + # + # source://prism//lib/prism/parse_result.rb#457 + 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#454 + 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#610 +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#616 + sig do + params( + value: [Prism::ProgramNode, T::Array[T.untyped]], + comments: T::Array[Prism::Comment], + magic_comments: T::Array[Prism::MagicComment], + data_loc: T.nilable(Prism::Location), + errors: T::Array[Prism::ParseError], + warnings: T::Array[Prism::ParseWarning], + source: Prism::Source + ).void + end + def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end + + # Implement the hash pattern matching interface for ParseLexResult. + # + # source://prism//lib/prism/parse_result.rb#622 + 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#613 + 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#576 +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#581 + sig do + params( + value: Prism::ProgramNode, + comments: T::Array[Prism::Comment], + magic_comments: T::Array[Prism::MagicComment], + data_loc: T.nilable(Prism::Location), + errors: T::Array[Prism::ParseError], + warnings: T::Array[Prism::ParseWarning], + source: Prism::Source + ).void + end + def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end + + # Attach the list of comments to their respective locations in the tree. + # + # source://prism//lib/prism/parse_result/comments.rb#190 + def attach_comments!; end + + # Implement the hash pattern matching interface for ParseResult. + # + # source://prism//lib/prism/parse_result.rb#587 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + # Walk the tree and mark nodes that are on a new line. + # + # source://prism//lib/prism/parse_result/newlines.rb#60 + def mark_newlines!; end + + # The syntax tree that was parsed from the source code. + # + # source://prism//lib/prism/parse_result.rb#578 + sig { returns(Prism::ProgramNode) } + def value; end +end + +# When we've parsed the source, we have both the syntax tree and the list of +# comments that we found in the source. This class is responsible for +# walking the tree and finding the nearest location to attach each comment. +# +# It does this by first finding the nearest locations to each comment. +# Locations can either come from nodes directly or from location fields on +# nodes. For example, a `ClassNode` has an overall location encompassing the +# entire class, but it also has a location for the `class` keyword. +# +# Once the nearest locations are found, it determines which one to attach +# to. If it's a trailing comment (a comment on the same line as other source +# code), it will favor attaching to the nearest location that occurs before +# 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 +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 + 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 + def attach!; end + + # The parse result that we are attaching comments to. + # + # source://prism//lib/prism/parse_result/comments.rb#82 + def parse_result; end + + private + + # 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 + 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 +class Prism::ParseResult::Comments::LocationTarget + # @return [LocationTarget] a new instance of LocationTarget + # + # source://prism//lib/prism/parse_result/comments.rb#56 + def initialize(location); end + + # @return [Boolean] + # + # source://prism//lib/prism/parse_result/comments.rb#68 + def encloses?(comment); end + + # source://prism//lib/prism/parse_result/comments.rb#64 + def end_offset; end + + # source://prism//lib/prism/parse_result/comments.rb#72 + def leading_comment(comment); end + + # source://prism//lib/prism/parse_result/comments.rb#54 + def location; end + + # source://prism//lib/prism/parse_result/comments.rb#60 + def start_offset; end + + # source://prism//lib/prism/parse_result/comments.rb#76 + 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 +class Prism::ParseResult::Comments::NodeTarget + # @return [NodeTarget] a new instance of NodeTarget + # + # source://prism//lib/prism/parse_result/comments.rb#25 + def initialize(node); end + + # @return [Boolean] + # + # source://prism//lib/prism/parse_result/comments.rb#37 + def encloses?(comment); end + + # source://prism//lib/prism/parse_result/comments.rb#33 + def end_offset; end + + # source://prism//lib/prism/parse_result/comments.rb#42 + def leading_comment(comment); end + + # source://prism//lib/prism/parse_result/comments.rb#23 + def node; end + + # source://prism//lib/prism/parse_result/comments.rb#29 + def start_offset; end + + # source://prism//lib/prism/parse_result/comments.rb#46 + def trailing_comment(comment); end +end + +# The :line tracepoint event gets fired whenever the Ruby VM encounters an +# expression on a new line. The types of expressions that can trigger this +# event are: +# +# * if statements +# * unless statements +# * nodes that are children of statements lists +# +# In order to keep track of the newlines, we have a list of offsets that +# come back from the parser. We assign these offsets to the first nodes that +# we find in the tree that are on those lines. +# +# Note that the logic in this file should be kept in sync with the Java +# MarkNewlinesVisitor, since that visitor is responsible for marking the +# newlines for JRuby/TruffleRuby. +# +# source://prism//lib/prism/parse_result/newlines.rb#20 +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#22 + def initialize(newline_marked); end + + # Permit block/lambda nodes to mark newlines within themselves. + # + # source://prism//lib/prism/parse_result/newlines.rb#27 + def visit_block_node(node); end + + # Mark if/unless nodes as newlines. + # + # source://prism//lib/prism/parse_result/newlines.rb#41 + def visit_if_node(node); end + + # Permit block/lambda nodes to mark newlines within themselves. + # + # source://prism//lib/prism/parse_result/newlines.rb#27 + def visit_lambda_node(node); end + + # Permit statements lists to mark newlines within themselves. + # + # source://prism//lib/prism/parse_result/newlines.rb#49 + def visit_statements_node(node); end + + # Mark if/unless nodes as newlines. + # + # source://prism//lib/prism/parse_result/newlines.rb#41 + def visit_unless_node(node); end +end + +# This represents a warning that was encountered during parsing. +# +# source://prism//lib/prism/parse_result.rb#485 +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#500 + 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#508 + 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#513 + sig { returns(String) } + def inspect; end + + # The level of this warning. + # + # source://prism//lib/prism/parse_result.rb#497 + 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#494 + sig { returns(Prism::Location) } + def location; end + + # The message associated with this warning. + # + # source://prism//lib/prism/parse_result.rb#491 + 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#488 + sig { returns(Symbol) } + def type; end +end + +# A pattern is an object that wraps a Ruby pattern matching expression. The +# expression would normally be passed to an `in` clause within a `case` +# expression or a rightward assignment expression. For example, in the +# following snippet: +# +# case node +# in ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]] +# end +# +# the pattern is the ConstantPathNode[...] expression. +# +# The pattern gets compiled into an object that responds to #call by running +# the #compile method. This method itself will run back through Prism to +# parse the expression into a tree, then walk the tree to generate the +# necessary callable objects. For example, if you wanted to compile the +# expression above into a callable, you would: +# +# callable = Prism::Pattern.new("ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]]").compile +# callable.call(node) +# +# The callable object returned by #compile is guaranteed to respond to #call +# with a single argument, which is the node to match against. It also is +# guaranteed to respond to #===, which means it itself can be used in a `case` +# expression, as in: +# +# case node +# when callable +# end +# +# If the query given to the initializer cannot be compiled into a valid +# matcher (either because of a syntax error or because it is using syntax we +# do not yet support) then a Prism::Pattern::CompilationError will be +# raised. +# +# source://prism//lib/prism/pattern.rb#37 +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 + def initialize(query); end + + # Compile the query into a callable object that can be used to match against + # nodes. + # + # @raise [CompilationError] + # + # source://prism//lib/prism/pattern.rb#70 + def compile; end + + # The query that this pattern was initialized with. + # + # source://prism//lib/prism/pattern.rb#59 + def query; end + + # Scan the given node and all of its children for nodes that match the + # pattern. If a block is given, it will be called with each node that + # 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 + def scan(root); end + + private + + # Shortcut for combining two procs into one that returns true if both return + # true. + # + # source://prism//lib/prism/pattern.rb#102 + 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 + def combine_or(left, right); end + + # in foo | bar + # + # source://prism//lib/prism/pattern.rb#143 + def compile_alternation_pattern_node(node); end + + # in [foo, bar, baz] + # + # source://prism//lib/prism/pattern.rb#118 + def compile_array_pattern_node(node); end + + # Compile a name associated with a constant. + # + # source://prism//lib/prism/pattern.rb#168 + def compile_constant_name(node, name); end + + # in Prism::ConstantReadNode + # + # source://prism//lib/prism/pattern.rb#148 + def compile_constant_path_node(node); end + + # in ConstantReadNode + # in String + # + # source://prism//lib/prism/pattern.rb#163 + 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 + def compile_error(node); end + + # in InstanceVariableReadNode[name: Symbol] + # in { name: Symbol } + # + # source://prism//lib/prism/pattern.rb#184 + def compile_hash_pattern_node(node); end + + # in nil + # + # source://prism//lib/prism/pattern.rb#214 + 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 + def compile_node(node); end + + # in /foo/ + # + # source://prism//lib/prism/pattern.rb#219 + def compile_regular_expression_node(node); end + + # in "" + # in "foo" + # + # source://prism//lib/prism/pattern.rb#227 + def compile_string_node(node); end + + # in :+ + # in :foo + # + # source://prism//lib/prism/pattern.rb#235 + 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 +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 + def initialize(repr); end +end + +# Represents the use of the `^` operator for pinning an expression in a pattern matching expression. +# +# foo in ^(bar) +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#14854 +class Prism::PinnedExpressionNode < ::Prism::Node + # def initialize: (Prism::node expression, Location operator_loc, Location lparen_loc, Location rparen_loc, Location location) -> void + # + # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode + # + # source://prism//lib/prism/node.rb#14856 + sig do + params( + source: Prism::Source, + expression: Prism::Node, + operator_loc: Prism::Location, + lparen_loc: Prism::Location, + rparen_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, expression, operator_loc, lparen_loc, rparen_loc, location); 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#14973 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14867 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14872 + 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#14882 + 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#14877 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?expression: Prism::node, ?operator_loc: Location, ?lparen_loc: Location, ?rparen_loc: Location, ?location: Location) -> PinnedExpressionNode + # + # source://prism//lib/prism/node.rb#14887 + sig do + params( + expression: Prism::Node, + operator_loc: Prism::Location, + lparen_loc: Prism::Location, + rparen_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::PinnedExpressionNode) + end + def copy(expression: T.unsafe(nil), operator_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), rparen_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14872 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#14895 + 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#14900 + sig { returns(Prism::Node) } + def expression; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#14939 + sig { override.returns(String) } + def inspect; end + + # def lparen: () -> String + # + # source://prism//lib/prism/node.rb#14929 + sig { returns(String) } + def lparen; end + + # attr_reader lparen_loc: Location + # + # source://prism//lib/prism/node.rb#14910 + sig { returns(Prism::Location) } + def lparen_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#14924 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#14903 + sig { returns(Prism::Location) } + def operator_loc; end + + # def rparen: () -> String + # + # source://prism//lib/prism/node.rb#14934 + sig { returns(String) } + def rparen; end + + # attr_reader rparen_loc: Location + # + # source://prism//lib/prism/node.rb#14917 + sig { returns(Prism::Location) } + def rparen_loc; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14957 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14967 + def type; end + end +end + +# Represents the use of the `^` operator for pinning a variable in a pattern matching expression. +# +# foo in ^bar +# ^^^^ +# +# source://prism//lib/prism/node.rb#14986 +class Prism::PinnedVariableNode < ::Prism::Node + # def initialize: (Prism::node variable, Location operator_loc, Location location) -> void + # + # @return [PinnedVariableNode] a new instance of PinnedVariableNode + # + # source://prism//lib/prism/node.rb#14988 + sig do + params( + source: Prism::Source, + variable: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, variable, operator_loc, location); 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#15079 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14997 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15002 + 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#15012 + 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#15007 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?variable: Prism::node, ?operator_loc: Location, ?location: Location) -> PinnedVariableNode + # + # source://prism//lib/prism/node.rb#15017 + sig do + params( + variable: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::PinnedVariableNode) + end + def copy(variable: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15002 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { variable: Prism::node, operator_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#15025 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#15045 + sig { override.returns(String) } + def inspect; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#15040 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#15033 + sig { returns(Prism::Location) } + def operator_loc; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15063 + sig { override.returns(Symbol) } + def type; end + + # attr_reader variable: Prism::node + # + # source://prism//lib/prism/node.rb#15030 + sig { returns(Prism::Node) } + def variable; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15073 + def type; end + end +end + +# Represents the use of the `END` keyword. +# +# END { foo } +# ^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15090 +class Prism::PostExecutionNode < ::Prism::Node + # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void + # + # @return [PostExecutionNode] a new instance of PostExecutionNode + # + # source://prism//lib/prism/node.rb#15092 + sig do + params( + source: Prism::Source, + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, statements, keyword_loc, opening_loc, closing_loc, location); 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#15211 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15103 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15108 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#15172 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#15155 + sig { returns(Prism::Location) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15120 + 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#15113 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> PostExecutionNode + # + # source://prism//lib/prism/node.rb#15125 + sig do + params( + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::PostExecutionNode) + end + def copy(statements: T.unsafe(nil), keyword_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15108 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#15133 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#15177 + sig { override.returns(String) } + def inspect; end + + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#15162 + sig { returns(String) } + def keyword; end + + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15141 + sig { returns(Prism::Location) } + def keyword_loc; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#15167 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#15148 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#15138 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15195 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15205 + def type; end + end +end + +# Represents the use of the `BEGIN` keyword. +# +# BEGIN { foo } +# ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15224 +class Prism::PreExecutionNode < ::Prism::Node + # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void + # + # @return [PreExecutionNode] a new instance of PreExecutionNode + # + # source://prism//lib/prism/node.rb#15226 + sig do + params( + source: Prism::Source, + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, statements, keyword_loc, opening_loc, closing_loc, location); 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#15345 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15237 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15242 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#15306 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#15289 + sig { returns(Prism::Location) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15254 + 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#15247 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?statements: StatementsNode?, ?keyword_loc: Location, ?opening_loc: Location, ?closing_loc: Location, ?location: Location) -> PreExecutionNode + # + # source://prism//lib/prism/node.rb#15259 + sig do + params( + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::PreExecutionNode) + end + def copy(statements: T.unsafe(nil), keyword_loc: T.unsafe(nil), opening_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15242 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#15267 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#15311 + sig { override.returns(String) } + def inspect; end + + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#15296 + sig { returns(String) } + def keyword; end + + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15275 + sig { returns(Prism::Location) } + def keyword_loc; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#15301 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#15282 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#15272 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end + + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15329 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15339 + def type; end + end +end + +# The top level node of any parse tree. +# +# source://prism//lib/prism/node.rb#15355 +class Prism::ProgramNode < ::Prism::Node + # def initialize: (Array[Symbol] locals, StatementsNode statements, Location location) -> void + # + # @return [ProgramNode] a new instance of ProgramNode + # + # source://prism//lib/prism/node.rb#15357 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + statements: Prism::StatementsNode, + location: Prism::Location + ).void + end + def initialize(source, locals, statements, location); 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#15439 + def ===(other); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15366 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15371 + 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#15381 + 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#15376 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?locals: Array[Symbol], ?statements: StatementsNode, ?location: Location) -> ProgramNode + # + # source://prism//lib/prism/node.rb#15386 + sig do + params( + locals: T::Array[Symbol], + statements: Prism::StatementsNode, + location: Prism::Location + ).returns(Prism::ProgramNode) + end + def copy(locals: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15371 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], statements: StatementsNode, location: Location } + # + # source://prism//lib/prism/node.rb#15394 + 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 inspect -> String + # + # source://prism//lib/prism/node.rb#15405 + sig { override.returns(String) } + def inspect; end + + # attr_reader locals: Array[Symbol] + # + # source://prism//lib/prism/node.rb#15399 + sig { returns(T::Array[Symbol]) } + def locals; end + + # attr_reader statements: StatementsNode + # + # source://prism//lib/prism/node.rb#15402 + sig { returns(Prism::StatementsNode) } + def statements; end - # source://prism//lib/prism/parse_result/comments.rb#29 - def start_offset; end + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15423 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15433 + def type; end + end end -# The :line tracepoint event gets fired whenever the Ruby VM encounters an -# expression on a new line. The types of expressions that can trigger this -# event are: +# Flags for range and flip-flop nodes. # -# * if statements -# * unless statements -# * nodes that are children of statements lists +# source://prism//lib/prism/node.rb#19283 +module Prism::RangeFlags; end + +# ... operator # -# In order to keep track of the newlines, we have a list of offsets that -# come back from the parser. We assign these offsets to the first nodes that -# we find in the tree that are on those lines. +# source://prism//lib/prism/node.rb#19285 +Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) + +# Represents the use of the `..` or `...` operators. # -# Note that the logic in this file should be kept in sync with the Java -# MarkNewlinesVisitor, since that visitor is responsible for marking the -# newlines for JRuby/TruffleRuby. +# 1..2 +# ^^^^ # -# source://prism//lib/prism/parse_result/newlines.rb#20 -class Prism::ParseResult::Newlines < ::Prism::Visitor - # Create a new Newlines visitor with the given newline offsets. +# c if a =~ /left/ ... b =~ /right/ +# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15454 +class Prism::RangeNode < ::Prism::Node + # def initialize: (Integer flags, Prism::node? left, Prism::node? right, Location operator_loc, Location location) -> void # - # @return [Newlines] a new instance of Newlines + # @return [RangeNode] a new instance of RangeNode # - # source://prism//lib/prism/parse_result/newlines.rb#22 - def initialize(newline_marked); end + # source://prism//lib/prism/node.rb#15456 + sig do + params( + source: Prism::Source, + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, left, right, operator_loc, location); end - # Permit block/lambda nodes to mark newlines within themselves. + # 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/parse_result/newlines.rb#27 - def visit_block_node(node); end + # source://prism//lib/prism/node.rb#15577 + def ===(other); end - # Mark if/unless nodes as newlines. + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/parse_result/newlines.rb#41 - def visit_if_node(node); end + # source://prism//lib/prism/node.rb#15467 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Permit block/lambda nodes to mark newlines within themselves. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result/newlines.rb#27 - def visit_lambda_node(node); end + # source://prism//lib/prism/node.rb#15472 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Permit statements lists to mark newlines within themselves. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/parse_result/newlines.rb#49 - def visit_statements_node(node); end + # source://prism//lib/prism/node.rb#15485 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Mark if/unless nodes as newlines. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/parse_result/newlines.rb#41 - def visit_unless_node(node); end -end + # source://prism//lib/prism/node.rb#15477 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end -# This represents a warning that was encountered during parsing. -# -# source://prism//lib/prism/parse_result.rb#367 -class Prism::ParseWarning - # Create a new warning object with the given message and location. + # def copy: (?flags: Integer, ?left: Prism::node?, ?right: Prism::node?, ?operator_loc: Location, ?location: Location) -> RangeNode # - # @return [ParseWarning] a new instance of ParseWarning + # source://prism//lib/prism/node.rb#15490 + sig do + params( + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::RangeNode) + end + def copy(flags: T.unsafe(nil), left: T.unsafe(nil), right: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#378 - def initialize(message, location, level); end + # source://prism//lib/prism/node.rb#15472 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Implement the hash pattern matching interface for ParseWarning. + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Prism::node?, right: Prism::node?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/parse_result.rb#385 + # source://prism//lib/prism/node.rb#15498 + 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. + # def exclude_end?: () -> bool # - # source://prism//lib/prism/parse_result.rb#390 - def inspect; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15533 + sig { returns(T::Boolean) } + def exclude_end?; end - # The level of this warning. + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/parse_result.rb#375 - def level; end + # source://prism//lib/prism/node.rb#15543 + sig { override.returns(String) } + def inspect; end - # A Location object representing the location of this warning in the source. + # The left-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/parse_result.rb#372 - sig { returns(Prism::Location) } - def location; end + # 1... + # ^ + # + # hello...goodbye + # ^^^^^ + # + # source://prism//lib/prism/node.rb#15513 + sig { returns(T.nilable(Prism::Node)) } + def left; end - # The message associated with this warning. + # def operator: () -> String # - # source://prism//lib/prism/parse_result.rb#369 + # source://prism//lib/prism/node.rb#15538 sig { returns(String) } - def message; end -end + def operator; end -# A pattern is an object that wraps a Ruby pattern matching expression. The -# expression would normally be passed to an `in` clause within a `case` -# expression or a rightward assignment expression. For example, in the -# following snippet: -# -# case node -# in ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]] -# end -# -# the pattern is the ConstantPathNode[...] expression. -# -# The pattern gets compiled into an object that responds to #call by running -# the #compile method. This method itself will run back through Prism to -# parse the expression into a tree, then walk the tree to generate the -# necessary callable objects. For example, if you wanted to compile the -# expression above into a callable, you would: -# -# callable = Prism::Pattern.new("ConstantPathNode[ConstantReadNode[name: :Prism], ConstantReadNode[name: :Pattern]]").compile -# callable.call(node) -# -# The callable object returned by #compile is guaranteed to respond to #call -# with a single argument, which is the node to match against. It also is -# guaranteed to respond to #===, which means it itself can be used in a `case` -# expression, as in: -# -# case node -# when callable -# end -# -# If the query given to the initializer cannot be compiled into a valid -# matcher (either because of a syntax error or because it is using syntax we -# do not yet support) then a Prism::Pattern::CompilationError will be -# raised. -# -# source://prism//lib/prism/pattern.rb#37 -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 + # The location of the `..` or `...` operator. # - # source://prism//lib/prism/pattern.rb#63 - def initialize(query); end + # source://prism//lib/prism/node.rb#15526 + sig { returns(Prism::Location) } + def operator_loc; end - # Compile the query into a callable object that can be used to match against - # nodes. + # The right-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). # - # source://prism//lib/prism/pattern.rb#70 - def compile; end - - # The query that this pattern was initialized with. + # ..5 + # ^ # - # source://prism//lib/prism/pattern.rb#59 - def query; end + # 1...foo + # ^^^ + # If neither right-hand or left-hand side was included, this will be a MissingNode. + # + # source://prism//lib/prism/node.rb#15523 + sig { returns(T.nilable(Prism::Node)) } + def right; end - # Scan the given node and all of its children for nodes that match the - # pattern. If a block is given, it will be called with each node that - # matches the pattern. If no block is given, an enumerator will be returned - # that will yield each node that matches the pattern. + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/pattern.rb#79 - def scan(root); end + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15561 + sig { override.returns(Symbol) } + def type; end - private + protected - # Shortcut for combining two procs into one that returns true if both return - # true. + # protected attr_reader flags: Integer # - # source://prism//lib/prism/pattern.rb#95 - def combine_and(left, right); end + # source://prism//lib/prism/node.rb#15503 + sig { returns(Integer) } + def flags; end - # Shortcut for combining two procs into one that returns true if either - # returns true. + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15571 + def type; end + end +end + +# Represents a rational number literal. +# +# 1.0r +# ^^^^ +# +# source://prism//lib/prism/node.rb#15590 +class Prism::RationalNode < ::Prism::Node + # def initialize: (Prism::node numeric, Location location) -> void # - # source://prism//lib/prism/pattern.rb#101 - def combine_or(left, right); end - - # in foo | bar + # @return [RationalNode] a new instance of RationalNode # - # source://prism//lib/prism/pattern.rb#136 - def compile_alternation_pattern_node(node); end + # source://prism//lib/prism/node.rb#15592 + sig { params(source: Prism::Source, numeric: Prism::Node, location: Prism::Location).void } + def initialize(source, numeric, location); end - # in [foo, bar, baz] + # 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/pattern.rb#111 - def compile_array_pattern_node(node); end + # source://prism//lib/prism/node.rb#15670 + def ===(other); end - # in Prism::ConstantReadNode + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/pattern.rb#141 - def compile_constant_path_node(node); end + # source://prism//lib/prism/node.rb#15600 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # in ConstantReadNode - # in String + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/pattern.rb#153 - def compile_constant_read_node(node); end + # source://prism//lib/prism/node.rb#15605 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Raise an error because the given node is not supported. - # - # @raise [CompilationError] + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/pattern.rb#106 - def compile_error(node); end + # source://prism//lib/prism/node.rb#15615 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # in InstanceVariableReadNode[name: Symbol] - # in { name: Symbol } + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/pattern.rb#171 - def compile_hash_pattern_node(node); end + # source://prism//lib/prism/node.rb#15610 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # in nil + # def copy: (?numeric: Prism::node, ?location: Location) -> RationalNode # - # source://prism//lib/prism/pattern.rb#196 - def compile_nil_node(node); end + # source://prism//lib/prism/node.rb#15620 + sig { params(numeric: Prism::Node, location: Prism::Location).returns(Prism::RationalNode) } + def copy(numeric: T.unsafe(nil), location: T.unsafe(nil)); end - # Compile any kind of node. Dispatch out to the individual compilation - # methods based on the type of node. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/pattern.rb#225 - def compile_node(node); end + # source://prism//lib/prism/node.rb#15605 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # in /foo/ + # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Prism::node, location: Location } # - # source://prism//lib/prism/pattern.rb#201 - def compile_regular_expression_node(node); end + # source://prism//lib/prism/node.rb#15628 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # in "" - # in "foo" + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/pattern.rb#209 - def compile_string_node(node); end + # source://prism//lib/prism/node.rb#15636 + sig { override.returns(String) } + def inspect; end - # in :+ - # in :foo + # attr_reader numeric: Prism::node # - # source://prism//lib/prism/pattern.rb#217 - def compile_symbol_node(node); end -end + # source://prism//lib/prism/node.rb#15633 + sig { returns(Prism::Node) } + def numeric; 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 -class Prism::Pattern::CompilationError < ::StandardError - # Create a new CompilationError with the given representation of the node - # that caused the error. + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # @return [CompilationError] a new instance of CompilationError + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. # - # source://prism//lib/prism/pattern.rb#43 - def initialize(repr); end + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15654 + sig { override.returns(Symbol) } + def type; end + + # Returns the value of the node as a Ruby Rational. + # + # source://prism//lib/prism/node_ext.rb#105 + sig { returns(Rational) } + def value; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#15664 + def type; end + end end -# Represents the use of the `^` operator for pinning an expression in a pattern matching expression. +# Represents the use of the `redo` keyword. # -# foo in ^(bar) -# ^^^^^^ +# redo +# ^^^^ # -# source://prism//lib/prism/node.rb#14964 -class Prism::PinnedExpressionNode < ::Prism::Node - # def initialize: (Node expression, Location operator_loc, Location lparen_loc, Location rparen_loc, Location location) -> void +# source://prism//lib/prism/node.rb#15680 +class Prism::RedoNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode + # @return [RedoNode] a new instance of RedoNode # - # source://prism//lib/prism/node.rb#14966 - def initialize(source, expression, operator_loc, lparen_loc, rparen_loc, location); end + # source://prism//lib/prism/node.rb#15682 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); 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#15756 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#14977 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#15689 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14982 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#15694 + 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#14992 + # source://prism//lib/prism/node.rb#15704 + 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#14987 + # source://prism//lib/prism/node.rb#15699 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> PinnedExpressionNode + # def copy: (?location: Location) -> RedoNode # - # source://prism//lib/prism/node.rb#14997 - sig { params(params: T.untyped).returns(Prism::PinnedExpressionNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#15709 + sig { params(location: Prism::Location).returns(Prism::RedoNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#14982 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#15694 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#15012 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#15717 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader expression: Node - # - # source://prism//lib/prism/node.rb#15017 - sig { returns(Prism::Node) } - def expression; end - - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#15054 - def inspect(inspector = T.unsafe(nil)); end - - # def lparen: () -> String - # - # source://prism//lib/prism/node.rb#15044 - sig { returns(String) } - def lparen; end - - # attr_reader lparen_loc: Location - # - # source://prism//lib/prism/node.rb#15026 - sig { returns(Prism::Location) } - def lparen_loc; end - - # def operator: () -> String - # - # source://prism//lib/prism/node.rb#15039 - sig { returns(String) } - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//lib/prism/node.rb#15020 - sig { returns(Prism::Location) } - def operator_loc; end - - # def rparen: () -> String - # - # source://prism//lib/prism/node.rb#15049 - sig { returns(String) } - def rparen; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader rparen_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#15032 - sig { returns(Prism::Location) } - def rparen_loc; end + # source://prism//lib/prism/node.rb#15722 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -22516,7 +28055,8 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15078 + # source://prism//lib/prism/node.rb#15740 + sig { override.returns(Symbol) } def type; end class << self @@ -22527,229 +28067,405 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15088 + # source://prism//lib/prism/node.rb#15750 def type; end end end -# Represents the use of the `^` operator for pinning a variable in a pattern matching expression. +# The Reflection module provides the ability to reflect on the structure of +# the syntax tree itself, as opposed to looking at a single syntax tree. This +# is useful in metaprogramming contexts. # -# foo in ^bar -# ^^^^ +# source://prism//lib/prism/reflection.rb#13 +module Prism::Reflection + class << self + # Returns the fields for the given node. + # + # source://prism//lib/prism/reflection.rb#104 + sig { params(node: T.class_of(Prism::Node)).returns(T::Array[Prism::Reflection::Field]) } + def fields_for(node); end + end +end + +# A constant field represents a constant value on a node. Effectively, it +# represents an identifier found within the source. It resolves to a symbol +# in Ruby. +# +# source://prism//lib/prism/reflection.rb#45 +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 +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 +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 + sig { params(name: Symbol).void } + def initialize(name); end + + # The name of the field. + # + # source://prism//lib/prism/reflection.rb#18 + sig { returns(Symbol) } + def name; end +end + +# A flags field represents a bitset of flags on a node. It resolves to an +# integer in Ruby. Note that the flags cannot be accessed directly on the +# 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 +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 + 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 + sig { returns(T::Array[Symbol]) } + def flags; end +end + +# A float field represents a double-precision floating point value. It is +# 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 +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 +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 +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 +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 +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 +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 +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 +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 +class Prism::Reflection::StringField < ::Prism::Reflection::Field; end + +# Flags for regular expression and match last line nodes. +# +# source://prism//lib/prism/node.rb#19289 +module Prism::RegularExpressionFlags; end + +# n - forces the ASCII-8BIT encoding +# +# source://prism//lib/prism/node.rb#19306 +Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) + +# e - forces the EUC-JP encoding +# +# source://prism//lib/prism/node.rb#19303 +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#19294 +Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) + +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#19318 +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#19321 +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#19315 +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#19291 +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#19297 +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#19300 +Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) + +# u - forces the UTF-8 encoding +# +# source://prism//lib/prism/node.rb#19312 +Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) + +# s - forces the Windows-31J encoding +# +# source://prism//lib/prism/node.rb#19309 +Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) + +# Represents a regular expression literal with no interpolation. # -# source://prism//lib/prism/node.rb#15097 -class Prism::PinnedVariableNode < ::Prism::Node - # def initialize: (Node variable, Location operator_loc, Location location) -> void +# /foo/i +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#15765 +class Prism::RegularExpressionNode < ::Prism::Node + include ::Prism::RegularExpressionOptions + + # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void # - # @return [PinnedVariableNode] a new instance of PinnedVariableNode + # @return [RegularExpressionNode] a new instance of RegularExpressionNode # - # source://prism//lib/prism/node.rb#15099 - def initialize(source, variable, operator_loc, location); end + # source://prism//lib/prism/node.rb#15767 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); 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#15944 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15108 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#15779 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # def ascii_8bit?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15865 + sig { returns(T::Boolean) } + def ascii_8bit?; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15113 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#15784 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#15905 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#15830 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15123 + # source://prism//lib/prism/node.rb#15794 + 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#15118 + # source://prism//lib/prism/node.rb#15789 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> PinnedVariableNode + # def content: () -> String # - # source://prism//lib/prism/node.rb#15128 - sig { params(params: T.untyped).returns(Prism::PinnedVariableNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#15900 + sig { returns(String) } + def content; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#15113 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#15823 + sig { returns(Prism::Location) } + def content_loc; end - # def deconstruct_keys: (Array[Symbol] keys) -> { variable: Node, operator_loc: Location, location: Location } + # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> RegularExpressionNode # - # source://prism//lib/prism/node.rb#15141 + # source://prism//lib/prism/node.rb#15799 sig do params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).returns(Prism::RegularExpressionNode) end - def deconstruct_keys(keys); end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil), location: T.unsafe(nil)); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#15161 - def inspect(inspector = T.unsafe(nil)); end - - # def operator: () -> String + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15156 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/node.rb#15784 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # attr_reader operator_loc: Location + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#15149 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/node.rb#15807 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # def euc_jp?: () -> bool # - # def type: () -> Symbol + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15183 - def type; end + # source://prism//lib/prism/node.rb#15860 + sig { returns(T::Boolean) } + def euc_jp?; end - # attr_reader variable: Node + # def extended?: () -> bool # - # source://prism//lib/prism/node.rb#15146 - sig { returns(Prism::Node) } - def variable; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15845 + sig { returns(T::Boolean) } + def extended?; end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#15193 - def type; end - end -end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end -# Represents the use of the `END` keyword. -# -# END { foo } -# ^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#15202 -class Prism::PostExecutionNode < ::Prism::Node - # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void - # - # @return [PostExecutionNode] a new instance of PostExecutionNode + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#15204 - def initialize(source, statements, keyword_loc, opening_loc, closing_loc, location); end - - # def accept: (Visitor visitor) -> void + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15215 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#15885 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # def child_nodes: () -> Array[nil | Node] + # def forced_us_ascii_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#15220 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # def closing: () -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15289 - sig { returns(String) } - def closing; end + # source://prism//lib/prism/node.rb#15890 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # attr_reader closing_loc: Location + # def forced_utf8_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#15272 - sig { returns(Prism::Location) } - def closing_loc; end - - # def comment_targets: () -> Array[Node | Location] + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15232 - def comment_targets; end + # source://prism//lib/prism/node.rb#15880 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # def compact_child_nodes: () -> Array[Node] + # def ignore_case?: () -> bool # - # source://prism//lib/prism/node.rb#15225 - def compact_child_nodes; end - - # def copy: (**params) -> PostExecutionNode + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15237 - sig { params(params: T.untyped).returns(Prism::PostExecutionNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#15840 + sig { returns(T::Boolean) } + def ignore_case?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def inspect -> String # - # source://prism//lib/prism/node.rb#15220 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#15910 + sig { override.returns(String) } + def inspect; end - # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } + # def multi_line?: () -> bool # - # source://prism//lib/prism/node.rb#15252 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end - - # def inspect(NodeInspector inspector) -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15294 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#15850 + sig { returns(T::Boolean) } + def multi_line?; end - # def keyword: () -> String + # def once?: () -> bool # - # source://prism//lib/prism/node.rb#15279 - sig { returns(String) } - def keyword; end - - # attr_reader keyword_loc: Location + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15260 - sig { returns(Prism::Location) } - def keyword_loc; end + # source://prism//lib/prism/node.rb#15855 + sig { returns(T::Boolean) } + def once?; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#15284 + # source://prism//lib/prism/node.rb#15895 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#15266 + # source://prism//lib/prism/node.rb#15816 sig { returns(Prism::Location) } def opening_loc; end - # attr_reader statements: StatementsNode? - # - # source://prism//lib/prism/node.rb#15257 - sig { returns(T.nilable(Prism::StatementsNode)) } - def statements; end + sig { returns(Integer) } + def options; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -22766,9 +28482,40 @@ class Prism::PostExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15322 + # source://prism//lib/prism/node.rb#15928 + sig { override.returns(Symbol) } def type; end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#15837 + sig { returns(String) } + def unescaped; end + + # def utf_8?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15875 + sig { returns(T::Boolean) } + def utf_8?; end + + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15870 + sig { returns(T::Boolean) } + def windows_31j?; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#15812 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -22777,116 +28524,128 @@ class Prism::PostExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15332 + # source://prism//lib/prism/node.rb#15938 def type; end end end -# Represents the use of the `BEGIN` keyword. +# source://prism//lib/prism/node_ext.rb#17 +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#20 + def options; end +end + +# Represents a required keyword parameter to a method, block, or lambda definition. # -# BEGIN { foo } -# ^^^^^^^^^^^^^ +# def a(b: ) +# ^^ +# end # -# source://prism//lib/prism/node.rb#15341 -class Prism::PreExecutionNode < ::Prism::Node - # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void +# source://prism//lib/prism/node.rb#15959 +class Prism::RequiredKeywordParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Location location) -> void # - # @return [PreExecutionNode] a new instance of PreExecutionNode + # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15343 - def initialize(source, statements, keyword_loc, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#15961 + sig do + params( + source: Prism::Source, + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, name, name_loc, location); 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#16057 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15354 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#15971 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15359 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#15976 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//lib/prism/node.rb#15428 - sig { returns(String) } - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//lib/prism/node.rb#15411 - sig { returns(Prism::Location) } - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#15371 + # source://prism//lib/prism/node.rb#15986 + 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#15364 + # source://prism//lib/prism/node.rb#15981 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> PreExecutionNode + # def copy: (?flags: Integer, ?name: Symbol, ?name_loc: Location, ?location: Location) -> RequiredKeywordParameterNode # - # source://prism//lib/prism/node.rb#15376 - sig { params(params: T.untyped).returns(Prism::PreExecutionNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#15991 + sig do + params( + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::RequiredKeywordParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15359 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#15976 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15391 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#15999 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#15433 - def inspect(inspector = T.unsafe(nil)); end - - # def keyword: () -> String - # - # source://prism//lib/prism/node.rb#15418 - sig { returns(String) } - def keyword; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader keyword_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#15399 - sig { returns(Prism::Location) } - def keyword_loc; end + # source://prism//lib/prism/node.rb#16023 + sig { override.returns(String) } + def inspect; end - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#15423 - sig { returns(String) } - def opening; end + # source://prism//lib/prism/node.rb#16008 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//lib/prism/node.rb#15405 + # source://prism//lib/prism/node.rb#16011 sig { returns(Prism::Location) } - def opening_loc; end + def name_loc; end - # attr_reader statements: StatementsNode? + # def repeated_parameter?: () -> bool # - # source://prism//lib/prism/node.rb#15396 - sig { returns(T.nilable(Prism::StatementsNode)) } - def statements; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16018 + sig { returns(T::Boolean) } + def repeated_parameter?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -22903,9 +28662,18 @@ class Prism::PreExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15461 + # source://prism//lib/prism/node.rb#16041 + sig { override.returns(Symbol) } def type; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#16004 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -22914,83 +28682,98 @@ class Prism::PreExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15471 + # source://prism//lib/prism/node.rb#16051 def type; end end end -# The top level node of any parse tree. +# Represents a required parameter to a method, block, or lambda definition. # -# source://prism//lib/prism/node.rb#15477 -class Prism::ProgramNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, StatementsNode statements, Location location) -> void +# def a(b) +# ^ +# end +# +# source://prism//lib/prism/node.rb#16070 +class Prism::RequiredParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location location) -> void # - # @return [ProgramNode] a new instance of ProgramNode + # @return [RequiredParameterNode] a new instance of RequiredParameterNode # - # source://prism//lib/prism/node.rb#15479 - def initialize(source, locals, statements, location); end + # source://prism//lib/prism/node.rb#16072 + sig { params(source: Prism::Source, flags: Integer, name: Symbol, location: Prism::Location).void } + def initialize(source, flags, name, location); 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#16160 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15488 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16081 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15493 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16086 + 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#15503 + # source://prism//lib/prism/node.rb#16096 + 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#15498 + # source://prism//lib/prism/node.rb#16091 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ProgramNode + # def copy: (?flags: Integer, ?name: Symbol, ?location: Location) -> RequiredParameterNode # - # source://prism//lib/prism/node.rb#15508 - sig { params(params: T.untyped).returns(Prism::ProgramNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16101 + sig { params(flags: Integer, name: Symbol, location: Prism::Location).returns(Prism::RequiredParameterNode) } + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15493 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16086 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], statements: StatementsNode, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } # - # source://prism//lib/prism/node.rb#15521 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16109 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#15533 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16126 + sig { override.returns(String) } + def inspect; end - # attr_reader locals: Array[Symbol] + # attr_reader name: Symbol # - # source://prism//lib/prism/node.rb#15526 - sig { returns(T::Array[Symbol]) } - def locals; end + # source://prism//lib/prism/node.rb#16118 + sig { returns(Symbol) } + def name; end - # attr_reader statements: StatementsNode + # def repeated_parameter?: () -> bool # - # source://prism//lib/prism/node.rb#15529 - sig { returns(Prism::StatementsNode) } - def statements; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16121 + sig { returns(T::Boolean) } + def repeated_parameter?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23007,9 +28790,18 @@ class Prism::ProgramNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15555 + # source://prism//lib/prism/node.rb#16144 + sig { override.returns(Symbol) } def type; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#16114 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23018,132 +28810,125 @@ class Prism::ProgramNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15565 + # source://prism//lib/prism/node.rb#16154 def type; end end end -# Flags for range and flip-flop nodes. -# -# source://prism//lib/prism/node.rb#19310 -module Prism::RangeFlags; end - -# ... operator -# -# source://prism//lib/prism/node.rb#19312 -Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) - -# Represents the use of the `..` or `...` operators. -# -# 1..2 -# ^^^^ +# Represents an expression modified with a rescue. # -# c if a =~ /left/ ... b =~ /right/ -# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +# foo rescue nil +# ^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#15577 -class Prism::RangeNode < ::Prism::Node - # def initialize: (Integer flags, Node? left, Node? right, Location operator_loc, Location location) -> void +# source://prism//lib/prism/node.rb#16171 +class Prism::RescueModifierNode < ::Prism::Node + # def initialize: (Prism::node expression, Location keyword_loc, Prism::node rescue_expression, Location location) -> void # - # @return [RangeNode] a new instance of RangeNode + # @return [RescueModifierNode] a new instance of RescueModifierNode # - # source://prism//lib/prism/node.rb#15579 - def initialize(source, flags, left, right, operator_loc, location); end + # source://prism//lib/prism/node.rb#16173 + sig do + params( + source: Prism::Source, + expression: Prism::Node, + keyword_loc: Prism::Location, + rescue_expression: Prism::Node, + location: Prism::Location + ).void + end + def initialize(source, expression, keyword_loc, rescue_expression, location); 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#16272 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15590 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16183 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15595 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16192 + 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#15608 + # source://prism//lib/prism/node.rb#16202 + 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#15600 + # source://prism//lib/prism/node.rb#16197 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RangeNode + # def copy: (?expression: Prism::node, ?keyword_loc: Location, ?rescue_expression: Prism::node, ?location: Location) -> RescueModifierNode # - # source://prism//lib/prism/node.rb#15613 - sig { params(params: T.untyped).returns(Prism::RangeNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16207 + sig do + params( + expression: Prism::Node, + keyword_loc: Prism::Location, + rescue_expression: Prism::Node, + location: Prism::Location + ).returns(Prism::RescueModifierNode) + end + def copy(expression: T.unsafe(nil), keyword_loc: T.unsafe(nil), rescue_expression: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15595 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16192 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Prism::node, keyword_loc: Location, rescue_expression: Prism::node, location: Location } # - # source://prism//lib/prism/node.rb#15628 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16215 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def exclude_end?: () -> bool - # - # @return [Boolean] + # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#15663 - sig { returns(T::Boolean) } - def exclude_end?; end + # source://prism//lib/prism/node.rb#16220 + sig { returns(Prism::Node) } + def expression; end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#15673 - def inspect(inspector = T.unsafe(nil)); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # The left-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # def inspect -> String # - # 1... - # ^ - # - # hello...goodbye - # ^^^^^ - # - # source://prism//lib/prism/node.rb#15643 - sig { returns(T.nilable(Prism::Node)) } - def left; end + # source://prism//lib/prism/node.rb#16238 + sig { override.returns(String) } + def inspect; end - # def operator: () -> String + # def keyword: () -> String # - # source://prism//lib/prism/node.rb#15668 + # source://prism//lib/prism/node.rb#16233 sig { returns(String) } - def operator; end + def keyword; end - # The location of the `..` or `...` operator. + # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#15656 + # source://prism//lib/prism/node.rb#16223 sig { returns(Prism::Location) } - def operator_loc; end + def keyword_loc; end - # The right-hand side of the range, if present. It can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). - # - # ..5 - # ^ - # - # 1...foo - # ^^^ - # If neither right-hand or left-hand side was included, this will be a MissingNode. + # attr_reader rescue_expression: Prism::node # - # source://prism//lib/prism/node.rb#15653 - sig { returns(T.nilable(Prism::Node)) } - def right; end + # source://prism//lib/prism/node.rb#16230 + sig { returns(Prism::Node) } + def rescue_expression; end + + # source://prism//lib/prism/node.rb#16187 + def set_newline_flag(newline_marked); end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23160,17 +28945,10 @@ class Prism::RangeNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15707 + # source://prism//lib/prism/node.rb#16256 + sig { override.returns(Symbol) } def type; end - private - - # private attr_reader flags: Integer - # - # source://prism//lib/prism/node.rb#15633 - sig { returns(Integer) } - def flags; end - class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23179,80 +28957,157 @@ class Prism::RangeNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15717 + # source://prism//lib/prism/node.rb#16266 def type; end end end -# Represents a rational number literal. +# Represents a rescue statement. # -# 1.0r -# ^^^^ +# begin +# rescue Foo, *splat, Bar => ex +# foo +# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +# end # -# source://prism//lib/prism/node.rb#15726 -class Prism::RationalNode < ::Prism::Node - # def initialize: (Node numeric, Location location) -> void +# `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `exception` field. +# +# source://prism//lib/prism/node.rb#16289 +class Prism::RescueNode < ::Prism::Node + # def initialize: (Location keyword_loc, Array[Prism::node] exceptions, Location? operator_loc, Prism::node? reference, StatementsNode? statements, RescueNode? consequent, Location location) -> void # - # @return [RationalNode] a new instance of RationalNode + # @return [RescueNode] a new instance of RescueNode # - # source://prism//lib/prism/node.rb#15728 - def initialize(source, numeric, location); end + # source://prism//lib/prism/node.rb#16291 + sig do + params( + source: Prism::Source, + keyword_loc: Prism::Location, + exceptions: T::Array[Prism::Node], + operator_loc: T.nilable(Prism::Location), + reference: T.nilable(Prism::Node), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::RescueNode), + location: Prism::Location + ).void + end + def initialize(source, keyword_loc, exceptions, operator_loc, reference, statements, consequent, location); 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#16418 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15736 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16304 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15741 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16309 + 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#15751 + # source://prism//lib/prism/node.rb#16324 + 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#15746 + # source://prism//lib/prism/node.rb#16314 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RationalNode + # attr_reader consequent: RescueNode? # - # source://prism//lib/prism/node.rb#15756 - sig { params(params: T.untyped).returns(Prism::RationalNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16371 + sig { returns(T.nilable(Prism::RescueNode)) } + def consequent; end + + # def copy: (?keyword_loc: Location, ?exceptions: Array[Prism::node], ?operator_loc: Location?, ?reference: Prism::node?, ?statements: StatementsNode?, ?consequent: RescueNode?, ?location: Location) -> RescueNode + # + # source://prism//lib/prism/node.rb#16329 + sig do + params( + keyword_loc: Prism::Location, + exceptions: T::Array[Prism::Node], + operator_loc: T.nilable(Prism::Location), + reference: T.nilable(Prism::Node), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::RescueNode), + location: Prism::Location + ).returns(Prism::RescueNode) + end + def copy(keyword_loc: T.unsafe(nil), exceptions: T.unsafe(nil), operator_loc: T.unsafe(nil), reference: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15741 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16309 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, exceptions: Array[Prism::node], operator_loc: Location?, reference: Prism::node?, statements: StatementsNode?, consequent: RescueNode?, location: Location } # - # source://prism//lib/prism/node.rb#15768 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16337 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + # attr_reader exceptions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#15777 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16349 + sig { returns(T::Array[Prism::Node]) } + def exceptions; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader numeric: Node + # def inspect -> String # - # source://prism//lib/prism/node.rb#15773 - sig { returns(Prism::Node) } - def numeric; end + # source://prism//lib/prism/node.rb#16384 + sig { override.returns(String) } + def inspect; end + + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#16374 + sig { returns(String) } + def keyword; end + + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#16342 + sig { returns(Prism::Location) } + def keyword_loc; end + + # def operator: () -> String? + # + # source://prism//lib/prism/node.rb#16379 + sig { returns(T.nilable(String)) } + def operator; end + + # attr_reader operator_loc: Location? + # + # source://prism//lib/prism/node.rb#16352 + sig { returns(T.nilable(Prism::Location)) } + def operator_loc; end + + # attr_reader reference: Prism::node? + # + # source://prism//lib/prism/node.rb#16365 + sig { returns(T.nilable(Prism::Node)) } + def reference; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#16368 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23269,14 +29124,10 @@ class Prism::RationalNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15798 + # source://prism//lib/prism/node.rb#16402 + sig { override.returns(Symbol) } def type; end - # Returns the value of the node as a Ruby Rational. - # - # source://prism//lib/prism/node_ext.rb#83 - def value; end - class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23285,74 +29136,133 @@ class Prism::RationalNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15808 + # source://prism//lib/prism/node.rb#16412 def type; end end end -# Represents the use of the `redo` keyword. +# Represents a rest parameter to a method, block, or lambda definition. # -# redo -# ^^^^ +# def a(*b) +# ^^ +# end # -# source://prism//lib/prism/node.rb#15817 -class Prism::RedoNode < ::Prism::Node - # def initialize: (Location location) -> void +# source://prism//lib/prism/node.rb#16435 +class Prism::RestParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # - # @return [RedoNode] a new instance of RedoNode + # @return [RestParameterNode] a new instance of RestParameterNode # - # source://prism//lib/prism/node.rb#15819 - def initialize(source, location); end + # source://prism//lib/prism/node.rb#16437 + sig do + params( + source: Prism::Source, + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, flags, name, name_loc, operator_loc, location); 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#16552 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#15826 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16448 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15831 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16453 + 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#15841 + # source://prism//lib/prism/node.rb#16463 + 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#15836 + # source://prism//lib/prism/node.rb#16458 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RedoNode + # def copy: (?flags: Integer, ?name: Symbol?, ?name_loc: Location?, ?operator_loc: Location, ?location: Location) -> RestParameterNode # - # source://prism//lib/prism/node.rb#15846 - sig { params(params: T.untyped).returns(Prism::RedoNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16468 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::RestParameterNode) + end + def copy(flags: T.unsafe(nil), name: T.unsafe(nil), name_loc: T.unsafe(nil), operator_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15831 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16453 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#15857 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16476 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#16518 + sig { override.returns(String) } + def inspect; end + + # attr_reader name: Symbol? + # + # source://prism//lib/prism/node.rb#16485 + sig { returns(T.nilable(Symbol)) } + def name; end + + # attr_reader name_loc: Location? + # + # source://prism//lib/prism/node.rb#16488 + sig { returns(T.nilable(Prism::Location)) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#16513 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#16501 + sig { returns(Prism::Location) } + def operator_loc; end + + # def repeated_parameter?: () -> bool + # + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15863 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16508 + sig { returns(T::Boolean) } + def repeated_parameter?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23369,9 +29279,18 @@ class Prism::RedoNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#15882 + # source://prism//lib/prism/node.rb#16536 + sig { override.returns(Symbol) } def type; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#16481 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23380,244 +29299,175 @@ class Prism::RedoNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#15892 + # source://prism//lib/prism/node.rb#16546 def type; end end end -# Flags for regular expression and match last line nodes. -# -# source://prism//lib/prism/node.rb#19316 -module Prism::RegularExpressionFlags; end - -# n - forces the ASCII-8BIT encoding -# -# source://prism//lib/prism/node.rb#19333 -Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) - -# e - forces the EUC-JP encoding -# -# source://prism//lib/prism/node.rb#19330 -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#19321 -Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) - -# internal bytes forced the encoding to binary -# -# source://prism//lib/prism/node.rb#19345 -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#19348 -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#19342 -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#19318 -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#19324 -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#19327 -Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) - -# u - forces the UTF-8 encoding -# -# source://prism//lib/prism/node.rb#19339 -Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) - -# s - forces the Windows-31J encoding -# -# source://prism//lib/prism/node.rb#19336 -Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) - -# Represents a regular expression literal with no interpolation. -# -# /foo/i -# ^^^^^^ +# This represents the result of a call to ::parse or ::parse_file. It contains +# the requested structure, any comments that were encounters, and any errors +# that were encountered. # -# source://prism//lib/prism/node.rb#15901 -class Prism::RegularExpressionNode < ::Prism::Node - include ::Prism::RegularExpressionOptions - - # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void - # - # @return [RegularExpressionNode] a new instance of RegularExpressionNode - # - # source://prism//lib/prism/node.rb#15903 - def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); end - - # def accept: (Visitor visitor) -> void - # - # source://prism//lib/prism/node.rb#15915 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end - - # def ascii_8bit?: () -> bool +# source://prism//lib/prism/parse_result.rb#521 +class Prism::Result + # Create a new result object with the given values. # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#16007 - sig { returns(T::Boolean) } - def ascii_8bit?; end - - # def child_nodes: () -> Array[nil | Node] + # @return [Result] a new instance of Result # - # source://prism//lib/prism/node.rb#15920 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/parse_result.rb#543 + sig do + params( + comments: T::Array[Prism::Comment], + magic_comments: T::Array[Prism::MagicComment], + data_loc: T.nilable(Prism::Location), + errors: T::Array[Prism::ParseError], + warnings: T::Array[Prism::ParseWarning], + source: Prism::Source + ).void + end + def initialize(comments, magic_comments, data_loc, errors, warnings, source); end - # def closing: () -> String + # The list of comments that were encountered during parsing. # - # source://prism//lib/prism/node.rb#16047 - sig { returns(String) } - def closing; end + # source://prism//lib/prism/parse_result.rb#523 + sig { returns(T::Array[Prism::Comment]) } + def comments; end - # attr_reader closing_loc: Location + # An optional location that represents the location of the __END__ marker + # 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/node.rb#15972 - sig { returns(Prism::Location) } - def closing_loc; end + # source://prism//lib/prism/parse_result.rb#531 + sig { returns(T.nilable(Prism::Location)) } + def data_loc; end - # def comment_targets: () -> Array[Node | Location] + # Implement the hash pattern matching interface for Result. # - # source://prism//lib/prism/node.rb#15930 - def comment_targets; end + # source://prism//lib/prism/parse_result.rb#553 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # def compact_child_nodes: () -> Array[Node] + # Returns the encoding of the source code that was parsed. # - # source://prism//lib/prism/node.rb#15925 - def compact_child_nodes; end + # source://prism//lib/prism/parse_result.rb#558 + sig { returns(Encoding) } + def encoding; end - # def content: () -> String + # The list of errors that were generated during parsing. # - # source://prism//lib/prism/node.rb#16042 - sig { returns(String) } - def content; end + # source://prism//lib/prism/parse_result.rb#534 + sig { returns(T::Array[Prism::ParseError]) } + def errors; end - # attr_reader content_loc: Location + # Returns true if there were errors during parsing and false if there were + # not. # - # source://prism//lib/prism/node.rb#15966 - sig { returns(Prism::Location) } - def content_loc; end - - # def copy: (**params) -> RegularExpressionNode + # @return [Boolean] # - # source://prism//lib/prism/node.rb#15935 - sig { params(params: T.untyped).returns(Prism::RegularExpressionNode) } - def copy(**params); end + # source://prism//lib/prism/parse_result.rb#570 + sig { returns(T::Boolean) } + def failure?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # The list of magic comments that were encountered during parsing. # - # source://prism//lib/prism/node.rb#15920 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/parse_result.rb#526 + sig { returns(T::Array[Prism::MagicComment]) } + def magic_comments; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } + # A Source instance that represents the source code that was parsed. # - # source://prism//lib/prism/node.rb#15951 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/parse_result.rb#540 + sig { returns(Prism::Source) } + def source; end - # def euc_jp?: () -> bool + # Returns true if there were no errors during parsing and false if there + # were. # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16002 + # source://prism//lib/prism/parse_result.rb#564 sig { returns(T::Boolean) } - def euc_jp?; end + def success?; end - # def extended?: () -> bool - # - # @return [Boolean] + # The list of warnings that were generated during parsing. # - # source://prism//lib/prism/node.rb#15987 - sig { returns(T::Boolean) } - def extended?; end + # source://prism//lib/prism/parse_result.rb#537 + sig { returns(T::Array[Prism::ParseWarning]) } + def warnings; end +end - # def forced_binary_encoding?: () -> bool +# Represents the use of the `retry` keyword. +# +# retry +# ^^^^^ +# +# source://prism//lib/prism/node.rb#16565 +class Prism::RetryNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [Boolean] + # @return [RetryNode] a new instance of RetryNode # - # source://prism//lib/prism/node.rb#16027 - sig { returns(T::Boolean) } - def forced_binary_encoding?; end + # source://prism//lib/prism/node.rb#16567 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); end - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] + # 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#16032 - sig { returns(T::Boolean) } - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/node.rb#16641 + def ===(other); end - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16022 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end + # source://prism//lib/prism/node.rb#16574 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # def ignore_case?: () -> bool - # - # @return [Boolean] + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15982 - sig { returns(T::Boolean) } - def ignore_case?; end + # source://prism//lib/prism/node.rb#16579 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # def inspect(NodeInspector inspector) -> String + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16052 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16589 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # def multi_line?: () -> bool - # - # @return [Boolean] + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/node.rb#15992 - sig { returns(T::Boolean) } - def multi_line?; end + # source://prism//lib/prism/node.rb#16584 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # def once?: () -> bool + # def copy: (?location: Location) -> RetryNode # - # @return [Boolean] + # source://prism//lib/prism/node.rb#16594 + sig { params(location: Prism::Location).returns(Prism::RetryNode) } + def copy(location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#15997 - sig { returns(T::Boolean) } - def once?; end + # source://prism//lib/prism/node.rb#16579 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # def opening: () -> String + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#16037 - sig { returns(String) } - def opening; end + # source://prism//lib/prism/node.rb#16602 + 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 - # attr_reader opening_loc: Location + # def inspect -> String # - # source://prism//lib/prism/node.rb#15960 - sig { returns(Prism::Location) } - def opening_loc; end + # source://prism//lib/prism/node.rb#16607 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23634,39 +29484,10 @@ class Prism::RegularExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16077 + # source://prism//lib/prism/node.rb#16625 + sig { override.returns(Symbol) } def type; end - # attr_reader unescaped: String - # - # source://prism//lib/prism/node.rb#15978 - sig { returns(String) } - def unescaped; end - - # def utf_8?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#16017 - sig { returns(T::Boolean) } - def utf_8?; end - - # def windows_31j?: () -> bool - # - # @return [Boolean] - # - # source://prism//lib/prism/node.rb#16012 - sig { returns(T::Boolean) } - def windows_31j?; end - - private - - # private attr_reader flags: Integer - # - # source://prism//lib/prism/node.rb#15956 - sig { returns(Integer) } - def flags; end - class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23675,104 +29496,124 @@ class Prism::RegularExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16087 + # source://prism//lib/prism/node.rb#16635 def type; end end end -# source://prism//lib/prism/node_ext.rb#6 -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#9 - def options; end -end - -# Represents a required keyword parameter to a method, block, or lambda definition. +# Represents the use of the `return` keyword. # -# def a(b: ) -# ^^ -# end +# return 1 +# ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16097 -class Prism::RequiredKeywordParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol name, Location name_loc, Location location) -> void +# source://prism//lib/prism/node.rb#16650 +class Prism::ReturnNode < ::Prism::Node + # def initialize: (Integer flags, Location keyword_loc, ArgumentsNode? arguments, Location location) -> void # - # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode + # @return [ReturnNode] a new instance of ReturnNode # - # source://prism//lib/prism/node.rb#16099 - def initialize(source, flags, name, name_loc, location); end + # source://prism//lib/prism/node.rb#16652 + sig do + params( + source: Prism::Source, + flags: Integer, + keyword_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + location: Prism::Location + ).void + end + def initialize(source, flags, keyword_loc, arguments, location); 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#16755 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16109 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16662 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#16708 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16114 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16667 + 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#16124 + # source://prism//lib/prism/node.rb#16679 + 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#16119 + # source://prism//lib/prism/node.rb#16672 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RequiredKeywordParameterNode + # def copy: (?flags: Integer, ?keyword_loc: Location, ?arguments: ArgumentsNode?, ?location: Location) -> ReturnNode # - # source://prism//lib/prism/node.rb#16129 - sig { params(params: T.untyped).returns(Prism::RequiredKeywordParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16684 + sig do + params( + flags: Integer, + keyword_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + location: Prism::Location + ).returns(Prism::ReturnNode) + end + def copy(flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), arguments: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16114 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16667 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, arguments: ArgumentsNode?, location: Location } # - # source://prism//lib/prism/node.rb#16143 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16692 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#16167 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16721 + sig { override.returns(String) } + def inspect; end - # attr_reader name: Symbol + # def keyword: () -> String # - # source://prism//lib/prism/node.rb#16152 - sig { returns(Symbol) } - def name; end + # source://prism//lib/prism/node.rb#16716 + sig { returns(String) } + def keyword; end - # attr_reader name_loc: Location + # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#16155 + # source://prism//lib/prism/node.rb#16701 sig { returns(Prism::Location) } - def name_loc; end + def keyword_loc; end - # def repeated_parameter?: () -> bool + # def redundant?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#16162 + # source://prism//lib/prism/node.rb#16711 sig { returns(T::Boolean) } - def repeated_parameter?; end + def redundant?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23789,14 +29630,15 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16190 + # source://prism//lib/prism/node.rb#16739 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#16148 + # source://prism//lib/prism/node.rb#16697 sig { returns(Integer) } def flags; end @@ -23808,89 +29650,93 @@ class Prism::RequiredKeywordParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16200 + # source://prism//lib/prism/node.rb#16749 def type; end end end -# Represents a required parameter to a method, block, or lambda definition. +# Flags for return nodes. # -# def a(b) -# ^ -# end +# source://prism//lib/prism/node.rb#19325 +module Prism::ReturnNodeFlags; end + +# a return statement that is redundant because it is the last statement in a method # -# source://prism//lib/prism/node.rb#16210 -class Prism::RequiredParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol name, Location location) -> void +# source://prism//lib/prism/node.rb#19327 +Prism::ReturnNodeFlags::REDUNDANT = T.let(T.unsafe(nil), Integer) + +# Represents the `self` keyword. +# +# self +# ^^^^ +# +# source://prism//lib/prism/node.rb#16767 +class Prism::SelfNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [RequiredParameterNode] a new instance of RequiredParameterNode + # @return [SelfNode] a new instance of SelfNode # - # source://prism//lib/prism/node.rb#16212 - def initialize(source, flags, name, location); end + # source://prism//lib/prism/node.rb#16769 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); 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#16843 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16221 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16776 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16226 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16781 + 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#16236 + # source://prism//lib/prism/node.rb#16791 + 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#16231 + # source://prism//lib/prism/node.rb#16786 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RequiredParameterNode + # def copy: (?location: Location) -> SelfNode # - # source://prism//lib/prism/node.rb#16241 - sig { params(params: T.untyped).returns(Prism::RequiredParameterNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16796 + sig { params(location: Prism::Location).returns(Prism::SelfNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16226 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16781 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#16254 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16804 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#16272 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader name: Symbol - # - # source://prism//lib/prism/node.rb#16263 - sig { returns(Symbol) } - def name; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def repeated_parameter?: () -> bool - # - # @return [Boolean] + # def inspect -> String # - # source://prism//lib/prism/node.rb#16267 - sig { returns(T::Boolean) } - def repeated_parameter?; end + # source://prism//lib/prism/node.rb#16809 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -23907,17 +29753,10 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16294 + # source://prism//lib/prism/node.rb#16827 + sig { override.returns(Symbol) } def type; end - private - - # private attr_reader flags: Integer - # - # source://prism//lib/prism/node.rb#16259 - sig { returns(Integer) } - def flags; end - class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -23926,101 +29765,306 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16304 + # source://prism//lib/prism/node.rb#16837 def type; end end end -# Represents an expression modified with a rescue. +# A module responsible for deserializing parse results. +# +# source://prism//lib/prism/serialize.rb#14 +module Prism::Serialize + class << self + # Deserialize the AST represented by the given string into a parse result. + # + # source://prism//lib/prism/serialize.rb#28 + def load(input, serialized); end + + # Deserialize the tokens represented by the given string into a parse + # result. + # + # source://prism//lib/prism/serialize.rb#40 + def load_tokens(source, serialized); end + end +end + +# source://prism//lib/prism/serialize.rb#44 +class Prism::Serialize::Loader + # @return [Loader] a new instance of Loader + # + # source://prism//lib/prism/serialize.rb#80 + def initialize(source, serialized); end + + # Returns the value of attribute constant_pool. + # + # source://prism//lib/prism/serialize.rb#77 + def constant_pool; end + + # Returns the value of attribute constant_pool_offset. + # + # source://prism//lib/prism/serialize.rb#77 + def constant_pool_offset; end + + # Returns the value of attribute encoding. + # + # source://prism//lib/prism/serialize.rb#76 + def encoding; end + + # Returns the value of attribute input. + # + # source://prism//lib/prism/serialize.rb#76 + def input; end + + # Returns the value of attribute io. + # + # source://prism//lib/prism/serialize.rb#76 + def io; end + + # source://prism//lib/prism/serialize.rb#118 + def load_comments; end + + # source://prism//lib/prism/serialize.rb#104 + def load_encoding; end + + # source://prism//lib/prism/serialize.rb#95 + def load_header; end + + # source://prism//lib/prism/serialize.rb#114 + def load_line_offsets; end + + # source://prism//lib/prism/serialize.rb#433 + def load_metadata; end + + # source://prism//lib/prism/serialize.rb#467 + def load_nodes; end + + # source://prism//lib/prism/serialize.rb#481 + def load_result; end + + # source://prism//lib/prism/serialize.rb#110 + def load_start_line; end + + # source://prism//lib/prism/serialize.rb#442 + def load_tokens; end + + # source://prism//lib/prism/serialize.rb#455 + def load_tokens_result; end + + # Returns the value of attribute serialized. + # + # source://prism//lib/prism/serialize.rb#76 + def serialized; end + + # Returns the value of attribute source. + # + # source://prism//lib/prism/serialize.rb#77 + def source; end + + # Returns the value of attribute start_line. + # + # source://prism//lib/prism/serialize.rb#78 + def start_line; end + + private + + # source://prism//lib/prism/serialize.rb#567 + def load_constant(index); end + + # source://prism//lib/prism/serialize.rb#520 + def load_double; end + + # source://prism//lib/prism/serialize.rb#535 + def load_embedded_string; end + + # source://prism//lib/prism/serialize.rb#597 + def load_error_level; end + + # source://prism//lib/prism/serialize.rb#509 + def load_integer; end + + # source://prism//lib/prism/serialize.rb#551 + def load_location; end + + # source://prism//lib/prism/serialize.rb#555 + def load_location_object; end + + # source://prism//lib/prism/serialize.rb#626 + def load_node; end + + # source://prism//lib/prism/serialize.rb#592 + def load_optional_constant; end + + # source://prism//lib/prism/serialize.rb#559 + def load_optional_location; end + + # source://prism//lib/prism/serialize.rb#563 + def load_optional_location_object; end + + # source://prism//lib/prism/serialize.rb#528 + def load_optional_node; end + + # source://prism//lib/prism/serialize.rb#588 + def load_required_constant; end + + # source://prism//lib/prism/serialize.rb#539 + def load_string; end + + # source://prism//lib/prism/serialize.rb#524 + def load_uint32; end + + # source://prism//lib/prism/serialize.rb#504 + 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#490 + def load_varuint; end + + # source://prism//lib/prism/serialize.rb#612 + def load_warning_level; end +end + +# source://prism//lib/prism/serialize.rb#127 +Prism::Serialize::Loader::DIAGNOSTIC_TYPES = T.let(T.unsafe(nil), Array) + +# StringIO is synchronized and that adds a high overhead on TruffleRuby. +# +# source://prism//lib/prism/serialize.rb#72 +Prism::Serialize::Loader::FastStringIO = StringIO + +# The major version of prism that we are expecting to find in the serialized +# strings. +# +# source://prism//lib/prism/serialize.rb#17 +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 +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. # -# foo rescue nil -# ^^^^^^^^^^^^^^ +# source://prism//lib/prism/serialize.rb#25 +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/node.rb#16313 -class Prism::RescueModifierNode < ::Prism::Node - # def initialize: (Node expression, Location keyword_loc, Node rescue_expression, Location location) -> void +# source://prism//lib/prism/serialize.rb#1850 +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. +# +# C = { a: 1 } +# ^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16853 +class Prism::ShareableConstantNode < ::Prism::Node + # def initialize: (Integer flags, ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode write, Location location) -> void # - # @return [RescueModifierNode] a new instance of RescueModifierNode + # @return [ShareableConstantNode] a new instance of ShareableConstantNode # - # source://prism//lib/prism/node.rb#16315 - def initialize(source, expression, keyword_loc, rescue_expression, location); end + # source://prism//lib/prism/node.rb#16855 + sig do + params( + source: Prism::Source, + flags: Integer, + write: T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode), + location: Prism::Location + ).void + end + def initialize(source, flags, write, location); 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#16953 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16325 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16864 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16334 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16869 + 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#16344 + # source://prism//lib/prism/node.rb#16879 + 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#16339 + # source://prism//lib/prism/node.rb#16874 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RescueModifierNode + # def copy: (?flags: Integer, ?write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode, ?location: Location) -> ShareableConstantNode # - # source://prism//lib/prism/node.rb#16349 - sig { params(params: T.untyped).returns(Prism::RescueModifierNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#16884 + sig do + params( + flags: Integer, + write: T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode), + location: Prism::Location + ).returns(Prism::ShareableConstantNode) + end + def copy(flags: T.unsafe(nil), write: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16334 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16869 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node, keyword_loc: Location, rescue_expression: Node, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, write: ConstantWriteNode | ConstantAndWriteNode | ConstantOrWriteNode | ConstantOperatorWriteNode | ConstantPathWriteNode | ConstantPathAndWriteNode | ConstantPathOrWriteNode | ConstantPathOperatorWriteNode, location: Location } # - # source://prism//lib/prism/node.rb#16363 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#16892 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader expression: Node + # def experimental_copy?: () -> bool # - # source://prism//lib/prism/node.rb#16368 - sig { returns(Prism::Node) } - def expression; end - - # def inspect(NodeInspector inspector) -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16386 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16914 + sig { returns(T::Boolean) } + def experimental_copy?; end - # def keyword: () -> String + # def experimental_everything?: () -> bool # - # source://prism//lib/prism/node.rb#16381 - sig { returns(String) } - def keyword; end - - # attr_reader keyword_loc: Location + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16371 - sig { returns(Prism::Location) } - def keyword_loc; end + # source://prism//lib/prism/node.rb#16909 + sig { returns(T::Boolean) } + def experimental_everything?; end + + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader rescue_expression: Node + # def inspect -> String # - # source://prism//lib/prism/node.rb#16377 - sig { returns(Prism::Node) } - def rescue_expression; end + # source://prism//lib/prism/node.rb#16919 + sig { override.returns(String) } + def inspect; end - # source://prism//lib/prism/node.rb#16329 - def set_newline_flag(newline_marked); end + # def literal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16904 + sig { returns(T::Boolean) } + def literal?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -24037,9 +30081,26 @@ class Prism::RescueModifierNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16410 + # source://prism//lib/prism/node.rb#16937 + sig { override.returns(Symbol) } def type; end + # The constant write that should be modified with the shareability state. + # + # source://prism//lib/prism/node.rb#16901 + sig do + returns(T.any(Prism::ConstantWriteNode, Prism::ConstantAndWriteNode, Prism::ConstantOrWriteNode, Prism::ConstantOperatorWriteNode, Prism::ConstantPathWriteNode, Prism::ConstantPathAndWriteNode, Prism::ConstantPathOrWriteNode, Prism::ConstantPathOperatorWriteNode)) + end + def write; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#16897 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -24048,127 +30109,178 @@ class Prism::RescueModifierNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16420 + # source://prism//lib/prism/node.rb#16947 def type; end end end -# Represents a rescue statement. +# Flags for shareable constant nodes. # -# begin -# rescue Foo, *splat, Bar => ex -# foo -# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -# end +# source://prism//lib/prism/node.rb#19331 +module Prism::ShareableConstantNodeFlags; end + +# constant writes that should be modified with shareable constant value experimental copy # -# `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `exception` field. +# source://prism//lib/prism/node.rb#19339 +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#16434 -class Prism::RescueNode < ::Prism::Node - # def initialize: (Location keyword_loc, Array[Node] exceptions, Location? operator_loc, Node? reference, StatementsNode? statements, RescueNode? consequent, Location location) -> void +# source://prism//lib/prism/node.rb#19336 +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#19333 +Prism::ShareableConstantNodeFlags::LITERAL = T.let(T.unsafe(nil), Integer) + +# Represents a singleton class declaration involving the `class` keyword. +# +# class << self end +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16964 +class Prism::SingletonClassNode < ::Prism::Node + # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Location operator_loc, Prism::node expression, Prism::node? body, Location end_keyword_loc, Location location) -> void # - # @return [RescueNode] a new instance of RescueNode + # @return [SingletonClassNode] a new instance of SingletonClassNode # - # source://prism//lib/prism/node.rb#16436 - def initialize(source, keyword_loc, exceptions, operator_loc, reference, statements, consequent, location); end + # source://prism//lib/prism/node.rb#16966 + sig do + params( + source: Prism::Source, + locals: T::Array[Symbol], + class_keyword_loc: Prism::Location, + operator_loc: Prism::Location, + expression: Prism::Node, + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(source, locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, location); 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#17094 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16449 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#16979 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader body: Prism::node? + # + # source://prism//lib/prism/node.rb#17035 + sig { returns(T.nilable(Prism::Node)) } + def body; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16454 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16984 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def class_keyword: () -> String + # + # source://prism//lib/prism/node.rb#17045 + sig { returns(String) } + def class_keyword; end + + # attr_reader class_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#17018 + sig { returns(Prism::Location) } + def class_keyword_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#16469 + # source://prism//lib/prism/node.rb#16997 + 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#16459 + # source://prism//lib/prism/node.rb#16989 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader consequent: RescueNode? - # - # source://prism//lib/prism/node.rb#16523 - sig { returns(T.nilable(Prism::RescueNode)) } - def consequent; end - - # def copy: (**params) -> RescueNode + # def copy: (?locals: Array[Symbol], ?class_keyword_loc: Location, ?operator_loc: Location, ?expression: Prism::node, ?body: Prism::node?, ?end_keyword_loc: Location, ?location: Location) -> SingletonClassNode # - # source://prism//lib/prism/node.rb#16474 - sig { params(params: T.untyped).returns(Prism::RescueNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17002 + sig do + params( + locals: T::Array[Symbol], + class_keyword_loc: Prism::Location, + operator_loc: Prism::Location, + expression: Prism::Node, + body: T.nilable(Prism::Node), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::SingletonClassNode) + end + def copy(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), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16454 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#16984 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, exceptions: Array[Node], operator_loc: Location?, reference: Node?, statements: StatementsNode?, consequent: RescueNode?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Prism::node, body: Prism::node?, end_keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#16491 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#17010 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader exceptions: Array[Node] + # def end_keyword: () -> String # - # source://prism//lib/prism/node.rb#16502 - sig { returns(T::Array[Prism::Node]) } - def exceptions; end + # source://prism//lib/prism/node.rb#17055 + sig { returns(String) } + def end_keyword; end - # def inspect(NodeInspector inspector) -> String + # attr_reader end_keyword_loc: Location # - # source://prism//lib/prism/node.rb#16537 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17038 + sig { returns(Prism::Location) } + def end_keyword_loc; end - # def keyword: () -> String + # attr_reader expression: Prism::node # - # source://prism//lib/prism/node.rb#16527 - sig { returns(String) } - def keyword; end + # source://prism//lib/prism/node.rb#17032 + sig { returns(Prism::Node) } + def expression; end - # attr_reader keyword_loc: Location - # - # source://prism//lib/prism/node.rb#16496 - sig { returns(Prism::Location) } - def keyword_loc; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def operator: () -> String? + # def inspect -> String # - # source://prism//lib/prism/node.rb#16532 - sig { returns(T.nilable(String)) } - def operator; end + # source://prism//lib/prism/node.rb#17060 + sig { override.returns(String) } + def inspect; end - # attr_reader operator_loc: Location? + # attr_reader locals: Array[Symbol] # - # source://prism//lib/prism/node.rb#16505 - sig { returns(T.nilable(Prism::Location)) } - def operator_loc; end + # source://prism//lib/prism/node.rb#17015 + sig { returns(T::Array[Symbol]) } + def locals; end - # attr_reader reference: Node? + # def operator: () -> String # - # source://prism//lib/prism/node.rb#16517 - sig { returns(T.nilable(Prism::Node)) } - def reference; end + # source://prism//lib/prism/node.rb#17050 + sig { returns(String) } + def operator; end - # attr_reader statements: StatementsNode? + # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#16520 - sig { returns(T.nilable(Prism::StatementsNode)) } - def statements; end + # source://prism//lib/prism/node.rb#17025 + sig { returns(Prism::Location) } + def operator_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -24185,7 +30297,8 @@ class Prism::RescueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16577 + # source://prism//lib/prism/node.rb#17078 + sig { override.returns(Symbol) } def type; end class << self @@ -24196,210 +30309,210 @@ class Prism::RescueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16587 + # source://prism//lib/prism/node.rb#17088 def type; end end end -# Represents a rest parameter to a method, block, or lambda definition. -# -# def a(*b) -# ^^ -# end +# This represents a source of Ruby code that has been parsed. It is used in +# conjunction with locations to allow them to resolve line numbers and source +# ranges. # -# source://prism//lib/prism/node.rb#16597 -class Prism::RestParameterNode < ::Prism::Node - # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void - # - # @return [RestParameterNode] a new instance of RestParameterNode +# source://prism//lib/prism/parse_result.rb#7 +class Prism::Source + # Create a new source object with the given source code. # - # source://prism//lib/prism/node.rb#16599 - def initialize(source, flags, name, name_loc, operator_loc, location); end - - # def accept: (Visitor visitor) -> void + # @return [Source] a new instance of Source # - # source://prism//lib/prism/node.rb#16610 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/parse_result.rb#26 + 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 - # def child_nodes: () -> Array[nil | Node] + # Return the column number in characters for the given byte offset. # - # source://prism//lib/prism/node.rb#16615 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/parse_result.rb#78 + sig { params(byte_offset: Integer).returns(Integer) } + def character_column(byte_offset); end - # def comment_targets: () -> Array[Node | Location] + # Return the character offset for the given byte offset. # - # source://prism//lib/prism/node.rb#16625 - def comment_targets; end + # source://prism//lib/prism/parse_result.rb#73 + sig { params(byte_offset: Integer).returns(Integer) } + def character_offset(byte_offset); end - # def compact_child_nodes: () -> Array[Node] + # Returns the column number in code units for the given encoding for the + # given byte offset. # - # source://prism//lib/prism/node.rb#16620 - def compact_child_nodes; end + # source://prism//lib/prism/parse_result.rb#95 + sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } + def code_units_column(byte_offset, encoding); end - # def copy: (**params) -> RestParameterNode + # Returns the offset from the start of the file for the given byte offset + # counting in code units for the given encoding. # - # source://prism//lib/prism/node.rb#16630 - sig { params(params: T.untyped).returns(Prism::RestParameterNode) } - def copy(**params); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the + # concept of code units that differs from the number of characters in other + # encodings, it is not captured here. # - # source://prism//lib/prism/node.rb#16615 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/parse_result.rb#88 + sig { params(byte_offset: Integer, encoding: Encoding).returns(Integer) } + def code_units_offset(byte_offset, encoding); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } + # Return the column number for the given byte offset. # - # source://prism//lib/prism/node.rb#16645 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/parse_result.rb#68 + sig { params(byte_offset: Integer).returns(Integer) } + def column(byte_offset); end - # def inspect(NodeInspector inspector) -> String + # 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/node.rb#16686 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/parse_result.rb#34 + sig { returns(Encoding) } + def encoding; end - # attr_reader name: Symbol? + # Binary search through the offsets to find the line number for the given + # byte offset. # - # source://prism//lib/prism/node.rb#16654 - sig { returns(T.nilable(Symbol)) } - def name; end + # source://prism//lib/prism/parse_result.rb#51 + sig { params(byte_offset: Integer).returns(Integer) } + def line(byte_offset); end - # attr_reader name_loc: Location? + # Returns the byte offset of the end of the line corresponding to the given + # byte offset. # - # source://prism//lib/prism/node.rb#16657 - sig { returns(T.nilable(Prism::Location)) } - def name_loc; end + # source://prism//lib/prism/parse_result.rb#63 + def line_end(byte_offset); end - # def operator: () -> String + # Return the byte offset of the start of the line corresponding to the given + # byte offset. # - # source://prism//lib/prism/node.rb#16681 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/parse_result.rb#57 + sig { params(byte_offset: Integer).returns(Integer) } + def line_start(byte_offset); end - # attr_reader operator_loc: Location + # Returns the lines of the source code as an array of strings. # - # source://prism//lib/prism/node.rb#16669 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/parse_result.rb#39 + sig { returns(T::Array[String]) } + def lines; end - # def repeated_parameter?: () -> bool - # - # @return [Boolean] + # The list of newline byte offsets in the source code. # - # source://prism//lib/prism/node.rb#16676 - sig { returns(T::Boolean) } - def repeated_parameter?; end - - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # source://prism//lib/prism/parse_result.rb#23 + sig { returns(T::Array[Integer]) } + def offsets; end + + # Perform a byteslice on the source code using the given byte offset and + # byte length. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/parse_result.rb#45 + sig { params(byte_offset: Integer, length: Integer).returns(String) } + def slice(byte_offset, length); end + + # The source code that this source object represents. # - # def type: () -> Symbol + # source://prism//lib/prism/parse_result.rb#17 + sig { returns(String) } + def source; end + + # The line number where this source starts. # - # source://prism//lib/prism/node.rb#16714 - def type; end + # source://prism//lib/prism/parse_result.rb#20 + sig { returns(Integer) } + def start_line; end private - # private attr_reader flags: Integer + # Binary search through the offsets to find the line number for the given + # byte offset. # - # source://prism//lib/prism/node.rb#16650 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/parse_result.rb#103 + def find_line(byte_offset); end class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. + # Create a new source object with the given source code. This method should + # be used instead of `new` and it will return either a `Source` or a + # specialized and more performant `ASCIISource` if no multibyte characters + # are present in the source code. # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#16724 - def type; end + # source://prism//lib/prism/parse_result.rb#12 + def for(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end end end -# Represents the use of the `retry` keyword. +# Represents the use of the `__ENCODING__` keyword. # -# retry -# ^^^^^ +# __ENCODING__ +# ^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#16733 -class Prism::RetryNode < ::Prism::Node +# source://prism//lib/prism/node.rb#17110 +class Prism::SourceEncodingNode < ::Prism::Node # def initialize: (Location location) -> void # - # @return [RetryNode] a new instance of RetryNode + # @return [SourceEncodingNode] a new instance of SourceEncodingNode # - # source://prism//lib/prism/node.rb#16735 + # source://prism//lib/prism/node.rb#17112 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#17186 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16742 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#17119 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16747 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17124 + 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#16757 + # source://prism//lib/prism/node.rb#17134 + 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#16752 + # source://prism//lib/prism/node.rb#17129 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> RetryNode + # def copy: (?location: Location) -> SourceEncodingNode # - # source://prism//lib/prism/node.rb#16762 - sig { params(params: T.untyped).returns(Prism::RetryNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17139 + sig { params(location: Prism::Location).returns(Prism::SourceEncodingNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16747 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17124 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#16773 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#17147 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#16779 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17152 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -24416,7 +30529,8 @@ class Prism::RetryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16798 + # source://prism//lib/prism/node.rb#17170 + sig { override.returns(Symbol) } def type; end class << self @@ -24427,187 +30541,121 @@ class Prism::RetryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#16808 + # source://prism//lib/prism/node.rb#17180 def type; end end end -# Represents the use of the `return` keyword. +# Represents the use of the `__FILE__` keyword. # -# return 1 +# __FILE__ # ^^^^^^^^ # -# source://prism//lib/prism/node.rb#16817 -class Prism::ReturnNode < ::Prism::Node - # def initialize: (Location keyword_loc, ArgumentsNode? arguments, Location location) -> void +# source://prism//lib/prism/node.rb#17195 +class Prism::SourceFileNode < ::Prism::Node + # def initialize: (Integer flags, String filepath, Location location) -> void # - # @return [ReturnNode] a new instance of ReturnNode + # @return [SourceFileNode] a new instance of SourceFileNode # - # source://prism//lib/prism/node.rb#16819 - def initialize(source, keyword_loc, arguments, location); end + # source://prism//lib/prism/node.rb#17197 + sig { params(source: Prism::Source, flags: Integer, filepath: String, location: Prism::Location).void } + def initialize(source, flags, filepath, location); end - # def accept: (Visitor visitor) -> void + # 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#16828 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#17300 + def ===(other); end - # attr_reader arguments: ArgumentsNode? + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#16874 - sig { returns(T.nilable(Prism::ArgumentsNode)) } - def arguments; end + # source://prism//lib/prism/node.rb#17206 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16833 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17211 + 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#16845 + # source://prism//lib/prism/node.rb#17221 + 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#16838 + # source://prism//lib/prism/node.rb#17216 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> ReturnNode + # def copy: (?flags: Integer, ?filepath: String, ?location: Location) -> SourceFileNode # - # source://prism//lib/prism/node.rb#16850 - sig { params(params: T.untyped).returns(Prism::ReturnNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17226 + sig { params(flags: Integer, filepath: String, location: Prism::Location).returns(Prism::SourceFileNode) } + def copy(flags: T.unsafe(nil), filepath: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#16833 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17211 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, arguments: ArgumentsNode?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, filepath: String, location: Location } # - # source://prism//lib/prism/node.rb#16863 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#17234 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#16883 - def inspect(inspector = T.unsafe(nil)); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # def keyword: () -> String + # 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#16878 + # source://prism//lib/prism/node.rb#17243 sig { returns(String) } - def keyword; end - - # attr_reader keyword_loc: Location - # - # source://prism//lib/prism/node.rb#16868 - sig { returns(Prism::Location) } - def keyword_loc; end - - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. - # - # def type: () -> Symbol - # - # source://prism//lib/prism/node.rb#16909 - def type; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#16919 - def type; end - end -end + def filepath; end -# Represents the `self` keyword. -# -# self -# ^^^^ -# -# source://prism//lib/prism/node.rb#16928 -class Prism::SelfNode < ::Prism::Node - # def initialize: (Location location) -> void - # - # @return [SelfNode] a new instance of SelfNode + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#16930 - def initialize(source, location); end - - # def accept: (Visitor visitor) -> void + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16937 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#17251 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # def child_nodes: () -> Array[nil | Node] + # def forced_utf8_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#16942 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end - - # def comment_targets: () -> Array[Node | Location] + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16952 - def comment_targets; end + # source://prism//lib/prism/node.rb#17246 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # def compact_child_nodes: () -> Array[Node] + # def frozen?: () -> bool # - # source://prism//lib/prism/node.rb#16947 - def compact_child_nodes; end - - # def copy: (**params) -> SelfNode + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16957 - sig { params(params: T.untyped).returns(Prism::SelfNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17256 + sig { returns(T::Boolean) } + def frozen?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def inspect -> String # - # source://prism//lib/prism/node.rb#16942 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#17266 + sig { override.returns(String) } + def inspect; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def mutable?: () -> bool # - # source://prism//lib/prism/node.rb#16968 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end - - # def inspect(NodeInspector inspector) -> String + # @return [Boolean] # - # source://prism//lib/prism/node.rb#16974 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17261 + sig { returns(T::Boolean) } + def mutable?; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -24624,9 +30672,18 @@ class Prism::SelfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#16993 + # source://prism//lib/prism/node.rb#17284 + sig { override.returns(Symbol) } def type; end + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#17239 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -24635,292 +30692,217 @@ class Prism::SelfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17003 + # source://prism//lib/prism/node.rb#17294 def type; end end end -# A module responsible for deserializing parse results. +# Represents the use of the `__LINE__` keyword. # -# source://prism//lib/prism/serialize.rb#23 -module Prism::Serialize - class << self - # Deserialize the AST represented by the given string into a parse result. - # - # source://prism//lib/prism/serialize.rb#37 - def load(input, serialized); end - - # Deserialize the tokens represented by the given string into a parse - # result. - # - # source://prism//lib/prism/serialize.rb#49 - def load_tokens(source, serialized); end - end -end - -# source://prism//lib/prism/serialize.rb#53 -class Prism::Serialize::Loader - # @return [Loader] a new instance of Loader - # - # source://prism//lib/prism/serialize.rb#58 - def initialize(source, serialized); end - - # Returns the value of attribute constant_pool. - # - # source://prism//lib/prism/serialize.rb#55 - def constant_pool; end - - # Returns the value of attribute constant_pool_offset. - # - # source://prism//lib/prism/serialize.rb#55 - def constant_pool_offset; end - - # Returns the value of attribute encoding. - # - # source://prism//lib/prism/serialize.rb#54 - def encoding; end - - # Returns the value of attribute input. - # - # source://prism//lib/prism/serialize.rb#54 - def input; end - - # Returns the value of attribute io. - # - # source://prism//lib/prism/serialize.rb#54 - def io; end - - # source://prism//lib/prism/serialize.rb#96 - def load_comments; end - - # source://prism//lib/prism/serialize.rb#82 - def load_encoding; end - - # source://prism//lib/prism/serialize.rb#73 - def load_header; end - - # source://prism//lib/prism/serialize.rb#92 - def load_line_offsets; end - - # source://prism//lib/prism/serialize.rb#106 - def load_metadata; end - - # source://prism//lib/prism/serialize.rb#140 - def load_nodes; end - - # source://prism//lib/prism/serialize.rb#154 - def load_result; end - - # source://prism//lib/prism/serialize.rb#88 - def load_start_line; end - - # source://prism//lib/prism/serialize.rb#115 - def load_tokens; end - - # source://prism//lib/prism/serialize.rb#128 - def load_tokens_result; end - - # Returns the value of attribute serialized. +# __LINE__ +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#17311 +class Prism::SourceLineNode < ::Prism::Node + # def initialize: (Location location) -> void # - # source://prism//lib/prism/serialize.rb#54 - def serialized; end - - # Returns the value of attribute source. + # @return [SourceLineNode] a new instance of SourceLineNode # - # source://prism//lib/prism/serialize.rb#55 - def source; end + # source://prism//lib/prism/node.rb#17313 + sig { params(source: Prism::Source, location: Prism::Location).void } + def initialize(source, location); end - # Returns the value of attribute start_line. + # 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/serialize.rb#56 - def start_line; end - - private + # source://prism//lib/prism/node.rb#17387 + def ===(other); end - # source://prism//lib/prism/serialize.rb#217 - def load_constant(index); end - - # source://prism//lib/prism/serialize.rb#193 - def load_embedded_string; end - - # source://prism//lib/prism/serialize.rb#247 - def load_error_level; end - - # source://prism//lib/prism/serialize.rb#209 - def load_location; end - - # source://prism//lib/prism/serialize.rb#274 - def load_node; end - - # source://prism//lib/prism/serialize.rb#242 - def load_optional_constant; end - - # source://prism//lib/prism/serialize.rb#213 - def load_optional_location; end - - # source://prism//lib/prism/serialize.rb#186 - def load_optional_node; end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#17320 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # source://prism//lib/prism/serialize.rb#238 - def load_required_constant; end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#17325 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//lib/prism/serialize.rb#182 - def load_serialized_length; end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#17335 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # source://prism//lib/prism/serialize.rb#197 - def load_string; end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#17330 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # source://prism//lib/prism/serialize.rb#177 - def load_varsint; end + # def copy: (?location: Location) -> SourceLineNode + # + # source://prism//lib/prism/node.rb#17340 + sig { params(location: Prism::Location).returns(Prism::SourceLineNode) } + def copy(location: T.unsafe(nil)); end - # variable-length integer using https://en.wikipedia.org/wiki/LEB128 - # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/serialize.rb#163 - def load_varuint; end + # source://prism//lib/prism/node.rb#17325 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//lib/prism/serialize.rb#260 - def load_warning_level; end -end + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#17348 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end -# The major version of prism that we are expecting to find in the serialized -# strings. -# -# source://prism//lib/prism/serialize.rb#26 -Prism::Serialize::MAJOR_VERSION = T.let(T.unsafe(nil), Integer) + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end -# The minor version of prism that we are expecting to find in the serialized -# strings. -# -# source://prism//lib/prism/serialize.rb#30 -Prism::Serialize::MINOR_VERSION = T.let(T.unsafe(nil), Integer) + # def inspect -> String + # + # source://prism//lib/prism/node.rb#17353 + sig { override.returns(String) } + def inspect; end -# The patch version of prism that we are expecting to find in the serialized -# strings. -# -# source://prism//lib/prism/serialize.rb#34 -Prism::Serialize::PATCH_VERSION = T.let(T.unsafe(nil), Integer) + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. + # + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#17371 + sig { override.returns(Symbol) } + def type; end -# The token types that can be indexed by their enum values. -# -# source://prism//lib/prism/serialize.rb#1482 -Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#17381 + def type; end + end +end -# Represents a singleton class declaration involving the `class` keyword. +# Represents the use of the splat operator. # -# class << self end -# ^^^^^^^^^^^^^^^^^ +# [*a] +# ^^ # -# source://prism//lib/prism/node.rb#17012 -class Prism::SingletonClassNode < ::Prism::Node - # def initialize: (Array[Symbol] locals, Location class_keyword_loc, Location operator_loc, Node expression, Node? body, Location end_keyword_loc, Location location) -> void +# source://prism//lib/prism/node.rb#17396 +class Prism::SplatNode < ::Prism::Node + # def initialize: (Location operator_loc, Prism::node? expression, Location location) -> void # - # @return [SingletonClassNode] a new instance of SingletonClassNode + # @return [SplatNode] a new instance of SplatNode # - # source://prism//lib/prism/node.rb#17014 - def initialize(source, locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, location); end + # source://prism//lib/prism/node.rb#17398 + sig do + params( + source: Prism::Source, + operator_loc: Prism::Location, + expression: T.nilable(Prism::Node), + location: Prism::Location + ).void + end + def initialize(source, operator_loc, expression, location); end - # def accept: (Visitor visitor) -> void + # 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#17027 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/node.rb#17491 + def ===(other); end - # attr_reader body: Node? + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17090 - sig { returns(T.nilable(Prism::Node)) } - def body; end + # source://prism//lib/prism/node.rb#17407 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17032 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17412 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def class_keyword: () -> String - # - # source://prism//lib/prism/node.rb#17100 - sig { returns(String) } - def class_keyword; end - - # attr_reader class_keyword_loc: Location - # - # source://prism//lib/prism/node.rb#17075 - sig { returns(Prism::Location) } - def class_keyword_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17045 + # source://prism//lib/prism/node.rb#17424 + 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#17037 + # source://prism//lib/prism/node.rb#17417 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> SingletonClassNode + # def copy: (?operator_loc: Location, ?expression: Prism::node?, ?location: Location) -> SplatNode # - # source://prism//lib/prism/node.rb#17050 - sig { params(params: T.untyped).returns(Prism::SingletonClassNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17429 + sig do + params( + operator_loc: Prism::Location, + expression: T.nilable(Prism::Node), + location: Prism::Location + ).returns(Prism::SplatNode) + end + def copy(operator_loc: T.unsafe(nil), expression: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17032 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17412 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Node, body: Node?, end_keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, expression: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#17067 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#17437 + 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#17110 - sig { returns(String) } - def end_keyword; end - - # attr_reader end_keyword_loc: Location - # - # source://prism//lib/prism/node.rb#17093 - sig { returns(Prism::Location) } - def end_keyword_loc; end - - # attr_reader expression: Node + # attr_reader expression: Prism::node? # - # source://prism//lib/prism/node.rb#17087 - sig { returns(Prism::Node) } + # source://prism//lib/prism/node.rb#17449 + sig { returns(T.nilable(Prism::Node)) } def expression; end - # def inspect(NodeInspector inspector) -> String - # - # source://prism//lib/prism/node.rb#17115 - def inspect(inspector = T.unsafe(nil)); end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # attr_reader locals: Array[Symbol] + # def inspect -> String # - # source://prism//lib/prism/node.rb#17072 - sig { returns(T::Array[Symbol]) } - def locals; end + # source://prism//lib/prism/node.rb#17457 + sig { override.returns(String) } + def inspect; end # def operator: () -> String # - # source://prism//lib/prism/node.rb#17105 + # source://prism//lib/prism/node.rb#17452 sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//lib/prism/node.rb#17081 + # source://prism//lib/prism/node.rb#17442 sig { returns(Prism::Location) } def operator_loc; end @@ -24939,7 +30921,8 @@ class Prism::SingletonClassNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17146 + # source://prism//lib/prism/node.rb#17475 + sig { override.returns(Symbol) } def type; end class << self @@ -24950,165 +30933,320 @@ class Prism::SingletonClassNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17156 + # source://prism//lib/prism/node.rb#17485 def type; end end end -# This represents a source of Ruby code that has been parsed. It is used in -# conjunction with locations to allow them to resolve line numbers and source -# ranges. +# Represents a set of statements contained within some scope. # -# source://prism//lib/prism/parse_result.rb#7 -class Prism::Source - # Create a new source object with the given source code. +# foo; bar; baz +# ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#17502 +class Prism::StatementsNode < ::Prism::Node + # def initialize: (Array[Prism::node] body, Location location) -> void # - # @return [Source] a new instance of Source + # @return [StatementsNode] a new instance of StatementsNode # - # source://prism//lib/prism/parse_result.rb#18 - def initialize(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17504 + sig { params(source: Prism::Source, body: T::Array[Prism::Node], location: Prism::Location).void } + def initialize(source, body, location); end - # Return the column number in characters for the given byte offset. + # 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/parse_result.rb#53 - def character_column(byte_offset); end + # source://prism//lib/prism/node.rb#17582 + def ===(other); end - # Return the character offset for the given byte offset. + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/parse_result.rb#48 - def character_offset(byte_offset); end + # source://prism//lib/prism/node.rb#17512 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } + def accept(visitor); end - # Returns the column number in code units for the given encoding for the - # given byte offset. + # attr_reader body: Array[Prism::node] # - # source://prism//lib/prism/parse_result.rb#70 - def code_units_column(byte_offset, encoding); end + # source://prism//lib/prism/node.rb#17545 + sig { returns(T::Array[Prism::Node]) } + def body; end - # Returns the offset from the start of the file for the given byte offset - # counting in code units for the given encoding. - # - # This method is tested with UTF-8, UTF-16, and UTF-32. If there is the - # concept of code units that differs from the number of characters in other - # encodings, it is not captured here. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#63 - def code_units_offset(byte_offset, encoding); end + # source://prism//lib/prism/node.rb#17517 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Return the column number for the given byte offset. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/parse_result.rb#43 - def column(byte_offset); end + # source://prism//lib/prism/node.rb#17527 + sig { override.returns(T::Array[T.any(Prism::Node, Prism::Location)]) } + def comment_targets; end - # Binary search through the offsets to find the line number for the given - # byte offset. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//lib/prism/parse_result.rb#32 - def line(byte_offset); end - - sig { params(value: Integer).returns(Integer) } - def line_offset(value); end + # source://prism//lib/prism/node.rb#17522 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # Return the byte offset of the start of the line corresponding to the given - # byte offset. + # def copy: (?body: Array[Prism::node], ?location: Location) -> StatementsNode # - # source://prism//lib/prism/parse_result.rb#38 - def line_start(byte_offset); end + # source://prism//lib/prism/node.rb#17532 + sig { params(body: T::Array[Prism::Node], location: Prism::Location).returns(Prism::StatementsNode) } + def copy(body: T.unsafe(nil), location: T.unsafe(nil)); end - # The list of newline byte offsets in the source code. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/parse_result.rb#15 - sig { returns(T::Array[Integer]) } - def offsets; end + # source://prism//lib/prism/node.rb#17517 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Perform a byteslice on the source code using the given byte offset and - # byte length. + # def deconstruct_keys: (Array[Symbol] keys) -> { body: Array[Prism::node], location: Location } # - # source://prism//lib/prism/parse_result.rb#26 - def slice(byte_offset, length); end + # source://prism//lib/prism/node.rb#17540 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end - # The source code that this source object represents. - # - # source://prism//lib/prism/parse_result.rb#9 - sig { returns(String) } - def source; end + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end - # The line number where this source starts. + # def inspect -> String # - # source://prism//lib/prism/parse_result.rb#12 - def start_line; end - - private + # source://prism//lib/prism/node.rb#17548 + sig { override.returns(String) } + def inspect; end - # Binary search through the offsets to find the line number for the given - # byte offset. + # Sometimes you want to check an instance of a node against a list of + # classes to see what kind of behavior to perform. Usually this is done by + # calling `[cls1, cls2].include?(node.class)` or putting the node into a + # case statement and doing `case node; when cls1; when cls2; end`. Both of + # these approaches are relatively slow because of the constant lookups, + # method calls, and/or array allocations. # - # source://prism//lib/prism/parse_result.rb#78 - def find_line(byte_offset); end + # Instead, you can call #type, which will return to you a symbol that you + # can use for comparison. This is faster than the other approaches because + # it uses a single integer comparison, but also because if you're on CRuby + # you can take advantage of the fact that case statements with all symbol + # keys will use a jump table. + # + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#17566 + sig { override.returns(Symbol) } + def type; end + + class << self + # Similar to #type, this method returns a symbol that you can use for + # splitting on the type of the node without having to do a long === chain. + # Note that like #type, it will still be slower than using == for a single + # class, but should be faster in a case statement or an array comparison. + # + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#17576 + def type; end + end end -# Represents the use of the `__ENCODING__` keyword. +# Flags for string nodes. +# +# source://prism//lib/prism/node.rb#19343 +module Prism::StringFlags; end + +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#19348 +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#19345 +Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + +# source://prism//lib/prism/node.rb#19351 +Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer) + +# source://prism//lib/prism/node.rb#19354 +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. +# +# "foo" +# ^^^^^ # -# __ENCODING__ -# ^^^^^^^^^^^^ +# %w[foo] +# ^^^ # -# source://prism//lib/prism/node.rb#17165 -class Prism::SourceEncodingNode < ::Prism::Node - # def initialize: (Location location) -> void +# "foo #{bar} baz" +# ^^^^ ^^^^ +# +# source://prism//lib/prism/node.rb#17599 +class Prism::StringNode < ::Prism::Node + include ::Prism::HeredocQuery + + # def initialize: (Integer flags, Location? opening_loc, Location content_loc, Location? closing_loc, String unescaped, Location location) -> void # - # @return [SourceEncodingNode] a new instance of SourceEncodingNode + # @return [StringNode] a new instance of StringNode # - # source://prism//lib/prism/node.rb#17167 - def initialize(source, location); end + # source://prism//lib/prism/node.rb#17601 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: T.nilable(Prism::Location), + content_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + unescaped: String, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); 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#17755 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17174 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#17613 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17179 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17618 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#17716 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#17670 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17189 + # source://prism//lib/prism/node.rb#17628 + 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#17184 + # source://prism//lib/prism/node.rb#17623 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> SourceEncodingNode + # def content: () -> String # - # source://prism//lib/prism/node.rb#17194 - sig { params(params: T.untyped).returns(Prism::SourceEncodingNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17711 + sig { returns(String) } + def content; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#17179 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#17663 + sig { returns(Prism::Location) } + def content_loc; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def copy: (?flags: Integer, ?opening_loc: Location?, ?content_loc: Location, ?closing_loc: Location?, ?unescaped: String, ?location: Location) -> StringNode # - # source://prism//lib/prism/node.rb#17205 + # source://prism//lib/prism/node.rb#17633 sig do params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) + flags: Integer, + opening_loc: T.nilable(Prism::Location), + content_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + unescaped: String, + location: Prism::Location + ).returns(Prism::StringNode) end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#17618 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String, location: Location } + # + # source://prism//lib/prism/node.rb#17641 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def forced_binary_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#17211 - def inspect(inspector = T.unsafe(nil)); end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#17691 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end + + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#17686 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end + + # def frozen?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#17696 + sig { returns(T::Boolean) } + def frozen?; end + + sig { returns(T::Boolean) } + def heredoc?; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#17721 + sig { override.returns(String) } + def inspect; end + + # def mutable?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#17701 + sig { returns(T::Boolean) } + def mutable?; end + + # def opening: () -> String? + # + # source://prism//lib/prism/node.rb#17706 + sig { returns(T.nilable(String)) } + def opening; end + + # attr_reader opening_loc: Location? + # + # source://prism//lib/prism/node.rb#17650 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; 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#66 + sig { returns(Prism::InterpolatedStringNode) } + def to_interpolated; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -25125,9 +31263,24 @@ class Prism::SourceEncodingNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17230 + # source://prism//lib/prism/node.rb#17739 + sig { override.returns(Symbol) } def type; end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#17683 + sig { returns(String) } + def unescaped; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#17646 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -25136,80 +31289,153 @@ class Prism::SourceEncodingNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17240 + # source://prism//lib/prism/node.rb#17749 def type; end end end -# Represents the use of the `__FILE__` keyword. +# Represents the use of the `super` keyword with parentheses or arguments. # -# __FILE__ -# ^^^^^^^^ +# super() +# ^^^^^^^ # -# source://prism//lib/prism/node.rb#17249 -class Prism::SourceFileNode < ::Prism::Node - # def initialize: (String filepath, Location location) -> void +# super foo, bar +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#17772 +class Prism::SuperNode < ::Prism::Node + # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Prism::node? block, Location location) -> void # - # @return [SourceFileNode] a new instance of SourceFileNode + # @return [SuperNode] a new instance of SuperNode # - # source://prism//lib/prism/node.rb#17251 - def initialize(source, filepath, location); end + # source://prism//lib/prism/node.rb#17774 + sig do + params( + source: Prism::Source, + keyword_loc: Prism::Location, + lparen_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + rparen_loc: T.nilable(Prism::Location), + block: T.nilable(Prism::Node), + location: Prism::Location + ).void + end + def initialize(source, keyword_loc, lparen_loc, arguments, rparen_loc, block, location); 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#17910 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17259 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#17786 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#17842 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + + # attr_reader block: Prism::node? + # + # source://prism//lib/prism/node.rb#17858 + sig { returns(T.nilable(Prism::Node)) } + def block; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17264 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17791 + 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#17274 + # source://prism//lib/prism/node.rb#17804 + 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#17269 + # source://prism//lib/prism/node.rb#17796 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> SourceFileNode + # def copy: (?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?block: Prism::node?, ?location: Location) -> SuperNode # - # source://prism//lib/prism/node.rb#17279 - sig { params(params: T.untyped).returns(Prism::SourceFileNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#17809 + sig do + params( + keyword_loc: Prism::Location, + lparen_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + rparen_loc: T.nilable(Prism::Location), + block: T.nilable(Prism::Node), + location: Prism::Location + ).returns(Prism::SuperNode) + end + def copy(keyword_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), arguments: T.unsafe(nil), rparen_loc: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17264 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17791 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { filepath: String, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: Prism::node?, location: Location } # - # source://prism//lib/prism/node.rb#17291 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#17817 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # attr_reader filepath: String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String + # + # source://prism//lib/prism/node.rb#17876 + sig { override.returns(String) } + def inspect; end + + # def keyword: () -> String # - # source://prism//lib/prism/node.rb#17296 + # source://prism//lib/prism/node.rb#17861 sig { returns(String) } - def filepath; end + def keyword; end - # def inspect(NodeInspector inspector) -> String + # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#17300 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17822 + sig { returns(Prism::Location) } + def keyword_loc; end + + # def lparen: () -> String? + # + # source://prism//lib/prism/node.rb#17866 + sig { returns(T.nilable(String)) } + def lparen; end + + # attr_reader lparen_loc: Location? + # + # source://prism//lib/prism/node.rb#17829 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end + + # def rparen: () -> String? + # + # source://prism//lib/prism/node.rb#17871 + sig { returns(T.nilable(String)) } + def rparen; end + + # attr_reader rparen_loc: Location? + # + # source://prism//lib/prism/node.rb#17845 + sig { returns(T.nilable(Prism::Location)) } + def rparen_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -25226,7 +31452,8 @@ class Prism::SourceFileNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17320 + # source://prism//lib/prism/node.rb#17894 + sig { override.returns(Symbol) } def type; end class << self @@ -25237,74 +31464,173 @@ class Prism::SourceFileNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17330 + # source://prism//lib/prism/node.rb#17904 def type; end end end -# Represents the use of the `__LINE__` keyword. +# Flags for symbol nodes. # -# __LINE__ -# ^^^^^^^^ +# source://prism//lib/prism/node.rb#19358 +module Prism::SymbolFlags; end + +# internal bytes forced the encoding to binary # -# source://prism//lib/prism/node.rb#17339 -class Prism::SourceLineNode < ::Prism::Node - # def initialize: (Location location) -> void +# source://prism//lib/prism/node.rb#19363 +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#19366 +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#19360 +Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + +# Represents a symbol literal or a symbol contained within a `%i` list. +# +# :foo +# ^^^^ +# +# %i[foo] +# ^^^ +# +# source://prism//lib/prism/node.rb#17927 +class Prism::SymbolNode < ::Prism::Node + # def initialize: (Integer flags, Location? opening_loc, Location? value_loc, Location? closing_loc, String unescaped, Location location) -> void # - # @return [SourceLineNode] a new instance of SourceLineNode + # @return [SymbolNode] a new instance of SymbolNode # - # source://prism//lib/prism/node.rb#17341 - def initialize(source, location); end + # source://prism//lib/prism/node.rb#17929 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: T.nilable(Prism::Location), + value_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + unescaped: String, + location: Prism::Location + ).void + end + def initialize(source, flags, opening_loc, value_loc, closing_loc, unescaped, location); 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#18084 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#17348 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#17941 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#17353 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#17946 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#18045 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#18004 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#17363 - def comment_targets; end + # source://prism//lib/prism/node.rb#17956 + 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#17951 + sig { override.returns(T::Array[Prism::Node]) } + def compact_child_nodes; end + + # def copy: (?flags: Integer, ?opening_loc: Location?, ?value_loc: Location?, ?closing_loc: Location?, ?unescaped: String, ?location: Location) -> SymbolNode + # + # source://prism//lib/prism/node.rb#17961 + sig do + params( + flags: Integer, + opening_loc: T.nilable(Prism::Location), + value_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + unescaped: String, + location: Prism::Location + ).returns(Prism::SymbolNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), value_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil), location: T.unsafe(nil)); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#17946 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String, location: Location } + # + # source://prism//lib/prism/node.rb#17969 + 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 forced_binary_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#18025 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # def compact_child_nodes: () -> Array[Node] + # def forced_us_ascii_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#17358 - def compact_child_nodes; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#18030 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # def copy: (**params) -> SourceLineNode + # def forced_utf8_encoding?: () -> bool # - # source://prism//lib/prism/node.rb#17368 - sig { params(params: T.untyped).returns(Prism::SourceLineNode) } - def copy(**params); end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#18020 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def inspect -> String # - # source://prism//lib/prism/node.rb#17353 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/node.rb#18050 + sig { override.returns(String) } + def inspect; end - # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # def opening: () -> String? # - # source://prism//lib/prism/node.rb#17379 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/node.rb#18035 + sig { returns(T.nilable(String)) } + def opening; end - # def inspect(NodeInspector inspector) -> String + # attr_reader opening_loc: Location? # - # source://prism//lib/prism/node.rb#17385 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#17978 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -25321,9 +31647,36 @@ class Prism::SourceLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#17404 + # source://prism//lib/prism/node.rb#18068 + sig { override.returns(Symbol) } def type; end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#18017 + sig { returns(String) } + def unescaped; end + + # def value: () -> String? + # + # source://prism//lib/prism/node.rb#18040 + sig { returns(T.nilable(String)) } + def value; end + + # attr_reader value_loc: Location? + # + # source://prism//lib/prism/node.rb#17991 + sig { returns(T.nilable(Prism::Location)) } + def value_loc; end + + protected + + # protected attr_reader flags: Integer + # + # source://prism//lib/prism/node.rb#17974 + sig { returns(Integer) } + def flags; end + class << self # Similar to #type, this method returns a symbol that you can use for # splitting on the type of the node without having to do a long === chain. @@ -25332,2375 +31685,2496 @@ class Prism::SourceLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#17414 + # source://prism//lib/prism/node.rb#18078 def type; end end end -# Represents the use of the splat operator. +# This represents a token from the Ruby source. # -# [*a] -# ^^ +# source://prism//lib/prism/parse_result.rb#628 +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#640 + 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#675 + 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#648 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } + def deconstruct_keys(keys); end + + # A Location object representing the location of this token in the source. + # + # source://prism//lib/prism/parse_result.rb#653 + sig { returns(Prism::Location) } + def location; end + + # Implement the pretty print interface for Token. + # + # source://prism//lib/prism/parse_result.rb#660 + 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#634 + sig { returns(Symbol) } + def type; end + + # A byteslice of the source that this token represents. + # + # source://prism//lib/prism/parse_result.rb#637 + sig { returns(String) } + def value; end + + private + + # The Source object that represents the source this token came from. + # + # source://prism//lib/prism/parse_result.rb#630 + sig { returns(Prism::Source) } + def source; end +end + +# This module is responsible for converting the prism syntax tree into other +# syntax trees. # -# source://prism//lib/prism/node.rb#17423 -class Prism::SplatNode < ::Prism::Node - # def initialize: (Location operator_loc, Node? expression, Location location) -> void +# source://prism//lib/prism/translation.rb#6 +module Prism::Translation; end + +# This class is the entry-point for converting a prism syntax tree into the +# whitequark/parser gem's syntax tree. It inherits from the base parser for +# the parser gem, and overrides the parse* methods to parse with prism and +# then translate. +# +# source://prism//lib/prism/translation/parser.rb#11 +class Prism::Translation::Parser < ::Parser::Base + # The default encoding for Ruby files is UTF-8. # - # @return [SplatNode] a new instance of SplatNode + # source://prism//lib/prism/translation/parser.rb#36 + def default_encoding; end + + # Parses a source buffer and returns the AST. # - # source://prism//lib/prism/node.rb#17425 - def initialize(source, operator_loc, expression, location); end + # source://prism//lib/prism/translation/parser.rb#44 + def parse(source_buffer); end - # def accept: (Visitor visitor) -> void + # Parses a source buffer and returns the AST and the source code comments. # - # source://prism//lib/prism/node.rb#17434 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/translation/parser.rb#57 + def parse_with_comments(source_buffer); end - # def child_nodes: () -> Array[nil | Node] + # Parses a source buffer and returns the AST, the source code comments, + # and the tokens emitted by the lexer. # - # source://prism//lib/prism/node.rb#17439 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/translation/parser.rb#74 + def tokenize(source_buffer, recover = T.unsafe(nil)); end - # def comment_targets: () -> Array[Node | Location] + # Since prism resolves num params for us, we don't need to support this + # kind of logic here. # - # source://prism//lib/prism/node.rb#17451 - def comment_targets; end + # source://prism//lib/prism/translation/parser.rb#100 + def try_declare_numparam(node); end - # def compact_child_nodes: () -> Array[Node] + # source://prism//lib/prism/translation/parser.rb#31 + sig { overridable.returns(Integer) } + def version; end + + # source://prism//lib/prism/translation/parser.rb#40 + def yyerror; end + + private + + # Build the parser gem AST from the prism AST. # - # source://prism//lib/prism/node.rb#17444 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser.rb#258 + def build_ast(program, offset_cache); end - # def copy: (**params) -> SplatNode + # Build the parser gem comments from the prism comments. # - # source://prism//lib/prism/node.rb#17456 - sig { params(params: T.untyped).returns(Prism::SplatNode) } - def copy(**params); end + # source://prism//lib/prism/translation/parser.rb#263 + def build_comments(comments, offset_cache); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Prism deals with offsets in bytes, while the parser gem deals with + # offsets in characters. We need to handle this conversion in order to + # build the parser gem AST. # - # source://prism//lib/prism/node.rb#17439 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # If the bytesize of the source is the same as the length, then we can + # 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#241 + def build_offset_cache(source); end - # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, expression: Node?, location: Location } + # Build a range from a prism location. # - # source://prism//lib/prism/node.rb#17469 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser.rb#275 + def build_range(location, offset_cache); end - # attr_reader expression: Node? + # Build the parser gem tokens from the prism tokens. # - # source://prism//lib/prism/node.rb#17480 - sig { returns(T.nilable(Prism::Node)) } - def expression; end + # source://prism//lib/prism/translation/parser.rb#270 + def build_tokens(tokens, offset_cache); end - # def inspect(NodeInspector inspector) -> String + # Converts the version format handled by Parser to the format handled by Prism. # - # source://prism//lib/prism/node.rb#17489 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser.rb#284 + def convert_for_prism(version); end - # def operator: () -> String + # Build a diagnostic from the given prism parse error. # - # source://prism//lib/prism/node.rb#17484 - sig { returns(String) } - def operator; end + # source://prism//lib/prism/translation/parser.rb#119 + def error_diagnostic(error, offset_cache); end - # attr_reader operator_loc: Location + # If there was a error generated during the parse, then raise an + # appropriate syntax error. Otherwise return the result. # - # source://prism//lib/prism/node.rb#17474 - sig { returns(Prism::Location) } - def operator_loc; end + # source://prism//lib/prism/translation/parser.rb#219 + def unwrap(result, offset_cache); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # This is a hook to allow consumers to disable some errors if they don't + # want them to block creating the syntax tree. # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # @return [Boolean] # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser.rb#108 + def valid_error?(error); end + + # This is a hook to allow consumers to disable some warnings if they don't + # want them to block creating the syntax tree. # - # source://prism//lib/prism/node.rb#17515 - def type; end + # @return [Boolean] + # + # source://prism//lib/prism/translation/parser.rb#114 + def valid_warning?(warning); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#17525 - def type; end - end + # Build a diagnostic from the given prism parse warning. + # + # source://prism//lib/prism/translation/parser.rb#192 + def warning_diagnostic(warning, offset_cache); end end -# Represents a set of statements contained within some scope. +# This class is the entry-point for Ruby 3.3 of `Prism::Translation::Parser`. # -# foo; bar; baz -# ^^^^^^^^^^^^^ +# source://prism//lib/prism/translation/parser33.rb#6 +class Prism::Translation::Parser33 < ::Prism::Translation::Parser + # source://prism//lib/prism/translation/parser33.rb#7 + 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/node.rb#17534 -class Prism::StatementsNode < ::Prism::Node - # def initialize: (Array[Node] body, Location location) -> void +# source://prism//lib/prism/translation/parser34.rb#6 +class Prism::Translation::Parser34 < ::Prism::Translation::Parser + # source://prism//lib/prism/translation/parser34.rb#7 + sig { override.returns(Integer) } + def version; 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 +class Prism::Translation::Parser::Compiler < ::Prism::Compiler + # Initialize a new compiler with the given parser, offset cache, and + # options. # - # @return [StatementsNode] a new instance of StatementsNode + # @return [Compiler] a new instance of Compiler # - # source://prism//lib/prism/node.rb#17536 - def initialize(source, body, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#39 + def initialize(parser, offset_cache, forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end - # def accept: (Visitor visitor) -> void + # The Parser::Builders::Default instance that is being used to build the + # AST. + # + # source://prism//lib/prism/translation/parser/compiler.rb#18 + def builder; end + + # The types of values that can be forwarded in the current scope. + # + # source://prism//lib/prism/translation/parser/compiler.rb#29 + def forwarding; end + + # Whether or not the current node is in a destructure. + # + # source://prism//lib/prism/translation/parser/compiler.rb#32 + def in_destructure; end + + # Whether or not the current node is in a pattern. + # + # source://prism//lib/prism/translation/parser/compiler.rb#35 + def in_pattern; end + + # The offset cache that is used to map between byte and character + # offsets in the file. # - # source://prism//lib/prism/node.rb#17544 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#26 + def offset_cache; end - # attr_reader body: Array[Node] + # The Parser::Base instance that is being used to build the AST. # - # source://prism//lib/prism/node.rb#17581 - sig { returns(T::Array[Prism::Node]) } - def body; end + # source://prism//lib/prism/translation/parser/compiler.rb#14 + def parser; end - # def child_nodes: () -> Array[nil | Node] + # The Parser::Source::Buffer instance that is holding a reference to the + # source code. # - # source://prism//lib/prism/node.rb#17549 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#22 + def source_buffer; end - # def comment_targets: () -> Array[Node | Location] + # alias $foo $bar + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17559 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#58 + def visit_alias_global_variable_node(node); end - # def compact_child_nodes: () -> Array[Node] + # alias foo bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17554 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#52 + def visit_alias_method_node(node); end - # def copy: (**params) -> StatementsNode + # foo => bar | baz + # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17564 - sig { params(params: T.untyped).returns(Prism::StatementsNode) } - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#64 + def visit_alternation_pattern_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # a and b + # ^^^^^^^ # - # source://prism//lib/prism/node.rb#17549 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#70 + def visit_and_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { body: Array[Node], location: Location } + # foo(bar) + # ^^^ # - # source://prism//lib/prism/node.rb#17576 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#101 + def visit_arguments_node(node); end - # def inspect(NodeInspector inspector) -> String + # [] + # ^^ # - # source://prism//lib/prism/node.rb#17585 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#76 + def visit_array_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. - # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. - # - # def type: () -> Symbol + # foo => [bar] + # ^^^^^ # - # source://prism//lib/prism/node.rb#17605 - def type; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#17615 - def type; end - end -end - -# Flags for string nodes. -# -# source://prism//lib/prism/node.rb#19352 -module Prism::StringFlags; end - -# internal bytes forced the encoding to binary -# -# source://prism//lib/prism/node.rb#19357 -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#19354 -Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) - -# frozen by virtue of a `frozen_string_literal` comment -# -# source://prism//lib/prism/node.rb#19360 -Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer) + # source://prism//lib/prism/translation/parser/compiler.rb#82 + def visit_array_pattern_node(node); end -# Represents a string literal, a string contained within a `%w` list, or plain string content within an interpolated string. -# -# "foo" -# ^^^^^ -# -# %w[foo] -# ^^^ -# -# "foo #{bar} baz" -# ^^^^ ^^^^ -# -# source://prism//lib/prism/node.rb#17630 -class Prism::StringNode < ::Prism::Node - include ::Prism::HeredocQuery + # { a: 1 } + # ^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#107 + def visit_assoc_node(node); end - # def initialize: (Integer flags, Location? opening_loc, Location content_loc, Location? closing_loc, String unescaped, Location location) -> void + # def foo(**); bar(**); end + # ^^ # - # @return [StringNode] a new instance of StringNode + # { **foo } + # ^^^^^ # - # source://prism//lib/prism/node.rb#17632 - def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#148 + def visit_assoc_splat_node(node); end - # def accept: (Visitor visitor) -> void + # $+ + # ^^ # - # source://prism//lib/prism/node.rb#17644 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#158 + def visit_back_reference_read_node(node); end - # def child_nodes: () -> Array[nil | Node] + # begin end + # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17649 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#164 + def visit_begin_node(node); end - # def closing: () -> String? + # foo(&bar) + # ^^^^ # - # source://prism//lib/prism/node.rb#17748 - sig { returns(T.nilable(String)) } - def closing; end + # source://prism//lib/prism/translation/parser/compiler.rb#202 + def visit_block_argument_node(node); end - # attr_reader closing_loc: Location? + # foo { |; bar| } + # ^^^ # - # source://prism//lib/prism/node.rb#17707 - sig { returns(T.nilable(Prism::Location)) } - def closing_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#208 + def visit_block_local_variable_node(node); end - # def comment_targets: () -> Array[Node | Location] + # A block on a keyword or method call. # - # source://prism//lib/prism/node.rb#17659 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] + # @raise [CompilationError] # - # source://prism//lib/prism/node.rb#17654 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#213 + def visit_block_node(node); end - # def content: () -> String + # def foo(&bar); end + # ^^^^ # - # source://prism//lib/prism/node.rb#17743 - sig { returns(String) } - def content; end + # source://prism//lib/prism/translation/parser/compiler.rb#219 + def visit_block_parameter_node(node); end - # attr_reader content_loc: Location + # A block's parameters. # - # source://prism//lib/prism/node.rb#17701 - sig { returns(Prism::Location) } - def content_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#224 + def visit_block_parameters_node(node); end - # def copy: (**params) -> StringNode + # break + # ^^^^^ # - # source://prism//lib/prism/node.rb#17664 - sig { params(params: T.untyped).returns(Prism::StringNode) } - def copy(**params); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # break foo + # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17649 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#233 + def visit_break_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String, location: Location } + # foo.bar &&= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17680 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#338 + def visit_call_and_write_node(node); end - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] + # foo + # ^^^ # - # source://prism//lib/prism/node.rb#17728 - sig { returns(T::Boolean) } - def forced_binary_encoding?; end - - # def forced_utf8_encoding?: () -> bool + # foo.bar + # ^^^^^^^ # - # @return [Boolean] + # foo.bar() {} + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17723 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#245 + def visit_call_node(node); end - # def frozen?: () -> bool - # - # @return [Boolean] + # foo.bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17733 - sig { returns(T::Boolean) } - def frozen?; end + # source://prism//lib/prism/translation/parser/compiler.rb#319 + def visit_call_operator_write_node(node); end - # def inspect(NodeInspector inspector) -> String + # foo.bar ||= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17753 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#357 + def visit_call_or_write_node(node); end - # def opening: () -> String? + # foo.bar, = 1 + # ^^^^^^^ # - # source://prism//lib/prism/node.rb#17738 - sig { returns(T.nilable(String)) } - def opening; end + # source://prism//lib/prism/translation/parser/compiler.rb#376 + def visit_call_target_node(node); end - # attr_reader opening_loc: Location? + # foo => bar => baz + # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17689 - sig { returns(T.nilable(Prism::Location)) } - def opening_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#388 + def visit_capture_pattern_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/translation/parser/compiler.rb#407 + def visit_case_match_node(node); end + + # case foo; when bar; end + # ^^^^^^^^^^^^^^^^^^^^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#394 + def visit_case_node(node); end + + # class Foo; end + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17778 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#420 + def visit_class_node(node); end - # attr_reader unescaped: String + # @@foo &&= bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17719 - sig { returns(String) } - def unescaped; end + # source://prism//lib/prism/translation/parser/compiler.rb#459 + def visit_class_variable_and_write_node(node); end - private + # @@foo += bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#449 + def visit_class_variable_operator_write_node(node); end - # private attr_reader flags: Integer + # @@foo ||= bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17685 - sig { returns(Integer) } - def flags; end + # source://prism//lib/prism/translation/parser/compiler.rb#469 + def visit_class_variable_or_write_node(node); end - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#17788 - def type; end - end -end + # @@foo + # ^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#433 + def visit_class_variable_read_node(node); end -# Represents the use of the `super` keyword with parentheses or arguments. -# -# super() -# ^^^^^^^ -# -# super foo, bar -# ^^^^^^^^^^^^^^ -# -# source://prism//lib/prism/node.rb#17800 -class Prism::SuperNode < ::Prism::Node - # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Node? block, Location location) -> void + # @@foo, = bar + # ^^^^^ # - # @return [SuperNode] a new instance of SuperNode + # source://prism//lib/prism/translation/parser/compiler.rb#479 + def visit_class_variable_target_node(node); end + + # @@foo = 1 + # ^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17802 - def initialize(source, keyword_loc, lparen_loc, arguments, rparen_loc, block, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#439 + def visit_class_variable_write_node(node); end - # def accept: (Visitor visitor) -> void + # Foo &&= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17814 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#510 + def visit_constant_and_write_node(node); end - # attr_reader arguments: ArgumentsNode? + # Foo += bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17876 - sig { returns(T.nilable(Prism::ArgumentsNode)) } - def arguments; end + # source://prism//lib/prism/translation/parser/compiler.rb#500 + def visit_constant_operator_write_node(node); end - # attr_reader block: Node? + # Foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17891 - sig { returns(T.nilable(Prism::Node)) } - def block; end + # source://prism//lib/prism/translation/parser/compiler.rb#520 + def visit_constant_or_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Foo::Bar &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17819 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#576 + def visit_constant_path_and_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Foo::Bar + # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#17832 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#536 + def visit_constant_path_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17824 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#566 + def visit_constant_path_operator_write_node(node); end - # def copy: (**params) -> SuperNode + # Foo::Bar ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17837 - sig { params(params: T.untyped).returns(Prism::SuperNode) } - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#586 + def visit_constant_path_or_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Foo::Bar, = baz + # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#17819 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#596 + def visit_constant_path_target_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: Node?, location: Location } + # Foo::Bar = 1 + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17853 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # Foo::Foo, Bar::Bar = 1 + # ^^^^^^^^ ^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#556 + def visit_constant_path_write_node(node); end - # def inspect(NodeInspector inspector) -> String + # Foo + # ^^^ # - # source://prism//lib/prism/node.rb#17910 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#485 + def visit_constant_read_node(node); end - # def keyword: () -> String + # Foo, = bar + # ^^^ # - # source://prism//lib/prism/node.rb#17895 - sig { returns(String) } - def keyword; end + # source://prism//lib/prism/translation/parser/compiler.rb#530 + def visit_constant_target_node(node); end - # attr_reader keyword_loc: Location + # Foo = 1 + # ^^^^^^^ # - # source://prism//lib/prism/node.rb#17858 - sig { returns(Prism::Location) } - def keyword_loc; end + # Foo, Bar = 1 + # ^^^ ^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#494 + def visit_constant_write_node(node); end - # def lparen: () -> String? + # def foo; end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17900 - sig { returns(T.nilable(String)) } - def lparen; end + # def self.foo; end + # ^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#605 + def visit_def_node(node); end - # attr_reader lparen_loc: Location? + # defined? a + # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17864 - sig { returns(T.nilable(Prism::Location)) } - def lparen_loc; end + # defined?(a) + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#652 + def visit_defined_node(node); end - # def rparen: () -> String? + # if foo then bar else baz end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17905 - sig { returns(T.nilable(String)) } - def rparen; end + # source://prism//lib/prism/translation/parser/compiler.rb#664 + def visit_else_node(node); end - # attr_reader rparen_loc: Location? + # "foo #{bar}" + # ^^^^^^ # - # source://prism//lib/prism/node.rb#17879 - sig { returns(T.nilable(Prism::Location)) } - def rparen_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#670 + def visit_embedded_statements_node(node); end - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # "foo #@bar" + # ^^^^^ # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/translation/parser/compiler.rb#680 + def visit_embedded_variable_node(node); end + + # begin; foo; ensure; bar; end + # ^^^^^^^^^^^^ # - # def type: () -> Symbol + # @raise [CompilationError] # - # source://prism//lib/prism/node.rb#17944 - def type; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#17954 - def type; end - end -end - -# Flags for symbol nodes. -# -# source://prism//lib/prism/node.rb#19364 -module Prism::SymbolFlags; end + # source://prism//lib/prism/translation/parser/compiler.rb#686 + def visit_ensure_node(node); end -# internal bytes forced the encoding to binary -# -# source://prism//lib/prism/node.rb#19369 -Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) + # false + # ^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#692 + def visit_false_node(node); end -# internal bytes forced the encoding to US-ASCII -# -# source://prism//lib/prism/node.rb#19372 -Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) + # foo => [*, bar, *] + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#698 + def visit_find_pattern_node(node); end -# internal bytes forced the encoding to UTF-8 -# -# source://prism//lib/prism/node.rb#19366 -Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + # 0..5 + # ^^^^ + # if foo .. bar; end + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1494 + def visit_flip_flop_node(node); end -# Represents a symbol literal or a symbol contained within a `%i` list. -# -# :foo -# ^^^^ -# -# %i[foo] -# ^^^ -# -# source://prism//lib/prism/node.rb#17966 -class Prism::SymbolNode < ::Prism::Node - # def initialize: (Integer flags, Location? opening_loc, Location? value_loc, Location? closing_loc, String unescaped, Location location) -> void + # 1.0 + # ^^^ # - # @return [SymbolNode] a new instance of SymbolNode + # source://prism//lib/prism/translation/parser/compiler.rb#710 + def visit_float_node(node); end + + # for foo in bar do end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17968 - def initialize(source, flags, opening_loc, value_loc, closing_loc, unescaped, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#716 + def visit_for_node(node); end - # def accept: (Visitor visitor) -> void + # def foo(...); bar(...); end + # ^^^ # - # source://prism//lib/prism/node.rb#17980 - sig { params(visitor: Prism::Visitor).void } - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#734 + def visit_forwarding_arguments_node(node); end - # def child_nodes: () -> Array[nil | Node] + # def foo(...); end + # ^^^ # - # source://prism//lib/prism/node.rb#17985 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#740 + def visit_forwarding_parameter_node(node); end - # def closing: () -> String? + # super + # ^^^^^ # - # source://prism//lib/prism/node.rb#18090 - sig { returns(T.nilable(String)) } - def closing; end + # super {} + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#749 + def visit_forwarding_super_node(node); end - # attr_reader closing_loc: Location? + # $foo &&= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18049 - sig { returns(T.nilable(Prism::Location)) } - def closing_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#787 + def visit_global_variable_and_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # $foo += bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17995 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#777 + def visit_global_variable_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # $foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#17990 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#797 + def visit_global_variable_or_write_node(node); end - # def copy: (**params) -> SymbolNode + # $foo + # ^^^^ # - # source://prism//lib/prism/node.rb#18000 - sig { params(params: T.untyped).returns(Prism::SymbolNode) } - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#761 + def visit_global_variable_read_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # $foo, = bar + # ^^^^ # - # source://prism//lib/prism/node.rb#17985 - sig { returns(T::Array[T.nilable(Prism::Node)]) } - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#807 + def visit_global_variable_target_node(node); end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String, location: Location } + # $foo = 1 + # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#18016 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#767 + def visit_global_variable_write_node(node); end - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] + # {} + # ^^ # - # source://prism//lib/prism/node.rb#18070 - sig { returns(T::Boolean) } - def forced_binary_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#813 + def visit_hash_node(node); end - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] + # foo => {} + # ^^ # - # source://prism//lib/prism/node.rb#18075 - sig { returns(T::Boolean) } - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#823 + def visit_hash_pattern_node(node); end - # def forced_utf8_encoding?: () -> bool + # if foo then bar end + # ^^^^^^^^^^^^^^^^^^^ # - # @return [Boolean] + # bar if foo + # ^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18065 - sig { returns(T::Boolean) } - def forced_utf8_encoding?; end - - # def inspect(NodeInspector inspector) -> String + # foo ? bar : baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18095 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#841 + def visit_if_node(node); end - # def opening: () -> String? + # 1i + # ^^ # - # source://prism//lib/prism/node.rb#18080 - sig { returns(T.nilable(String)) } - def opening; end + # source://prism//lib/prism/translation/parser/compiler.rb#883 + def visit_imaginary_node(node); end - # attr_reader opening_loc: Location? + # { foo: } + # ^^^^ # - # source://prism//lib/prism/node.rb#18025 - sig { returns(T.nilable(Prism::Location)) } - def opening_loc; end - - # Sometimes you want to check an instance of a node against a list of - # classes to see what kind of behavior to perform. Usually this is done by - # calling `[cls1, cls2].include?(node.class)` or putting the node into a - # case statement and doing `case node; when cls1; when cls2; end`. Both of - # these approaches are relatively slow because of the constant lookups, - # method calls, and/or array allocations. + # @raise [CompilationError] # - # Instead, you can call #type, which will return to you a symbol that you - # can use for comparison. This is faster than the other approaches because - # it uses a single integer comparison, but also because if you're on CRuby - # you can take advantage of the fact that case statements with all symbol - # keys will use a jump table. + # source://prism//lib/prism/translation/parser/compiler.rb#889 + def visit_implicit_node(node); end + + # foo { |bar,| } + # ^ # - # def type: () -> Symbol + # @raise [CompilationError] # - # source://prism//lib/prism/node.rb#18120 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#895 + def visit_implicit_rest_node(node); end - # attr_reader unescaped: String + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18061 - sig { returns(String) } - def unescaped; end + # source://prism//lib/prism/translation/parser/compiler.rb#901 + def visit_in_node(node); end - # def value: () -> String? + # foo[bar] &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18085 - sig { returns(T.nilable(String)) } - def value; end + # source://prism//lib/prism/translation/parser/compiler.rb#945 + def visit_index_and_write_node(node); end - # attr_reader value_loc: Location? + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18037 - sig { returns(T.nilable(Prism::Location)) } - def value_loc; end - - private + # source://prism//lib/prism/translation/parser/compiler.rb#927 + def visit_index_operator_write_node(node); end - # private attr_reader flags: Integer + # foo[bar] ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/node.rb#18021 - sig { returns(Integer) } - def flags; end - - class << self - # Similar to #type, this method returns a symbol that you can use for - # splitting on the type of the node without having to do a long === chain. - # Note that like #type, it will still be slower than using == for a single - # class, but should be faster in a case statement or an array comparison. - # - # def self.type: () -> Symbol - # - # source://prism//lib/prism/node.rb#18130 - def type; end - end -end + # source://prism//lib/prism/translation/parser/compiler.rb#963 + def visit_index_or_write_node(node); end -# This represents a token from the Ruby source. -# -# source://prism//lib/prism/parse_result.rb#454 -class Prism::Token - # Create a new token object with the given type, value, and location. - # - # @return [Token] a new instance of Token + # foo[bar], = 1 + # ^^^^^^^^ # - # source://prism//lib/prism/parse_result.rb#466 - def initialize(source, type, value, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#981 + def visit_index_target_node(node); end - # Returns true if the given other token is equal to this token. + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/parse_result.rb#500 - sig { params(other: T.untyped).returns(T::Boolean) } - def ==(other); end + # source://prism//lib/prism/translation/parser/compiler.rb#1018 + def visit_instance_variable_and_write_node(node); end - # Implement the hash pattern matching interface for Token. + # ^^^^^^^^^^^ # - # source://prism//lib/prism/parse_result.rb#474 - sig { params(keys: T.untyped).returns(T.untyped) } - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#1008 + def visit_instance_variable_operator_write_node(node); end - # A Location object representing the location of this token in the source. + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/parse_result.rb#479 - sig { returns(Prism::Location) } - def location; end + # source://prism//lib/prism/translation/parser/compiler.rb#1028 + def visit_instance_variable_or_write_node(node); end - # Implement the pretty print interface for Token. + # ^^^^ # - # source://prism//lib/prism/parse_result.rb#485 - sig { params(q: T.untyped).returns(T.untyped) } - def pretty_print(q); end + # source://prism//lib/prism/translation/parser/compiler.rb#992 + def visit_instance_variable_read_node(node); end - # The type of token that this token is. + # @foo, = bar + # ^^^^ # - # source://prism//lib/prism/parse_result.rb#460 - sig { returns(T.untyped) } - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#1038 + def visit_instance_variable_target_node(node); end - # A byteslice of the source that this token represents. + # ^^^^^^^^ # - # source://prism//lib/prism/parse_result.rb#463 - sig { returns(String) } - def value; end - - private + # source://prism//lib/prism/translation/parser/compiler.rb#998 + def visit_instance_variable_write_node(node); end - # The Source object that represents the source this token came from. + # 1 + # ^ # - # source://prism//lib/prism/parse_result.rb#456 - def source; end -end - -# This module is responsible for converting the prism syntax tree into other -# syntax trees. -# -# source://prism//lib/prism/translation.rb#6 -module Prism::Translation; end + # source://prism//lib/prism/translation/parser/compiler.rb#1044 + def visit_integer_node(node); end -# This class is the entry-point for converting a prism syntax tree into the -# whitequark/parser gem's syntax tree. It inherits from the base parser for -# the parser gem, and overrides the parse* methods to parse with prism and -# then translate. -# -# source://prism//lib/prism/translation/parser.rb#11 -class Prism::Translation::Parser < ::Parser::Base - # The default encoding for Ruby files is UTF-8. + # /foo #{bar}/ + # ^^^^^^^^^^^^ + # if /foo #{bar}/ then end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#33 - def default_encoding; end + # source://prism//lib/prism/translation/parser/compiler.rb#1050 + def visit_interpolated_match_last_line_node(node); end - # Parses a source buffer and returns the AST. + # /foo #{bar}/ + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#41 - def parse(source_buffer); end + # source://prism//lib/prism/translation/parser/compiler.rb#1050 + def visit_interpolated_regular_expression_node(node); end - # Parses a source buffer and returns the AST and the source code comments. + # "foo #{bar}" + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#54 - def parse_with_comments(source_buffer); end + # source://prism//lib/prism/translation/parser/compiler.rb#1065 + def visit_interpolated_string_node(node); end - # Parses a source buffer and returns the AST, the source code comments, - # and the tokens emitted by the lexer. + # :"foo #{bar}" + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#71 - def tokenize(source_buffer, recover = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#1128 + def visit_interpolated_symbol_node(node); end - # Since prism resolves num params for us, we don't need to support this - # kind of logic here. + # `foo #{bar}` + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#97 - def try_declare_numparam(node); end - - # source://prism//lib/prism/translation/parser.rb#28 - def version; end - - # source://prism//lib/prism/translation/parser.rb#37 - def yyerror; end + # source://prism//lib/prism/translation/parser/compiler.rb#1138 + def visit_interpolated_x_string_node(node); end - private + # -> { it } + # ^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1153 + def visit_it_parameters_node(node); end - # Build the parser gem AST from the prism AST. + # foo(bar: baz) + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#146 - def build_ast(program, offset_cache); end + # source://prism//lib/prism/translation/parser/compiler.rb#1159 + def visit_keyword_hash_node(node); end - # Build the parser gem comments from the prism comments. + # def foo(**bar); end + # ^^^^^ # - # source://prism//lib/prism/translation/parser.rb#151 - def build_comments(comments, offset_cache); end + # def foo(**); end + # ^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1168 + def visit_keyword_rest_parameter_node(node); end - # Prism deals with offsets in bytes, while the parser gem deals with - # offsets in characters. We need to handle this conversion in order to - # build the parser gem AST. + # -> {} + # ^^^^^ # - # If the bytesize of the source is the same as the length, then we can - # 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/compiler.rb#1177 + def visit_lambda_node(node); end + + # foo &&= bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#129 - def build_offset_cache(source); end + # source://prism//lib/prism/translation/parser/compiler.rb#1236 + def visit_local_variable_and_write_node(node); end - # Build a range from a prism location. + # foo += bar + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#163 - def build_range(location, offset_cache); end + # source://prism//lib/prism/translation/parser/compiler.rb#1226 + def visit_local_variable_operator_write_node(node); end - # Build the parser gem tokens from the prism tokens. + # foo ||= bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#158 - def build_tokens(tokens, offset_cache); end + # source://prism//lib/prism/translation/parser/compiler.rb#1246 + def visit_local_variable_or_write_node(node); end - # Converts the version format handled by Parser to the format handled by Prism. + # foo + # ^^^ # - # source://prism//lib/prism/translation/parser.rb#172 - def convert_for_prism(version); end + # source://prism//lib/prism/translation/parser/compiler.rb#1203 + def visit_local_variable_read_node(node); end - # If there was a error generated during the parse, then raise an - # appropriate syntax error. Otherwise return the result. + # foo, = bar + # ^^^ # - # source://prism//lib/prism/translation/parser.rb#111 - def unwrap(result, offset_cache); end + # source://prism//lib/prism/translation/parser/compiler.rb#1256 + def visit_local_variable_target_node(node); end - # This is a hook to allow consumers to disable some errors if they don't - # want them to block creating the syntax tree. - # - # @return [Boolean] + # foo = 1 + # ^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#105 - def valid_error?(error); end -end + # source://prism//lib/prism/translation/parser/compiler.rb#1216 + def visit_local_variable_write_node(node); 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 -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 + # /foo/ + # ^^^^^ + # if /foo/ then end + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#39 - def initialize(parser, offset_cache, forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#1528 + def visit_match_last_line_node(node); end - # The Parser::Builders::Default instance that is being used to build the - # AST. + # foo in bar + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#18 - def builder; end + # source://prism//lib/prism/translation/parser/compiler.rb#1266 + def visit_match_predicate_node(node); end - # The types of values that can be forwarded in the current scope. + # foo => bar + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#29 - def forwarding; end + # source://prism//lib/prism/translation/parser/compiler.rb#1276 + def visit_match_required_node(node); end - # Whether or not the current node is in a destructure. + # /(?foo)/ =~ bar + # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#32 - def in_destructure; end + # source://prism//lib/prism/translation/parser/compiler.rb#1286 + def visit_match_write_node(node); end - # Whether or not the current node is in a pattern. + # 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#35 - def in_pattern; end + # source://prism//lib/prism/translation/parser/compiler.rb#1297 + def visit_missing_node(node); end - # The offset cache that is used to map between byte and character - # offsets in the file. + # module Foo; end + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#26 - def offset_cache; end + # source://prism//lib/prism/translation/parser/compiler.rb#1303 + def visit_module_node(node); end - # The Parser::Base instance that is being used to build the AST. + # foo, bar = baz + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#14 - def parser; end + # source://prism//lib/prism/translation/parser/compiler.rb#1314 + def visit_multi_target_node(node); end - # The Parser::Source::Buffer instance that is holding a reference to the - # source code. + # foo, bar = baz + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#22 - def source_buffer; end + # source://prism//lib/prism/translation/parser/compiler.rb#1328 + def visit_multi_write_node(node); end - # alias $foo $bar - # ^^^^^^^^^^^^^^^ + # next + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#58 - def visit_alias_global_variable_node(node); end - - # alias foo bar - # ^^^^^^^^^^^^^ + # next foo + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#52 - def visit_alias_method_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1349 + def visit_next_node(node); end - # foo => bar | baz - # ^^^^^^^^^ + # nil + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#64 - def visit_alternation_pattern_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1361 + def visit_nil_node(node); end - # a and b - # ^^^^^^^ + # def foo(**nil); end + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#70 - def visit_and_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1367 + def visit_no_keywords_parameter_node(node); end - # foo(bar) - # ^^^ + # -> { _1 + _2 } + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#101 - def visit_arguments_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1377 + def visit_numbered_parameters_node(node); end - # [] + # $1 # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#76 - def visit_array_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1383 + def visit_numbered_reference_read_node(node); end - # foo => [bar] - # ^^^^^ + # def foo(bar: baz); end + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#82 - def visit_array_pattern_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1389 + def visit_optional_keyword_parameter_node(node); end - # { a: 1 } - # ^^^^ + # def foo(bar = 1); end + # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#107 - def visit_assoc_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1395 + def visit_optional_parameter_node(node); end - # def foo(**); bar(**); end - # ^^ + # a or b + # ^^^^^^ # - # { **foo } - # ^^^^^ + # source://prism//lib/prism/translation/parser/compiler.rb#1401 + def visit_or_node(node); end + + # def foo(bar, *baz); end + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#141 - def visit_assoc_splat_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1407 + def visit_parameters_node(node); end - # $+ + # () # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#151 - def visit_back_reference_read_node(node); end + # (1) + # ^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1446 + def visit_parentheses_node(node); end - # begin end - # ^^^^^^^^^ + # foo => ^(bar) + # ^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#157 - def visit_begin_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1456 + def visit_pinned_expression_node(node); end - # foo(&bar) - # ^^^^ + # foo = 1 and bar => ^foo + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#195 - def visit_block_argument_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1463 + def visit_pinned_variable_node(node); end - # foo { |; bar| } - # ^^^ + # END {} # - # source://prism//lib/prism/translation/parser/compiler.rb#201 - def visit_block_local_variable_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1468 + def visit_post_execution_node(node); end - # A block on a keyword or method call. + # BEGIN {} # - # @raise [CompilationError] + # source://prism//lib/prism/translation/parser/compiler.rb#1478 + def visit_pre_execution_node(node); end + + # The top-level program node. # - # source://prism//lib/prism/translation/parser/compiler.rb#206 - def visit_block_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1488 + def visit_program_node(node); end - # def foo(&bar); end - # ^^^^ + # 0..5 + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#212 - def visit_block_parameter_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1494 + def visit_range_node(node); end - # A block's parameters. + # 1r + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#217 - def visit_block_parameters_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1516 + def visit_rational_node(node); end - # break + # redo + # ^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1522 + def visit_redo_node(node); end + + # /foo/ # ^^^^^ # - # break foo - # ^^^^^^^^^ + # source://prism//lib/prism/translation/parser/compiler.rb#1528 + def visit_regular_expression_node(node); end + + # def foo(bar:); end + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#226 - def visit_break_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1543 + def visit_required_keyword_parameter_node(node); end - # foo.bar += baz - # ^^^^^^^^^^^^^^^ - # foo.bar &&= baz - # ^^^^^^^^^^^^^^^ + # def foo(bar); end + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#300 - def visit_call_and_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1549 + def visit_required_parameter_node(node); end - # foo - # ^^^ + # foo rescue bar + # ^^^^^^^^^^^^^^ # - # foo.bar - # ^^^^^^^ + # source://prism//lib/prism/translation/parser/compiler.rb#1555 + def visit_rescue_modifier_node(node); end + + # begin; rescue; end + # ^^^^^^^ # - # foo.bar() {} - # ^^^^^^^^^^^^ + # @raise [CompilationError] # - # source://prism//lib/prism/translation/parser/compiler.rb#238 - def visit_call_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1573 + def visit_rescue_node(node); end - # foo.bar += baz - # ^^^^^^^^^^^^^^^ + # def foo(*bar); end + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#300 - def visit_call_operator_write_node(node); end + # def foo(*); end + # ^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1582 + def visit_rest_parameter_node(node); end - # foo.bar += baz - # ^^^^^^^^^^^^^^^ - # foo.bar ||= baz - # ^^^^^^^^^^^^^^^ + # retry + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#300 - def visit_call_or_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1588 + def visit_retry_node(node); end - # foo.bar, = 1 - # ^^^^^^^ + # return + # ^^^^^^ + # + # return 1 + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#327 - def visit_call_target_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1597 + def visit_return_node(node); end - # foo => bar => baz - # ^^^^^^^^^^ + # self + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#339 - def visit_capture_pattern_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1609 + def visit_self_node(node); end - # case foo; in bar; end - # ^^^^^^^^^^^^^^^^^^^^^ + # A shareable constant. # - # source://prism//lib/prism/translation/parser/compiler.rb#358 - def visit_case_match_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1614 + def visit_shareable_constant_node(node); end - # case foo; when bar; end - # ^^^^^^^^^^^^^^^^^^^^^^^ + # class << self; end + # ^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#345 - def visit_case_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1620 + def visit_singleton_class_node(node); end - # class Foo; end - # ^^^^^^^^^^^^^^ + # __ENCODING__ + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#371 - def visit_class_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1632 + def visit_source_encoding_node(node); end - # @@foo += bar - # ^^^^^^^^^^^^ - # @@foo &&= bar - # ^^^^^^^^^^^^^ + # __FILE__ + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#403 - def visit_class_variable_and_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1638 + def visit_source_file_node(node); end - # @@foo += bar - # ^^^^^^^^^^^^ + # __LINE__ + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#403 - def visit_class_variable_operator_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1644 + def visit_source_line_node(node); end - # @@foo += bar - # ^^^^^^^^^^^^ - # @@foo ||= bar - # ^^^^^^^^^^^^^ + # foo(*bar) + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#403 - def visit_class_variable_or_write_node(node); end + # def foo((bar, *baz)); end + # ^^^^ + # + # def foo(*); bar(*); end + # ^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1656 + def visit_splat_node(node); end - # @@foo - # ^^^^^ + # A list of statements. # - # source://prism//lib/prism/translation/parser/compiler.rb#384 - def visit_class_variable_read_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1669 + def visit_statements_node(node); end - # @@foo, = bar + # "foo" # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#421 - def visit_class_variable_target_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1675 + def visit_string_node(node); end - # @@foo = 1 - # ^^^^^^^^^ - # - # @@foo, @@bar = 1 - # ^^^^^ ^^^^^ + # super(foo) + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#393 - def visit_class_variable_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1716 + def visit_super_node(node); end - # Foo += bar - # ^^^^^^^^^^^ - # Foo &&= bar - # ^^^^^^^^^^^^ + # :foo + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#442 - def visit_constant_and_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1739 + def visit_symbol_node(node); end - # Foo += bar - # ^^^^^^^^^^^ + # true + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#442 - def visit_constant_operator_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1771 + def visit_true_node(node); end - # Foo += bar - # ^^^^^^^^^^^ - # Foo ||= bar - # ^^^^^^^^^^^^ + # undef foo + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#442 - def visit_constant_or_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1777 + def visit_undef_node(node); end - # Foo::Bar += baz - # ^^^^^^^^^^^^^^^ - # Foo::Bar &&= baz - # ^^^^^^^^^^^^^^^^ + # unless foo; bar end + # ^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#496 - def visit_constant_path_and_write_node(node); end - - # Foo::Bar - # ^^^^^^^^ + # bar unless foo + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#466 - def visit_constant_path_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1786 + def visit_unless_node(node); end - # Foo::Bar += baz - # ^^^^^^^^^^^^^^^ + # until foo; bar end + # ^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#496 - def visit_constant_path_operator_write_node(node); end - - # Foo::Bar += baz - # ^^^^^^^^^^^^^^^ - # Foo::Bar ||= baz - # ^^^^^^^^^^^^^^^^ + # bar until foo + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#496 - def visit_constant_path_or_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1816 + def visit_until_node(node); end - # Foo::Bar, = baz - # ^^^^^^^^ + # case foo; when bar; end + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#514 - def visit_constant_path_target_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1838 + def visit_when_node(node); end - # Foo::Bar = 1 - # ^^^^^^^^^^^^ + # while foo; bar end + # ^^^^^^^^^^^^^^^^^^ # - # Foo::Foo, Bar::Bar = 1 - # ^^^^^^^^ ^^^^^^^^ + # bar while foo + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#486 - def visit_constant_path_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1856 + def visit_while_node(node); end - # Foo - # ^^^ + # `foo` + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#427 - def visit_constant_read_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1878 + def visit_x_string_node(node); end - # Foo, = bar - # ^^^ + # yield + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#460 - def visit_constant_target_node(node); end - - # Foo = 1 + # yield 1 # ^^^^^^^ # - # Foo, Bar = 1 - # ^^^ ^^^ - # - # source://prism//lib/prism/translation/parser/compiler.rb#436 - def visit_constant_write_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1910 + def visit_yield_node(node); end - # def foo; end - # ^^^^^^^^^^^^ + private + + # Initialize a new compiler with the given option overrides, used to + # visit a subtree with the given options. # - # def self.foo; end - # ^^^^^^^^^^^^^^^^^ + # source://prism//lib/prism/translation/parser/compiler.rb#1924 + 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#523 - def visit_def_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1931 + def find_forwarding(node); end - # defined? a - # ^^^^^^^^^^ + # Because we have mutated the AST to allow for newlines in the middle of + # a rational, we need to manually handle the value here. # - # defined?(a) - # ^^^^^^^^^^^ + # source://prism//lib/prism/translation/parser/compiler.rb#1945 + def imaginary_value(node); end + + # Negate the value of a numeric node. This is a special case where you + # have a negative sign on one line and then a number on the next line. + # In normal Ruby, this will always be a method call. The parser gem, + # 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#570 - def visit_defined_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1954 + def numeric_negate(message_loc, receiver); end - # if foo then bar else baz end - # ^^^^^^^^^^^^ + # Blocks can have a special set of parameters that automatically expand + # when given arrays if they have a single required parameter and no + # other parameters. # - # source://prism//lib/prism/translation/parser/compiler.rb#582 - def visit_else_node(node); end + # @return [Boolean] + # + # source://prism//lib/prism/translation/parser/compiler.rb#1966 + def procarg0?(parameters); end - # "foo #{bar}" - # ^^^^^^ + # Because we have mutated the AST to allow for newlines in the middle of + # a rational, we need to manually handle the value here. # - # source://prism//lib/prism/translation/parser/compiler.rb#588 - def visit_embedded_statements_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1979 + def rational_value(node); end - # "foo #@bar" - # ^^^^^ + # Constructs a new source range from the given start and end offsets. # - # source://prism//lib/prism/translation/parser/compiler.rb#598 - def visit_embedded_variable_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1993 + def srange(location); end - # begin; foo; ensure; bar; end - # ^^^^^^^^^^^^ + # Constructs a new source range by finding the given tokens between the + # given start offset and end offset. If the needle is not found, it + # returns nil. Importantly it does not search past newlines or comments. # - # @raise [CompilationError] + # 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#604 - def visit_ensure_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#2008 + def srange_find(start_offset, end_offset, tokens); end - # false - # ^^^^^ + # Constructs a new source range from the given start and end offsets. # - # source://prism//lib/prism/translation/parser/compiler.rb#610 - def visit_false_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#1998 + def srange_offsets(start_offset, end_offset); end - # foo => [*, bar, *] - # ^^^^^^^^^^^ + # Transform a location into a token that the parser gem expects. # - # source://prism//lib/prism/translation/parser/compiler.rb#616 - def visit_find_pattern_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#2018 + def token(location); end - # 0..5 - # ^^^^ - # if foo .. bar; end - # ^^^^^^^^^^ + # Visit a block node on a call. # - # source://prism//lib/prism/translation/parser/compiler.rb#1302 - def visit_flip_flop_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#2023 + def visit_block(call, block); end - # 1.0 - # ^^^ + # Visit a heredoc that can be either a string or an xstring. # - # source://prism//lib/prism/translation/parser/compiler.rb#628 - def visit_float_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#2057 + def visit_heredoc(node); end - # for foo in bar do end - # ^^^^^^^^^^^^^^^^^^^^^ + # Visit a numeric node and account for the optional sign. # - # source://prism//lib/prism/translation/parser/compiler.rb#634 - def visit_for_node(node); end + # source://prism//lib/prism/translation/parser/compiler.rb#2103 + def visit_numeric(node, value); end - # def foo(...); bar(...); end - # ^^^ + # Within the given block, track that we're within a pattern. + # + # source://prism//lib/prism/translation/parser/compiler.rb#2115 + 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 +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#1990 +Prism::Translation::Parser::Compiler::Range = Parser::Source::Range + +# source://prism//lib/prism/translation/parser.rb#12 +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#8 +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/compiler.rb#652 - def visit_forwarding_arguments_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#204 + def initialize(source_buffer, lexed, offset_cache); end - # def foo(...); end - # ^^^ + # An array of tuples that contain prism tokens and their associated lex + # state when they were lexed. # - # source://prism//lib/prism/translation/parser/compiler.rb#658 - def visit_forwarding_parameter_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#197 + def lexed; end - # super - # ^^^^^ + # A hash that maps offsets in bytes to offsets in characters. # - # super {} - # ^^^^^^^^ + # source://prism//lib/prism/translation/parser/lexer.rb#200 + def offset_cache; end + + # The Parser::Source::Buffer that the tokens were lexed from. # - # source://prism//lib/prism/translation/parser/compiler.rb#667 - def visit_forwarding_super_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#193 + def source_buffer; end - # $foo += bar - # ^^^^^^^^^^^ - # $foo &&= bar - # ^^^^^^^^^^^^ + # Convert the prism tokens into the expected format for the parser gem. # - # source://prism//lib/prism/translation/parser/compiler.rb#698 - def visit_global_variable_and_write_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#214 + def to_a; end - # $foo += bar - # ^^^^^^^^^^^ + private + + # Parse a complex from the string representation. # - # source://prism//lib/prism/translation/parser/compiler.rb#698 - def visit_global_variable_operator_write_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#387 + def parse_complex(value); end - # $foo += bar - # ^^^^^^^^^^^ - # $foo ||= bar - # ^^^^^^^^^^^^ + # Parse a float from the string representation. # - # source://prism//lib/prism/translation/parser/compiler.rb#698 - def visit_global_variable_or_write_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#380 + def parse_float(value); end - # $foo - # ^^^^ + # Parse an integer from the string representation. # - # source://prism//lib/prism/translation/parser/compiler.rb#679 - def visit_global_variable_read_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#373 + def parse_integer(value); end - # $foo, = bar - # ^^^^ + # Parse a rational from the string representation. # - # source://prism//lib/prism/translation/parser/compiler.rb#716 - def visit_global_variable_target_node(node); end + # source://prism//lib/prism/translation/parser/lexer.rb#402 + def parse_rational(value); end +end - # $foo = 1 - # ^^^^^^^^ +# These constants represent flags in our lex state. We really, really +# don't want to be using them and we really, really don't want to be +# exposing them as part of our public API. Unfortunately, we don't have +# another way of matching the exact tokens that the parser gem expects +# without them. We should find another way to do this, but in the +# meantime we'll hide them from the documentation and mark them as +# private constants. +# +# source://prism//lib/prism/translation/parser/lexer.rb#187 +Prism::Translation::Parser::Lexer::EXPR_BEG = T.let(T.unsafe(nil), Integer) + +# source://prism//lib/prism/translation/parser/lexer.rb#188 +Prism::Translation::Parser::Lexer::EXPR_LABEL = T.let(T.unsafe(nil), Integer) + +# source://prism//lib/prism/translation/parser/lexer.rb#210 +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#10 +Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash) + +# 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#18 +class Prism::Translation::Parser::PrismDiagnostic < ::Parser::Diagnostic + # Initialize a new diagnostic with the given message and location. # - # $foo, $bar = 1 - # ^^^^ ^^^^ + # @return [PrismDiagnostic] a new instance of PrismDiagnostic # - # source://prism//lib/prism/translation/parser/compiler.rb#688 - def visit_global_variable_write_node(node); end + # source://prism//lib/prism/translation/parser.rb#23 + def initialize(message, level, reason, location); end - # {} - # ^^ + # This is the cached message coming from prism. # - # source://prism//lib/prism/translation/parser/compiler.rb#722 - def visit_hash_node(node); end + # source://prism//lib/prism/translation/parser.rb#20 + def message; end +end - # foo => {} - # ^^ - # - # source://prism//lib/prism/translation/parser/compiler.rb#732 - def visit_hash_pattern_node(node); end +# source://prism//lib/prism/translation/parser.rb#29 +Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) - # if foo then bar end - # ^^^^^^^^^^^^^^^^^^^ - # - # bar if foo - # ^^^^^^^^^^ +# 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 +# treat `Prism::Translation::Ripper` effectively as you would treat the +# `Ripper` class. +# +# Note that this class will serve the most common use cases, but Ripper's +# API is extensive and undocumented. It relies on reporting the state of the +# parser at any given time. We do our best to replicate that here, but +# because it is a different architecture it is not possible to perfectly +# replicate the behavior of Ripper. +# +# The main known difference is that we may omit dispatching some events in +# some cases. This impacts the following events: +# +# - on_assign_error +# - on_comma +# - on_ignored_nl +# - on_ignored_sp +# - on_kw +# - on_label_end +# - on_lbrace +# - on_lbracket +# - on_lparen +# - on_nl +# - on_op +# - on_operator_ambiguous +# - on_rbrace +# - on_rbracket +# - on_rparen +# - on_semicolon +# - on_sp +# - on_symbeg +# - on_tstring_beg +# - on_tstring_end +# +# source://prism//lib/prism/translation/ripper.rb#43 +class Prism::Translation::Ripper < ::Prism::Compiler + # Create a new Translation::Ripper object with the given source. # - # foo ? bar : baz - # ^^^^^^^^^^^^^^^ + # @return [Ripper] a new instance of Ripper # - # source://prism//lib/prism/translation/parser/compiler.rb#750 - def visit_if_node(node); end + # source://prism//lib/prism/translation/ripper.rb#444 + def initialize(source, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end - # 1i + # The current column number of the parser. # - # source://prism//lib/prism/translation/parser/compiler.rb#791 - def visit_imaginary_node(node); end + # source://prism//lib/prism/translation/ripper.rb#441 + def column; end - # { foo: } - # ^^^^ + # True if the parser encountered an error during parsing. # - # @raise [CompilationError] + # @return [Boolean] # - # source://prism//lib/prism/translation/parser/compiler.rb#797 - def visit_implicit_node(node); end + # source://prism//lib/prism/translation/ripper.rb#457 + sig { returns(T::Boolean) } + def error?; end - # foo { |bar,| } - # ^ + # The filename of the source being parsed. # - # @raise [CompilationError] + # source://prism//lib/prism/translation/ripper.rb#435 + def filename; end + + # The current line number of the parser. # - # source://prism//lib/prism/translation/parser/compiler.rb#803 - def visit_implicit_rest_node(node); end + # source://prism//lib/prism/translation/ripper.rb#438 + def lineno; end - # case foo; in bar; end - # ^^^^^^^^^^^^^^^^^^^^^ + # Parse the source and return the result. # - # source://prism//lib/prism/translation/parser/compiler.rb#809 - def visit_in_node(node); end + # source://prism//lib/prism/translation/ripper.rb#462 + sig { returns(T.untyped) } + def parse; end - # foo[bar] += baz - # ^^^^^^^^^^^^^^^ - # foo[bar] &&= baz - # ^^^^^^^^^^^^^^^^ + # The source that is being parsed. # - # source://prism//lib/prism/translation/parser/compiler.rb#835 - def visit_index_and_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#432 + def source; end - # foo[bar] += baz + # alias $foo $bar # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#835 - def visit_index_operator_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#561 + def visit_alias_global_variable_node(node); end - # foo[bar] += baz - # ^^^^^^^^^^^^^^^ - # foo[bar] ||= baz - # ^^^^^^^^^^^^^^^^ + # alias foo bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#835 - def visit_index_or_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#551 + def visit_alias_method_node(node); end - # foo[bar], = 1 - # ^^^^^^^^ + # foo => bar | baz + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#861 - def visit_index_target_node(node); end + # source://prism//lib/prism/translation/ripper.rb#585 + def visit_alternation_pattern_node(node); end - # ^^^^^^^^^^^ - # ^^^^^^^^^^^^ + # a and b + # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#891 - def visit_instance_variable_and_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#605 + def visit_and_node(node); end - # ^^^^^^^^^^^ + # foo(bar) + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#891 - def visit_instance_variable_operator_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#796 + def visit_arguments_node(node); end - # ^^^^^^^^^^^ - # ^^^^^^^^^^^^ + # [] + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#891 - def visit_instance_variable_or_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#615 + def visit_array_node(node); end - # ^^^^ + # foo => [bar] + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#872 - def visit_instance_variable_read_node(node); end + # source://prism//lib/prism/translation/ripper.rb#775 + def visit_array_pattern_node(node); end - # @foo, = bar - # ^^^^ + # { a: 1 } + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#909 - def visit_instance_variable_target_node(node); end + # source://prism//lib/prism/translation/ripper.rb#803 + def visit_assoc_node(node); end - # ^^^^^^^^ + # def foo(**); bar(**); end + # ^^ # - # @foo, @bar = 1 - # ^^^^ ^^^^ + # { **foo } + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#881 - def visit_instance_variable_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#816 + def visit_assoc_splat_node(node); end - # 1 - # ^ + # $+ + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#915 - def visit_integer_node(node); end + # source://prism//lib/prism/translation/ripper.rb#825 + def visit_back_reference_read_node(node); end - # /foo #{bar}/ - # ^^^^^^^^^^^^ - # if /foo #{bar}/ then end - # ^^^^^^^^^^^^ + # begin end + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#921 - def visit_interpolated_match_last_line_node(node); end + # source://prism//lib/prism/translation/ripper.rb#832 + def visit_begin_node(node); end - # /foo #{bar}/ - # ^^^^^^^^^^^^ + # foo(&bar) + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#921 - def visit_interpolated_regular_expression_node(node); end + # source://prism//lib/prism/translation/ripper.rb#896 + def visit_block_argument_node(node); end - # "foo #{bar}" - # ^^^^^^^^^^^^ + # foo { |; bar| } + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#936 - def visit_interpolated_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#902 + def visit_block_local_variable_node(node); end - # :"foo #{bar}" - # ^^^^^^^^^^^^^ + # Visit a BlockNode. # - # source://prism//lib/prism/translation/parser/compiler.rb#951 - def visit_interpolated_symbol_node(node); end + # source://prism//lib/prism/translation/ripper.rb#908 + def visit_block_node(node); end - # `foo #{bar}` - # ^^^^^^^^^^^^ + # def foo(&bar); end + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#961 - def visit_interpolated_x_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#944 + def visit_block_parameter_node(node); end - # foo(bar: baz) - # ^^^^^^^^ + # A block's parameters. # - # source://prism//lib/prism/translation/parser/compiler.rb#976 - def visit_keyword_hash_node(node); end + # source://prism//lib/prism/translation/ripper.rb#958 + def visit_block_parameters_node(node); end - # def foo(**bar); end - # ^^^^^ + # break + # ^^^^^ # - # def foo(**); end - # ^^ + # break foo + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#985 - def visit_keyword_rest_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#982 + def visit_break_node(node); end - # -> {} + # foo.bar &&= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#993 - def visit_lambda_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1194 + def visit_call_and_write_node(node); end - # foo += bar - # ^^^^^^^^^^ - # foo &&= bar - # ^^^^^^^^^^^ + # foo + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1037 - def visit_local_variable_and_write_node(node); end - - # foo += bar - # ^^^^^^^^^^ + # foo.bar + # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1037 - def visit_local_variable_operator_write_node(node); end - - # foo += bar - # ^^^^^^^^^^ - # foo ||= bar - # ^^^^^^^^^^^ + # foo.bar() {} + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1037 - def visit_local_variable_or_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1002 + def visit_call_node(node); end - # foo - # ^^^ + # foo.bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1018 - def visit_local_variable_read_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1172 + def visit_call_operator_write_node(node); end - # foo, = bar - # ^^^ + # foo.bar ||= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1055 - def visit_local_variable_target_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1216 + def visit_call_or_write_node(node); end - # foo = 1 + # foo.bar, = 1 # ^^^^^^^ # - # foo, bar = 1 - # ^^^ ^^^ + # source://prism//lib/prism/translation/ripper.rb#1238 + def visit_call_target_node(node); end + + # foo => bar => baz + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1027 - def visit_local_variable_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1263 + def visit_capture_pattern_node(node); end - # /foo/ - # ^^^^^ - # if /foo/ then end - # ^^^^^ + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1336 - def visit_match_last_line_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1286 + def visit_case_match_node(node); end - # source://prism//lib/prism/translation/parser/compiler.rb#1066 - def visit_match_predicate_node(node); end + # case foo; when bar; end + # ^^^^^^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1273 + def visit_case_node(node); end - # foo => bar - # ^^^^^^^^^^ + # class Foo; end + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1085 - def visit_match_required_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1299 + def visit_class_node(node); end - # /(?foo)/ =~ bar - # ^^^^^^^^^^^^^^^^^^^^ + # @@foo &&= bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1095 - def visit_match_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1352 + def visit_class_variable_and_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. + # @@foo += bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1106 - def visit_missing_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1338 + def visit_class_variable_operator_write_node(node); end - # module Foo; end - # ^^^^^^^^^^^^^^^ + # @@foo ||= bar + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1112 - def visit_module_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1366 + def visit_class_variable_or_write_node(node); end - # foo, bar = baz - # ^^^^^^^^ + # @@foo + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1123 - def visit_multi_target_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1317 + def visit_class_variable_read_node(node); end - # foo, bar = baz - # ^^^^^^^^^^^^^^ + # @@foo, = bar + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1137 - def visit_multi_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1380 + def visit_class_variable_target_node(node); end - # next - # ^^^^ + # @@foo = 1 + # ^^^^^^^^^ # - # next foo - # ^^^^^^^^ + # @@foo, @@bar = 1 + # ^^^^^ ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1158 - def visit_next_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1327 + def visit_class_variable_write_node(node); end - # nil - # ^^^ + # Foo &&= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1170 - def visit_nil_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1422 + def visit_constant_and_write_node(node); end - # def foo(**nil); end - # ^^^^^ + # Foo += bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1176 - def visit_no_keywords_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1408 + def visit_constant_operator_write_node(node); end - # -> { _1 + _2 } - # ^^^^^^^^^^^^^^ + # Foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1186 - def visit_numbered_parameters_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1436 + def visit_constant_or_write_node(node); end - # $1 - # ^^ + # Foo::Bar &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1192 - def visit_numbered_reference_read_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1523 + def visit_constant_path_and_write_node(node); end - # def foo(bar: baz); end - # ^^^^^^^^ + # Foo::Bar + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1198 - def visit_optional_keyword_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1457 + def visit_constant_path_node(node); end - # def foo(bar = 1); end - # ^^^^^^^ + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1204 - def visit_optional_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1509 + def visit_constant_path_operator_write_node(node); end - # a or b - # ^^^^^^ + # Foo::Bar ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1210 - def visit_or_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1537 + def visit_constant_path_or_write_node(node); end - # def foo(bar, *baz); end - # ^^^^^^^^^ + # Foo::Bar, = baz + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1216 - def visit_parameters_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1551 + def visit_constant_path_target_node(node); end - # () - # ^^ + # Foo::Bar = 1 + # ^^^^^^^^^^^^ # - # (1) + # Foo::Foo, Bar::Bar = 1 + # ^^^^^^^^ ^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1480 + def visit_constant_path_write_node(node); end + + # Foo # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1255 - def visit_parentheses_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1387 + def visit_constant_read_node(node); end - # foo => ^(bar) - # ^^^^^^ + # Foo, = bar + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1265 - def visit_pinned_expression_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1450 + def visit_constant_target_node(node); end - # foo = 1 and bar => ^foo - # ^^^^ + # Foo = 1 + # ^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1271 - def visit_pinned_variable_node(node); end + # Foo, Bar = 1 + # ^^^ ^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1397 + def visit_constant_write_node(node); end - # END {} + # def foo; end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1276 - def visit_post_execution_node(node); end + # def self.foo; end + # ^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1560 + def visit_def_node(node); end - # BEGIN {} + # defined? a + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1286 - def visit_pre_execution_node(node); end + # defined?(a) + # ^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1607 + def visit_defined_node(node); end - # The top-level program node. + # if foo then bar else baz end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1296 - def visit_program_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1614 + def visit_else_node(node); end - # 0..5 - # ^^^^ + # "foo #{bar}" + # ^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1302 - def visit_range_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1630 + def visit_embedded_statements_node(node); end - # 1r - # ^^ + # "foo #@bar" + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1324 - def visit_rational_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1651 + def visit_embedded_variable_node(node); end - # redo - # ^^^^ + # Visit an EnsureNode node. # - # source://prism//lib/prism/translation/parser/compiler.rb#1330 - def visit_redo_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1662 + def visit_ensure_node(node); end - # /foo/ + # false # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1336 - def visit_regular_expression_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1680 + def visit_false_node(node); end - # def foo(bar:); end - # ^^^^ + # foo => [*, bar, *] + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1351 - def visit_required_keyword_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1687 + def visit_find_pattern_node(node); end - # def foo(bar); end - # ^^^ + # if foo .. bar; end + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1357 - def visit_required_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1712 + def visit_flip_flop_node(node); end - # foo rescue bar - # ^^^^^^^^^^^^^^ + # 1.0 + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1363 - def visit_rescue_modifier_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1726 + def visit_float_node(node); end - # begin; rescue; end - # ^^^^^^^ - # - # @raise [CompilationError] + # for foo in bar do end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1381 - def visit_rescue_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1732 + def visit_for_node(node); end - # def foo(*bar); end - # ^^^^ + # def foo(...); bar(...); end + # ^^^ # - # def foo(*); end - # ^ + # source://prism//lib/prism/translation/ripper.rb#1749 + def visit_forwarding_arguments_node(node); end + + # def foo(...); end + # ^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1390 - def visit_rest_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1756 + def visit_forwarding_parameter_node(node); end - # retry + # super # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1396 - def visit_retry_node(node); end + # super {} + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1766 + def visit_forwarding_super_node(node); end + + # $foo &&= bar + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1815 + def visit_global_variable_and_write_node(node); end - # return - # ^^^^^^ + # $foo += bar + # ^^^^^^^^^^^ # - # return 1 - # ^^^^^^^^ + # source://prism//lib/prism/translation/ripper.rb#1801 + def visit_global_variable_operator_write_node(node); end + + # $foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1405 - def visit_return_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1829 + def visit_global_variable_or_write_node(node); end - # self + # $foo # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1417 - def visit_self_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1780 + def visit_global_variable_read_node(node); end - # class << self; end - # ^^^^^^^^^^^^^^^^^^ + # $foo, = bar + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1423 - def visit_singleton_class_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1843 + def visit_global_variable_target_node(node); end - # __ENCODING__ - # ^^^^^^^^^^^^ + # $foo = 1 + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1435 - def visit_source_encoding_node(node); end + # $foo, $bar = 1 + # ^^^^ ^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#1790 + def visit_global_variable_write_node(node); end - # __FILE__ - # ^^^^^^^^ + # {} + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1441 - def visit_source_file_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1850 + def visit_hash_node(node); end - # __LINE__ - # ^^^^^^^^ + # foo => {} + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1447 - def visit_source_line_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1865 + def visit_hash_pattern_node(node); end - # foo(*bar) - # ^^^^ + # if foo then bar end + # ^^^^^^^^^^^^^^^^^^^ # - # def foo((bar, *baz)); end - # ^^^^ + # bar if foo + # ^^^^^^^^^^ # - # def foo(*); bar(*); end - # ^ + # foo ? bar : baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1459 - def visit_splat_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1907 + def visit_if_node(node); end - # A list of statements. + # 1i + # ^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1472 - def visit_statements_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1943 + def visit_imaginary_node(node); end - # "foo" - # ^^^^^ + # { foo: } + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1478 - def visit_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1949 + def visit_implicit_node(node); end - # super(foo) - # ^^^^^^^^^^ + # foo { |bar,| } + # ^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1495 - def visit_super_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1954 + def visit_implicit_rest_node(node); end - # :foo - # ^^^^ + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1518 - def visit_symbol_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1961 + def visit_in_node(node); end - # true - # ^^^^ + # foo[bar] &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1536 - def visit_true_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1996 + def visit_index_and_write_node(node); end - # undef foo - # ^^^^^^^^^ + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1542 - def visit_undef_node(node); end + # source://prism//lib/prism/translation/ripper.rb#1979 + def visit_index_operator_write_node(node); end - # unless foo; bar end - # ^^^^^^^^^^^^^^^^^^^ - # - # bar unless foo - # ^^^^^^^^^^^^^^ + # foo[bar] ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1551 - def visit_unless_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2013 + def visit_index_or_write_node(node); end - # until foo; bar end - # ^^^^^^^^^^^^^^^^^ - # - # bar until foo - # ^^^^^^^^^^^^^ + # foo[bar], = 1 + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1581 - def visit_until_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2030 + def visit_index_target_node(node); end - # case foo; when bar; end - # ^^^^^^^^^^^^^ + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1603 - def visit_when_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2072 + def visit_instance_variable_and_write_node(node); end - # while foo; bar end - # ^^^^^^^^^^^^^^^^^^ + # ^^^^^^^^^^^ # - # bar while foo - # ^^^^^^^^^^^^^ + # source://prism//lib/prism/translation/ripper.rb#2058 + def visit_instance_variable_operator_write_node(node); end + + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1617 - def visit_while_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2086 + def visit_instance_variable_or_write_node(node); end - # `foo` - # ^^^^^ + # ^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1639 - def visit_x_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2040 + def visit_instance_variable_read_node(node); end - # yield - # ^^^^^ + # @foo, = bar + # ^^^^ # - # yield 1 - # ^^^^^^^ + # source://prism//lib/prism/translation/ripper.rb#2100 + def visit_instance_variable_target_node(node); end + + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1657 - def visit_yield_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2047 + def visit_instance_variable_write_node(node); end - private + # 1 + # ^ + # + # source://prism//lib/prism/translation/ripper.rb#2107 + def visit_integer_node(node); end - # Initialize a new compiler with the given option overrides, used to - # visit a subtree with the given options. + # if /foo #{bar}/ then end + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1671 - def copy_compiler(forwarding: T.unsafe(nil), in_destructure: T.unsafe(nil), in_pattern: T.unsafe(nil)); end + # source://prism//lib/prism/translation/ripper.rb#2113 + def visit_interpolated_match_last_line_node(node); 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. + # /foo #{bar}/ + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1678 - def find_forwarding(node); end + # source://prism//lib/prism/translation/ripper.rb#2132 + def visit_interpolated_regular_expression_node(node); end - # Blocks can have a special set of parameters that automatically expand - # when given arrays if they have a single required parameter and no - # other parameters. + # "foo #{bar}" + # ^^^^^^^^^^^^ # - # @return [Boolean] + # source://prism//lib/prism/translation/ripper.rb#2151 + def visit_interpolated_string_node(node); end + + # :"foo #{bar}" + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1693 - def procarg0?(parameters); end + # source://prism//lib/prism/translation/ripper.rb#2179 + def visit_interpolated_symbol_node(node); end - # Constructs a new source range from the given start and end offsets. + # `foo #{bar}` + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1710 - def srange(location); end + # source://prism//lib/prism/translation/ripper.rb#2192 + def visit_interpolated_x_string_node(node); end - # Constructs a new source range by finding the given tokens between the - # given start offset and end offset. If the needle is not found, it - # returns nil. + # -> { it } + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1722 - def srange_find(start_offset, end_offset, tokens); end + # source://prism//lib/prism/translation/ripper.rb#2222 + def visit_it_parameters_node(node); end - # Constructs a new source range from the given start and end offsets. + # foo(bar: baz) + # ^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1715 - def srange_offsets(start_offset, end_offset); end + # source://prism//lib/prism/translation/ripper.rb#2227 + def visit_keyword_hash_node(node); end - # Transform a location into a token that the parser gem expects. + # def foo(**bar); end + # ^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1731 - def token(location); end + # def foo(**); end + # ^^ + # + # source://prism//lib/prism/translation/ripper.rb#2239 + def visit_keyword_rest_parameter_node(node); end - # Visit a block node on a call. + # -> {} # - # source://prism//lib/prism/translation/parser/compiler.rb#1736 - def visit_block(call, block); end + # source://prism//lib/prism/translation/ripper.rb#2253 + def visit_lambda_node(node); end - # Visit a heredoc that can be either a string or an xstring. + # foo &&= bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1769 - def visit_heredoc(node); end + # source://prism//lib/prism/translation/ripper.rb#2350 + def visit_local_variable_and_write_node(node); end - # Visit a numeric node and account for the optional sign. + # foo += bar + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1815 - def visit_numeric(node, value); end + # source://prism//lib/prism/translation/ripper.rb#2336 + def visit_local_variable_operator_write_node(node); end - # Within the given block, track that we're within a pattern. + # foo ||= bar + # ^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/compiler.rb#1827 - def within_pattern; end -end + # source://prism//lib/prism/translation/ripper.rb#2364 + def visit_local_variable_or_write_node(node); end -# Raised when the tree is malformed or there is a bug in the compiler. -# -# source://prism//lib/prism/translation/parser/compiler.rb#10 -class Prism::Translation::Parser::Compiler::CompilationError < ::StandardError; end + # foo + # ^^^ + # + # source://prism//lib/prism/translation/ripper.rb#2313 + def visit_local_variable_read_node(node); 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#1707 -Prism::Translation::Parser::Compiler::Range = Parser::Source::Range + # foo, = bar + # ^^^ + # + # source://prism//lib/prism/translation/ripper.rb#2378 + def visit_local_variable_target_node(node); end -# 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#15 -class Prism::Translation::Parser::Diagnostic < ::Parser::Diagnostic - # Initialize a new diagnostic with the given message and location. + # foo = 1 + # ^^^^^^^ # - # @return [Diagnostic] a new instance of Diagnostic + # source://prism//lib/prism/translation/ripper.rb#2325 + def visit_local_variable_write_node(node); end + + # if /foo/ then end + # ^^^^^ # - # source://prism//lib/prism/translation/parser.rb#20 - def initialize(message, location); end + # source://prism//lib/prism/translation/ripper.rb#2385 + def visit_match_last_line_node(node); end - # The message generated by prism. + # foo in bar + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser.rb#17 - def message; end -end + # source://prism//lib/prism/translation/ripper.rb#2400 + def visit_match_predicate_node(node); end -# 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#8 -class Prism::Translation::Parser::Lexer - # Initialize the lexer with the given source buffer, prism tokens, and - # offset cache. + # foo => bar + # ^^^^^^^^^^ # - # @return [Lexer] a new instance of Lexer + # source://prism//lib/prism/translation/ripper.rb#2409 + def visit_match_required_node(node); end + + # /(?foo)/ =~ bar + # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#193 - def initialize(source_buffer, lexed, offset_cache); end + # source://prism//lib/prism/translation/ripper.rb#2418 + def visit_match_write_node(node); end - # An array of prism tokens that we lexed. + # 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/parser/lexer.rb#186 - def lexed; end + # source://prism//lib/prism/translation/ripper.rb#2424 + def visit_missing_node(node); end - # A hash that maps offsets in bytes to offsets in characters. + # module Foo; end + # ^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#189 - def offset_cache; end + # source://prism//lib/prism/translation/ripper.rb#2430 + def visit_module_node(node); end - # The Parser::Source::Buffer that the tokens were lexed from. + # (foo, bar), bar = qux + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#183 - def source_buffer; end + # source://prism//lib/prism/translation/ripper.rb#2447 + def visit_multi_target_node(node); end - # Convert the prism tokens into the expected format for the parser gem. + # foo, bar = baz + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#203 - def to_a; end + # source://prism//lib/prism/translation/ripper.rb#2501 + def visit_multi_write_node(node); end - private + # next + # ^^^^ + # + # next foo + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#2521 + def visit_next_node(node); end - # Parse a complex from the string representation. + # nil + # ^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#310 - def parse_complex(value); end + # source://prism//lib/prism/translation/ripper.rb#2535 + def visit_nil_node(node); end - # Parse a rational from the string representation. + # def foo(**nil); end + # ^^^^^ # - # source://prism//lib/prism/translation/parser/lexer.rb#323 - def parse_rational(value); end -end + # source://prism//lib/prism/translation/ripper.rb#2542 + def visit_no_keywords_parameter_node(node); end -# source://prism//lib/prism/translation/parser/lexer.rb#199 -Prism::Translation::Parser::Lexer::Range = Parser::Source::Range + # -> { _1 + _2 } + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#2551 + def visit_numbered_parameters_node(node); end -# The direct translating of types between the two lexers. -# -# source://prism//lib/prism/translation/parser/lexer.rb#10 -Prism::Translation::Parser::Lexer::TYPES = T.let(T.unsafe(nil), Hash) + # $1 + # ^^ + # + # source://prism//lib/prism/translation/ripper.rb#2556 + def visit_numbered_reference_read_node(node); end -# source://prism//lib/prism/translation/parser.rb#26 -Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) + # def foo(bar: baz); end + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#2563 + def visit_optional_keyword_parameter_node(node); end -# Note: This integration is not finished, and therefore still has many -# inconsistencies with Ripper. If you'd like to help out, pull requests would -# be greatly appreciated! -# -# This class is meant to provide 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. -# -# This class is going to necessarily be slower than the native Ripper API. It -# is meant as a stopgap until developers migrate to using prism. It is also -# meant as a test harness for the prism parser. -# -# To use this class, you treat `Prism::Translation::Ripper` effectively as you would -# treat the `Ripper` class. -# -# source://prism//lib/prism/translation/ripper.rb#21 -class Prism::Translation::Ripper < ::Prism::Compiler - # Create a new Translation::Ripper object with the given source. + # def foo(bar = 1); end + # ^^^^^^^ # - # @return [Ripper] a new instance of Ripper + # source://prism//lib/prism/translation/ripper.rb#2573 + def visit_optional_parameter_node(node); end + + # a or b + # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#75 - def initialize(source); end + # source://prism//lib/prism/translation/ripper.rb#2583 + def visit_or_node(node); end - # The current column number of the parser. + # def foo(bar, *baz); end + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#72 - def column; end + # source://prism//lib/prism/translation/ripper.rb#2593 + def visit_parameters_node(node); end - # True if the parser encountered an error during parsing. + # () + # ^^ # - # @return [Boolean] + # (1) + # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#87 - def error?; end + # source://prism//lib/prism/translation/ripper.rb#2620 + def visit_parentheses_node(node); end - # The current line number of the parser. + # foo => ^(bar) + # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#69 - def lineno; end + # source://prism//lib/prism/translation/ripper.rb#2634 + def visit_pinned_expression_node(node); end - # Parse the source and return the result. + # foo = 1 and bar => ^foo + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#92 - def parse; end + # source://prism//lib/prism/translation/ripper.rb#2643 + def visit_pinned_variable_node(node); end - # The source that is being parsed. + # END {} + # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#66 - def source; end + # source://prism//lib/prism/translation/ripper.rb#2649 + def visit_post_execution_node(node); end - # Visit an AliasGlobalVariableNode. + # BEGIN {} + # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#247 - def visit_alias_global_variable_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2664 + def visit_pre_execution_node(node); end - # Visit an AliasMethodNode. + # The top-level program node. # - # source://prism//lib/prism/translation/ripper.rb#226 - def visit_alias_method_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2678 + def visit_program_node(node); end - # Visit an AndNode. + # 0..5 + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#264 - def visit_and_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2689 + def visit_range_node(node); end - # Visit an ArrayNode node. + # 1r + # ^^ # - # source://prism//lib/prism/translation/ripper.rb#113 - def visit_array_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2703 + def visit_rational_node(node); end - # Visit a BackReferenceReadNode. + # redo + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#258 - def visit_back_reference_read_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2709 + def visit_redo_node(node); end - # Visit a BeginNode node. - # This is not at all bulletproof against different structures of begin/rescue/else/ensure/end. + # /foo/ + # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#315 - def visit_begin_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2716 + def visit_regular_expression_node(node); end - # Visit a BlockNode. + # def foo(bar:); end + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#191 - def visit_block_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2738 + def visit_required_keyword_parameter_node(node); end - # Visit a BlockParametersNode. + # def foo(bar); end + # ^^^ # - # source://prism//lib/prism/translation/ripper.rb#200 - def visit_block_parameters_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2745 + def visit_required_parameter_node(node); end - # Visit a BreakNode. + # foo rescue bar + # ^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#218 - def visit_break_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2752 + def visit_rescue_modifier_node(node); end - # Visit a CallNode node. - # Ripper distinguishes between many different method-call - # nodes -- unary and binary operators, "command" calls with - # no parentheses, and call/fcall/vcall. + # begin; rescue; end + # ^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#123 - def visit_call_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2762 + def visit_rescue_node(node); end - # Visit an EmbeddedStatementsNode node. + # def foo(*bar); end + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#371 - def visit_embedded_statements_node(node); end - - # Visit a FalseNode. + # def foo(*); end + # ^ # - # source://prism//lib/prism/translation/ripper.rb#280 - def visit_false_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2820 + def visit_rest_parameter_node(node); end - # Visit a FloatNode node. + # retry + # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#286 - def visit_float_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2832 + def visit_retry_node(node); end - # Visit a GlobalVariableReadNode. + # return + # ^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#252 - def visit_global_variable_read_node(node); end - - # Visit a ImaginaryNode node. + # return 1 + # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#291 - def visit_imaginary_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2842 + def visit_return_node(node); end - # Visit an IntegerNode node. + # self + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#296 - def visit_integer_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2856 + def visit_self_node(node); end - # Visit an InterpolatedStringNode node. + # A shareable constant. # - # source://prism//lib/prism/translation/ripper.rb#366 - def visit_interpolated_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2862 + def visit_shareable_constant_node(node); end - # Visit an InterpolatedSymbolNode node. + # class << self; end + # ^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#381 - def visit_interpolated_symbol_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2868 + def visit_singleton_class_node(node); end - # Visit a LocalVariableAndWriteNode. + # __ENCODING__ + # ^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#168 - def visit_local_variable_and_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2878 + def visit_source_encoding_node(node); end - # Visit nodes for +=, *=, -=, etc., called LocalVariableOperatorWriteNodes. + # __FILE__ + # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#178 - def visit_local_variable_operator_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2885 + def visit_source_file_node(node); end - # Visit a LocalVariableOrWriteNode. + # __LINE__ + # ^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#173 - def visit_local_variable_or_write_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2892 + def visit_source_line_node(node); end - # Visit a LocalVariableReadNode. + # foo(*bar) + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#183 - def visit_local_variable_read_node(node); end - - # Visit a LocalVariableWriteNode. + # def foo((bar, *baz)); end + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#161 - def visit_local_variable_write_node(node); end - - # Visit an OrNode. + # def foo(*); bar(*); end + # ^ # - # source://prism//lib/prism/translation/ripper.rb#269 - def visit_or_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2905 + def visit_splat_node(node); end - # Visit a ParametersNode. - # This will require expanding as we support more kinds of parameters. + # A list of statements. # - # source://prism//lib/prism/translation/ripper.rb#206 - def visit_parameters_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2910 + def visit_statements_node(node); end - # Visit a ParenthesesNode node. + # "foo" + # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#301 - def visit_parentheses_node(node); end + # source://prism//lib/prism/translation/ripper.rb#2927 + def visit_string_node(node); end - # Visit a ProgramNode node. + # super(foo) + # ^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#327 - def visit_program_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3059 + def visit_super_node(node); end - # Visit a RangeNode node. + # :foo + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#334 - def visit_range_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3080 + def visit_symbol_node(node); end - # Visit a RationalNode node. + # true + # ^^^^ # - # source://prism//lib/prism/translation/ripper.rb#347 - def visit_rational_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3104 + def visit_true_node(node); end - # Visit a RequiredParameterNode. + # undef foo + # ^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#212 - def visit_required_parameter_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3111 + def visit_undef_node(node); end - # Visit a RescueNode node. + # unless foo; bar end + # ^^^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#322 - def visit_rescue_node(node); end + # bar unless foo + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#3123 + def visit_unless_node(node); end - # Visit a StatementsNode node. + # until foo; bar end + # ^^^^^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#386 - def visit_statements_node(node); end + # bar until foo + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#3151 + def visit_until_node(node); end - # Visit a StringNode node. + # case foo; when bar; end + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#352 - def visit_string_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3175 + def visit_when_node(node); end - # Visit a SymbolNode node. + # while foo; bar end + # ^^^^^^^^^^^^^^^^^^ + # + # bar while foo + # ^^^^^^^^^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#376 - def visit_symbol_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3196 + def visit_while_node(node); end - # Visit a TrueNode. + # `foo` + # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#274 - def visit_true_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3220 + def visit_x_string_node(node); end - # Visit an XStringNode node. + # yield + # ^^^^^ # - # source://prism//lib/prism/translation/ripper.rb#359 - def visit_x_string_node(node); end + # yield 1 + # ^^^^^^^ + # + # source://prism//lib/prism/translation/ripper.rb#3243 + def visit_yield_node(node); end private - # source://prism//lib/prism/translation/ripper.rb#680 - def _dispatch0; end + # :stopdoc: + # + # source://prism//lib/prism/translation/ripper.rb#3387 + def _dispatch_0; end - # source://prism//lib/prism/translation/ripper.rb#681 - def _dispatch1(_); end + # source://prism//lib/prism/translation/ripper.rb#3388 + def _dispatch_1(_); end - # source://prism//lib/prism/translation/ripper.rb#682 - def _dispatch2(_, _); end + # source://prism//lib/prism/translation/ripper.rb#3389 + def _dispatch_2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#683 - def _dispatch3(_, _, _); end + # source://prism//lib/prism/translation/ripper.rb#3390 + def _dispatch_3(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#684 - def _dispatch4(_, _, _, _); end + # source://prism//lib/prism/translation/ripper.rb#3391 + def _dispatch_4(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#685 - def _dispatch5(_, _, _, _, _); end + # source://prism//lib/prism/translation/ripper.rb#3392 + def _dispatch_5(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#686 - def _dispatch7(_, _, _, _, _, _, _); end + # source://prism//lib/prism/translation/ripper.rb#3393 + def _dispatch_7(_, _, _, _, _, _, _); end # This method is responsible for updating lineno and column information # to reflect the current node. @@ -27708,1331 +34182,1542 @@ 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#663 + # source://prism//lib/prism/translation/ripper.rb#3377 def bounds(location); end - # If we need to do something unusual, we can directly update the line number - # and column to reflect the current node. + # Returns true if the given node is a command node. + # + # @return [Boolean] + # + # source://prism//lib/prism/translation/ripper.rb#1163 + def command?(node); end + + # This method is called when the parser found syntax error. # - # source://prism//lib/prism/translation/ripper.rb#670 - def bounds_values(lineno, column); end + # source://prism//lib/prism/translation/ripper.rb#3415 + def compile_error(msg); end - # For CRuby et al, "no block" in an on_block_var is false + # This method is provided by the Ripper C extension. It is called when a + # string needs to be dedented because of a tilde heredoc. It is expected + # that it will modify the string in place and return the number of bytes + # that were removed. # - # source://prism//lib/prism/translation/ripper.rb#646 - def no_block_value; end + # source://prism//lib/prism/translation/ripper.rb#3430 + def dedent_string(string, width); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_BEGIN(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_CHAR(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_END(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on___end__(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_alias_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_aref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_aref_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_arg_ambiguous(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_arg_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_args_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_args_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_args_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_args_forward; end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_args_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_array(_); end - # source://prism//lib/prism/translation/ripper.rb#684 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_aryptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_assign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_assign_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_assoc_new(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_assoc_splat(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_assoclist_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_backref(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_backtick(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_bare_assoc_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_begin(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_binary(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_block_var(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_blockarg(_); end - # source://prism//lib/prism/translation/ripper.rb#684 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_bodystmt(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_brace_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_break(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_call(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_case(_, _); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_class(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_class_name_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_comma(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_command(_, _); end - # source://prism//lib/prism/translation/ripper.rb#684 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_command_call(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_comment(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_const(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_const_path_field(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_const_path_ref(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_cvar(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_def(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_defined(_); end - # source://prism//lib/prism/translation/ripper.rb#685 + # source://prism//lib/prism/translation/ripper.rb#3392 def on_defs(_, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_do_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_dot2(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_dot3(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_dyna_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_else(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_elsif(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embdoc(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embdoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embdoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embexpr_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embexpr_end(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_embvar(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_ensure(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_excessed_comma; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_fcall(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_field(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_float(_); end - # source://prism//lib/prism/translation/ripper.rb#684 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_fndptn(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_for(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_gvar(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_hash(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_heredoc_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_heredoc_dedent(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_heredoc_end(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_hshptn(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_ident(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_if(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_if_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_ifop(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_ignored_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_ignored_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_imaginary(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_in(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_int(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_ivar(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_kw(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_kwrest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_label(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_label_end(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_lambda(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_lbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_lbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_lparen(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_magic_comment(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_massign(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_method_add_arg(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_method_add_block(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mlhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mlhs_add_post(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mlhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_mlhs_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_mlhs_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_module(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mrhs_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_mrhs_add_star(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_mrhs_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_mrhs_new_from_args(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_next(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_nl(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_nokw_param(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_op(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_opassign(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_operator_ambiguous(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_param_error(_, _); end - # source://prism//lib/prism/translation/ripper.rb#686 + # source://prism//lib/prism/translation/ripper.rb#3393 def on_params(_, _, _, _, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_paren(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_parse_error(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_period(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_program(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_qsymbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_qsymbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_qsymbols_new; end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_qwords_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_qwords_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_qwords_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_rational(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_rbrace(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_rbracket(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_redo; end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_regexp_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_regexp_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_regexp_end(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_regexp_literal(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_regexp_new; end - # source://prism//lib/prism/translation/ripper.rb#684 + # source://prism//lib/prism/translation/ripper.rb#3391 def on_rescue(_, _, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_rescue_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_rest_param(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_retry; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_return(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_return0; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_rparen(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_sclass(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_semicolon(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_sp(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_stmts_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_stmts_new; end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_string_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_string_concat(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_string_content; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_string_dvar(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_string_embexpr(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_string_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_super(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_symbeg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_symbol(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_symbol_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_symbols_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_symbols_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_symbols_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_tlambda(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_tlambeg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_top_const_field(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_top_const_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_tstring_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_tstring_content(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_tstring_end(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_unary(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_undef(_); end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_unless(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_unless_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_until(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_until_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_var_alias(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_var_field(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_var_ref(_); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_vcall(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_void_stmt; end - # source://prism//lib/prism/translation/ripper.rb#683 + # source://prism//lib/prism/translation/ripper.rb#3390 def on_when(_, _, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_while(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_while_mod(_, _); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_word_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_word_new; end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_words_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_words_beg(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_words_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_words_sep(_); end - # source://prism//lib/prism/translation/ripper.rb#682 + # source://prism//lib/prism/translation/ripper.rb#3389 def on_xstring_add(_, _); end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_xstring_literal(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_xstring_new; end - # source://prism//lib/prism/translation/ripper.rb#681 + # source://prism//lib/prism/translation/ripper.rb#3388 def on_yield(_); end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_yield0; end - # source://prism//lib/prism/translation/ripper.rb#680 + # source://prism//lib/prism/translation/ripper.rb#3387 def on_zsuper; end # Lazily initialize the parse result. # - # source://prism//lib/prism/translation/ripper.rb#676 + # source://prism//lib/prism/translation/ripper.rb#3269 def result; end - # In Prism this is a CallNode with :[]= as the operator. - # In Ripper it's an :aref_field. + # Returns true if there is a comma between the two locations. + # + # @return [Boolean] # - # source://prism//lib/prism/translation/ripper.rb#521 - def visit_aref_field_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3282 + def trailing_comma?(left, right); end - # In Prism this is a CallNode with :[] as the operator. - # In Ripper it's an :aref. + # Visit one side of an alias global variable node. # - # source://prism//lib/prism/translation/ripper.rb#513 - def visit_aref_node(node); end + # source://prism//lib/prism/translation/ripper.rb#570 + def visit_alias_global_variable_node_value(node); end - # Visit an operation-and-assign node, such as +=. + # Visit a list of elements, like the elements of an array or arguments. # - # source://prism//lib/prism/translation/ripper.rb#501 - def visit_binary_op_assign(node, operator: T.unsafe(nil)); end + # source://prism//lib/prism/translation/ripper.rb#756 + def visit_arguments(elements); end - # Visit a binary operator node like an AndNode or OrNode + # Visit the clauses of a begin node to form an on_bodystmt call. # - # source://prism//lib/prism/translation/ripper.rb#652 - def visit_binary_operator(node); end + # source://prism//lib/prism/translation/ripper.rb#840 + def visit_begin_node_clauses(location, node, allow_newline); end - # Visit a list of elements, like the elements of an array or arguments. + # 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 + 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#1136 + 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#1489 + def visit_constant_path_write_node_target(node); end + + # Visit a destructured positional parameter node. + # + # source://prism//lib/prism/translation/ripper.rb#2607 + def visit_destructured_parameter_node(node); end + + # Visit a string that is expressed using a <<~ heredoc. + # + # source://prism//lib/prism/translation/ripper.rb#2978 + def visit_heredoc_node(parts, base); end + + # Ripper gives back the escaped string content but strips out the common + # leading whitespace. Prism gives back the unescaped string content and + # a location for the escaped string content. Unfortunately these don't + # work well together, so here we need to re-derive the common leading + # whitespace. + # + # source://prism//lib/prism/translation/ripper.rb#2953 + def visit_heredoc_node_whitespace(parts); end + + # Visit a heredoc node that is representing a string. # - # source://prism//lib/prism/translation/ripper.rb#474 - def visit_elements(elements); end + # source://prism//lib/prism/translation/ripper.rb#3024 + def visit_heredoc_string_node(node); end - # Visit an InterpolatedStringNode or an InterpolatedSymbolNode node. + # Visit a heredoc node that is representing an xstring. # - # source://prism//lib/prism/translation/ripper.rb#482 - def visit_enumerated_node(node); end + # source://prism//lib/prism/translation/ripper.rb#3041 + def visit_heredoc_x_string_node(node); end - # Generate Ripper events for a CallNode with no opening_loc + # Visit the targets of a multi-target node. # - # source://prism//lib/prism/translation/ripper.rb#410 - def visit_no_paren_call(node); end + # source://prism//lib/prism/translation/ripper.rb#2460 + 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#611 - def visit_number(node); end + # source://prism//lib/prism/translation/ripper.rb#3321 + def visit_number_node(node); end - # Ripper has several methods of emitting a symbol literal. Inside an alias - # sometimes it suppresses the [:symbol] wrapper around ident. If the symbol - # is also the name of a keyword (e.g. :if) it will emit a :@kw wrapper, not - # an :@ident wrapper, with similar treatment for constants and operators. + # 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#580 - def visit_symbol_literal_node(node, no_symbol_wrapper: T.unsafe(nil)); end + # source://prism//lib/prism/translation/ripper.rb#595 + def visit_pattern_node(node); end - # For most Rubies and JRuby after 9.4.6.0 this is a no-op. + # Visit the list of statements of a statements node. We support nil + # statements in the list. This would normally not be allowed by the + # 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#634 - def visit_unary_operator(value); end + # source://prism//lib/prism/translation/ripper.rb#2919 + def visit_statements_node_body(body); end - class << self - # This is a convenience method that runs the SexpBuilderPP subclass parser. - # - # source://prism//lib/prism/translation/ripper.rb#403 - def sexp(source); end + # Visit an individual part of a string-like node. + # + # source://prism//lib/prism/translation/ripper.rb#2211 + def visit_string_content(part); end - # This is a convenience method that runs the SexpBuilder subclass parser. - # - # source://prism//lib/prism/translation/ripper.rb#398 - def sexp_raw(source); 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#3294 + 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 + 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#3339 + 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#3287 + 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#3406 + 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#3411 + def warning(fmt, *args); end + + class << self + # Tokenizes the Ruby program and returns an array of an array, + # which is formatted like + # [[lineno, column], type, token, state]. + # The +filename+ argument is mostly ignored. + # By default, this method does not handle syntax errors in +src+, + # use the +raise_errors+ keyword to raise a SyntaxError for an error in +src+. + # + # require "ripper" + # require "pp" + # + # pp Ripper.lex("def m(a) nil end") + # #=> [[[1, 0], :on_kw, "def", FNAME ], + # [[1, 3], :on_sp, " ", FNAME ], + # [[1, 4], :on_ident, "m", ENDFN ], + # [[1, 5], :on_lparen, "(", BEG|LABEL], + # [[1, 6], :on_ident, "a", ARG ], + # [[1, 7], :on_rparen, ")", ENDFN ], + # [[1, 8], :on_sp, " ", BEG ], + # [[1, 9], :on_kw, "nil", END ], + # [[1, 12], :on_sp, " ", END ], + # [[1, 13], :on_kw, "end", END ]] + # + # source://prism//lib/prism/translation/ripper.rb#72 + 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 + def parse(src, filename = T.unsafe(nil), lineno = T.unsafe(nil)); end + + # Parses +src+ and create S-exp tree. + # Returns more readable tree rather than Ripper.sexp_raw. + # This method is mainly for developer use. + # The +filename+ argument is mostly ignored. + # By default, this method does not handle syntax errors in +src+, + # returning +nil+ in such cases. Use the +raise_errors+ keyword + # to raise a SyntaxError for an error in +src+. + # + # require "ripper" + # require "pp" + # + # pp Ripper.sexp("def m(a) nil end") + # #=> [:program, + # [[:def, + # [:@ident, "m", [1, 4]], + # [: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 + def sexp(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end + + # Parses +src+ and create S-exp tree. + # This method is mainly for developer use. + # The +filename+ argument is mostly ignored. + # By default, this method does not handle syntax errors in +src+, + # returning +nil+ in such cases. Use the +raise_errors+ keyword + # to raise a SyntaxError for an error in +src+. + # + # require "ripper" + # require "pp" + # + # pp Ripper.sexp_raw("def m(a) nil end") + # #=> [:program, + # [:stmts_add, + # [:stmts_new], + # [:def, + # [:@ident, "m", [1, 4]], + # [:paren, [:params, [[:@ident, "a", [1, 6]]], nil, nil, nil]], + # [:bodystmt, + # [:stmts_add, [:stmts_new], [:var_ref, [:@kw, "nil", [1, 9]]]], + # nil, + # nil, + # nil]]]] + # + # source://prism//lib/prism/translation/ripper.rb#416 + def sexp_raw(src, filename = T.unsafe(nil), lineno = T.unsafe(nil), raise_errors: T.unsafe(nil)); end end end -# In an alias statement Ripper will emit @kw instead of @ident if the object -# being aliased is a Ruby keyword. For instance, in the line "alias :foo :if", -# the :if is treated as a lexer keyword. So we need to know what symbols are -# also keywords. +# A list of all of the Ruby binary operators. +# +# source://prism//lib/prism/translation/ripper.rb#337 +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 +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 +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 +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 +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#532 -Prism::Translation::Ripper::RUBY_KEYWORDS = T.let(T.unsafe(nil), Array) +# source://prism//lib/prism/translation/ripper.rb#286 +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 +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.rb#24 +# source://prism//lib/prism/translation/ripper/sexp.rb#10 class Prism::Translation::Ripper::SexpBuilder < ::Prism::Translation::Ripper - private + # :stopdoc: + # + # source://prism//lib/prism/translation/ripper/sexp.rb#13 + def error; end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_BEGIN(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_CHAR(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_CHAR(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_END(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on___end__(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on___end__(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_alias(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_alias_error(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aref(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aref_field(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_arg_ambiguous(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_arg_paren(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add_block(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_add_star(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_forward(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_args_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_array(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_aryptn(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assign(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assign_error(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoc_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoc_splat(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_assoclist_from_args(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_backref(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_backref(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_backtick(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_backtick(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_bare_assoc_hash(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_begin(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_binary(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_block_var(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_blockarg(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_bodystmt(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_brace_block(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_break(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_call(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_case(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_class(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_class_name_error(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_comma(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_comma(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_command(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_command_call(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_comment(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_comment(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_const(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_const(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_path_field(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_path_ref(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_const_ref(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_cvar(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_cvar(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_def(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_defined(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_defs(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_do_block(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dot2(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dot3(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_dyna_symbol(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_else(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_elsif(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embdoc(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embdoc(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embdoc_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embdoc_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embdoc_end(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embdoc_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embexpr_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embexpr_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embexpr_end(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embexpr_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_embvar(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_embvar(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_ensure(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_excessed_comma(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_fcall(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_field(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_float(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_float(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_fndptn(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_for(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_gvar(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_gvar(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_hash(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_heredoc_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_heredoc_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 - def on_heredoc_dedent(*args); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_heredoc_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_heredoc_end(value); end - - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_hshptn(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_ident(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_ident(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_if(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_if_mod(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_ifop(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_ignored_nl(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_ignored_nl(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_ignored_sp(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_ignored_sp(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_imaginary(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_imaginary(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_in(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_int(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_int(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_ivar(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_ivar(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_kw(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_kw(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_kwrest_param(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_label(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_label(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_label_end(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_label_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_lambda(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_lbrace(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_lbrace(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_lbracket(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_lbracket(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_lparen(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_lparen(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_magic_comment(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_massign(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_method_add_arg(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_method_add_block(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add_post(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_add_star(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mlhs_paren(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_module(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_add_star(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_mrhs_new_from_args(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_next(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_nl(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_nl(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_nokw_param(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_op(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_op(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_opassign(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_operator_ambiguous(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_param_error(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_params(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_paren(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 - def on_parse_error(*args); end - - # source://prism//lib/prism/translation/ripper.rb#34 - def on_period(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_period(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_program(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qsymbols_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_qsymbols_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_qsymbols_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qsymbols_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qwords_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_qwords_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_qwords_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_qwords_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_rational(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_rational(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_rbrace(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_rbrace(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_rbracket(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_rbracket(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_redo(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_regexp_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_regexp_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_regexp_end(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_regexp_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_literal(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_regexp_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rescue(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rescue_mod(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_rest_param(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_retry(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_return(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_return0(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_rparen(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_rparen(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_sclass(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_semicolon(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_semicolon(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_sp(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_sp(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_stmts_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_stmts_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_concat(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_content(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_dvar(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_embexpr(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_string_literal(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_super(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_symbeg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_symbeg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbol(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbol_literal(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbols_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_symbols_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_symbols_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_symbols_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_tlambda(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_tlambda(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_tlambeg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_tlambeg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_top_const_field(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_top_const_ref(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_tstring_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_tstring_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_tstring_content(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_tstring_content(tok); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_tstring_end(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_tstring_end(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unary(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_undef(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unless(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_unless_mod(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_until(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_until_mod(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_alias(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_field(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_var_ref(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_vcall(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_void_stmt(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_when(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_while(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_while_mod(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_word_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_word_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_words_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_words_beg(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_words_beg(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_words_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#34 - def on_words_sep(value); end + # source://prism//lib/prism/translation/ripper/sexp.rb#55 + def on_words_sep(tok); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_add(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_literal(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_xstring_new(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_yield(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_yield0(*args); end - # source://prism//lib/prism/translation/ripper.rb#28 + # source://prism//lib/prism/translation/ripper/sexp.rb#47 def on_zsuper(*args); end + + private + + # source://prism//lib/prism/translation/ripper/sexp.rb#61 + def compile_error(mesg); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#17 + def dedent_element(e, width); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#61 + def on_error(mesg); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#24 + def on_heredoc_dedent(val, width); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#61 + def on_parse_error(mesg); end end # This class mirrors the ::Ripper::SexpBuilderPP subclass of ::Ripper that # 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.rb#43 +# source://prism//lib/prism/translation/ripper/sexp.rb#74 class Prism::Translation::Ripper::SexpBuilderPP < ::Prism::Translation::Ripper::SexpBuilder private - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def _dispatch_event_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def _dispatch_event_push(list, item); end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_args_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_args_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#79 + def on_heredoc_dedent(val, width); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_mlhs_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#109 + def on_mlhs_add_post(list, post); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#105 + def on_mlhs_add_star(list, star); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_mlhs_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#101 + def on_mlhs_paren(list); end + + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_mrhs_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_mrhs_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_qsymbols_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_qsymbols_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_qwords_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_qwords_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_regexp_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_regexp_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_stmts_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_stmts_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_string_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_symbols_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_symbols_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_word_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_word_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_words_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_words_new; end - # source://prism//lib/prism/translation/ripper.rb#50 + # source://prism//lib/prism/translation/ripper/sexp.rb#96 def on_xstring_add(list, item); end - # source://prism//lib/prism/translation/ripper.rb#46 + # source://prism//lib/prism/translation/ripper/sexp.rb#92 def on_xstring_new; end end @@ -29041,64 +35726,73 @@ end # true # ^^^^ # -# source://prism//lib/prism/node.rb#18139 +# source://prism//lib/prism/node.rb#18098 class Prism::TrueNode < ::Prism::Node # def initialize: (Location location) -> void # # @return [TrueNode] a new instance of TrueNode # - # source://prism//lib/prism/node.rb#18141 + # source://prism//lib/prism/node.rb#18100 + sig { params(source: Prism::Source, location: Prism::Location).void } def initialize(source, location); 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#18174 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18148 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18107 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18153 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18112 + 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#18163 + # source://prism//lib/prism/node.rb#18122 + 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#18158 + # source://prism//lib/prism/node.rb#18117 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> TrueNode + # def copy: (?location: Location) -> TrueNode # - # source://prism//lib/prism/node.rb#18168 - sig { params(params: T.untyped).returns(Prism::TrueNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18127 + sig { params(location: Prism::Location).returns(Prism::TrueNode) } + def copy(location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18153 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18112 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//lib/prism/node.rb#18179 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18135 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18185 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18140 + sig { override.returns(String) } + def inspect; end # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by @@ -29115,7 +35809,8 @@ class Prism::TrueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18204 + # source://prism//lib/prism/node.rb#18158 + sig { override.returns(Symbol) } def type; end class << self @@ -29126,7 +35821,7 @@ class Prism::TrueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18214 + # source://prism//lib/prism/node.rb#18168 def type; end end end @@ -29136,81 +35831,103 @@ end # undef :foo, :bar, :baz # ^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18223 +# source://prism//lib/prism/node.rb#18183 class Prism::UndefNode < ::Prism::Node - # def initialize: (Array[Node] names, Location keyword_loc, Location location) -> void + # def initialize: (Array[SymbolNode | InterpolatedSymbolNode] names, Location keyword_loc, Location location) -> void # # @return [UndefNode] a new instance of UndefNode # - # source://prism//lib/prism/node.rb#18225 + # source://prism//lib/prism/node.rb#18185 + sig do + params( + source: Prism::Source, + names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)], + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(source, names, keyword_loc, location); 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#18276 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18234 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18194 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18239 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18199 + 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#18249 + # source://prism//lib/prism/node.rb#18209 + 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#18244 + # source://prism//lib/prism/node.rb#18204 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> UndefNode + # def copy: (?names: Array[SymbolNode | InterpolatedSymbolNode], ?keyword_loc: Location, ?location: Location) -> UndefNode # - # source://prism//lib/prism/node.rb#18254 - sig { params(params: T.untyped).returns(Prism::UndefNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18214 + sig do + params( + names: T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)], + keyword_loc: Prism::Location, + location: Prism::Location + ).returns(Prism::UndefNode) + end + def copy(names: T.unsafe(nil), keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18239 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18199 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { names: Array[Node], keyword_loc: Location, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { names: Array[SymbolNode | InterpolatedSymbolNode], keyword_loc: Location, location: Location } # - # source://prism//lib/prism/node.rb#18267 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18222 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18287 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18242 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18282 + # source://prism//lib/prism/node.rb#18237 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18275 + # source://prism//lib/prism/node.rb#18230 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader names: Array[Node] + # attr_reader names: Array[SymbolNode | InterpolatedSymbolNode] # - # source://prism//lib/prism/node.rb#18272 - sig { returns(T::Array[Prism::Node]) } + # source://prism//lib/prism/node.rb#18227 + sig { returns(T::Array[T.any(Prism::SymbolNode, Prism::InterpolatedSymbolNode)]) } def names; end # Sometimes you want to check an instance of a node against a list of @@ -29228,7 +35945,8 @@ class Prism::UndefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18308 + # source://prism//lib/prism/node.rb#18260 + sig { override.returns(Symbol) } def type; end class << self @@ -29239,7 +35957,7 @@ class Prism::UndefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18318 + # source://prism//lib/prism/node.rb#18270 def type; end end end @@ -29252,119 +35970,172 @@ end # unless foo then bar end # ^^^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18330 +# source://prism//lib/prism/node.rb#18291 class Prism::UnlessNode < ::Prism::Node - # def initialize: (Location keyword_loc, Node predicate, Location? then_keyword_loc, StatementsNode? statements, ElseNode? consequent, Location? end_keyword_loc, Location location) -> void + # def initialize: (Location keyword_loc, Prism::node predicate, Location? then_keyword_loc, StatementsNode? statements, ElseNode? consequent, Location? end_keyword_loc, Location location) -> void # # @return [UnlessNode] a new instance of UnlessNode # - # source://prism//lib/prism/node.rb#18332 + # source://prism//lib/prism/node.rb#18293 + sig do + params( + source: Prism::Source, + keyword_loc: Prism::Location, + predicate: Prism::Node, + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::ElseNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); 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#18461 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18345 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18306 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18354 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18315 + 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#18368 + # source://prism//lib/prism/node.rb#18329 + 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#18359 + # source://prism//lib/prism/node.rb#18320 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader consequent: ElseNode? + # The else clause of the unless expression, if present. + # + # unless cond then bar else baz end + # ^^^^^^^^ # - # source://prism//lib/prism/node.rb#18419 + # source://prism//lib/prism/node.rb#18393 sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end - # def copy: (**params) -> UnlessNode + # def copy: (?keyword_loc: Location, ?predicate: Prism::node, ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?consequent: ElseNode?, ?end_keyword_loc: Location?, ?location: Location) -> UnlessNode # - # source://prism//lib/prism/node.rb#18373 - sig { params(params: T.untyped).returns(Prism::UnlessNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18334 + sig do + params( + keyword_loc: Prism::Location, + predicate: Prism::Node, + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + consequent: T.nilable(Prism::ElseNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::UnlessNode) + end + def copy(keyword_loc: T.unsafe(nil), predicate: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), end_keyword_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18354 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18315 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, predicate: Node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: ElseNode?, end_keyword_loc: Location?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, predicate: Prism::node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: ElseNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#18390 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18342 + 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#18445 + # source://prism//lib/prism/node.rb#18422 sig { returns(T.nilable(String)) } def end_keyword; end - # attr_reader end_keyword_loc: Location? + # The location of the `end` keyword, if present. # - # source://prism//lib/prism/node.rb#18422 + # unless cond then bar end + # ^^^ + # + # source://prism//lib/prism/node.rb#18399 sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18450 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18427 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18435 + # source://prism//lib/prism/node.rb#18412 sig { returns(String) } def keyword; end - # attr_reader keyword_loc: Location + # The location of the `unless` keyword. + # + # unless cond then bar end + # ^^^^^^ # - # source://prism//lib/prism/node.rb#18395 + # bar unless cond + # ^^^^^^ + # + # source://prism//lib/prism/node.rb#18353 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader predicate: Node + # 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). + # + # unless cond then bar end + # ^^^^ # - # source://prism//lib/prism/node.rb#18401 + # bar unless cond + # ^^^^ + # + # source://prism//lib/prism/node.rb#18366 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18349 + # source://prism//lib/prism/node.rb#18310 def set_newline_flag(newline_marked); end - # attr_reader statements: StatementsNode? + # The body of statements that will executed if the unless condition is + # falsey. Will be `nil` if no body is provided. # - # source://prism//lib/prism/node.rb#18416 + # unless cond then bar end + # ^^^ + # + # source://prism//lib/prism/node.rb#18387 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//lib/prism/node.rb#18440 + # source://prism//lib/prism/node.rb#18417 sig { returns(T.nilable(String)) } def then_keyword; end - # attr_reader then_keyword_loc: Location? + # The location of the `then` keyword, if present. + # unless cond then bar end ^^^^ # - # source://prism//lib/prism/node.rb#18404 + # source://prism//lib/prism/node.rb#18370 sig { returns(T.nilable(Prism::Location)) } def then_keyword_loc; end @@ -29383,7 +36154,8 @@ class Prism::UnlessNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18486 + # source://prism//lib/prism/node.rb#18445 + sig { override.returns(Symbol) } def type; end class << self @@ -29394,7 +36166,7 @@ class Prism::UnlessNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18496 + # source://prism//lib/prism/node.rb#18455 def type; end end end @@ -29407,109 +36179,137 @@ end # until foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18508 +# source://prism//lib/prism/node.rb#18479 class Prism::UntilNode < ::Prism::Node - # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Node predicate, StatementsNode? statements, Location location) -> void + # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Prism::node predicate, StatementsNode? statements, Location location) -> void # # @return [UntilNode] a new instance of UntilNode # - # source://prism//lib/prism/node.rb#18510 + # source://prism//lib/prism/node.rb#18481 + sig do + params( + source: Prism::Source, + flags: Integer, + keyword_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).void + end def initialize(source, flags, keyword_loc, closing_loc, predicate, statements, location); 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#18612 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18522 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18493 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def begin_modifier?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18599 + # source://prism//lib/prism/node.rb#18563 sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18531 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18502 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18609 + # source://prism//lib/prism/node.rb#18573 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18580 + # source://prism//lib/prism/node.rb#18544 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18544 + # source://prism//lib/prism/node.rb#18515 + 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#18536 + # source://prism//lib/prism/node.rb#18507 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> UntilNode + # def copy: (?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?, ?location: Location) -> UntilNode # - # source://prism//lib/prism/node.rb#18549 - sig { params(params: T.untyped).returns(Prism::UntilNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18520 + sig do + params( + flags: Integer, + keyword_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).returns(Prism::UntilNode) + end + def copy(flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), predicate: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18531 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18502 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18565 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18528 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18614 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18578 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18604 + # source://prism//lib/prism/node.rb#18568 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18574 + # source://prism//lib/prism/node.rb#18537 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader predicate: Node + # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#18592 + # source://prism//lib/prism/node.rb#18557 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18526 + # source://prism//lib/prism/node.rb#18497 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18595 + # source://prism//lib/prism/node.rb#18560 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -29528,14 +36328,15 @@ class Prism::UntilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18645 + # source://prism//lib/prism/node.rb#18596 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18570 + # source://prism//lib/prism/node.rb#18533 sig { returns(Integer) } def flags; end @@ -29547,7 +36348,7 @@ class Prism::UntilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18655 + # source://prism//lib/prism/node.rb#18606 def type; end end end @@ -29574,893 +36375,905 @@ Prism::VERSION = T.let(T.unsafe(nil), String) # end # end # -# source://prism//lib/prism/visitor.rb#50 +# source://prism//lib/prism/visitor.rb#54 class Prism::Visitor < ::Prism::BasicVisitor # Visit a AliasGlobalVariableNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AliasGlobalVariableNode).void } def visit_alias_global_variable_node(node); end # Visit a AliasMethodNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AliasMethodNode).void } def visit_alias_method_node(node); end # Visit a AlternationPatternNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AlternationPatternNode).void } def visit_alternation_pattern_node(node); end # Visit a AndNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AndNode).void } def visit_and_node(node); end # Visit a ArgumentsNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ArgumentsNode).void } def visit_arguments_node(node); end # Visit a ArrayNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ArrayNode).void } def visit_array_node(node); end # Visit a ArrayPatternNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ArrayPatternNode).void } def visit_array_pattern_node(node); end # Visit a AssocNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AssocNode).void } def visit_assoc_node(node); end # Visit a AssocSplatNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::AssocSplatNode).void } def visit_assoc_splat_node(node); end # Visit a BackReferenceReadNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BackReferenceReadNode).void } def visit_back_reference_read_node(node); end # Visit a BeginNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BeginNode).void } def visit_begin_node(node); end # Visit a BlockArgumentNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BlockArgumentNode).void } def visit_block_argument_node(node); end # Visit a BlockLocalVariableNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BlockLocalVariableNode).void } def visit_block_local_variable_node(node); end # Visit a BlockNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BlockNode).void } def visit_block_node(node); end # Visit a BlockParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BlockParameterNode).void } def visit_block_parameter_node(node); end # Visit a BlockParametersNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BlockParametersNode).void } def visit_block_parameters_node(node); end # Visit a BreakNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::BreakNode).void } def visit_break_node(node); end # Visit a CallAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CallAndWriteNode).void } def visit_call_and_write_node(node); end # Visit a CallNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CallNode).void } def visit_call_node(node); end # Visit a CallOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CallOperatorWriteNode).void } def visit_call_operator_write_node(node); end # Visit a CallOrWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CallOrWriteNode).void } def visit_call_or_write_node(node); end # Visit a CallTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CallTargetNode).void } def visit_call_target_node(node); end # Visit a CapturePatternNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CapturePatternNode).void } def visit_capture_pattern_node(node); end # Visit a CaseMatchNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CaseMatchNode).void } def visit_case_match_node(node); end # Visit a CaseNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::CaseNode).void } def visit_case_node(node); end # Visit a ClassNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ClassNode).void } def visit_class_node(node); end # Visit a ClassVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ClassVariableReadNode).void } def visit_class_variable_read_node(node); end # Visit a ClassVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ClassVariableTargetNode).void } def visit_class_variable_target_node(node); end # Visit a ClassVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ClassVariableWriteNode).void } def visit_class_variable_write_node(node); end # Visit a ConstantAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantAndWriteNode).void } def visit_constant_and_write_node(node); end # Visit a ConstantOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantOperatorWriteNode).void } def visit_constant_operator_write_node(node); end # Visit a ConstantOrWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantOrWriteNode).void } def visit_constant_or_write_node(node); end # Visit a ConstantPathAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantPathNode).void } def visit_constant_path_node(node); end # Visit a ConstantPathOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantPathTargetNode).void } def visit_constant_path_target_node(node); end # Visit a ConstantPathWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantPathWriteNode).void } def visit_constant_path_write_node(node); end # Visit a ConstantReadNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantReadNode).void } def visit_constant_read_node(node); end # Visit a ConstantTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantTargetNode).void } def visit_constant_target_node(node); end # Visit a ConstantWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ConstantWriteNode).void } def visit_constant_write_node(node); end # Visit a DefNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::DefNode).void } def visit_def_node(node); end # Visit a DefinedNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::DefinedNode).void } def visit_defined_node(node); end # Visit a ElseNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ElseNode).void } def visit_else_node(node); end # Visit a EmbeddedStatementsNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::EmbeddedStatementsNode).void } def visit_embedded_statements_node(node); end # Visit a EmbeddedVariableNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::EmbeddedVariableNode).void } def visit_embedded_variable_node(node); end # Visit a EnsureNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::EnsureNode).void } def visit_ensure_node(node); end # Visit a FalseNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::FalseNode).void } def visit_false_node(node); end # Visit a FindPatternNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::FindPatternNode).void } def visit_find_pattern_node(node); end # Visit a FlipFlopNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::FlipFlopNode).void } def visit_flip_flop_node(node); end # Visit a FloatNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::FloatNode).void } def visit_float_node(node); end # Visit a ForNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ForNode).void } def visit_for_node(node); end # Visit a ForwardingArgumentsNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ForwardingArgumentsNode).void } def visit_forwarding_arguments_node(node); end # Visit a ForwardingParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ForwardingParameterNode).void } def visit_forwarding_parameter_node(node); end # Visit a ForwardingSuperNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ForwardingSuperNode).void } def visit_forwarding_super_node(node); end # Visit a GlobalVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::GlobalVariableReadNode).void } def visit_global_variable_read_node(node); end # Visit a GlobalVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::GlobalVariableTargetNode).void } def visit_global_variable_target_node(node); end # Visit a GlobalVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::GlobalVariableWriteNode).void } def visit_global_variable_write_node(node); end # Visit a HashNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::HashNode).void } def visit_hash_node(node); end # Visit a HashPatternNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::HashPatternNode).void } def visit_hash_pattern_node(node); end # Visit a IfNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IfNode).void } def visit_if_node(node); end # Visit a ImaginaryNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ImaginaryNode).void } def visit_imaginary_node(node); end # Visit a ImplicitNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ImplicitNode).void } def visit_implicit_node(node); end # Visit a ImplicitRestNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ImplicitRestNode).void } def visit_implicit_rest_node(node); end # Visit a InNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InNode).void } def visit_in_node(node); end # Visit a IndexAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IndexAndWriteNode).void } def visit_index_and_write_node(node); end # Visit a IndexOperatorWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IndexOperatorWriteNode).void } def visit_index_operator_write_node(node); end # Visit a IndexOrWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IndexOrWriteNode).void } def visit_index_or_write_node(node); end # Visit a IndexTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IndexTargetNode).void } def visit_index_target_node(node); end # Visit a InstanceVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InstanceVariableReadNode).void } def visit_instance_variable_read_node(node); end # Visit a InstanceVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InstanceVariableTargetNode).void } def visit_instance_variable_target_node(node); end # Visit a InstanceVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InstanceVariableWriteNode).void } def visit_instance_variable_write_node(node); end # Visit a IntegerNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::IntegerNode).void } def visit_integer_node(node); end # Visit a InterpolatedMatchLastLineNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InterpolatedRegularExpressionNode).void } def visit_interpolated_regular_expression_node(node); end # Visit a InterpolatedStringNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InterpolatedStringNode).void } def visit_interpolated_string_node(node); end # Visit a InterpolatedSymbolNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InterpolatedSymbolNode).void } def visit_interpolated_symbol_node(node); end # Visit a InterpolatedXStringNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::InterpolatedXStringNode).void } def visit_interpolated_x_string_node(node); end + # Visit a ItParametersNode node + # + # source://prism//lib/prism/visitor.rb#29 + sig { params(node: Prism::ItParametersNode).void } + def visit_it_parameters_node(node); end + # Visit a KeywordHashNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::KeywordHashNode).void } def visit_keyword_hash_node(node); end # Visit a KeywordRestParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::KeywordRestParameterNode).void } def visit_keyword_rest_parameter_node(node); end # Visit a LambdaNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::LambdaNode).void } def visit_lambda_node(node); end # Visit a LocalVariableAndWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 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#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::LocalVariableReadNode).void } def visit_local_variable_read_node(node); end # Visit a LocalVariableTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::LocalVariableTargetNode).void } def visit_local_variable_target_node(node); end # Visit a LocalVariableWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::LocalVariableWriteNode).void } def visit_local_variable_write_node(node); end # Visit a MatchLastLineNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MatchLastLineNode).void } def visit_match_last_line_node(node); end # Visit a MatchPredicateNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MatchPredicateNode).void } def visit_match_predicate_node(node); end # Visit a MatchRequiredNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MatchRequiredNode).void } def visit_match_required_node(node); end # Visit a MatchWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MatchWriteNode).void } def visit_match_write_node(node); end # Visit a MissingNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MissingNode).void } def visit_missing_node(node); end # Visit a ModuleNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ModuleNode).void } def visit_module_node(node); end # Visit a MultiTargetNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MultiTargetNode).void } def visit_multi_target_node(node); end # Visit a MultiWriteNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::MultiWriteNode).void } def visit_multi_write_node(node); end # Visit a NextNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::NextNode).void } def visit_next_node(node); end # Visit a NilNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::NilNode).void } def visit_nil_node(node); end # Visit a NoKeywordsParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::NoKeywordsParameterNode).void } def visit_no_keywords_parameter_node(node); end # Visit a NumberedParametersNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::NumberedParametersNode).void } def visit_numbered_parameters_node(node); end # Visit a NumberedReferenceReadNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::NumberedReferenceReadNode).void } def visit_numbered_reference_read_node(node); end # Visit a OptionalKeywordParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::OptionalKeywordParameterNode).void } def visit_optional_keyword_parameter_node(node); end # Visit a OptionalParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::OptionalParameterNode).void } def visit_optional_parameter_node(node); end # Visit a OrNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::OrNode).void } def visit_or_node(node); end # Visit a ParametersNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ParametersNode).void } def visit_parameters_node(node); end # Visit a ParenthesesNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ParenthesesNode).void } def visit_parentheses_node(node); end # Visit a PinnedExpressionNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::PinnedExpressionNode).void } def visit_pinned_expression_node(node); end # Visit a PinnedVariableNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::PinnedVariableNode).void } def visit_pinned_variable_node(node); end # Visit a PostExecutionNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::PostExecutionNode).void } def visit_post_execution_node(node); end # Visit a PreExecutionNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::PreExecutionNode).void } def visit_pre_execution_node(node); end # Visit a ProgramNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ProgramNode).void } def visit_program_node(node); end # Visit a RangeNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RangeNode).void } def visit_range_node(node); end # Visit a RationalNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RationalNode).void } def visit_rational_node(node); end # Visit a RedoNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RedoNode).void } def visit_redo_node(node); end # Visit a RegularExpressionNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RegularExpressionNode).void } def visit_regular_expression_node(node); end # Visit a RequiredKeywordParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RequiredKeywordParameterNode).void } def visit_required_keyword_parameter_node(node); end # Visit a RequiredParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RequiredParameterNode).void } def visit_required_parameter_node(node); end # Visit a RescueModifierNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RescueModifierNode).void } def visit_rescue_modifier_node(node); end # Visit a RescueNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RescueNode).void } def visit_rescue_node(node); end # Visit a RestParameterNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RestParameterNode).void } def visit_rest_parameter_node(node); end # Visit a RetryNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::RetryNode).void } def visit_retry_node(node); end # Visit a ReturnNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::ReturnNode).void } def visit_return_node(node); end # Visit a SelfNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SelfNode).void } def visit_self_node(node); end + # Visit a ShareableConstantNode node + # + # source://prism//lib/prism/visitor.rb#29 + sig { params(node: Prism::ShareableConstantNode).void } + def visit_shareable_constant_node(node); end + # Visit a SingletonClassNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SingletonClassNode).void } def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SourceEncodingNode).void } def visit_source_encoding_node(node); end # Visit a SourceFileNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SourceFileNode).void } def visit_source_file_node(node); end # Visit a SourceLineNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SourceLineNode).void } def visit_source_line_node(node); end # Visit a SplatNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SplatNode).void } def visit_splat_node(node); end # Visit a StatementsNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::StatementsNode).void } def visit_statements_node(node); end # Visit a StringNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::StringNode).void } def visit_string_node(node); end # Visit a SuperNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SuperNode).void } def visit_super_node(node); end # Visit a SymbolNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::SymbolNode).void } def visit_symbol_node(node); end # Visit a TrueNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::TrueNode).void } def visit_true_node(node); end # Visit a UndefNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::UndefNode).void } def visit_undef_node(node); end # Visit a UnlessNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::UnlessNode).void } def visit_unless_node(node); end # Visit a UntilNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::UntilNode).void } def visit_until_node(node); end # Visit a WhenNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::WhenNode).void } def visit_when_node(node); end # Visit a WhileNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::WhileNode).void } def visit_while_node(node); end # Visit a XStringNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::XStringNode).void } def visit_x_string_node(node); end # Visit a YieldNode node # - # source://prism//lib/prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#29 sig { params(node: Prism::YieldNode).void } def visit_yield_node(node); end end @@ -30472,89 +37285,127 @@ end # ^^^^^^^^^ # end # -# source://prism//lib/prism/node.rb#18666 +# source://prism//lib/prism/node.rb#18628 class Prism::WhenNode < ::Prism::Node - # def initialize: (Location keyword_loc, Array[Node] conditions, StatementsNode? statements, Location location) -> void + # def initialize: (Location keyword_loc, Array[Prism::node] conditions, Location? then_keyword_loc, StatementsNode? statements, Location location) -> void # # @return [WhenNode] a new instance of WhenNode # - # source://prism//lib/prism/node.rb#18668 - def initialize(source, keyword_loc, conditions, statements, location); end + # source://prism//lib/prism/node.rb#18630 + sig do + params( + source: Prism::Source, + keyword_loc: Prism::Location, + conditions: T::Array[Prism::Node], + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).void + end + def initialize(source, keyword_loc, conditions, then_keyword_loc, statements, location); 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#18747 + def ===(other); end # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18678 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18641 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18683 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18646 + 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#18696 + # source://prism//lib/prism/node.rb#18659 + 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#18688 + # source://prism//lib/prism/node.rb#18651 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # attr_reader conditions: Array[Node] + # attr_reader conditions: Array[Prism::node] # - # source://prism//lib/prism/node.rb#18726 + # source://prism//lib/prism/node.rb#18684 sig { returns(T::Array[Prism::Node]) } def conditions; end - # def copy: (**params) -> WhenNode + # def copy: (?keyword_loc: Location, ?conditions: Array[Prism::node], ?then_keyword_loc: Location?, ?statements: StatementsNode?, ?location: Location) -> WhenNode # - # source://prism//lib/prism/node.rb#18701 - sig { params(params: T.untyped).returns(Prism::WhenNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18664 + sig do + params( + keyword_loc: Prism::Location, + conditions: T::Array[Prism::Node], + then_keyword_loc: T.nilable(Prism::Location), + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).returns(Prism::WhenNode) + end + def copy(keyword_loc: T.unsafe(nil), conditions: T.unsafe(nil), then_keyword_loc: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18683 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18646 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, conditions: Array[Node], statements: StatementsNode?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, conditions: Array[Prism::node], then_keyword_loc: Location?, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18715 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18672 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18738 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18713 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18733 + # source://prism//lib/prism/node.rb#18703 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18720 + # source://prism//lib/prism/node.rb#18677 sig { returns(Prism::Location) } def keyword_loc; end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18729 + # source://prism//lib/prism/node.rb#18700 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end + # def then_keyword: () -> String? + # + # source://prism//lib/prism/node.rb#18708 + sig { returns(T.nilable(String)) } + def then_keyword; end + + # attr_reader then_keyword_loc: Location? + # + # source://prism//lib/prism/node.rb#18687 + sig { returns(T.nilable(Prism::Location)) } + def then_keyword_loc; end + # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -30570,7 +37421,8 @@ class Prism::WhenNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18765 + # source://prism//lib/prism/node.rb#18731 + sig { override.returns(Symbol) } def type; end class << self @@ -30581,7 +37433,7 @@ class Prism::WhenNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18775 + # source://prism//lib/prism/node.rb#18741 def type; end end end @@ -30594,109 +37446,137 @@ end # while foo do bar end # ^^^^^^^^^^^^^^^^^^^^ # -# source://prism//lib/prism/node.rb#18787 +# source://prism//lib/prism/node.rb#18764 class Prism::WhileNode < ::Prism::Node - # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Node predicate, StatementsNode? statements, Location location) -> void + # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Prism::node predicate, StatementsNode? statements, Location location) -> void # # @return [WhileNode] a new instance of WhileNode # - # source://prism//lib/prism/node.rb#18789 + # source://prism//lib/prism/node.rb#18766 + sig do + params( + source: Prism::Source, + flags: Integer, + keyword_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).void + end def initialize(source, flags, keyword_loc, closing_loc, predicate, statements, location); 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#18897 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18801 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18778 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def begin_modifier?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#18878 + # source://prism//lib/prism/node.rb#18848 sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18810 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18787 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//lib/prism/node.rb#18888 + # source://prism//lib/prism/node.rb#18858 sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//lib/prism/node.rb#18859 + # source://prism//lib/prism/node.rb#18829 sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18823 + # source://prism//lib/prism/node.rb#18800 + 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#18815 + # source://prism//lib/prism/node.rb#18792 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> WhileNode + # def copy: (?flags: Integer, ?keyword_loc: Location, ?closing_loc: Location?, ?predicate: Prism::node, ?statements: StatementsNode?, ?location: Location) -> WhileNode # - # source://prism//lib/prism/node.rb#18828 - sig { params(params: T.untyped).returns(Prism::WhileNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18805 + sig do + params( + flags: Integer, + keyword_loc: Prism::Location, + closing_loc: T.nilable(Prism::Location), + predicate: Prism::Node, + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).returns(Prism::WhileNode) + end + def copy(flags: T.unsafe(nil), keyword_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), predicate: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18810 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18787 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location } + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Prism::node, statements: StatementsNode?, location: Location } # - # source://prism//lib/prism/node.rb#18844 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18813 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#18893 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#18863 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#18883 + # source://prism//lib/prism/node.rb#18853 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#18853 + # source://prism//lib/prism/node.rb#18822 sig { returns(Prism::Location) } def keyword_loc; end - # attr_reader predicate: Node + # attr_reader predicate: Prism::node # - # source://prism//lib/prism/node.rb#18871 + # source://prism//lib/prism/node.rb#18842 sig { returns(Prism::Node) } def predicate; end - # source://prism//lib/prism/node.rb#18805 + # source://prism//lib/prism/node.rb#18782 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//lib/prism/node.rb#18874 + # source://prism//lib/prism/node.rb#18845 sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end @@ -30715,14 +37595,15 @@ class Prism::WhileNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#18924 + # source://prism//lib/prism/node.rb#18881 + sig { override.returns(Symbol) } def type; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18849 + # source://prism//lib/prism/node.rb#18818 sig { returns(Integer) } def flags; end @@ -30734,7 +37615,7 @@ class Prism::WhileNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#18934 + # source://prism//lib/prism/node.rb#18891 def type; end end end @@ -30744,7 +37625,7 @@ end # `foo` # ^^^^^ # -# source://prism//lib/prism/node.rb#18943 +# source://prism//lib/prism/node.rb#18911 class Prism::XStringNode < ::Prism::Node include ::Prism::HeredocQuery @@ -30752,83 +37633,110 @@ class Prism::XStringNode < ::Prism::Node # # @return [XStringNode] a new instance of XStringNode # - # source://prism//lib/prism/node.rb#18945 + # source://prism//lib/prism/node.rb#18913 + sig do + params( + source: Prism::Source, + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end def initialize(source, flags, opening_loc, content_loc, closing_loc, unescaped, location); 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#19045 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#18957 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#18925 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18962 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18930 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//lib/prism/node.rb#19044 + # source://prism//lib/prism/node.rb#19006 sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//lib/prism/node.rb#19014 + # source://prism//lib/prism/node.rb#18976 sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//lib/prism/node.rb#18972 + # source://prism//lib/prism/node.rb#18940 + 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#18967 + # source://prism//lib/prism/node.rb#18935 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end # def content: () -> String # - # source://prism//lib/prism/node.rb#19039 + # source://prism//lib/prism/node.rb#19001 sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//lib/prism/node.rb#19008 + # source://prism//lib/prism/node.rb#18969 sig { returns(Prism::Location) } def content_loc; end - # def copy: (**params) -> XStringNode + # def copy: (?flags: Integer, ?opening_loc: Location, ?content_loc: Location, ?closing_loc: Location, ?unescaped: String, ?location: Location) -> XStringNode # - # source://prism//lib/prism/node.rb#18977 - sig { params(params: T.untyped).returns(Prism::XStringNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#18945 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).returns(Prism::XStringNode) + end + def copy(flags: T.unsafe(nil), opening_loc: T.unsafe(nil), content_loc: T.unsafe(nil), closing_loc: T.unsafe(nil), unescaped: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#18962 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#18930 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//lib/prism/node.rb#18993 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#18953 + 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 forced_binary_encoding?: () -> bool # # @return [Boolean] # - # source://prism//lib/prism/node.rb#19029 + # source://prism//lib/prism/node.rb#18991 sig { returns(T::Boolean) } def forced_binary_encoding?; end @@ -30836,27 +37744,38 @@ class Prism::XStringNode < ::Prism::Node # # @return [Boolean] # - # source://prism//lib/prism/node.rb#19024 + # source://prism//lib/prism/node.rb#18986 sig { returns(T::Boolean) } def forced_utf8_encoding?; end - # def inspect(NodeInspector inspector) -> String + sig { returns(T::Boolean) } + def heredoc?; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#19049 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#19011 + sig { override.returns(String) } + def inspect; end # def opening: () -> String # - # source://prism//lib/prism/node.rb#19034 + # source://prism//lib/prism/node.rb#18996 sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//lib/prism/node.rb#19002 + # source://prism//lib/prism/node.rb#18962 sig { returns(Prism::Location) } def opening_loc; 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#83 + sig { returns(Prism::InterpolatedXStringNode) } + def to_interpolated; end + # Sometimes you want to check an instance of a node against a list of # classes to see what kind of behavior to perform. Usually this is done by # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -30872,20 +37791,21 @@ class Prism::XStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#19074 + # source://prism//lib/prism/node.rb#19029 + sig { override.returns(Symbol) } def type; end # attr_reader unescaped: String # - # source://prism//lib/prism/node.rb#19020 + # source://prism//lib/prism/node.rb#18983 sig { returns(String) } def unescaped; end - private + protected - # private attr_reader flags: Integer + # protected attr_reader flags: Integer # - # source://prism//lib/prism/node.rb#18998 + # source://prism//lib/prism/node.rb#18958 sig { returns(Integer) } def flags; end @@ -30897,7 +37817,7 @@ class Prism::XStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#19084 + # source://prism//lib/prism/node.rb#19039 def type; end end end @@ -30907,104 +37827,130 @@ end # yield 1 # ^^^^^^^ # -# source://prism//lib/prism/node.rb#19093 +# source://prism//lib/prism/node.rb#19059 class Prism::YieldNode < ::Prism::Node # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Location location) -> void # # @return [YieldNode] a new instance of YieldNode # - # source://prism//lib/prism/node.rb#19095 + # source://prism//lib/prism/node.rb#19061 + sig do + params( + source: Prism::Source, + keyword_loc: Prism::Location, + lparen_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + rparen_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(source, keyword_loc, lparen_loc, arguments, rparen_loc, location); 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#19192 + def ===(other); end + # def accept: (Visitor visitor) -> void # - # source://prism//lib/prism/node.rb#19106 - sig { params(visitor: Prism::Visitor).void } + # source://prism//lib/prism/node.rb#19072 + sig { override.params(visitor: Prism::Visitor).returns(T.untyped) } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//lib/prism/node.rb#19166 + # source://prism//lib/prism/node.rb#19127 sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#19111 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#19077 + 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#19123 + # source://prism//lib/prism/node.rb#19089 + 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#19116 + # source://prism//lib/prism/node.rb#19082 + sig { override.returns(T::Array[Prism::Node]) } def compact_child_nodes; end - # def copy: (**params) -> YieldNode + # def copy: (?keyword_loc: Location, ?lparen_loc: Location?, ?arguments: ArgumentsNode?, ?rparen_loc: Location?, ?location: Location) -> YieldNode # - # source://prism//lib/prism/node.rb#19128 - sig { params(params: T.untyped).returns(Prism::YieldNode) } - def copy(**params); end + # source://prism//lib/prism/node.rb#19094 + sig do + params( + keyword_loc: Prism::Location, + lparen_loc: T.nilable(Prism::Location), + arguments: T.nilable(Prism::ArgumentsNode), + rparen_loc: T.nilable(Prism::Location), + location: Prism::Location + ).returns(Prism::YieldNode) + end + def copy(keyword_loc: T.unsafe(nil), lparen_loc: T.unsafe(nil), arguments: T.unsafe(nil), rparen_loc: T.unsafe(nil), location: T.unsafe(nil)); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//lib/prism/node.rb#19111 - sig { returns(T::Array[T.nilable(Prism::Node)]) } + # source://prism//lib/prism/node.rb#19077 + sig { override.returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, location: Location } # - # source://prism//lib/prism/node.rb#19143 - sig do - params( - keys: T::Array[Symbol] - ).returns(T::Hash[Symbol, T.nilable(T.any(Prism::Node, T::Array[Prism::Node], String, Prism::Token, T::Array[Prism::Token], Prism::Location))]) - end + # source://prism//lib/prism/node.rb#19102 + sig { params(keys: T.nilable(T::Array[Symbol])).returns(T::Hash[Symbol, T.untyped]) } def deconstruct_keys(keys); end - # def inspect(NodeInspector inspector) -> String + sig { override.returns(T::Array[Prism::Reflection::Field]) } + def fields; end + + # def inspect -> String # - # source://prism//lib/prism/node.rb#19197 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#19158 + sig { override.returns(String) } + def inspect; end # def keyword: () -> String # - # source://prism//lib/prism/node.rb#19182 + # source://prism//lib/prism/node.rb#19143 sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//lib/prism/node.rb#19148 + # source://prism//lib/prism/node.rb#19107 sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//lib/prism/node.rb#19187 + # source://prism//lib/prism/node.rb#19148 sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//lib/prism/node.rb#19154 + # source://prism//lib/prism/node.rb#19114 sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//lib/prism/node.rb#19192 + # source://prism//lib/prism/node.rb#19153 sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//lib/prism/node.rb#19169 + # source://prism//lib/prism/node.rb#19130 sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end @@ -31023,7 +37969,8 @@ class Prism::YieldNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//lib/prism/node.rb#19225 + # source://prism//lib/prism/node.rb#19176 + sig { override.returns(Symbol) } def type; end class << self @@ -31034,7 +37981,7 @@ class Prism::YieldNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//lib/prism/node.rb#19235 + # source://prism//lib/prism/node.rb#19186 def type; end end end diff --git a/sorbet/rbi/gems/psych@5.1.2.rbi b/sorbet/rbi/gems/psych@5.1.2.rbi index b3dda12..f3d4c02 100644 --- a/sorbet/rbi/gems/psych@5.1.2.rbi +++ b/sorbet/rbi/gems/psych@5.1.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `psych` gem. # Please instead update this file by running `bin/tapioca gem psych`. + class Object < ::BasicObject include ::Kernel include ::PP::ObjectMixin diff --git a/sorbet/rbi/gems/racc@1.7.3.rbi b/sorbet/rbi/gems/racc@1.8.0.rbi similarity index 66% rename from sorbet/rbi/gems/racc@1.7.3.rbi rename to sorbet/rbi/gems/racc@1.8.0.rbi index ef9b9bf..5d4f161 100644 --- a/sorbet/rbi/gems/racc@1.7.3.rbi +++ b/sorbet/rbi/gems/racc@1.8.0.rbi @@ -4,35 +4,36 @@ # This is an autogenerated file for types exported from the `racc` gem. # Please instead update this file by running `bin/tapioca gem racc`. -# source://racc//lib/racc/parser.rb#23 + +# source://racc//lib/racc/parser.rb#19 ParseError = Racc::ParseError # source://racc//lib/racc/info.rb#17 Racc::Copyright = T.let(T.unsafe(nil), String) -# source://racc//lib/racc/parser.rb#188 +# source://racc//lib/racc/parser.rb#184 class Racc::Parser - # source://racc//lib/racc/parser.rb#283 + # source://racc//lib/racc/parser.rb#279 def _racc_do_parse_rb(arg, in_debug); end - # source://racc//lib/racc/parser.rb#483 + # source://racc//lib/racc/parser.rb#479 def _racc_do_reduce(arg, act); end # common # - # source://racc//lib/racc/parser.rb#386 + # source://racc//lib/racc/parser.rb#382 def _racc_evalact(act, arg); end - # source://racc//lib/racc/parser.rb#236 + # source://racc//lib/racc/parser.rb#232 def _racc_init_sysvars; end - # source://racc//lib/racc/parser.rb#224 + # source://racc//lib/racc/parser.rb#220 def _racc_setup; end - # source://racc//lib/racc/parser.rb#333 + # source://racc//lib/racc/parser.rb#329 def _racc_yyparse_rb(recv, mid, arg, c_debug); end - # source://racc//lib/racc/parser.rb#266 + # source://racc//lib/racc/parser.rb#262 def do_parse; end # The method to fetch next token. @@ -46,7 +47,7 @@ class Racc::Parser # # @raise [NotImplementedError] # - # source://racc//lib/racc/parser.rb#279 + # source://racc//lib/racc/parser.rb#275 def next_token; end # This method is called when a parse error is found. @@ -66,88 +67,92 @@ class Racc::Parser # # @raise [ParseError] # - # source://racc//lib/racc/parser.rb#539 + # source://racc//lib/racc/parser.rb#535 def on_error(t, val, vstack); end - # source://racc//lib/racc/parser.rb#588 + # source://racc//lib/racc/parser.rb#584 def racc_accept; end - # source://racc//lib/racc/parser.rb#593 + # source://racc//lib/racc/parser.rb#589 def racc_e_pop(state, tstack, vstack); end - # source://racc//lib/racc/parser.rb#600 + # source://racc//lib/racc/parser.rb#596 def racc_next_state(curstate, state); end - # source://racc//lib/racc/parser.rb#606 + # source://racc//lib/racc/parser.rb#602 def racc_print_stacks(t, v); end - # source://racc//lib/racc/parser.rb#615 + # source://racc//lib/racc/parser.rb#611 def racc_print_states(s); end # For debugging output # - # source://racc//lib/racc/parser.rb#562 + # source://racc//lib/racc/parser.rb#558 def racc_read_token(t, tok, val); end - # source://racc//lib/racc/parser.rb#575 + # source://racc//lib/racc/parser.rb#571 def racc_reduce(toks, sim, tstack, vstack); end - # source://racc//lib/racc/parser.rb#569 + # source://racc//lib/racc/parser.rb#565 def racc_shift(tok, tstack, vstack); end - # source://racc//lib/racc/parser.rb#622 + # source://racc//lib/racc/parser.rb#618 def racc_token2str(tok); end # Convert internal ID of token symbol to the string. # - # source://racc//lib/racc/parser.rb#628 + # source://racc//lib/racc/parser.rb#624 def token_to_str(t); end # Exit parser. # Return value is +Symbol_Value_Stack[0]+. # - # source://racc//lib/racc/parser.rb#552 + # source://racc//lib/racc/parser.rb#548 def yyaccept; end # Leave error recovering mode. # - # source://racc//lib/racc/parser.rb#557 + # source://racc//lib/racc/parser.rb#553 def yyerrok; end # Enter error recovering mode. # This method does not call #on_error. # - # source://racc//lib/racc/parser.rb#546 + # source://racc//lib/racc/parser.rb#542 def yyerror; end - # source://racc//lib/racc/parser.rb#328 + # source://racc//lib/racc/parser.rb#324 def yyparse(recv, mid); end class << self - # source://racc//lib/racc/parser.rb#220 + # source://racc//lib/racc/parser.rb#216 def racc_runtime_type; end end end -# source://racc//lib/racc/parser.rb#209 +# source://racc//lib/racc/parser.rb#205 Racc::Parser::Racc_Main_Parsing_Routine = T.let(T.unsafe(nil), Symbol) -# source://racc//lib/racc/parser.rb#211 +Racc::Parser::Racc_Runtime_Core_Id_C = T.let(T.unsafe(nil), String) + +# source://racc//lib/racc/parser.rb#207 Racc::Parser::Racc_Runtime_Core_Version = T.let(T.unsafe(nil), String) -# source://racc//lib/racc/parser.rb#191 +Racc::Parser::Racc_Runtime_Core_Version_C = T.let(T.unsafe(nil), String) + +# source://racc//lib/racc/parser.rb#187 Racc::Parser::Racc_Runtime_Core_Version_R = T.let(T.unsafe(nil), String) -# source://racc//lib/racc/parser.rb#212 +# source://racc//lib/racc/parser.rb#208 Racc::Parser::Racc_Runtime_Type = T.let(T.unsafe(nil), String) -# source://racc//lib/racc/parser.rb#190 +# source://racc//lib/racc/parser.rb#186 Racc::Parser::Racc_Runtime_Version = T.let(T.unsafe(nil), String) -# source://racc//lib/racc/parser.rb#210 +# source://racc//lib/racc/parser.rb#206 Racc::Parser::Racc_YY_Parse_Method = T.let(T.unsafe(nil), Symbol) -# source://racc//lib/racc/parser.rb#185 +# source://racc//lib/racc/parser.rb#181 Racc::Racc_No_Extensions = T.let(T.unsafe(nil), FalseClass) # source://racc//lib/racc/info.rb#15 diff --git a/sorbet/rbi/gems/rainbow@3.1.1.rbi b/sorbet/rbi/gems/rainbow@3.1.1.rbi index 87f4c33..d02bc04 100644 --- a/sorbet/rbi/gems/rainbow@3.1.1.rbi +++ b/sorbet/rbi/gems/rainbow@3.1.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rainbow` gem. # Please instead update this file by running `bin/tapioca gem rainbow`. + class Object < ::BasicObject include ::Kernel include ::PP::ObjectMixin diff --git a/sorbet/rbi/gems/rake@13.2.1.rbi b/sorbet/rbi/gems/rake@13.2.1.rbi index ede46d3..755e993 100644 --- a/sorbet/rbi/gems/rake@13.2.1.rbi +++ b/sorbet/rbi/gems/rake@13.2.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rake` gem. # Please instead update this file by running `bin/tapioca gem rake`. + # :stopdoc: # # Some top level Constants. diff --git a/sorbet/rbi/gems/rbi@0.1.10.rbi b/sorbet/rbi/gems/rbi@0.1.13.rbi similarity index 98% rename from sorbet/rbi/gems/rbi@0.1.10.rbi rename to sorbet/rbi/gems/rbi@0.1.13.rbi index 9f65c0c..8503b2a 100644 --- a/sorbet/rbi/gems/rbi@0.1.10.rbi +++ b/sorbet/rbi/gems/rbi@0.1.13.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rbi` gem. # Please instead update this file by running `bin/tapioca gem rbi`. + # source://rbi//lib/rbi/loc.rb#4 module RBI; end @@ -1944,7 +1945,7 @@ class RBI::Rewriters::Merge::Conflict < ::T::Struct def to_s; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -2161,7 +2162,7 @@ class RBI::Rewriters::RemoveKnownDefinitions::Operation < ::T::Struct def to_s; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -2798,7 +2799,7 @@ class RBI::Tree < ::RBI::NodeWithComments sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void } def annotate!(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#38 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#38 sig do params( name: ::String, @@ -2808,19 +2809,19 @@ class RBI::Tree < ::RBI::NodeWithComments end def create_class(name, superclass_name: T.unsafe(nil), &block); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#45 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#45 sig { params(name: ::String, value: ::String).void } def create_constant(name, value:); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#55 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#55 sig { params(name: ::String).void } def create_extend(name); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#50 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#50 sig { params(name: ::String).void } def create_include(name); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#89 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#89 sig do params( name: ::String, @@ -2833,7 +2834,7 @@ class RBI::Tree < ::RBI::NodeWithComments end def create_method(name, parameters: T.unsafe(nil), return_type: T.unsafe(nil), class_method: T.unsafe(nil), visibility: T.unsafe(nil), comments: T.unsafe(nil)); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#113 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#113 sig do params( name: ::String, @@ -2846,23 +2847,29 @@ class RBI::Tree < ::RBI::NodeWithComments end def create_method_with_sigs(name, sigs:, parameters: T.unsafe(nil), class_method: T.unsafe(nil), visibility: T.unsafe(nil), comments: T.unsafe(nil)); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#60 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#60 sig { params(name: ::String).void } def create_mixes_in_class_methods(name); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#25 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#25 sig { params(name: ::String, block: T.nilable(T.proc.params(scope: ::RBI::Scope).void)).returns(::RBI::Scope) } def create_module(name, &block); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#9 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#9 sig { params(constant: ::Module, block: T.nilable(T.proc.params(scope: ::RBI::Scope).void)).returns(::RBI::Scope) } def create_path(constant, &block); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#134 - sig { params(parameters: T::Hash[T.any(::String, ::Symbol), ::String], return_type: ::String).returns(::RBI::Sig) } - def create_sig(parameters:, return_type: T.unsafe(nil)); end + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#135 + sig do + params( + parameters: T::Hash[T.any(::String, ::Symbol), ::String], + type_parameters: T::Array[::String], + return_type: ::String + ).returns(::RBI::Sig) + end + def create_sig(parameters:, type_parameters: T.unsafe(nil), return_type: T.unsafe(nil)); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#74 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#74 sig do params( name: ::String, @@ -2928,11 +2935,11 @@ class RBI::Tree < ::RBI::NodeWithComments private - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#149 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#150 sig { params(node: ::RBI::Node).returns(::RBI::Node) } def create_node(node); end - # source://tapioca/0.13.3/lib/tapioca/rbi_ext/model.rb#144 + # source://tapioca/0.14.2/lib/tapioca/rbi_ext/model.rb#145 sig { returns(T::Hash[::String, ::RBI::Node]) } def nodes_cache; end end diff --git a/sorbet/rbi/gems/regexp_parser@2.9.0.rbi b/sorbet/rbi/gems/regexp_parser@2.9.2.rbi similarity index 99% rename from sorbet/rbi/gems/regexp_parser@2.9.0.rbi rename to sorbet/rbi/gems/regexp_parser@2.9.2.rbi index 34ad4f2..584c455 100644 --- a/sorbet/rbi/gems/regexp_parser@2.9.0.rbi +++ b/sorbet/rbi/gems/regexp_parser@2.9.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `regexp_parser` gem. # Please instead update this file by running `bin/tapioca gem regexp_parser`. + # source://regexp_parser//lib/regexp_parser/expression/shared.rb#1 module Regexp::Expression; end @@ -1132,7 +1133,7 @@ end # source://regexp_parser//lib/regexp_parser/expression/classes/keep.rb#2 module Regexp::Expression::Keep; end -# TOOD: in regexp_parser v3.0.0 this should possibly be a Subexpression +# TODO: in regexp_parser v3.0.0 this should possibly be a Subexpression # that contains all expressions to its left. # # source://regexp_parser//lib/regexp_parser/expression/classes/keep.rb#5 @@ -2368,7 +2369,7 @@ class Regexp::Parser # source://regexp_parser//lib/regexp_parser/parser.rb#262 def assign_effective_number(exp); end - # Assigns referenced expressions to refering expressions, e.g. if there is + # Assigns referenced expressions to referring expressions, e.g. if there is # an instance of Backreference::Number, its #referenced_expression is set to # the instance of Group::Capture that it refers to via its number. # diff --git a/sorbet/rbi/gems/reline@0.5.2.rbi b/sorbet/rbi/gems/reline@0.5.7.rbi similarity index 99% rename from sorbet/rbi/gems/reline@0.5.2.rbi rename to sorbet/rbi/gems/reline@0.5.7.rbi index b8c01d4..13fa313 100644 --- a/sorbet/rbi/gems/reline@0.5.2.rbi +++ b/sorbet/rbi/gems/reline@0.5.7.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `reline` gem. # Please instead update this file by running `bin/tapioca gem reline`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/rexml@3.2.6.rbi b/sorbet/rbi/gems/rexml@3.2.8.rbi similarity index 96% rename from sorbet/rbi/gems/rexml@3.2.6.rbi rename to sorbet/rbi/gems/rexml@3.2.8.rbi index c8d67b5..33f7acd 100644 --- a/sorbet/rbi/gems/rexml@3.2.6.rbi +++ b/sorbet/rbi/gems/rexml@3.2.8.rbi @@ -1,9 +1,10 @@ -# typed: true +# typed: false # DO NOT EDIT MANUALLY # This is an autogenerated file for types exported from the `rexml` gem. # Please instead update this file by running `bin/tapioca gem rexml`. + # This class needs: # * Documentation # * Work! Not all types of attlists are intelligently parsed, so we just @@ -3453,47 +3454,48 @@ end # A Source that wraps an IO. See the Source class for method # documentation # -# source://rexml//lib/rexml/source.rb#159 +# source://rexml//lib/rexml/source.rb#140 class REXML::IOSource < ::REXML::Source # block_size has been deprecated # # @return [IOSource] a new instance of IOSource # - # source://rexml//lib/rexml/source.rb#163 + # source://rexml//lib/rexml/source.rb#144 def initialize(arg, block_size = T.unsafe(nil), encoding = T.unsafe(nil)); end - # source://rexml//lib/rexml/source.rb#215 - def consume(pattern); end - # @return the current line in the source # - # source://rexml//lib/rexml/source.rb#244 + # source://rexml//lib/rexml/source.rb#217 def current_line; end # @return [Boolean] # - # source://rexml//lib/rexml/source.rb#235 + # source://rexml//lib/rexml/source.rb#212 def empty?; end - # source://rexml//lib/rexml/source.rb#219 - def match(pattern, cons = T.unsafe(nil)); end + # source://rexml//lib/rexml/source.rb#189 + def ensure_buffer; end - # source://rexml//lib/rexml/source.rb#239 - def position; end + # Note: When specifying a string for 'pattern', it must not include '>' except in the following formats: + # - ">" + # - "XXX>" (X is any string excluding '>') + # + # source://rexml//lib/rexml/source.rb#196 + def match(pattern, cons = T.unsafe(nil)); end - # source://rexml//lib/rexml/source.rb#207 - def read; end + # source://rexml//lib/rexml/source.rb#165 + def read(term = T.unsafe(nil)); end - # source://rexml//lib/rexml/source.rb#184 - def scan(pattern, cons = T.unsafe(nil)); end + # source://rexml//lib/rexml/source.rb#175 + def read_until(term); end private - # source://rexml//lib/rexml/source.rb#286 + # source://rexml//lib/rexml/source.rb#259 def encoding_updated; end - # source://rexml//lib/rexml/source.rb#266 - def readline; end + # source://rexml//lib/rexml/source.rb#239 + def readline(term = T.unsafe(nil)); end end # Represents an XML Instruction; IE, @@ -3816,7 +3818,7 @@ class REXML::ParseException < ::RuntimeError # source://rexml//lib/rexml/parseexception.rb#6 def initialize(message, source = T.unsafe(nil), parser = T.unsafe(nil), exception = T.unsafe(nil)); end - # source://rexml//lib/rexml/parseexception.rb#48 + # source://rexml//lib/rexml/parseexception.rb#49 def context; end # Returns the value of attribute continued_exception. @@ -3831,7 +3833,7 @@ class REXML::ParseException < ::RuntimeError # source://rexml//lib/rexml/parseexception.rb#4 def continued_exception=(_arg0); end - # source://rexml//lib/rexml/parseexception.rb#43 + # source://rexml//lib/rexml/parseexception.rb#44 def line; end # Returns the value of attribute parser. @@ -3846,7 +3848,7 @@ class REXML::ParseException < ::RuntimeError # source://rexml//lib/rexml/parseexception.rb#4 def parser=(_arg0); end - # source://rexml//lib/rexml/parseexception.rb#38 + # source://rexml//lib/rexml/parseexception.rb#39 def position; end # Returns the value of attribute source. @@ -3887,34 +3889,36 @@ end # # source://rexml//lib/rexml/parsers/baseparser.rb#29 class REXML::Parsers::BaseParser + include ::REXML::Parsers::BaseParser::Private + # @return [BaseParser] a new instance of BaseParser # - # source://rexml//lib/rexml/parsers/baseparser.rb#115 + # source://rexml//lib/rexml/parsers/baseparser.rb#128 def initialize(source); end - # source://rexml//lib/rexml/parsers/baseparser.rb#120 + # source://rexml//lib/rexml/parsers/baseparser.rb#133 def add_listener(listener); end # Returns true if there are no more events # # @return [Boolean] # - # source://rexml//lib/rexml/parsers/baseparser.rb#146 + # source://rexml//lib/rexml/parsers/baseparser.rb#159 def empty?; end - # source://rexml//lib/rexml/parsers/baseparser.rb#438 + # source://rexml//lib/rexml/parsers/baseparser.rb#446 def entity(reference, entities); end # Returns true if there are more events. Synonymous with !empty? # # @return [Boolean] # - # source://rexml//lib/rexml/parsers/baseparser.rb#151 + # source://rexml//lib/rexml/parsers/baseparser.rb#164 def has_next?; end # Escapes all possible entities # - # source://rexml//lib/rexml/parsers/baseparser.rb#449 + # source://rexml//lib/rexml/parsers/baseparser.rb#457 def normalize(input, entities = T.unsafe(nil), entity_filter = T.unsafe(nil)); end # Peek at the +depth+ event in the stack. The first element on the stack @@ -3924,59 +3928,59 @@ class REXML::Parsers::BaseParser # event, so you can effectively pre-parse the entire document (pull the # entire thing into memory) using this method. # - # source://rexml//lib/rexml/parsers/baseparser.rb#167 + # source://rexml//lib/rexml/parsers/baseparser.rb#180 def peek(depth = T.unsafe(nil)); end - # source://rexml//lib/rexml/parsers/baseparser.rb#136 + # source://rexml//lib/rexml/parsers/baseparser.rb#149 def position; end # Returns the next event. This is a +PullEvent+ object. # - # source://rexml//lib/rexml/parsers/baseparser.rb#182 + # source://rexml//lib/rexml/parsers/baseparser.rb#195 def pull; end # Returns the value of attribute source. # - # source://rexml//lib/rexml/parsers/baseparser.rb#124 + # source://rexml//lib/rexml/parsers/baseparser.rb#137 def source; end - # source://rexml//lib/rexml/parsers/baseparser.rb#126 + # source://rexml//lib/rexml/parsers/baseparser.rb#139 def stream=(source); end # Unescapes all possible entities # - # source://rexml//lib/rexml/parsers/baseparser.rb#465 + # source://rexml//lib/rexml/parsers/baseparser.rb#473 def unnormalize(string, entities = T.unsafe(nil), filter = T.unsafe(nil)); end # Push an event back on the head of the stream. This method # has (theoretically) infinite depth. # - # source://rexml//lib/rexml/parsers/baseparser.rb#157 + # source://rexml//lib/rexml/parsers/baseparser.rb#170 def unshift(token); end private # @return [Boolean] # - # source://rexml//lib/rexml/parsers/baseparser.rb#495 + # source://rexml//lib/rexml/parsers/baseparser.rb#502 def need_source_encoding_update?(xml_declaration_encoding); end - # source://rexml//lib/rexml/parsers/baseparser.rb#589 + # source://rexml//lib/rexml/parsers/baseparser.rb#613 def parse_attributes(prefixes, curr_ns); end - # source://rexml//lib/rexml/parsers/baseparser.rb#514 + # source://rexml//lib/rexml/parsers/baseparser.rb#521 def parse_id(base_error_message, accept_external_id:, accept_public_id:); end - # source://rexml//lib/rexml/parsers/baseparser.rb#542 + # source://rexml//lib/rexml/parsers/baseparser.rb#549 def parse_id_invalid_details(accept_external_id:, accept_public_id:); end - # source://rexml//lib/rexml/parsers/baseparser.rb#501 + # source://rexml//lib/rexml/parsers/baseparser.rb#508 def parse_name(base_error_message); end - # source://rexml//lib/rexml/parsers/baseparser.rb#580 - def process_instruction; end + # source://rexml//lib/rexml/parsers/baseparser.rb#587 + def process_instruction(start_position); end - # source://rexml//lib/rexml/parsers/baseparser.rb#190 + # source://rexml//lib/rexml/parsers/baseparser.rb#203 def pull_event; end end @@ -3989,6 +3993,33 @@ REXML::Parsers::BaseParser::EXTERNAL_ID_SYSTEM = T.let(T.unsafe(nil), Regexp) # source://rexml//lib/rexml/parsers/baseparser.rb#104 REXML::Parsers::BaseParser::PUBLIC_ID = T.let(T.unsafe(nil), Regexp) +# source://rexml//lib/rexml/parsers/baseparser.rb#115 +module REXML::Parsers::BaseParser::Private; end + +# source://rexml//lib/rexml/parsers/baseparser.rb#119 +REXML::Parsers::BaseParser::Private::ATTLISTDECL_END = T.let(T.unsafe(nil), Regexp) + +# source://rexml//lib/rexml/parsers/baseparser.rb#118 +REXML::Parsers::BaseParser::Private::CLOSE_PATTERN = T.let(T.unsafe(nil), Regexp) + +# source://rexml//lib/rexml/parsers/baseparser.rb#123 +REXML::Parsers::BaseParser::Private::ENTITYDECL_PATTERN = T.let(T.unsafe(nil), Regexp) + +# source://rexml//lib/rexml/parsers/baseparser.rb#121 +REXML::Parsers::BaseParser::Private::GEDECL_PATTERN = T.let(T.unsafe(nil), String) + +# source://rexml//lib/rexml/parsers/baseparser.rb#116 +REXML::Parsers::BaseParser::Private::INSTRUCTION_END = T.let(T.unsafe(nil), Regexp) + +# source://rexml//lib/rexml/parsers/baseparser.rb#120 +REXML::Parsers::BaseParser::Private::NAME_PATTERN = T.let(T.unsafe(nil), Regexp) + +# source://rexml//lib/rexml/parsers/baseparser.rb#122 +REXML::Parsers::BaseParser::Private::PEDECL_PATTERN = T.let(T.unsafe(nil), String) + +# source://rexml//lib/rexml/parsers/baseparser.rb#117 +REXML::Parsers::BaseParser::Private::TAG_PATTERN = T.let(T.unsafe(nil), Regexp) + # source://rexml//lib/rexml/parsers/baseparser.rb#38 REXML::Parsers::BaseParser::QNAME = T.let(T.unsafe(nil), Regexp) @@ -4198,85 +4229,67 @@ class REXML::Source # @param encoding if non-null, sets the encoding of the source to this # @return [Source] a new instance of Source # - # source://rexml//lib/rexml/source.rb#43 + # source://rexml//lib/rexml/source.rb#41 def initialize(arg, encoding = T.unsafe(nil)); end # The current buffer (what we're going to read next) # - # source://rexml//lib/rexml/source.rb#34 + # source://rexml//lib/rexml/source.rb#53 def buffer; end - # source://rexml//lib/rexml/source.rb#87 - def consume(pattern); end + # source://rexml//lib/rexml/source.rb#57 + def buffer_encoding=(encoding); end # @return the current line in the source # - # source://rexml//lib/rexml/source.rb#117 + # source://rexml//lib/rexml/source.rb#100 def current_line; end # @return [Boolean] true if the Source is exhausted # - # source://rexml//lib/rexml/source.rb#108 + # source://rexml//lib/rexml/source.rb#95 def empty?; end # Returns the value of attribute encoding. # - # source://rexml//lib/rexml/source.rb#37 + # source://rexml//lib/rexml/source.rb#35 def encoding; end # Inherited from Encoding # Overridden to support optimized en/decoding # - # source://rexml//lib/rexml/source.rb#56 + # source://rexml//lib/rexml/source.rb#63 def encoding=(enc); end + # source://rexml//lib/rexml/source.rb#75 + def ensure_buffer; end + # The line number of the last consumed text # - # source://rexml//lib/rexml/source.rb#36 + # source://rexml//lib/rexml/source.rb#34 def line; end - # source://rexml//lib/rexml/source.rb#101 + # source://rexml//lib/rexml/source.rb#78 def match(pattern, cons = T.unsafe(nil)); end - # source://rexml//lib/rexml/source.rb#91 - def match_to(char, pattern); end + # source://rexml//lib/rexml/source.rb#86 + def position; end - # source://rexml//lib/rexml/source.rb#95 - def match_to_consume(char, pattern); end + # source://rexml//lib/rexml/source.rb#90 + def position=(pos); end - # source://rexml//lib/rexml/source.rb#112 - def position; end + # source://rexml//lib/rexml/source.rb#68 + def read(term = T.unsafe(nil)); end - # source://rexml//lib/rexml/source.rb#84 - def read; end - - # Scans the source for a given pattern. Note, that this is not your - # usual scan() method. For one thing, the pattern argument has some - # requirements; for another, the source can be consumed. You can easily - # confuse this method. Originally, the patterns were easier - # to construct and this method more robust, because this method - # generated search regexps on the fly; however, this was - # computationally expensive and slowed down the entire REXML package - # considerably, since this is by far the most commonly called method. - # /^\s*(#{your pattern, with no groups})(.*)/. The first group - # will be returned; the second group is used if the consume flag is - # set. - # everything after it in the Source. - # pattern is not found. - # - # @param pattern must be a Regexp, and must be in the form of - # @param consume if true, the pattern returned will be consumed, leaving - # @return the pattern, if found, or nil if the Source is empty or the - # - # source://rexml//lib/rexml/source.rb#77 - def scan(pattern, cons = T.unsafe(nil)); end + # source://rexml//lib/rexml/source.rb#71 + def read_until(term); end private - # source://rexml//lib/rexml/source.rb#125 + # source://rexml//lib/rexml/source.rb#109 def detect_encoding; end - # source://rexml//lib/rexml/source.rb#146 + # source://rexml//lib/rexml/source.rb#127 def encoding_updated; end end @@ -4607,24 +4620,24 @@ end # @private # -# source://rexml//lib/rexml/xpath_parser.rb#959 +# source://rexml//lib/rexml/xpath_parser.rb#963 class REXML::XPathNode # @return [XPathNode] a new instance of XPathNode # - # source://rexml//lib/rexml/xpath_parser.rb#961 + # source://rexml//lib/rexml/xpath_parser.rb#965 def initialize(node, context = T.unsafe(nil)); end # Returns the value of attribute context. # - # source://rexml//lib/rexml/xpath_parser.rb#960 + # source://rexml//lib/rexml/xpath_parser.rb#964 def context; end - # source://rexml//lib/rexml/xpath_parser.rb#970 + # source://rexml//lib/rexml/xpath_parser.rb#974 def position; end # Returns the value of attribute raw_node. # - # source://rexml//lib/rexml/xpath_parser.rb#960 + # source://rexml//lib/rexml/xpath_parser.rb#964 def raw_node; end end @@ -4673,25 +4686,25 @@ class REXML::XPathParser private - # source://rexml//lib/rexml/xpath_parser.rb#775 + # source://rexml//lib/rexml/xpath_parser.rb#779 def child(nodeset); end - # source://rexml//lib/rexml/xpath_parser.rb#916 + # source://rexml//lib/rexml/xpath_parser.rb#920 def compare(a, operator, b); end - # source://rexml//lib/rexml/xpath_parser.rb#678 + # source://rexml//lib/rexml/xpath_parser.rb#682 def descendant(nodeset, include_self); end - # source://rexml//lib/rexml/xpath_parser.rb#689 + # source://rexml//lib/rexml/xpath_parser.rb#693 def descendant_recursive(raw_node, new_nodeset, new_nodes, include_self); end - # source://rexml//lib/rexml/xpath_parser.rb#938 + # source://rexml//lib/rexml/xpath_parser.rb#942 def each_unnode(nodeset); end - # source://rexml//lib/rexml/xpath_parser.rb#637 + # source://rexml//lib/rexml/xpath_parser.rb#641 def enter(tag, *args); end - # source://rexml//lib/rexml/xpath_parser.rb#815 + # source://rexml//lib/rexml/xpath_parser.rb#819 def equality_relational_compare(set1, op, set2); end # source://rexml//lib/rexml/xpath_parser.rb#591 @@ -4706,10 +4719,10 @@ class REXML::XPathParser # source://rexml//lib/rexml/xpath_parser.rb#582 def filter_nodeset(nodeset); end - # source://rexml//lib/rexml/xpath_parser.rb#745 + # source://rexml//lib/rexml/xpath_parser.rb#749 def following(node); end - # source://rexml//lib/rexml/xpath_parser.rb#756 + # source://rexml//lib/rexml/xpath_parser.rb#760 def following_node_of(node); end # Returns a String namespace for a node, given a prefix @@ -4721,19 +4734,19 @@ class REXML::XPathParser # source://rexml//lib/rexml/xpath_parser.rb#163 def get_namespace(node, prefix); end - # source://rexml//lib/rexml/xpath_parser.rb#642 + # source://rexml//lib/rexml/xpath_parser.rb#646 def leave(tag, *args); end - # source://rexml//lib/rexml/xpath_parser.rb#763 + # source://rexml//lib/rexml/xpath_parser.rb#767 def next_sibling_node(node); end # source://rexml//lib/rexml/xpath_parser.rb#477 def node_test(path_stack, nodesets, any_type: T.unsafe(nil)); end - # source://rexml//lib/rexml/xpath_parser.rb#802 + # source://rexml//lib/rexml/xpath_parser.rb#806 def norm(b); end - # source://rexml//lib/rexml/xpath_parser.rb#890 + # source://rexml//lib/rexml/xpath_parser.rb#894 def normalize_compare_values(a, operator, b); end # Builds a nodeset of all of the preceding nodes of the supplied node, @@ -4741,10 +4754,10 @@ class REXML::XPathParser # preceding:: includes every element in the document that precedes this node, # except for ancestors # - # source://rexml//lib/rexml/xpath_parser.rb#708 + # source://rexml//lib/rexml/xpath_parser.rb#712 def preceding(node); end - # source://rexml//lib/rexml/xpath_parser.rb#730 + # source://rexml//lib/rexml/xpath_parser.rb#734 def preceding_node_of(node); end # Reorders an array of nodes so that they are in document order @@ -4756,7 +4769,7 @@ class REXML::XPathParser # I wouldn't have to do this. Maybe add a document IDX for each node? # Problems with mutable documents. Or, rewrite everything. # - # source://rexml//lib/rexml/xpath_parser.rb#655 + # source://rexml//lib/rexml/xpath_parser.rb#659 def sort(array_of_nodes, order); end # source://rexml//lib/rexml/xpath_parser.rb#441 @@ -4767,13 +4780,13 @@ class REXML::XPathParser # source://rexml//lib/rexml/xpath_parser.rb#154 def strict?; end - # source://rexml//lib/rexml/xpath_parser.rb#630 + # source://rexml//lib/rexml/xpath_parser.rb#634 def trace(*args); end - # source://rexml//lib/rexml/xpath_parser.rb#950 + # source://rexml//lib/rexml/xpath_parser.rb#954 def unnode(nodeset); end - # source://rexml//lib/rexml/xpath_parser.rb#877 + # source://rexml//lib/rexml/xpath_parser.rb#881 def value_type(value); end end diff --git a/sorbet/rbi/gems/rubocop-ast@1.31.2.rbi b/sorbet/rbi/gems/rubocop-ast@1.31.3.rbi similarity index 99% rename from sorbet/rbi/gems/rubocop-ast@1.31.2.rbi rename to sorbet/rbi/gems/rubocop-ast@1.31.3.rbi index 802db0f..6f61a02 100644 --- a/sorbet/rbi/gems/rubocop-ast@1.31.2.rbi +++ b/sorbet/rbi/gems/rubocop-ast@1.31.3.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rubocop-ast` gem. # Please instead update this file by running `bin/tapioca gem rubocop-ast`. + class Parser::Source::Range include ::RuboCop::AST::Ext::Range end @@ -5161,9 +5162,6 @@ RuboCop::AST::NodePattern::Sets::SET_CLONE_DUP_FREEZE = T.let(T.unsafe(nil), Set # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET_COUNT_LENGTH_SIZE = T.let(T.unsafe(nil), Set) -# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 -RuboCop::AST::NodePattern::Sets::SET_DEFINE_METHOD = T.let(T.unsafe(nil), Set) - # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET_DEFINE_METHOD_DEFINE_SINGLETON_METHOD = T.let(T.unsafe(nil), Set) @@ -5173,9 +5171,6 @@ RuboCop::AST::NodePattern::Sets::SET_EACH_WITH_INDEX_WITH_INDEX = T.let(T.unsafe # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET_EACH_WITH_OBJECT_WITH_OBJECT = T.let(T.unsafe(nil), Set) -# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 -RuboCop::AST::NodePattern::Sets::SET_ENV = T.let(T.unsafe(nil), Set) - # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET_ESCAPE_ENCODE_UNESCAPE_DECODE = T.let(T.unsafe(nil), Set) @@ -5344,6 +5339,9 @@ RuboCop::AST::NodePattern::Sets::SET__FETCH = T.let(T.unsafe(nil), Set) # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET__GLOB = T.let(T.unsafe(nil), Set) +# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 +RuboCop::AST::NodePattern::Sets::SET__PUSH_APPEND = T.let(T.unsafe(nil), Set) + # source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10 RuboCop::AST::NodePattern::Sets::SET___ = T.let(T.unsafe(nil), Set) diff --git a/sorbet/rbi/gems/rubocop-performance@1.20.2.rbi b/sorbet/rbi/gems/rubocop-performance@1.21.0.rbi similarity index 99% rename from sorbet/rbi/gems/rubocop-performance@1.20.2.rbi rename to sorbet/rbi/gems/rubocop-performance@1.21.0.rbi index 72f4043..6d0fc57 100644 --- a/sorbet/rbi/gems/rubocop-performance@1.20.2.rbi +++ b/sorbet/rbi/gems/rubocop-performance@1.21.0.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `rubocop-performance` gem. # Please instead update this file by running `bin/tapioca gem rubocop-performance`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/rubocop-sorbet@0.7.8.rbi b/sorbet/rbi/gems/rubocop-sorbet@0.7.8.rbi index f5ac216..9dac839 100644 --- a/sorbet/rbi/gems/rubocop-sorbet@0.7.8.rbi +++ b/sorbet/rbi/gems/rubocop-sorbet@0.7.8.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `rubocop-sorbet` gem. # Please instead update this file by running `bin/tapioca gem rubocop-sorbet`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/rubocop@1.62.1.rbi b/sorbet/rbi/gems/rubocop@1.63.5.rbi similarity index 98% rename from sorbet/rbi/gems/rubocop@1.62.1.rbi rename to sorbet/rbi/gems/rubocop@1.63.5.rbi index f8139d8..660f133 100644 --- a/sorbet/rbi/gems/rubocop@1.62.1.rbi +++ b/sorbet/rbi/gems/rubocop@1.63.5.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `rubocop` gem. # Please instead update this file by running `bin/tapioca gem rubocop`. + class Parser::Source::Comment include ::RuboCop::Ext::Comment end @@ -97,44 +98,44 @@ class RuboCop::CLI private - # source://rubocop//lib/rubocop/cli.rb#152 + # source://rubocop//lib/rubocop/cli.rb#156 def act_on_options; end - # source://rubocop//lib/rubocop/cli.rb#194 + # source://rubocop//lib/rubocop/cli.rb#198 def apply_default_formatter; end - # source://rubocop//lib/rubocop/cli.rb#121 + # source://rubocop//lib/rubocop/cli.rb#125 def execute_runners; end - # source://rubocop//lib/rubocop/cli.rb#178 + # source://rubocop//lib/rubocop/cli.rb#182 def handle_editor_mode; end # @raise [Finished] # - # source://rubocop//lib/rubocop/cli.rb#183 + # source://rubocop//lib/rubocop/cli.rb#187 def handle_exiting_options; end - # source://rubocop//lib/rubocop/cli.rb#140 + # source://rubocop//lib/rubocop/cli.rb#144 def parallel_by_default!; end - # source://rubocop//lib/rubocop/cli.rb#76 + # source://rubocop//lib/rubocop/cli.rb#80 def profile_if_needed; end - # source://rubocop//lib/rubocop/cli.rb#109 + # source://rubocop//lib/rubocop/cli.rb#113 def require_gem(name); end - # source://rubocop//lib/rubocop/cli.rb#117 + # source://rubocop//lib/rubocop/cli.rb#121 def run_command(name); end - # source://rubocop//lib/rubocop/cli.rb#170 + # source://rubocop//lib/rubocop/cli.rb#174 def set_options_to_config_loader; end - # source://rubocop//lib/rubocop/cli.rb#129 + # source://rubocop//lib/rubocop/cli.rb#133 def suggest_extensions; end # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/cli.rb#133 + # source://rubocop//lib/rubocop/cli.rb#137 def validate_options_vs_config; end end @@ -744,6 +745,11 @@ class RuboCop::CachedData # source://rubocop//lib/rubocop/cached_data.rb#47 def deserialize_offenses(offenses); end + # @api private + # + # source://rubocop//lib/rubocop/cached_data.rb#56 + def location_from_source_buffer(offense, source_buffer); end + # @api private # # source://rubocop//lib/rubocop/cached_data.rb#40 @@ -763,7 +769,7 @@ class RuboCop::CommentConfig # @return [CommentConfig] a new instance of CommentConfig # - # source://standard/1.35.1/lib/standard/rubocop/ext.rb#20 + # source://standard/1.36.0/lib/standard/rubocop/ext.rb#20 def initialize(processed_source); end # @return [Boolean] @@ -1002,7 +1008,9 @@ class RuboCop::Config # source://rubocop//lib/rubocop/config.rb#237 def base_dir_for_path_parameters; end - # source://rubocop//lib/rubocop/config.rb#266 + # @return [String, nil] + # + # source://rubocop//lib/rubocop/config.rb#267 def bundler_lock_file_path; end # source://rubocop//lib/rubocop/config.rb#51 @@ -1078,7 +1086,12 @@ class RuboCop::Config # source://rubocop//lib/rubocop/config.rb#153 def for_department(department_name); end - # source://rubocop//lib/rubocop/config.rb#289 + # Returns target's locked gem versions (i.e. from Gemfile.lock or gems.locked) + # + # source://rubocop//lib/rubocop/config.rb#292 + def gem_versions_in_target; end + + # source://rubocop//lib/rubocop/config.rb#296 def inspect; end # True if this is a config file that is shipped with RuboCop @@ -1123,7 +1136,7 @@ class RuboCop::Config # source://rubocop//lib/rubocop/config.rb#220 def patterns_to_include; end - # source://rubocop//lib/rubocop/config.rb#277 + # source://rubocop//lib/rubocop/config.rb#278 def pending_cops; end # Returns true if there's a chance that an Include pattern matches hidden @@ -1169,18 +1182,31 @@ class RuboCop::Config private - # source://rubocop//lib/rubocop/config.rb#324 + # source://rubocop//lib/rubocop/config.rb#347 def department_of(qualified_cop_name); end # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#312 + # source://rubocop//lib/rubocop/config.rb#335 def enable_cop?(qualified_cop_name, cop_options); end - # source://rubocop//lib/rubocop/config.rb#299 + # @param gem_version [Gem::Version] an object like `Gem::Version.new("7.1.2.3")` + # @return [Float] The major and minor version, like `7.1` + # + # source://rubocop//lib/rubocop/config.rb#321 + def gem_version_to_major_minor_float(gem_version); end + + # source://rubocop//lib/rubocop/config.rb#328 + def read_gem_versions_from_target_lockfile; end + + # @return [Float, nil] The Rails version as a `major.minor` Float. + # + # source://rubocop//lib/rubocop/config.rb#308 def read_rails_version_from_bundler_lock_file; end - # source://rubocop//lib/rubocop/config.rb#295 + # @return [Float, nil] The Rails version as a `major.minor` Float. + # + # source://rubocop//lib/rubocop/config.rb#303 def target_rails_version_from_bundler_lock_file; end class << self @@ -2916,18 +2942,18 @@ class RuboCop::Cop::Base # @return [Base] a new instance of Base # - # source://rubocop//lib/rubocop/cop/base.rb#129 + # source://rubocop//lib/rubocop/cop/base.rb#153 def initialize(config = T.unsafe(nil), options = T.unsafe(nil)); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#243 + # source://rubocop//lib/rubocop/cop/base.rb#269 def active_support_extensions_enabled?; end # Adds an offense that has no particular location. # No correction can be applied to global offenses # - # source://rubocop//lib/rubocop/cop/base.rb#162 + # source://rubocop//lib/rubocop/cop/base.rb#186 def add_global_offense(message = T.unsafe(nil), severity: T.unsafe(nil)); end # Adds an offense on the specified range (or node with an expression) @@ -2935,25 +2961,25 @@ class RuboCop::Cop::Base # to provide the cop the opportunity to autocorrect the offense. # If message is not specified, the method `message` will be called. # - # source://rubocop//lib/rubocop/cop/base.rb#172 + # source://rubocop//lib/rubocop/cop/base.rb#198 def add_offense(node_or_range, message: T.unsafe(nil), severity: T.unsafe(nil), &block); end # @api private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#313 + # source://rubocop//lib/rubocop/cop/base.rb#340 def always_autocorrect?; end # Called before any investigation # # @api private # - # source://rubocop//lib/rubocop/cop/base.rb#299 + # source://rubocop//lib/rubocop/cop/base.rb#326 def begin_investigation(processed_source, offset: T.unsafe(nil), original: T.unsafe(nil)); end # @api private # - # source://rubocop//lib/rubocop/cop/base.rb#284 + # source://rubocop//lib/rubocop/cop/base.rb#311 def callbacks_needed; end # Returns the value of attribute config. @@ -2961,29 +2987,29 @@ class RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/base.rb#43 def config; end - # source://rubocop//lib/rubocop/cop/base.rb#223 + # source://rubocop//lib/rubocop/cop/base.rb#249 def config_to_allow_offenses; end - # source://rubocop//lib/rubocop/cop/base.rb#227 + # source://rubocop//lib/rubocop/cop/base.rb#253 def config_to_allow_offenses=(hash); end # @api private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#319 + # source://rubocop//lib/rubocop/cop/base.rb#346 def contextual_autocorrect?; end # Configuration Helpers # - # source://rubocop//lib/rubocop/cop/base.rb#217 + # source://rubocop//lib/rubocop/cop/base.rb#243 def cop_config; end - # source://rubocop//lib/rubocop/cop/base.rb#209 + # source://rubocop//lib/rubocop/cop/base.rb#235 def cop_name; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#255 + # source://rubocop//lib/rubocop/cop/base.rb#282 def excluded_file?(file); end # This method should be overridden when a cop's behavior depends @@ -3002,51 +3028,51 @@ class RuboCop::Cop::Base # ResultCache system when those external dependencies change, # ie when the ResultCache should be invalidated. # - # source://rubocop//lib/rubocop/cop/base.rb#205 + # source://rubocop//lib/rubocop/cop/base.rb#231 def external_dependency_checksum; end - # source://rubocop//lib/rubocop/cop/base.rb#323 + # source://rubocop//lib/rubocop/cop/base.rb#350 def inspect; end # Gets called if no message is specified when calling `add_offense` or # `add_global_offense` # Cops are discouraged to override this; instead pass your message directly # - # source://rubocop//lib/rubocop/cop/base.rb#156 + # source://rubocop//lib/rubocop/cop/base.rb#180 def message(_range = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/base.rb#209 + # source://rubocop//lib/rubocop/cop/base.rb#235 def name; end # @deprecated Make potential errors with previous API more obvious # - # source://rubocop//lib/rubocop/cop/base.rb#275 + # source://rubocop//lib/rubocop/cop/base.rb#302 def offenses; end # Called after all on_... have been called # When refining this method, always call `super` # - # source://rubocop//lib/rubocop/cop/base.rb#143 + # source://rubocop//lib/rubocop/cop/base.rb#167 def on_investigation_end; end # Called before all on_... have been called # When refining this method, always call `super` # - # source://rubocop//lib/rubocop/cop/base.rb#137 + # source://rubocop//lib/rubocop/cop/base.rb#161 def on_new_investigation; end # Called instead of all on_... callbacks for unrecognized files / syntax errors # When refining this method, always call `super` # - # source://rubocop//lib/rubocop/cop/base.rb#149 + # source://rubocop//lib/rubocop/cop/base.rb#173 def on_other_file; end # There should be very limited reasons for a Cop to do it's own parsing # - # source://rubocop//lib/rubocop/cop/base.rb#260 + # source://rubocop//lib/rubocop/cop/base.rb#287 def parse(source, path = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/base.rb#235 + # source://rubocop//lib/rubocop/cop/base.rb#261 def parser_engine; end # Returns the value of attribute processed_source. @@ -3058,99 +3084,104 @@ class RuboCop::Cop::Base # # @api private # - # source://rubocop//lib/rubocop/cop/base.rb#266 + # source://rubocop//lib/rubocop/cop/base.rb#293 def ready; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#247 + # source://rubocop//lib/rubocop/cop/base.rb#273 def relevant_file?(file); end - # source://rubocop//lib/rubocop/cop/base.rb#239 + # source://rubocop//lib/rubocop/cop/base.rb#265 def target_rails_version; end - # source://rubocop//lib/rubocop/cop/base.rb#231 + # source://rubocop//lib/rubocop/cop/base.rb#257 def target_ruby_version; end private - # source://rubocop//lib/rubocop/cop/base.rb#451 + # source://rubocop//lib/rubocop/cop/base.rb#478 def annotate(message); end - # source://rubocop//lib/rubocop/cop/base.rb#335 + # source://rubocop//lib/rubocop/cop/base.rb#362 def apply_correction(corrector); end # @return [Symbol] offense status # - # source://rubocop//lib/rubocop/cop/base.rb#415 + # source://rubocop//lib/rubocop/cop/base.rb#442 def attempt_correction(range, corrector); end # Reserved for Cop::Cop # - # source://rubocop//lib/rubocop/cop/base.rb#331 + # source://rubocop//lib/rubocop/cop/base.rb#358 def callback_argument(range); end # Called to complete an investigation # - # source://rubocop//lib/rubocop/cop/base.rb#364 + # source://rubocop//lib/rubocop/cop/base.rb#391 def complete_investigation; end # @return [Symbol, Corrector] offense status # - # source://rubocop//lib/rubocop/cop/base.rb#389 + # source://rubocop//lib/rubocop/cop/base.rb#416 def correct(range); end - # source://rubocop//lib/rubocop/cop/base.rb#349 + # source://rubocop//lib/rubocop/cop/base.rb#376 def current_corrector; end # Reserved for Commissioner: # - # source://rubocop//lib/rubocop/cop/base.rb#341 + # source://rubocop//lib/rubocop/cop/base.rb#368 def current_offense_locations; end - # source://rubocop//lib/rubocop/cop/base.rb#353 + # source://rubocop//lib/rubocop/cop/base.rb#380 def current_offenses; end - # source://rubocop//lib/rubocop/cop/base.rb#345 + # source://rubocop//lib/rubocop/cop/base.rb#372 def currently_disabled_lines; end - # source://rubocop//lib/rubocop/cop/base.rb#479 + # source://rubocop//lib/rubocop/cop/base.rb#506 def custom_severity; end - # source://rubocop//lib/rubocop/cop/base.rb#475 + # source://rubocop//lib/rubocop/cop/base.rb#502 def default_severity; end - # source://rubocop//lib/rubocop/cop/base.rb#429 + # source://rubocop//lib/rubocop/cop/base.rb#456 def disable_uncorrectable(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#465 + # source://rubocop//lib/rubocop/cop/base.rb#492 def enabled_line?(line_number); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#457 + # source://rubocop//lib/rubocop/cop/base.rb#484 def file_name_matches_any?(file, parameter, default_result); end - # source://rubocop//lib/rubocop/cop/base.rb#447 + # source://rubocop//lib/rubocop/cop/base.rb#474 def find_message(range, message); end - # source://rubocop//lib/rubocop/cop/base.rb#471 + # source://rubocop//lib/rubocop/cop/base.rb#498 def find_severity(_range, severity); end - # source://rubocop//lib/rubocop/cop/base.rb#492 + # source://rubocop//lib/rubocop/cop/base.rb#519 def range_for_original(range); end - # source://rubocop//lib/rubocop/cop/base.rb#436 + # source://rubocop//lib/rubocop/cop/base.rb#463 def range_from_node_or_range(node_or_range); end - # source://rubocop//lib/rubocop/cop/base.rb#384 + # source://rubocop//lib/rubocop/cop/base.rb#411 def reset_investigation; end + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/base.rb#527 + def target_satisfies_all_gem_version_requirements?; end + # @return [Symbol] offense status # - # source://rubocop//lib/rubocop/cop/base.rb#404 + # source://rubocop//lib/rubocop/cop/base.rb#431 def use_corrector(range, corrector); end class << self @@ -3165,18 +3196,18 @@ class RuboCop::Cop::Base # Naming # - # source://rubocop//lib/rubocop/cop/base.rb#89 + # source://rubocop//lib/rubocop/cop/base.rb#90 def badge; end # @api private # - # source://rubocop//lib/rubocop/cop/base.rb#289 + # source://rubocop//lib/rubocop/cop/base.rb#316 def callbacks_needed; end - # source://rubocop//lib/rubocop/cop/base.rb#93 + # source://rubocop//lib/rubocop/cop/base.rb#94 def cop_name; end - # source://rubocop//lib/rubocop/cop/base.rb#97 + # source://rubocop//lib/rubocop/cop/base.rb#98 def department; end # Cops (other than builtin) are encouraged to implement this @@ -3189,9 +3220,14 @@ class RuboCop::Cop::Base # Call for abstract Cop classes # - # source://rubocop//lib/rubocop/cop/base.rb#77 + # source://rubocop//lib/rubocop/cop/base.rb#78 def exclude_from_registry; end + # Returns the value of attribute gem_requirements. + # + # source://rubocop//lib/rubocop/cop/base.rb#135 + def gem_requirements; end + # @private # # source://rubocop//lib/rubocop/cop/base.rb#71 @@ -3199,12 +3235,12 @@ class RuboCop::Cop::Base # Override and return the Force class(es) you need to join # - # source://rubocop//lib/rubocop/cop/base.rb#114 + # source://rubocop//lib/rubocop/cop/base.rb#115 def joining_forces; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#101 + # source://rubocop//lib/rubocop/cop/base.rb#102 def lint?; end # Returns true if the cop name or the cop namespace matches any of the @@ -3212,15 +3248,30 @@ class RuboCop::Cop::Base # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#107 + # source://rubocop//lib/rubocop/cop/base.rb#108 def match?(given_names); end + # Register a version requirement for the given gem name. + # This cop will be skipped unless the target satisfies *all* requirements. + # + # @api public + # @param gem_name [String] + # @param version_requirements [Array] The version requirements, + # using the same syntax as a Gemfile, e.g. ">= 1.2.3" + # + # If omitted, any version of the gem will be accepted. + # + # https://guides.rubygems.org/patterns/#declaring-dependencies + # + # source://rubocop//lib/rubocop/cop/base.rb#148 + def requires_gem(gem_name, *version_requirements); end + # Returns if class supports autocorrect. # It is recommended to extend AutoCorrector instead of overriding # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#83 + # source://rubocop//lib/rubocop/cop/base.rb#84 def support_autocorrect?; end # Override if your cop should be called repeatedly for multiple investigations @@ -3233,22 +3284,22 @@ class RuboCop::Cop::Base # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#125 + # source://rubocop//lib/rubocop/cop/base.rb#126 def support_multiple_source?; end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/base.rb#375 + # source://rubocop//lib/rubocop/cop/base.rb#402 def builtin?; end - # source://rubocop//lib/rubocop/cop/base.rb#357 + # source://rubocop//lib/rubocop/cop/base.rb#384 def restrict_on_send; end end end -# source://rubocop//lib/rubocop/cop/base.rb#361 +# source://rubocop//lib/rubocop/cop/base.rb#388 RuboCop::Cop::Base::EMPTY_OFFENSES = T.let(T.unsafe(nil), Array) # Reports of an investigation. @@ -4137,6 +4188,9 @@ module RuboCop::Cop::CodeLength # source://rubocop//lib/rubocop/cop/mixin/code_length.rb#45 def irrelevant_line(source_line); end + # source://rubocop//lib/rubocop/cop/mixin/code_length.rb#58 + def location(node); end + # source://rubocop//lib/rubocop/cop/mixin/code_length.rb#19 def max_length; end @@ -5042,7 +5096,7 @@ class RuboCop::Cop::Corrector < ::Parser::Source::TreeRewriter # Legacy # - # source://parser/3.3.0.5/lib/parser/source/tree_rewriter.rb#252 + # source://parser/3.3.1.0/lib/parser/source/tree_rewriter.rb#252 def rewrite; end # Swaps sources at the given ranges. @@ -10661,43 +10715,43 @@ class RuboCop::Cop::Layout::FirstArrayElementIndentation < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#94 def on_array(node); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#98 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#100 def on_csend(node); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#98 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#100 def on_send(node); end private - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#189 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#191 def array_alignment_config; end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#109 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#111 def autocorrect(corrector, node); end # Returns the description of what the correct indentation is based on. # - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#147 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#149 def base_description(indent_base_type); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#113 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#115 def brace_alignment_style; end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#117 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#119 def check(array_node, left_parenthesis); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#131 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#133 def check_right_bracket(right_bracket, first_elem, left_bracket, left_parenthesis); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#183 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#185 def enforce_first_argument_with_fixed_indentation?; end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#160 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#162 def message(base_description); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#168 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#170 def message_for_right_bracket(indent_base_type); end end @@ -16926,7 +16980,7 @@ class RuboCop::Cop::Lint::AssignmentInCondition < ::RuboCop::Cop::Base include ::RuboCop::Cop::SafeAssignment extend ::RuboCop::Cop::AutoCorrector - # source://standard/1.35.1/lib/standard/rubocop/ext.rb#4 + # source://standard/1.36.0/lib/standard/rubocop/ext.rb#4 def message(_); end # source://rubocop//lib/rubocop/cop/lint/assignment_in_condition.rb#55 @@ -17370,6 +17424,11 @@ RuboCop::Cop::Lint::ConstantResolution::MSG = T.let(T.unsafe(nil), String) # MyDebugger.debug_this # ---- # +# Some gems also ship files that will start a debugging session when required, +# for example `require 'debug/start'` from `ruby/debug`. These requires can +# be configured through `DebuggerRequires`. It has the same structure as +# `DebuggerMethods`, which you can read about above. +# # @example # # # bad (ok during development) @@ -17402,43 +17461,56 @@ RuboCop::Cop::Lint::ConstantResolution::MSG = T.let(T.unsafe(nil), String) # def some_method # my_debugger # end +# @example DebuggerRequires: [my_debugger/start] # -# source://rubocop//lib/rubocop/cop/lint/debugger.rb#67 +# # bad (ok during development) +# +# require 'my_debugger/start' +# +# source://rubocop//lib/rubocop/cop/lint/debugger.rb#78 class RuboCop::Cop::Lint::Debugger < ::RuboCop::Cop::Base - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#71 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#82 def on_send(node); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#117 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#142 def assumed_argument?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#96 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#121 def assumed_usage_context?(node); end - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#106 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#131 def chained_method_name(send_node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#90 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#108 def debugger_method?(send_node); end - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#83 + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#94 def debugger_methods; end - # source://rubocop//lib/rubocop/cop/lint/debugger.rb#79 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#114 + def debugger_require?(send_node); end + + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#101 + def debugger_requires; end + + # source://rubocop//lib/rubocop/cop/lint/debugger.rb#90 def message(node); end end -# source://rubocop//lib/rubocop/cop/lint/debugger.rb#69 +# source://rubocop//lib/rubocop/cop/lint/debugger.rb#80 RuboCop::Cop::Lint::Debugger::BLOCK_TYPES = T.let(T.unsafe(nil), Array) -# source://rubocop//lib/rubocop/cop/lint/debugger.rb#68 +# source://rubocop//lib/rubocop/cop/lint/debugger.rb#79 RuboCop::Cop::Lint::Debugger::MSG = T.let(T.unsafe(nil), String) # Checks for uses of the deprecated class method usages. @@ -20453,7 +20525,7 @@ class RuboCop::Cop::Lint::MixedCaseRange < ::RuboCop::Cop::Base include ::RuboCop::Cop::RangeHelp extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#56 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#58 def each_unsafe_regexp_range(node); end # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#37 @@ -20467,31 +20539,31 @@ class RuboCop::Cop::Lint::MixedCaseRange < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#72 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#74 def build_source_range(range_start, range_end); end - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#76 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#78 def range_for(char); end - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#82 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#84 def range_pairs(expr); end - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#102 - def rewrite_regexp_range(source); end + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#104 + def regexp_range(source); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#92 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#94 def skip_expression?(expr); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#96 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#98 def skip_range?(range_start, range_end); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#86 + # source://rubocop//lib/rubocop/cop/lint/mixed_case_range.rb#88 def unsafe_range?(range_start, range_end); end end @@ -22468,21 +22540,21 @@ class RuboCop::Cop::Lint::RedundantWithIndex < ::RuboCop::Cop::Base include ::RuboCop::Cop::RangeHelp extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#36 + # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#37 def on_block(node); end - # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#36 + # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#37 def on_numblock(node); end - # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#57 + # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#60 def redundant_with_index?(param0 = T.unsafe(nil)); end private - # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#67 + # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#70 def message(node); end - # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#75 + # source://rubocop//lib/rubocop/cop/lint/redundant_with_index.rb#78 def with_index_range(send); end end @@ -24501,7 +24573,7 @@ class RuboCop::Cop::Lint::UnreachableLoop < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/unreachable_loop.rb#194 + # source://rubocop//lib/rubocop/cop/lint/unreachable_loop.rb#200 def conditional_continue_keyword?(break_statement); end # @return [Boolean] @@ -24511,7 +24583,7 @@ class RuboCop::Cop::Lint::UnreachableLoop < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/unreachable_loop.rb#184 + # source://rubocop//lib/rubocop/cop/lint/unreachable_loop.rb#190 def preceded_by_continue_statement?(break_statement); end # source://rubocop//lib/rubocop/cop/lint/unreachable_loop.rb#130 @@ -25874,6 +25946,11 @@ module RuboCop::Cop::MethodComplexity # # source://rubocop//lib/rubocop/cop/mixin/method_complexity.rb#61 def complexity(body); end + + # @api private + # + # source://rubocop//lib/rubocop/cop/mixin/method_complexity.rb#73 + def location(node); end end # Common code for cops that deal with preferred methods. @@ -27492,43 +27569,66 @@ class RuboCop::Cop::Naming::BlockForwarding < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector extend ::RuboCop::Cop::TargetRubyVersion - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#55 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#54 def on_def(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#55 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#54 def on_defs(node); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#95 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#114 def anonymous_block_argument?(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#127 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#87 + def block_argument_name_matched?(block_pass_node, last_argument); end + + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#146 def block_forwarding_name; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#81 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#77 def expected_block_forwarding_style?(node, last_argument); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#99 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#118 def explicit_block_argument?(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#103 + # Prevents the following syntax error: + # + # # foo.rb + # def foo(&) + # block_method do + # bar(&) + # end + # end + # + # $ ruby -vc foo.rb + # ruby 3.3.0 (2023-12-25 revision 5124f9ac75) [x86_64-darwin22] + # foo.rb: foo.rb:4: anonymous block parameter is also used within block (SyntaxError) + # + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#106 + def invalidates_syntax?(block_pass_node); end + + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#122 def register_offense(block_argument, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#119 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#138 def use_block_argument_as_local_variable?(node, last_argument); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#91 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#110 def use_kwarg_in_method_definition?(node); end class << self @@ -27754,8 +27854,6 @@ class RuboCop::Cop::Naming::FileName < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/naming/file_name.rb#165 def find_definition(node); end - # @yield [source_range(processed_source.buffer, 1, 0), msg] - # # source://rubocop//lib/rubocop/cop/naming/file_name.rb#65 def for_bad_filename(file_path); end @@ -28007,13 +28105,13 @@ class RuboCop::Cop::Naming::InclusiveLanguage < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#126 def check_token?(type); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#244 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#243 def create_message(word, message = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#218 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#217 def create_multiple_word_message_for_file(words); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#214 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#213 def create_single_word_message_for_file(word); end # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#189 @@ -28022,10 +28120,10 @@ class RuboCop::Cop::Naming::InclusiveLanguage < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#160 def extract_regexp(term, term_definition); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#252 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#251 def find_flagged_term(word); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#266 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#265 def format_suggestions(suggestions); end # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#197 @@ -28034,10 +28132,10 @@ class RuboCop::Cop::Naming::InclusiveLanguage < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#100 def investigate_tokens; end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#232 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#231 def mask_input(str); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#281 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#280 def offense_range(token, word); end # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#130 @@ -28046,13 +28144,13 @@ class RuboCop::Cop::Naming::InclusiveLanguage < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#144 def preprocess_flagged_terms; end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#259 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#258 def preprocess_suggestions(suggestions); end # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#179 def process_allowed_regex(allowed); end - # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#222 + # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#221 def scan_for_words(input); end # source://rubocop//lib/rubocop/cop/naming/inclusive_language.rb#174 @@ -30799,7 +30897,7 @@ class RuboCop::Cop::Style::Alias < ::RuboCop::Cop::Base include ::RuboCop::Cop::ConfigurableEnforcedStyle extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/alias.rb#51 + # source://rubocop//lib/rubocop/cop/style/alias.rb#52 def on_alias(node); end # source://rubocop//lib/rubocop/cop/style/alias.rb#41 @@ -30807,47 +30905,47 @@ class RuboCop::Cop::Style::Alias < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/alias.rb#85 + # source://rubocop//lib/rubocop/cop/style/alias.rb#86 def add_offense_for_args(node, &block); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/alias.rb#75 + # source://rubocop//lib/rubocop/cop/style/alias.rb#76 def alias_keyword_possible?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/alias.rb#79 + # source://rubocop//lib/rubocop/cop/style/alias.rb#80 def alias_method_possible?(node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#65 + # source://rubocop//lib/rubocop/cop/style/alias.rb#66 def autocorrect(corrector, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/alias.rb#124 + # source://rubocop//lib/rubocop/cop/style/alias.rb#125 def bareword?(sym_node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#128 + # source://rubocop//lib/rubocop/cop/style/alias.rb#129 def correct_alias_method_to_alias(corrector, send_node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#135 + # source://rubocop//lib/rubocop/cop/style/alias.rb#136 def correct_alias_to_alias_method(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#142 + # source://rubocop//lib/rubocop/cop/style/alias.rb#143 def correct_alias_with_symbol_args(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#147 + # source://rubocop//lib/rubocop/cop/style/alias.rb#148 def identifier(node); end - # source://rubocop//lib/rubocop/cop/style/alias.rb#113 + # source://rubocop//lib/rubocop/cop/style/alias.rb#114 def lexical_scope_type(node); end # In this expression, will `self` be the same as the innermost enclosing # class or module block (:lexical)? Or will it be something else # (:dynamic)? If we're in an instance_eval block, return that. # - # source://rubocop//lib/rubocop/cop/style/alias.rb#96 + # source://rubocop//lib/rubocop/cop/style/alias.rb#97 def scope_type(node); end end @@ -31096,7 +31194,7 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#185 def add_forward_all_offenses(node, send_classifications, forwardable_args); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#350 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#351 def add_parens_if_missing(node, corrector); end # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#212 @@ -31104,10 +31202,10 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#342 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#343 def allow_only_rest_arguments?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#334 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#335 def arguments_range(node, first_node); end # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#263 @@ -31118,7 +31216,7 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#494 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#495 def explicit_block_name?; end # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#168 @@ -31143,7 +31241,7 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#282 def redundant_named_arg(arg, config_name, keyword); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#324 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#325 def register_forward_all_offense(def_or_send, send_or_arguments, rest_or_splat); end # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#298 @@ -31157,7 +31255,7 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#346 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#347 def use_anonymous_forwarding?; end class << self @@ -31186,115 +31284,115 @@ RuboCop::Cop::Style::ArgumentsForwarding::KWARGS_MSG = T.let(T.unsafe(nil), Stri # Classifies send nodes for possible rest/kwrest/all (including block) forwarding. # -# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#357 +# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#358 class RuboCop::Cop::Style::ArgumentsForwarding::SendNodeClassifier extend ::RuboCop::AST::NodePattern::Macros # @return [SendNodeClassifier] a new instance of SendNodeClassifier # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#369 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#370 def initialize(def_node, send_node, referenced_lvars, forwardable_args, **config); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#397 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#398 def classification; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#364 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#365 def extract_forwarded_kwrest_arg(param0 = T.unsafe(nil), param1); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#391 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#392 def forwarded_block_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#367 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#368 def forwarded_block_arg?(param0 = T.unsafe(nil), param1); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#385 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#386 def forwarded_kwrest_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#379 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#380 def forwarded_rest_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#361 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#362 def forwarded_rest_arg?(param0 = T.unsafe(nil), param1); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#465 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#466 def additional_kwargs?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#461 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#462 def additional_kwargs_or_forwarded_kwargs?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#475 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#476 def allow_offense_for_no_block?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#446 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#447 def any_arg_referenced?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#430 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#431 def arguments; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#409 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#410 def can_forward_all?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#469 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#470 def forward_additional_kwargs?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#426 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#427 def forwarded_rest_and_kwrest_args; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#488 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#489 def missing_rest_arg_or_kwrest_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#479 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#480 def no_additional_args?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#454 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#455 def no_post_splat_args?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#422 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#423 def offensive_block_forwarding?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#442 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#443 def referenced_block_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#438 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#439 def referenced_kwrest_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#434 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#435 def referenced_rest_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#418 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#419 def ruby_32_missing_rest_or_kwest?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#450 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#451 def target_ruby_version; end end @@ -32892,9 +32990,7 @@ RuboCop::Cop::Style::ClassVars::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # @example # # bad # array.reject(&:nil?) -# array.delete_if(&:nil?) # array.reject { |e| e.nil? } -# array.delete_if { |e| e.nil? } # array.select { |e| !e.nil? } # array.grep_v(nil) # array.grep_v(NilClass) @@ -32904,7 +33000,9 @@ RuboCop::Cop::Style::ClassVars::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # # # bad # hash.reject!(&:nil?) +# array.delete_if(&:nil?) # hash.reject! { |k, v| v.nil? } +# array.delete_if { |e| e.nil? } # hash.select! { |k, v| !v.nil? } # # # good @@ -34062,36 +34160,36 @@ class RuboCop::Cop::Style::Copyright < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/copyright.rb#47 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#45 + def autocorrect(corrector); end + + # source://rubocop//lib/rubocop/cop/style/copyright.rb#56 def autocorrect_notice; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#78 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#83 def encoding_token?(processed_source, token_index); end - # source://rubocop//lib/rubocop/cop/style/copyright.rb#64 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#69 def insert_notice_before(processed_source); end - # source://rubocop//lib/rubocop/cop/style/copyright.rb#43 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#52 def notice; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#85 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#90 def notice_found?(processed_source); end - # source://rubocop//lib/rubocop/cop/style/copyright.rb#51 - def offense_range; end - # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#71 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#76 def shebang_token?(processed_source, token_index); end # @raise [Warning] # - # source://rubocop//lib/rubocop/cop/style/copyright.rb#55 + # source://rubocop//lib/rubocop/cop/style/copyright.rb#60 def verify_autocorrect_notice!; end end @@ -35814,19 +35912,19 @@ class RuboCop::Cop::Style::EvalWithLocation < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#184 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#186 def add_offense_for_different_line(node, line_node, line_diff); end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#131 def add_offense_for_incorrect_line(method_name, line_node, sign, line_diff); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#199 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#201 def add_offense_for_missing_line(node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#206 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#208 def add_offense_for_missing_location(node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#178 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#180 def add_offense_for_same_line(node, line_node); end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#143 @@ -35838,16 +35936,16 @@ class RuboCop::Cop::Style::EvalWithLocation < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#95 def check_location(node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#191 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#193 def expected_line(sign, line_diff); end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#122 def file_and_line(node); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#166 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#168 def line_difference(line_node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#218 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#220 def missing_line(node, code); end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#109 @@ -35863,7 +35961,7 @@ class RuboCop::Cop::Style::EvalWithLocation < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#118 def special_line_keyword?(node); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#170 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#172 def string_first_line(str_node); end # @return [Boolean] @@ -35958,10 +36056,10 @@ class RuboCop::Cop::Style::ExactRegexpMatch < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#56 + # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#57 def exact_match_pattern?(parsed_regexp); end - # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#63 + # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#64 def new_method(node); end end @@ -36723,25 +36821,25 @@ RuboCop::Cop::Style::For::PREFER_FOR = T.let(T.unsafe(nil), String) # # @example EnforcedStyle: format (default) # # bad -# puts sprintf('%10s', 'hoge') -# puts '%10s' % 'hoge' +# puts sprintf('%10s', 'foo') +# puts '%10s' % 'foo' # # # good -# puts format('%10s', 'hoge') +# puts format('%10s', 'foo') # @example EnforcedStyle: sprintf # # bad -# puts format('%10s', 'hoge') -# puts '%10s' % 'hoge' +# puts format('%10s', 'foo') +# puts '%10s' % 'foo' # # # good -# puts sprintf('%10s', 'hoge') +# puts sprintf('%10s', 'foo') # @example EnforcedStyle: percent # # bad -# puts format('%10s', 'hoge') -# puts sprintf('%10s', 'hoge') +# puts format('%10s', 'foo') +# puts sprintf('%10s', 'foo') # # # good -# puts '%10s' % 'hoge' +# puts '%10s' % 'foo' # # source://rubocop//lib/rubocop/cop/style/format_string.rb#50 class RuboCop::Cop::Style::FormatString < ::RuboCop::Cop::Base @@ -39687,6 +39785,109 @@ end # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#43 RuboCop::Cop::Style::MapCompactWithConditionalBlock::MSG = T.let(T.unsafe(nil), String) +# Checks for usages of `each` with `<<`, `push`, or `append` which +# can be replaced by `map`. +# +# If `PreferredMethods` is configured for `map` in `Style/CollectionMethods`, +# this cop uses the specified method for replacement. +# +# NOTE: The return value of `Enumerable#each` is `self`, whereas the +# return value of `Enumerable#map` is an `Array`. They are not autocorrected +# when a return value could be used because these types differ. +# +# NOTE: It only detects when the mapping destination is a local variable +# initialized as an empty array and referred to only by the pushing operation. +# This is because, if not, it's challenging to statically guarantee that the +# mapping destination variable remains an empty array: +# +# [source,ruby] +# ---- +# ret = [] +# src.each { |e| ret << e * 2 } # `<<` method may mutate `ret` +# +# dest = [] +# src.each { |e| dest << transform(e, dest) } # `transform` method may mutate `dest` +# ---- +# +# @example +# # bad +# dest = [] +# src.each { |e| dest << e * 2 } +# dest +# +# # good +# dest = src.map { |e| e * 2 } +# +# # good - contains another operation +# dest = [] +# src.each { |e| dest << e * 2; puts e } +# dest +# +# source://rubocop//lib/rubocop/cop/style/map_into_array.rb#50 +class RuboCop::Cop::Style::MapIntoArray < ::RuboCop::Cop::Base + include ::RuboCop::Cop::RangeHelp + extend ::RuboCop::Cop::AutoCorrector + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#75 + def after_leaving_scope(scope, _variable_table); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#57 + def each_block_with_push?(param0 = T.unsafe(nil)); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#66 + def empty_array_asgn?(param0 = T.unsafe(nil)); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#69 + def lvar_ref?(param0 = T.unsafe(nil), param1); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#79 + def on_block(node); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#79 + def on_numblock(node); end + + private + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#155 + def correct_push_node(corrector, push_node); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#163 + def correct_return_value_handling(corrector, block, dest_var); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#108 + def dest_used_only_for_mapping?(block, dest_var, asgn); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#102 + def find_closest_assignment(block, dest_var); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#94 + def find_dest_var(block); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#127 + def new_method_name; end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#116 + def register_offense(block, dest_var, asgn); end + + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#148 + def remove_assignment(corrector, asgn); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#133 + def return_value_used?(node); end + + class << self + # source://rubocop//lib/rubocop/cop/style/map_into_array.rb#71 + def joining_forces; end + end +end + +# source://rubocop//lib/rubocop/cop/style/map_into_array.rb#54 +RuboCop::Cop::Style::MapIntoArray::MSG = T.let(T.unsafe(nil), String) + # Looks for uses of `map.to_h` or `collect.to_h` that could be # written with just `to_h` in Ruby >= 2.6. # @@ -42940,16 +43141,16 @@ class RuboCop::Cop::Style::NumericPredicate < ::RuboCop::Cop::Base include ::RuboCop::Cop::AllowedPattern extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#166 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#174 def comparison(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#171 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#179 def inverted_comparison(param0 = T.unsafe(nil)); end # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#90 def on_send(node); end - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#161 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#169 def predicate(param0 = T.unsafe(nil)); end private @@ -42962,23 +43163,28 @@ class RuboCop::Cop::Style::NumericPredicate < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#111 def check(node); end - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#152 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#154 def invert; end - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#132 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#162 + def negated?(node); end + + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#134 def parenthesized_source(node); end # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#124 - def replacement(numeric, operation); end + def replacement(node, numeric, operation); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#144 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#146 def replacement_supported?(operator); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#140 + # source://rubocop//lib/rubocop/cop/style/numeric_predicate.rb#142 def require_parentheses?(node); end end @@ -44297,10 +44503,20 @@ class RuboCop::Cop::Style::RedundantArgument < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#94 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#108 + def argument_matched?(target_argument, redundant_argument); end + + # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#100 def argument_range(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#87 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#120 + def exclude_cntrl_character?(target_argument, redundant_argument); end + + # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#93 def redundant_arg_for_method(method_name); end # @return [Boolean] @@ -44909,16 +45125,19 @@ class RuboCop::Cop::Style::RedundantCurrentDirectoryInPath < ::RuboCop::Cop::Bas include ::RuboCop::Cop::RangeHelp extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#23 + # source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#24 def on_send(node); end end -# source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#21 +# source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#22 RuboCop::Cop::Style::RedundantCurrentDirectoryInPath::CURRENT_DIRECTORY_PATH = T.let(T.unsafe(nil), String) # source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#20 RuboCop::Cop::Style::RedundantCurrentDirectoryInPath::MSG = T.let(T.unsafe(nil), String) +# source://rubocop//lib/rubocop/cop/style/redundant_current_directory_in_path.rb#21 +RuboCop::Cop::Style::RedundantCurrentDirectoryInPath::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) + # Checks for redundant uses of double splat hash braces. # # @example @@ -45681,12 +45900,7 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#168 - def allowed_type?(node); end - - # @return [Boolean] - # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#186 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#182 def argument_is_method?(node); end # @return [Boolean] @@ -45704,7 +45918,7 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#133 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#131 def inside_string_literal?(range, token); end # @return [Boolean] @@ -45719,7 +45933,7 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#193 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#189 def method_call_with_arguments?(node); end # A method call without parentheses such as the following cannot remove `\`: @@ -45729,7 +45943,7 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#141 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#139 def method_with_argument?(current_token, next_token); end # @return [Boolean] @@ -45744,12 +45958,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#172 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#168 def same_line?(node, line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#197 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#193 def start_with_arithmetic_operator?(source_line); end # @return [Boolean] @@ -48080,12 +48294,12 @@ RuboCop::Cop::Style::Semicolon::MSG = T.let(T.unsafe(nil), String) # # @example # # bad -# Foo.send(:bar) -# quuz.send(:fred) +# Foo.send(bar) +# quuz.send(fred) # # # good -# Foo.__send__(:bar) -# quuz.public_send(:fred) +# Foo.__send__(bar) +# quuz.public_send(fred) # # source://rubocop//lib/rubocop/cop/style/send.rb#16 class RuboCop::Cop::Style::Send < ::RuboCop::Cop::Base @@ -48711,13 +48925,30 @@ RuboCop::Cop::Style::SoleNestedConditional::MSG = T.let(T.unsafe(nil), String) # will add a require statement to the top of the file if # enabled by RequireEnglish config. # -# Like `use_perl_names` but allows builtin global vars. -# +# @example EnforcedStyle: use_english_names (default) # # good +# require 'English' # or this could be in another file. +# # puts $LOAD_PATH # puts $LOADED_FEATURES # puts $PROGRAM_NAME -# puts ARGV +# puts $ERROR_INFO +# puts $ERROR_POSITION +# puts $FIELD_SEPARATOR # or $FS +# puts $OUTPUT_FIELD_SEPARATOR # or $OFS +# puts $INPUT_RECORD_SEPARATOR # or $RS +# puts $OUTPUT_RECORD_SEPARATOR # or $ORS +# puts $INPUT_LINE_NUMBER # or $NR +# puts $LAST_READ_LINE +# puts $DEFAULT_OUTPUT +# puts $DEFAULT_INPUT +# puts $PROCESS_ID # or $PID +# puts $CHILD_STATUS +# puts $LAST_MATCH_INFO +# puts $IGNORECASE +# puts $ARGV # or ARGV +# @example EnforcedStyle: use_perl_names +# # good # puts $: # puts $" # puts $0 @@ -48736,31 +48967,14 @@ RuboCop::Cop::Style::SoleNestedConditional::MSG = T.let(T.unsafe(nil), String) # puts $~ # puts $= # puts $* +# @example EnforcedStyle: use_builtin_english_names # -# @example EnforcedStyle: use_english_names (default) # # good -# require 'English' # or this could be in another file. -# +# # Like `use_perl_names` but allows builtin global vars. # puts $LOAD_PATH # puts $LOADED_FEATURES # puts $PROGRAM_NAME -# puts $ERROR_INFO -# puts $ERROR_POSITION -# puts $FIELD_SEPARATOR # or $FS -# puts $OUTPUT_FIELD_SEPARATOR # or $OFS -# puts $INPUT_RECORD_SEPARATOR # or $RS -# puts $OUTPUT_RECORD_SEPARATOR # or $ORS -# puts $INPUT_LINE_NUMBER # or $NR -# puts $LAST_READ_LINE -# puts $DEFAULT_OUTPUT -# puts $DEFAULT_INPUT -# puts $PROCESS_ID # or $PID -# puts $CHILD_STATUS -# puts $LAST_MATCH_INFO -# puts $IGNORECASE -# puts $ARGV # or ARGV -# @example EnforcedStyle: use_perl_names -# # good +# puts ARGV # puts $: # puts $" # puts $0 @@ -48779,90 +48993,89 @@ RuboCop::Cop::Style::SoleNestedConditional::MSG = T.let(T.unsafe(nil), String) # puts $~ # puts $= # puts $* -# @example EnforcedStyle: use_builtin_english_names # -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#87 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#86 class RuboCop::Cop::Style::SpecialGlobalVars < ::RuboCop::Cop::Base include ::RuboCop::Cop::ConfigurableEnforcedStyle include ::RuboCop::Cop::RangeHelp include ::RuboCop::Cop::RequireLibrary extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#176 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#175 def autocorrect(corrector, node, global_var); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#168 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#167 def message(global_var); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#152 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#151 def on_gvar(node); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#147 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#146 def on_new_investigation; end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#247 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#246 def add_require_english?; end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#241 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#240 def english_name_replacement(preferred_name, node); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#190 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#189 def format_english_message(global_var); end # For now, we assume that lists are 2 items or less. Easy grammar! # - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#212 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#211 def format_list(items); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#198 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#197 def format_message(english, regular, global); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#235 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#234 def matching_styles(global); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#227 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#226 def preferred_names(global); end - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#216 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#215 def replacement(node, global_var); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#251 + # source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#250 def should_require_english?(global_var); end end -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#128 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#127 RuboCop::Cop::Style::SpecialGlobalVars::BUILTIN_VARS = T.let(T.unsafe(nil), Hash) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#100 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#99 RuboCop::Cop::Style::SpecialGlobalVars::ENGLISH_VARS = T.let(T.unsafe(nil), Hash) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#145 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#144 RuboCop::Cop::Style::SpecialGlobalVars::LIBRARY_NAME = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#93 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#92 RuboCop::Cop::Style::SpecialGlobalVars::MSG_BOTH = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#96 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#95 RuboCop::Cop::Style::SpecialGlobalVars::MSG_ENGLISH = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#98 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#97 RuboCop::Cop::Style::SpecialGlobalVars::MSG_REGULAR = T.let(T.unsafe(nil), String) # Anything *not* in this set is provided by the English library. # -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#122 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#121 RuboCop::Cop::Style::SpecialGlobalVars::NON_ENGLISH_VARS = T.let(T.unsafe(nil), Set) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#124 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#123 RuboCop::Cop::Style::SpecialGlobalVars::PERL_VARS = T.let(T.unsafe(nil), Hash) -# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#139 +# source://rubocop//lib/rubocop/cop/style/special_global_vars.rb#138 RuboCop::Cop::Style::SpecialGlobalVars::STYLE_VARS_MAP = T.let(T.unsafe(nil), Hash) # Check for parentheses around stabby lambda arguments. @@ -51794,22 +52007,22 @@ class RuboCop::Cop::Team # source://rubocop//lib/rubocop/cop/team.rb#121 def autocorrect(processed_source, report, original:, offset:); end - # source://rubocop//lib/rubocop/cop/team.rb#182 + # source://rubocop//lib/rubocop/cop/team.rb#185 def autocorrect_report(report, offset:, original:); end # source://rubocop//lib/rubocop/cop/team.rb#140 def be_ready; end - # source://rubocop//lib/rubocop/cop/team.rb#188 + # source://rubocop//lib/rubocop/cop/team.rb#191 def collate_corrections(report, offset:, original:); end - # source://rubocop//lib/rubocop/cop/team.rb#204 + # source://rubocop//lib/rubocop/cop/team.rb#207 def each_corrector(report); end - # source://rubocop//lib/rubocop/cop/team.rb#254 + # source://rubocop//lib/rubocop/cop/team.rb#257 def handle_error(error, location, cop); end - # source://rubocop//lib/rubocop/cop/team.rb#246 + # source://rubocop//lib/rubocop/cop/team.rb#249 def handle_warning(error, location); end # @return [Commissioner::InvestigationReport] @@ -51817,7 +52030,7 @@ class RuboCop::Cop::Team # source://rubocop//lib/rubocop/cop/team.rb#154 def investigate_partial(cops, processed_source, offset:, original:); end - # source://rubocop//lib/rubocop/cop/team.rb#231 + # source://rubocop//lib/rubocop/cop/team.rb#234 def process_errors(file, errors); end # source://rubocop//lib/rubocop/cop/team.rb#148 @@ -51838,10 +52051,10 @@ class RuboCop::Cop::Team # source://rubocop//lib/rubocop/cop/team.rb#170 def support_target_ruby_version?(cop); end - # source://rubocop//lib/rubocop/cop/team.rb#219 + # source://rubocop//lib/rubocop/cop/team.rb#222 def suppress_clobbering; end - # source://rubocop//lib/rubocop/cop/team.rb#225 + # source://rubocop//lib/rubocop/cop/team.rb#228 def validate_config; end class << self @@ -54358,10 +54571,10 @@ class RuboCop::Formatter::ClangStyleFormatter < ::RuboCop::Formatter::SimpleText private - # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#51 + # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#47 def report_highlighted_area(highlighted_area); end - # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#41 + # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#37 def report_line(location); end # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#17 @@ -54369,7 +54582,7 @@ class RuboCop::Formatter::ClangStyleFormatter < ::RuboCop::Formatter::SimpleText # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#37 + # source://rubocop//lib/rubocop/formatter/clang_style_formatter.rb#33 def valid_line?(offense); end end @@ -55312,10 +55525,10 @@ class RuboCop::Formatter::TapFormatter < ::RuboCop::Formatter::ClangStyleFormatt private - # source://rubocop//lib/rubocop/formatter/tap_formatter.rb#66 + # source://rubocop//lib/rubocop/formatter/tap_formatter.rb#62 def annotate_message(msg); end - # source://rubocop//lib/rubocop/formatter/tap_formatter.rb#70 + # source://rubocop//lib/rubocop/formatter/tap_formatter.rb#66 def message(offense); end # source://rubocop//lib/rubocop/formatter/tap_formatter.rb#39 @@ -55472,47 +55685,47 @@ class RuboCop::LSP::Routes # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#170 + # source://rubocop//lib/rubocop/lsp/routes.rb#169 def handle_method_missing(request); end - # source://rubocop//lib/rubocop/lsp/routes.rb#67 + # source://rubocop//lib/rubocop/lsp/routes.rb#68 def handle_shutdown(request); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#159 + # source://rubocop//lib/rubocop/lsp/routes.rb#158 def handle_unsupported_method(request, method = T.unsafe(nil)); end private # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#208 + # source://rubocop//lib/rubocop/lsp/routes.rb#207 def diagnostic(file_uri, text); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#178 + # source://rubocop//lib/rubocop/lsp/routes.rb#177 def extract_initialization_options_from(request); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#188 + # source://rubocop//lib/rubocop/lsp/routes.rb#187 def format_file(file_uri, command: T.unsafe(nil)); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#222 + # source://rubocop//lib/rubocop/lsp/routes.rb#221 def remove_file_protocol_from(uri); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#226 + # source://rubocop//lib/rubocop/lsp/routes.rb#225 def to_diagnostic(offense); end # @api private # - # source://rubocop//lib/rubocop/lsp/routes.rb#238 + # source://rubocop//lib/rubocop/lsp/routes.rb#237 def to_range(location); end class << self @@ -55606,32 +55819,32 @@ class RuboCop::LSP::Server # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#59 + # source://rubocop//lib/rubocop/lsp/server.rb#61 def configure(options); end # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#51 + # source://rubocop//lib/rubocop/lsp/server.rb#53 def format(path, text, command:); end # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#55 + # source://rubocop//lib/rubocop/lsp/server.rb#57 def offenses(path, text); end # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#32 + # source://rubocop//lib/rubocop/lsp/server.rb#34 def start; end # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#65 + # source://rubocop//lib/rubocop/lsp/server.rb#67 def stop(&block); end # @api private # - # source://rubocop//lib/rubocop/lsp/server.rb#47 + # source://rubocop//lib/rubocop/lsp/server.rb#49 def write(response); end end @@ -55659,33 +55872,61 @@ RuboCop::LSP::Severity::SEVERITIES = T.let(T.unsafe(nil), Hash) # # @api private # -# source://rubocop//lib/rubocop/lockfile.rb#7 +# source://rubocop//lib/rubocop/lockfile.rb#15 class RuboCop::Lockfile - # Gems that the bundle depends on + # @api private + # @param lockfile_path [String, Pathname, nil] + # @return [Lockfile] a new instance of Lockfile + # + # source://rubocop//lib/rubocop/lockfile.rb#17 + def initialize(lockfile_path = T.unsafe(nil)); end + + # Gems that the bundle directly depends on. # # @api private + # @return [Array, nil] # - # source://rubocop//lib/rubocop/lockfile.rb#9 + # source://rubocop//lib/rubocop/lockfile.rb#29 def dependencies; end - # All activated gems, including transitive dependencies + # Returns the locked versions of gems from this lockfile. # # @api private + # @param include_transitive_dependencies: [Boolean] When false, only direct dependencies + # are returned, i.e. those listed explicitly in the `Gemfile`. + # + # source://rubocop//lib/rubocop/lockfile.rb#49 + def gem_versions(include_transitive_dependencies: T.unsafe(nil)); end + + # All activated gems, including transitive dependencies. # - # source://rubocop//lib/rubocop/lockfile.rb#16 + # @api private + # @return [Array, nil] + # + # source://rubocop//lib/rubocop/lockfile.rb#37 def gems; end + # Whether this lockfile includes the named gem, directly or indirectly. + # # @api private + # @param name [String] # @return [Boolean] # - # source://rubocop//lib/rubocop/lockfile.rb#24 + # source://rubocop//lib/rubocop/lockfile.rb#65 def includes_gem?(name); end private # @api private + # @return [Boolean] + # + # source://rubocop//lib/rubocop/lockfile.rb#85 + def bundler_lock_parser_defined?; end + + # @api private + # @return [Bundler::LockfileParser, nil] # - # source://rubocop//lib/rubocop/lockfile.rb#30 + # source://rubocop//lib/rubocop/lockfile.rb#72 def parser; end end @@ -56709,145 +56950,145 @@ RuboCop::ResultCache::NON_CHANGING = T.let(T.unsafe(nil), Array) class RuboCop::Runner # @return [Runner] a new instance of Runner # - # source://rubocop//lib/rubocop/runner.rb#59 + # source://rubocop//lib/rubocop/runner.rb#63 def initialize(options, config_store); end # Sets the attribute aborting # # @param value the value to set the attribute aborting to. # - # source://rubocop//lib/rubocop/runner.rb#57 + # source://rubocop//lib/rubocop/runner.rb#61 def aborting=(_arg0); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#83 + # source://rubocop//lib/rubocop/runner.rb#87 def aborting?; end # Returns the value of attribute errors. # - # source://rubocop//lib/rubocop/runner.rb#56 + # source://rubocop//lib/rubocop/runner.rb#60 def errors; end - # source://rubocop//lib/rubocop/runner.rb#67 + # source://rubocop//lib/rubocop/runner.rb#71 def run(paths); end # Returns the value of attribute warnings. # - # source://rubocop//lib/rubocop/runner.rb#56 + # source://rubocop//lib/rubocop/runner.rb#60 def warnings; end private - # source://rubocop//lib/rubocop/runner.rb#196 + # source://rubocop//lib/rubocop/runner.rb#200 def add_redundant_disables(file, offenses, source); end - # source://rubocop//lib/rubocop/runner.rb#170 + # source://rubocop//lib/rubocop/runner.rb#174 def cached_result(file, team); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#250 + # source://rubocop//lib/rubocop/runner.rb#254 def cached_run?; end # Check whether a run created source identical to a previous run, which # means that we definitely have an infinite loop. # - # source://rubocop//lib/rubocop/runner.rb#328 + # source://rubocop//lib/rubocop/runner.rb#332 def check_for_infinite_loop(processed_source, offenses_by_iteration); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#222 + # source://rubocop//lib/rubocop/runner.rb#226 def check_for_redundant_disables?(source); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#423 + # source://rubocop//lib/rubocop/runner.rb#427 def considered_failure?(offense); end - # source://rubocop//lib/rubocop/runner.rb#456 + # source://rubocop//lib/rubocop/runner.rb#460 def default_config(cop_name); end - # source://rubocop//lib/rubocop/runner.rb#272 + # source://rubocop//lib/rubocop/runner.rb#276 def do_inspection_loop(file); end - # source://rubocop//lib/rubocop/runner.rb#133 + # source://rubocop//lib/rubocop/runner.rb#137 def each_inspected_file(files); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#236 + # source://rubocop//lib/rubocop/runner.rb#240 def except_redundant_cop_disable_directive?; end - # source://rubocop//lib/rubocop/runner.rb#357 + # source://rubocop//lib/rubocop/runner.rb#361 def extract_ruby_sources(processed_source); end - # source://rubocop//lib/rubocop/runner.rb#245 + # source://rubocop//lib/rubocop/runner.rb#249 def file_finished(file, offenses); end - # source://rubocop//lib/rubocop/runner.rb#174 + # source://rubocop//lib/rubocop/runner.rb#178 def file_offense_cache(file); end - # source://rubocop//lib/rubocop/runner.rb#162 + # source://rubocop//lib/rubocop/runner.rb#166 def file_offenses(file); end - # source://rubocop//lib/rubocop/runner.rb#240 + # source://rubocop//lib/rubocop/runner.rb#244 def file_started(file); end - # source://rubocop//lib/rubocop/runner.rb#403 + # source://rubocop//lib/rubocop/runner.rb#407 def filter_cop_classes(cop_classes, config); end - # source://rubocop//lib/rubocop/runner.rb#104 + # source://rubocop//lib/rubocop/runner.rb#108 def find_target_files(paths); end - # source://rubocop//lib/rubocop/runner.rb#414 + # source://rubocop//lib/rubocop/runner.rb#418 def formatter_set; end - # source://rubocop//lib/rubocop/runner.rb#471 + # source://rubocop//lib/rubocop/runner.rb#475 def get_processed_source(file); end - # source://rubocop//lib/rubocop/runner.rb#342 + # source://rubocop//lib/rubocop/runner.rb#346 def inspect_file(processed_source, team = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/runner.rb#115 + # source://rubocop//lib/rubocop/runner.rb#119 def inspect_files(files); end - # source://rubocop//lib/rubocop/runner.rb#303 + # source://rubocop//lib/rubocop/runner.rb#307 def iterate_until_no_changes(source, offenses_by_iteration); end - # source://rubocop//lib/rubocop/runner.rb#148 + # source://rubocop//lib/rubocop/runner.rb#152 def list_files(paths); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#452 + # source://rubocop//lib/rubocop/runner.rb#456 def mark_as_safe_by_config?(config); end - # source://rubocop//lib/rubocop/runner.rb#460 + # source://rubocop//lib/rubocop/runner.rb#464 def minimum_severity_to_fail; end - # source://rubocop//lib/rubocop/runner.rb#364 + # source://rubocop//lib/rubocop/runner.rb#368 def mobilize_team(processed_source); end - # source://rubocop//lib/rubocop/runner.rb#369 + # source://rubocop//lib/rubocop/runner.rb#373 def mobilized_cop_classes(config); end - # source://rubocop//lib/rubocop/runner.rb#432 + # source://rubocop//lib/rubocop/runner.rb#436 def offenses_to_report(offenses); end - # source://rubocop//lib/rubocop/runner.rb#152 + # source://rubocop//lib/rubocop/runner.rb#156 def process_file(file); end - # source://rubocop//lib/rubocop/runner.rb#393 + # source://rubocop//lib/rubocop/runner.rb#397 def qualify_option_cop_names; end # @yield [cop] # - # source://rubocop//lib/rubocop/runner.rb#228 + # source://rubocop//lib/rubocop/runner.rb#232 def redundant_cop_disable_directive(file); end - # source://rubocop//lib/rubocop/runner.rb#262 + # source://rubocop//lib/rubocop/runner.rb#266 def save_in_cache(cache, offenses); end # A Cop::Team instance is stateful and may change when inspecting. @@ -56855,41 +57096,41 @@ class RuboCop::Runner # otherwise dormant team that can be used for config- and option- # level caching in ResultCache. # - # source://rubocop//lib/rubocop/runner.rb#499 + # source://rubocop//lib/rubocop/runner.rb#503 def standby_team(config); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#410 + # source://rubocop//lib/rubocop/runner.rb#414 def style_guide_cops_only?(config); end # @return [Boolean] # - # source://rubocop//lib/rubocop/runner.rb#444 + # source://rubocop//lib/rubocop/runner.rb#448 def supports_safe_autocorrect?(offense); end # @yield [team] # - # source://rubocop//lib/rubocop/runner.rb#211 + # source://rubocop//lib/rubocop/runner.rb#215 def team_for_redundant_disables(file, offenses, source); end # Warms up the RuboCop cache by forking a suitable number of RuboCop # instances that each inspects its allotted group of files. # - # source://rubocop//lib/rubocop/runner.rb#91 + # source://rubocop//lib/rubocop/runner.rb#95 def warm_cache(target_files); end class << self # @return [Array<#call>] # - # source://rubocop//lib/rubocop/runner.rb#29 + # source://rubocop//lib/rubocop/runner.rb#33 def ruby_extractors; end private # @return [#call] # - # source://rubocop//lib/rubocop/runner.rb#36 + # source://rubocop//lib/rubocop/runner.rb#40 def default_ruby_extractor; end end end @@ -56912,12 +57153,12 @@ end # @api private # -# source://rubocop//lib/rubocop/runner.rb#49 +# source://rubocop//lib/rubocop/runner.rb#53 RuboCop::Runner::MAX_ITERATIONS = T.let(T.unsafe(nil), Integer) # @api private # -# source://rubocop//lib/rubocop/runner.rb#52 +# source://rubocop//lib/rubocop/runner.rb#56 RuboCop::Runner::REDUNDANT_COP_DISABLE_DIRECTIVE_RULES = T.let(T.unsafe(nil), Array) # Take a string with embedded escapes, and convert the escapes as the Ruby diff --git a/sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi b/sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi index fe14ff9..f832ab1 100644 --- a/sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi +++ b/sorbet/rbi/gems/ruby-progressbar@1.13.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `ruby-progressbar` gem. # Please instead update this file by running `bin/tapioca gem ruby-progressbar`. + # source://ruby-progressbar//lib/ruby-progressbar/components/bar.rb#4 class ProgressBar class << self diff --git a/sorbet/rbi/gems/sorbet-result@1.1.0.rbi b/sorbet/rbi/gems/sorbet-result@1.1.0.rbi index dd8ac00..e3e6ef9 100644 --- a/sorbet/rbi/gems/sorbet-result@1.1.0.rbi +++ b/sorbet/rbi/gems/sorbet-result@1.1.0.rbi @@ -4,104 +4,105 @@ # This is an autogenerated file for types exported from the `sorbet-result` gem. # Please instead update this file by running `bin/tapioca gem sorbet-result`. + # source://sorbet-result//lib/minitest/result_assertions.rb#6 module Minitest class << self - # source://minitest/5.22.3/lib/minitest.rb#197 + # source://minitest/5.23.1/lib/minitest.rb#197 def __run(reporter, options); end - # source://minitest/5.22.3/lib/minitest.rb#97 + # source://minitest/5.23.1/lib/minitest.rb#97 def after_run(&block); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def allow_fork; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def allow_fork=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#69 + # source://minitest/5.23.1/lib/minitest.rb#69 def autorun; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def backtrace_filter; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def backtrace_filter=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#18 + # source://minitest/5.23.1/lib/minitest.rb#18 def cattr_accessor(name); end - # source://minitest/5.22.3/lib/minitest.rb#1146 + # source://minitest/5.23.1/lib/minitest.rb#1178 def clock_time; end - # source://minitest/5.22.3/lib/minitest.rb#177 + # source://minitest/5.23.1/lib/minitest.rb#177 def empty_run!(options); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def extensions; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def extensions=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#292 + # source://minitest/5.23.1/lib/minitest.rb#306 def filter_backtrace(bt); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def info_signal; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def info_signal=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#101 + # source://minitest/5.23.1/lib/minitest.rb#101 def init_plugins(options); end - # source://minitest/5.22.3/lib/minitest.rb#108 + # source://minitest/5.23.1/lib/minitest.rb#108 def load_plugins; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def parallel_executor; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def parallel_executor=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#210 + # source://minitest/5.23.1/lib/minitest.rb#210 def process_args(args = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def reporter; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def reporter=(_arg0); end - # source://minitest/5.22.3/lib/minitest.rb#143 + # source://minitest/5.23.1/lib/minitest.rb#143 def run(args = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest.rb#1137 + # source://minitest/5.23.1/lib/minitest.rb#1169 def run_one_method(klass, method_name); end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def seed; end - # source://minitest/5.22.3/lib/minitest.rb#19 + # source://minitest/5.23.1/lib/minitest.rb#19 def seed=(_arg0); end end end # source://sorbet-result//lib/minitest/result_assertions.rb#7 module Minitest::Assertions - # source://minitest/5.22.3/lib/minitest/assertions.rb#188 + # source://minitest/5.23.1/lib/minitest/assertions.rb#188 def _synchronize; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#201 + # source://minitest/5.23.1/lib/minitest/assertions.rb#201 def _where; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#178 + # source://minitest/5.23.1/lib/minitest/assertions.rb#178 def assert(test, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#195 + # source://minitest/5.23.1/lib/minitest/assertions.rb#195 def assert_empty(obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#221 + # source://minitest/5.23.1/lib/minitest/assertions.rb#221 def assert_equal(exp, act, msg = T.unsafe(nil)); end # Fails unless exp is equal to error @@ -114,40 +115,40 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#14 def assert_failure(result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#242 + # source://minitest/5.23.1/lib/minitest/assertions.rb#242 def assert_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#254 + # source://minitest/5.23.1/lib/minitest/assertions.rb#254 def assert_in_epsilon(exp, act, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#261 + # source://minitest/5.23.1/lib/minitest/assertions.rb#261 def assert_includes(collection, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#272 + # source://minitest/5.23.1/lib/minitest/assertions.rb#272 def assert_instance_of(cls, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#283 + # source://minitest/5.23.1/lib/minitest/assertions.rb#283 def assert_kind_of(cls, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#293 + # source://minitest/5.23.1/lib/minitest/assertions.rb#293 def assert_match(matcher, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/mock.rb#250 + # source://minitest/5.23.1/lib/minitest/mock.rb#250 def assert_mock(mock); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#305 + # source://minitest/5.23.1/lib/minitest/assertions.rb#305 def assert_nil(obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#315 + # source://minitest/5.23.1/lib/minitest/assertions.rb#315 def assert_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#333 + # source://minitest/5.23.1/lib/minitest/assertions.rb#333 def assert_output(stdout = T.unsafe(nil), stderr = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#357 + # source://minitest/5.23.1/lib/minitest/assertions.rb#357 def assert_path_exists(path, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#376 + # source://minitest/5.23.1/lib/minitest/assertions.rb#376 def assert_pattern; end # Fails unless exp is equal to payload @@ -155,22 +156,22 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#19 def assert_payload(exp, result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#397 + # source://minitest/5.23.1/lib/minitest/assertions.rb#397 def assert_predicate(o1, op, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#424 + # source://minitest/5.23.1/lib/minitest/assertions.rb#424 def assert_raises(*exp); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#456 + # source://minitest/5.23.1/lib/minitest/assertions.rb#456 def assert_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#466 + # source://minitest/5.23.1/lib/minitest/assertions.rb#466 def assert_same(exp, act, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#479 + # source://minitest/5.23.1/lib/minitest/assertions.rb#479 def assert_send(send_ary, m = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#493 + # source://minitest/5.23.1/lib/minitest/assertions.rb#493 def assert_silent; end # Fails unless Result is a Success @@ -178,46 +179,46 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#9 def assert_success(result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#502 + # source://minitest/5.23.1/lib/minitest/assertions.rb#502 def assert_throws(sym, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#543 + # source://minitest/5.23.1/lib/minitest/assertions.rb#543 def capture_io; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#576 + # source://minitest/5.23.1/lib/minitest/assertions.rb#576 def capture_subprocess_io; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#59 + # source://minitest/5.23.1/lib/minitest/assertions.rb#59 def diff(exp, act); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#608 + # source://minitest/5.23.1/lib/minitest/assertions.rb#608 def exception_details(e, msg); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#624 + # source://minitest/5.23.1/lib/minitest/assertions.rb#624 def fail_after(y, m, d, msg); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#631 + # source://minitest/5.23.1/lib/minitest/assertions.rb#631 def flunk(msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#639 + # source://minitest/5.23.1/lib/minitest/assertions.rb#639 def message(msg = T.unsafe(nil), ending = T.unsafe(nil), &default); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#129 + # source://minitest/5.23.1/lib/minitest/assertions.rb#129 def mu_pp(obj); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#152 + # source://minitest/5.23.1/lib/minitest/assertions.rb#152 def mu_pp_for_diff(obj); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#650 + # source://minitest/5.23.1/lib/minitest/assertions.rb#650 def pass(_msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#657 + # source://minitest/5.23.1/lib/minitest/assertions.rb#657 def refute(test, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#665 + # source://minitest/5.23.1/lib/minitest/assertions.rb#665 def refute_empty(obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#676 + # source://minitest/5.23.1/lib/minitest/assertions.rb#676 def refute_equal(exp, act, msg = T.unsafe(nil)); end # Fails if exp is equal to error @@ -230,34 +231,34 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#34 def refute_failure(result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#688 + # source://minitest/5.23.1/lib/minitest/assertions.rb#688 def refute_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#700 + # source://minitest/5.23.1/lib/minitest/assertions.rb#700 def refute_in_epsilon(a, b, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#707 + # source://minitest/5.23.1/lib/minitest/assertions.rb#707 def refute_includes(collection, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#718 + # source://minitest/5.23.1/lib/minitest/assertions.rb#718 def refute_instance_of(cls, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#728 + # source://minitest/5.23.1/lib/minitest/assertions.rb#728 def refute_kind_of(cls, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#736 + # source://minitest/5.23.1/lib/minitest/assertions.rb#736 def refute_match(matcher, obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#746 + # source://minitest/5.23.1/lib/minitest/assertions.rb#746 def refute_nil(obj, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#781 + # source://minitest/5.23.1/lib/minitest/assertions.rb#781 def refute_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#790 + # source://minitest/5.23.1/lib/minitest/assertions.rb#790 def refute_path_exists(path, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#763 + # source://minitest/5.23.1/lib/minitest/assertions.rb#763 def refute_pattern; end # Fails if exp is equal to payload @@ -265,13 +266,13 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#39 def refute_payload(exp, result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#804 + # source://minitest/5.23.1/lib/minitest/assertions.rb#804 def refute_predicate(o1, op, msg = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#813 + # source://minitest/5.23.1/lib/minitest/assertions.rb#813 def refute_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#822 + # source://minitest/5.23.1/lib/minitest/assertions.rb#822 def refute_same(exp, act, msg = T.unsafe(nil)); end # Fails if Result is a Success @@ -279,23 +280,23 @@ module Minitest::Assertions # source://sorbet-result//lib/minitest/result_assertions.rb#29 def refute_success(result); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#835 + # source://minitest/5.23.1/lib/minitest/assertions.rb#835 def skip(msg = T.unsafe(nil), _ignored = T.unsafe(nil)); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#847 + # source://minitest/5.23.1/lib/minitest/assertions.rb#847 def skip_until(y, m, d, msg); end - # source://minitest/5.22.3/lib/minitest/assertions.rb#856 + # source://minitest/5.23.1/lib/minitest/assertions.rb#856 def skipped?; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#104 + # source://minitest/5.23.1/lib/minitest/assertions.rb#104 def things_to_diff(exp, act); end class << self - # source://minitest/5.22.3/lib/minitest/assertions.rb#29 + # source://minitest/5.23.1/lib/minitest/assertions.rb#29 def diff; end - # source://minitest/5.22.3/lib/minitest/assertions.rb#47 + # source://minitest/5.23.1/lib/minitest/assertions.rb#47 def diff=(o); end end end diff --git a/sorbet/rbi/gems/sorbet-struct-comparable@1.3.0.rbi b/sorbet/rbi/gems/sorbet-struct-comparable@1.3.0.rbi index fdb8d50..02910c8 100644 --- a/sorbet/rbi/gems/sorbet-struct-comparable@1.3.0.rbi +++ b/sorbet/rbi/gems/sorbet-struct-comparable@1.3.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `sorbet-struct-comparable` gem. # Please instead update this file by running `bin/tapioca gem sorbet-struct-comparable`. + # source://sorbet-struct-comparable//lib/sorbet-struct-comparable/version.rb#4 module SorbetStructComparable; end diff --git a/sorbet/rbi/gems/spoom@1.3.0.rbi b/sorbet/rbi/gems/spoom@1.3.2.rbi similarity index 99% rename from sorbet/rbi/gems/spoom@1.3.0.rbi rename to sorbet/rbi/gems/spoom@1.3.2.rbi index 8d69b4c..9ea7bf5 100644 --- a/sorbet/rbi/gems/spoom@1.3.0.rbi +++ b/sorbet/rbi/gems/spoom@1.3.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `spoom` gem. # Please instead update this file by running `bin/tapioca gem spoom`. + # source://spoom//lib/spoom.rb#7 module Spoom; end @@ -997,7 +998,7 @@ class Spoom::Coverage::D3::ColorPalette < ::T::Struct prop :strong, ::String class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -1337,7 +1338,7 @@ class Spoom::Coverage::Snapshot < ::T::Struct sig { params(obj: T::Hash[::String, T.untyped]).returns(::Spoom::Coverage::Snapshot) } def from_obj(obj); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -1511,7 +1512,7 @@ class Spoom::Deadcode::Definition < ::T::Struct def to_json(*args); end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -2405,7 +2406,7 @@ class Spoom::Deadcode::Reference < ::T::Struct def method?; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -2523,8 +2524,8 @@ end # source://spoom//lib/spoom/deadcode/remover.rb#549 class Spoom::Deadcode::Remover::NodeFinder < ::Spoom::Deadcode::Visitor # source://spoom//lib/spoom/deadcode/remover.rb#621 - sig { params(location: ::Spoom::Deadcode::Location).void } - def initialize(location); end + sig { params(location: ::Spoom::Deadcode::Location, kind: T.nilable(::Spoom::Deadcode::Definition::Kind)).void } + def initialize(location, kind); end # source://spoom//lib/spoom/deadcode/remover.rb#615 sig { returns(T.nilable(::Prism::Node)) } @@ -2534,7 +2535,7 @@ class Spoom::Deadcode::Remover::NodeFinder < ::Spoom::Deadcode::Visitor sig { returns(T::Array[::Prism::Node]) } def nodes_nesting; end - # source://spoom//lib/spoom/deadcode/remover.rb#629 + # source://spoom//lib/spoom/deadcode/remover.rb#630 sig { override.params(node: T.nilable(::Prism::Node)).void } def visit(node); end @@ -2647,7 +2648,7 @@ class Spoom::Deadcode::Send < ::T::Struct def each_arg_assoc(&block); end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3266,7 +3267,7 @@ class Spoom::ExecResult < ::T::Struct def to_s; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3464,7 +3465,7 @@ class Spoom::FileTree::Node < ::T::Struct def path; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3530,7 +3531,7 @@ class Spoom::Git::Commit < ::T::Struct def timestamp; end class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end # Parse a line formatted as `%h %at` into a `Commit` @@ -3642,7 +3643,7 @@ class Spoom::LSP::Diagnostic < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Diagnostic) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3675,7 +3676,7 @@ class Spoom::LSP::DocumentSymbol < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::DocumentSymbol) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3733,7 +3734,7 @@ class Spoom::LSP::Hover < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Hover) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3758,7 +3759,7 @@ class Spoom::LSP::Location < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Location) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3821,7 +3822,7 @@ class Spoom::LSP::Position < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Position) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3859,7 +3860,7 @@ class Spoom::LSP::Range < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Range) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -3925,7 +3926,7 @@ class Spoom::LSP::SignatureHelp < ::T::Struct sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::SignatureHelp) } def from_json(json); end - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end diff --git a/sorbet/rbi/gems/standard-custom@1.0.2.rbi b/sorbet/rbi/gems/standard-custom@1.0.2.rbi index bf1213b..92187ab 100644 --- a/sorbet/rbi/gems/standard-custom@1.0.2.rbi +++ b/sorbet/rbi/gems/standard-custom@1.0.2.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `standard-custom` gem. # Please instead update this file by running `bin/tapioca gem standard-custom`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/standard-performance@1.3.1.rbi b/sorbet/rbi/gems/standard-performance@1.4.0.rbi similarity index 99% rename from sorbet/rbi/gems/standard-performance@1.3.1.rbi rename to sorbet/rbi/gems/standard-performance@1.4.0.rbi index b94959d..792c197 100644 --- a/sorbet/rbi/gems/standard-performance@1.3.1.rbi +++ b/sorbet/rbi/gems/standard-performance@1.4.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `standard-performance` gem. # Please instead update this file by running `bin/tapioca gem standard-performance`. + # source://standard-performance//lib/standard/performance/version.rb#1 module Standard; end diff --git a/sorbet/rbi/gems/standard-sorbet@0.0.2.rbi b/sorbet/rbi/gems/standard-sorbet@0.0.2.rbi index 7e48b70..9898ded 100644 --- a/sorbet/rbi/gems/standard-sorbet@0.0.2.rbi +++ b/sorbet/rbi/gems/standard-sorbet@0.0.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `standard-sorbet` gem. # Please instead update this file by running `bin/tapioca gem standard-sorbet`. + # source://standard-sorbet//lib/standard/sorbet/version.rb#1 module Standard; end diff --git a/sorbet/rbi/gems/standard@1.35.1.rbi b/sorbet/rbi/gems/standard@1.36.0.rbi similarity index 87% rename from sorbet/rbi/gems/standard@1.35.1.rbi rename to sorbet/rbi/gems/standard@1.36.0.rbi index f543fef..31ffbc1 100644 --- a/sorbet/rbi/gems/standard@1.35.1.rbi +++ b/sorbet/rbi/gems/standard@1.36.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `standard` gem. # Please instead update this file by running `bin/tapioca gem standard`. + # source://standard//lib/standard/rubocop/ext.rb#1 module RuboCop; end @@ -14,25 +15,25 @@ class RuboCop::CommentConfig # source://standard//lib/standard/rubocop/ext.rb#20 def initialize(processed_source); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#63 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#63 def comment_only_line?(line_number); end # source://forwardable/1.3.3/forwardable.rb#231 def config(*args, **_arg1, &block); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#51 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#51 def cop_disabled_line_ranges; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#39 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#39 def cop_enabled_at_line?(cop, line_number); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#47 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#47 def cop_opted_in?(cop); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#55 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#55 def extra_enabled_comments; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#30 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#30 def processed_source; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -40,49 +41,49 @@ class RuboCop::CommentConfig private - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#96 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#96 def analyze; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#124 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#124 def analyze_cop(analysis, directive); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#144 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#144 def analyze_disabled(analysis, directive); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#155 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#155 def analyze_rest(analysis, directive); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#135 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#135 def analyze_single_line(analysis, directive); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#164 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#164 def cop_line_ranges(analysis); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#170 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#170 def each_directive; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#69 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#69 def extra_enabled_comments_with_names(extras:, names:); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#190 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#190 def handle_enable_all(directive, names, extras); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#204 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#204 def handle_switch(directive, names, extras); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#115 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#115 def inject_disabled_cops_directives(analyses); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#183 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#183 def non_comment_token_line_numbers; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#34 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#34 def old_initialize(processed_source); end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#83 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#83 def opt_in_cops; end - # source://rubocop/1.62.1/lib/rubocop/comment_config.rb#179 + # source://rubocop/1.63.5/lib/rubocop/comment_config.rb#179 def qualified_cop_name(cop_name); end end @@ -94,114 +95,114 @@ class RuboCop::Cop::Lint::AssignmentInCondition < ::RuboCop::Cop::Base # source://standard//lib/standard/rubocop/ext.rb#4 def message(_); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_if(node); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_until(node); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_while(node); end private - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#82 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#82 def allowed_construct?(asgn_node); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#86 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#86 def conditional_assignment?(asgn_node); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#90 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#90 def skip_children?(asgn_node); end - # source://rubocop/1.62.1/lib/rubocop/cop/lint/assignment_in_condition.rb#96 + # source://rubocop/1.63.5/lib/rubocop/cop/lint/assignment_in_condition.rb#96 def traverse_node(node, &block); end end # source://standard//lib/standard/rubocop/ext.rb#9 class RuboCop::DirectiveComment - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#32 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#32 def initialize(comment, cop_registry = T.unsafe(nil)); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#82 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#82 def all_cops?; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#30 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#30 def comment; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#87 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#87 def cop_names; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#30 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#30 def cop_registry; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#30 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#30 def cops; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#93 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#93 def department_names; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#107 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#107 def directive_count; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#62 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#62 def disabled?; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#77 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#77 def disabled_all?; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#67 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#67 def enabled?; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#72 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#72 def enabled_all?; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#98 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#98 def in_directive_department?(cop); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#112 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#112 def line_number; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#44 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#44 def match?(cop_names); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#57 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#57 def match_captures; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#30 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#30 def mode; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#103 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#103 def overridden_by_department?(cop); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#48 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#48 def range; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#39 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#39 def single_line?; end private - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#133 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#133 def all_cop_names; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#137 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#137 def cop_names_for_department(department); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#129 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#129 def department?(name); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#142 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#142 def exclude_lint_department_cops(cops); end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#122 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#122 def parsed_cop_names; end - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#118 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#118 def splitted_cops_string; end class << self - # source://rubocop/1.62.1/lib/rubocop/directive_comment.rb#26 + # source://rubocop/1.63.5/lib/rubocop/directive_comment.rb#26 def before_comment(line); end end end @@ -502,24 +503,24 @@ class Standard::Lsp::Routes # source://standard//lib/standard/lsp/routes.rb#42 def handle_initialized(request); end - # source://standard//lib/standard/lsp/routes.rb#132 + # source://standard//lib/standard/lsp/routes.rb#130 def handle_method_missing(request); end # source://standard//lib/standard/lsp/routes.rb#46 def handle_shutdown(request); end - # source://standard//lib/standard/lsp/routes.rb#124 + # source://standard//lib/standard/lsp/routes.rb#122 def handle_unsupported_method(request, method = T.unsafe(nil)); end private - # source://standard//lib/standard/lsp/routes.rb#165 + # source://standard//lib/standard/lsp/routes.rb#163 def diagnostic(file_uri, text); end - # source://standard//lib/standard/lsp/routes.rb#144 + # source://standard//lib/standard/lsp/routes.rb#142 def format_file(file_uri); end - # source://standard//lib/standard/lsp/routes.rb#140 + # source://standard//lib/standard/lsp/routes.rb#138 def uri_to_path(uri); end class << self diff --git a/sorbet/rbi/gems/stringio@3.1.0.rbi b/sorbet/rbi/gems/stringio@3.1.0.rbi index 01a26ea..0b17e91 100644 --- a/sorbet/rbi/gems/stringio@3.1.0.rbi +++ b/sorbet/rbi/gems/stringio@3.1.0.rbi @@ -4,5 +4,6 @@ # This is an autogenerated file for types exported from the `stringio` gem. # Please instead update this file by running `bin/tapioca gem stringio`. + # THIS IS AN EMPTY RBI FILE. # see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/strscan@3.1.0.rbi b/sorbet/rbi/gems/strscan@3.1.0.rbi new file mode 100644 index 0000000..1f754d9 --- /dev/null +++ b/sorbet/rbi/gems/strscan@3.1.0.rbi @@ -0,0 +1,9 @@ +# typed: true + +# DO NOT EDIT MANUALLY +# This is an autogenerated file for types exported from the `strscan` gem. +# Please instead update this file by running `bin/tapioca gem strscan`. + + +# THIS IS AN EMPTY RBI FILE. +# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem diff --git a/sorbet/rbi/gems/tapioca@0.13.3.rbi b/sorbet/rbi/gems/tapioca@0.14.2.rbi similarity index 95% rename from sorbet/rbi/gems/tapioca@0.13.3.rbi rename to sorbet/rbi/gems/tapioca@0.14.2.rbi index 9e04fec..d6a6b69 100644 --- a/sorbet/rbi/gems/tapioca@0.13.3.rbi +++ b/sorbet/rbi/gems/tapioca@0.14.2.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `tapioca` gem. # Please instead update this file by running `bin/tapioca gem tapioca`. + class Bundler::Dependency < ::Gem::Dependency include ::Tapioca::BundlerExt::AutoRequireHook end @@ -54,7 +55,7 @@ module RBI; end # source://tapioca//lib/tapioca/rbi_ext/model.rb#5 class RBI::Tree < ::RBI::NodeWithComments - # source://rbi/0.1.10/lib/rbi/model.rb#119 + # source://rbi/0.1.13/lib/rbi/model.rb#119 sig do params( loc: T.nilable(::RBI::Loc), @@ -64,19 +65,19 @@ class RBI::Tree < ::RBI::NodeWithComments end def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end - # source://rbi/0.1.10/lib/rbi/model.rb#126 + # source://rbi/0.1.13/lib/rbi/model.rb#126 sig { params(node: ::RBI::Node).void } def <<(node); end - # source://rbi/0.1.10/lib/rbi/printer.rb#226 + # source://rbi/0.1.13/lib/rbi/printer.rb#226 sig { override.params(v: ::RBI::Printer).void } def accept_printer(v); end - # source://rbi/0.1.10/lib/rbi/rewriters/add_sig_templates.rb#66 + # source://rbi/0.1.13/lib/rbi/rewriters/add_sig_templates.rb#66 sig { params(with_todo_comment: T::Boolean).void } def add_sig_templates!(with_todo_comment: T.unsafe(nil)); end - # source://rbi/0.1.10/lib/rbi/rewriters/annotate.rb#49 + # source://rbi/0.1.13/lib/rbi/rewriters/annotate.rb#49 sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void } def annotate!(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end @@ -140,9 +141,15 @@ class RBI::Tree < ::RBI::NodeWithComments sig { params(constant: ::Module, block: T.nilable(T.proc.params(scope: ::RBI::Scope).void)).returns(::RBI::Scope) } def create_path(constant, &block); end - # source://tapioca//lib/tapioca/rbi_ext/model.rb#134 - sig { params(parameters: T::Hash[T.any(::String, ::Symbol), ::String], return_type: ::String).returns(::RBI::Sig) } - def create_sig(parameters:, return_type: T.unsafe(nil)); end + # source://tapioca//lib/tapioca/rbi_ext/model.rb#135 + sig do + params( + parameters: T::Hash[T.any(::String, ::Symbol), ::String], + type_parameters: T::Array[::String], + return_type: ::String + ).returns(::RBI::Sig) + end + def create_sig(parameters:, type_parameters: T.unsafe(nil), return_type: T.unsafe(nil)); end # source://tapioca//lib/tapioca/rbi_ext/model.rb#74 sig do @@ -157,27 +164,27 @@ class RBI::Tree < ::RBI::NodeWithComments end def create_type_variable(name, type:, variance: T.unsafe(nil), fixed: T.unsafe(nil), upper: T.unsafe(nil), lower: T.unsafe(nil)); end - # source://rbi/0.1.10/lib/rbi/rewriters/deannotate.rb#41 + # source://rbi/0.1.13/lib/rbi/rewriters/deannotate.rb#41 sig { params(annotation: ::String).void } def deannotate!(annotation); end - # source://rbi/0.1.10/lib/rbi/model.rb#132 + # source://rbi/0.1.13/lib/rbi/model.rb#132 sig { returns(T::Boolean) } def empty?; end - # source://rbi/0.1.10/lib/rbi/rewriters/filter_versions.rb#118 + # source://rbi/0.1.13/lib/rbi/rewriters/filter_versions.rb#118 sig { params(version: ::Gem::Version).void } def filter_versions!(version); end - # source://rbi/0.1.10/lib/rbi/rewriters/group_nodes.rb#38 + # source://rbi/0.1.13/lib/rbi/rewriters/group_nodes.rb#38 sig { void } def group_nodes!; end - # source://rbi/0.1.10/lib/rbi/index.rb#68 + # source://rbi/0.1.13/lib/rbi/index.rb#68 sig { returns(::RBI::Index) } def index; end - # source://rbi/0.1.10/lib/rbi/rewriters/merge_trees.rb#324 + # source://rbi/0.1.13/lib/rbi/rewriters/merge_trees.rb#324 sig do params( other: ::RBI::Tree, @@ -188,44 +195,44 @@ class RBI::Tree < ::RBI::NodeWithComments end def merge(other, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end - # source://rbi/0.1.10/lib/rbi/rewriters/nest_non_public_methods.rb#46 + # source://rbi/0.1.13/lib/rbi/rewriters/nest_non_public_methods.rb#46 sig { void } def nest_non_public_methods!; end - # source://rbi/0.1.10/lib/rbi/rewriters/nest_singleton_methods.rb#36 + # source://rbi/0.1.13/lib/rbi/rewriters/nest_singleton_methods.rb#36 sig { void } def nest_singleton_methods!; end - # source://rbi/0.1.10/lib/rbi/model.rb#110 + # source://rbi/0.1.13/lib/rbi/model.rb#110 sig { returns(T::Array[::RBI::Node]) } def nodes; end - # source://rbi/0.1.10/lib/rbi/printer.rb#233 + # source://rbi/0.1.13/lib/rbi/printer.rb#233 sig { override.returns(T::Boolean) } def oneline?; end - # source://rbi/0.1.10/lib/rbi/rewriters/sort_nodes.rb#119 + # source://rbi/0.1.13/lib/rbi/rewriters/sort_nodes.rb#119 sig { void } def sort_nodes!; end private - # source://tapioca//lib/tapioca/rbi_ext/model.rb#149 + # source://tapioca//lib/tapioca/rbi_ext/model.rb#150 sig { params(node: ::RBI::Node).returns(::RBI::Node) } def create_node(node); end - # source://tapioca//lib/tapioca/rbi_ext/model.rb#144 + # source://tapioca//lib/tapioca/rbi_ext/model.rb#145 sig { returns(T::Hash[::String, ::RBI::Node]) } def nodes_cache; end end -# source://tapioca//lib/tapioca/rbi_ext/model.rb#159 +# source://tapioca//lib/tapioca/rbi_ext/model.rb#160 class RBI::TypedParam < ::T::Struct const :param, ::RBI::Param const :type, ::String class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -460,24 +467,24 @@ class Tapioca::Cli < ::Thor include ::Tapioca::ConfigHelper include ::Tapioca::EnvHelper - # source://tapioca//lib/tapioca/cli.rb#355 + # source://tapioca//lib/tapioca/cli.rb#361 def __print_version; end - # source://tapioca//lib/tapioca/cli.rb#337 + # source://tapioca//lib/tapioca/cli.rb#343 def annotations; end - # source://tapioca//lib/tapioca/cli.rb#309 + # source://tapioca//lib/tapioca/cli.rb#315 def check_shims; end # source://tapioca//lib/tapioca/cli.rb#46 def configure; end - # source://tapioca//lib/tapioca/cli.rb#138 + # source://tapioca//lib/tapioca/cli.rb#143 def dsl(*constant_or_paths); end # @raise [MalformattedArgumentError] # - # source://tapioca//lib/tapioca/cli.rb#253 + # source://tapioca//lib/tapioca/cli.rb#259 def gem(*gems); end # source://tapioca//lib/tapioca/cli.rb#27 @@ -491,11 +498,11 @@ class Tapioca::Cli < ::Thor private - # source://tapioca//lib/tapioca/cli.rb#369 + # source://tapioca//lib/tapioca/cli.rb#375 def print_init_next_steps; end class << self - # source://tapioca//lib/tapioca/cli.rb#361 + # source://tapioca//lib/tapioca/cli.rb#367 def exit_on_failure?; end end end @@ -532,7 +539,7 @@ class Tapioca::Commands::AbstractDsl < ::Tapioca::Commands::CommandWithoutTracke abstract! - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#31 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#32 sig do params( requested_constants: T::Array[::String], @@ -542,6 +549,7 @@ class Tapioca::Commands::AbstractDsl < ::Tapioca::Commands::CommandWithoutTracke exclude: T::Array[::String], file_header: T::Boolean, tapioca_path: ::String, + skip_constant: T::Array[::String], quiet: T::Boolean, verbose: T::Boolean, number_of_workers: T.nilable(::Integer), @@ -552,19 +560,19 @@ class Tapioca::Commands::AbstractDsl < ::Tapioca::Commands::CommandWithoutTracke halt_upon_load_error: T::Boolean ).void end - def initialize(requested_constants:, requested_paths:, outpath:, only:, exclude:, file_header:, tapioca_path:, quiet: T.unsafe(nil), verbose: T.unsafe(nil), number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), gem_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), app_root: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end + def initialize(requested_constants:, requested_paths:, outpath:, only:, exclude:, file_header:, tapioca_path:, skip_constant: T.unsafe(nil), quiet: T.unsafe(nil), verbose: T.unsafe(nil), number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), gem_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), app_root: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end private - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#94 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#97 sig { returns(T::Array[::String]) } def all_requested_constants; end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#285 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#289 sig { params(cause: ::Symbol, files: T::Array[::String]).returns(::String) } def build_error_for_files(cause, files); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#209 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#213 sig do params( constant_name: ::String, @@ -575,75 +583,75 @@ class Tapioca::Commands::AbstractDsl < ::Tapioca::Commands::CommandWithoutTracke end def compile_dsl_rbi(constant_name, rbi, outpath: T.unsafe(nil), quiet: T.unsafe(nil)); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#146 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#150 sig { params(constant_names: T::Array[::String], ignore_missing: T::Boolean).returns(T::Array[::Module]) } def constantize(constant_names, ignore_missing: T.unsafe(nil)); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#169 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#173 sig { params(compiler_names: T::Array[::String]).returns(T::Array[T.class_of(Tapioca::Dsl::Compiler)]) } def constantize_compilers(compiler_names); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#345 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#349 sig { returns(T::Array[::String]) } def constants_from_requested_paths; end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#117 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#120 sig { returns(::Tapioca::Dsl::Pipeline) } def create_pipeline; end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#248 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#252 sig { params(constant_name: ::String).returns(::Pathname) } def dsl_rbi_filename(constant_name); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#132 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#136 sig { params(requested_constants: T::Array[::String], path: ::Pathname).returns(T::Set[::Pathname]) } def existing_rbi_filenames(requested_constants, path: T.unsafe(nil)); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#340 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#344 sig { params(constant: ::String).returns(::String) } def generate_command_for(constant); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#70 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#73 sig { params(outpath: ::Pathname, quiet: T::Boolean).returns(T::Set[::Pathname]) } def generate_dsl_rbi_files(outpath, quiet:); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#107 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#110 sig { void } def load_application; end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#227 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#231 sig { params(dir: ::Pathname).void } def perform_dsl_verification(dir); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#102 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#105 sig { returns(::Tapioca::Dsl::Pipeline) } def pipeline; end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#236 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#240 sig { params(files: T::Set[::Pathname]).void } def purge_stale_dsl_rbi_files(files); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#335 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#339 sig { params(constant: ::String).returns(::String) } def rbi_filename_for(constant); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#316 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#320 sig { params(path: ::Pathname).returns(T::Array[::Pathname]) } def rbi_files_in(path); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#294 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#298 sig { params(diff: T::Hash[::String, ::Symbol], command: ::Symbol).void } def report_diff_and_exit_if_out_of_date(diff, command); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#189 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#193 sig { params(name: ::String).returns(T.nilable(T.class_of(Tapioca::Dsl::Compiler))) } def resolve(name); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#323 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#327 sig { params(class_name: ::String).returns(::String) } def underscore(class_name); end - # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#253 + # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#257 sig { params(tmp_dir: ::Pathname).returns(T::Hash[::String, ::Symbol]) } def verify_dsl_rbi(tmp_dir:); end end @@ -1142,7 +1150,7 @@ class Tapioca::ConfigHelper::ConfigError < ::T::Struct const :message_parts, T::Array[::Tapioca::ConfigHelper::ConfigErrorMessagePart] class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -1153,7 +1161,7 @@ class Tapioca::ConfigHelper::ConfigErrorMessagePart < ::T::Struct const :colors, T::Array[::Symbol] class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end @@ -1179,7 +1187,7 @@ Tapioca::DEFAULT_POSTREQUIRE_FILE = T.let(T.unsafe(nil), String) # source://tapioca//lib/tapioca.rb#39 Tapioca::DEFAULT_RBI_DIR = T.let(T.unsafe(nil), String) -# source://tapioca//lib/tapioca/rbi_formatter.rb#29 +# source://tapioca//lib/tapioca/rbi_formatter.rb#31 Tapioca::DEFAULT_RBI_FORMATTER = T.let(T.unsafe(nil), Tapioca::RBIFormatter) # source://tapioca//lib/tapioca.rb#55 @@ -1300,7 +1308,7 @@ Tapioca::Dsl::Compilers::NAMESPACES = T.let(T.unsafe(nil), Array) # source://tapioca//lib/tapioca/dsl/pipeline.rb#6 class Tapioca::Dsl::Pipeline - # source://tapioca//lib/tapioca/dsl/pipeline.rb#34 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#38 sig do params( requested_constants: T::Array[::Module], @@ -1308,32 +1316,33 @@ class Tapioca::Dsl::Pipeline requested_compilers: T::Array[T.class_of(Tapioca::Dsl::Compiler)], excluded_compilers: T::Array[T.class_of(Tapioca::Dsl::Compiler)], error_handler: T.proc.params(error: ::String).void, + skipped_constants: T::Array[::Module], number_of_workers: T.nilable(::Integer) ).void end - def initialize(requested_constants:, requested_paths: T.unsafe(nil), requested_compilers: T.unsafe(nil), excluded_compilers: T.unsafe(nil), error_handler: T.unsafe(nil), number_of_workers: T.unsafe(nil)); end + def initialize(requested_constants:, requested_paths: T.unsafe(nil), requested_compilers: T.unsafe(nil), excluded_compilers: T.unsafe(nil), error_handler: T.unsafe(nil), skipped_constants: T.unsafe(nil), number_of_workers: T.unsafe(nil)); end # source://tapioca//lib/tapioca/dsl/pipeline.rb#10 sig { returns(T::Enumerable[T.class_of(Tapioca::Dsl::Compiler)]) } def active_compilers; end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#93 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#99 sig { params(error: ::String).void } def add_error(error); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#98 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#104 sig { params(compiler_name: ::String).returns(T::Boolean) } def compiler_enabled?(compiler_name); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#107 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#113 sig { returns(T::Array[T.class_of(Tapioca::Dsl::Compiler)]) } def compilers; end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#19 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#22 sig { returns(T.proc.params(error: ::String).void) } def error_handler; end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#22 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#25 sig { returns(T::Array[::String]) } def errors; end @@ -1345,7 +1354,7 @@ class Tapioca::Dsl::Pipeline sig { returns(T::Array[::Pathname]) } def requested_paths; end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#58 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#64 sig do type_parameters(:T) .params( @@ -1354,17 +1363,21 @@ class Tapioca::Dsl::Pipeline end def run(&blk); end + # source://tapioca//lib/tapioca/dsl/pipeline.rb#19 + sig { returns(T::Array[::Module]) } + def skipped_constants; end + private - # source://tapioca//lib/tapioca/dsl/pipeline.rb#199 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#220 sig { void } def abort_if_pending_migrations!; end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#144 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#165 sig { params(constants: T::Set[::Module]).returns(T::Set[::Module]) } def filter_anonymous_and_reloaded_constants(constants); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#124 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#130 sig do params( requested_compilers: T::Array[T.class_of(Tapioca::Dsl::Compiler)], @@ -1373,20 +1386,21 @@ class Tapioca::Dsl::Pipeline end def gather_active_compilers(requested_compilers, excluded_compilers); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#132 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#144 sig do params( requested_constants: T::Array[::Module], - requested_paths: T::Array[::Pathname] + requested_paths: T::Array[::Pathname], + skipped_constants: T::Array[::Module] ).returns(T::Set[::Module]) end - def gather_constants(requested_constants, requested_paths); end + def gather_constants(requested_constants, requested_paths, skipped_constants); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#173 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#194 sig { params(constant: ::Module).returns(T.nilable(::RBI::File)) } def rbi_for_constant(constant); end - # source://tapioca//lib/tapioca/dsl/pipeline.rb#192 + # source://tapioca//lib/tapioca/dsl/pipeline.rb#213 sig { params(error: ::String).returns(T.noreturn) } def report_error(error); end end @@ -2453,16 +2467,16 @@ class Tapioca::Loaders::Loader # @param engine [T.class_of(Rails::Engine)] # @return [Array] # - # source://sorbet-runtime/0.5.11347/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11391/lib/types/private/methods/_methods.rb#257 def eager_load_paths(*args, **_arg1, &blk); end - # source://tapioca//lib/tapioca/loaders/loader.rb#198 + # source://tapioca//lib/tapioca/loaders/loader.rb#188 sig { void } def eager_load_rails_app; end # @return [Array] # - # source://tapioca//lib/tapioca/loaders/loader.rb#169 + # source://tapioca//lib/tapioca/loaders/loader.rb#167 def engines; end # source://tapioca//lib/tapioca/loaders/loader.rb#29 @@ -2476,11 +2490,11 @@ class Tapioca::Loaders::Loader end def load_bundle(gemfile, initialize_file, require_file, halt_upon_load_error); end - # source://tapioca//lib/tapioca/loaders/loader.rb#127 + # source://tapioca//lib/tapioca/loaders/loader.rb#125 sig { void } def load_engines_in_classic_mode; end - # source://tapioca//lib/tapioca/loaders/loader.rb#105 + # source://tapioca//lib/tapioca/loaders/loader.rb#103 sig { void } def load_engines_in_zeitwerk_mode; end @@ -2495,30 +2509,26 @@ class Tapioca::Loaders::Loader end def load_rails_application(environment_load: T.unsafe(nil), eager_load: T.unsafe(nil), app_root: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end - # source://tapioca//lib/tapioca/loaders/loader.rb#80 + # source://tapioca//lib/tapioca/loaders/loader.rb#78 sig { void } def load_rails_engines; end - # source://tapioca//lib/tapioca/loaders/loader.rb#219 + # source://tapioca//lib/tapioca/loaders/loader.rb#209 sig { params(file: T.nilable(::String)).void } def require_helper(file); end - # source://tapioca//lib/tapioca/loaders/loader.rb#94 + # source://tapioca//lib/tapioca/loaders/loader.rb#92 def run_initializers; end - # source://tapioca//lib/tapioca/loaders/loader.rb#183 + # source://tapioca//lib/tapioca/loaders/loader.rb#181 sig { params(path: ::String).void } def safe_require(path); end - # source://tapioca//lib/tapioca/loaders/loader.rb#190 - sig { void } - def silence_deprecations; end - - # source://tapioca//lib/tapioca/loaders/loader.rb#152 + # source://tapioca//lib/tapioca/loaders/loader.rb#150 sig { params(blk: T.proc.void).void } def with_rails_application(&blk); end - # source://tapioca//lib/tapioca/loaders/loader.rb#145 + # source://tapioca//lib/tapioca/loaders/loader.rb#143 sig { returns(T::Boolean) } def zeitwerk_mode?; end end @@ -2614,7 +2624,7 @@ end # source://tapioca//lib/tapioca/rbi_formatter.rb#5 class Tapioca::RBIFormatter < ::RBI::Formatter - # source://tapioca//lib/tapioca/rbi_formatter.rb#22 + # source://tapioca//lib/tapioca/rbi_formatter.rb#24 sig { params(file: ::RBI::File).void } def write_empty_body_comment!(file); end @@ -2633,6 +2643,10 @@ module Tapioca::RBIHelper sig { params(type: ::String).returns(::String) } def as_nilable_type(type); end + # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#100 + sig { params(type: ::String).returns(::String) } + def as_non_nilable_type(type); end + # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#72 sig { params(name: ::String, type: ::String).returns(::RBI::TypedParam) } def create_block_param(name, type:); end @@ -2669,11 +2683,11 @@ module Tapioca::RBIHelper sig { params(sig_string: ::String).returns(::String) } def sanitize_signature_types(sig_string); end - # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#100 + # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#109 sig { params(name: ::String).returns(T::Boolean) } def valid_method_name?(name); end - # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#114 + # source://tapioca//lib/tapioca/helpers/rbi_helper.rb#123 sig { params(name: ::String).returns(T::Boolean) } def valid_parameter_name?(name); end @@ -3361,7 +3375,7 @@ module Tapioca::Static::SymbolLoader # @return [Array] # - # source://sorbet-runtime/0.5.11347/lib/types/private/methods/_methods.rb#257 + # source://sorbet-runtime/0.5.11391/lib/types/private/methods/_methods.rb#257 def engines(*args, **_arg1, &blk); end # source://tapioca//lib/tapioca/static/symbol_loader.rb#82 diff --git a/sorbet/rbi/gems/thor@1.3.1.rbi b/sorbet/rbi/gems/thor@1.3.1.rbi index a806aa3..18cf035 100644 --- a/sorbet/rbi/gems/thor@1.3.1.rbi +++ b/sorbet/rbi/gems/thor@1.3.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `thor` gem. # Please instead update this file by running `bin/tapioca gem thor`. + # source://thor//lib/thor/shell/lcs_diff.rb#1 module LCSDiff protected diff --git a/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi b/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi index ccdfd06..2aaad23 100644 --- a/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi +++ b/sorbet/rbi/gems/unicode-display_width@2.5.0.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `unicode-display_width` gem. # Please instead update this file by running `bin/tapioca gem unicode-display_width`. + # source://unicode-display_width//lib/unicode/display_width/constants.rb#3 module Unicode; end diff --git a/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi b/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi index b084e22..933d6e8 100644 --- a/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi +++ b/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `yard-sorbet` gem. # Please instead update this file by running `bin/tapioca gem yard-sorbet`. + class YARD::Handlers::Ruby::ClassHandler < ::YARD::Handlers::Ruby::Base include ::YARDSorbet::Handlers::StructClassHandler end @@ -381,7 +382,7 @@ class YARDSorbet::TStructProp < ::T::Struct const :types, T::Array[::String] class << self - # source://sorbet-runtime/0.5.11347/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11391/lib/types/struct.rb#13 def inherited(s); end end end diff --git a/sorbet/rbi/gems/yard@0.9.36.rbi b/sorbet/rbi/gems/yard@0.9.36.rbi index ad5cb43..8b34fbd 100644 --- a/sorbet/rbi/gems/yard@0.9.36.rbi +++ b/sorbet/rbi/gems/yard@0.9.36.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `yard` gem. # Please instead update this file by running `bin/tapioca gem yard`. + # source://yard//lib/yard.rb#61 ::RUBY18 = T.let(T.unsafe(nil), FalseClass) diff --git a/sorbet/rbi/gems/zeitwerk@2.6.13.rbi b/sorbet/rbi/gems/zeitwerk@2.6.15.rbi similarity index 92% rename from sorbet/rbi/gems/zeitwerk@2.6.13.rbi rename to sorbet/rbi/gems/zeitwerk@2.6.15.rbi index e5fc153..e3bc375 100644 --- a/sorbet/rbi/gems/zeitwerk@2.6.13.rbi +++ b/sorbet/rbi/gems/zeitwerk@2.6.15.rbi @@ -4,6 +4,7 @@ # This is an autogenerated file for types exported from the `zeitwerk` gem. # Please instead update this file by running `bin/tapioca gem zeitwerk`. + # source://zeitwerk//lib/zeitwerk/kernel.rb#3 module Kernel private @@ -197,7 +198,7 @@ class Zeitwerk::Loader # source://zeitwerk//lib/zeitwerk/loader.rb#77 def __namespace_dirs; end - # source://zeitwerk//lib/zeitwerk/loader.rb#310 + # source://zeitwerk//lib/zeitwerk/loader.rb#344 def __shadowed_file?(file); end # source://zeitwerk//lib/zeitwerk/loader.rb#88 @@ -206,9 +207,15 @@ class Zeitwerk::Loader # source://zeitwerk//lib/zeitwerk/loader.rb#59 def __to_unload; end + # Returns a hash that maps the absolute paths of the managed files and + # directories to their respective expected constant paths. + # + # source://zeitwerk//lib/zeitwerk/loader.rb#237 + def all_expected_cpaths; end + # @raise [Zeitwerk::Error] # - # source://zeitwerk//lib/zeitwerk/loader.rb#234 + # source://zeitwerk//lib/zeitwerk/loader.rb#268 def cpath_expected_at(path); end # Unloads all loaded code, and calls setup again so that the loader is able @@ -246,31 +253,31 @@ class Zeitwerk::Loader # # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader.rb#285 + # source://zeitwerk//lib/zeitwerk/loader.rb#319 def unloadable_cpath?(cpath); end # Returns an array with the constant paths that would be unloaded on reload. # This predicate returns an empty array if reloading is disabled. # - # source://zeitwerk//lib/zeitwerk/loader.rb#293 + # source://zeitwerk//lib/zeitwerk/loader.rb#327 def unloadable_cpaths; end # This is a dangerous method. # - # source://zeitwerk//lib/zeitwerk/loader.rb#301 + # source://zeitwerk//lib/zeitwerk/loader.rb#335 def unregister; end private - # source://zeitwerk//lib/zeitwerk/loader.rb#456 + # source://zeitwerk//lib/zeitwerk/loader.rb#490 def autoload_file(parent, cname, file); end # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader.rb#514 + # source://zeitwerk//lib/zeitwerk/loader.rb#548 def autoload_path_set_by_me_for?(parent, cname); end - # source://zeitwerk//lib/zeitwerk/loader.rb#426 + # source://zeitwerk//lib/zeitwerk/loader.rb#460 def autoload_subdir(parent, cname, subdir); end # We keep track of autoloaded directories to remove them from the registry @@ -293,10 +300,10 @@ class Zeitwerk::Loader # source://zeitwerk//lib/zeitwerk/loader.rb#33 def autoloads; end - # source://zeitwerk//lib/zeitwerk/loader.rb#493 + # source://zeitwerk//lib/zeitwerk/loader.rb#527 def define_autoload(parent, cname, abspath); end - # source://zeitwerk//lib/zeitwerk/loader.rb#410 + # source://zeitwerk//lib/zeitwerk/loader.rb#444 def define_autoloads_for_dir(dir, parent); end # Returns the value of attribute dirs_autoload_monitor. @@ -329,19 +336,19 @@ class Zeitwerk::Loader # `dir` is the directory that would have autovivified a namespace. `file` is # the file where we've found the namespace is explicitly defined. # - # source://zeitwerk//lib/zeitwerk/loader.rb#482 + # source://zeitwerk//lib/zeitwerk/loader.rb#516 def promote_namespace_from_implicit_to_explicit(dir:, file:, parent:, cname:); end - # source://zeitwerk//lib/zeitwerk/loader.rb#528 + # source://zeitwerk//lib/zeitwerk/loader.rb#562 def raise_if_conflicting_directory(dir); end - # source://zeitwerk//lib/zeitwerk/loader.rb#523 + # source://zeitwerk//lib/zeitwerk/loader.rb#557 def register_explicit_namespace(cpath); end - # source://zeitwerk//lib/zeitwerk/loader.rb#552 + # source://zeitwerk//lib/zeitwerk/loader.rb#586 def run_on_unload_callbacks(cpath, value, abspath); end - # source://zeitwerk//lib/zeitwerk/loader.rb#310 + # source://zeitwerk//lib/zeitwerk/loader.rb#344 def shadowed_file?(file); end # A shadowed file is a file managed by this loader that is ignored when @@ -369,41 +376,41 @@ class Zeitwerk::Loader # source://zeitwerk//lib/zeitwerk/loader.rb#59 def to_unload; end - # source://zeitwerk//lib/zeitwerk/loader.rb#559 + # source://zeitwerk//lib/zeitwerk/loader.rb#593 def unload_autoload(parent, cname); end - # source://zeitwerk//lib/zeitwerk/loader.rb#565 + # source://zeitwerk//lib/zeitwerk/loader.rb#599 def unload_cref(parent, cname); end class << self # Returns an array with the absolute paths of the root directories of all # registered loaders. This is a read-only collection. # - # source://zeitwerk//lib/zeitwerk/loader.rb#404 + # source://zeitwerk//lib/zeitwerk/loader.rb#438 def all_dirs; end # Returns the value of attribute default_logger. # - # source://zeitwerk//lib/zeitwerk/loader.rb#320 + # source://zeitwerk//lib/zeitwerk/loader.rb#354 def default_logger; end # Sets the attribute default_logger # # @param value the value to set the attribute default_logger to. # - # source://zeitwerk//lib/zeitwerk/loader.rb#320 + # source://zeitwerk//lib/zeitwerk/loader.rb#354 def default_logger=(_arg0); end # Broadcasts `eager_load` to all loaders. Those that have not been setup # are skipped. # - # source://zeitwerk//lib/zeitwerk/loader.rb#376 + # source://zeitwerk//lib/zeitwerk/loader.rb#410 def eager_load_all; end # Broadcasts `eager_load_namespace` to all loaders. Those that have not # been setup are skipped. # - # source://zeitwerk//lib/zeitwerk/loader.rb#390 + # source://zeitwerk//lib/zeitwerk/loader.rb#424 def eager_load_namespace(mod); end # This is a shortcut for @@ -421,7 +428,7 @@ class Zeitwerk::Loader # This method returns a subclass of Zeitwerk::Loader, but the exact type # is private, client code can only rely on the interface. # - # source://zeitwerk//lib/zeitwerk/loader.rb#338 + # source://zeitwerk//lib/zeitwerk/loader.rb#372 def for_gem(warn_on_extra_files: T.unsafe(nil)); end # This is a shortcut for @@ -439,7 +446,7 @@ class Zeitwerk::Loader # This method returns a subclass of Zeitwerk::Loader, but the exact type # is private, client code can only rely on the interface. # - # source://zeitwerk//lib/zeitwerk/loader.rb#359 + # source://zeitwerk//lib/zeitwerk/loader.rb#393 def for_gem_extension(namespace); end end end @@ -781,43 +788,47 @@ module Zeitwerk::Loader::Helpers # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#128 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#141 def cdef?(parent, cname); end # @raise [NameError] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#134 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#147 def cget(parent, cname); end # @raise [Zeitwerk::NameError] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#149 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#162 def cname_for(basename, abspath); end # Symbol#name was introduced in Ruby 3.0. It returns always the same # frozen object, so we may save a few string allocations. # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#118 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#131 def cpath(parent, cname); end # @raise [NameError] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#140 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#153 def crem(parent, cname); end # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#67 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#80 def dir?(path); end + # Looks for a Ruby file using breadth-first search. This type of search is + # important to list as less directories as possible and return fast in the + # common case in which there are Ruby files. + # # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#45 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#51 def has_at_least_one_ruby_file?(dir); end # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#72 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#85 def hidden?(basename); end # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#7 @@ -828,17 +839,17 @@ module Zeitwerk::Loader::Helpers # @return [Boolean] # - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#62 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#75 def ruby?(path); end - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#109 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#122 def strict_autoload_path(parent, cname); end - # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#77 + # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#90 def walk_up(abspath); end end -# source://zeitwerk//lib/zeitwerk/loader/helpers.rb#144 +# source://zeitwerk//lib/zeitwerk/loader/helpers.rb#157 module Zeitwerk::Loader::Helpers::CNAME_VALIDATOR; end # source://zeitwerk//lib/zeitwerk/loader.rb#21