From 87221856a6dc208e9e0d99b0cb9feaf4f149ae39 Mon Sep 17 00:00:00 2001 From: Max VelDink Date: Wed, 14 Feb 2024 15:31:41 -0500 Subject: [PATCH] chore: Rebuild RBIs --- ...initest@5.21.2.rbi => minitest@5.22.2.rbi} | 303 +- .../{prism@0.19.0.rbi => prism@0.21.0.rbi} | 26175 ++++++++++------ .../rbi/gems/{rbi@0.1.6.rbi => rbi@0.1.8.rbi} | 4 +- ...bet@0.7.6.rbi => rubocop-sorbet@0.7.7.rbi} | 0 ...{rubocop@1.59.0.rbi => rubocop@1.60.2.rbi} | 1030 +- ...tandard@1.33.0.rbi => standard@1.34.0.rbi} | 110 +- 6 files changed, 17079 insertions(+), 10543 deletions(-) rename sorbet/rbi/gems/{minitest@5.21.2.rbi => minitest@5.22.2.rbi} (90%) rename sorbet/rbi/gems/{prism@0.19.0.rbi => prism@0.21.0.rbi} (54%) rename sorbet/rbi/gems/{rbi@0.1.6.rbi => rbi@0.1.8.rbi} (99%) rename sorbet/rbi/gems/{rubocop-sorbet@0.7.6.rbi => rubocop-sorbet@0.7.7.rbi} (100%) rename sorbet/rbi/gems/{rubocop@1.59.0.rbi => rubocop@1.60.2.rbi} (98%) rename sorbet/rbi/gems/{standard@1.33.0.rbi => standard@1.34.0.rbi} (88%) diff --git a/sorbet/rbi/gems/minitest@5.21.2.rbi b/sorbet/rbi/gems/minitest@5.22.2.rbi similarity index 90% rename from sorbet/rbi/gems/minitest@5.21.2.rbi rename to sorbet/rbi/gems/minitest@5.22.2.rbi index f6bb41a..2d5a389 100644 --- a/sorbet/rbi/gems/minitest@5.21.2.rbi +++ b/sorbet/rbi/gems/minitest@5.22.2.rbi @@ -56,7 +56,7 @@ module Minitest # Internal run method. Responsible for telling all Runnable # sub-classes to run. # - # source://minitest//lib/minitest.rb#176 + # source://minitest//lib/minitest.rb#197 def __run(reporter, options); end # A simple hook allowing you to run a block of code after everything @@ -87,16 +87,19 @@ module Minitest # source://minitest//lib/minitest.rb#18 def cattr_accessor(name); end - # source://minitest//lib/minitest.rb#1134 + # source://minitest//lib/minitest.rb#1146 def clock_time; end + # source://minitest//lib/minitest.rb#177 + def empty_run!(options); end + # source://minitest//lib/minitest.rb#19 def extensions; end # source://minitest//lib/minitest.rb#19 def extensions=(_arg0); end - # source://minitest//lib/minitest.rb#271 + # source://minitest//lib/minitest.rb#292 def filter_backtrace(bt); end # source://minitest//lib/minitest.rb#19 @@ -117,7 +120,7 @@ module Minitest # source://minitest//lib/minitest.rb#19 def parallel_executor=(_arg0); end - # source://minitest//lib/minitest.rb#189 + # source://minitest//lib/minitest.rb#210 def process_args(args = T.unsafe(nil)); end # source://minitest//lib/minitest.rb#19 @@ -136,7 +139,7 @@ module Minitest # Minitest.run(args) # Minitest.__run(reporter, options) # Runnable.runnables.each - # runnable.run(reporter, options) + # runnable_klass.run(reporter, options) # self.runnable_methods.each # self.run_one_method(self, runnable_method, reporter) # Minitest.run_one_method(klass, runnable_method) @@ -145,7 +148,7 @@ module Minitest # source://minitest//lib/minitest.rb#143 def run(args = T.unsafe(nil)); end - # source://minitest//lib/minitest.rb#1125 + # source://minitest//lib/minitest.rb#1137 def run_one_method(klass, method_name); end # source://minitest//lib/minitest.rb#19 @@ -159,24 +162,24 @@ end # Defines the API for Reporters. Subclass this and override whatever # you want. Go nuts. # -# source://minitest//lib/minitest.rb#627 +# source://minitest//lib/minitest.rb#638 class Minitest::AbstractReporter # @return [AbstractReporter] a new instance of AbstractReporter # - # source://minitest//lib/minitest.rb#629 + # source://minitest//lib/minitest.rb#640 def initialize; end # Did this run pass? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#664 + # source://minitest//lib/minitest.rb#675 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#643 + # source://minitest//lib/minitest.rb#654 def prerecord(klass, name); end # Output and record the result of the test. Call @@ -184,43 +187,43 @@ class Minitest::AbstractReporter # result character string. Stores the result of the run if the run # did not pass. # - # source://minitest//lib/minitest.rb#652 + # source://minitest//lib/minitest.rb#663 def record(result); end # Outputs the summary of the run. # - # source://minitest//lib/minitest.rb#658 + # source://minitest//lib/minitest.rb#669 def report; end # Starts reporting on the run. # - # source://minitest//lib/minitest.rb#636 + # source://minitest//lib/minitest.rb#647 def start; end - # source://minitest//lib/minitest.rb#668 + # source://minitest//lib/minitest.rb#679 def synchronize(&block); end end # Represents run failures. # -# source://minitest//lib/minitest.rb#951 +# source://minitest//lib/minitest.rb#962 class Minitest::Assertion < ::Exception - # source://minitest//lib/minitest.rb#954 + # source://minitest//lib/minitest.rb#965 def error; end # Where was this run before an assertion was raised? # - # source://minitest//lib/minitest.rb#961 + # source://minitest//lib/minitest.rb#972 def location; end - # source://minitest//lib/minitest.rb#968 + # source://minitest//lib/minitest.rb#980 def result_code; end - # source://minitest//lib/minitest.rb#972 + # source://minitest//lib/minitest.rb#984 def result_label; end end -# source://minitest//lib/minitest.rb#952 +# source://minitest//lib/minitest.rb#963 Minitest::Assertion::RE = T.let(T.unsafe(nil), Regexp) # Minitest Assertions. All assertion methods accept a +msg+ which is @@ -672,77 +675,77 @@ Minitest::Assertions::UNDEFINED = T.let(T.unsafe(nil), Object) # # See Minitest.backtrace_filter=. # -# source://minitest//lib/minitest.rb#1096 +# source://minitest//lib/minitest.rb#1108 class Minitest::BacktraceFilter # @return [BacktraceFilter] a new instance of BacktraceFilter # - # source://minitest//lib/minitest.rb#1102 + # source://minitest//lib/minitest.rb#1114 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#1110 + # source://minitest//lib/minitest.rb#1122 def filter(bt); end # Returns the value of attribute regexp. # - # source://minitest//lib/minitest.rb#1100 + # source://minitest//lib/minitest.rb#1112 def regexp; end # Sets the attribute regexp # # @param value the value to set the attribute regexp to. # - # source://minitest//lib/minitest.rb#1100 + # source://minitest//lib/minitest.rb#1112 def regexp=(_arg0); end end -# source://minitest//lib/minitest.rb#1098 +# source://minitest//lib/minitest.rb#1110 Minitest::BacktraceFilter::MT_RE = T.let(T.unsafe(nil), Regexp) # Dispatch to multiple reporters as one. # -# source://minitest//lib/minitest.rb#900 +# source://minitest//lib/minitest.rb#911 class Minitest::CompositeReporter < ::Minitest::AbstractReporter # @return [CompositeReporter] a new instance of CompositeReporter # - # source://minitest//lib/minitest.rb#906 + # source://minitest//lib/minitest.rb#917 def initialize(*reporters); end # Add another reporter to the mix. # - # source://minitest//lib/minitest.rb#918 + # source://minitest//lib/minitest.rb#929 def <<(reporter); end - # source://minitest//lib/minitest.rb#911 + # source://minitest//lib/minitest.rb#922 def io; end # @return [Boolean] # - # source://minitest//lib/minitest.rb#922 + # source://minitest//lib/minitest.rb#933 def passed?; end - # source://minitest//lib/minitest.rb#930 + # source://minitest//lib/minitest.rb#941 def prerecord(klass, name); end - # source://minitest//lib/minitest.rb#937 + # source://minitest//lib/minitest.rb#948 def record(result); end - # source://minitest//lib/minitest.rb#943 + # source://minitest//lib/minitest.rb#954 def report; end # The list of reporters to dispatch to. # - # source://minitest//lib/minitest.rb#904 + # source://minitest//lib/minitest.rb#915 def reporters; end # The list of reporters to dispatch to. # - # source://minitest//lib/minitest.rb#904 + # source://minitest//lib/minitest.rb#915 def reporters=(_arg0); end - # source://minitest//lib/minitest.rb#926 + # source://minitest//lib/minitest.rb#937 def start; end end @@ -1013,48 +1016,48 @@ end # # ... lots of test methods ... # end # -# source://minitest//lib/minitest.rb#1040 +# source://minitest//lib/minitest.rb#1052 module Minitest::Guard # Is this running on jruby? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1045 + # source://minitest//lib/minitest.rb#1057 def jruby?(platform = T.unsafe(nil)); end # Is this running on maglev? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1052 + # source://minitest//lib/minitest.rb#1064 def maglev?(platform = T.unsafe(nil)); end # Is this running on mri? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1062 + # source://minitest//lib/minitest.rb#1074 def mri?(platform = T.unsafe(nil)); end # Is this running on macOS? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1069 + # source://minitest//lib/minitest.rb#1081 def osx?(platform = T.unsafe(nil)); end # Is this running on rubinius? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1076 + # source://minitest//lib/minitest.rb#1088 def rubinius?(platform = T.unsafe(nil)); end # Is this running on windows? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#1086 + # source://minitest//lib/minitest.rb#1098 def windows?(platform = T.unsafe(nil)); end end @@ -1217,36 +1220,36 @@ end # plugin, pull this out of the composite and replace it with your # own. # -# source://minitest//lib/minitest.rb#699 +# source://minitest//lib/minitest.rb#710 class Minitest::ProgressReporter < ::Minitest::Reporter - # source://minitest//lib/minitest.rb#700 + # source://minitest//lib/minitest.rb#711 def prerecord(klass, name); end - # source://minitest//lib/minitest.rb#707 + # source://minitest//lib/minitest.rb#718 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#521 +# source://minitest//lib/minitest.rb#532 module Minitest::Reportable # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#543 + # source://minitest//lib/minitest.rb#554 def class_name; end # Did this run error? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#564 + # source://minitest//lib/minitest.rb#575 def error?; end # The location identifier of this test. Depends on a method # existing called class_name. # - # source://minitest//lib/minitest.rb#538 + # source://minitest//lib/minitest.rb#549 def location; end # Did this run pass? @@ -1256,50 +1259,50 @@ module Minitest::Reportable # # @return [Boolean] # - # source://minitest//lib/minitest.rb#528 + # source://minitest//lib/minitest.rb#539 def passed?; end # Returns ".", "F", or "E" based on the result of the run. # - # source://minitest//lib/minitest.rb#550 + # source://minitest//lib/minitest.rb#561 def result_code; end # Was this run skipped? # # @return [Boolean] # - # source://minitest//lib/minitest.rb#557 + # source://minitest//lib/minitest.rb#568 def skipped?; end end -# source://minitest//lib/minitest.rb#532 +# source://minitest//lib/minitest.rb#543 Minitest::Reportable::BASE_DIR = T.let(T.unsafe(nil), String) -# source://minitest//lib/minitest.rb#675 +# source://minitest//lib/minitest.rb#686 class Minitest::Reporter < ::Minitest::AbstractReporter # @return [Reporter] a new instance of Reporter # - # source://minitest//lib/minitest.rb#684 + # source://minitest//lib/minitest.rb#695 def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end # The IO used to report. # - # source://minitest//lib/minitest.rb#677 + # source://minitest//lib/minitest.rb#688 def io; end # The IO used to report. # - # source://minitest//lib/minitest.rb#677 + # source://minitest//lib/minitest.rb#688 def io=(_arg0); end # Command-line options for this run. # - # source://minitest//lib/minitest.rb#682 + # source://minitest//lib/minitest.rb#693 def options; end # Command-line options for this run. # - # source://minitest//lib/minitest.rb#682 + # source://minitest//lib/minitest.rb#693 def options=(_arg0); end end @@ -1309,80 +1312,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#576 +# source://minitest//lib/minitest.rb#587 class Minitest::Result < ::Minitest::Runnable include ::Minitest::Reportable - # source://minitest//lib/minitest.rb#610 + # source://minitest//lib/minitest.rb#621 def class_name; end # The class name of the test result. # - # source://minitest//lib/minitest.rb#585 + # source://minitest//lib/minitest.rb#596 def klass; end # The class name of the test result. # - # source://minitest//lib/minitest.rb#585 + # source://minitest//lib/minitest.rb#596 def klass=(_arg0); end # The location of the test method. # - # source://minitest//lib/minitest.rb#590 + # source://minitest//lib/minitest.rb#601 def source_location; end # The location of the test method. # - # source://minitest//lib/minitest.rb#590 + # source://minitest//lib/minitest.rb#601 def source_location=(_arg0); end - # source://minitest//lib/minitest.rb#614 + # source://minitest//lib/minitest.rb#625 def to_s; end class << self # Create a new test result from a Runnable instance. # - # source://minitest//lib/minitest.rb#595 + # source://minitest//lib/minitest.rb#606 def from(runnable); end end end # re-open # -# source://minitest//lib/minitest.rb#284 +# source://minitest//lib/minitest.rb#305 class Minitest::Runnable # @return [Runnable] a new instance of Runnable # - # source://minitest//lib/minitest.rb#452 + # source://minitest//lib/minitest.rb#463 def initialize(name); end # Number of assertions executed in this run. # - # source://minitest//lib/minitest.rb#288 + # source://minitest//lib/minitest.rb#309 def assertions; end # Number of assertions executed in this run. # - # source://minitest//lib/minitest.rb#288 + # source://minitest//lib/minitest.rb#309 def assertions=(_arg0); end - # source://minitest//lib/minitest.rb#448 + # source://minitest//lib/minitest.rb#459 def failure; end # An assertion raised during the run, if any. # - # source://minitest//lib/minitest.rb#293 + # source://minitest//lib/minitest.rb#314 def failures; end # An assertion raised during the run, if any. # - # source://minitest//lib/minitest.rb#293 + # source://minitest//lib/minitest.rb#314 def failures=(_arg0); end - # source://minitest//lib/minitest.rb#434 + # source://minitest//lib/minitest.rb#445 def marshal_dump; end - # source://minitest//lib/minitest.rb#444 + # source://minitest//lib/minitest.rb#455 def marshal_load(ary); end # Metadata you attach to the test results that get sent to the reporter. @@ -1392,29 +1395,29 @@ class Minitest::Runnable # NOTE: this data *must* be plain (read: marshal-able) data! # Hashes! Arrays! Strings! # - # source://minitest//lib/minitest.rb#467 + # source://minitest//lib/minitest.rb#478 def metadata; end # Sets metadata, mainly used for +Result.from+. # - # source://minitest//lib/minitest.rb#474 + # source://minitest//lib/minitest.rb#485 def metadata=(_arg0); end # Returns true if metadata exists. # # @return [Boolean] # - # source://minitest//lib/minitest.rb#479 + # source://minitest//lib/minitest.rb#490 def metadata?; end # Name of the run. # - # source://minitest//lib/minitest.rb#311 + # source://minitest//lib/minitest.rb#332 def name; end # Set the name of the run. # - # source://minitest//lib/minitest.rb#318 + # source://minitest//lib/minitest.rb#339 def name=(o); end # Did this run pass? @@ -1425,7 +1428,7 @@ class Minitest::Runnable # @raise [NotImplementedError] # @return [Boolean] # - # source://minitest//lib/minitest.rb#496 + # source://minitest//lib/minitest.rb#507 def passed?; end # Returns a single character string to print based on the result @@ -1434,14 +1437,14 @@ class Minitest::Runnable # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#505 + # source://minitest//lib/minitest.rb#516 def result_code; end # Runs a single method. Needs to return self. # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#486 + # source://minitest//lib/minitest.rb#497 def run; end # Was this run skipped? See #passed? for more information. @@ -1449,42 +1452,42 @@ class Minitest::Runnable # @raise [NotImplementedError] # @return [Boolean] # - # source://minitest//lib/minitest.rb#512 + # source://minitest//lib/minitest.rb#523 def skipped?; end # The time it took to run. # - # source://minitest//lib/minitest.rb#298 + # source://minitest//lib/minitest.rb#319 def time; end # The time it took to run. # - # source://minitest//lib/minitest.rb#298 + # source://minitest//lib/minitest.rb#319 def time=(_arg0); end - # source://minitest//lib/minitest.rb#300 + # source://minitest//lib/minitest.rb#321 def time_it; end class << self - # source://minitest//lib/minitest.rb#1144 + # source://minitest//lib/minitest.rb#1156 def inherited(klass); end # Returns all instance methods matching the pattern +re+. # - # source://minitest//lib/minitest.rb#325 + # source://minitest//lib/minitest.rb#346 def methods_matching(re); end - # source://minitest//lib/minitest.rb#404 + # source://minitest//lib/minitest.rb#415 def on_signal(name, action); end - # source://minitest//lib/minitest.rb#329 + # source://minitest//lib/minitest.rb#350 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#340 + # source://minitest//lib/minitest.rb#361 def run(reporter, options = T.unsafe(nil)); end # Runs a single method and has the reporter record the result. @@ -1492,7 +1495,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#376 + # source://minitest//lib/minitest.rb#387 def run_one_method(klass, method_name, reporter); end # Each subclass of Runnable is responsible for overriding this @@ -1500,33 +1503,33 @@ class Minitest::Runnable # # @raise [NotImplementedError] # - # source://minitest//lib/minitest.rb#421 + # source://minitest//lib/minitest.rb#432 def runnable_methods; end # Returns all subclasses of Runnable. # - # source://minitest//lib/minitest.rb#428 + # source://minitest//lib/minitest.rb#439 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#385 + # source://minitest//lib/minitest.rb#396 def test_order; end - # source://minitest//lib/minitest.rb#389 + # source://minitest//lib/minitest.rb#400 def with_info_handler(reporter, &block); end end end -# source://minitest//lib/minitest.rb#402 +# source://minitest//lib/minitest.rb#413 Minitest::Runnable::SIGNALS = T.let(T.unsafe(nil), Hash) # Assertion raised when skipping a run. # -# source://minitest//lib/minitest.rb#980 +# source://minitest//lib/minitest.rb#992 class Minitest::Skip < ::Minitest::Assertion - # source://minitest//lib/minitest.rb#981 + # source://minitest//lib/minitest.rb#993 def result_label; end end @@ -1783,113 +1786,113 @@ Minitest::Spec::TYPES = T.let(T.unsafe(nil), Array) # end # end # -# source://minitest//lib/minitest.rb#735 +# source://minitest//lib/minitest.rb#746 class Minitest::StatisticsReporter < ::Minitest::Reporter # @return [StatisticsReporter] a new instance of StatisticsReporter # - # source://minitest//lib/minitest.rb#779 + # source://minitest//lib/minitest.rb#790 def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end # Total number of assertions. # - # source://minitest//lib/minitest.rb#739 + # source://minitest//lib/minitest.rb#750 def assertions; end # Total number of assertions. # - # source://minitest//lib/minitest.rb#739 + # source://minitest//lib/minitest.rb#750 def assertions=(_arg0); end # Total number of test cases. # - # source://minitest//lib/minitest.rb#744 + # source://minitest//lib/minitest.rb#755 def count; end # Total number of test cases. # - # source://minitest//lib/minitest.rb#744 + # source://minitest//lib/minitest.rb#755 def count=(_arg0); end # Total number of tests that erred. # - # source://minitest//lib/minitest.rb#772 + # source://minitest//lib/minitest.rb#783 def errors; end # Total number of tests that erred. # - # source://minitest//lib/minitest.rb#772 + # source://minitest//lib/minitest.rb#783 def errors=(_arg0); end # Total number of tests that failed. # - # source://minitest//lib/minitest.rb#767 + # source://minitest//lib/minitest.rb#778 def failures; end # Total number of tests that failed. # - # source://minitest//lib/minitest.rb#767 + # source://minitest//lib/minitest.rb#778 def failures=(_arg0); end # @return [Boolean] # - # source://minitest//lib/minitest.rb#792 + # source://minitest//lib/minitest.rb#803 def passed?; end - # source://minitest//lib/minitest.rb#800 + # source://minitest//lib/minitest.rb#811 def record(result); end # Report on the tracked statistics. # - # source://minitest//lib/minitest.rb#810 + # source://minitest//lib/minitest.rb#821 def report; end # An +Array+ of test cases that failed or were skipped. # - # source://minitest//lib/minitest.rb#749 + # source://minitest//lib/minitest.rb#760 def results; end # An +Array+ of test cases that failed or were skipped. # - # source://minitest//lib/minitest.rb#749 + # source://minitest//lib/minitest.rb#760 def results=(_arg0); end # Total number of tests that where skipped. # - # source://minitest//lib/minitest.rb#777 + # source://minitest//lib/minitest.rb#788 def skips; end # Total number of tests that where skipped. # - # source://minitest//lib/minitest.rb#777 + # source://minitest//lib/minitest.rb#788 def skips=(_arg0); end - # source://minitest//lib/minitest.rb#796 + # source://minitest//lib/minitest.rb#807 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#756 + # source://minitest//lib/minitest.rb#767 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#756 + # source://minitest//lib/minitest.rb#767 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#762 + # source://minitest//lib/minitest.rb#773 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#762 + # source://minitest//lib/minitest.rb#773 def total_time=(_arg0); end end @@ -1901,48 +1904,48 @@ end # plugin, pull this out of the composite and replace it with your # own. # -# source://minitest//lib/minitest.rb#830 +# source://minitest//lib/minitest.rb#841 class Minitest::SummaryReporter < ::Minitest::StatisticsReporter - # source://minitest//lib/minitest.rb#865 + # source://minitest//lib/minitest.rb#876 def aggregated_results(io); end # Returns the value of attribute old_sync. # - # source://minitest//lib/minitest.rb#833 + # source://minitest//lib/minitest.rb#844 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#833 + # source://minitest//lib/minitest.rb#844 def old_sync=(_arg0); end - # source://minitest//lib/minitest.rb#848 + # source://minitest//lib/minitest.rb#859 def report; end # :startdoc: # - # source://minitest//lib/minitest.rb#836 + # source://minitest//lib/minitest.rb#847 def start; end - # source://minitest//lib/minitest.rb#860 + # source://minitest//lib/minitest.rb#871 def statistics; end - # source://minitest//lib/minitest.rb#885 + # source://minitest//lib/minitest.rb#896 def summary; end # :stopdoc: # - # source://minitest//lib/minitest.rb#832 + # source://minitest//lib/minitest.rb#843 def sync; end # :stopdoc: # - # source://minitest//lib/minitest.rb#832 + # source://minitest//lib/minitest.rb#843 def sync=(_arg0); end - # source://minitest//lib/minitest.rb#881 + # source://minitest//lib/minitest.rb#892 def to_s; end end @@ -1985,6 +1988,15 @@ class Minitest::Test < ::Minitest::Runnable def with_info_handler(&block); end class << self + # source://minitest-focus/1.4.0/lib/minitest/focus.rb#10 + def add_to_filter(name); end + + # source://minitest-focus/1.4.0/lib/minitest/focus.rb#14 + def filtered_names; end + + # source://minitest-focus/1.4.0/lib/minitest/focus.rb#40 + def focus(name = T.unsafe(nil)); end + # Call this at the top of your tests when you absolutely # positively need to have ordered tests. In doing so, you're # admitting that you suck and your tests are weak. @@ -2025,6 +2037,9 @@ class Minitest::Test < ::Minitest::Runnable # # source://minitest//lib/minitest/test.rb#69 def runnable_methods; end + + # source://minitest-focus/1.4.0/lib/minitest/focus.rb#52 + def set_focus_trap; end end end @@ -2120,36 +2135,36 @@ 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#989 +# source://minitest//lib/minitest.rb#1001 class Minitest::UnexpectedError < ::Minitest::Assertion include ::Minitest::Compress # @return [UnexpectedError] a new instance of UnexpectedError # - # source://minitest//lib/minitest.rb#995 + # source://minitest//lib/minitest.rb#1007 def initialize(error); end - # source://minitest//lib/minitest.rb#1008 + # source://minitest//lib/minitest.rb#1020 def backtrace; end # TODO: figure out how to use `cause` instead # - # source://minitest//lib/minitest.rb#993 + # source://minitest//lib/minitest.rb#1005 def error; end # TODO: figure out how to use `cause` instead # - # source://minitest//lib/minitest.rb#993 + # source://minitest//lib/minitest.rb#1005 def error=(_arg0); end - # source://minitest//lib/minitest.rb#1014 + # source://minitest//lib/minitest.rb#1026 def message; end - # source://minitest//lib/minitest.rb#1020 + # source://minitest//lib/minitest.rb#1032 def result_label; end end -# source://minitest//lib/minitest.rb#1012 +# source://minitest//lib/minitest.rb#1024 Minitest::UnexpectedError::BASE_RE = T.let(T.unsafe(nil), Regexp) # source://minitest//lib/minitest.rb#12 diff --git a/sorbet/rbi/gems/prism@0.19.0.rbi b/sorbet/rbi/gems/prism@0.21.0.rbi similarity index 54% rename from sorbet/rbi/gems/prism@0.19.0.rbi rename to sorbet/rbi/gems/prism@0.21.0.rbi index b4e4868..7dec528 100644 --- a/sorbet/rbi/gems/prism@0.19.0.rbi +++ b/sorbet/rbi/gems/prism@0.21.0.rbi @@ -4,9 +4,18 @@ # This is an autogenerated file for types exported from the `prism` gem. # Please instead update this file by running `bin/tapioca gem prism`. +# =begin # This file is generated by the templates/template.rb script and should not be -# modified manually. See templates/lib/prism/visitor.rb.erb +# modified manually. See templates/rbi/prism.rbi.erb # if you are looking to modify the template +# =end + +# The Prism Ruby parser. +# +# "Parsing Ruby is suddenly manageable!" +# - You, hopefully +# +# source://prism//lib/prism.rb#8 module Prism class << self # Mirror the Prism.dump API by using the serialization API. @@ -27,7 +36,7 @@ module Prism # # For supported options, see Prism::parse. # - # source://prism//prism.rb#46 + # source://prism//lib/prism.rb#47 def lex_compat(source, **options); end # Mirror the Prism.lex_file API by using the serialization API. @@ -40,7 +49,7 @@ module Prism # returns the same tokens. Raises SyntaxError if the syntax in source is # invalid. # - # source://prism//prism.rb#56 + # source://prism//lib/prism.rb#57 def lex_ripper(source); end # :call-seq: @@ -48,7 +57,7 @@ module Prism # # Load the serialized AST using the source as a reference into a tree. # - # source://prism//prism.rb#64 + # source://prism//lib/prism.rb#65 def load(source, serialized); end # Mirror the Prism.parse API by using the serialization API. @@ -64,7 +73,7 @@ module Prism # # @return [Boolean] # - # source://prism//prism.rb#72 + # source://prism//lib/prism.rb#73 def parse_failure?(source, **options); end # Mirror the Prism.parse_file API by using the serialization API. This uses @@ -84,7 +93,7 @@ module Prism # # @return [Boolean] # - # source://prism//prism.rb#80 + # source://prism//lib/prism.rb#81 def parse_file_failure?(filepath, **options); end # Mirror the Prism.parse_file_success? API by using the serialization API. @@ -109,73 +118,96 @@ end # # alias $foo $bar # ^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#90 class Prism::AliasGlobalVariableNode < ::Prism::Node - # def initialize: (new_name: Node, old_name: Node, keyword_loc: Location, location: Location) -> void + # def initialize: (Node new_name, Node old_name, Location keyword_loc, Location location) -> void # # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode # - # source://prism//prism/node.rb#63 + # source://prism//lib/prism/node.rb#101 + sig do + params( + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(new_name, old_name, keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#71 + # source://prism//lib/prism/node.rb#109 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#76 + # source://prism//lib/prism/node.rb#114 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#86 + # source://prism//lib/prism/node.rb#124 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#81 + # source://prism//lib/prism/node.rb#119 def compact_child_nodes; end # def copy: (**params) -> AliasGlobalVariableNode # - # source://prism//prism/node.rb#91 + # source://prism//lib/prism/node.rb#129 + sig { params(params: T.untyped).returns(Prism::AliasGlobalVariableNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#76 + # source://prism//lib/prism/node.rb#114 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Node, old_name: Node, keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#104 + # source://prism//lib/prism/node.rb#142 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#114 + # source://prism//lib/prism/node.rb#152 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#109 + # source://prism//lib/prism/node.rb#147 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#60 + # source://prism//lib/prism/node.rb#98 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader new_name: Node # - # source://prism//prism/node.rb#54 + # source://prism//lib/prism/node.rb#92 + sig { returns(Prism::Node) } def new_name; end # attr_reader old_name: Node # - # source://prism//prism/node.rb#57 + # source://prism//lib/prism/node.rb#95 + sig { returns(Prism::Node) } def old_name; end # Sometimes you want to check an instance of a node against a list of @@ -193,7 +225,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#138 + # source://prism//lib/prism/node.rb#176 def type; end class << self @@ -204,7 +236,7 @@ class Prism::AliasGlobalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#148 + # source://prism//lib/prism/node.rb#186 def type; end end end @@ -213,73 +245,96 @@ end # # alias foo bar # ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#195 class Prism::AliasMethodNode < ::Prism::Node - # def initialize: (new_name: Node, old_name: Node, keyword_loc: Location, location: Location) -> void + # def initialize: (Node new_name, Node old_name, Location keyword_loc, Location location) -> void # # @return [AliasMethodNode] a new instance of AliasMethodNode # - # source://prism//prism/node.rb#168 + # source://prism//lib/prism/node.rb#206 + sig do + params( + new_name: Prism::Node, + old_name: Prism::Node, + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(new_name, old_name, keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#176 + # source://prism//lib/prism/node.rb#214 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#181 + # source://prism//lib/prism/node.rb#219 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#191 + # source://prism//lib/prism/node.rb#229 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#186 + # source://prism//lib/prism/node.rb#224 def compact_child_nodes; end # def copy: (**params) -> AliasMethodNode # - # source://prism//prism/node.rb#196 + # source://prism//lib/prism/node.rb#234 + sig { params(params: T.untyped).returns(Prism::AliasMethodNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#181 + # source://prism//lib/prism/node.rb#219 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { new_name: Node, old_name: Node, keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#209 + # source://prism//lib/prism/node.rb#247 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#219 + # source://prism//lib/prism/node.rb#257 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#214 + # source://prism//lib/prism/node.rb#252 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#165 + # source://prism//lib/prism/node.rb#203 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader new_name: Node # - # source://prism//prism/node.rb#159 + # source://prism//lib/prism/node.rb#197 + sig { returns(Prism::Node) } def new_name; end # attr_reader old_name: Node # - # source://prism//prism/node.rb#162 + # source://prism//lib/prism/node.rb#200 + sig { returns(Prism::Node) } def old_name; end # Sometimes you want to check an instance of a node against a list of @@ -297,7 +352,7 @@ class Prism::AliasMethodNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#243 + # source://prism//lib/prism/node.rb#281 def type; end class << self @@ -308,7 +363,7 @@ class Prism::AliasMethodNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#253 + # source://prism//lib/prism/node.rb#291 def type; end end end @@ -317,73 +372,89 @@ end # # foo => bar | baz # ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#300 class Prism::AlternationPatternNode < ::Prism::Node - # def initialize: (left: Node, right: Node, operator_loc: Location, location: Location) -> void + # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void # # @return [AlternationPatternNode] a new instance of AlternationPatternNode # - # source://prism//prism/node.rb#273 + # source://prism//lib/prism/node.rb#311 + sig { params(left: Prism::Node, right: Prism::Node, operator_loc: Prism::Location, location: Prism::Location).void } def initialize(left, right, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#281 + # source://prism//lib/prism/node.rb#319 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#286 + # source://prism//lib/prism/node.rb#324 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#296 + # source://prism//lib/prism/node.rb#334 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#291 + # source://prism//lib/prism/node.rb#329 def compact_child_nodes; end # def copy: (**params) -> AlternationPatternNode # - # source://prism//prism/node.rb#301 + # source://prism//lib/prism/node.rb#339 + sig { params(params: T.untyped).returns(Prism::AlternationPatternNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#286 + # source://prism//lib/prism/node.rb#324 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#314 + # source://prism//lib/prism/node.rb#352 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#324 + # source://prism//lib/prism/node.rb#362 def inspect(inspector = T.unsafe(nil)); end # attr_reader left: Node # - # source://prism//prism/node.rb#264 + # source://prism//lib/prism/node.rb#302 + sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//prism/node.rb#319 + # source://prism//lib/prism/node.rb#357 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#270 + # source://prism//lib/prism/node.rb#308 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader right: Node # - # source://prism//prism/node.rb#267 + # source://prism//lib/prism/node.rb#305 + sig { returns(Prism::Node) } def right; end # Sometimes you want to check an instance of a node against a list of @@ -401,7 +472,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#348 + # source://prism//lib/prism/node.rb#386 def type; end class << self @@ -412,7 +483,7 @@ class Prism::AlternationPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#358 + # source://prism//lib/prism/node.rb#396 def type; end end end @@ -421,73 +492,104 @@ end # # left and right # ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#405 class Prism::AndNode < ::Prism::Node - # def initialize: (left: Node, right: Node, operator_loc: Location, location: Location) -> void + # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void # # @return [AndNode] a new instance of AndNode # - # source://prism//prism/node.rb#378 + # source://prism//lib/prism/node.rb#431 + sig { params(left: Prism::Node, right: Prism::Node, operator_loc: Prism::Location, location: Prism::Location).void } def initialize(left, right, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#386 + # source://prism//lib/prism/node.rb#439 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#391 + # source://prism//lib/prism/node.rb#444 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#401 + # source://prism//lib/prism/node.rb#454 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#396 + # source://prism//lib/prism/node.rb#449 def compact_child_nodes; end # def copy: (**params) -> AndNode # - # source://prism//prism/node.rb#406 + # source://prism//lib/prism/node.rb#459 + sig { params(params: T.untyped).returns(Prism::AndNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#391 + # source://prism//lib/prism/node.rb#444 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#419 + # source://prism//lib/prism/node.rb#472 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#429 + # source://prism//lib/prism/node.rb#482 def inspect(inspector = T.unsafe(nil)); end - # attr_reader left: Node + # 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 and right + # ^^^^ + # + # 1 && 2 + # ^ # - # source://prism//prism/node.rb#369 + # source://prism//lib/prism/node.rb#413 + sig { returns(Prism::Node) } def left; end # def operator: () -> String # - # source://prism//prism/node.rb#424 + # source://prism//lib/prism/node.rb#477 + sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `and` keyword or the `&&` operator. + # + # left and right + # ^^^ # - # source://prism//prism/node.rb#375 + # source://prism//lib/prism/node.rb#428 + sig { returns(Prism::Location) } def operator_loc; end - # attr_reader right: Node + # 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 + # ^^^^^ # - # source://prism//prism/node.rb#372 + # 1 and 2 + # ^ + # + # source://prism//lib/prism/node.rb#422 + sig { returns(Prism::Node) } def right; end # Sometimes you want to check an instance of a node against a list of @@ -505,7 +607,7 @@ class Prism::AndNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#453 + # source://prism//lib/prism/node.rb#506 def type; end class << self @@ -516,7 +618,7 @@ class Prism::AndNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#463 + # source://prism//lib/prism/node.rb#516 def type; end end end @@ -525,65 +627,79 @@ end # # return foo, bar, baz # ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#525 class Prism::ArgumentsNode < ::Prism::Node - # def initialize: (flags: Integer, arguments: Array[Node], location: Location) -> void + # def initialize: (Integer flags, Array[Node] arguments, Location location) -> void # # @return [ArgumentsNode] a new instance of ArgumentsNode # - # source://prism//prism/node.rb#480 + # source://prism//lib/prism/node.rb#533 + sig { params(flags: Integer, arguments: T::Array[Prism::Node], location: Prism::Location).void } def initialize(flags, arguments, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#487 + # source://prism//lib/prism/node.rb#540 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader arguments: Array[Node] # - # source://prism//prism/node.rb#477 + # source://prism//lib/prism/node.rb#530 + sig { returns(T::Array[Prism::Node]) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#492 + # source://prism//lib/prism/node.rb#545 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#502 + # source://prism//lib/prism/node.rb#555 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#497 + # source://prism//lib/prism/node.rb#550 def compact_child_nodes; end # def contains_keyword_splat?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#524 + # source://prism//lib/prism/node.rb#577 + sig { returns(T::Boolean) } def contains_keyword_splat?; end # def copy: (**params) -> ArgumentsNode # - # source://prism//prism/node.rb#507 + # source://prism//lib/prism/node.rb#560 + sig { params(params: T.untyped).returns(Prism::ArgumentsNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#492 + # source://prism//lib/prism/node.rb#545 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, arguments: Array[Node], location: Location } # - # source://prism//prism/node.rb#519 + # source://prism//lib/prism/node.rb#572 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#529 + # source://prism//lib/prism/node.rb#582 def inspect(inspector = T.unsafe(nil)); end # Sometimes you want to check an instance of a node against a list of @@ -601,14 +717,15 @@ class Prism::ArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#551 + # source://prism//lib/prism/node.rb#604 def type; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#474 + # source://prism//lib/prism/node.rb#527 + sig { returns(Integer) } def flags; end class << self @@ -619,103 +736,130 @@ class Prism::ArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#561 + # source://prism//lib/prism/node.rb#614 def type; end end end # Flags for arguments nodes. +# +# source://prism//lib/prism/node.rb#17551 module Prism::ArgumentsNodeFlags; end # if arguments contain keyword splat # -# source://prism//prism/node.rb#17279 +# source://prism//lib/prism/node.rb#17553 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. +# Represents an array literal. This can be a regular array using brackets or a special array using % like %w or %i. # # [1, 2, 3] # ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#623 class Prism::ArrayNode < ::Prism::Node - # def initialize: (flags: Integer, elements: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location) -> void + # def initialize: (Integer flags, Array[Node] elements, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayNode] a new instance of ArrayNode # - # source://prism//prism/node.rb#585 + # source://prism//lib/prism/node.rb#637 + 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 + ).void + end def initialize(flags, elements, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#594 + # source://prism//lib/prism/node.rb#646 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#599 + # source://prism//lib/prism/node.rb#651 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#643 + # source://prism//lib/prism/node.rb#695 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#582 + # source://prism//lib/prism/node.rb#634 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#609 + # source://prism//lib/prism/node.rb#661 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#604 + # source://prism//lib/prism/node.rb#656 def compact_child_nodes; end # def contains_splat?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#633 + # source://prism//lib/prism/node.rb#685 + sig { returns(T::Boolean) } def contains_splat?; end # def copy: (**params) -> ArrayNode # - # source://prism//prism/node.rb#614 + # source://prism//lib/prism/node.rb#666 + sig { params(params: T.untyped).returns(Prism::ArrayNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#599 + # source://prism//lib/prism/node.rb#651 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#628 + # source://prism//lib/prism/node.rb#680 + 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 # attr_reader elements: Array[Node] # - # source://prism//prism/node.rb#576 + # source://prism//lib/prism/node.rb#628 + sig { returns(T::Array[Prism::Node]) } def elements; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#648 + # source://prism//lib/prism/node.rb#700 def inspect(inspector = T.unsafe(nil)); end # def opening: () -> String? # - # source://prism//prism/node.rb#638 + # source://prism//lib/prism/node.rb#690 + sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#579 + # source://prism//lib/prism/node.rb#631 + sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # Sometimes you want to check an instance of a node against a list of @@ -733,14 +877,15 @@ class Prism::ArrayNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#672 + # source://prism//lib/prism/node.rb#724 def type; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#573 + # source://prism//lib/prism/node.rb#625 + sig { returns(Integer) } def flags; end class << self @@ -751,17 +896,19 @@ class Prism::ArrayNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#682 + # source://prism//lib/prism/node.rb#734 def type; end end end # Flags for array nodes. +# +# source://prism//lib/prism/node.rb#17557 module Prism::ArrayNodeFlags; end # if array contains splat nodes # -# source://prism//prism/node.rb#17285 +# source://prism//lib/prism/node.rb#17559 Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # Represents an array pattern in pattern matching. @@ -780,93 +927,123 @@ Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer) # # foo in Bar[1, 2, 3] # ^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#755 class Prism::ArrayPatternNode < ::Prism::Node - # def initialize: (constant: Node?, requireds: Array[Node], rest: Node?, posts: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location) -> void + # def initialize: (Node? constant, Array[Node] requireds, Node? rest, Array[Node] posts, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [ArrayPatternNode] a new instance of ArrayPatternNode # - # source://prism//prism/node.rb#723 + # source://prism//lib/prism/node.rb#775 + 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 + ).void + end def initialize(constant, requireds, rest, posts, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#734 + # source://prism//lib/prism/node.rb#786 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#739 + # source://prism//lib/prism/node.rb#791 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#785 + # source://prism//lib/prism/node.rb#837 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#720 + # source://prism//lib/prism/node.rb#772 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#754 + # source://prism//lib/prism/node.rb#806 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#744 + # source://prism//lib/prism/node.rb#796 def compact_child_nodes; end # attr_reader constant: Node? # - # source://prism//prism/node.rb#705 + # source://prism//lib/prism/node.rb#757 + sig { returns(T.nilable(Prism::Node)) } def constant; end # def copy: (**params) -> ArrayPatternNode # - # source://prism//prism/node.rb#759 + # source://prism//lib/prism/node.rb#811 + sig { params(params: T.untyped).returns(Prism::ArrayPatternNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#739 + # source://prism//lib/prism/node.rb#791 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, requireds: Array[Node], rest: Node?, posts: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#775 + # source://prism//lib/prism/node.rb#827 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#790 + # source://prism//lib/prism/node.rb#842 def inspect(inspector = T.unsafe(nil)); end # def opening: () -> String? # - # source://prism//prism/node.rb#780 + # source://prism//lib/prism/node.rb#832 + sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#717 + # source://prism//lib/prism/node.rb#769 + sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader posts: Array[Node] # - # source://prism//prism/node.rb#714 + # source://prism//lib/prism/node.rb#766 + sig { returns(T::Array[Prism::Node]) } def posts; end # attr_reader requireds: Array[Node] # - # source://prism//prism/node.rb#708 + # source://prism//lib/prism/node.rb#760 + sig { returns(T::Array[Prism::Node]) } def requireds; end # attr_reader rest: Node? # - # source://prism//prism/node.rb#711 + # source://prism//lib/prism/node.rb#763 + sig { returns(T.nilable(Prism::Node)) } def rest; end # Sometimes you want to check an instance of a node against a list of @@ -884,7 +1061,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#825 + # source://prism//lib/prism/node.rb#877 def type; end class << self @@ -895,7 +1072,7 @@ class Prism::ArrayPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#835 + # source://prism//lib/prism/node.rb#887 def type; end end end @@ -904,68 +1081,102 @@ end # # { a => b } # ^^^^^^ +# +# source://prism//lib/prism/node.rb#896 class Prism::AssocNode < ::Prism::Node - # def initialize: (key: Node, value: Node?, operator_loc: Location?, location: Location) -> void + # def initialize: (Node key, Node value, Location? operator_loc, Location location) -> void # # @return [AssocNode] a new instance of AssocNode # - # source://prism//prism/node.rb#855 + # source://prism//lib/prism/node.rb#925 + sig do + params( + key: Prism::Node, + value: Prism::Node, + operator_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(key, value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#863 + # source://prism//lib/prism/node.rb#933 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#868 + # source://prism//lib/prism/node.rb#938 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#881 + # source://prism//lib/prism/node.rb#948 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#873 + # source://prism//lib/prism/node.rb#943 def compact_child_nodes; end # def copy: (**params) -> AssocNode # - # source://prism//prism/node.rb#886 + # source://prism//lib/prism/node.rb#953 + sig { params(params: T.untyped).returns(Prism::AssocNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#868 + # source://prism//lib/prism/node.rb#938 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { key: Node, value: Node, operator_loc: Location?, location: Location } # - # source://prism//prism/node.rb#899 + # source://prism//lib/prism/node.rb#966 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#909 + # source://prism//lib/prism/node.rb#976 def inspect(inspector = T.unsafe(nil)); end - # attr_reader key: Node + # 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). + # + # { a: b } + # ^ + # + # { foo => bar } + # ^^^ # - # source://prism//prism/node.rb#846 + # { def a; end => 1 } + # ^^^^^^^^^^ + # + # source://prism//lib/prism/node.rb#907 + sig { returns(Prism::Node) } def key; end # def operator: () -> String? # - # source://prism//prism/node.rb#904 + # source://prism//lib/prism/node.rb#971 + sig { returns(T.nilable(String)) } def operator; end - # attr_reader operator_loc: Location? + # The location of the `=>` operator, if present. # - # source://prism//prism/node.rb#852 + # { foo => bar } + # ^^ + # + # source://prism//lib/prism/node.rb#922 + sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -983,12 +1194,19 @@ class Prism::AssocNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#937 + # source://prism//lib/prism/node.rb#1000 def type; end - # attr_reader value: Node? + # 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). + # + # { foo => bar } + # ^^^ # - # source://prism//prism/node.rb#849 + # { x: 1 } + # ^ + # + # source://prism//lib/prism/node.rb#916 + sig { returns(Prism::Node) } def value; end class << self @@ -999,7 +1217,7 @@ class Prism::AssocNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#947 + # source://prism//lib/prism/node.rb#1010 def type; end end end @@ -1008,63 +1226,80 @@ end # # { **foo } # ^^^^^ +# +# source://prism//lib/prism/node.rb#1019 class Prism::AssocSplatNode < ::Prism::Node - # def initialize: (value: Node?, operator_loc: Location, location: Location) -> void + # def initialize: (Node? value, Location operator_loc, Location location) -> void # # @return [AssocSplatNode] a new instance of AssocSplatNode # - # source://prism//prism/node.rb#964 + # source://prism//lib/prism/node.rb#1033 + sig { params(value: T.nilable(Prism::Node), operator_loc: Prism::Location, location: Prism::Location).void } def initialize(value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#971 + # source://prism//lib/prism/node.rb#1040 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#976 + # source://prism//lib/prism/node.rb#1045 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#988 + # source://prism//lib/prism/node.rb#1057 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#981 + # source://prism//lib/prism/node.rb#1050 def compact_child_nodes; end # def copy: (**params) -> AssocSplatNode # - # source://prism//prism/node.rb#993 + # source://prism//lib/prism/node.rb#1062 + sig { params(params: T.untyped).returns(Prism::AssocSplatNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#976 + # source://prism//lib/prism/node.rb#1045 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#1005 + # source://prism//lib/prism/node.rb#1074 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1015 + # source://prism//lib/prism/node.rb#1084 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#1010 + # source://prism//lib/prism/node.rb#1079 + sig { returns(String) } def operator; end - # attr_reader operator_loc: Location + # The location of the `**` operator. # - # source://prism//prism/node.rb#961 + # { **x } + # ^^ + # + # source://prism//lib/prism/node.rb#1030 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -1082,12 +1317,16 @@ class Prism::AssocSplatNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1041 + # source://prism//lib/prism/node.rb#1110 def type; end - # attr_reader value: Node? + # The value to be splatted, if present. Will be missing when keyword rest argument forwarding is used. + # + # { **foo } + # ^^^ # - # source://prism//prism/node.rb#958 + # source://prism//lib/prism/node.rb#1024 + sig { returns(T.nilable(Prism::Node)) } def value; end class << self @@ -1098,67 +1337,86 @@ class Prism::AssocSplatNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1051 + # source://prism//lib/prism/node.rb#1120 def type; end end end +Prism::BACKEND = T.let(T.unsafe(nil), Symbol) + # Represents reading a reference to a field in the previous match. # # $' # ^^ +# +# source://prism//lib/prism/node.rb#1129 class Prism::BackReferenceReadNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location location) -> void # # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode # - # source://prism//prism/node.rb#1065 + # source://prism//lib/prism/node.rb#1138 + sig { params(name: Symbol, location: Prism::Location).void } def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1071 + # source://prism//lib/prism/node.rb#1144 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1076 + # source://prism//lib/prism/node.rb#1149 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1086 + # source://prism//lib/prism/node.rb#1159 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1081 + # source://prism//lib/prism/node.rb#1154 def compact_child_nodes; end # def copy: (**params) -> BackReferenceReadNode # - # source://prism//prism/node.rb#1091 + # source://prism//lib/prism/node.rb#1164 + sig { params(params: T.untyped).returns(Prism::BackReferenceReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1076 + # source://prism//lib/prism/node.rb#1149 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#1102 + # source://prism//lib/prism/node.rb#1175 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1107 + # source://prism//lib/prism/node.rb#1180 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # The name of the back-reference variable, including the leading `$`. + # + # $& # name `:$&` + # + # $+ # name `:$+` # - # source://prism//prism/node.rb#1062 + # source://prism//lib/prism/node.rb#1135 + sig { returns(Symbol) } def name; end # Sometimes you want to check an instance of a node against a list of @@ -1176,7 +1434,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1127 + # source://prism//lib/prism/node.rb#1200 def type; end class << self @@ -1187,7 +1445,7 @@ class Prism::BackReferenceReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1137 + # source://prism//lib/prism/node.rb#1210 def type; end end end @@ -1196,21 +1454,26 @@ end # methods are implemented on this visitor, so it forces the consumer to # 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 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//prism/visitor.rb#16 + # source://prism//lib/prism/visitor.rb#16 + 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//prism/visitor.rb#21 + # source://prism//lib/prism/visitor.rb#21 + 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//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::Node).void } def visit_child_nodes(node); end end @@ -1220,96 +1483,126 @@ end # foo # end # ^^^^^ +# +# source://prism//lib/prism/node.rb#1221 class Prism::BeginNode < ::Prism::Node - # def initialize: (begin_keyword_loc: Location?, statements: StatementsNode?, rescue_clause: RescueNode?, else_clause: ElseNode?, ensure_clause: EnsureNode?, end_keyword_loc: Location?, location: Location) -> void + # 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//prism/node.rb#1168 + # source://prism//lib/prism/node.rb#1241 + 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 + ).void + end def initialize(begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1179 + # source://prism//lib/prism/node.rb#1252 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def begin_keyword: () -> String? # - # source://prism//prism/node.rb#1229 + # source://prism//lib/prism/node.rb#1302 + sig { returns(T.nilable(String)) } def begin_keyword; end # attr_reader begin_keyword_loc: Location? # - # source://prism//prism/node.rb#1150 + # source://prism//lib/prism/node.rb#1223 + sig { returns(T.nilable(Prism::Location)) } def begin_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1188 + # source://prism//lib/prism/node.rb#1261 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1203 + # source://prism//lib/prism/node.rb#1276 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1193 + # source://prism//lib/prism/node.rb#1266 def compact_child_nodes; end # def copy: (**params) -> BeginNode # - # source://prism//prism/node.rb#1208 + # source://prism//lib/prism/node.rb#1281 + sig { params(params: T.untyped).returns(Prism::BeginNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1188 + # source://prism//lib/prism/node.rb#1261 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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//prism/node.rb#1224 + # source://prism//lib/prism/node.rb#1297 + 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 # attr_reader else_clause: ElseNode? # - # source://prism//prism/node.rb#1159 + # source://prism//lib/prism/node.rb#1232 + sig { returns(T.nilable(Prism::ElseNode)) } def else_clause; end # def end_keyword: () -> String? # - # source://prism//prism/node.rb#1234 + # source://prism//lib/prism/node.rb#1307 + sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//prism/node.rb#1165 + # source://prism//lib/prism/node.rb#1238 + sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # attr_reader ensure_clause: EnsureNode? # - # source://prism//prism/node.rb#1162 + # source://prism//lib/prism/node.rb#1235 + sig { returns(T.nilable(Prism::EnsureNode)) } def ensure_clause; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1239 + # source://prism//lib/prism/node.rb#1312 def inspect(inspector = T.unsafe(nil)); end # attr_reader rescue_clause: RescueNode? # - # source://prism//prism/node.rb#1156 + # source://prism//lib/prism/node.rb#1229 + sig { returns(T.nilable(Prism::RescueNode)) } def rescue_clause; end - # source://prism//prism/node.rb#1183 + # source://prism//lib/prism/node.rb#1256 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#1153 + # source://prism//lib/prism/node.rb#1226 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Sometimes you want to check an instance of a node against a list of @@ -1327,7 +1620,7 @@ class Prism::BeginNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1284 + # source://prism//lib/prism/node.rb#1357 def type; end class << self @@ -1338,7 +1631,7 @@ class Prism::BeginNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1294 + # source://prism//lib/prism/node.rb#1367 def type; end end end @@ -1347,68 +1640,83 @@ end # # bar(&args) # ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#1376 class Prism::BlockArgumentNode < ::Prism::Node - # def initialize: (expression: Node?, operator_loc: Location, location: Location) -> void + # def initialize: (Node? expression, Location operator_loc, Location location) -> void # # @return [BlockArgumentNode] a new instance of BlockArgumentNode # - # source://prism//prism/node.rb#1311 + # source://prism//lib/prism/node.rb#1384 + sig { params(expression: T.nilable(Prism::Node), operator_loc: Prism::Location, location: Prism::Location).void } def initialize(expression, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1318 + # source://prism//lib/prism/node.rb#1391 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1323 + # source://prism//lib/prism/node.rb#1396 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1335 + # source://prism//lib/prism/node.rb#1408 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1328 + # source://prism//lib/prism/node.rb#1401 def compact_child_nodes; end # def copy: (**params) -> BlockArgumentNode # - # source://prism//prism/node.rb#1340 + # source://prism//lib/prism/node.rb#1413 + sig { params(params: T.untyped).returns(Prism::BlockArgumentNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1323 + # source://prism//lib/prism/node.rb#1396 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#1352 + # source://prism//lib/prism/node.rb#1425 + 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 # attr_reader expression: Node? # - # source://prism//prism/node.rb#1305 + # source://prism//lib/prism/node.rb#1378 + sig { returns(T.nilable(Prism::Node)) } def expression; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1362 + # source://prism//lib/prism/node.rb#1435 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#1357 + # source://prism//lib/prism/node.rb#1430 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#1308 + # source://prism//lib/prism/node.rb#1381 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -1426,7 +1734,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1388 + # source://prism//lib/prism/node.rb#1461 def type; end class << self @@ -1437,7 +1745,7 @@ class Prism::BlockArgumentNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1398 + # source://prism//lib/prism/node.rb#1471 def type; end end end @@ -1446,60 +1754,81 @@ end # # a { |; b| } # ^ +# +# source://prism//lib/prism/node.rb#1480 class Prism::BlockLocalVariableNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Integer flags, Symbol name, Location location) -> void # # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode # - # source://prism//prism/node.rb#1412 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#1488 + sig { params(flags: Integer, name: Symbol, location: Prism::Location).void } + def initialize(flags, name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1418 + # source://prism//lib/prism/node.rb#1495 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1423 + # source://prism//lib/prism/node.rb#1500 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1433 + # source://prism//lib/prism/node.rb#1510 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1428 + # source://prism//lib/prism/node.rb#1505 def compact_child_nodes; end # def copy: (**params) -> BlockLocalVariableNode # - # source://prism//prism/node.rb#1438 + # source://prism//lib/prism/node.rb#1515 + sig { params(params: T.untyped).returns(Prism::BlockLocalVariableNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1423 + # source://prism//lib/prism/node.rb#1500 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } # - # source://prism//prism/node.rb#1449 + # source://prism//lib/prism/node.rb#1527 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1454 + # source://prism//lib/prism/node.rb#1537 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#1409 + # source://prism//lib/prism/node.rb#1485 + sig { returns(Symbol) } def name; end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#1532 + 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 @@ -1515,9 +1844,17 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1474 + # source://prism//lib/prism/node.rb#1559 def type; end + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#1482 + 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. @@ -1526,102 +1863,125 @@ class Prism::BlockLocalVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1484 + # source://prism//lib/prism/node.rb#1569 def type; end end end # Represents a block of ruby code. # -# [1, 2, 3].each { |i| puts x } -# ^^^^^^^^^^^^^^ +# [1, 2, 3].each { |i| puts x } +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#1578 class Prism::BlockNode < ::Prism::Node - # def initialize: (locals: Array[Symbol], locals_body_index: Integer, parameters: Node?, body: Node?, opening_loc: Location, closing_loc: Location, location: Location) -> void + # def initialize: (Array[Symbol] locals, Node? parameters, Node? body, Location opening_loc, Location closing_loc, Location location) -> void # # @return [BlockNode] a new instance of BlockNode # - # source://prism//prism/node.rb#1513 - def initialize(locals, locals_body_index, parameters, body, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#1595 + 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 + ).void + end + def initialize(locals, parameters, body, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1524 + # source://prism//lib/prism/node.rb#1605 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader body: Node? # - # source://prism//prism/node.rb#1504 + # source://prism//lib/prism/node.rb#1586 + sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1529 + # source://prism//lib/prism/node.rb#1610 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//prism/node.rb#1573 + # source://prism//lib/prism/node.rb#1653 + sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//prism/node.rb#1510 + # source://prism//lib/prism/node.rb#1592 + sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1542 + # source://prism//lib/prism/node.rb#1623 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1534 + # source://prism//lib/prism/node.rb#1615 def compact_child_nodes; end # def copy: (**params) -> BlockNode # - # source://prism//prism/node.rb#1547 + # source://prism//lib/prism/node.rb#1628 + sig { params(params: T.untyped).returns(Prism::BlockNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1529 + # source://prism//lib/prism/node.rb#1610 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], parameters: Node?, body: Node?, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#1563 + # source://prism//lib/prism/node.rb#1643 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1578 + # source://prism//lib/prism/node.rb#1658 def inspect(inspector = T.unsafe(nil)); end # attr_reader locals: Array[Symbol] # - # source://prism//prism/node.rb#1495 + # source://prism//lib/prism/node.rb#1580 + sig { returns(T::Array[Symbol]) } def locals; end - # attr_reader locals_body_index: Integer - # - # source://prism//prism/node.rb#1498 - def locals_body_index; end - # def opening: () -> String # - # source://prism//prism/node.rb#1568 + # source://prism//lib/prism/node.rb#1648 + sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#1507 + # source://prism//lib/prism/node.rb#1589 + sig { returns(Prism::Location) } def opening_loc; end # attr_reader parameters: Node? # - # source://prism//prism/node.rb#1501 + # source://prism//lib/prism/node.rb#1583 + sig { returns(T.nilable(Prism::Node)) } def parameters; end # Sometimes you want to check an instance of a node against a list of @@ -1639,7 +1999,7 @@ class Prism::BlockNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1613 + # source://prism//lib/prism/node.rb#1692 def type; end class << self @@ -1650,7 +2010,7 @@ class Prism::BlockNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1623 + # source://prism//lib/prism/node.rb#1702 def type; end end end @@ -1660,75 +2020,107 @@ end # def a(&b) # ^^ # end +# +# source://prism//lib/prism/node.rb#1712 class Prism::BlockParameterNode < ::Prism::Node - # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location) -> void + # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # # @return [BlockParameterNode] a new instance of BlockParameterNode # - # source://prism//prism/node.rb#1644 - def initialize(name, name_loc, operator_loc, location); end + # source://prism//lib/prism/node.rb#1726 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, name, name_loc, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1652 + # source://prism//lib/prism/node.rb#1735 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1657 + # source://prism//lib/prism/node.rb#1740 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1667 + # source://prism//lib/prism/node.rb#1750 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1662 + # source://prism//lib/prism/node.rb#1745 def compact_child_nodes; end # def copy: (**params) -> BlockParameterNode # - # source://prism//prism/node.rb#1672 + # source://prism//lib/prism/node.rb#1755 + sig { params(params: T.untyped).returns(Prism::BlockParameterNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1657 + # source://prism//lib/prism/node.rb#1740 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#1685 + # source://prism//lib/prism/node.rb#1769 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1695 + # source://prism//lib/prism/node.rb#1784 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol? # - # source://prism//prism/node.rb#1635 + # source://prism//lib/prism/node.rb#1717 + sig { returns(T.nilable(Symbol)) } def name; end # attr_reader name_loc: Location? # - # source://prism//prism/node.rb#1638 + # source://prism//lib/prism/node.rb#1720 + sig { returns(T.nilable(Prism::Location)) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#1690 + # source://prism//lib/prism/node.rb#1779 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#1641 + # source://prism//lib/prism/node.rb#1723 + sig { returns(Prism::Location) } def operator_loc; end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#1774 + 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 @@ -1744,9 +2136,17 @@ class Prism::BlockParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1721 + # source://prism//lib/prism/node.rb#1812 def type; end + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#1714 + 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. @@ -1755,7 +2155,7 @@ class Prism::BlockParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1731 + # source://prism//lib/prism/node.rb#1822 def type; end end end @@ -1768,83 +2168,109 @@ end # foo do |a, b = 1; local| # ^^^^^^^^^^^^^^^^^ # end +# +# source://prism//lib/prism/node.rb#1835 class Prism::BlockParametersNode < ::Prism::Node - # def initialize: (parameters: ParametersNode?, locals: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location) -> void + # def initialize: (ParametersNode? parameters, Array[Node] locals, Location? opening_loc, Location? closing_loc, Location location) -> void # # @return [BlockParametersNode] a new instance of BlockParametersNode # - # source://prism//prism/node.rb#1758 + # source://prism//lib/prism/node.rb#1849 + sig do + params( + parameters: T.nilable(Prism::ParametersNode), + locals: T::Array[Prism::Node], + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(parameters, locals, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1767 + # source://prism//lib/prism/node.rb#1858 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1772 + # source://prism//lib/prism/node.rb#1863 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#1814 + # source://prism//lib/prism/node.rb#1905 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#1755 + # source://prism//lib/prism/node.rb#1846 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1785 + # source://prism//lib/prism/node.rb#1876 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1777 + # source://prism//lib/prism/node.rb#1868 def compact_child_nodes; end # def copy: (**params) -> BlockParametersNode # - # source://prism//prism/node.rb#1790 + # source://prism//lib/prism/node.rb#1881 + sig { params(params: T.untyped).returns(Prism::BlockParametersNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1772 + # source://prism//lib/prism/node.rb#1863 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { parameters: ParametersNode?, locals: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#1804 + # source://prism//lib/prism/node.rb#1895 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1819 + # source://prism//lib/prism/node.rb#1910 def inspect(inspector = T.unsafe(nil)); end # attr_reader locals: Array[Node] # - # source://prism//prism/node.rb#1749 + # source://prism//lib/prism/node.rb#1840 + sig { returns(T::Array[Prism::Node]) } def locals; end # def opening: () -> String? # - # source://prism//prism/node.rb#1809 + # source://prism//lib/prism/node.rb#1900 + sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#1752 + # source://prism//lib/prism/node.rb#1843 + sig { returns(T.nilable(Prism::Location)) } def opening_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//prism/node.rb#1746 + # source://prism//lib/prism/node.rb#1837 + sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end # Sometimes you want to check an instance of a node against a list of @@ -1862,7 +2288,7 @@ class Prism::BlockParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1847 + # source://prism//lib/prism/node.rb#1938 def type; end class << self @@ -1873,7 +2299,7 @@ class Prism::BlockParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1857 + # source://prism//lib/prism/node.rb#1948 def type; end end end @@ -1882,68 +2308,89 @@ end # # break foo # ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#1957 class Prism::BreakNode < ::Prism::Node - # def initialize: (arguments: ArgumentsNode?, keyword_loc: Location, location: Location) -> void + # def initialize: (ArgumentsNode? arguments, Location keyword_loc, Location location) -> void # # @return [BreakNode] a new instance of BreakNode # - # source://prism//prism/node.rb#1874 + # source://prism//lib/prism/node.rb#1965 + sig do + params( + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(arguments, keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#1881 + # source://prism//lib/prism/node.rb#1972 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//prism/node.rb#1868 + # source://prism//lib/prism/node.rb#1959 + sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1886 + # source://prism//lib/prism/node.rb#1977 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#1898 + # source://prism//lib/prism/node.rb#1989 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#1891 + # source://prism//lib/prism/node.rb#1982 def compact_child_nodes; end # def copy: (**params) -> BreakNode # - # source://prism//prism/node.rb#1903 + # source://prism//lib/prism/node.rb#1994 + sig { params(params: T.untyped).returns(Prism::BreakNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#1886 + # source://prism//lib/prism/node.rb#1977 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { arguments: ArgumentsNode?, keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#1915 + # source://prism//lib/prism/node.rb#2006 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#1925 + # source://prism//lib/prism/node.rb#2016 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#1920 + # source://prism//lib/prism/node.rb#2011 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#1871 + # source://prism//lib/prism/node.rb#1962 + sig { returns(Prism::Location) } def keyword_loc; end # Sometimes you want to check an instance of a node against a list of @@ -1961,7 +2408,7 @@ class Prism::BreakNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#1951 + # source://prism//lib/prism/node.rb#2042 def type; end class << self @@ -1972,7 +2419,7 @@ class Prism::BreakNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#1961 + # source://prism//lib/prism/node.rb#2052 def type; end end end @@ -1981,107 +2428,149 @@ end # # foo.bar &&= value # ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#2061 class Prism::CallAndWriteNode < ::Prism::Node - # def initialize: (flags: Integer, receiver: Node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Node, location: Location) -> void + # 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 # # @return [CallAndWriteNode] a new instance of CallAndWriteNode # - # source://prism//prism/node.rb#1996 + # source://prism//lib/prism/node.rb#2087 + 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 + ).void + end def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2009 + # source://prism//lib/prism/node.rb#2100 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2065 + # source://prism//lib/prism/node.rb#2156 + sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//prism/node.rb#2070 + # source://prism//lib/prism/node.rb#2166 + sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#1978 + # source://prism//lib/prism/node.rb#2069 + sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2014 + # source://prism//lib/prism/node.rb#2105 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2027 + # source://prism//lib/prism/node.rb#2118 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2019 + # source://prism//lib/prism/node.rb#2110 def compact_child_nodes; end # def copy: (**params) -> CallAndWriteNode # - # source://prism//prism/node.rb#2032 + # source://prism//lib/prism/node.rb#2123 + sig { params(params: T.untyped).returns(Prism::CallAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2014 + # source://prism//lib/prism/node.rb#2105 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#2050 + # source://prism//lib/prism/node.rb#2141 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#2161 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2085 + # source://prism//lib/prism/node.rb#2181 def inspect(inspector = T.unsafe(nil)); end # def message: () -> String? # - # source://prism//prism/node.rb#2075 + # source://prism//lib/prism/node.rb#2171 + sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//prism/node.rb#1981 + # source://prism//lib/prism/node.rb#2072 + sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#2080 + # source://prism//lib/prism/node.rb#2176 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#1990 + # source://prism//lib/prism/node.rb#2081 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//prism/node.rb#1984 + # source://prism//lib/prism/node.rb#2075 + sig { returns(Symbol) } def read_name; end # attr_reader receiver: Node? # - # source://prism//prism/node.rb#1975 + # source://prism//lib/prism/node.rb#2066 + sig { returns(T.nilable(Prism::Node)) } def receiver; end # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2055 + # source://prism//lib/prism/node.rb#2146 + sig { returns(T::Boolean) } def safe_navigation?; end # Sometimes you want to check an instance of a node against a list of @@ -2099,31 +2588,35 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2119 + # source://prism//lib/prism/node.rb#2215 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#1993 + # source://prism//lib/prism/node.rb#2084 + sig { returns(Prism::Node) } def value; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2060 + # source://prism//lib/prism/node.rb#2151 + sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//prism/node.rb#1987 + # source://prism//lib/prism/node.rb#2078 + sig { returns(Symbol) } def write_name; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#1972 + # source://prism//lib/prism/node.rb#2063 + sig { returns(Integer) } def flags; end class << self @@ -2134,7 +2627,7 @@ class Prism::CallAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2129 + # source://prism//lib/prism/node.rb#2225 def type; end end end @@ -2158,127 +2651,183 @@ end # # foo&.bar # ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#2249 class Prism::CallNode < ::Prism::Node - # def initialize: (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) -> void + # 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 # # @return [CallNode] a new instance of CallNode # - # source://prism//prism/node.rb#2182 + # source://prism//lib/prism/node.rb#2287 + 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 + ).void + end def initialize(flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, block, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2196 + # source://prism//lib/prism/node.rb#2301 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//prism/node.rb#2173 + # source://prism//lib/prism/node.rb#2278 + sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2254 + # source://prism//lib/prism/node.rb#2359 + sig { returns(T::Boolean) } def attribute_write?; end # attr_reader block: Node? # - # source://prism//prism/node.rb#2179 + # source://prism//lib/prism/node.rb#2284 + sig { returns(T.nilable(Prism::Node)) } def block; end # def call_operator: () -> String? # - # source://prism//prism/node.rb#2259 + # source://prism//lib/prism/node.rb#2369 + sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#2161 + # source://prism//lib/prism/node.rb#2266 + sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2201 + # source://prism//lib/prism/node.rb#2306 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#2274 + # source://prism//lib/prism/node.rb#2384 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#2176 + # source://prism//lib/prism/node.rb#2281 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2215 + # source://prism//lib/prism/node.rb#2320 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2206 + # source://prism//lib/prism/node.rb#2311 def compact_child_nodes; end # def copy: (**params) -> CallNode # - # source://prism//prism/node.rb#2220 + # source://prism//lib/prism/node.rb#2325 + sig { params(params: T.untyped).returns(Prism::CallNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2201 + # source://prism//lib/prism/node.rb#2306 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#2239 + # source://prism//lib/prism/node.rb#2344 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#2364 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2279 + # source://prism//lib/prism/node.rb#2389 def inspect(inspector = T.unsafe(nil)); end # def message: () -> String? # - # source://prism//prism/node.rb#2264 + # source://prism//lib/prism/node.rb#2374 + sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//prism/node.rb#2167 + # source://prism//lib/prism/node.rb#2272 + sig { returns(T.nilable(Prism::Location)) } def message_loc; end # attr_reader name: Symbol # - # source://prism//prism/node.rb#2164 + # source://prism//lib/prism/node.rb#2269 + sig { returns(Symbol) } def name; end # def opening: () -> String? # - # source://prism//prism/node.rb#2269 + # source://prism//lib/prism/node.rb#2379 + sig { returns(T.nilable(String)) } def opening; end # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#2170 + # source://prism//lib/prism/node.rb#2275 + sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # attr_reader receiver: Node? + # The object that the method is being called on. This can be either `nil` or any [non-void expression](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#non-void-expression). + # + # foo.bar + # ^^^ + # + # +foo + # ^^^ # - # source://prism//prism/node.rb#2158 + # foo + bar + # ^^^ + # + # source://prism//lib/prism/node.rb#2263 + sig { returns(T.nilable(Prism::Node)) } def receiver; end # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2244 + # source://prism//lib/prism/node.rb#2349 + sig { returns(T::Boolean) } def safe_navigation?; end # Sometimes you want to check an instance of a node against a list of @@ -2296,21 +2845,23 @@ class Prism::CallNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2323 + # source://prism//lib/prism/node.rb#2433 def type; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2249 + # source://prism//lib/prism/node.rb#2354 + sig { returns(T::Boolean) } def variable_call?; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#2155 + # source://prism//lib/prism/node.rb#2251 + sig { returns(Integer) } def flags; end class << self @@ -2321,134 +2872,184 @@ class Prism::CallNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2333 + # source://prism//lib/prism/node.rb#2443 def type; end end end # Flags for call nodes. +# +# source://prism//lib/prism/node.rb#17563 module Prism::CallNodeFlags; end # a call that is an attribute write, so the value being written should be returned # -# source://prism//prism/node.rb#17297 +# source://prism//lib/prism/node.rb#17571 Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer) +# a call that ignores method visibility +# +# source://prism//lib/prism/node.rb#17574 +Prism::CallNodeFlags::IGNORE_VISIBILITY = T.let(T.unsafe(nil), Integer) + # &. operator # -# source://prism//prism/node.rb#17291 +# source://prism//lib/prism/node.rb#17565 Prism::CallNodeFlags::SAFE_NAVIGATION = T.let(T.unsafe(nil), Integer) # a call that could have been a local variable # -# source://prism//prism/node.rb#17294 +# source://prism//lib/prism/node.rb#17568 Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer) # Represents the use of an assignment operator on a call. # # foo.bar += baz # ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#2452 class Prism::CallOperatorWriteNode < ::Prism::Node - # def initialize: (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) -> void + # 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 # # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode # - # source://prism//prism/node.rb#2371 + # source://prism//lib/prism/node.rb#2481 + 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: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2385 + # source://prism//lib/prism/node.rb#2495 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2442 + # source://prism//lib/prism/node.rb#2552 + sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//prism/node.rb#2447 + # source://prism//lib/prism/node.rb#2562 + sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#2350 + # source://prism//lib/prism/node.rb#2460 + sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2390 + # source://prism//lib/prism/node.rb#2500 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2403 + # source://prism//lib/prism/node.rb#2513 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2395 + # source://prism//lib/prism/node.rb#2505 def compact_child_nodes; end # def copy: (**params) -> CallOperatorWriteNode # - # source://prism//prism/node.rb#2408 + # source://prism//lib/prism/node.rb#2518 + sig { params(params: T.untyped).returns(Prism::CallOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2390 + # source://prism//lib/prism/node.rb#2500 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#2427 + # source://prism//lib/prism/node.rb#2537 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#2557 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2457 + # source://prism//lib/prism/node.rb#2572 def inspect(inspector = T.unsafe(nil)); end # def message: () -> String? # - # source://prism//prism/node.rb#2452 + # source://prism//lib/prism/node.rb#2567 + sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//prism/node.rb#2353 + # source://prism//lib/prism/node.rb#2463 + sig { returns(T.nilable(Prism::Location)) } def message_loc; end # attr_reader operator: Symbol # - # source://prism//prism/node.rb#2362 + # source://prism//lib/prism/node.rb#2472 + sig { returns(Symbol) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#2365 + # source://prism//lib/prism/node.rb#2475 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//prism/node.rb#2356 + # source://prism//lib/prism/node.rb#2466 + sig { returns(Symbol) } def read_name; end # attr_reader receiver: Node? # - # source://prism//prism/node.rb#2347 + # source://prism//lib/prism/node.rb#2457 + sig { returns(T.nilable(Prism::Node)) } def receiver; end # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2432 + # source://prism//lib/prism/node.rb#2542 + sig { returns(T::Boolean) } def safe_navigation?; end # Sometimes you want to check an instance of a node against a list of @@ -2466,31 +3067,35 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2492 + # source://prism//lib/prism/node.rb#2607 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#2368 + # source://prism//lib/prism/node.rb#2478 + sig { returns(Prism::Node) } def value; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2437 + # source://prism//lib/prism/node.rb#2547 + sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//prism/node.rb#2359 + # source://prism//lib/prism/node.rb#2469 + sig { returns(Symbol) } def write_name; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#2344 + # source://prism//lib/prism/node.rb#2454 + sig { returns(Integer) } def flags; end class << self @@ -2501,7 +3106,7 @@ class Prism::CallOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2502 + # source://prism//lib/prism/node.rb#2617 def type; end end end @@ -2510,107 +3115,149 @@ end # # foo.bar ||= value # ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#2626 class Prism::CallOrWriteNode < ::Prism::Node - # def initialize: (flags: Integer, receiver: Node?, call_operator_loc: Location?, message_loc: Location?, read_name: Symbol, write_name: Symbol, operator_loc: Location, value: Node, location: Location) -> void + # 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 # # @return [CallOrWriteNode] a new instance of CallOrWriteNode # - # source://prism//prism/node.rb#2537 + # source://prism//lib/prism/node.rb#2652 + 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 + ).void + end def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2550 + # source://prism//lib/prism/node.rb#2665 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2606 + # source://prism//lib/prism/node.rb#2721 + sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String? # - # source://prism//prism/node.rb#2611 + # source://prism//lib/prism/node.rb#2731 + sig { returns(T.nilable(String)) } def call_operator; end # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#2519 + # source://prism//lib/prism/node.rb#2634 + sig { returns(T.nilable(Prism::Location)) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2555 + # source://prism//lib/prism/node.rb#2670 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2568 + # source://prism//lib/prism/node.rb#2683 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2560 + # source://prism//lib/prism/node.rb#2675 def compact_child_nodes; end # def copy: (**params) -> CallOrWriteNode # - # source://prism//prism/node.rb#2573 + # source://prism//lib/prism/node.rb#2688 + sig { params(params: T.untyped).returns(Prism::CallOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2555 + # source://prism//lib/prism/node.rb#2670 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#2591 + # source://prism//lib/prism/node.rb#2706 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#2726 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2626 + # source://prism//lib/prism/node.rb#2746 def inspect(inspector = T.unsafe(nil)); end # def message: () -> String? # - # source://prism//prism/node.rb#2616 + # source://prism//lib/prism/node.rb#2736 + sig { returns(T.nilable(String)) } def message; end # attr_reader message_loc: Location? # - # source://prism//prism/node.rb#2522 + # source://prism//lib/prism/node.rb#2637 + sig { returns(T.nilable(Prism::Location)) } def message_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#2621 + # source://prism//lib/prism/node.rb#2741 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#2531 + # source://prism//lib/prism/node.rb#2646 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader read_name: Symbol # - # source://prism//prism/node.rb#2525 + # source://prism//lib/prism/node.rb#2640 + sig { returns(Symbol) } def read_name; end # attr_reader receiver: Node? # - # source://prism//prism/node.rb#2516 + # source://prism//lib/prism/node.rb#2631 + sig { returns(T.nilable(Prism::Node)) } def receiver; end # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2596 + # source://prism//lib/prism/node.rb#2711 + sig { returns(T::Boolean) } def safe_navigation?; end # Sometimes you want to check an instance of a node against a list of @@ -2628,31 +3275,35 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2660 + # source://prism//lib/prism/node.rb#2780 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#2534 + # source://prism//lib/prism/node.rb#2649 + sig { returns(Prism::Node) } def value; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2601 + # source://prism//lib/prism/node.rb#2716 + sig { returns(T::Boolean) } def variable_call?; end # attr_reader write_name: Symbol # - # source://prism//prism/node.rb#2528 + # source://prism//lib/prism/node.rb#2643 + sig { returns(Symbol) } def write_name; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#2513 + # source://prism//lib/prism/node.rb#2628 + sig { returns(Integer) } def flags; end class << self @@ -2663,7 +3314,7 @@ class Prism::CallOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2670 + # source://prism//lib/prism/node.rb#2790 def type; end end end @@ -2680,97 +3331,134 @@ end # # for foo.bar in baz do end # ^^^^^^^ +# +# source://prism//lib/prism/node.rb#2807 class Prism::CallTargetNode < ::Prism::Node - # def initialize: (flags: Integer, receiver: Node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location) -> void + # def initialize: (Integer flags, Node receiver, Location call_operator_loc, Symbol name, Location message_loc, Location location) -> void # # @return [CallTargetNode] a new instance of CallTargetNode # - # source://prism//prism/node.rb#2704 + # source://prism//lib/prism/node.rb#2824 + sig do + params( + flags: Integer, + receiver: Prism::Node, + call_operator_loc: Prism::Location, + name: Symbol, + message_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(flags, receiver, call_operator_loc, name, message_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2714 + # source://prism//lib/prism/node.rb#2834 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2764 + # source://prism//lib/prism/node.rb#2884 + sig { returns(T::Boolean) } def attribute_write?; end # def call_operator: () -> String # - # source://prism//prism/node.rb#2769 + # source://prism//lib/prism/node.rb#2894 + sig { returns(String) } def call_operator; end # attr_reader call_operator_loc: Location # - # source://prism//prism/node.rb#2695 + # source://prism//lib/prism/node.rb#2815 + sig { returns(Prism::Location) } def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2719 + # source://prism//lib/prism/node.rb#2839 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2729 + # source://prism//lib/prism/node.rb#2849 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2724 + # source://prism//lib/prism/node.rb#2844 def compact_child_nodes; end # def copy: (**params) -> CallTargetNode # - # source://prism//prism/node.rb#2734 + # source://prism//lib/prism/node.rb#2854 + sig { params(params: T.untyped).returns(Prism::CallTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2719 + # source://prism//lib/prism/node.rb#2839 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location } # - # source://prism//prism/node.rb#2749 + # source://prism//lib/prism/node.rb#2869 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#2889 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2779 + # source://prism//lib/prism/node.rb#2904 def inspect(inspector = T.unsafe(nil)); end # def message: () -> String # - # source://prism//prism/node.rb#2774 + # source://prism//lib/prism/node.rb#2899 + sig { returns(String) } def message; end # attr_reader message_loc: Location # - # source://prism//prism/node.rb#2701 + # source://prism//lib/prism/node.rb#2821 + sig { returns(Prism::Location) } def message_loc; end # attr_reader name: Symbol # - # source://prism//prism/node.rb#2698 + # source://prism//lib/prism/node.rb#2818 + sig { returns(Symbol) } def name; end # attr_reader receiver: Node # - # source://prism//prism/node.rb#2692 + # source://prism//lib/prism/node.rb#2812 + sig { returns(Prism::Node) } def receiver; end # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2754 + # source://prism//lib/prism/node.rb#2874 + sig { returns(T::Boolean) } def safe_navigation?; end # Sometimes you want to check an instance of a node against a list of @@ -2788,21 +3476,23 @@ class Prism::CallTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2805 + # source://prism//lib/prism/node.rb#2930 def type; end # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#2759 + # source://prism//lib/prism/node.rb#2879 + sig { returns(T::Boolean) } def variable_call?; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#2689 + # source://prism//lib/prism/node.rb#2809 + sig { returns(Integer) } def flags; end class << self @@ -2813,7 +3503,7 @@ class Prism::CallTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2815 + # source://prism//lib/prism/node.rb#2940 def type; end end end @@ -2822,68 +3512,90 @@ end # # foo => [bar => baz] # ^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#2949 class Prism::CapturePatternNode < ::Prism::Node - # def initialize: (value: Node, target: Node, operator_loc: Location, location: Location) -> void + # def initialize: (Node value, Node target, Location operator_loc, Location location) -> void # # @return [CapturePatternNode] a new instance of CapturePatternNode # - # source://prism//prism/node.rb#2835 + # source://prism//lib/prism/node.rb#2960 + sig do + params( + value: Prism::Node, + target: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(value, target, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2843 + # source://prism//lib/prism/node.rb#2968 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2848 + # source://prism//lib/prism/node.rb#2973 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2858 + # source://prism//lib/prism/node.rb#2983 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2853 + # source://prism//lib/prism/node.rb#2978 def compact_child_nodes; end # def copy: (**params) -> CapturePatternNode # - # source://prism//prism/node.rb#2863 + # source://prism//lib/prism/node.rb#2988 + sig { params(params: T.untyped).returns(Prism::CapturePatternNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2848 + # source://prism//lib/prism/node.rb#2973 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, target: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#2876 + # source://prism//lib/prism/node.rb#3001 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#2886 + # source://prism//lib/prism/node.rb#3011 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#2881 + # source://prism//lib/prism/node.rb#3006 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#2832 + # source://prism//lib/prism/node.rb#2957 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: Node # - # source://prism//prism/node.rb#2829 + # source://prism//lib/prism/node.rb#2954 + sig { returns(Prism::Node) } def target; end # Sometimes you want to check an instance of a node against a list of @@ -2901,12 +3613,13 @@ class Prism::CapturePatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#2910 + # source://prism//lib/prism/node.rb#3035 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#2826 + # source://prism//lib/prism/node.rb#2951 + sig { returns(Prism::Node) } def value; end class << self @@ -2917,7 +3630,7 @@ class Prism::CapturePatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#2920 + # source://prism//lib/prism/node.rb#3045 def type; end end end @@ -2928,88 +3641,116 @@ end # in false # end # ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3056 class Prism::CaseMatchNode < ::Prism::Node - # def initialize: (predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location) -> void + # def initialize: (Node? predicate, Array[Node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseMatchNode] a new instance of CaseMatchNode # - # source://prism//prism/node.rb#2948 + # source://prism//lib/prism/node.rb#3073 + 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 + ).void + end def initialize(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#2958 + # source://prism//lib/prism/node.rb#3083 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//prism/node.rb#3002 + # source://prism//lib/prism/node.rb#3127 + sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//prism/node.rb#2942 + # source://prism//lib/prism/node.rb#3067 + sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2963 + # source://prism//lib/prism/node.rb#3088 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#2977 + # source://prism//lib/prism/node.rb#3102 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#2968 + # source://prism//lib/prism/node.rb#3093 def compact_child_nodes; end # attr_reader conditions: Array[Node] # - # source://prism//prism/node.rb#2936 + # source://prism//lib/prism/node.rb#3061 + sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//prism/node.rb#2939 + # source://prism//lib/prism/node.rb#3064 + sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (**params) -> CaseMatchNode # - # source://prism//prism/node.rb#2982 + # source://prism//lib/prism/node.rb#3107 + sig { params(params: T.untyped).returns(Prism::CaseMatchNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#2963 + # source://prism//lib/prism/node.rb#3088 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#2997 + # source://prism//lib/prism/node.rb#3122 + 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 end_keyword: () -> String # - # source://prism//prism/node.rb#3007 + # source://prism//lib/prism/node.rb#3132 + sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//prism/node.rb#2945 + # source://prism//lib/prism/node.rb#3070 + sig { returns(Prism::Location) } def end_keyword_loc; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3012 + # source://prism//lib/prism/node.rb#3137 def inspect(inspector = T.unsafe(nil)); end # attr_reader predicate: Node? # - # source://prism//prism/node.rb#2933 + # source://prism//lib/prism/node.rb#3058 + sig { returns(T.nilable(Prism::Node)) } def predicate; end # Sometimes you want to check an instance of a node against a list of @@ -3027,7 +3768,7 @@ class Prism::CaseMatchNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3046 + # source://prism//lib/prism/node.rb#3171 def type; end class << self @@ -3038,7 +3779,7 @@ class Prism::CaseMatchNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3056 + # source://prism//lib/prism/node.rb#3181 def type; end end end @@ -3049,88 +3790,116 @@ end # when false # end # ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3192 class Prism::CaseNode < ::Prism::Node - # def initialize: (predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location) -> void + # def initialize: (Node? predicate, Array[Node] conditions, ElseNode? consequent, Location case_keyword_loc, Location end_keyword_loc, Location location) -> void # # @return [CaseNode] a new instance of CaseNode # - # source://prism//prism/node.rb#3084 + # source://prism//lib/prism/node.rb#3209 + 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 + ).void + end def initialize(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3094 + # source://prism//lib/prism/node.rb#3219 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def case_keyword: () -> String # - # source://prism//prism/node.rb#3138 + # source://prism//lib/prism/node.rb#3263 + sig { returns(String) } def case_keyword; end # attr_reader case_keyword_loc: Location # - # source://prism//prism/node.rb#3078 + # source://prism//lib/prism/node.rb#3203 + sig { returns(Prism::Location) } def case_keyword_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3099 + # source://prism//lib/prism/node.rb#3224 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3113 + # source://prism//lib/prism/node.rb#3238 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3104 + # source://prism//lib/prism/node.rb#3229 def compact_child_nodes; end # attr_reader conditions: Array[Node] # - # source://prism//prism/node.rb#3072 + # source://prism//lib/prism/node.rb#3197 + sig { returns(T::Array[Prism::Node]) } def conditions; end # attr_reader consequent: ElseNode? # - # source://prism//prism/node.rb#3075 + # source://prism//lib/prism/node.rb#3200 + sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (**params) -> CaseNode # - # source://prism//prism/node.rb#3118 + # source://prism//lib/prism/node.rb#3243 + sig { params(params: T.untyped).returns(Prism::CaseNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3099 + # source://prism//lib/prism/node.rb#3224 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { predicate: Node?, conditions: Array[Node], consequent: ElseNode?, case_keyword_loc: Location, end_keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#3133 + # source://prism//lib/prism/node.rb#3258 + 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 end_keyword: () -> String # - # source://prism//prism/node.rb#3143 + # source://prism//lib/prism/node.rb#3268 + sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//prism/node.rb#3081 + # source://prism//lib/prism/node.rb#3206 + sig { returns(Prism::Location) } def end_keyword_loc; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3148 + # source://prism//lib/prism/node.rb#3273 def inspect(inspector = T.unsafe(nil)); end # attr_reader predicate: Node? # - # source://prism//prism/node.rb#3069 + # source://prism//lib/prism/node.rb#3194 + sig { returns(T.nilable(Prism::Node)) } def predicate; end # Sometimes you want to check an instance of a node against a list of @@ -3148,7 +3917,7 @@ class Prism::CaseNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3182 + # source://prism//lib/prism/node.rb#3307 def type; end class << self @@ -3159,7 +3928,7 @@ class Prism::CaseNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3192 + # source://prism//lib/prism/node.rb#3317 def type; end end end @@ -3168,108 +3937,143 @@ end # # class Foo end # ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3326 class Prism::ClassNode < ::Prism::Node - # def initialize: (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) -> void + # 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 # # @return [ClassNode] a new instance of ClassNode # - # source://prism//prism/node.rb#3227 + # source://prism//lib/prism/node.rb#3352 + 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 + ).void + end def initialize(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3240 + # source://prism//lib/prism/node.rb#3365 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader body: Node? # - # source://prism//prism/node.rb#3218 + # source://prism//lib/prism/node.rb#3343 + sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3245 + # source://prism//lib/prism/node.rb#3370 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def class_keyword: () -> String # - # source://prism//prism/node.rb#3287 + # source://prism//lib/prism/node.rb#3412 + sig { returns(String) } def class_keyword; end # attr_reader class_keyword_loc: Location # - # source://prism//prism/node.rb#3206 + # source://prism//lib/prism/node.rb#3331 + sig { returns(Prism::Location) } def class_keyword_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3259 + # source://prism//lib/prism/node.rb#3384 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3250 + # source://prism//lib/prism/node.rb#3375 def compact_child_nodes; end # attr_reader constant_path: Node # - # source://prism//prism/node.rb#3209 + # source://prism//lib/prism/node.rb#3334 + sig { returns(Prism::Node) } def constant_path; end # def copy: (**params) -> ClassNode # - # source://prism//prism/node.rb#3264 + # source://prism//lib/prism/node.rb#3389 + sig { params(params: T.untyped).returns(Prism::ClassNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3245 + # source://prism//lib/prism/node.rb#3370 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#3282 + # source://prism//lib/prism/node.rb#3407 + 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 end_keyword: () -> String # - # source://prism//prism/node.rb#3297 + # source://prism//lib/prism/node.rb#3422 + sig { returns(String) } def end_keyword; end # attr_reader end_keyword_loc: Location # - # source://prism//prism/node.rb#3221 + # source://prism//lib/prism/node.rb#3346 + sig { returns(Prism::Location) } def end_keyword_loc; end # def inheritance_operator: () -> String? # - # source://prism//prism/node.rb#3292 + # source://prism//lib/prism/node.rb#3417 + sig { returns(T.nilable(String)) } def inheritance_operator; end # attr_reader inheritance_operator_loc: Location? # - # source://prism//prism/node.rb#3212 + # source://prism//lib/prism/node.rb#3337 + sig { returns(T.nilable(Prism::Location)) } def inheritance_operator_loc; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3302 + # source://prism//lib/prism/node.rb#3427 def inspect(inspector = T.unsafe(nil)); end # attr_reader locals: Array[Symbol] # - # source://prism//prism/node.rb#3203 + # source://prism//lib/prism/node.rb#3328 + sig { returns(T::Array[Symbol]) } def locals; end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3224 + # source://prism//lib/prism/node.rb#3349 + sig { returns(Symbol) } def name; end # attr_reader superclass: Node? # - # source://prism//prism/node.rb#3215 + # source://prism//lib/prism/node.rb#3340 + sig { returns(T.nilable(Prism::Node)) } def superclass; end # Sometimes you want to check an instance of a node against a list of @@ -3287,7 +4091,7 @@ class Prism::ClassNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3340 + # source://prism//lib/prism/node.rb#3465 def type; end class << self @@ -3298,7 +4102,7 @@ class Prism::ClassNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3350 + # source://prism//lib/prism/node.rb#3475 def type; end end end @@ -3307,73 +4111,97 @@ end # # @@target &&= value # ^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3484 class Prism::ClassVariableAndWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode # - # source://prism//prism/node.rb#3373 + # source://prism//lib/prism/node.rb#3498 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3382 + # source://prism//lib/prism/node.rb#3507 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3387 + # source://prism//lib/prism/node.rb#3512 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3397 + # source://prism//lib/prism/node.rb#3522 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3392 + # source://prism//lib/prism/node.rb#3517 def compact_child_nodes; end # def copy: (**params) -> ClassVariableAndWriteNode # - # source://prism//prism/node.rb#3402 + # source://prism//lib/prism/node.rb#3527 + sig { params(params: T.untyped).returns(Prism::ClassVariableAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3387 + # source://prism//lib/prism/node.rb#3512 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#3416 + # source://prism//lib/prism/node.rb#3541 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3426 + # source://prism//lib/prism/node.rb#3551 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3361 + # source://prism//lib/prism/node.rb#3486 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#3364 + # source://prism//lib/prism/node.rb#3489 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#3421 + # source://prism//lib/prism/node.rb#3546 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#3367 + # source://prism//lib/prism/node.rb#3492 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -3391,12 +4219,13 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3450 + # source://prism//lib/prism/node.rb#3575 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#3370 + # source://prism//lib/prism/node.rb#3495 + sig { returns(Prism::Node) } def value; end class << self @@ -3407,7 +4236,7 @@ class Prism::ClassVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3460 + # source://prism//lib/prism/node.rb#3585 def type; end end end @@ -3416,73 +4245,98 @@ end # # @@target += value # ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3594 class Prism::ClassVariableOperatorWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void # # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode # - # source://prism//prism/node.rb#3486 + # source://prism//lib/prism/node.rb#3611 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + operator: Symbol, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, operator, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3496 + # source://prism//lib/prism/node.rb#3621 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3501 + # source://prism//lib/prism/node.rb#3626 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3511 + # source://prism//lib/prism/node.rb#3636 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3506 + # source://prism//lib/prism/node.rb#3631 def compact_child_nodes; end # def copy: (**params) -> ClassVariableOperatorWriteNode # - # source://prism//prism/node.rb#3516 + # source://prism//lib/prism/node.rb#3641 + sig { params(params: T.untyped).returns(Prism::ClassVariableOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3501 + # source://prism//lib/prism/node.rb#3626 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } # - # source://prism//prism/node.rb#3531 + # source://prism//lib/prism/node.rb#3656 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3536 + # source://prism//lib/prism/node.rb#3661 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3471 + # source://prism//lib/prism/node.rb#3596 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#3474 + # source://prism//lib/prism/node.rb#3599 + sig { returns(Prism::Location) } def name_loc; end # attr_reader operator: Symbol # - # source://prism//prism/node.rb#3483 + # source://prism//lib/prism/node.rb#3608 + sig { returns(Symbol) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#3477 + # source://prism//lib/prism/node.rb#3602 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -3500,12 +4354,13 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3561 + # source://prism//lib/prism/node.rb#3686 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#3480 + # source://prism//lib/prism/node.rb#3605 + sig { returns(Prism::Node) } def value; end class << self @@ -3516,7 +4371,7 @@ class Prism::ClassVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3571 + # source://prism//lib/prism/node.rb#3696 def type; end end end @@ -3525,73 +4380,97 @@ end # # @@target ||= value # ^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3705 class Prism::ClassVariableOrWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode # - # source://prism//prism/node.rb#3594 + # source://prism//lib/prism/node.rb#3719 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3603 + # source://prism//lib/prism/node.rb#3728 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3608 + # source://prism//lib/prism/node.rb#3733 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3618 + # source://prism//lib/prism/node.rb#3743 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3613 + # source://prism//lib/prism/node.rb#3738 def compact_child_nodes; end # def copy: (**params) -> ClassVariableOrWriteNode # - # source://prism//prism/node.rb#3623 + # source://prism//lib/prism/node.rb#3748 + sig { params(params: T.untyped).returns(Prism::ClassVariableOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3608 + # source://prism//lib/prism/node.rb#3733 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#3637 + # source://prism//lib/prism/node.rb#3762 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3647 + # source://prism//lib/prism/node.rb#3772 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3582 + # source://prism//lib/prism/node.rb#3707 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#3585 + # source://prism//lib/prism/node.rb#3710 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#3642 + # source://prism//lib/prism/node.rb#3767 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#3588 + # source://prism//lib/prism/node.rb#3713 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -3609,12 +4488,13 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3671 + # source://prism//lib/prism/node.rb#3796 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#3591 + # source://prism//lib/prism/node.rb#3716 + sig { returns(Prism::Node) } def value; end class << self @@ -3625,7 +4505,7 @@ class Prism::ClassVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3681 + # source://prism//lib/prism/node.rb#3806 def type; end end end @@ -3634,58 +4514,75 @@ end # # @@foo # ^^^^^ +# +# source://prism//lib/prism/node.rb#3815 class Prism::ClassVariableReadNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location location) -> void # # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode # - # source://prism//prism/node.rb#3695 + # source://prism//lib/prism/node.rb#3824 + sig { params(name: Symbol, location: Prism::Location).void } def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3701 + # source://prism//lib/prism/node.rb#3830 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3706 + # source://prism//lib/prism/node.rb#3835 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3716 + # source://prism//lib/prism/node.rb#3845 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3711 + # source://prism//lib/prism/node.rb#3840 def compact_child_nodes; end # def copy: (**params) -> ClassVariableReadNode # - # source://prism//prism/node.rb#3721 + # source://prism//lib/prism/node.rb#3850 + sig { params(params: T.untyped).returns(Prism::ClassVariableReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3706 + # source://prism//lib/prism/node.rb#3835 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#3732 + # source://prism//lib/prism/node.rb#3861 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3737 + # source://prism//lib/prism/node.rb#3866 def inspect(inspector = T.unsafe(nil)); 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). + # + # @@abc # name `:@@abc` # - # source://prism//prism/node.rb#3692 + # @@_test # name `:@@_test` + # + # source://prism//lib/prism/node.rb#3821 + sig { returns(Symbol) } def name; end # Sometimes you want to check an instance of a node against a list of @@ -3703,7 +4600,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3757 + # source://prism//lib/prism/node.rb#3886 def type; end class << self @@ -3714,7 +4611,7 @@ class Prism::ClassVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3767 + # source://prism//lib/prism/node.rb#3896 def type; end end end @@ -3723,58 +4620,71 @@ end # # @@foo, @@bar = baz # ^^^^^ ^^^^^ +# +# source://prism//lib/prism/node.rb#3905 class Prism::ClassVariableTargetNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location location) -> void # # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode # - # source://prism//prism/node.rb#3781 + # source://prism//lib/prism/node.rb#3910 + sig { params(name: Symbol, location: Prism::Location).void } def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3787 + # source://prism//lib/prism/node.rb#3916 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3792 + # source://prism//lib/prism/node.rb#3921 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3802 + # source://prism//lib/prism/node.rb#3931 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3797 + # source://prism//lib/prism/node.rb#3926 def compact_child_nodes; end # def copy: (**params) -> ClassVariableTargetNode # - # source://prism//prism/node.rb#3807 + # source://prism//lib/prism/node.rb#3936 + sig { params(params: T.untyped).returns(Prism::ClassVariableTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3792 + # source://prism//lib/prism/node.rb#3921 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#3818 + # source://prism//lib/prism/node.rb#3947 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3823 + # source://prism//lib/prism/node.rb#3952 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3778 + # source://prism//lib/prism/node.rb#3907 + sig { returns(Symbol) } def name; end # Sometimes you want to check an instance of a node against a list of @@ -3792,7 +4702,7 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3843 + # source://prism//lib/prism/node.rb#3972 def type; end class << self @@ -3803,7 +4713,7 @@ class Prism::ClassVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3853 + # source://prism//lib/prism/node.rb#3982 def type; end end end @@ -3812,73 +4722,97 @@ end # # @@foo = 1 # ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#3991 class Prism::ClassVariableWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location?, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Node value, Location? operator_loc, Location location) -> void # # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode # - # source://prism//prism/node.rb#3876 + # source://prism//lib/prism/node.rb#4005 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end def initialize(name, name_loc, value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3885 + # source://prism//lib/prism/node.rb#4014 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3890 + # source://prism//lib/prism/node.rb#4019 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#3900 + # source://prism//lib/prism/node.rb#4029 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#3895 + # source://prism//lib/prism/node.rb#4024 def compact_child_nodes; end # def copy: (**params) -> ClassVariableWriteNode # - # source://prism//prism/node.rb#3905 + # source://prism//lib/prism/node.rb#4034 + sig { params(params: T.untyped).returns(Prism::ClassVariableWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#3890 + # source://prism//lib/prism/node.rb#4019 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location?, location: Location } # - # source://prism//prism/node.rb#3919 + # source://prism//lib/prism/node.rb#4048 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#3929 + # source://prism//lib/prism/node.rb#4058 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3864 + # source://prism//lib/prism/node.rb#3993 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#3867 + # source://prism//lib/prism/node.rb#3996 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String? # - # source://prism//prism/node.rb#3924 + # source://prism//lib/prism/node.rb#4053 + sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//prism/node.rb#3873 + # source://prism//lib/prism/node.rb#4002 + sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -3896,12 +4830,13 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#3953 + # source://prism//lib/prism/node.rb#4082 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#3870 + # source://prism//lib/prism/node.rb#3999 + sig { returns(Prism::Node) } def value; end class << self @@ -3912,30 +4847,36 @@ class Prism::ClassVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#3963 + # source://prism//lib/prism/node.rb#4092 def type; end end end # This represents a comment that was encountered during parsing. It is the # base class for all comment types. +# +# source://prism//lib/prism/parse_result.rb#228 class Prism::Comment # Create a new comment object with the given location. # # @return [Comment] a new instance of Comment # - # source://prism//prism/parse_result.rb#233 + # source://prism//lib/prism/parse_result.rb#233 def initialize(location); end # Implement the hash pattern matching interface for Comment. # - # source://prism//prism/parse_result.rb#238 + # source://prism//lib/prism/parse_result.rb#238 def deconstruct_keys(keys); end # The location of this comment in the source. # - # source://prism//prism/parse_result.rb#230 + # source://prism//lib/prism/parse_result.rb#230 + sig { returns(Prism::Location) } def location; end + + sig { returns(T::Boolean) } + def trailing?; end end # A compiler is a visitor that returns the value of each node as it visits. @@ -3954,908 +4895,910 @@ end # # Prism.parse("1 + 2").value.accept(SExpressions.new) # # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]] +# +# source://prism//lib/prism/compiler.rb#26 class Prism::Compiler # Visit an individual node. # - # source://prism//prism/compiler.rb#28 + # source://prism//lib/prism/compiler.rb#28 def visit(node); end # Visit the child nodes of the given node. # Compile a AliasGlobalVariableNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_alias_global_variable_node(node); end # Visit the child nodes of the given node. # Compile a AliasMethodNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_alias_method_node(node); end # Visit a list of nodes. # - # source://prism//prism/compiler.rb#33 + # source://prism//lib/prism/compiler.rb#33 def visit_all(nodes); end # Visit the child nodes of the given node. # Compile a AlternationPatternNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_alternation_pattern_node(node); end # Visit the child nodes of the given node. # Compile a AndNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_and_node(node); end # Visit the child nodes of the given node. # Compile a ArgumentsNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_arguments_node(node); end # Visit the child nodes of the given node. # Compile a ArrayNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_array_node(node); end # Visit the child nodes of the given node. # Compile a ArrayPatternNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_array_pattern_node(node); end # Visit the child nodes of the given node. # Compile a AssocNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_assoc_node(node); end # Visit the child nodes of the given node. # Compile a AssocSplatNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_assoc_splat_node(node); end # Visit the child nodes of the given node. # Compile a BackReferenceReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_back_reference_read_node(node); end # Visit the child nodes of the given node. # Compile a BeginNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_begin_node(node); end # Visit the child nodes of the given node. # Compile a BlockArgumentNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_block_argument_node(node); end # Visit the child nodes of the given node. # Compile a BlockLocalVariableNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_block_local_variable_node(node); end # Visit the child nodes of the given node. # Compile a BlockNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_block_node(node); end # Visit the child nodes of the given node. # Compile a BlockParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_block_parameter_node(node); end # Visit the child nodes of the given node. # Compile a BlockParametersNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_block_parameters_node(node); end # Visit the child nodes of the given node. # Compile a BreakNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_break_node(node); end # Visit the child nodes of the given node. # Compile a CallAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_call_and_write_node(node); end # Visit the child nodes of the given node. # Compile a CallNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_call_node(node); end # Visit the child nodes of the given node. # Compile a CallOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_call_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a CallOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_call_or_write_node(node); end # Visit the child nodes of the given node. # Compile a CallTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_call_target_node(node); end # Visit the child nodes of the given node. # Compile a CapturePatternNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_capture_pattern_node(node); end # Visit the child nodes of the given node. # Compile a CaseMatchNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_case_match_node(node); end # Visit the child nodes of the given node. # Compile a CaseNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_case_node(node); end # Visit the child nodes of the given node. # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_child_nodes(node); end # Visit the child nodes of the given node. # Compile a ClassNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_and_write_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_or_write_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_read_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_target_node(node); end # Visit the child nodes of the given node. # Compile a ClassVariableWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_class_variable_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_and_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_or_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_and_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_or_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_target_node(node); end # Visit the child nodes of the given node. # Compile a ConstantPathWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_path_write_node(node); end # Visit the child nodes of the given node. # Compile a ConstantReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_read_node(node); end # Visit the child nodes of the given node. # Compile a ConstantTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_target_node(node); end # Visit the child nodes of the given node. # Compile a ConstantWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_constant_write_node(node); end # Visit the child nodes of the given node. # Compile a DefNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_def_node(node); end # Visit the child nodes of the given node. # Compile a DefinedNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_defined_node(node); end # Visit the child nodes of the given node. # Compile a ElseNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_else_node(node); end # Visit the child nodes of the given node. # Compile a EmbeddedStatementsNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_embedded_statements_node(node); end # Visit the child nodes of the given node. # Compile a EmbeddedVariableNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_embedded_variable_node(node); end # Visit the child nodes of the given node. # Compile a EnsureNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_ensure_node(node); end # Visit the child nodes of the given node. # Compile a FalseNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_false_node(node); end # Visit the child nodes of the given node. # Compile a FindPatternNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_find_pattern_node(node); end # Visit the child nodes of the given node. # Compile a FlipFlopNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_flip_flop_node(node); end # Visit the child nodes of the given node. # Compile a FloatNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_float_node(node); end # Visit the child nodes of the given node. # Compile a ForNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_for_node(node); end # Visit the child nodes of the given node. # Compile a ForwardingArgumentsNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_forwarding_arguments_node(node); end # Visit the child nodes of the given node. # Compile a ForwardingParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_forwarding_parameter_node(node); end # Visit the child nodes of the given node. # Compile a ForwardingSuperNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_forwarding_super_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_and_write_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_or_write_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_read_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_target_node(node); end # Visit the child nodes of the given node. # Compile a GlobalVariableWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_global_variable_write_node(node); end # Visit the child nodes of the given node. # Compile a HashNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_hash_node(node); end # Visit the child nodes of the given node. # Compile a HashPatternNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_hash_pattern_node(node); end # Visit the child nodes of the given node. # Compile a IfNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_if_node(node); end # Visit the child nodes of the given node. # Compile a ImaginaryNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_imaginary_node(node); end # Visit the child nodes of the given node. # Compile a ImplicitNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_implicit_node(node); end # Visit the child nodes of the given node. # Compile a ImplicitRestNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_implicit_rest_node(node); end # Visit the child nodes of the given node. # Compile a InNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_in_node(node); end # Visit the child nodes of the given node. # Compile a IndexAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_index_and_write_node(node); end # Visit the child nodes of the given node. # Compile a IndexOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_index_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a IndexOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_index_or_write_node(node); end # Visit the child nodes of the given node. # Compile a IndexTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_index_target_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_and_write_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_or_write_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_read_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_target_node(node); end # Visit the child nodes of the given node. # Compile a InstanceVariableWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_instance_variable_write_node(node); end # Visit the child nodes of the given node. # Compile a IntegerNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_integer_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedMatchLastLineNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_interpolated_match_last_line_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedRegularExpressionNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_interpolated_regular_expression_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedStringNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_interpolated_string_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedSymbolNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_interpolated_symbol_node(node); end # Visit the child nodes of the given node. # Compile a InterpolatedXStringNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_interpolated_x_string_node(node); end # Visit the child nodes of the given node. # Compile a KeywordHashNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_keyword_hash_node(node); end # Visit the child nodes of the given node. # Compile a KeywordRestParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_keyword_rest_parameter_node(node); end # Visit the child nodes of the given node. # Compile a LambdaNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_lambda_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableAndWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_and_write_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableOperatorWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_operator_write_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableOrWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_or_write_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_read_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_target_node(node); end # Visit the child nodes of the given node. # Compile a LocalVariableWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_local_variable_write_node(node); end # Visit the child nodes of the given node. # Compile a MatchLastLineNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_match_last_line_node(node); end # Visit the child nodes of the given node. # Compile a MatchPredicateNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_match_predicate_node(node); end # Visit the child nodes of the given node. # Compile a MatchRequiredNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_match_required_node(node); end # Visit the child nodes of the given node. # Compile a MatchWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_match_write_node(node); end # Visit the child nodes of the given node. # Compile a MissingNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_missing_node(node); end # Visit the child nodes of the given node. # Compile a ModuleNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_module_node(node); end # Visit the child nodes of the given node. # Compile a MultiTargetNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_multi_target_node(node); end # Visit the child nodes of the given node. # Compile a MultiWriteNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_multi_write_node(node); end # Visit the child nodes of the given node. # Compile a NextNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_next_node(node); end # Visit the child nodes of the given node. # Compile a NilNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_nil_node(node); end # Visit the child nodes of the given node. # Compile a NoKeywordsParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_no_keywords_parameter_node(node); end # Visit the child nodes of the given node. # Compile a NumberedParametersNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_numbered_parameters_node(node); end # Visit the child nodes of the given node. # Compile a NumberedReferenceReadNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_numbered_reference_read_node(node); end # Visit the child nodes of the given node. # Compile a OptionalKeywordParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_optional_keyword_parameter_node(node); end # Visit the child nodes of the given node. # Compile a OptionalParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_optional_parameter_node(node); end # Visit the child nodes of the given node. # Compile a OrNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_or_node(node); end # Visit the child nodes of the given node. # Compile a ParametersNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_parameters_node(node); end # Visit the child nodes of the given node. # Compile a ParenthesesNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_parentheses_node(node); end # Visit the child nodes of the given node. # Compile a PinnedExpressionNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_pinned_expression_node(node); end # Visit the child nodes of the given node. # Compile a PinnedVariableNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_pinned_variable_node(node); end # Visit the child nodes of the given node. # Compile a PostExecutionNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_post_execution_node(node); end # Visit the child nodes of the given node. # Compile a PreExecutionNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_pre_execution_node(node); end # Visit the child nodes of the given node. # Compile a ProgramNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_program_node(node); end # Visit the child nodes of the given node. # Compile a RangeNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_range_node(node); end # Visit the child nodes of the given node. # Compile a RationalNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_rational_node(node); end # Visit the child nodes of the given node. # Compile a RedoNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_redo_node(node); end # Visit the child nodes of the given node. # Compile a RegularExpressionNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_regular_expression_node(node); end # Visit the child nodes of the given node. # Compile a RequiredKeywordParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_required_keyword_parameter_node(node); end # Visit the child nodes of the given node. # Compile a RequiredParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_required_parameter_node(node); end # Visit the child nodes of the given node. # Compile a RescueModifierNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_rescue_modifier_node(node); end # Visit the child nodes of the given node. # Compile a RescueNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_rescue_node(node); end # Visit the child nodes of the given node. # Compile a RestParameterNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_rest_parameter_node(node); end # Visit the child nodes of the given node. # Compile a RetryNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_retry_node(node); end # Visit the child nodes of the given node. # Compile a ReturnNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_return_node(node); end # Visit the child nodes of the given node. # Compile a SelfNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_self_node(node); end # Visit the child nodes of the given node. # Compile a SingletonClassNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_singleton_class_node(node); end # Visit the child nodes of the given node. # Compile a SourceEncodingNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_source_encoding_node(node); end # Visit the child nodes of the given node. # Compile a SourceFileNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_source_file_node(node); end # Visit the child nodes of the given node. # Compile a SourceLineNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_source_line_node(node); end # Visit the child nodes of the given node. # Compile a SplatNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_splat_node(node); end # Visit the child nodes of the given node. # Compile a StatementsNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_statements_node(node); end # Visit the child nodes of the given node. # Compile a StringNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_string_node(node); end # Visit the child nodes of the given node. # Compile a SuperNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_super_node(node); end # Visit the child nodes of the given node. # Compile a SymbolNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_symbol_node(node); end # Visit the child nodes of the given node. # Compile a TrueNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_true_node(node); end # Visit the child nodes of the given node. # Compile a UndefNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_undef_node(node); end # Visit the child nodes of the given node. # Compile a UnlessNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_unless_node(node); end # Visit the child nodes of the given node. # Compile a UntilNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_until_node(node); end # Visit the child nodes of the given node. # Compile a WhenNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_when_node(node); end # Visit the child nodes of the given node. # Compile a WhileNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_while_node(node); end # Visit the child nodes of the given node. # Compile a XStringNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_x_string_node(node); end # Visit the child nodes of the given node. # Compile a YieldNode node # - # source://prism//prism/compiler.rb#38 + # source://prism//lib/prism/compiler.rb#38 def visit_yield_node(node); end end @@ -4863,73 +5806,97 @@ end # # Target &&= value # ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4101 class Prism::ConstantAndWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode # - # source://prism//prism/node.rb#3986 + # source://prism//lib/prism/node.rb#4115 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#3995 + # source://prism//lib/prism/node.rb#4124 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4000 + # source://prism//lib/prism/node.rb#4129 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4010 + # source://prism//lib/prism/node.rb#4139 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4005 + # source://prism//lib/prism/node.rb#4134 def compact_child_nodes; end # def copy: (**params) -> ConstantAndWriteNode # - # source://prism//prism/node.rb#4015 + # source://prism//lib/prism/node.rb#4144 + sig { params(params: T.untyped).returns(Prism::ConstantAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4000 + # source://prism//lib/prism/node.rb#4129 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#4029 + # source://prism//lib/prism/node.rb#4158 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4039 + # source://prism//lib/prism/node.rb#4168 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#3974 + # source://prism//lib/prism/node.rb#4103 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#3977 + # source://prism//lib/prism/node.rb#4106 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#4034 + # source://prism//lib/prism/node.rb#4163 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#3980 + # source://prism//lib/prism/node.rb#4109 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -4947,12 +5914,13 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4063 + # source://prism//lib/prism/node.rb#4192 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#3983 + # source://prism//lib/prism/node.rb#4112 + sig { returns(Prism::Node) } def value; end class << self @@ -4963,7 +5931,7 @@ class Prism::ConstantAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4073 + # source://prism//lib/prism/node.rb#4202 def type; end end end @@ -4972,73 +5940,98 @@ end # # Target += value # ^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4211 class Prism::ConstantOperatorWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void # # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode # - # source://prism//prism/node.rb#4099 + # source://prism//lib/prism/node.rb#4228 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + operator: Symbol, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, operator, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4109 + # source://prism//lib/prism/node.rb#4238 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4114 + # source://prism//lib/prism/node.rb#4243 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4124 + # source://prism//lib/prism/node.rb#4253 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4119 + # source://prism//lib/prism/node.rb#4248 def compact_child_nodes; end # def copy: (**params) -> ConstantOperatorWriteNode # - # source://prism//prism/node.rb#4129 + # source://prism//lib/prism/node.rb#4258 + sig { params(params: T.untyped).returns(Prism::ConstantOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4114 + # source://prism//lib/prism/node.rb#4243 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } # - # source://prism//prism/node.rb#4144 + # source://prism//lib/prism/node.rb#4273 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4149 + # source://prism//lib/prism/node.rb#4278 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#4084 + # source://prism//lib/prism/node.rb#4213 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#4087 + # source://prism//lib/prism/node.rb#4216 + sig { returns(Prism::Location) } def name_loc; end # attr_reader operator: Symbol # - # source://prism//prism/node.rb#4096 + # source://prism//lib/prism/node.rb#4225 + sig { returns(Symbol) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4090 + # source://prism//lib/prism/node.rb#4219 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -5056,12 +6049,13 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4174 + # source://prism//lib/prism/node.rb#4303 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4093 + # source://prism//lib/prism/node.rb#4222 + sig { returns(Prism::Node) } def value; end class << self @@ -5072,7 +6066,7 @@ class Prism::ConstantOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4184 + # source://prism//lib/prism/node.rb#4313 def type; end end end @@ -5081,73 +6075,97 @@ end # # Target ||= value # ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4322 class Prism::ConstantOrWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode # - # source://prism//prism/node.rb#4207 + # source://prism//lib/prism/node.rb#4336 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4216 + # source://prism//lib/prism/node.rb#4345 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4221 + # source://prism//lib/prism/node.rb#4350 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4231 + # source://prism//lib/prism/node.rb#4360 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4226 + # source://prism//lib/prism/node.rb#4355 def compact_child_nodes; end # def copy: (**params) -> ConstantOrWriteNode # - # source://prism//prism/node.rb#4236 + # source://prism//lib/prism/node.rb#4365 + sig { params(params: T.untyped).returns(Prism::ConstantOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4221 + # source://prism//lib/prism/node.rb#4350 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#4250 + # source://prism//lib/prism/node.rb#4379 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4260 + # source://prism//lib/prism/node.rb#4389 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#4195 + # source://prism//lib/prism/node.rb#4324 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#4198 + # source://prism//lib/prism/node.rb#4327 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#4255 + # source://prism//lib/prism/node.rb#4384 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4201 + # source://prism//lib/prism/node.rb#4330 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -5165,12 +6183,13 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4284 + # source://prism//lib/prism/node.rb#4413 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4204 + # source://prism//lib/prism/node.rb#4333 + sig { returns(Prism::Node) } def value; end class << self @@ -5181,7 +6200,7 @@ class Prism::ConstantOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4294 + # source://prism//lib/prism/node.rb#4423 def type; end end end @@ -5190,68 +6209,90 @@ end # # Parent::Child &&= value # ^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4432 class Prism::ConstantPathAndWriteNode < ::Prism::Node - # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void # # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode # - # source://prism//prism/node.rb#4314 + # source://prism//lib/prism/node.rb#4443 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(target, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4322 + # source://prism//lib/prism/node.rb#4451 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4327 + # source://prism//lib/prism/node.rb#4456 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4337 + # source://prism//lib/prism/node.rb#4466 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4332 + # source://prism//lib/prism/node.rb#4461 def compact_child_nodes; end # def copy: (**params) -> ConstantPathAndWriteNode # - # source://prism//prism/node.rb#4342 + # source://prism//lib/prism/node.rb#4471 + sig { params(params: T.untyped).returns(Prism::ConstantPathAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4327 + # source://prism//lib/prism/node.rb#4456 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#4355 + # source://prism//lib/prism/node.rb#4484 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4365 + # source://prism//lib/prism/node.rb#4494 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#4360 + # source://prism//lib/prism/node.rb#4489 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4308 + # source://prism//lib/prism/node.rb#4437 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//prism/node.rb#4305 + # source://prism//lib/prism/node.rb#4434 + sig { returns(Prism::ConstantPathNode) } def target; end # Sometimes you want to check an instance of a node against a list of @@ -5269,12 +6310,13 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4389 + # source://prism//lib/prism/node.rb#4518 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4311 + # source://prism//lib/prism/node.rb#4440 + sig { returns(Prism::Node) } def value; end class << self @@ -5285,7 +6327,7 @@ class Prism::ConstantPathAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4399 + # source://prism//lib/prism/node.rb#4528 def type; end end end @@ -5294,84 +6336,107 @@ end # # Foo::Bar # ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4537 class Prism::ConstantPathNode < ::Prism::Node - # def initialize: (parent: Node?, child: Node, delimiter_loc: Location, location: Location) -> void + # def initialize: (Node? parent, Node child, Location delimiter_loc, Location location) -> void # # @return [ConstantPathNode] a new instance of ConstantPathNode # - # source://prism//prism/node.rb#4419 + # source://prism//lib/prism/node.rb#4548 + sig do + params( + parent: T.nilable(Prism::Node), + child: Prism::Node, + delimiter_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(parent, child, delimiter_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4427 + # source://prism//lib/prism/node.rb#4556 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader child: Node # - # source://prism//prism/node.rb#4413 + # source://prism//lib/prism/node.rb#4542 + sig { returns(Prism::Node) } def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4432 + # source://prism//lib/prism/node.rb#4561 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4445 + # source://prism//lib/prism/node.rb#4574 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4437 + # source://prism//lib/prism/node.rb#4566 def compact_child_nodes; end # def copy: (**params) -> ConstantPathNode # - # source://prism//prism/node.rb#4450 + # source://prism//lib/prism/node.rb#4579 + sig { params(params: T.untyped).returns(Prism::ConstantPathNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4432 + # source://prism//lib/prism/node.rb#4561 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Node?, child: Node, delimiter_loc: Location, location: Location } # - # source://prism//prism/node.rb#4463 + # source://prism//lib/prism/node.rb#4592 + 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 delimiter: () -> String # - # source://prism//prism/node.rb#4468 + # source://prism//lib/prism/node.rb#4597 + sig { returns(String) } def delimiter; end # attr_reader delimiter_loc: Location # - # source://prism//prism/node.rb#4416 + # source://prism//lib/prism/node.rb#4545 + sig { returns(Prism::Location) } def delimiter_loc; end # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//prism/node_ext.rb#129 + # source://prism//lib/prism/node_ext.rb#129 def full_name; end # Returns the list of parts for the full name of this constant path. # For example: [:Foo, :Bar] # - # source://prism//prism/node_ext.rb#112 + # source://prism//lib/prism/node_ext.rb#112 def full_name_parts; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4473 + # source://prism//lib/prism/node.rb#4602 def inspect(inspector = T.unsafe(nil)); end # attr_reader parent: Node? # - # source://prism//prism/node.rb#4410 + # source://prism//lib/prism/node.rb#4539 + sig { returns(T.nilable(Prism::Node)) } def parent; end # Sometimes you want to check an instance of a node against a list of @@ -5389,7 +6454,7 @@ class Prism::ConstantPathNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4501 + # source://prism//lib/prism/node.rb#4630 def type; end class << self @@ -5400,7 +6465,7 @@ class Prism::ConstantPathNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4511 + # source://prism//lib/prism/node.rb#4640 def type; end end end @@ -5411,74 +6476,99 @@ end # simple constants # var::Bar::Baz -> raises because the first part of the constant path is a # local variable +# +# source://prism//lib/prism/node_ext.rb#108 class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end # Represents assigning to a constant path using an operator that isn't `=`. # # Parent::Child += value # ^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4649 class Prism::ConstantPathOperatorWriteNode < ::Prism::Node - # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Symbol operator, Location location) -> void # # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode # - # source://prism//prism/node.rb#4534 + # source://prism//lib/prism/node.rb#4663 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + operator: Symbol, + location: Prism::Location + ).void + end def initialize(target, operator_loc, value, operator, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4543 + # source://prism//lib/prism/node.rb#4672 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4548 + # source://prism//lib/prism/node.rb#4677 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4558 + # source://prism//lib/prism/node.rb#4687 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4553 + # source://prism//lib/prism/node.rb#4682 def compact_child_nodes; end # def copy: (**params) -> ConstantPathOperatorWriteNode # - # source://prism//prism/node.rb#4563 + # source://prism//lib/prism/node.rb#4692 + sig { params(params: T.untyped).returns(Prism::ConstantPathOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4548 + # source://prism//lib/prism/node.rb#4677 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, operator: Symbol, location: Location } # - # source://prism//prism/node.rb#4577 + # source://prism//lib/prism/node.rb#4706 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4582 + # source://prism//lib/prism/node.rb#4711 def inspect(inspector = T.unsafe(nil)); end # attr_reader operator: Symbol # - # source://prism//prism/node.rb#4531 + # source://prism//lib/prism/node.rb#4660 + sig { returns(Symbol) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4525 + # source://prism//lib/prism/node.rb#4654 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//prism/node.rb#4522 + # source://prism//lib/prism/node.rb#4651 + sig { returns(Prism::ConstantPathNode) } def target; end # Sometimes you want to check an instance of a node against a list of @@ -5496,12 +6586,13 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4607 + # source://prism//lib/prism/node.rb#4736 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4528 + # source://prism//lib/prism/node.rb#4657 + sig { returns(Prism::Node) } def value; end class << self @@ -5512,7 +6603,7 @@ class Prism::ConstantPathOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4617 + # source://prism//lib/prism/node.rb#4746 def type; end end end @@ -5521,68 +6612,90 @@ end # # Parent::Child ||= value # ^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4755 class Prism::ConstantPathOrWriteNode < ::Prism::Node - # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void # # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode # - # source://prism//prism/node.rb#4637 + # source://prism//lib/prism/node.rb#4766 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(target, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4645 + # source://prism//lib/prism/node.rb#4774 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4650 + # source://prism//lib/prism/node.rb#4779 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4660 + # source://prism//lib/prism/node.rb#4789 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4655 + # source://prism//lib/prism/node.rb#4784 def compact_child_nodes; end # def copy: (**params) -> ConstantPathOrWriteNode # - # source://prism//prism/node.rb#4665 + # source://prism//lib/prism/node.rb#4794 + sig { params(params: T.untyped).returns(Prism::ConstantPathOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4650 + # source://prism//lib/prism/node.rb#4779 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#4678 + # source://prism//lib/prism/node.rb#4807 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4688 + # source://prism//lib/prism/node.rb#4817 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#4683 + # source://prism//lib/prism/node.rb#4812 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4631 + # source://prism//lib/prism/node.rb#4760 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//prism/node.rb#4628 + # source://prism//lib/prism/node.rb#4757 + sig { returns(Prism::ConstantPathNode) } def target; end # Sometimes you want to check an instance of a node against a list of @@ -5600,12 +6713,13 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4712 + # source://prism//lib/prism/node.rb#4841 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4634 + # source://prism//lib/prism/node.rb#4763 + sig { returns(Prism::Node) } def value; end class << self @@ -5616,7 +6730,7 @@ class Prism::ConstantPathOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4722 + # source://prism//lib/prism/node.rb#4851 def type; end end end @@ -5625,84 +6739,107 @@ end # # Foo::Foo, Bar::Bar = baz # ^^^^^^^^ ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4860 class Prism::ConstantPathTargetNode < ::Prism::Node - # def initialize: (parent: Node?, child: Node, delimiter_loc: Location, location: Location) -> void + # def initialize: (Node? parent, Node child, Location delimiter_loc, Location location) -> void # # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode # - # source://prism//prism/node.rb#4742 + # source://prism//lib/prism/node.rb#4871 + sig do + params( + parent: T.nilable(Prism::Node), + child: Prism::Node, + delimiter_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(parent, child, delimiter_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4750 + # source://prism//lib/prism/node.rb#4879 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader child: Node # - # source://prism//prism/node.rb#4736 + # source://prism//lib/prism/node.rb#4865 + sig { returns(Prism::Node) } def child; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4755 + # source://prism//lib/prism/node.rb#4884 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4768 + # source://prism//lib/prism/node.rb#4897 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4760 + # source://prism//lib/prism/node.rb#4889 def compact_child_nodes; end # def copy: (**params) -> ConstantPathTargetNode # - # source://prism//prism/node.rb#4773 + # source://prism//lib/prism/node.rb#4902 + sig { params(params: T.untyped).returns(Prism::ConstantPathTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4755 + # source://prism//lib/prism/node.rb#4884 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { parent: Node?, child: Node, delimiter_loc: Location, location: Location } # - # source://prism//prism/node.rb#4786 + # source://prism//lib/prism/node.rb#4915 + 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 delimiter: () -> String # - # source://prism//prism/node.rb#4791 + # source://prism//lib/prism/node.rb#4920 + sig { returns(String) } def delimiter; end # attr_reader delimiter_loc: Location # - # source://prism//prism/node.rb#4739 + # source://prism//lib/prism/node.rb#4868 + sig { returns(Prism::Location) } def delimiter_loc; end # Returns the full name of this constant path. For example: "Foo::Bar" # - # source://prism//prism/node_ext.rb#142 + # source://prism//lib/prism/node_ext.rb#142 def full_name; end # Returns the list of parts for the full name of this constant path. # For example: [:Foo, :Bar] # - # source://prism//prism/node_ext.rb#137 + # source://prism//lib/prism/node_ext.rb#137 def full_name_parts; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4796 + # source://prism//lib/prism/node.rb#4925 def inspect(inspector = T.unsafe(nil)); end # attr_reader parent: Node? # - # source://prism//prism/node.rb#4733 + # source://prism//lib/prism/node.rb#4862 + sig { returns(T.nilable(Prism::Node)) } def parent; end # Sometimes you want to check an instance of a node against a list of @@ -5720,7 +6857,7 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4824 + # source://prism//lib/prism/node.rb#4953 def type; end class << self @@ -5731,7 +6868,7 @@ class Prism::ConstantPathTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4834 + # source://prism//lib/prism/node.rb#4963 def type; end end end @@ -5746,68 +6883,90 @@ end # # ::Foo::Bar = 1 # ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#4978 class Prism::ConstantPathWriteNode < ::Prism::Node - # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void + # def initialize: (ConstantPathNode target, Location operator_loc, Node value, Location location) -> void # # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode # - # source://prism//prism/node.rb#4860 + # source://prism//lib/prism/node.rb#4989 + sig do + params( + target: Prism::ConstantPathNode, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end def initialize(target, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4868 + # source://prism//lib/prism/node.rb#4997 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4873 + # source://prism//lib/prism/node.rb#5002 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4883 + # source://prism//lib/prism/node.rb#5012 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4878 + # source://prism//lib/prism/node.rb#5007 def compact_child_nodes; end # def copy: (**params) -> ConstantPathWriteNode # - # source://prism//prism/node.rb#4888 + # source://prism//lib/prism/node.rb#5017 + sig { params(params: T.untyped).returns(Prism::ConstantPathWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4873 + # source://prism//lib/prism/node.rb#5002 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { target: ConstantPathNode, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#4901 + # source://prism//lib/prism/node.rb#5030 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#4911 + # source://prism//lib/prism/node.rb#5040 def inspect(inspector = T.unsafe(nil)); end # def operator: () -> String # - # source://prism//prism/node.rb#4906 + # source://prism//lib/prism/node.rb#5035 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#4854 + # source://prism//lib/prism/node.rb#4983 + sig { returns(Prism::Location) } def operator_loc; end # attr_reader target: ConstantPathNode # - # source://prism//prism/node.rb#4851 + # source://prism//lib/prism/node.rb#4980 + sig { returns(Prism::ConstantPathNode) } def target; end # Sometimes you want to check an instance of a node against a list of @@ -5825,12 +6984,13 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#4935 + # source://prism//lib/prism/node.rb#5064 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#4857 + # source://prism//lib/prism/node.rb#4986 + sig { returns(Prism::Node) } def value; end class << self @@ -5841,7 +7001,7 @@ class Prism::ConstantPathWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#4945 + # source://prism//lib/prism/node.rb#5074 def type; end end end @@ -5850,69 +7010,86 @@ end # # Foo # ^^^ +# +# source://prism//lib/prism/node.rb#5083 class Prism::ConstantReadNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location location) -> void # # @return [ConstantReadNode] a new instance of ConstantReadNode # - # source://prism//prism/node.rb#4959 + # source://prism//lib/prism/node.rb#5092 + sig { params(name: Symbol, location: Prism::Location).void } def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#4965 + # source://prism//lib/prism/node.rb#5098 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4970 + # source://prism//lib/prism/node.rb#5103 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#4980 + # source://prism//lib/prism/node.rb#5113 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#4975 + # source://prism//lib/prism/node.rb#5108 def compact_child_nodes; end # def copy: (**params) -> ConstantReadNode # - # source://prism//prism/node.rb#4985 + # source://prism//lib/prism/node.rb#5118 + sig { params(params: T.untyped).returns(Prism::ConstantReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#4970 + # source://prism//lib/prism/node.rb#5103 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#4996 + # source://prism//lib/prism/node.rb#5129 + 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 # Returns the full name of this constant. For example: "Foo" # - # source://prism//prism/node_ext.rb#96 + # source://prism//lib/prism/node_ext.rb#96 def full_name; end # Returns the list of parts for the full name of this constant. # For example: [:Foo] # - # source://prism//prism/node_ext.rb#91 + # source://prism//lib/prism/node_ext.rb#91 def full_name_parts; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#5001 + # source://prism//lib/prism/node.rb#5134 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # The name of the [constant](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#constants). + # + # X # name `:X` # - # source://prism//prism/node.rb#4956 + # SOME_CONSTANT # name `:SOME_CONSTANT` + # + # source://prism//lib/prism/node.rb#5089 + sig { returns(Symbol) } def name; end # Sometimes you want to check an instance of a node against a list of @@ -5930,7 +7107,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#5021 + # source://prism//lib/prism/node.rb#5154 def type; end class << self @@ -5941,7 +7118,7 @@ class Prism::ConstantReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#5031 + # source://prism//lib/prism/node.rb#5164 def type; end end end @@ -5950,58 +7127,71 @@ end # # Foo, Bar = baz # ^^^ ^^^ +# +# source://prism//lib/prism/node.rb#5173 class Prism::ConstantTargetNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void + # def initialize: (Symbol name, Location location) -> void # # @return [ConstantTargetNode] a new instance of ConstantTargetNode # - # source://prism//prism/node.rb#5045 + # source://prism//lib/prism/node.rb#5178 + sig { params(name: Symbol, location: Prism::Location).void } def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#5051 + # source://prism//lib/prism/node.rb#5184 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5056 + # source://prism//lib/prism/node.rb#5189 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#5066 + # source://prism//lib/prism/node.rb#5199 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#5061 + # source://prism//lib/prism/node.rb#5194 def compact_child_nodes; end # def copy: (**params) -> ConstantTargetNode # - # source://prism//prism/node.rb#5071 + # source://prism//lib/prism/node.rb#5204 + sig { params(params: T.untyped).returns(Prism::ConstantTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5056 + # source://prism//lib/prism/node.rb#5189 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#5082 + # source://prism//lib/prism/node.rb#5215 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#5087 + # source://prism//lib/prism/node.rb#5220 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#5042 + # source://prism//lib/prism/node.rb#5175 + sig { returns(Symbol) } def name; end # Sometimes you want to check an instance of a node against a list of @@ -6019,7 +7209,7 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#5107 + # source://prism//lib/prism/node.rb#5240 def type; end class << self @@ -6030,7 +7220,7 @@ class Prism::ConstantTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#5117 + # source://prism//lib/prism/node.rb#5250 def type; end end end @@ -6039,73 +7229,97 @@ end # # Foo = 1 # ^^^^^^^ +# +# source://prism//lib/prism/node.rb#5259 class Prism::ConstantWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void + # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void # # @return [ConstantWriteNode] a new instance of ConstantWriteNode # - # source://prism//prism/node.rb#5140 + # source://prism//lib/prism/node.rb#5273 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end def initialize(name, name_loc, value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#5149 + # source://prism//lib/prism/node.rb#5282 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5154 + # source://prism//lib/prism/node.rb#5287 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#5164 + # source://prism//lib/prism/node.rb#5297 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#5159 + # source://prism//lib/prism/node.rb#5292 def compact_child_nodes; end # def copy: (**params) -> ConstantWriteNode # - # source://prism//prism/node.rb#5169 + # source://prism//lib/prism/node.rb#5302 + sig { params(params: T.untyped).returns(Prism::ConstantWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5154 + # source://prism//lib/prism/node.rb#5287 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#5183 + # source://prism//lib/prism/node.rb#5316 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#5193 + # source://prism//lib/prism/node.rb#5326 def inspect(inspector = T.unsafe(nil)); end # attr_reader name: Symbol # - # source://prism//prism/node.rb#5128 + # source://prism//lib/prism/node.rb#5261 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#5131 + # source://prism//lib/prism/node.rb#5264 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#5188 + # source://prism//lib/prism/node.rb#5321 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#5137 + # source://prism//lib/prism/node.rb#5270 + sig { returns(Prism::Location) } def operator_loc; end # Sometimes you want to check an instance of a node against a list of @@ -6123,12 +7337,13 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#5217 + # source://prism//lib/prism/node.rb#5350 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#5134 + # source://prism//lib/prism/node.rb#5267 + sig { returns(Prism::Node) } def value; end class << self @@ -6139,11 +7354,13 @@ class Prism::ConstantWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#5227 + # source://prism//lib/prism/node.rb#5360 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: # @@ -6172,757 +7389,761 @@ 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#37 module Prism::DSL private # Create a new AliasGlobalVariableNode node # - # source://prism//prism/dsl.rb#46 + # source://prism//lib/prism/dsl.rb#46 def AliasGlobalVariableNode(new_name, old_name, keyword_loc, location = T.unsafe(nil)); end # Create a new AliasMethodNode node # - # source://prism//prism/dsl.rb#51 + # source://prism//lib/prism/dsl.rb#51 def AliasMethodNode(new_name, old_name, keyword_loc, location = T.unsafe(nil)); end # Create a new AlternationPatternNode node # - # source://prism//prism/dsl.rb#56 + # source://prism//lib/prism/dsl.rb#56 def AlternationPatternNode(left, right, operator_loc, location = T.unsafe(nil)); end # Create a new AndNode node # - # source://prism//prism/dsl.rb#61 + # source://prism//lib/prism/dsl.rb#61 def AndNode(left, right, operator_loc, location = T.unsafe(nil)); end # Create a new ArgumentsNode node # - # source://prism//prism/dsl.rb#66 + # source://prism//lib/prism/dsl.rb#66 def ArgumentsNode(flags, arguments, location = T.unsafe(nil)); end # Create a new ArrayNode node # - # source://prism//prism/dsl.rb#71 + # source://prism//lib/prism/dsl.rb#71 def ArrayNode(flags, elements, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new ArrayPatternNode node # - # source://prism//prism/dsl.rb#76 + # source://prism//lib/prism/dsl.rb#76 def ArrayPatternNode(constant, requireds, rest, posts, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new AssocNode node # - # source://prism//prism/dsl.rb#81 + # source://prism//lib/prism/dsl.rb#81 def AssocNode(key, value, operator_loc, location = T.unsafe(nil)); end # Create a new AssocSplatNode node # - # source://prism//prism/dsl.rb#86 + # source://prism//lib/prism/dsl.rb#86 def AssocSplatNode(value, operator_loc, location = T.unsafe(nil)); end # Create a new BackReferenceReadNode node # - # source://prism//prism/dsl.rb#91 + # source://prism//lib/prism/dsl.rb#91 def BackReferenceReadNode(name, location = T.unsafe(nil)); end # Create a new BeginNode node # - # source://prism//prism/dsl.rb#96 + # source://prism//lib/prism/dsl.rb#96 def BeginNode(begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc, location = T.unsafe(nil)); end # Create a new BlockArgumentNode node # - # source://prism//prism/dsl.rb#101 + # source://prism//lib/prism/dsl.rb#101 def BlockArgumentNode(expression, operator_loc, location = T.unsafe(nil)); end # Create a new BlockLocalVariableNode node # - # source://prism//prism/dsl.rb#106 - def BlockLocalVariableNode(name, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#106 + def BlockLocalVariableNode(flags, name, location = T.unsafe(nil)); end # Create a new BlockNode node # - # source://prism//prism/dsl.rb#111 - def BlockNode(locals, locals_body_index, parameters, body, opening_loc, closing_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#111 + def BlockNode(locals, parameters, body, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new BlockParameterNode node # - # source://prism//prism/dsl.rb#116 - def BlockParameterNode(name, name_loc, operator_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#116 + def BlockParameterNode(flags, name, name_loc, operator_loc, location = T.unsafe(nil)); end # Create a new BlockParametersNode node # - # source://prism//prism/dsl.rb#121 + # source://prism//lib/prism/dsl.rb#121 def BlockParametersNode(parameters, locals, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new BreakNode node # - # source://prism//prism/dsl.rb#126 + # source://prism//lib/prism/dsl.rb#126 def BreakNode(arguments, keyword_loc, location = T.unsafe(nil)); end # Create a new CallAndWriteNode node # - # source://prism//prism/dsl.rb#131 + # source://prism//lib/prism/dsl.rb#131 def CallAndWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location = T.unsafe(nil)); end # Create a new CallNode node # - # source://prism//prism/dsl.rb#136 + # source://prism//lib/prism/dsl.rb#136 def CallNode(flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, block, location = T.unsafe(nil)); end # Create a new CallOperatorWriteNode node # - # source://prism//prism/dsl.rb#141 + # source://prism//lib/prism/dsl.rb#141 def CallOperatorWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator, operator_loc, value, location = T.unsafe(nil)); end # Create a new CallOrWriteNode node # - # source://prism//prism/dsl.rb#146 + # source://prism//lib/prism/dsl.rb#146 def CallOrWriteNode(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location = T.unsafe(nil)); end # Create a new CallTargetNode node # - # source://prism//prism/dsl.rb#151 + # source://prism//lib/prism/dsl.rb#151 def CallTargetNode(flags, receiver, call_operator_loc, name, message_loc, location = T.unsafe(nil)); end # Create a new CapturePatternNode node # - # source://prism//prism/dsl.rb#156 + # source://prism//lib/prism/dsl.rb#156 def CapturePatternNode(value, target, operator_loc, location = T.unsafe(nil)); end # Create a new CaseMatchNode node # - # source://prism//prism/dsl.rb#161 + # source://prism//lib/prism/dsl.rb#161 def CaseMatchNode(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location = T.unsafe(nil)); end # Create a new CaseNode node # - # source://prism//prism/dsl.rb#166 + # source://prism//lib/prism/dsl.rb#166 def CaseNode(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location = T.unsafe(nil)); end # Create a new ClassNode node # - # source://prism//prism/dsl.rb#171 + # source://prism//lib/prism/dsl.rb#171 def ClassNode(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location = T.unsafe(nil)); end # Create a new ClassVariableAndWriteNode node # - # source://prism//prism/dsl.rb#176 + # source://prism//lib/prism/dsl.rb#176 def ClassVariableAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new ClassVariableOperatorWriteNode node # - # source://prism//prism/dsl.rb#181 + # source://prism//lib/prism/dsl.rb#181 def ClassVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, location = T.unsafe(nil)); end # Create a new ClassVariableOrWriteNode node # - # source://prism//prism/dsl.rb#186 + # source://prism//lib/prism/dsl.rb#186 def ClassVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new ClassVariableReadNode node # - # source://prism//prism/dsl.rb#191 + # source://prism//lib/prism/dsl.rb#191 def ClassVariableReadNode(name, location = T.unsafe(nil)); end # Create a new ClassVariableTargetNode node # - # source://prism//prism/dsl.rb#196 + # source://prism//lib/prism/dsl.rb#196 def ClassVariableTargetNode(name, location = T.unsafe(nil)); end # Create a new ClassVariableWriteNode node # - # source://prism//prism/dsl.rb#201 + # source://prism//lib/prism/dsl.rb#201 def ClassVariableWriteNode(name, name_loc, value, operator_loc, location = T.unsafe(nil)); end # Create a new ConstantAndWriteNode node # - # source://prism//prism/dsl.rb#206 + # source://prism//lib/prism/dsl.rb#206 def ConstantAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new ConstantOperatorWriteNode node # - # source://prism//prism/dsl.rb#211 + # source://prism//lib/prism/dsl.rb#211 def ConstantOperatorWriteNode(name, name_loc, operator_loc, value, operator, location = T.unsafe(nil)); end # Create a new ConstantOrWriteNode node # - # source://prism//prism/dsl.rb#216 + # source://prism//lib/prism/dsl.rb#216 def ConstantOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new ConstantPathAndWriteNode node # - # source://prism//prism/dsl.rb#221 + # source://prism//lib/prism/dsl.rb#221 def ConstantPathAndWriteNode(target, operator_loc, value, location = T.unsafe(nil)); end # Create a new ConstantPathNode node # - # source://prism//prism/dsl.rb#226 + # source://prism//lib/prism/dsl.rb#226 def ConstantPathNode(parent, child, delimiter_loc, location = T.unsafe(nil)); end # Create a new ConstantPathOperatorWriteNode node # - # source://prism//prism/dsl.rb#231 + # source://prism//lib/prism/dsl.rb#231 def ConstantPathOperatorWriteNode(target, operator_loc, value, operator, location = T.unsafe(nil)); end # Create a new ConstantPathOrWriteNode node # - # source://prism//prism/dsl.rb#236 + # source://prism//lib/prism/dsl.rb#236 def ConstantPathOrWriteNode(target, operator_loc, value, location = T.unsafe(nil)); end # Create a new ConstantPathTargetNode node # - # source://prism//prism/dsl.rb#241 + # source://prism//lib/prism/dsl.rb#241 def ConstantPathTargetNode(parent, child, delimiter_loc, location = T.unsafe(nil)); end # Create a new ConstantPathWriteNode node # - # source://prism//prism/dsl.rb#246 + # source://prism//lib/prism/dsl.rb#246 def ConstantPathWriteNode(target, operator_loc, value, location = T.unsafe(nil)); end # Create a new ConstantReadNode node # - # source://prism//prism/dsl.rb#251 + # source://prism//lib/prism/dsl.rb#251 def ConstantReadNode(name, location = T.unsafe(nil)); end # Create a new ConstantTargetNode node # - # source://prism//prism/dsl.rb#256 + # source://prism//lib/prism/dsl.rb#256 def ConstantTargetNode(name, location = T.unsafe(nil)); end # Create a new ConstantWriteNode node # - # source://prism//prism/dsl.rb#261 + # source://prism//lib/prism/dsl.rb#261 def ConstantWriteNode(name, name_loc, value, operator_loc, location = T.unsafe(nil)); end # Create a new DefNode node # - # source://prism//prism/dsl.rb#266 - def DefNode(name, name_loc, receiver, parameters, body, locals, locals_body_index, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#266 + def DefNode(name, name_loc, receiver, parameters, body, locals, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, location = T.unsafe(nil)); end # Create a new DefinedNode node # - # source://prism//prism/dsl.rb#271 + # source://prism//lib/prism/dsl.rb#271 def DefinedNode(lparen_loc, value, rparen_loc, keyword_loc, location = T.unsafe(nil)); end # Create a new ElseNode node # - # source://prism//prism/dsl.rb#276 + # source://prism//lib/prism/dsl.rb#276 def ElseNode(else_keyword_loc, statements, end_keyword_loc, location = T.unsafe(nil)); end # Create a new EmbeddedStatementsNode node # - # source://prism//prism/dsl.rb#281 + # source://prism//lib/prism/dsl.rb#281 def EmbeddedStatementsNode(opening_loc, statements, closing_loc, location = T.unsafe(nil)); end # Create a new EmbeddedVariableNode node # - # source://prism//prism/dsl.rb#286 + # source://prism//lib/prism/dsl.rb#286 def EmbeddedVariableNode(operator_loc, variable, location = T.unsafe(nil)); end # Create a new EnsureNode node # - # source://prism//prism/dsl.rb#291 + # source://prism//lib/prism/dsl.rb#291 def EnsureNode(ensure_keyword_loc, statements, end_keyword_loc, location = T.unsafe(nil)); end # Create a new FalseNode node # - # source://prism//prism/dsl.rb#296 + # source://prism//lib/prism/dsl.rb#296 def FalseNode(location = T.unsafe(nil)); end # Create a new FindPatternNode node # - # source://prism//prism/dsl.rb#301 + # source://prism//lib/prism/dsl.rb#301 def FindPatternNode(constant, left, requireds, right, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new FlipFlopNode node # - # source://prism//prism/dsl.rb#306 + # source://prism//lib/prism/dsl.rb#306 def FlipFlopNode(flags, left, right, operator_loc, location = T.unsafe(nil)); end # Create a new FloatNode node # - # source://prism//prism/dsl.rb#311 + # source://prism//lib/prism/dsl.rb#311 def FloatNode(location = T.unsafe(nil)); end # Create a new ForNode node # - # source://prism//prism/dsl.rb#316 + # source://prism//lib/prism/dsl.rb#316 def ForNode(index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc, location = T.unsafe(nil)); end # Create a new ForwardingArgumentsNode node # - # source://prism//prism/dsl.rb#321 + # source://prism//lib/prism/dsl.rb#321 def ForwardingArgumentsNode(location = T.unsafe(nil)); end # Create a new ForwardingParameterNode node # - # source://prism//prism/dsl.rb#326 + # source://prism//lib/prism/dsl.rb#326 def ForwardingParameterNode(location = T.unsafe(nil)); end # Create a new ForwardingSuperNode node # - # source://prism//prism/dsl.rb#331 + # source://prism//lib/prism/dsl.rb#331 def ForwardingSuperNode(block, location = T.unsafe(nil)); end # Create a new GlobalVariableAndWriteNode node # - # source://prism//prism/dsl.rb#336 + # source://prism//lib/prism/dsl.rb#336 def GlobalVariableAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new GlobalVariableOperatorWriteNode node # - # source://prism//prism/dsl.rb#341 + # source://prism//lib/prism/dsl.rb#341 def GlobalVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, location = T.unsafe(nil)); end # Create a new GlobalVariableOrWriteNode node # - # source://prism//prism/dsl.rb#346 + # source://prism//lib/prism/dsl.rb#346 def GlobalVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new GlobalVariableReadNode node # - # source://prism//prism/dsl.rb#351 + # source://prism//lib/prism/dsl.rb#351 def GlobalVariableReadNode(name, location = T.unsafe(nil)); end # Create a new GlobalVariableTargetNode node # - # source://prism//prism/dsl.rb#356 + # source://prism//lib/prism/dsl.rb#356 def GlobalVariableTargetNode(name, location = T.unsafe(nil)); end # Create a new GlobalVariableWriteNode node # - # source://prism//prism/dsl.rb#361 + # source://prism//lib/prism/dsl.rb#361 def GlobalVariableWriteNode(name, name_loc, value, operator_loc, location = T.unsafe(nil)); end # Create a new HashNode node # - # source://prism//prism/dsl.rb#366 + # source://prism//lib/prism/dsl.rb#366 def HashNode(opening_loc, elements, closing_loc, location = T.unsafe(nil)); end # Create a new HashPatternNode node # - # source://prism//prism/dsl.rb#371 + # source://prism//lib/prism/dsl.rb#371 def HashPatternNode(constant, elements, rest, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new IfNode node # - # source://prism//prism/dsl.rb#376 + # source://prism//lib/prism/dsl.rb#376 def IfNode(if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location = T.unsafe(nil)); end # Create a new ImaginaryNode node # - # source://prism//prism/dsl.rb#381 + # source://prism//lib/prism/dsl.rb#381 def ImaginaryNode(numeric, location = T.unsafe(nil)); end # Create a new ImplicitNode node # - # source://prism//prism/dsl.rb#386 + # source://prism//lib/prism/dsl.rb#386 def ImplicitNode(value, location = T.unsafe(nil)); end # Create a new ImplicitRestNode node # - # source://prism//prism/dsl.rb#391 + # source://prism//lib/prism/dsl.rb#391 def ImplicitRestNode(location = T.unsafe(nil)); end # Create a new InNode node # - # source://prism//prism/dsl.rb#396 + # source://prism//lib/prism/dsl.rb#396 def InNode(pattern, statements, in_loc, then_loc, location = T.unsafe(nil)); end # Create a new IndexAndWriteNode node # - # source://prism//prism/dsl.rb#401 + # source://prism//lib/prism/dsl.rb#401 def IndexAndWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location = T.unsafe(nil)); end # Create a new IndexOperatorWriteNode node # - # source://prism//prism/dsl.rb#406 + # source://prism//lib/prism/dsl.rb#406 def IndexOperatorWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator, operator_loc, value, location = T.unsafe(nil)); end # Create a new IndexOrWriteNode node # - # source://prism//prism/dsl.rb#411 + # source://prism//lib/prism/dsl.rb#411 def IndexOrWriteNode(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location = T.unsafe(nil)); end # Create a new IndexTargetNode node # - # source://prism//prism/dsl.rb#416 + # source://prism//lib/prism/dsl.rb#416 def IndexTargetNode(flags, receiver, opening_loc, arguments, closing_loc, block, location = T.unsafe(nil)); end # Create a new InstanceVariableAndWriteNode node # - # source://prism//prism/dsl.rb#421 + # source://prism//lib/prism/dsl.rb#421 def InstanceVariableAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new InstanceVariableOperatorWriteNode node # - # source://prism//prism/dsl.rb#426 + # source://prism//lib/prism/dsl.rb#426 def InstanceVariableOperatorWriteNode(name, name_loc, operator_loc, value, operator, location = T.unsafe(nil)); end # Create a new InstanceVariableOrWriteNode node # - # source://prism//prism/dsl.rb#431 + # source://prism//lib/prism/dsl.rb#431 def InstanceVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new InstanceVariableReadNode node # - # source://prism//prism/dsl.rb#436 + # source://prism//lib/prism/dsl.rb#436 def InstanceVariableReadNode(name, location = T.unsafe(nil)); end # Create a new InstanceVariableTargetNode node # - # source://prism//prism/dsl.rb#441 + # source://prism//lib/prism/dsl.rb#441 def InstanceVariableTargetNode(name, location = T.unsafe(nil)); end # Create a new InstanceVariableWriteNode node # - # source://prism//prism/dsl.rb#446 + # source://prism//lib/prism/dsl.rb#446 def InstanceVariableWriteNode(name, name_loc, value, operator_loc, location = T.unsafe(nil)); end # Create a new IntegerNode node # - # source://prism//prism/dsl.rb#451 + # source://prism//lib/prism/dsl.rb#451 def IntegerNode(flags, location = T.unsafe(nil)); end # Create a new InterpolatedMatchLastLineNode node # - # source://prism//prism/dsl.rb#456 + # source://prism//lib/prism/dsl.rb#456 def InterpolatedMatchLastLineNode(flags, opening_loc, parts, closing_loc, location = T.unsafe(nil)); end # Create a new InterpolatedRegularExpressionNode node # - # source://prism//prism/dsl.rb#461 + # source://prism//lib/prism/dsl.rb#461 def InterpolatedRegularExpressionNode(flags, opening_loc, parts, closing_loc, location = T.unsafe(nil)); end # Create a new InterpolatedStringNode node # - # source://prism//prism/dsl.rb#466 + # source://prism//lib/prism/dsl.rb#466 def InterpolatedStringNode(opening_loc, parts, closing_loc, location = T.unsafe(nil)); end # Create a new InterpolatedSymbolNode node # - # source://prism//prism/dsl.rb#471 + # source://prism//lib/prism/dsl.rb#471 def InterpolatedSymbolNode(opening_loc, parts, closing_loc, location = T.unsafe(nil)); end # Create a new InterpolatedXStringNode node # - # source://prism//prism/dsl.rb#476 + # source://prism//lib/prism/dsl.rb#476 def InterpolatedXStringNode(opening_loc, parts, closing_loc, location = T.unsafe(nil)); end # Create a new KeywordHashNode node # - # source://prism//prism/dsl.rb#481 + # source://prism//lib/prism/dsl.rb#481 def KeywordHashNode(flags, elements, location = T.unsafe(nil)); end # Create a new KeywordRestParameterNode node # - # source://prism//prism/dsl.rb#486 - def KeywordRestParameterNode(name, name_loc, operator_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#486 + def KeywordRestParameterNode(flags, name, name_loc, operator_loc, location = T.unsafe(nil)); end # Create a new LambdaNode node # - # source://prism//prism/dsl.rb#491 - def LambdaNode(locals, locals_body_index, operator_loc, opening_loc, closing_loc, parameters, body, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#491 + def LambdaNode(locals, operator_loc, opening_loc, closing_loc, parameters, body, location = T.unsafe(nil)); end # Create a new LocalVariableAndWriteNode node # - # source://prism//prism/dsl.rb#496 + # source://prism//lib/prism/dsl.rb#496 def LocalVariableAndWriteNode(name_loc, operator_loc, value, name, depth, location = T.unsafe(nil)); end # Create a new LocalVariableOperatorWriteNode node # - # source://prism//prism/dsl.rb#501 + # source://prism//lib/prism/dsl.rb#501 def LocalVariableOperatorWriteNode(name_loc, operator_loc, value, name, operator, depth, location = T.unsafe(nil)); end # Create a new LocalVariableOrWriteNode node # - # source://prism//prism/dsl.rb#506 + # source://prism//lib/prism/dsl.rb#506 def LocalVariableOrWriteNode(name_loc, operator_loc, value, name, depth, location = T.unsafe(nil)); end # Create a new LocalVariableReadNode node # - # source://prism//prism/dsl.rb#511 + # source://prism//lib/prism/dsl.rb#511 def LocalVariableReadNode(name, depth, location = T.unsafe(nil)); end # Create a new LocalVariableTargetNode node # - # source://prism//prism/dsl.rb#516 + # source://prism//lib/prism/dsl.rb#516 def LocalVariableTargetNode(name, depth, location = T.unsafe(nil)); end # Create a new LocalVariableWriteNode node # - # source://prism//prism/dsl.rb#521 + # source://prism//lib/prism/dsl.rb#521 def LocalVariableWriteNode(name, depth, name_loc, value, operator_loc, location = T.unsafe(nil)); end # Create a new Location object # - # source://prism//prism/dsl.rb#41 + # source://prism//lib/prism/dsl.rb#41 def Location(source = T.unsafe(nil), start_offset = T.unsafe(nil), length = T.unsafe(nil)); end # Create a new MatchLastLineNode node # - # source://prism//prism/dsl.rb#526 + # source://prism//lib/prism/dsl.rb#526 def MatchLastLineNode(flags, opening_loc, content_loc, closing_loc, unescaped, location = T.unsafe(nil)); end # Create a new MatchPredicateNode node # - # source://prism//prism/dsl.rb#531 + # source://prism//lib/prism/dsl.rb#531 def MatchPredicateNode(value, pattern, operator_loc, location = T.unsafe(nil)); end # Create a new MatchRequiredNode node # - # source://prism//prism/dsl.rb#536 + # source://prism//lib/prism/dsl.rb#536 def MatchRequiredNode(value, pattern, operator_loc, location = T.unsafe(nil)); end # Create a new MatchWriteNode node # - # source://prism//prism/dsl.rb#541 + # source://prism//lib/prism/dsl.rb#541 def MatchWriteNode(call, targets, location = T.unsafe(nil)); end # Create a new MissingNode node # - # source://prism//prism/dsl.rb#546 + # source://prism//lib/prism/dsl.rb#546 def MissingNode(location = T.unsafe(nil)); end # Create a new ModuleNode node # - # source://prism//prism/dsl.rb#551 + # source://prism//lib/prism/dsl.rb#551 def ModuleNode(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location = T.unsafe(nil)); end # Create a new MultiTargetNode node # - # source://prism//prism/dsl.rb#556 + # source://prism//lib/prism/dsl.rb#556 def MultiTargetNode(lefts, rest, rights, lparen_loc, rparen_loc, location = T.unsafe(nil)); end # Create a new MultiWriteNode node # - # source://prism//prism/dsl.rb#561 + # source://prism//lib/prism/dsl.rb#561 def MultiWriteNode(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new NextNode node # - # source://prism//prism/dsl.rb#566 + # source://prism//lib/prism/dsl.rb#566 def NextNode(arguments, keyword_loc, location = T.unsafe(nil)); end # Create a new NilNode node # - # source://prism//prism/dsl.rb#571 + # source://prism//lib/prism/dsl.rb#571 def NilNode(location = T.unsafe(nil)); end # Create a new NoKeywordsParameterNode node # - # source://prism//prism/dsl.rb#576 + # source://prism//lib/prism/dsl.rb#576 def NoKeywordsParameterNode(operator_loc, keyword_loc, location = T.unsafe(nil)); end # Create a new NumberedParametersNode node # - # source://prism//prism/dsl.rb#581 + # source://prism//lib/prism/dsl.rb#581 def NumberedParametersNode(maximum, location = T.unsafe(nil)); end # Create a new NumberedReferenceReadNode node # - # source://prism//prism/dsl.rb#586 + # source://prism//lib/prism/dsl.rb#586 def NumberedReferenceReadNode(number, location = T.unsafe(nil)); end # Create a new OptionalKeywordParameterNode node # - # source://prism//prism/dsl.rb#591 - def OptionalKeywordParameterNode(name, name_loc, value, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#591 + def OptionalKeywordParameterNode(flags, name, name_loc, value, location = T.unsafe(nil)); end # Create a new OptionalParameterNode node # - # source://prism//prism/dsl.rb#596 - def OptionalParameterNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#596 + def OptionalParameterNode(flags, name, name_loc, operator_loc, value, location = T.unsafe(nil)); end # Create a new OrNode node # - # source://prism//prism/dsl.rb#601 + # source://prism//lib/prism/dsl.rb#601 def OrNode(left, right, operator_loc, location = T.unsafe(nil)); end # Create a new ParametersNode node # - # source://prism//prism/dsl.rb#606 + # source://prism//lib/prism/dsl.rb#606 def ParametersNode(requireds, optionals, rest, posts, keywords, keyword_rest, block, location = T.unsafe(nil)); end # Create a new ParenthesesNode node # - # source://prism//prism/dsl.rb#611 + # source://prism//lib/prism/dsl.rb#611 def ParenthesesNode(body, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new PinnedExpressionNode node # - # source://prism//prism/dsl.rb#616 + # source://prism//lib/prism/dsl.rb#616 def PinnedExpressionNode(expression, operator_loc, lparen_loc, rparen_loc, location = T.unsafe(nil)); end # Create a new PinnedVariableNode node # - # source://prism//prism/dsl.rb#621 + # source://prism//lib/prism/dsl.rb#621 def PinnedVariableNode(variable, operator_loc, location = T.unsafe(nil)); end # Create a new PostExecutionNode node # - # source://prism//prism/dsl.rb#626 + # source://prism//lib/prism/dsl.rb#626 def PostExecutionNode(statements, keyword_loc, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new PreExecutionNode node # - # source://prism//prism/dsl.rb#631 + # source://prism//lib/prism/dsl.rb#631 def PreExecutionNode(statements, keyword_loc, opening_loc, closing_loc, location = T.unsafe(nil)); end # Create a new ProgramNode node # - # source://prism//prism/dsl.rb#636 + # source://prism//lib/prism/dsl.rb#636 def ProgramNode(locals, statements, location = T.unsafe(nil)); end # Create a new RangeNode node # - # source://prism//prism/dsl.rb#641 + # source://prism//lib/prism/dsl.rb#641 def RangeNode(flags, left, right, operator_loc, location = T.unsafe(nil)); end # Create a new RationalNode node # - # source://prism//prism/dsl.rb#646 + # source://prism//lib/prism/dsl.rb#646 def RationalNode(numeric, location = T.unsafe(nil)); end # Create a new RedoNode node # - # source://prism//prism/dsl.rb#651 + # source://prism//lib/prism/dsl.rb#651 def RedoNode(location = T.unsafe(nil)); end # Create a new RegularExpressionNode node # - # source://prism//prism/dsl.rb#656 + # source://prism//lib/prism/dsl.rb#656 def RegularExpressionNode(flags, opening_loc, content_loc, closing_loc, unescaped, location = T.unsafe(nil)); end # Create a new RequiredKeywordParameterNode node # - # source://prism//prism/dsl.rb#661 - def RequiredKeywordParameterNode(name, name_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#661 + def RequiredKeywordParameterNode(flags, name, name_loc, location = T.unsafe(nil)); end # Create a new RequiredParameterNode node # - # source://prism//prism/dsl.rb#666 - def RequiredParameterNode(name, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#666 + def RequiredParameterNode(flags, name, location = T.unsafe(nil)); end # Create a new RescueModifierNode node # - # source://prism//prism/dsl.rb#671 + # source://prism//lib/prism/dsl.rb#671 def RescueModifierNode(expression, keyword_loc, rescue_expression, location = T.unsafe(nil)); end # Create a new RescueNode node # - # source://prism//prism/dsl.rb#676 + # source://prism//lib/prism/dsl.rb#676 def RescueNode(keyword_loc, exceptions, operator_loc, reference, statements, consequent, location = T.unsafe(nil)); end # Create a new RestParameterNode node # - # source://prism//prism/dsl.rb#681 - def RestParameterNode(name, name_loc, operator_loc, location = T.unsafe(nil)); end + # source://prism//lib/prism/dsl.rb#681 + def RestParameterNode(flags, name, name_loc, operator_loc, location = T.unsafe(nil)); end # Create a new RetryNode node # - # source://prism//prism/dsl.rb#686 + # source://prism//lib/prism/dsl.rb#686 def RetryNode(location = T.unsafe(nil)); end # Create a new ReturnNode node # - # source://prism//prism/dsl.rb#691 + # source://prism//lib/prism/dsl.rb#691 def ReturnNode(keyword_loc, arguments, location = T.unsafe(nil)); end # Create a new SelfNode node # - # source://prism//prism/dsl.rb#696 + # source://prism//lib/prism/dsl.rb#696 def SelfNode(location = T.unsafe(nil)); end # Create a new SingletonClassNode node # - # source://prism//prism/dsl.rb#701 + # source://prism//lib/prism/dsl.rb#701 def SingletonClassNode(locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, location = T.unsafe(nil)); end # Create a new SourceEncodingNode node # - # source://prism//prism/dsl.rb#706 + # source://prism//lib/prism/dsl.rb#706 def SourceEncodingNode(location = T.unsafe(nil)); end # Create a new SourceFileNode node # - # source://prism//prism/dsl.rb#711 + # source://prism//lib/prism/dsl.rb#711 def SourceFileNode(filepath, location = T.unsafe(nil)); end # Create a new SourceLineNode node # - # source://prism//prism/dsl.rb#716 + # source://prism//lib/prism/dsl.rb#716 def SourceLineNode(location = T.unsafe(nil)); end # Create a new SplatNode node # - # source://prism//prism/dsl.rb#721 + # source://prism//lib/prism/dsl.rb#721 def SplatNode(operator_loc, expression, location = T.unsafe(nil)); end # Create a new StatementsNode node # - # source://prism//prism/dsl.rb#726 + # source://prism//lib/prism/dsl.rb#726 def StatementsNode(body, location = T.unsafe(nil)); end # Create a new StringNode node # - # source://prism//prism/dsl.rb#731 + # source://prism//lib/prism/dsl.rb#731 def StringNode(flags, opening_loc, content_loc, closing_loc, unescaped, location = T.unsafe(nil)); end # Create a new SuperNode node # - # source://prism//prism/dsl.rb#736 + # source://prism//lib/prism/dsl.rb#736 def SuperNode(keyword_loc, lparen_loc, arguments, rparen_loc, block, location = T.unsafe(nil)); end # Create a new SymbolNode node # - # source://prism//prism/dsl.rb#741 + # source://prism//lib/prism/dsl.rb#741 def SymbolNode(flags, opening_loc, value_loc, closing_loc, unescaped, location = T.unsafe(nil)); end # Create a new TrueNode node # - # source://prism//prism/dsl.rb#746 + # source://prism//lib/prism/dsl.rb#746 def TrueNode(location = T.unsafe(nil)); end # Create a new UndefNode node # - # source://prism//prism/dsl.rb#751 + # source://prism//lib/prism/dsl.rb#751 def UndefNode(names, keyword_loc, location = T.unsafe(nil)); end # Create a new UnlessNode node # - # source://prism//prism/dsl.rb#756 + # source://prism//lib/prism/dsl.rb#756 def UnlessNode(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location = T.unsafe(nil)); end # Create a new UntilNode node # - # source://prism//prism/dsl.rb#761 + # source://prism//lib/prism/dsl.rb#761 def UntilNode(flags, keyword_loc, closing_loc, predicate, statements, location = T.unsafe(nil)); end # Create a new WhenNode node # - # source://prism//prism/dsl.rb#766 + # source://prism//lib/prism/dsl.rb#766 def WhenNode(keyword_loc, conditions, statements, location = T.unsafe(nil)); end # Create a new WhileNode node # - # source://prism//prism/dsl.rb#771 + # source://prism//lib/prism/dsl.rb#771 def WhileNode(flags, keyword_loc, closing_loc, predicate, statements, location = T.unsafe(nil)); end # Create a new XStringNode node # - # source://prism//prism/dsl.rb#776 + # source://prism//lib/prism/dsl.rb#776 def XStringNode(flags, opening_loc, content_loc, closing_loc, unescaped, location = T.unsafe(nil)); end # Create a new YieldNode node # - # source://prism//prism/dsl.rb#781 + # source://prism//lib/prism/dsl.rb#781 def YieldNode(keyword_loc, lparen_loc, arguments, rparen_loc, location = T.unsafe(nil)); end end # This module is used for testing and debugging and is not meant to be used by # consumers of this library. +# +# source://prism//lib/prism/debug.rb#6 module Prism::Debug class << self # :call-seq: @@ -6931,9 +8152,10 @@ module Prism::Debug # For the given source, compiles with CRuby and returns a list of all of the # sets of local variables that were encountered. # - # source://prism//prism/debug.rb#54 + # source://prism//lib/prism/debug.rb#54 def cruby_locals(source); end + def format_errors(_arg0, _arg1); end def inspect_node(_arg0); end def memsize(_arg0); end def named_captures(_arg0); end @@ -6944,7 +8166,7 @@ module Prism::Debug # For the given source string, return the byte offsets of every newline in # the source. # - # source://prism//prism/debug.rb#196 + # source://prism//lib/prism/debug.rb#202 def newlines(source); end # :call-seq: @@ -6953,7 +8175,7 @@ module Prism::Debug # For the given source, parses with prism and returns a list of all of the # sets of local variables that were encountered. # - # source://prism//prism/debug.rb#98 + # source://prism//lib/prism/debug.rb#98 def prism_locals(source); end def profile_file(_arg0); end @@ -6965,30 +8187,32 @@ end # iteration variable in a for loop or the positional parameter on a method # definition that is destructured. # -# source://prism//prism/debug.rb#90 +# source://prism//lib/prism/debug.rb#90 Prism::Debug::AnonymousLocal = T.let(T.unsafe(nil), Object) # A wrapper around a RubyVM::InstructionSequence that provides a more # convenient interface for accessing parts of the iseq. +# +# source://prism//lib/prism/debug.rb#9 class Prism::Debug::ISeq # @return [ISeq] a new instance of ISeq # - # source://prism//prism/debug.rb#12 + # source://prism//lib/prism/debug.rb#12 def initialize(parts); end - # source://prism//prism/debug.rb#28 + # source://prism//lib/prism/debug.rb#28 def each_child; end - # source://prism//prism/debug.rb#24 + # source://prism//lib/prism/debug.rb#24 def instructions; end - # source://prism//prism/debug.rb#20 + # source://prism//lib/prism/debug.rb#20 def local_table; end - # source://prism//prism/debug.rb#10 + # source://prism//lib/prism/debug.rb#10 def parts; end - # source://prism//prism/debug.rb#16 + # source://prism//lib/prism/debug.rb#16 def type; end end @@ -6997,148 +8221,189 @@ end # def method # end # ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#5370 class Prism::DefNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, receiver: Node?, parameters: ParametersNode?, body: Node?, locals: Array[Symbol], locals_body_index: Integer, def_keyword_loc: Location, operator_loc: Location?, lparen_loc: Location?, rparen_loc: Location?, equal_loc: Location?, end_keyword_loc: Location?, location: Location) -> void + # 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 # # @return [DefNode] a new instance of DefNode # - # source://prism//prism/node.rb#5278 - def initialize(name, name_loc, receiver, parameters, body, locals, locals_body_index, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, location); end + # source://prism//lib/prism/node.rb#5408 + 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 + ).void + end + def initialize(name, name_loc, receiver, parameters, body, locals, def_keyword_loc, operator_loc, lparen_loc, rparen_loc, equal_loc, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#5296 + # source://prism//lib/prism/node.rb#5425 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader body: Node? # - # source://prism//prism/node.rb#5251 + # source://prism//lib/prism/node.rb#5384 + sig { returns(T.nilable(Prism::Node)) } def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5301 + # source://prism//lib/prism/node.rb#5430 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#5315 + # source://prism//lib/prism/node.rb#5444 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#5306 + # source://prism//lib/prism/node.rb#5435 def compact_child_nodes; end # def copy: (**params) -> DefNode # - # source://prism//prism/node.rb#5320 + # source://prism//lib/prism/node.rb#5449 + sig { params(params: T.untyped).returns(Prism::DefNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5301 + # source://prism//lib/prism/node.rb#5430 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#5343 + # source://prism//lib/prism/node.rb#5471 + 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 def_keyword: () -> String # - # source://prism//prism/node.rb#5348 + # source://prism//lib/prism/node.rb#5476 + sig { returns(String) } def def_keyword; end # attr_reader def_keyword_loc: Location # - # source://prism//prism/node.rb#5260 + # source://prism//lib/prism/node.rb#5390 + sig { returns(Prism::Location) } def def_keyword_loc; end # def end_keyword: () -> String? # - # source://prism//prism/node.rb#5373 + # source://prism//lib/prism/node.rb#5501 + sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//prism/node.rb#5275 + # source://prism//lib/prism/node.rb#5405 + sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end # def equal: () -> String? # - # source://prism//prism/node.rb#5368 + # source://prism//lib/prism/node.rb#5496 + sig { returns(T.nilable(String)) } def equal; end # attr_reader equal_loc: Location? # - # source://prism//prism/node.rb#5272 + # source://prism//lib/prism/node.rb#5402 + sig { returns(T.nilable(Prism::Location)) } def equal_loc; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#5378 + # source://prism//lib/prism/node.rb#5506 def inspect(inspector = T.unsafe(nil)); end # attr_reader locals: Array[Symbol] # - # source://prism//prism/node.rb#5254 + # source://prism//lib/prism/node.rb#5387 + sig { returns(T::Array[Symbol]) } def locals; end - # attr_reader locals_body_index: Integer - # - # source://prism//prism/node.rb#5257 - def locals_body_index; end - # def lparen: () -> String? # - # source://prism//prism/node.rb#5358 + # source://prism//lib/prism/node.rb#5486 + sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//prism/node.rb#5266 + # source://prism//lib/prism/node.rb#5396 + sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # attr_reader name: Symbol # - # source://prism//prism/node.rb#5239 + # source://prism//lib/prism/node.rb#5372 + sig { returns(Symbol) } def name; end # attr_reader name_loc: Location # - # source://prism//prism/node.rb#5242 + # source://prism//lib/prism/node.rb#5375 + sig { returns(Prism::Location) } def name_loc; end # def operator: () -> String? # - # source://prism//prism/node.rb#5353 + # source://prism//lib/prism/node.rb#5481 + sig { returns(T.nilable(String)) } def operator; end # attr_reader operator_loc: Location? # - # source://prism//prism/node.rb#5263 + # source://prism//lib/prism/node.rb#5393 + sig { returns(T.nilable(Prism::Location)) } def operator_loc; end # attr_reader parameters: ParametersNode? # - # source://prism//prism/node.rb#5248 + # source://prism//lib/prism/node.rb#5381 + sig { returns(T.nilable(Prism::ParametersNode)) } def parameters; end # attr_reader receiver: Node? # - # source://prism//prism/node.rb#5245 + # source://prism//lib/prism/node.rb#5378 + sig { returns(T.nilable(Prism::Node)) } def receiver; end # def rparen: () -> String? # - # source://prism//prism/node.rb#5363 + # source://prism//lib/prism/node.rb#5491 + sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//prism/node.rb#5269 + # source://prism//lib/prism/node.rb#5399 + sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Sometimes you want to check an instance of a node against a list of @@ -7156,7 +8421,7 @@ class Prism::DefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#5425 + # source://prism//lib/prism/node.rb#5552 def type; end class << self @@ -7167,7 +8432,7 @@ class Prism::DefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#5435 + # source://prism//lib/prism/node.rb#5562 def type; end end end @@ -7176,83 +8441,109 @@ end # # defined?(a) # ^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#5571 class Prism::DefinedNode < ::Prism::Node - # def initialize: (lparen_loc: Location?, value: Node, rparen_loc: Location?, keyword_loc: Location, location: Location) -> void + # def initialize: (Location? lparen_loc, Node value, Location? rparen_loc, Location keyword_loc, Location location) -> void # # @return [DefinedNode] a new instance of DefinedNode # - # source://prism//prism/node.rb#5458 + # source://prism//lib/prism/node.rb#5585 + 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 + ).void + end def initialize(lparen_loc, value, rparen_loc, keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#5467 + # source://prism//lib/prism/node.rb#5594 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5472 + # source://prism//lib/prism/node.rb#5599 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#5482 + # source://prism//lib/prism/node.rb#5609 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#5477 + # source://prism//lib/prism/node.rb#5604 def compact_child_nodes; end # def copy: (**params) -> DefinedNode # - # source://prism//prism/node.rb#5487 + # source://prism//lib/prism/node.rb#5614 + sig { params(params: T.untyped).returns(Prism::DefinedNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#5472 + # source://prism//lib/prism/node.rb#5599 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { lparen_loc: Location?, value: Node, rparen_loc: Location?, keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#5501 + # source://prism//lib/prism/node.rb#5628 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#5521 + # source://prism//lib/prism/node.rb#5648 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#5516 + # source://prism//lib/prism/node.rb#5643 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#5455 + # source://prism//lib/prism/node.rb#5582 + sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//prism/node.rb#5506 + # source://prism//lib/prism/node.rb#5633 + sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//prism/node.rb#5446 + # source://prism//lib/prism/node.rb#5573 + sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//prism/node.rb#5511 + # source://prism//lib/prism/node.rb#5638 + sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//prism/node.rb#5452 + # source://prism//lib/prism/node.rb#5579 + sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Sometimes you want to check an instance of a node against a list of @@ -7270,12 +8561,13 @@ class Prism::DefinedNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#5545 + # source://prism//lib/prism/node.rb#5672 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#5449 + # source://prism//lib/prism/node.rb#5576 + sig { returns(Prism::Node) } def value; end class << self @@ -7286,13 +8578,15 @@ class Prism::DefinedNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#5555 + # source://prism//lib/prism/node.rb#5682 def type; end end end # DesugarCompiler is a compiler that desugars Ruby code into a more primitive # form. This is useful for consumers that want to deal with fewer node types. +# +# source://prism//lib/prism/desugar_compiler.rb#6 class Prism::DesugarCompiler < ::Prism::MutationCompiler # @@foo &&= bar # @@ -7300,7 +8594,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo && @@foo = bar # - # source://prism//prism/desugar_compiler.rb#12 + # source://prism//lib/prism/desugar_compiler.rb#12 def visit_class_variable_and_write_node(node); end # @@foo += bar @@ -7309,7 +8603,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # @@foo = @@foo + bar # - # source://prism//prism/desugar_compiler.rb#30 + # source://prism//lib/prism/desugar_compiler.rb#30 def visit_class_variable_operator_write_node(node); end # @@foo ||= bar @@ -7318,7 +8612,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(@@foo) ? @@foo : @@foo = bar # - # source://prism//prism/desugar_compiler.rb#21 + # source://prism//lib/prism/desugar_compiler.rb#21 def visit_class_variable_or_write_node(node); end # Foo &&= bar @@ -7327,7 +8621,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo && Foo = bar # - # source://prism//prism/desugar_compiler.rb#39 + # source://prism//lib/prism/desugar_compiler.rb#39 def visit_constant_and_write_node(node); end # Foo += bar @@ -7336,7 +8630,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # Foo = Foo + bar # - # source://prism//prism/desugar_compiler.rb#57 + # source://prism//lib/prism/desugar_compiler.rb#57 def visit_constant_operator_write_node(node); end # Foo ||= bar @@ -7345,7 +8639,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?(Foo) ? Foo : Foo = bar # - # source://prism//prism/desugar_compiler.rb#48 + # source://prism//lib/prism/desugar_compiler.rb#48 def visit_constant_or_write_node(node); end # $foo &&= bar @@ -7354,7 +8648,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo && $foo = bar # - # source://prism//prism/desugar_compiler.rb#66 + # source://prism//lib/prism/desugar_compiler.rb#66 def visit_global_variable_and_write_node(node); end # $foo += bar @@ -7363,7 +8657,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # $foo = $foo + bar # - # source://prism//prism/desugar_compiler.rb#84 + # source://prism//lib/prism/desugar_compiler.rb#84 def visit_global_variable_operator_write_node(node); end # $foo ||= bar @@ -7372,22 +8666,22 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # defined?($foo) ? $foo : $foo = bar # - # source://prism//prism/desugar_compiler.rb#75 + # source://prism//lib/prism/desugar_compiler.rb#75 def visit_global_variable_or_write_node(node); end # becomes # - # source://prism//prism/desugar_compiler.rb#93 + # source://prism//lib/prism/desugar_compiler.rb#93 def visit_instance_variable_and_write_node(node); end # becomes # - # source://prism//prism/desugar_compiler.rb#111 + # source://prism//lib/prism/desugar_compiler.rb#111 def visit_instance_variable_operator_write_node(node); end # becomes # - # source://prism//prism/desugar_compiler.rb#102 + # source://prism//lib/prism/desugar_compiler.rb#102 def visit_instance_variable_or_write_node(node); end # foo &&= bar @@ -7396,7 +8690,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo && foo = bar # - # source://prism//prism/desugar_compiler.rb#120 + # source://prism//lib/prism/desugar_compiler.rb#120 def visit_local_variable_and_write_node(node); end # foo += bar @@ -7405,7 +8699,7 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo = foo + bar # - # source://prism//prism/desugar_compiler.rb#138 + # source://prism//lib/prism/desugar_compiler.rb#138 def visit_local_variable_operator_write_node(node); end # foo ||= bar @@ -7414,29 +8708,29 @@ class Prism::DesugarCompiler < ::Prism::MutationCompiler # # foo || foo = bar # - # source://prism//prism/desugar_compiler.rb#129 + # source://prism//lib/prism/desugar_compiler.rb#129 def visit_local_variable_or_write_node(node); end private # Desugar `x &&= y` to `x && x = y` # - # source://prism//prism/desugar_compiler.rb#145 + # source://prism//lib/prism/desugar_compiler.rb#145 def desugar_and_write_node(node, read_class, write_class, *arguments); end # Desugar `x += y` to `x = x + y` # - # source://prism//prism/desugar_compiler.rb#155 + # source://prism//lib/prism/desugar_compiler.rb#155 def desugar_operator_write_node(node, read_class, write_class, *arguments); end # Desugar `x ||= y` to `defined?(x) ? x : x = y` # - # source://prism//prism/desugar_compiler.rb#187 + # source://prism//lib/prism/desugar_compiler.rb#187 def desugar_or_write_defined_node(node, read_class, write_class, *arguments); end # Desugar `x ||= y` to `x || x = y` # - # source://prism//prism/desugar_compiler.rb#177 + # source://prism//lib/prism/desugar_compiler.rb#177 def desugar_or_write_node(node, read_class, write_class, *arguments); end end @@ -7470,2755 +8764,2718 @@ end # # integer = result.value.statements.body.first.receiver.receiver # dispatcher.dispatch_once(integer) +# +# source://prism//lib/prism/dispatcher.rb#40 class Prism::Dispatcher < ::Prism::Visitor # Initialize a new dispatcher. # # @return [Dispatcher] a new instance of Dispatcher # - # source://prism//prism/dispatcher.rb#45 + # source://prism//lib/prism/dispatcher.rb#45 def initialize; end # Walks `root` dispatching events to all registered listeners. # # def dispatch: (Node) -> void # - # source://prism//prism/visitor.rb#16 + # source://prism//lib/prism/visitor.rb#16 def dispatch(node); end # Dispatches a single event for `node` to all registered listeners. # # def dispatch_once: (Node) -> void # - # source://prism//prism/dispatcher.rb#64 + # source://prism//lib/prism/dispatcher.rb#64 def dispatch_once(node); end # attr_reader listeners: Hash[Symbol, Array[Listener]] # - # source://prism//prism/dispatcher.rb#42 + # source://prism//lib/prism/dispatcher.rb#42 def listeners; end # Register a listener for one or more events. # # def register: (Listener, *Symbol) -> void # - # source://prism//prism/dispatcher.rb#52 + # source://prism//lib/prism/dispatcher.rb#52 def register(listener, *events); end # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#70 + # source://prism//lib/prism/dispatcher.rb#70 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#78 + # source://prism//lib/prism/dispatcher.rb#78 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#86 + # source://prism//lib/prism/dispatcher.rb#86 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#94 + # source://prism//lib/prism/dispatcher.rb#94 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#102 + # source://prism//lib/prism/dispatcher.rb#102 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#110 + # source://prism//lib/prism/dispatcher.rb#110 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#118 + # source://prism//lib/prism/dispatcher.rb#118 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#126 + # source://prism//lib/prism/dispatcher.rb#126 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#134 + # source://prism//lib/prism/dispatcher.rb#134 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#142 + # source://prism//lib/prism/dispatcher.rb#142 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#150 + # source://prism//lib/prism/dispatcher.rb#150 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#158 + # source://prism//lib/prism/dispatcher.rb#158 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#166 + # source://prism//lib/prism/dispatcher.rb#166 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#174 + # source://prism//lib/prism/dispatcher.rb#174 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#182 + # source://prism//lib/prism/dispatcher.rb#182 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#190 + # source://prism//lib/prism/dispatcher.rb#190 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#198 + # source://prism//lib/prism/dispatcher.rb#198 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#206 + # source://prism//lib/prism/dispatcher.rb#206 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#214 + # source://prism//lib/prism/dispatcher.rb#214 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#222 + # source://prism//lib/prism/dispatcher.rb#222 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#230 + # source://prism//lib/prism/dispatcher.rb#230 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#238 + # source://prism//lib/prism/dispatcher.rb#238 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#246 + # source://prism//lib/prism/dispatcher.rb#246 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#254 + # source://prism//lib/prism/dispatcher.rb#254 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#262 + # source://prism//lib/prism/dispatcher.rb#262 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#270 + # source://prism//lib/prism/dispatcher.rb#270 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#278 + # source://prism//lib/prism/dispatcher.rb#278 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#286 + # source://prism//lib/prism/dispatcher.rb#286 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#294 + # source://prism//lib/prism/dispatcher.rb#294 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#302 + # source://prism//lib/prism/dispatcher.rb#302 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#310 + # source://prism//lib/prism/dispatcher.rb#310 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#318 + # source://prism//lib/prism/dispatcher.rb#318 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#326 + # source://prism//lib/prism/dispatcher.rb#326 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#334 + # source://prism//lib/prism/dispatcher.rb#334 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#342 + # source://prism//lib/prism/dispatcher.rb#342 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#350 + # source://prism//lib/prism/dispatcher.rb#350 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#358 + # source://prism//lib/prism/dispatcher.rb#358 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#366 + # source://prism//lib/prism/dispatcher.rb#366 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#374 + # source://prism//lib/prism/dispatcher.rb#374 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#382 + # source://prism//lib/prism/dispatcher.rb#382 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#390 + # source://prism//lib/prism/dispatcher.rb#390 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#398 + # source://prism//lib/prism/dispatcher.rb#398 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#406 + # source://prism//lib/prism/dispatcher.rb#406 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#414 + # source://prism//lib/prism/dispatcher.rb#414 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#422 + # source://prism//lib/prism/dispatcher.rb#422 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#430 + # source://prism//lib/prism/dispatcher.rb#430 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#438 + # source://prism//lib/prism/dispatcher.rb#438 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#446 + # source://prism//lib/prism/dispatcher.rb#446 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#454 + # source://prism//lib/prism/dispatcher.rb#454 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#462 + # source://prism//lib/prism/dispatcher.rb#462 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#470 + # source://prism//lib/prism/dispatcher.rb#470 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#478 + # source://prism//lib/prism/dispatcher.rb#478 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#486 + # source://prism//lib/prism/dispatcher.rb#486 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#494 + # source://prism//lib/prism/dispatcher.rb#494 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#502 + # source://prism//lib/prism/dispatcher.rb#502 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#510 + # source://prism//lib/prism/dispatcher.rb#510 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#518 + # source://prism//lib/prism/dispatcher.rb#518 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#526 + # source://prism//lib/prism/dispatcher.rb#526 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#534 + # source://prism//lib/prism/dispatcher.rb#534 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#542 + # source://prism//lib/prism/dispatcher.rb#542 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#550 + # source://prism//lib/prism/dispatcher.rb#550 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#558 + # source://prism//lib/prism/dispatcher.rb#558 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#566 + # source://prism//lib/prism/dispatcher.rb#566 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#574 + # source://prism//lib/prism/dispatcher.rb#574 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#582 + # source://prism//lib/prism/dispatcher.rb#582 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#590 + # source://prism//lib/prism/dispatcher.rb#590 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#598 + # source://prism//lib/prism/dispatcher.rb#598 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#606 + # source://prism//lib/prism/dispatcher.rb#606 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#614 + # source://prism//lib/prism/dispatcher.rb#614 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#622 + # source://prism//lib/prism/dispatcher.rb#622 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#630 + # source://prism//lib/prism/dispatcher.rb#630 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#638 + # source://prism//lib/prism/dispatcher.rb#638 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#646 + # source://prism//lib/prism/dispatcher.rb#646 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#654 + # source://prism//lib/prism/dispatcher.rb#654 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#662 + # source://prism//lib/prism/dispatcher.rb#662 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#670 + # source://prism//lib/prism/dispatcher.rb#670 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#678 + # source://prism//lib/prism/dispatcher.rb#678 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#686 + # source://prism//lib/prism/dispatcher.rb#686 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#694 + # source://prism//lib/prism/dispatcher.rb#694 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#702 + # source://prism//lib/prism/dispatcher.rb#702 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#710 + # source://prism//lib/prism/dispatcher.rb#710 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#718 + # source://prism//lib/prism/dispatcher.rb#718 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#726 + # source://prism//lib/prism/dispatcher.rb#726 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#734 + # source://prism//lib/prism/dispatcher.rb#734 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#742 + # source://prism//lib/prism/dispatcher.rb#742 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#750 + # source://prism//lib/prism/dispatcher.rb#750 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#758 + # source://prism//lib/prism/dispatcher.rb#758 def visit_interpolated_x_string_node(node); end # Dispatch enter and leave events for KeywordHashNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#766 + # source://prism//lib/prism/dispatcher.rb#766 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#774 + # source://prism//lib/prism/dispatcher.rb#774 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#782 + # source://prism//lib/prism/dispatcher.rb#782 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#790 + # source://prism//lib/prism/dispatcher.rb#790 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#798 + # source://prism//lib/prism/dispatcher.rb#798 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#806 + # source://prism//lib/prism/dispatcher.rb#806 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#814 + # source://prism//lib/prism/dispatcher.rb#814 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#822 + # source://prism//lib/prism/dispatcher.rb#822 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#830 + # source://prism//lib/prism/dispatcher.rb#830 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#838 + # source://prism//lib/prism/dispatcher.rb#838 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#846 + # source://prism//lib/prism/dispatcher.rb#846 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#854 + # source://prism//lib/prism/dispatcher.rb#854 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#862 + # source://prism//lib/prism/dispatcher.rb#862 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#870 + # source://prism//lib/prism/dispatcher.rb#870 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#878 + # source://prism//lib/prism/dispatcher.rb#878 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#886 + # source://prism//lib/prism/dispatcher.rb#886 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#894 + # source://prism//lib/prism/dispatcher.rb#894 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#902 + # source://prism//lib/prism/dispatcher.rb#902 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#910 + # source://prism//lib/prism/dispatcher.rb#910 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#918 + # source://prism//lib/prism/dispatcher.rb#918 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#926 + # source://prism//lib/prism/dispatcher.rb#926 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#934 + # source://prism//lib/prism/dispatcher.rb#934 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#942 + # source://prism//lib/prism/dispatcher.rb#942 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#950 + # source://prism//lib/prism/dispatcher.rb#950 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#958 + # source://prism//lib/prism/dispatcher.rb#958 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#966 + # source://prism//lib/prism/dispatcher.rb#966 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#974 + # source://prism//lib/prism/dispatcher.rb#974 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#982 + # source://prism//lib/prism/dispatcher.rb#982 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#990 + # source://prism//lib/prism/dispatcher.rb#990 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#998 + # source://prism//lib/prism/dispatcher.rb#998 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1006 + # source://prism//lib/prism/dispatcher.rb#1006 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1014 + # source://prism//lib/prism/dispatcher.rb#1014 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1022 + # source://prism//lib/prism/dispatcher.rb#1022 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1030 + # source://prism//lib/prism/dispatcher.rb#1030 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1038 + # source://prism//lib/prism/dispatcher.rb#1038 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1046 + # source://prism//lib/prism/dispatcher.rb#1046 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1054 + # source://prism//lib/prism/dispatcher.rb#1054 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1062 + # source://prism//lib/prism/dispatcher.rb#1062 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1070 + # source://prism//lib/prism/dispatcher.rb#1070 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1078 + # source://prism//lib/prism/dispatcher.rb#1078 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1086 + # source://prism//lib/prism/dispatcher.rb#1086 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1094 + # source://prism//lib/prism/dispatcher.rb#1094 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1102 + # source://prism//lib/prism/dispatcher.rb#1102 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1110 + # source://prism//lib/prism/dispatcher.rb#1110 def visit_self_node(node); end # Dispatch enter and leave events for SingletonClassNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1118 + # source://prism//lib/prism/dispatcher.rb#1118 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1126 + # source://prism//lib/prism/dispatcher.rb#1126 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1134 + # source://prism//lib/prism/dispatcher.rb#1134 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1142 + # source://prism//lib/prism/dispatcher.rb#1142 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1150 + # source://prism//lib/prism/dispatcher.rb#1150 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1158 + # source://prism//lib/prism/dispatcher.rb#1158 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1166 + # source://prism//lib/prism/dispatcher.rb#1166 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1174 + # source://prism//lib/prism/dispatcher.rb#1174 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1182 + # source://prism//lib/prism/dispatcher.rb#1182 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1190 + # source://prism//lib/prism/dispatcher.rb#1190 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1198 + # source://prism//lib/prism/dispatcher.rb#1198 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1206 + # source://prism//lib/prism/dispatcher.rb#1206 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1214 + # source://prism//lib/prism/dispatcher.rb#1214 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1222 + # source://prism//lib/prism/dispatcher.rb#1222 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1230 + # source://prism//lib/prism/dispatcher.rb#1230 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1238 + # source://prism//lib/prism/dispatcher.rb#1238 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes and continue # walking the tree. # - # source://prism//prism/dispatcher.rb#1246 + # source://prism//lib/prism/dispatcher.rb#1246 def visit_yield_node(node); end end +# source://prism//lib/prism/dispatcher.rb#1252 class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor # @return [DispatchOnce] a new instance of DispatchOnce # - # source://prism//prism/dispatcher.rb#1255 + # source://prism//lib/prism/dispatcher.rb#1255 def initialize(listeners); end # Returns the value of attribute listeners. # - # source://prism//prism/dispatcher.rb#1253 + # source://prism//lib/prism/dispatcher.rb#1253 def listeners; end # Dispatch enter and leave events for AliasGlobalVariableNode nodes. # - # source://prism//prism/dispatcher.rb#1260 + # source://prism//lib/prism/dispatcher.rb#1260 def visit_alias_global_variable_node(node); end # Dispatch enter and leave events for AliasMethodNode nodes. # - # source://prism//prism/dispatcher.rb#1266 + # source://prism//lib/prism/dispatcher.rb#1266 def visit_alias_method_node(node); end # Dispatch enter and leave events for AlternationPatternNode nodes. # - # source://prism//prism/dispatcher.rb#1272 + # source://prism//lib/prism/dispatcher.rb#1272 def visit_alternation_pattern_node(node); end # Dispatch enter and leave events for AndNode nodes. # - # source://prism//prism/dispatcher.rb#1278 + # source://prism//lib/prism/dispatcher.rb#1278 def visit_and_node(node); end # Dispatch enter and leave events for ArgumentsNode nodes. # - # source://prism//prism/dispatcher.rb#1284 + # source://prism//lib/prism/dispatcher.rb#1284 def visit_arguments_node(node); end # Dispatch enter and leave events for ArrayNode nodes. # - # source://prism//prism/dispatcher.rb#1290 + # source://prism//lib/prism/dispatcher.rb#1290 def visit_array_node(node); end # Dispatch enter and leave events for ArrayPatternNode nodes. # - # source://prism//prism/dispatcher.rb#1296 + # source://prism//lib/prism/dispatcher.rb#1296 def visit_array_pattern_node(node); end # Dispatch enter and leave events for AssocNode nodes. # - # source://prism//prism/dispatcher.rb#1302 + # source://prism//lib/prism/dispatcher.rb#1302 def visit_assoc_node(node); end # Dispatch enter and leave events for AssocSplatNode nodes. # - # source://prism//prism/dispatcher.rb#1308 + # source://prism//lib/prism/dispatcher.rb#1308 def visit_assoc_splat_node(node); end # Dispatch enter and leave events for BackReferenceReadNode nodes. # - # source://prism//prism/dispatcher.rb#1314 + # source://prism//lib/prism/dispatcher.rb#1314 def visit_back_reference_read_node(node); end # Dispatch enter and leave events for BeginNode nodes. # - # source://prism//prism/dispatcher.rb#1320 + # source://prism//lib/prism/dispatcher.rb#1320 def visit_begin_node(node); end # Dispatch enter and leave events for BlockArgumentNode nodes. # - # source://prism//prism/dispatcher.rb#1326 + # source://prism//lib/prism/dispatcher.rb#1326 def visit_block_argument_node(node); end # Dispatch enter and leave events for BlockLocalVariableNode nodes. # - # source://prism//prism/dispatcher.rb#1332 + # source://prism//lib/prism/dispatcher.rb#1332 def visit_block_local_variable_node(node); end # Dispatch enter and leave events for BlockNode nodes. # - # source://prism//prism/dispatcher.rb#1338 + # source://prism//lib/prism/dispatcher.rb#1338 def visit_block_node(node); end # Dispatch enter and leave events for BlockParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1344 + # source://prism//lib/prism/dispatcher.rb#1344 def visit_block_parameter_node(node); end # Dispatch enter and leave events for BlockParametersNode nodes. # - # source://prism//prism/dispatcher.rb#1350 + # source://prism//lib/prism/dispatcher.rb#1350 def visit_block_parameters_node(node); end # Dispatch enter and leave events for BreakNode nodes. # - # source://prism//prism/dispatcher.rb#1356 + # source://prism//lib/prism/dispatcher.rb#1356 def visit_break_node(node); end # Dispatch enter and leave events for CallAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1362 + # source://prism//lib/prism/dispatcher.rb#1362 def visit_call_and_write_node(node); end # Dispatch enter and leave events for CallNode nodes. # - # source://prism//prism/dispatcher.rb#1368 + # source://prism//lib/prism/dispatcher.rb#1368 def visit_call_node(node); end # Dispatch enter and leave events for CallOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1374 + # source://prism//lib/prism/dispatcher.rb#1374 def visit_call_operator_write_node(node); end # Dispatch enter and leave events for CallOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1380 + # source://prism//lib/prism/dispatcher.rb#1380 def visit_call_or_write_node(node); end # Dispatch enter and leave events for CallTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1386 + # source://prism//lib/prism/dispatcher.rb#1386 def visit_call_target_node(node); end # Dispatch enter and leave events for CapturePatternNode nodes. # - # source://prism//prism/dispatcher.rb#1392 + # source://prism//lib/prism/dispatcher.rb#1392 def visit_capture_pattern_node(node); end # Dispatch enter and leave events for CaseMatchNode nodes. # - # source://prism//prism/dispatcher.rb#1398 + # source://prism//lib/prism/dispatcher.rb#1398 def visit_case_match_node(node); end # Dispatch enter and leave events for CaseNode nodes. # - # source://prism//prism/dispatcher.rb#1404 + # source://prism//lib/prism/dispatcher.rb#1404 def visit_case_node(node); end # Dispatch enter and leave events for ClassNode nodes. # - # source://prism//prism/dispatcher.rb#1410 + # source://prism//lib/prism/dispatcher.rb#1410 def visit_class_node(node); end # Dispatch enter and leave events for ClassVariableAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1416 + # source://prism//lib/prism/dispatcher.rb#1416 def visit_class_variable_and_write_node(node); end # Dispatch enter and leave events for ClassVariableOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1422 + # source://prism//lib/prism/dispatcher.rb#1422 def visit_class_variable_operator_write_node(node); end # Dispatch enter and leave events for ClassVariableOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1428 + # source://prism//lib/prism/dispatcher.rb#1428 def visit_class_variable_or_write_node(node); end # Dispatch enter and leave events for ClassVariableReadNode nodes. # - # source://prism//prism/dispatcher.rb#1434 + # source://prism//lib/prism/dispatcher.rb#1434 def visit_class_variable_read_node(node); end # Dispatch enter and leave events for ClassVariableTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1440 + # source://prism//lib/prism/dispatcher.rb#1440 def visit_class_variable_target_node(node); end # Dispatch enter and leave events for ClassVariableWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1446 + # source://prism//lib/prism/dispatcher.rb#1446 def visit_class_variable_write_node(node); end # Dispatch enter and leave events for ConstantAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1452 + # source://prism//lib/prism/dispatcher.rb#1452 def visit_constant_and_write_node(node); end # Dispatch enter and leave events for ConstantOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1458 + # source://prism//lib/prism/dispatcher.rb#1458 def visit_constant_operator_write_node(node); end # Dispatch enter and leave events for ConstantOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1464 + # source://prism//lib/prism/dispatcher.rb#1464 def visit_constant_or_write_node(node); end # Dispatch enter and leave events for ConstantPathAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1470 + # source://prism//lib/prism/dispatcher.rb#1470 def visit_constant_path_and_write_node(node); end # Dispatch enter and leave events for ConstantPathNode nodes. # - # source://prism//prism/dispatcher.rb#1476 + # source://prism//lib/prism/dispatcher.rb#1476 def visit_constant_path_node(node); end # Dispatch enter and leave events for ConstantPathOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1482 + # source://prism//lib/prism/dispatcher.rb#1482 def visit_constant_path_operator_write_node(node); end # Dispatch enter and leave events for ConstantPathOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1488 + # source://prism//lib/prism/dispatcher.rb#1488 def visit_constant_path_or_write_node(node); end # Dispatch enter and leave events for ConstantPathTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1494 + # source://prism//lib/prism/dispatcher.rb#1494 def visit_constant_path_target_node(node); end # Dispatch enter and leave events for ConstantPathWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1500 + # source://prism//lib/prism/dispatcher.rb#1500 def visit_constant_path_write_node(node); end # Dispatch enter and leave events for ConstantReadNode nodes. # - # source://prism//prism/dispatcher.rb#1506 + # source://prism//lib/prism/dispatcher.rb#1506 def visit_constant_read_node(node); end # Dispatch enter and leave events for ConstantTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1512 + # source://prism//lib/prism/dispatcher.rb#1512 def visit_constant_target_node(node); end # Dispatch enter and leave events for ConstantWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1518 + # source://prism//lib/prism/dispatcher.rb#1518 def visit_constant_write_node(node); end # Dispatch enter and leave events for DefNode nodes. # - # source://prism//prism/dispatcher.rb#1524 + # source://prism//lib/prism/dispatcher.rb#1524 def visit_def_node(node); end # Dispatch enter and leave events for DefinedNode nodes. # - # source://prism//prism/dispatcher.rb#1530 + # source://prism//lib/prism/dispatcher.rb#1530 def visit_defined_node(node); end # Dispatch enter and leave events for ElseNode nodes. # - # source://prism//prism/dispatcher.rb#1536 + # source://prism//lib/prism/dispatcher.rb#1536 def visit_else_node(node); end # Dispatch enter and leave events for EmbeddedStatementsNode nodes. # - # source://prism//prism/dispatcher.rb#1542 + # source://prism//lib/prism/dispatcher.rb#1542 def visit_embedded_statements_node(node); end # Dispatch enter and leave events for EmbeddedVariableNode nodes. # - # source://prism//prism/dispatcher.rb#1548 + # source://prism//lib/prism/dispatcher.rb#1548 def visit_embedded_variable_node(node); end # Dispatch enter and leave events for EnsureNode nodes. # - # source://prism//prism/dispatcher.rb#1554 + # source://prism//lib/prism/dispatcher.rb#1554 def visit_ensure_node(node); end # Dispatch enter and leave events for FalseNode nodes. # - # source://prism//prism/dispatcher.rb#1560 + # source://prism//lib/prism/dispatcher.rb#1560 def visit_false_node(node); end # Dispatch enter and leave events for FindPatternNode nodes. # - # source://prism//prism/dispatcher.rb#1566 + # source://prism//lib/prism/dispatcher.rb#1566 def visit_find_pattern_node(node); end # Dispatch enter and leave events for FlipFlopNode nodes. # - # source://prism//prism/dispatcher.rb#1572 + # source://prism//lib/prism/dispatcher.rb#1572 def visit_flip_flop_node(node); end # Dispatch enter and leave events for FloatNode nodes. # - # source://prism//prism/dispatcher.rb#1578 + # source://prism//lib/prism/dispatcher.rb#1578 def visit_float_node(node); end # Dispatch enter and leave events for ForNode nodes. # - # source://prism//prism/dispatcher.rb#1584 + # source://prism//lib/prism/dispatcher.rb#1584 def visit_for_node(node); end # Dispatch enter and leave events for ForwardingArgumentsNode nodes. # - # source://prism//prism/dispatcher.rb#1590 + # source://prism//lib/prism/dispatcher.rb#1590 def visit_forwarding_arguments_node(node); end # Dispatch enter and leave events for ForwardingParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1596 + # source://prism//lib/prism/dispatcher.rb#1596 def visit_forwarding_parameter_node(node); end # Dispatch enter and leave events for ForwardingSuperNode nodes. # - # source://prism//prism/dispatcher.rb#1602 + # source://prism//lib/prism/dispatcher.rb#1602 def visit_forwarding_super_node(node); end # Dispatch enter and leave events for GlobalVariableAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1608 + # source://prism//lib/prism/dispatcher.rb#1608 def visit_global_variable_and_write_node(node); end # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1614 + # source://prism//lib/prism/dispatcher.rb#1614 def visit_global_variable_operator_write_node(node); end # Dispatch enter and leave events for GlobalVariableOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1620 + # source://prism//lib/prism/dispatcher.rb#1620 def visit_global_variable_or_write_node(node); end # Dispatch enter and leave events for GlobalVariableReadNode nodes. # - # source://prism//prism/dispatcher.rb#1626 + # source://prism//lib/prism/dispatcher.rb#1626 def visit_global_variable_read_node(node); end # Dispatch enter and leave events for GlobalVariableTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1632 + # source://prism//lib/prism/dispatcher.rb#1632 def visit_global_variable_target_node(node); end # Dispatch enter and leave events for GlobalVariableWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1638 + # source://prism//lib/prism/dispatcher.rb#1638 def visit_global_variable_write_node(node); end # Dispatch enter and leave events for HashNode nodes. # - # source://prism//prism/dispatcher.rb#1644 + # source://prism//lib/prism/dispatcher.rb#1644 def visit_hash_node(node); end # Dispatch enter and leave events for HashPatternNode nodes. # - # source://prism//prism/dispatcher.rb#1650 + # source://prism//lib/prism/dispatcher.rb#1650 def visit_hash_pattern_node(node); end # Dispatch enter and leave events for IfNode nodes. # - # source://prism//prism/dispatcher.rb#1656 + # source://prism//lib/prism/dispatcher.rb#1656 def visit_if_node(node); end # Dispatch enter and leave events for ImaginaryNode nodes. # - # source://prism//prism/dispatcher.rb#1662 + # source://prism//lib/prism/dispatcher.rb#1662 def visit_imaginary_node(node); end # Dispatch enter and leave events for ImplicitNode nodes. # - # source://prism//prism/dispatcher.rb#1668 + # source://prism//lib/prism/dispatcher.rb#1668 def visit_implicit_node(node); end # Dispatch enter and leave events for ImplicitRestNode nodes. # - # source://prism//prism/dispatcher.rb#1674 + # source://prism//lib/prism/dispatcher.rb#1674 def visit_implicit_rest_node(node); end # Dispatch enter and leave events for InNode nodes. # - # source://prism//prism/dispatcher.rb#1680 + # source://prism//lib/prism/dispatcher.rb#1680 def visit_in_node(node); end # Dispatch enter and leave events for IndexAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1686 + # source://prism//lib/prism/dispatcher.rb#1686 def visit_index_and_write_node(node); end # Dispatch enter and leave events for IndexOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1692 + # source://prism//lib/prism/dispatcher.rb#1692 def visit_index_operator_write_node(node); end # Dispatch enter and leave events for IndexOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1698 + # source://prism//lib/prism/dispatcher.rb#1698 def visit_index_or_write_node(node); end # Dispatch enter and leave events for IndexTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1704 + # source://prism//lib/prism/dispatcher.rb#1704 def visit_index_target_node(node); end # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1710 + # source://prism//lib/prism/dispatcher.rb#1710 def visit_instance_variable_and_write_node(node); end # Dispatch enter and leave events for InstanceVariableOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1716 + # source://prism//lib/prism/dispatcher.rb#1716 def visit_instance_variable_operator_write_node(node); end # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1722 + # source://prism//lib/prism/dispatcher.rb#1722 def visit_instance_variable_or_write_node(node); end # Dispatch enter and leave events for InstanceVariableReadNode nodes. # - # source://prism//prism/dispatcher.rb#1728 + # source://prism//lib/prism/dispatcher.rb#1728 def visit_instance_variable_read_node(node); end # Dispatch enter and leave events for InstanceVariableTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1734 + # source://prism//lib/prism/dispatcher.rb#1734 def visit_instance_variable_target_node(node); end # Dispatch enter and leave events for InstanceVariableWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1740 + # source://prism//lib/prism/dispatcher.rb#1740 def visit_instance_variable_write_node(node); end # Dispatch enter and leave events for IntegerNode nodes. # - # source://prism//prism/dispatcher.rb#1746 + # source://prism//lib/prism/dispatcher.rb#1746 def visit_integer_node(node); end # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes. # - # source://prism//prism/dispatcher.rb#1752 + # source://prism//lib/prism/dispatcher.rb#1752 def visit_interpolated_match_last_line_node(node); end # Dispatch enter and leave events for InterpolatedRegularExpressionNode nodes. # - # source://prism//prism/dispatcher.rb#1758 + # source://prism//lib/prism/dispatcher.rb#1758 def visit_interpolated_regular_expression_node(node); end # Dispatch enter and leave events for InterpolatedStringNode nodes. # - # source://prism//prism/dispatcher.rb#1764 + # source://prism//lib/prism/dispatcher.rb#1764 def visit_interpolated_string_node(node); end # Dispatch enter and leave events for InterpolatedSymbolNode nodes. # - # source://prism//prism/dispatcher.rb#1770 + # source://prism//lib/prism/dispatcher.rb#1770 def visit_interpolated_symbol_node(node); end # Dispatch enter and leave events for InterpolatedXStringNode nodes. # - # source://prism//prism/dispatcher.rb#1776 + # source://prism//lib/prism/dispatcher.rb#1776 def visit_interpolated_x_string_node(node); end # Dispatch enter and leave events for KeywordHashNode nodes. # - # source://prism//prism/dispatcher.rb#1782 + # source://prism//lib/prism/dispatcher.rb#1782 def visit_keyword_hash_node(node); end # Dispatch enter and leave events for KeywordRestParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1788 + # source://prism//lib/prism/dispatcher.rb#1788 def visit_keyword_rest_parameter_node(node); end # Dispatch enter and leave events for LambdaNode nodes. # - # source://prism//prism/dispatcher.rb#1794 + # source://prism//lib/prism/dispatcher.rb#1794 def visit_lambda_node(node); end # Dispatch enter and leave events for LocalVariableAndWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1800 + # source://prism//lib/prism/dispatcher.rb#1800 def visit_local_variable_and_write_node(node); end # Dispatch enter and leave events for LocalVariableOperatorWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1806 + # source://prism//lib/prism/dispatcher.rb#1806 def visit_local_variable_operator_write_node(node); end # Dispatch enter and leave events for LocalVariableOrWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1812 + # source://prism//lib/prism/dispatcher.rb#1812 def visit_local_variable_or_write_node(node); end # Dispatch enter and leave events for LocalVariableReadNode nodes. # - # source://prism//prism/dispatcher.rb#1818 + # source://prism//lib/prism/dispatcher.rb#1818 def visit_local_variable_read_node(node); end # Dispatch enter and leave events for LocalVariableTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1824 + # source://prism//lib/prism/dispatcher.rb#1824 def visit_local_variable_target_node(node); end # Dispatch enter and leave events for LocalVariableWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1830 + # source://prism//lib/prism/dispatcher.rb#1830 def visit_local_variable_write_node(node); end # Dispatch enter and leave events for MatchLastLineNode nodes. # - # source://prism//prism/dispatcher.rb#1836 + # source://prism//lib/prism/dispatcher.rb#1836 def visit_match_last_line_node(node); end # Dispatch enter and leave events for MatchPredicateNode nodes. # - # source://prism//prism/dispatcher.rb#1842 + # source://prism//lib/prism/dispatcher.rb#1842 def visit_match_predicate_node(node); end # Dispatch enter and leave events for MatchRequiredNode nodes. # - # source://prism//prism/dispatcher.rb#1848 + # source://prism//lib/prism/dispatcher.rb#1848 def visit_match_required_node(node); end # Dispatch enter and leave events for MatchWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1854 + # source://prism//lib/prism/dispatcher.rb#1854 def visit_match_write_node(node); end # Dispatch enter and leave events for MissingNode nodes. # - # source://prism//prism/dispatcher.rb#1860 + # source://prism//lib/prism/dispatcher.rb#1860 def visit_missing_node(node); end # Dispatch enter and leave events for ModuleNode nodes. # - # source://prism//prism/dispatcher.rb#1866 + # source://prism//lib/prism/dispatcher.rb#1866 def visit_module_node(node); end # Dispatch enter and leave events for MultiTargetNode nodes. # - # source://prism//prism/dispatcher.rb#1872 + # source://prism//lib/prism/dispatcher.rb#1872 def visit_multi_target_node(node); end # Dispatch enter and leave events for MultiWriteNode nodes. # - # source://prism//prism/dispatcher.rb#1878 + # source://prism//lib/prism/dispatcher.rb#1878 def visit_multi_write_node(node); end # Dispatch enter and leave events for NextNode nodes. # - # source://prism//prism/dispatcher.rb#1884 + # source://prism//lib/prism/dispatcher.rb#1884 def visit_next_node(node); end # Dispatch enter and leave events for NilNode nodes. # - # source://prism//prism/dispatcher.rb#1890 + # source://prism//lib/prism/dispatcher.rb#1890 def visit_nil_node(node); end # Dispatch enter and leave events for NoKeywordsParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1896 + # source://prism//lib/prism/dispatcher.rb#1896 def visit_no_keywords_parameter_node(node); end # Dispatch enter and leave events for NumberedParametersNode nodes. # - # source://prism//prism/dispatcher.rb#1902 + # source://prism//lib/prism/dispatcher.rb#1902 def visit_numbered_parameters_node(node); end # Dispatch enter and leave events for NumberedReferenceReadNode nodes. # - # source://prism//prism/dispatcher.rb#1908 + # source://prism//lib/prism/dispatcher.rb#1908 def visit_numbered_reference_read_node(node); end # Dispatch enter and leave events for OptionalKeywordParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1914 + # source://prism//lib/prism/dispatcher.rb#1914 def visit_optional_keyword_parameter_node(node); end # Dispatch enter and leave events for OptionalParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1920 + # source://prism//lib/prism/dispatcher.rb#1920 def visit_optional_parameter_node(node); end # Dispatch enter and leave events for OrNode nodes. # - # source://prism//prism/dispatcher.rb#1926 + # source://prism//lib/prism/dispatcher.rb#1926 def visit_or_node(node); end # Dispatch enter and leave events for ParametersNode nodes. # - # source://prism//prism/dispatcher.rb#1932 + # source://prism//lib/prism/dispatcher.rb#1932 def visit_parameters_node(node); end # Dispatch enter and leave events for ParenthesesNode nodes. # - # source://prism//prism/dispatcher.rb#1938 + # source://prism//lib/prism/dispatcher.rb#1938 def visit_parentheses_node(node); end # Dispatch enter and leave events for PinnedExpressionNode nodes. # - # source://prism//prism/dispatcher.rb#1944 + # source://prism//lib/prism/dispatcher.rb#1944 def visit_pinned_expression_node(node); end # Dispatch enter and leave events for PinnedVariableNode nodes. # - # source://prism//prism/dispatcher.rb#1950 + # source://prism//lib/prism/dispatcher.rb#1950 def visit_pinned_variable_node(node); end # Dispatch enter and leave events for PostExecutionNode nodes. # - # source://prism//prism/dispatcher.rb#1956 + # source://prism//lib/prism/dispatcher.rb#1956 def visit_post_execution_node(node); end # Dispatch enter and leave events for PreExecutionNode nodes. # - # source://prism//prism/dispatcher.rb#1962 + # source://prism//lib/prism/dispatcher.rb#1962 def visit_pre_execution_node(node); end # Dispatch enter and leave events for ProgramNode nodes. # - # source://prism//prism/dispatcher.rb#1968 + # source://prism//lib/prism/dispatcher.rb#1968 def visit_program_node(node); end # Dispatch enter and leave events for RangeNode nodes. # - # source://prism//prism/dispatcher.rb#1974 + # source://prism//lib/prism/dispatcher.rb#1974 def visit_range_node(node); end # Dispatch enter and leave events for RationalNode nodes. # - # source://prism//prism/dispatcher.rb#1980 + # source://prism//lib/prism/dispatcher.rb#1980 def visit_rational_node(node); end # Dispatch enter and leave events for RedoNode nodes. # - # source://prism//prism/dispatcher.rb#1986 + # source://prism//lib/prism/dispatcher.rb#1986 def visit_redo_node(node); end # Dispatch enter and leave events for RegularExpressionNode nodes. # - # source://prism//prism/dispatcher.rb#1992 + # source://prism//lib/prism/dispatcher.rb#1992 def visit_regular_expression_node(node); end # Dispatch enter and leave events for RequiredKeywordParameterNode nodes. # - # source://prism//prism/dispatcher.rb#1998 + # source://prism//lib/prism/dispatcher.rb#1998 def visit_required_keyword_parameter_node(node); end # Dispatch enter and leave events for RequiredParameterNode nodes. # - # source://prism//prism/dispatcher.rb#2004 + # source://prism//lib/prism/dispatcher.rb#2004 def visit_required_parameter_node(node); end # Dispatch enter and leave events for RescueModifierNode nodes. # - # source://prism//prism/dispatcher.rb#2010 + # source://prism//lib/prism/dispatcher.rb#2010 def visit_rescue_modifier_node(node); end # Dispatch enter and leave events for RescueNode nodes. # - # source://prism//prism/dispatcher.rb#2016 + # source://prism//lib/prism/dispatcher.rb#2016 def visit_rescue_node(node); end # Dispatch enter and leave events for RestParameterNode nodes. # - # source://prism//prism/dispatcher.rb#2022 + # source://prism//lib/prism/dispatcher.rb#2022 def visit_rest_parameter_node(node); end # Dispatch enter and leave events for RetryNode nodes. # - # source://prism//prism/dispatcher.rb#2028 + # source://prism//lib/prism/dispatcher.rb#2028 def visit_retry_node(node); end # Dispatch enter and leave events for ReturnNode nodes. # - # source://prism//prism/dispatcher.rb#2034 + # source://prism//lib/prism/dispatcher.rb#2034 def visit_return_node(node); end # Dispatch enter and leave events for SelfNode nodes. # - # source://prism//prism/dispatcher.rb#2040 + # source://prism//lib/prism/dispatcher.rb#2040 def visit_self_node(node); end # Dispatch enter and leave events for SingletonClassNode nodes. # - # source://prism//prism/dispatcher.rb#2046 + # source://prism//lib/prism/dispatcher.rb#2046 def visit_singleton_class_node(node); end # Dispatch enter and leave events for SourceEncodingNode nodes. # - # source://prism//prism/dispatcher.rb#2052 + # source://prism//lib/prism/dispatcher.rb#2052 def visit_source_encoding_node(node); end # Dispatch enter and leave events for SourceFileNode nodes. # - # source://prism//prism/dispatcher.rb#2058 + # source://prism//lib/prism/dispatcher.rb#2058 def visit_source_file_node(node); end # Dispatch enter and leave events for SourceLineNode nodes. # - # source://prism//prism/dispatcher.rb#2064 + # source://prism//lib/prism/dispatcher.rb#2064 def visit_source_line_node(node); end # Dispatch enter and leave events for SplatNode nodes. # - # source://prism//prism/dispatcher.rb#2070 + # source://prism//lib/prism/dispatcher.rb#2070 def visit_splat_node(node); end # Dispatch enter and leave events for StatementsNode nodes. # - # source://prism//prism/dispatcher.rb#2076 + # source://prism//lib/prism/dispatcher.rb#2076 def visit_statements_node(node); end # Dispatch enter and leave events for StringNode nodes. # - # source://prism//prism/dispatcher.rb#2082 + # source://prism//lib/prism/dispatcher.rb#2082 def visit_string_node(node); end # Dispatch enter and leave events for SuperNode nodes. # - # source://prism//prism/dispatcher.rb#2088 + # source://prism//lib/prism/dispatcher.rb#2088 def visit_super_node(node); end # Dispatch enter and leave events for SymbolNode nodes. # - # source://prism//prism/dispatcher.rb#2094 + # source://prism//lib/prism/dispatcher.rb#2094 def visit_symbol_node(node); end # Dispatch enter and leave events for TrueNode nodes. # - # source://prism//prism/dispatcher.rb#2100 + # source://prism//lib/prism/dispatcher.rb#2100 def visit_true_node(node); end # Dispatch enter and leave events for UndefNode nodes. # - # source://prism//prism/dispatcher.rb#2106 + # source://prism//lib/prism/dispatcher.rb#2106 def visit_undef_node(node); end # Dispatch enter and leave events for UnlessNode nodes. # - # source://prism//prism/dispatcher.rb#2112 + # source://prism//lib/prism/dispatcher.rb#2112 def visit_unless_node(node); end # Dispatch enter and leave events for UntilNode nodes. # - # source://prism//prism/dispatcher.rb#2118 + # source://prism//lib/prism/dispatcher.rb#2118 def visit_until_node(node); end # Dispatch enter and leave events for WhenNode nodes. # - # source://prism//prism/dispatcher.rb#2124 + # source://prism//lib/prism/dispatcher.rb#2124 def visit_when_node(node); end # Dispatch enter and leave events for WhileNode nodes. # - # source://prism//prism/dispatcher.rb#2130 + # source://prism//lib/prism/dispatcher.rb#2130 def visit_while_node(node); end # Dispatch enter and leave events for XStringNode nodes. # - # source://prism//prism/dispatcher.rb#2136 + # source://prism//lib/prism/dispatcher.rb#2136 def visit_x_string_node(node); end # Dispatch enter and leave events for YieldNode nodes. # - # source://prism//prism/dispatcher.rb#2142 + # source://prism//lib/prism/dispatcher.rb#2142 def visit_yield_node(node); end end -# Represents an `else` clause in a `case`, `if`, or `unless` statement. +# This visitor provides the ability to call Node#to_dot, which converts a +# subtree into a graphviz dot graph. # -# if a then b else c end -# ^^^^^^^^^^ -class Prism::ElseNode < ::Prism::Node - # def initialize: (else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location?, location: Location) -> void +# source://prism//lib/prism/dot_visitor.rb#13 +class Prism::DotVisitor < ::Prism::Visitor + # Initialize a new dot visitor. # - # @return [ElseNode] a new instance of ElseNode + # @return [DotVisitor] a new instance of DotVisitor # - # source://prism//prism/node.rb#5575 - def initialize(else_keyword_loc, statements, end_keyword_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#105 + def initialize; end - # def accept: (visitor: Visitor) -> void + # The digraph that is being built. # - # source://prism//prism/node.rb#5583 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#102 + def digraph; end - # def child_nodes: () -> Array[nil | Node] + # Convert this visitor into a graphviz dot graph string. # - # source://prism//prism/node.rb#5588 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#110 + def to_dot; end - # def comment_targets: () -> Array[Node | Location] + # Visit a AliasGlobalVariableNode node. # - # source://prism//prism/node.rb#5600 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#115 + def visit_alias_global_variable_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a AliasMethodNode node. # - # source://prism//prism/node.rb#5593 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#140 + def visit_alias_method_node(node); end - # def copy: (**params) -> ElseNode + # Visit a AlternationPatternNode node. # - # source://prism//prism/node.rb#5605 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#165 + def visit_alternation_pattern_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a AndNode node. # - # source://prism//prism/node.rb#5588 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#190 + def visit_and_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a ArgumentsNode node. # - # source://prism//prism/node.rb#5618 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#215 + def visit_arguments_node(node); end - # def else_keyword: () -> String + # Visit a ArrayNode node. # - # source://prism//prism/node.rb#5623 - def else_keyword; end + # source://prism//lib/prism/dot_visitor.rb#245 + def visit_array_node(node); end - # attr_reader else_keyword_loc: Location + # Visit a ArrayPatternNode node. # - # source://prism//prism/node.rb#5566 - def else_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#285 + def visit_array_pattern_node(node); end - # def end_keyword: () -> String? + # Visit a AssocNode node. # - # source://prism//prism/node.rb#5628 - def end_keyword; end + # source://prism//lib/prism/dot_visitor.rb#347 + def visit_assoc_node(node); end - # attr_reader end_keyword_loc: Location? + # Visit a AssocSplatNode node. # - # source://prism//prism/node.rb#5572 - def end_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#374 + def visit_assoc_splat_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a BackReferenceReadNode node. # - # source://prism//prism/node.rb#5633 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#397 + def visit_back_reference_read_node(node); end - # attr_reader statements: StatementsNode? + # Visit a BeginNode node. # - # source://prism//prism/node.rb#5569 - def statements; end + # source://prism//lib/prism/dot_visitor.rb#414 + def visit_begin_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. + # Visit a BlockArgumentNode 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/dot_visitor.rb#462 + def visit_block_argument_node(node); end + + # Visit a BlockLocalVariableNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#485 + def visit_block_local_variable_node(node); end + + # Visit a BlockNode node. # - # source://prism//prism/node.rb#5660 - def type; end + # source://prism//lib/prism/dot_visitor.rb#505 + 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//prism/node.rb#5670 - def type; end - end -end + # Visit a BlockParameterNode node. + # + # source://prism//lib/prism/dot_visitor.rb#540 + def visit_block_parameter_node(node); end -# EmbDocComment objects correspond to comments that are surrounded by =begin -# and =end. -class Prism::EmbDocComment < ::Prism::Comment - # Returns a string representation of this comment. + # Visit a BlockParametersNode node. # - # source://prism//prism/parse_result.rb#267 - def inspect; end + # source://prism//lib/prism/dot_visitor.rb#568 + def visit_block_parameters_node(node); end - # This can only be true for inline comments. + # Visit a BreakNode node. # - # @return [Boolean] + # source://prism//lib/prism/dot_visitor.rb#611 + def visit_break_node(node); end + + # Visit a CallAndWriteNode node. # - # source://prism//prism/parse_result.rb#262 - def trailing?; end -end + # source://prism//lib/prism/dot_visitor.rb#634 + def visit_call_and_write_node(node); end -# Represents an interpolated set of statements. -# -# "foo #{bar}" -# ^^^^^^ -class Prism::EmbeddedStatementsNode < ::Prism::Node - # def initialize: (opening_loc: Location, statements: StatementsNode?, closing_loc: Location, location: Location) -> void + # Visit a CallNode node. # - # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode + # source://prism//lib/prism/dot_visitor.rb#680 + def visit_call_node(node); end + + # Visit a CallOperatorWriteNode node. # - # source://prism//prism/node.rb#5690 - def initialize(opening_loc, statements, closing_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#738 + def visit_call_operator_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a CallOrWriteNode node. # - # source://prism//prism/node.rb#5698 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#787 + def visit_call_or_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a CallTargetNode node. # - # source://prism//prism/node.rb#5703 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#833 + def visit_call_target_node(node); end - # def closing: () -> String + # Visit a CapturePatternNode node. # - # source://prism//prism/node.rb#5743 - def closing; end + # source://prism//lib/prism/dot_visitor.rb#863 + def visit_capture_pattern_node(node); end - # attr_reader closing_loc: Location + # Visit a CaseMatchNode node. # - # source://prism//prism/node.rb#5687 - def closing_loc; end + # source://prism//lib/prism/dot_visitor.rb#888 + def visit_case_match_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a CaseNode node. # - # source://prism//prism/node.rb#5715 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#933 + def visit_case_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a ClassNode node. # - # source://prism//prism/node.rb#5708 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#978 + def visit_class_node(node); end - # def copy: (**params) -> EmbeddedStatementsNode + # Visit a ClassVariableAndWriteNode node. # - # source://prism//prism/node.rb#5720 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#1025 + def visit_class_variable_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a ClassVariableOperatorWriteNode node. # - # source://prism//prism/node.rb#5703 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#1052 + def visit_class_variable_operator_write_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a ClassVariableOrWriteNode node. # - # source://prism//prism/node.rb#5733 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#1082 + def visit_class_variable_or_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a ClassVariableReadNode node. # - # source://prism//prism/node.rb#5748 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#1109 + def visit_class_variable_read_node(node); end - # def opening: () -> String + # Visit a ClassVariableTargetNode node. # - # source://prism//prism/node.rb#5738 - def opening; end + # source://prism//lib/prism/dot_visitor.rb#1126 + def visit_class_variable_target_node(node); end - # attr_reader opening_loc: Location + # Visit a ClassVariableWriteNode node. # - # source://prism//prism/node.rb#5681 - def opening_loc; end + # source://prism//lib/prism/dot_visitor.rb#1143 + def visit_class_variable_write_node(node); end - # attr_reader statements: StatementsNode? + # Visit a ConstantAndWriteNode node. # - # source://prism//prism/node.rb#5684 - def statements; end + # source://prism//lib/prism/dot_visitor.rb#1172 + def visit_constant_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. + # Visit a ConstantOperatorWriteNode 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/dot_visitor.rb#1199 + def visit_constant_operator_write_node(node); end + + # Visit a ConstantOrWriteNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#1229 + def visit_constant_or_write_node(node); end + + # Visit a ConstantPathAndWriteNode node. # - # source://prism//prism/node.rb#5775 - def type; end + # source://prism//lib/prism/dot_visitor.rb#1256 + def visit_constant_path_and_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//prism/node.rb#5785 - def type; end - end -end + # Visit a ConstantPathNode node. + # + # source://prism//lib/prism/dot_visitor.rb#1281 + def visit_constant_path_node(node); end -# Represents an interpolated variable. -# -# "foo #@bar" -# ^^^^^ -class Prism::EmbeddedVariableNode < ::Prism::Node - # def initialize: (operator_loc: Location, variable: Node, location: Location) -> void + # Visit a ConstantPathOperatorWriteNode node. # - # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode + # source://prism//lib/prism/dot_visitor.rb#1308 + def visit_constant_path_operator_write_node(node); end + + # Visit a ConstantPathOrWriteNode node. # - # source://prism//prism/node.rb#5802 - def initialize(operator_loc, variable, location); end + # source://prism//lib/prism/dot_visitor.rb#1336 + def visit_constant_path_or_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a ConstantPathTargetNode node. # - # source://prism//prism/node.rb#5809 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#1361 + def visit_constant_path_target_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a ConstantPathWriteNode node. # - # source://prism//prism/node.rb#5814 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#1388 + def visit_constant_path_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a ConstantReadNode node. # - # source://prism//prism/node.rb#5824 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#1413 + def visit_constant_read_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a ConstantTargetNode node. # - # source://prism//prism/node.rb#5819 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#1430 + def visit_constant_target_node(node); end - # def copy: (**params) -> EmbeddedVariableNode + # Visit a ConstantWriteNode node. # - # source://prism//prism/node.rb#5829 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#1447 + def visit_constant_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a DefNode node. # - # source://prism//prism/node.rb#5814 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#1474 + def visit_def_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a DefinedNode node. # - # source://prism//prism/node.rb#5841 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#1543 + def visit_defined_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a ElseNode node. # - # source://prism//prism/node.rb#5851 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#1574 + def visit_else_node(node); end - # def operator: () -> String + # Visit a EmbeddedStatementsNode node. # - # source://prism//prism/node.rb#5846 - def operator; end + # source://prism//lib/prism/dot_visitor.rb#1602 + def visit_embedded_statements_node(node); end - # attr_reader operator_loc: Location + # Visit a EmbeddedVariableNode node. # - # source://prism//prism/node.rb#5796 - def operator_loc; end + # source://prism//lib/prism/dot_visitor.rb#1628 + def visit_embedded_variable_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. + # Visit a EnsureNode 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/dot_visitor.rb#1649 + def visit_ensure_node(node); end + + # Visit a FalseNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#1675 + def visit_false_node(node); end + + # Visit a FindPatternNode node. # - # source://prism//prism/node.rb#5873 - def type; end + # source://prism//lib/prism/dot_visitor.rb#1689 + def visit_find_pattern_node(node); end - # attr_reader variable: Node + # Visit a FlipFlopNode node. # - # source://prism//prism/node.rb#5799 - def variable; end + # source://prism//lib/prism/dot_visitor.rb#1740 + def visit_flip_flop_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//prism/node.rb#5883 - def type; end - end -end + # Visit a FloatNode node. + # + # source://prism//lib/prism/dot_visitor.rb#1772 + def visit_float_node(node); end -# Flags for nodes that have unescaped content. -module Prism::EncodingFlags; end + # Visit a ForNode node. + # + # source://prism//lib/prism/dot_visitor.rb#1786 + def visit_for_node(node); end -# internal bytes forced the encoding to binary -# -# source://prism//prism/node.rb#17306 -Prism::EncodingFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) + # Visit a ForwardingArgumentsNode node. + # + # source://prism//lib/prism/dot_visitor.rb#1828 + def visit_forwarding_arguments_node(node); end -# internal bytes forced the encoding to UTF-8 -# -# source://prism//prism/node.rb#17303 -Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + # Visit a ForwardingParameterNode node. + # + # source://prism//lib/prism/dot_visitor.rb#1842 + def visit_forwarding_parameter_node(node); end -# Represents an `ensure` clause in a `begin` statement. -# -# begin -# foo -# ensure -# ^^^^^^ -# bar -# end -class Prism::EnsureNode < ::Prism::Node - # def initialize: (ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location, location: Location) -> void + # Visit a ForwardingSuperNode node. # - # @return [EnsureNode] a new instance of EnsureNode + # source://prism//lib/prism/dot_visitor.rb#1856 + def visit_forwarding_super_node(node); end + + # Visit a GlobalVariableAndWriteNode node. # - # source://prism//prism/node.rb#5907 - def initialize(ensure_keyword_loc, statements, end_keyword_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#1876 + def visit_global_variable_and_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a GlobalVariableOperatorWriteNode node. # - # source://prism//prism/node.rb#5915 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#1903 + def visit_global_variable_operator_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a GlobalVariableOrWriteNode node. # - # source://prism//prism/node.rb#5920 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#1933 + def visit_global_variable_or_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a GlobalVariableReadNode node. # - # source://prism//prism/node.rb#5932 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#1960 + def visit_global_variable_read_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a GlobalVariableTargetNode node. # - # source://prism//prism/node.rb#5925 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#1977 + def visit_global_variable_target_node(node); end - # def copy: (**params) -> EnsureNode + # Visit a GlobalVariableWriteNode node. # - # source://prism//prism/node.rb#5937 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#1994 + def visit_global_variable_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a HashNode node. # - # source://prism//prism/node.rb#5920 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#2021 + def visit_hash_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a HashPatternNode node. # - # source://prism//prism/node.rb#5950 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#2054 + def visit_hash_pattern_node(node); end - # def end_keyword: () -> String + # Visit a IfNode node. # - # source://prism//prism/node.rb#5960 - def end_keyword; end + # source://prism//lib/prism/dot_visitor.rb#2103 + def visit_if_node(node); end - # attr_reader end_keyword_loc: Location + # Visit a ImaginaryNode node. # - # source://prism//prism/node.rb#5904 - def end_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#2148 + def visit_imaginary_node(node); end - # def ensure_keyword: () -> String + # Visit a ImplicitNode node. # - # source://prism//prism/node.rb#5955 - def ensure_keyword; end + # source://prism//lib/prism/dot_visitor.rb#2166 + def visit_implicit_node(node); end - # attr_reader ensure_keyword_loc: Location + # Visit a ImplicitRestNode node. # - # source://prism//prism/node.rb#5898 - def ensure_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#2184 + def visit_implicit_rest_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a InNode node. # - # source://prism//prism/node.rb#5965 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#2198 + def visit_in_node(node); end - # attr_reader statements: StatementsNode? + # Visit a IndexAndWriteNode node. # - # source://prism//prism/node.rb#5901 - def statements; end + # source://prism//lib/prism/dot_visitor.rb#2230 + def visit_index_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. + # Visit a IndexOperatorWriteNode 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/dot_visitor.rb#2283 + def visit_index_operator_write_node(node); end + + # Visit a IndexOrWriteNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#2339 + def visit_index_or_write_node(node); end + + # Visit a IndexTargetNode node. # - # source://prism//prism/node.rb#5992 - def type; end + # source://prism//lib/prism/dot_visitor.rb#2392 + 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//prism/node.rb#6002 - def type; end - end -end + # Visit a InstanceVariableAndWriteNode node. + # + # source://prism//lib/prism/dot_visitor.rb#2431 + def visit_instance_variable_and_write_node(node); end -# Represents the use of the literal `false` keyword. -# -# false -# ^^^^^ -class Prism::FalseNode < ::Prism::Node - # def initialize: (location: Location) -> void + # Visit a InstanceVariableOperatorWriteNode node. # - # @return [FalseNode] a new instance of FalseNode + # source://prism//lib/prism/dot_visitor.rb#2458 + def visit_instance_variable_operator_write_node(node); end + + # Visit a InstanceVariableOrWriteNode node. # - # source://prism//prism/node.rb#6013 - def initialize(location); end + # source://prism//lib/prism/dot_visitor.rb#2488 + def visit_instance_variable_or_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a InstanceVariableReadNode node. # - # source://prism//prism/node.rb#6018 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#2515 + def visit_instance_variable_read_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a InstanceVariableTargetNode node. # - # source://prism//prism/node.rb#6023 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#2532 + def visit_instance_variable_target_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a InstanceVariableWriteNode node. # - # source://prism//prism/node.rb#6033 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#2549 + def visit_instance_variable_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a IntegerNode node. # - # source://prism//prism/node.rb#6028 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#2576 + def visit_integer_node(node); end - # def copy: (**params) -> FalseNode + # Visit a InterpolatedMatchLastLineNode node. # - # source://prism//prism/node.rb#6038 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#2593 + def visit_interpolated_match_last_line_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a InterpolatedRegularExpressionNode node. # - # source://prism//prism/node.rb#6023 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#2629 + def visit_interpolated_regular_expression_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a InterpolatedStringNode node. # - # source://prism//prism/node.rb#6048 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#2665 + def visit_interpolated_string_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a InterpolatedSymbolNode node. # - # source://prism//prism/node.rb#6053 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#2702 + def visit_interpolated_symbol_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. + # Visit a InterpolatedXStringNode 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/dot_visitor.rb#2739 + def visit_interpolated_x_string_node(node); end + + # Visit a KeywordHashNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#2772 + def visit_keyword_hash_node(node); end + + # Visit a KeywordRestParameterNode node. # - # source://prism//prism/node.rb#6072 - def type; end + # source://prism//lib/prism/dot_visitor.rb#2802 + def visit_keyword_rest_parameter_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//prism/node.rb#6082 - def type; end - end -end + # Visit a LambdaNode node. + # + # source://prism//lib/prism/dot_visitor.rb#2830 + def visit_lambda_node(node); end -# Represents a find pattern in pattern matching. -# -# foo in *bar, baz, *qux -# ^^^^^^^^^^^^^^^ -# -# foo in [*bar, baz, *qux] -# ^^^^^^^^^^^^^^^^^ -# -# foo in Foo(*bar, baz, *qux) -# ^^^^^^^^^^^^^^^^^^^^ -class Prism::FindPatternNode < ::Prism::Node - # def initialize: (constant: Node?, left: Node, requireds: Array[Node], right: Node, opening_loc: Location?, closing_loc: Location?, location: Location) -> void + # Visit a LocalVariableAndWriteNode node. # - # @return [FindPatternNode] a new instance of FindPatternNode + # source://prism//lib/prism/dot_visitor.rb#2868 + def visit_local_variable_and_write_node(node); end + + # Visit a LocalVariableOperatorWriteNode node. # - # source://prism//prism/node.rb#6117 - def initialize(constant, left, requireds, right, opening_loc, closing_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#2898 + def visit_local_variable_operator_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a LocalVariableOrWriteNode node. # - # source://prism//prism/node.rb#6128 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#2931 + def visit_local_variable_or_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a LocalVariableReadNode node. # - # source://prism//prism/node.rb#6133 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#2961 + def visit_local_variable_read_node(node); end - # def closing: () -> String? + # Visit a LocalVariableTargetNode node. # - # source://prism//prism/node.rb#6179 - def closing; end + # source://prism//lib/prism/dot_visitor.rb#2981 + def visit_local_variable_target_node(node); end - # attr_reader closing_loc: Location? + # Visit a LocalVariableWriteNode node. # - # source://prism//prism/node.rb#6114 - def closing_loc; end + # source://prism//lib/prism/dot_visitor.rb#3001 + def visit_local_variable_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a MatchLastLineNode node. # - # source://prism//prism/node.rb#6148 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#3031 + def visit_match_last_line_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a MatchPredicateNode node. # - # source://prism//prism/node.rb#6138 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#3060 + def visit_match_predicate_node(node); end - # attr_reader constant: Node? + # Visit a MatchRequiredNode node. # - # source://prism//prism/node.rb#6099 - def constant; end + # source://prism//lib/prism/dot_visitor.rb#3085 + def visit_match_required_node(node); end - # def copy: (**params) -> FindPatternNode + # Visit a MatchWriteNode node. # - # source://prism//prism/node.rb#6153 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#3110 + def visit_match_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a MissingNode node. # - # source://prism//prism/node.rb#6133 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#3141 + def visit_missing_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a ModuleNode node. # - # source://prism//prism/node.rb#6169 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#3155 + def visit_module_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a MultiTargetNode node. # - # source://prism//prism/node.rb#6184 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#3191 + def visit_multi_target_node(node); end - # attr_reader left: Node + # Visit a MultiWriteNode node. # - # source://prism//prism/node.rb#6102 - def left; end + # source://prism//lib/prism/dot_visitor.rb#3247 + def visit_multi_write_node(node); end - # def opening: () -> String? + # Visit a NextNode node. # - # source://prism//prism/node.rb#6174 - def opening; end + # source://prism//lib/prism/dot_visitor.rb#3310 + def visit_next_node(node); end - # attr_reader opening_loc: Location? + # Visit a NilNode node. # - # source://prism//prism/node.rb#6111 - def opening_loc; end + # source://prism//lib/prism/dot_visitor.rb#3333 + def visit_nil_node(node); end - # attr_reader requireds: Array[Node] + # Visit a NoKeywordsParameterNode node. # - # source://prism//prism/node.rb#6105 - def requireds; end + # source://prism//lib/prism/dot_visitor.rb#3347 + def visit_no_keywords_parameter_node(node); end - # attr_reader right: Node + # Visit a NumberedParametersNode node. # - # source://prism//prism/node.rb#6108 - def right; end + # source://prism//lib/prism/dot_visitor.rb#3367 + def visit_numbered_parameters_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. + # Visit a NumberedReferenceReadNode 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/dot_visitor.rb#3384 + def visit_numbered_reference_read_node(node); end + + # Visit a OptionalKeywordParameterNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#3401 + def visit_optional_keyword_parameter_node(node); end + + # Visit a OptionalParameterNode node. # - # source://prism//prism/node.rb#6216 - def type; end + # source://prism//lib/prism/dot_visitor.rb#3428 + def visit_optional_parameter_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//prism/node.rb#6226 - def type; end - end -end + # Visit a OrNode node. + # + # source://prism//lib/prism/dot_visitor.rb#3458 + def visit_or_node(node); end -# Represents the use of the `..` or `...` operators to create flip flops. -# -# baz if foo .. bar -# ^^^^^^^^^^ -class Prism::FlipFlopNode < ::Prism::Node - # def initialize: (flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location) -> void + # Visit a ParametersNode node. # - # @return [FlipFlopNode] a new instance of FlipFlopNode + # source://prism//lib/prism/dot_visitor.rb#3483 + def visit_parameters_node(node); end + + # Visit a ParenthesesNode node. # - # source://prism//prism/node.rb#6249 - def initialize(flags, left, right, operator_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#3567 + def visit_parentheses_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a PinnedExpressionNode node. # - # source://prism//prism/node.rb#6258 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#3593 + def visit_pinned_expression_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a PinnedVariableNode node. # - # source://prism//prism/node.rb#6263 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#3620 + def visit_pinned_variable_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a PostExecutionNode node. # - # source://prism//prism/node.rb#6276 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#3641 + def visit_post_execution_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a PreExecutionNode node. # - # source://prism//prism/node.rb#6268 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#3670 + def visit_pre_execution_node(node); end - # def copy: (**params) -> FlipFlopNode + # Visit a ProgramNode node. # - # source://prism//prism/node.rb#6281 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#3699 + def visit_program_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a RangeNode node. # - # source://prism//prism/node.rb#6263 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#3720 + def visit_range_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a RationalNode node. # - # source://prism//prism/node.rb#6295 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#3752 + def visit_rational_node(node); end - # def exclude_end?: () -> bool + # Visit a RedoNode node. # - # @return [Boolean] + # source://prism//lib/prism/dot_visitor.rb#3770 + def visit_redo_node(node); end + + # Visit a RegularExpressionNode node. # - # source://prism//prism/node.rb#6300 - def exclude_end?; end + # source://prism//lib/prism/dot_visitor.rb#3784 + def visit_regular_expression_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a RequiredKeywordParameterNode node. # - # source://prism//prism/node.rb#6310 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#3813 + def visit_required_keyword_parameter_node(node); end - # attr_reader left: Node? + # Visit a RequiredParameterNode node. # - # source://prism//prism/node.rb#6240 - def left; end + # source://prism//lib/prism/dot_visitor.rb#3836 + def visit_required_parameter_node(node); end - # def operator: () -> String + # Visit a RescueModifierNode node. # - # source://prism//prism/node.rb#6305 - def operator; end + # source://prism//lib/prism/dot_visitor.rb#3856 + def visit_rescue_modifier_node(node); end - # attr_reader operator_loc: Location + # Visit a RescueNode node. # - # source://prism//prism/node.rb#6246 - def operator_loc; end + # source://prism//lib/prism/dot_visitor.rb#3881 + def visit_rescue_node(node); end - # attr_reader right: Node? + # Visit a RestParameterNode node. # - # source://prism//prism/node.rb#6243 - def right; end + # source://prism//lib/prism/dot_visitor.rb#3934 + def visit_rest_parameter_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. + # Visit a RetryNode 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/dot_visitor.rb#3962 + def visit_retry_node(node); end + + # Visit a ReturnNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#3976 + def visit_return_node(node); end + + # Visit a SelfNode node. # - # source://prism//prism/node.rb#6344 - def type; end + # source://prism//lib/prism/dot_visitor.rb#3999 + def visit_self_node(node); end - private + # Visit a SingletonClassNode node. + # + # source://prism//lib/prism/dot_visitor.rb#4013 + def visit_singleton_class_node(node); end - # Returns the value of attribute flags. + # Visit a SourceEncodingNode node. # - # source://prism//prism/node.rb#6237 - def flags; end + # source://prism//lib/prism/dot_visitor.rb#4049 + def visit_source_encoding_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//prism/node.rb#6354 - def type; end - end -end + # Visit a SourceFileNode node. + # + # source://prism//lib/prism/dot_visitor.rb#4063 + def visit_source_file_node(node); end -# Represents a floating point number literal. -# -# 1.0 -# ^^^ -class Prism::FloatNode < ::Prism::Node - # def initialize: (location: Location) -> void + # Visit a SourceLineNode node. # - # @return [FloatNode] a new instance of FloatNode + # source://prism//lib/prism/dot_visitor.rb#4080 + def visit_source_line_node(node); end + + # Visit a SplatNode node. # - # source://prism//prism/node.rb#6365 - def initialize(location); end + # source://prism//lib/prism/dot_visitor.rb#4094 + def visit_splat_node(node); end - # def accept: (visitor: Visitor) -> void + # Visit a StatementsNode node. # - # source://prism//prism/node.rb#6370 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#4117 + def visit_statements_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Visit a StringNode node. # - # source://prism//prism/node.rb#6375 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#4144 + def visit_string_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Visit a SuperNode node. # - # source://prism//prism/node.rb#6385 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#4177 + def visit_super_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Visit a SymbolNode node. # - # source://prism//prism/node.rb#6380 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#4216 + def visit_symbol_node(node); end - # def copy: (**params) -> FloatNode + # Visit a TrueNode node. # - # source://prism//prism/node.rb#6390 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#4251 + def visit_true_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Visit a UndefNode node. # - # source://prism//prism/node.rb#6375 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#4265 + def visit_undef_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Visit a UnlessNode node. # - # source://prism//prism/node.rb#6400 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#4295 + def visit_unless_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Visit a UntilNode node. # - # source://prism//prism/node.rb#6405 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#4338 + 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. + # Visit 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/dot_visitor.rb#4373 + def visit_when_node(node); end + + # Visit a WhileNode node. # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#4409 + def visit_while_node(node); end + + # Visit a XStringNode node. # - # source://prism//prism/node.rb#6424 - def type; end + # source://prism//lib/prism/dot_visitor.rb#4444 + def visit_x_string_node(node); end - # Returns the value of the node as a Ruby Float. + # Visit a YieldNode node. # - # source://prism//prism/node_ext.rb#62 - def value; end + # source://prism//lib/prism/dot_visitor.rb#4473 + def visit_yield_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//prism/node.rb#6434 - def type; end - end -end + private -# Represents the use of the `for` keyword. -# -# for i in a end -# ^^^^^^^^^^^^^^ -class Prism::ForNode < ::Prism::Node - # def initialize: (index: Node, collection: Node, statements: StatementsNode?, for_keyword_loc: Location, in_keyword_loc: Location, do_keyword_loc: Location?, end_keyword_loc: Location, location: Location) -> void + # Inspect a node that has arguments_node_flags flags to display the flags as a + # comma-separated list. # - # @return [ForNode] a new instance of ForNode + # source://prism//lib/prism/dot_visitor.rb#4519 + 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//prism/node.rb#6466 - def initialize(index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc, location); end + # source://prism//lib/prism/dot_visitor.rb#4527 + def array_node_flags_inspect(node); end - # def accept: (visitor: Visitor) -> void + # Inspect a node that has call_node_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6478 - def accept(visitor); end + # source://prism//lib/prism/dot_visitor.rb#4535 + def call_node_flags_inspect(node); end - # def child_nodes: () -> Array[nil | Node] + # Inspect a node that has encoding_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6483 - def child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#4546 + def encoding_flags_inspect(node); end - # attr_reader collection: Node + # Inspect a node that has integer_base_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6448 - def collection; end + # source://prism//lib/prism/dot_visitor.rb#4555 + def integer_base_flags_inspect(node); end - # def comment_targets: () -> Array[Node | Location] + # Inspect a node that has keyword_hash_node_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6497 - def comment_targets; end + # source://prism//lib/prism/dot_visitor.rb#4566 + def keyword_hash_node_flags_inspect(node); end - # def compact_child_nodes: () -> Array[Node] + # Inspect a location to display the start and end line and column numbers. # - # source://prism//prism/node.rb#6488 - def compact_child_nodes; end + # source://prism//lib/prism/dot_visitor.rb#4513 + def location_inspect(location); end - # def copy: (**params) -> ForNode + # Inspect a node that has loop_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6502 - def copy(**params); end + # source://prism//lib/prism/dot_visitor.rb#4574 + def loop_flags_inspect(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Generate a unique node ID for a node throughout the digraph. # - # source://prism//prism/node.rb#6483 - def deconstruct; end + # source://prism//lib/prism/dot_visitor.rb#4508 + def node_id(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Inspect a node that has parameter_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6519 - def deconstruct_keys(keys); end + # source://prism//lib/prism/dot_visitor.rb#4582 + def parameter_flags_inspect(node); end - # def do_keyword: () -> String? + # Inspect a node that has range_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6534 - def do_keyword; end + # source://prism//lib/prism/dot_visitor.rb#4590 + def range_flags_inspect(node); end - # attr_reader do_keyword_loc: Location? + # Inspect a node that has regular_expression_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6460 - def do_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#4598 + def regular_expression_flags_inspect(node); end - # def end_keyword: () -> String + # Inspect a node that has string_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6539 - def end_keyword; end + # source://prism//lib/prism/dot_visitor.rb#4616 + def string_flags_inspect(node); end - # attr_reader end_keyword_loc: Location + # Inspect a node that has symbol_flags flags to display the flags as a + # comma-separated list. # - # source://prism//prism/node.rb#6463 - def end_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#4626 + def symbol_flags_inspect(node); end +end - # def for_keyword: () -> String +# source://prism//lib/prism/dot_visitor.rb#58 +class Prism::DotVisitor::Digraph + # @return [Digraph] a new instance of Digraph # - # source://prism//prism/node.rb#6524 - def for_keyword; end + # source://prism//lib/prism/dot_visitor.rb#61 + def initialize; end - # attr_reader for_keyword_loc: Location + # source://prism//lib/prism/dot_visitor.rb#75 + def edge(value); end + + # Returns the value of attribute edges. # - # source://prism//prism/node.rb#6454 - def for_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#59 + def edges; end - # def in_keyword: () -> String + # source://prism//lib/prism/dot_visitor.rb#67 + def node(value); end + + # Returns the value of attribute nodes. # - # source://prism//prism/node.rb#6529 - def in_keyword; end + # source://prism//lib/prism/dot_visitor.rb#59 + def nodes; end - # attr_reader in_keyword_loc: Location + # source://prism//lib/prism/dot_visitor.rb#79 + def to_dot; end + + # source://prism//lib/prism/dot_visitor.rb#71 + def waypoint(value); end + + # Returns the value of attribute waypoints. # - # source://prism//prism/node.rb#6457 - def in_keyword_loc; end + # source://prism//lib/prism/dot_visitor.rb#59 + def waypoints; end +end - # attr_reader index: Node +# source://prism//lib/prism/dot_visitor.rb#14 +class Prism::DotVisitor::Field + # @return [Field] a new instance of Field # - # source://prism//prism/node.rb#6445 - def index; end + # source://prism//lib/prism/dot_visitor.rb#17 + def initialize(name, value, port); end - # def inspect(inspector: NodeInspector) -> String + # Returns the value of attribute name. # - # source://prism//prism/node.rb#6544 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/dot_visitor.rb#15 + def name; end - # attr_reader statements: StatementsNode? + # Returns the value of attribute port. # - # source://prism//prism/node.rb#6451 - def statements; end + # source://prism//lib/prism/dot_visitor.rb#15 + def port; 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/dot_visitor.rb#23 + def to_dot; end + + # Returns the value of attribute value. # - # 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/dot_visitor.rb#15 + def value; end +end + +# source://prism//lib/prism/dot_visitor.rb#32 +class Prism::DotVisitor::Table + # @return [Table] a new instance of Table # - # def type: () -> Symbol + # source://prism//lib/prism/dot_visitor.rb#35 + def initialize(name); end + + # source://prism//lib/prism/dot_visitor.rb#40 + def field(name, value = T.unsafe(nil), port: T.unsafe(nil)); end + + # Returns the value of attribute fields. # - # source://prism//prism/node.rb#6577 - def type; end + # source://prism//lib/prism/dot_visitor.rb#33 + def fields; 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//prism/node.rb#6587 - def type; end - end + # Returns the value of attribute name. + # + # source://prism//lib/prism/dot_visitor.rb#33 + def name; end + + # source://prism//lib/prism/dot_visitor.rb#44 + def to_dot; end end -# Represents forwarding all arguments to this method to another method. +# Represents an `else` clause in a `case`, `if`, or `unless` statement. # -# def foo(...) -# bar(...) -# ^^^ -# end -class Prism::ForwardingArgumentsNode < ::Prism::Node - # def initialize: (location: Location) -> void +# if a then b else c end +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#5691 +class Prism::ElseNode < ::Prism::Node + # def initialize: (Location else_keyword_loc, StatementsNode? statements, Location? end_keyword_loc, Location location) -> void # - # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode + # @return [ElseNode] a new instance of ElseNode # - # source://prism//prism/node.rb#6600 - def initialize(location); end + # source://prism//lib/prism/node.rb#5702 + sig do + params( + else_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(else_keyword_loc, statements, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#6605 + # source://prism//lib/prism/node.rb#5710 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6610 + # source://prism//lib/prism/node.rb#5715 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#6620 + # source://prism//lib/prism/node.rb#5727 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#6615 + # source://prism//lib/prism/node.rb#5720 def compact_child_nodes; end - # def copy: (**params) -> ForwardingArgumentsNode + # def copy: (**params) -> ElseNode # - # source://prism//prism/node.rb#6625 + # source://prism//lib/prism/node.rb#5732 + sig { params(params: T.untyped).returns(Prism::ElseNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6610 + # source://prism//lib/prism/node.rb#5715 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { else_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location?, location: Location } # - # source://prism//prism/node.rb#6635 + # source://prism//lib/prism/node.rb#5745 + 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(inspector: NodeInspector) -> String + # def else_keyword: () -> String + # + # source://prism//lib/prism/node.rb#5750 + sig { returns(String) } + def else_keyword; end + + # attr_reader else_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#5693 + sig { returns(Prism::Location) } + def else_keyword_loc; end + + # def end_keyword: () -> String? + # + # source://prism//lib/prism/node.rb#5755 + sig { returns(T.nilable(String)) } + def end_keyword; end + + # attr_reader end_keyword_loc: Location? + # + # source://prism//lib/prism/node.rb#5699 + sig { returns(T.nilable(Prism::Location)) } + def end_keyword_loc; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#6640 + # source://prism//lib/prism/node.rb#5760 def inspect(inspector = T.unsafe(nil)); end + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#5696 + 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 @@ -10234,7 +11491,7 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#6659 + # source://prism//lib/prism/node.rb#5787 def type; end class << self @@ -10245,65 +11502,131 @@ class Prism::ForwardingArgumentsNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#6669 + # source://prism//lib/prism/node.rb#5797 def type; end end end -# Represents the use of the forwarding parameter in a method, block, or lambda declaration. +# EmbDocComment objects correspond to comments that are surrounded by =begin +# and =end. # -# def foo(...) -# ^^^ -# end -class Prism::ForwardingParameterNode < ::Prism::Node - # def initialize: (location: Location) -> void - # - # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode - # - # source://prism//prism/node.rb#6681 - def initialize(location); end - - # def accept: (visitor: Visitor) -> void +# source://prism//lib/prism/parse_result.rb#260 +class Prism::EmbDocComment < ::Prism::Comment + # Returns a string representation of this comment. # - # source://prism//prism/node.rb#6686 - def accept(visitor); end + # source://prism//lib/prism/parse_result.rb#267 + def inspect; end - # def child_nodes: () -> Array[nil | Node] + # This can only be true for inline comments. # - # source://prism//prism/node.rb#6691 - def child_nodes; end - - # def comment_targets: () -> Array[Node | Location] + # @return [Boolean] # - # source://prism//prism/node.rb#6701 - def comment_targets; end + # source://prism//lib/prism/parse_result.rb#262 + def trailing?; end +end - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//prism/node.rb#6696 +# Represents an interpolated set of statements. +# +# "foo #{bar}" +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#5806 +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#5817 + sig do + params( + opening_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(opening_loc, statements, closing_loc, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#5825 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#5830 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#5870 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#5814 + sig { returns(Prism::Location) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#5842 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#5835 def compact_child_nodes; end - # def copy: (**params) -> ForwardingParameterNode + # def copy: (**params) -> EmbeddedStatementsNode # - # source://prism//prism/node.rb#6706 + # source://prism//lib/prism/node.rb#5847 + sig { params(params: T.untyped).returns(Prism::EmbeddedStatementsNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6691 + # source://prism//lib/prism/node.rb#5830 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, statements: StatementsNode?, closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#6716 + # source://prism//lib/prism/node.rb#5860 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#6721 + # source://prism//lib/prism/node.rb#5875 def inspect(inspector = T.unsafe(nil)); end + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#5865 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#5808 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#5811 + 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 @@ -10319,7 +11642,7 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#6740 + # source://prism//lib/prism/node.rb#5902 def type; end class << self @@ -10330,69 +11653,88 @@ class Prism::ForwardingParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#6750 + # source://prism//lib/prism/node.rb#5912 def type; end end end -# Represents the use of the `super` keyword without parentheses or arguments. +# Represents an interpolated variable. # -# super -# ^^^^^ -class Prism::ForwardingSuperNode < ::Prism::Node - # def initialize: (block: BlockNode?, location: Location) -> void +# "foo #@bar" +# ^^^^^ +# +# source://prism//lib/prism/node.rb#5921 +class Prism::EmbeddedVariableNode < ::Prism::Node + # def initialize: (Location operator_loc, Node variable, Location location) -> void # - # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode + # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode # - # source://prism//prism/node.rb#6764 - def initialize(block, location); end + # source://prism//lib/prism/node.rb#5929 + sig { params(operator_loc: Prism::Location, variable: Prism::Node, location: Prism::Location).void } + def initialize(operator_loc, variable, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#6770 + # source://prism//lib/prism/node.rb#5936 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader block: BlockNode? - # - # source://prism//prism/node.rb#6761 - def block; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6775 + # source://prism//lib/prism/node.rb#5941 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#6787 + # source://prism//lib/prism/node.rb#5951 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#6780 + # source://prism//lib/prism/node.rb#5946 def compact_child_nodes; end - # def copy: (**params) -> ForwardingSuperNode + # def copy: (**params) -> EmbeddedVariableNode # - # source://prism//prism/node.rb#6792 + # source://prism//lib/prism/node.rb#5956 + sig { params(params: T.untyped).returns(Prism::EmbeddedVariableNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6775 + # source://prism//lib/prism/node.rb#5941 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, variable: Node, location: Location } # - # source://prism//prism/node.rb#6803 + # source://prism//lib/prism/node.rb#5968 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#6808 + # source://prism//lib/prism/node.rb#5978 def inspect(inspector = T.unsafe(nil)); end + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#5973 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#5923 + 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 @@ -10408,9 +11750,15 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#6833 + # source://prism//lib/prism/node.rb#6000 def type; end + # attr_reader variable: Node + # + # source://prism//lib/prism/node.rb#5926 + 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. @@ -10419,83 +11767,131 @@ class Prism::ForwardingSuperNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#6843 + # source://prism//lib/prism/node.rb#6010 def type; end end end -# Represents the use of the `&&=` operator for assignment to a global variable. +# Flags for nodes that have unescaped content. # -# $target &&= value -# ^^^^^^^^^^^^^^^^^ -class Prism::GlobalVariableAndWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void +# source://prism//lib/prism/node.rb#17578 +module Prism::EncodingFlags; end + +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#17583 +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#17580 +Prism::EncodingFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + +# Represents an `ensure` clause in a `begin` statement. +# +# begin +# foo +# ensure +# ^^^^^^ +# bar +# end +# +# source://prism//lib/prism/node.rb#6023 +class Prism::EnsureNode < ::Prism::Node + # def initialize: (Location ensure_keyword_loc, StatementsNode? statements, Location end_keyword_loc, Location location) -> void # - # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode + # @return [EnsureNode] a new instance of EnsureNode # - # source://prism//prism/node.rb#6866 - def initialize(name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#6034 + sig do + params( + ensure_keyword_loc: Prism::Location, + statements: T.nilable(Prism::StatementsNode), + end_keyword_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(ensure_keyword_loc, statements, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#6875 + # source://prism//lib/prism/node.rb#6042 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6880 + # source://prism//lib/prism/node.rb#6047 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#6890 + # source://prism//lib/prism/node.rb#6059 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#6885 + # source://prism//lib/prism/node.rb#6052 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableAndWriteNode + # def copy: (**params) -> EnsureNode # - # source://prism//prism/node.rb#6895 + # source://prism//lib/prism/node.rb#6064 + sig { params(params: T.untyped).returns(Prism::EnsureNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6880 + # source://prism//lib/prism/node.rb#6047 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { ensure_keyword_loc: Location, statements: StatementsNode?, end_keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#6909 + # source://prism//lib/prism/node.rb#6077 + 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(inspector: NodeInspector) -> String + # def end_keyword: () -> String # - # source://prism//prism/node.rb#6919 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6087 + sig { returns(String) } + def end_keyword; end - # attr_reader name: Symbol + # attr_reader end_keyword_loc: Location # - # source://prism//prism/node.rb#6854 - def name; end + # source://prism//lib/prism/node.rb#6031 + sig { returns(Prism::Location) } + def end_keyword_loc; end - # attr_reader name_loc: Location + # def ensure_keyword: () -> String # - # source://prism//prism/node.rb#6857 - def name_loc; end + # source://prism//lib/prism/node.rb#6082 + sig { returns(String) } + def ensure_keyword; end - # def operator: () -> String + # attr_reader ensure_keyword_loc: Location # - # source://prism//prism/node.rb#6914 - def operator; end + # source://prism//lib/prism/node.rb#6025 + sig { returns(Prism::Location) } + def ensure_keyword_loc; end - # attr_reader operator_loc: Location + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#6860 - def operator_loc; end + # source://prism//lib/prism/node.rb#6092 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#6028 + 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 @@ -10512,14 +11908,9 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#6943 + # source://prism//lib/prism/node.rb#6119 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#6863 - 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. @@ -10528,84 +11919,76 @@ class Prism::GlobalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#6953 + # source://prism//lib/prism/node.rb#6129 def type; end end end -# Represents assigning to a global variable using an operator that isn't `=`. +# Represents the use of the literal `false` keyword. # -# $target += value -# ^^^^^^^^^^^^^^^^ -class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void +# false +# ^^^^^ +# +# source://prism//lib/prism/node.rb#6138 +class Prism::FalseNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode + # @return [FalseNode] a new instance of FalseNode # - # source://prism//prism/node.rb#6979 - def initialize(name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#6140 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#6989 + # source://prism//lib/prism/node.rb#6145 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6994 + # source://prism//lib/prism/node.rb#6150 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7004 + # source://prism//lib/prism/node.rb#6160 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#6999 + # source://prism//lib/prism/node.rb#6155 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableOperatorWriteNode + # def copy: (**params) -> FalseNode # - # source://prism//prism/node.rb#7009 + # source://prism//lib/prism/node.rb#6165 + sig { params(params: T.untyped).returns(Prism::FalseNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#6994 + # source://prism//lib/prism/node.rb#6150 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#7024 + # source://prism//lib/prism/node.rb#6175 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7029 + # source://prism//lib/prism/node.rb#6180 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol - # - # source://prism//prism/node.rb#6964 - def name; end - - # attr_reader name_loc: Location - # - # source://prism//prism/node.rb#6967 - def name_loc; end - - # attr_reader operator: Symbol - # - # source://prism//prism/node.rb#6976 - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#6970 - 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 @@ -10621,14 +12004,9 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7054 + # source://prism//lib/prism/node.rb#6199 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#6973 - 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. @@ -10637,83 +12015,139 @@ class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7064 + # source://prism//lib/prism/node.rb#6209 def type; end end end -# Represents the use of the `||=` operator for assignment to a global variable. +# Represents a find pattern in pattern matching. # -# $target ||= value -# ^^^^^^^^^^^^^^^^^ -class Prism::GlobalVariableOrWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void +# foo in *bar, baz, *qux +# ^^^^^^^^^^^^^^^ +# +# foo in [*bar, baz, *qux] +# ^^^^^^^^^^^^^^^^^ +# +# foo in Foo(*bar, baz, *qux) +# ^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#6224 +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 # - # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode + # @return [FindPatternNode] a new instance of FindPatternNode # - # source://prism//prism/node.rb#7087 - def initialize(name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#6244 + 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 + ).void + end + def initialize(constant, left, requireds, right, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7096 + # source://prism//lib/prism/node.rb#6255 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7101 + # source://prism//lib/prism/node.rb#6260 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#6306 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#6241 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7111 + # source://prism//lib/prism/node.rb#6275 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7106 + # source://prism//lib/prism/node.rb#6265 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableOrWriteNode + # attr_reader constant: Node? + # + # source://prism//lib/prism/node.rb#6226 + sig { returns(T.nilable(Prism::Node)) } + def constant; end + + # def copy: (**params) -> FindPatternNode # - # source://prism//prism/node.rb#7116 + # source://prism//lib/prism/node.rb#6280 + sig { params(params: T.untyped).returns(Prism::FindPatternNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7101 + # source://prism//lib/prism/node.rb#6260 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, left: Node, requireds: Array[Node], right: Node, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#7130 + # source://prism//lib/prism/node.rb#6296 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7140 + # source://prism//lib/prism/node.rb#6311 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # attr_reader left: Node # - # source://prism//prism/node.rb#7075 - def name; end + # source://prism//lib/prism/node.rb#6229 + sig { returns(Prism::Node) } + def left; end - # attr_reader name_loc: Location + # def opening: () -> String? # - # source://prism//prism/node.rb#7078 - def name_loc; end + # source://prism//lib/prism/node.rb#6301 + sig { returns(T.nilable(String)) } + def opening; end - # def operator: () -> String + # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#7135 - def operator; end + # source://prism//lib/prism/node.rb#6238 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end - # attr_reader operator_loc: Location + # attr_reader requireds: Array[Node] # - # source://prism//prism/node.rb#7081 - def operator_loc; end + # source://prism//lib/prism/node.rb#6232 + sig { returns(T::Array[Prism::Node]) } + def requireds; end + + # attr_reader right: Node + # + # source://prism//lib/prism/node.rb#6235 + 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 @@ -10730,14 +12164,9 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7164 + # source://prism//lib/prism/node.rb#6343 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#7084 - 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. @@ -10746,68 +12175,115 @@ class Prism::GlobalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7174 + # source://prism//lib/prism/node.rb#6353 def type; end end end -# Represents referencing a global variable. +# Represents the use of the `..` or `...` operators to create flip flops. # -# $foo -# ^^^^ -class Prism::GlobalVariableReadNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void +# baz if foo .. bar +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#6362 +class Prism::FlipFlopNode < ::Prism::Node + # def initialize: (Integer flags, Node? left, Node? right, Location operator_loc, Location location) -> void # - # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode + # @return [FlipFlopNode] a new instance of FlipFlopNode # - # source://prism//prism/node.rb#7188 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#6376 + sig do + params( + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, left, right, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7194 + # source://prism//lib/prism/node.rb#6385 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7199 + # source://prism//lib/prism/node.rb#6390 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7209 + # source://prism//lib/prism/node.rb#6403 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7204 + # source://prism//lib/prism/node.rb#6395 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableReadNode + # def copy: (**params) -> FlipFlopNode # - # source://prism//prism/node.rb#7214 + # source://prism//lib/prism/node.rb#6408 + sig { params(params: T.untyped).returns(Prism::FlipFlopNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7199 + # source://prism//lib/prism/node.rb#6390 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#7225 + # source://prism//lib/prism/node.rb#6422 + 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(inspector: NodeInspector) -> String + # def exclude_end?: () -> bool # - # source://prism//prism/node.rb#7230 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader name: Symbol + # @return [Boolean] # - # source://prism//prism/node.rb#7185 - def name; end + # source://prism//lib/prism/node.rb#6427 + sig { returns(T::Boolean) } + def exclude_end?; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#6437 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader left: Node? + # + # source://prism//lib/prism/node.rb#6367 + sig { returns(T.nilable(Prism::Node)) } + def left; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#6432 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#6373 + sig { returns(Prism::Location) } + def operator_loc; end + + # attr_reader right: Node? + # + # source://prism//lib/prism/node.rb#6370 + sig { returns(T.nilable(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 @@ -10824,9 +12300,17 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7250 + # source://prism//lib/prism/node.rb#6471 def type; end + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#6364 + 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. @@ -10835,69 +12319,76 @@ class Prism::GlobalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7260 + # source://prism//lib/prism/node.rb#6481 def type; end end end -# Represents writing to a global variable in a context that doesn't have an explicit value. +# Represents a floating point number literal. # -# $foo, $bar = baz -# ^^^^ ^^^^ -class Prism::GlobalVariableTargetNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void +# 1.0 +# ^^^ +# +# source://prism//lib/prism/node.rb#6490 +class Prism::FloatNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode + # @return [FloatNode] a new instance of FloatNode # - # source://prism//prism/node.rb#7274 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#6492 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7280 + # source://prism//lib/prism/node.rb#6497 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7285 + # source://prism//lib/prism/node.rb#6502 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7295 + # source://prism//lib/prism/node.rb#6512 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7290 + # source://prism//lib/prism/node.rb#6507 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableTargetNode + # def copy: (**params) -> FloatNode # - # source://prism//prism/node.rb#7300 + # source://prism//lib/prism/node.rb#6517 + sig { params(params: T.untyped).returns(Prism::FloatNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7285 + # source://prism//lib/prism/node.rb#6502 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#7311 + # source://prism//lib/prism/node.rb#6527 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7316 + # source://prism//lib/prism/node.rb#6532 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol - # - # source://prism//prism/node.rb#7271 - 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 # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -10913,9 +12404,14 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7336 + # source://prism//lib/prism/node.rb#6551 def type; end + # Returns the value of the node as a Ruby Float. + # + # source://prism//lib/prism/node_ext.rb#62 + 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. @@ -10924,83 +12420,152 @@ class Prism::GlobalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7346 + # source://prism//lib/prism/node.rb#6561 def type; end end end -# Represents writing to a global variable. +# Represents the use of the `for` keyword. # -# $foo = 1 -# ^^^^^^^^ -class Prism::GlobalVariableWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void +# for i in a end +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#6570 +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 # - # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode + # @return [ForNode] a new instance of ForNode # - # source://prism//prism/node.rb#7369 - def initialize(name, name_loc, value, operator_loc, location); end + # source://prism//lib/prism/node.rb#6593 + 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 + ).void + end + def initialize(index, collection, statements, for_keyword_loc, in_keyword_loc, do_keyword_loc, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7378 + # source://prism//lib/prism/node.rb#6605 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7383 + # source://prism//lib/prism/node.rb#6610 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # attr_reader collection: Node + # + # source://prism//lib/prism/node.rb#6575 + sig { returns(Prism::Node) } + def collection; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7393 + # source://prism//lib/prism/node.rb#6624 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7388 + # source://prism//lib/prism/node.rb#6615 def compact_child_nodes; end - # def copy: (**params) -> GlobalVariableWriteNode + # def copy: (**params) -> ForNode # - # source://prism//prism/node.rb#7398 + # source://prism//lib/prism/node.rb#6629 + sig { params(params: T.untyped).returns(Prism::ForNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7383 + # source://prism//lib/prism/node.rb#6610 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#7412 + # source://prism//lib/prism/node.rb#6646 + 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(inspector: NodeInspector) -> String + # def do_keyword: () -> String? # - # source://prism//prism/node.rb#7422 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#6661 + sig { returns(T.nilable(String)) } + def do_keyword; end - # attr_reader name: Symbol + # attr_reader do_keyword_loc: Location? # - # source://prism//prism/node.rb#7357 - def name; end + # source://prism//lib/prism/node.rb#6587 + sig { returns(T.nilable(Prism::Location)) } + def do_keyword_loc; end - # attr_reader name_loc: Location + # def end_keyword: () -> String # - # source://prism//prism/node.rb#7360 - def name_loc; end + # source://prism//lib/prism/node.rb#6666 + sig { returns(String) } + def end_keyword; end - # def operator: () -> String + # attr_reader end_keyword_loc: Location # - # source://prism//prism/node.rb#7417 - def operator; end + # source://prism//lib/prism/node.rb#6590 + sig { returns(Prism::Location) } + def end_keyword_loc; end - # attr_reader operator_loc: Location + # def for_keyword: () -> String # - # source://prism//prism/node.rb#7366 - def operator_loc; end + # source://prism//lib/prism/node.rb#6651 + sig { returns(String) } + def for_keyword; end + + # attr_reader for_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#6581 + sig { returns(Prism::Location) } + def for_keyword_loc; end + + # def in_keyword: () -> String + # + # source://prism//lib/prism/node.rb#6656 + sig { returns(String) } + def in_keyword; end + + # attr_reader in_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#6584 + sig { returns(Prism::Location) } + def in_keyword_loc; end + + # attr_reader index: Node + # + # source://prism//lib/prism/node.rb#6572 + sig { returns(Prism::Node) } + def index; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#6671 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#6578 + 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 @@ -11017,14 +12582,9 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7446 + # source://prism//lib/prism/node.rb#6704 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#7363 - 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. @@ -11033,89 +12593,78 @@ class Prism::GlobalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7456 + # source://prism//lib/prism/node.rb#6714 def type; end end end -# Represents a hash literal. +# Represents forwarding all arguments to this method to another method. # -# { a => b } -# ^^^^^^^^^^ -class Prism::HashNode < ::Prism::Node - # def initialize: (opening_loc: Location, elements: Array[Node], closing_loc: Location, location: Location) -> void +# def foo(...) +# bar(...) +# ^^^ +# end +# +# source://prism//lib/prism/node.rb#6725 +class Prism::ForwardingArgumentsNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [HashNode] a new instance of HashNode + # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode # - # source://prism//prism/node.rb#7476 - def initialize(opening_loc, elements, closing_loc, location); end + # source://prism//lib/prism/node.rb#6727 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7484 + # source://prism//lib/prism/node.rb#6732 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7489 + # source://prism//lib/prism/node.rb#6737 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#7527 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#7473 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7499 + # source://prism//lib/prism/node.rb#6747 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7494 + # source://prism//lib/prism/node.rb#6742 def compact_child_nodes; end - # def copy: (**params) -> HashNode + # def copy: (**params) -> ForwardingArgumentsNode # - # source://prism//prism/node.rb#7504 + # source://prism//lib/prism/node.rb#6752 + sig { params(params: T.untyped).returns(Prism::ForwardingArgumentsNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7489 + # source://prism//lib/prism/node.rb#6737 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#7517 + # source://prism//lib/prism/node.rb#6762 + 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 - # attr_reader elements: Array[Node] - # - # source://prism//prism/node.rb#7470 - def elements; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7532 + # source://prism//lib/prism/node.rb#6767 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String - # - # source://prism//prism/node.rb#7522 - def opening; end - - # attr_reader opening_loc: Location - # - # source://prism//prism/node.rb#7467 - 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 @@ -11131,7 +12680,7 @@ class Prism::HashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7554 + # source://prism//lib/prism/node.rb#6786 def type; end class << self @@ -11142,102 +12691,77 @@ class Prism::HashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7564 + # source://prism//lib/prism/node.rb#6796 def type; end end end -# Represents a hash pattern in pattern matching. +# Represents the use of the forwarding parameter in a method, block, or lambda declaration. # -# foo => { a: 1, b: 2 } -# ^^^^^^^^^^^^^^ +# def foo(...) +# ^^^ +# end # -# foo => { a: 1, b: 2, **c } -# ^^^^^^^^^^^^^^^^^^^ -class Prism::HashPatternNode < ::Prism::Node - # def initialize: (constant: Node?, elements: Array[Node], rest: Node?, opening_loc: Location?, closing_loc: Location?, location: Location) -> void +# source://prism//lib/prism/node.rb#6806 +class Prism::ForwardingParameterNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [HashPatternNode] a new instance of HashPatternNode + # @return [ForwardingParameterNode] a new instance of ForwardingParameterNode # - # source://prism//prism/node.rb#7593 - def initialize(constant, elements, rest, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#6808 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7603 + # source://prism//lib/prism/node.rb#6813 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7608 + # source://prism//lib/prism/node.rb#6818 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String? - # - # source://prism//prism/node.rb#7652 - def closing; end - - # attr_reader closing_loc: Location? - # - # source://prism//prism/node.rb#7590 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7622 + # source://prism//lib/prism/node.rb#6828 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7613 + # source://prism//lib/prism/node.rb#6823 def compact_child_nodes; end - # attr_reader constant: Node? - # - # source://prism//prism/node.rb#7578 - def constant; end - - # def copy: (**params) -> HashPatternNode + # def copy: (**params) -> ForwardingParameterNode # - # source://prism//prism/node.rb#7627 + # source://prism//lib/prism/node.rb#6833 + sig { params(params: T.untyped).returns(Prism::ForwardingParameterNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7608 + # source://prism//lib/prism/node.rb#6818 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#7642 + # source://prism//lib/prism/node.rb#6843 + 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 - # attr_reader elements: Array[Node] - # - # source://prism//prism/node.rb#7581 - def elements; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7657 + # source://prism//lib/prism/node.rb#6848 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String? - # - # source://prism//prism/node.rb#7647 - def opening; end - - # attr_reader opening_loc: Location? - # - # source://prism//prism/node.rb#7587 - def opening_loc; end - - # attr_reader rest: Node? - # - # source://prism//prism/node.rb#7584 - def rest; 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 @@ -11253,7 +12777,7 @@ class Prism::HashPatternNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7691 + # source://prism//lib/prism/node.rb#6867 def type; end class << self @@ -11264,123 +12788,209 @@ class Prism::HashPatternNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7701 + # source://prism//lib/prism/node.rb#6877 def type; end end end -module Prism::HeredocQuery - # Returns true if this node was represented as a heredoc in the source code. - # - # @return [Boolean] - # - # source://prism//prism/node_ext.rb#37 - 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 `super` keyword without parentheses or arguments. # -# bar if foo -# ^^^^^^^^^^ +# super +# ^^^^^ # -# if foo then bar end -# ^^^^^^^^^^^^^^^^^^^ -class Prism::IfNode < ::Prism::Node - # def initialize: (if_keyword_loc: Location?, predicate: Node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: Node?, end_keyword_loc: Location?, location: Location) -> void +# source://prism//lib/prism/node.rb#6886 +class Prism::ForwardingSuperNode < ::Prism::Node + # def initialize: (BlockNode? block, Location location) -> void # - # @return [IfNode] a new instance of IfNode + # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode # - # source://prism//prism/node.rb#7733 - def initialize(if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); end + # source://prism//lib/prism/node.rb#6891 + sig { params(block: T.nilable(Prism::BlockNode), location: Prism::Location).void } + def initialize(block, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7744 + # source://prism//lib/prism/node.rb#6897 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # attr_reader block: BlockNode? + # + # source://prism//lib/prism/node.rb#6888 + sig { returns(T.nilable(Prism::BlockNode)) } + def block; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7753 + # source://prism//lib/prism/node.rb#6902 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7767 + # source://prism//lib/prism/node.rb#6914 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7758 + # source://prism//lib/prism/node.rb#6907 def compact_child_nodes; end - # attr_reader consequent: Node? - # - # source://prism//prism/node.rb#7727 - def consequent; end - - # def copy: (**params) -> IfNode + # def copy: (**params) -> ForwardingSuperNode # - # source://prism//prism/node.rb#7772 + # source://prism//lib/prism/node.rb#6919 + sig { params(params: T.untyped).returns(Prism::ForwardingSuperNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7753 + # source://prism//lib/prism/node.rb#6902 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { block: BlockNode?, location: Location } # - # source://prism//prism/node.rb#7788 + # source://prism//lib/prism/node.rb#6930 + 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 end_keyword: () -> String? + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7803 - def end_keyword; end + # source://prism//lib/prism/node.rb#6935 + def inspect(inspector = T.unsafe(nil)); end - # attr_reader end_keyword_loc: Location? + # 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//prism/node.rb#7730 - def end_keyword_loc; end - - # def if_keyword: () -> String? + # 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//prism/node.rb#7793 - def if_keyword; end - - # attr_reader if_keyword_loc: Location? + # def type: () -> Symbol # - # source://prism//prism/node.rb#7715 - def if_keyword_loc; end + # source://prism//lib/prism/node.rb#6960 + 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#6970 + def type; end + end +end - # def inspect(inspector: NodeInspector) -> String +# Represents the use of the `&&=` operator for assignment to a global variable. +# +# $target &&= value +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#6979 +class Prism::GlobalVariableAndWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # - # source://prism//prism/node.rb#7808 - def inspect(inspector = T.unsafe(nil)); end + # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode + # + # source://prism//lib/prism/node.rb#6993 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, location); end - # attr_reader predicate: Node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7718 - def predicate; end + # source://prism//lib/prism/node.rb#7002 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/node.rb#7748 - def set_newline_flag(newline_marked); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#7007 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # attr_reader statements: StatementsNode? + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7724 - def statements; end + # source://prism//lib/prism/node.rb#7017 + def comment_targets; end - # def then_keyword: () -> String? + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7798 - def then_keyword; end + # source://prism//lib/prism/node.rb#7012 + def compact_child_nodes; end - # attr_reader then_keyword_loc: Location? + # def copy: (**params) -> GlobalVariableAndWriteNode # - # source://prism//prism/node.rb#7721 - def then_keyword_loc; end + # source://prism//lib/prism/node.rb#7022 + sig { params(params: T.untyped).returns(Prism::GlobalVariableAndWriteNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#7007 + sig { 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 } + # + # source://prism//lib/prism/node.rb#7036 + 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 + # + # source://prism//lib/prism/node.rb#7046 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#6981 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#6984 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#7041 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#6987 + 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 @@ -11397,9 +13007,15 @@ class Prism::IfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7844 + # source://prism//lib/prism/node.rb#7070 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#6990 + 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. @@ -11408,68 +13024,108 @@ class Prism::IfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7854 + # source://prism//lib/prism/node.rb#7080 def type; end end end -# Represents an imaginary number literal. +# Represents assigning to a global variable using an operator that isn't `=`. # -# 1.0i -# ^^^^ -class Prism::ImaginaryNode < ::Prism::Node - # def initialize: (numeric: Node, location: Location) -> void +# $target += value +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#7089 +class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void # - # @return [ImaginaryNode] a new instance of ImaginaryNode + # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode # - # source://prism//prism/node.rb#7868 - def initialize(numeric, location); end + # source://prism//lib/prism/node.rb#7106 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + operator: Symbol, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, operator, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7874 + # source://prism//lib/prism/node.rb#7116 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7879 + # source://prism//lib/prism/node.rb#7121 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7889 + # source://prism//lib/prism/node.rb#7131 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7884 + # source://prism//lib/prism/node.rb#7126 def compact_child_nodes; end - # def copy: (**params) -> ImaginaryNode + # def copy: (**params) -> GlobalVariableOperatorWriteNode # - # source://prism//prism/node.rb#7894 + # source://prism//lib/prism/node.rb#7136 + sig { params(params: T.untyped).returns(Prism::GlobalVariableOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7879 + # source://prism//lib/prism/node.rb#7121 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } # - # source://prism//prism/node.rb#7905 + # source://prism//lib/prism/node.rb#7151 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#7910 + # source://prism//lib/prism/node.rb#7156 def inspect(inspector = T.unsafe(nil)); end - # attr_reader numeric: Node + # attr_reader name: Symbol # - # source://prism//prism/node.rb#7865 - def numeric; end + # source://prism//lib/prism/node.rb#7091 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#7094 + sig { returns(Prism::Location) } + def name_loc; end + + # attr_reader operator: Symbol + # + # source://prism//lib/prism/node.rb#7103 + sig { returns(Symbol) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#7097 + 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 @@ -11486,12 +13142,13 @@ class Prism::ImaginaryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#7931 + # source://prism//lib/prism/node.rb#7181 def type; end - # Returns the value of the node as a Ruby Complex. + # attr_reader value: Node # - # source://prism//prism/node_ext.rb#69 + # source://prism//lib/prism/node.rb#7100 + sig { returns(Prism::Node) } def value; end class << self @@ -11502,68 +13159,108 @@ class Prism::ImaginaryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#7941 + # source://prism//lib/prism/node.rb#7191 def type; end end end -# Represents a node that is implicitly being added to the tree but doesn't -# correspond directly to a node in the source. +# Represents the use of the `||=` operator for assignment to a global variable. # -# { foo: } -# ^^^^ +# $target ||= value +# ^^^^^^^^^^^^^^^^^ # -# { Foo: } -# ^^^^ -class Prism::ImplicitNode < ::Prism::Node - # def initialize: (value: Node, location: Location) -> void +# source://prism//lib/prism/node.rb#7200 +class Prism::GlobalVariableOrWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # - # @return [ImplicitNode] a new instance of ImplicitNode + # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode # - # source://prism//prism/node.rb#7959 - def initialize(value, location); end + # source://prism//lib/prism/node.rb#7214 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#7965 + # source://prism//lib/prism/node.rb#7223 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7970 + # source://prism//lib/prism/node.rb#7228 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#7980 + # source://prism//lib/prism/node.rb#7238 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#7975 + # source://prism//lib/prism/node.rb#7233 def compact_child_nodes; end - # def copy: (**params) -> ImplicitNode + # def copy: (**params) -> GlobalVariableOrWriteNode # - # source://prism//prism/node.rb#7985 + # source://prism//lib/prism/node.rb#7243 + sig { params(params: T.untyped).returns(Prism::GlobalVariableOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#7970 + # source://prism//lib/prism/node.rb#7228 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#7996 + # source://prism//lib/prism/node.rb#7257 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8001 + # source://prism//lib/prism/node.rb#7267 def inspect(inspector = T.unsafe(nil)); end + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#7202 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#7205 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#7262 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#7208 + 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 @@ -11579,12 +13276,13 @@ class Prism::ImplicitNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8022 + # source://prism//lib/prism/node.rb#7291 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#7956 + # source://prism//lib/prism/node.rb#7211 + sig { returns(Prism::Node) } def value; end class << self @@ -11595,73 +13293,86 @@ class Prism::ImplicitNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8032 + # source://prism//lib/prism/node.rb#7301 def type; end end end -# Represents using a trailing comma to indicate an implicit rest parameter. -# -# foo { |bar,| } -# ^ -# -# foo in [bar,] -# ^ +# Represents referencing a global variable. # -# for foo, in bar do end -# ^ +# $foo +# ^^^^ # -# foo, = bar -# ^ -class Prism::ImplicitRestNode < ::Prism::Node - # def initialize: (location: Location) -> void +# source://prism//lib/prism/node.rb#7310 +class Prism::GlobalVariableReadNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [ImplicitRestNode] a new instance of ImplicitRestNode + # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode # - # source://prism//prism/node.rb#8052 - def initialize(location); end + # source://prism//lib/prism/node.rb#7319 + sig { params(name: Symbol, location: Prism::Location).void } + def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8057 + # source://prism//lib/prism/node.rb#7325 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8062 + # source://prism//lib/prism/node.rb#7330 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8072 + # source://prism//lib/prism/node.rb#7340 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8067 + # source://prism//lib/prism/node.rb#7335 def compact_child_nodes; end - # def copy: (**params) -> ImplicitRestNode + # def copy: (**params) -> GlobalVariableReadNode # - # source://prism//prism/node.rb#8077 + # source://prism//lib/prism/node.rb#7345 + sig { params(params: T.untyped).returns(Prism::GlobalVariableReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8062 + # source://prism//lib/prism/node.rb#7330 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#8087 + # source://prism//lib/prism/node.rb#7356 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8092 + # source://prism//lib/prism/node.rb#7361 def inspect(inspector = T.unsafe(nil)); 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. + # + # $foo # name `:$foo` + # + # $_Test # name `:$_Test` + # + # source://prism//lib/prism/node.rb#7316 + 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 # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -11677,7 +13388,7 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8111 + # source://prism//lib/prism/node.rb#7381 def type; end class << self @@ -11688,93 +13399,81 @@ class Prism::ImplicitRestNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8121 + # source://prism//lib/prism/node.rb#7391 def type; end end end -# Represents the use of the `in` keyword in a case statement. +# Represents writing to a global variable in a context that doesn't have an explicit value. # -# case a; in b then c end -# ^^^^^^^^^^^ -class Prism::InNode < ::Prism::Node - # def initialize: (pattern: Node, statements: StatementsNode?, in_loc: Location, then_loc: Location?, location: Location) -> void +# $foo, $bar = baz +# ^^^^ ^^^^ +# +# source://prism//lib/prism/node.rb#7400 +class Prism::GlobalVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [InNode] a new instance of InNode + # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode # - # source://prism//prism/node.rb#8144 - def initialize(pattern, statements, in_loc, then_loc, location); end + # source://prism//lib/prism/node.rb#7405 + sig { params(name: Symbol, location: Prism::Location).void } + def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8153 + # source://prism//lib/prism/node.rb#7411 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8158 + # source://prism//lib/prism/node.rb#7416 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8171 + # source://prism//lib/prism/node.rb#7426 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8163 + # source://prism//lib/prism/node.rb#7421 def compact_child_nodes; end - # def copy: (**params) -> InNode + # def copy: (**params) -> GlobalVariableTargetNode # - # source://prism//prism/node.rb#8176 + # source://prism//lib/prism/node.rb#7431 + sig { params(params: T.untyped).returns(Prism::GlobalVariableTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8158 + # source://prism//lib/prism/node.rb#7416 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#8190 + # source://prism//lib/prism/node.rb#7442 + 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 in: () -> String - # - # source://prism//prism/node.rb#8195 - def in; end - - # attr_reader in_loc: Location - # - # source://prism//prism/node.rb#8138 - def in_loc; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8205 + # source://prism//lib/prism/node.rb#7447 def inspect(inspector = T.unsafe(nil)); end - # attr_reader pattern: Node - # - # source://prism//prism/node.rb#8132 - def pattern; end - - # attr_reader statements: StatementsNode? - # - # source://prism//prism/node.rb#8135 - def statements; end - - # def then: () -> String? - # - # source://prism//prism/node.rb#8200 - def then; end - - # attr_reader then_loc: Location? + # attr_reader name: Symbol # - # source://prism//prism/node.rb#8141 - def then_loc; end + # source://prism//lib/prism/node.rb#7402 + 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 @@ -11791,7 +13490,7 @@ class Prism::InNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8234 + # source://prism//lib/prism/node.rb#7467 def type; end class << self @@ -11802,133 +13501,108 @@ class Prism::InNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8244 + # source://prism//lib/prism/node.rb#7477 def type; end end end -# Represents the use of the `&&=` operator on a call to the `[]` method. +# Represents writing to a global variable. # -# foo.bar[baz] &&= value -# ^^^^^^^^^^^^^^^^^^^^^^ -class Prism::IndexAndWriteNode < ::Prism::Node - # def initialize: (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) -> void +# $foo = 1 +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#7486 +class Prism::GlobalVariableWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void # - # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode + # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode # - # source://prism//prism/node.rb#8282 - def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#7500 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(name, name_loc, value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8296 + # source://prism//lib/prism/node.rb#7509 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? - # - # source://prism//prism/node.rb#8267 - def arguments; end - - # def attribute_write?: () -> bool - # - # @return [Boolean] + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8355 - def attribute_write?; end + # source://prism//lib/prism/node.rb#7514 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # attr_reader block: Node? + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8273 - def block; end + # source://prism//lib/prism/node.rb#7524 + def comment_targets; end - # def call_operator: () -> String? + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8360 - def call_operator; end + # source://prism//lib/prism/node.rb#7519 + def compact_child_nodes; end - # attr_reader call_operator_loc: Location? + # def copy: (**params) -> GlobalVariableWriteNode # - # source://prism//prism/node.rb#8261 - def call_operator_loc; end + # source://prism//lib/prism/node.rb#7529 + sig { params(params: T.untyped).returns(Prism::GlobalVariableWriteNode) } + def copy(**params); end # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8301 - def child_nodes; end + # source://prism//lib/prism/node.rb#7514 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # def closing: () -> String + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#8370 - def closing; end + # source://prism//lib/prism/node.rb#7543 + 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 - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#8270 - def closing_loc; end - - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//prism/node.rb#8316 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//prism/node.rb#8306 - def compact_child_nodes; end - - # def copy: (**params) -> IndexAndWriteNode - # - # source://prism//prism/node.rb#8321 - def copy(**params); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] - # - # source://prism//prism/node.rb#8301 - def deconstruct; end - - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] - # - # source://prism//prism/node.rb#8340 - def deconstruct_keys(keys); end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8380 + # source://prism//lib/prism/node.rb#7553 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//prism/node.rb#8365 - def opening; end + # source://prism//lib/prism/node.rb#7488 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#8264 - def opening_loc; end + # source://prism//lib/prism/node.rb#7491 + sig { returns(Prism::Location) } + def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#8375 + # source://prism//lib/prism/node.rb#7548 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#8276 + # source://prism//lib/prism/node.rb#7497 + sig { returns(Prism::Location) } def operator_loc; end - # attr_reader receiver: Node? - # - # source://prism//prism/node.rb#8258 - def receiver; end - - # def safe_navigation?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8345 - def safe_navigation?; 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 @@ -11944,28 +13618,15 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8425 + # source://prism//lib/prism/node.rb#7577 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#8279 + # source://prism//lib/prism/node.rb#7494 + sig { returns(Prism::Node) } def value; end - # def variable_call?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8350 - def variable_call?; end - - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#8255 - 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. @@ -11974,132 +13635,124 @@ class Prism::IndexAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8435 + # source://prism//lib/prism/node.rb#7587 def type; end end end -# Represents the use of an assignment operator on a call to `[]`. +# Represents a hash literal. # -# foo.bar[baz] += value -# ^^^^^^^^^^^^^^^^^^^^^ -class Prism::IndexOperatorWriteNode < ::Prism::Node - # def initialize: (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) -> void +# { a => b } +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#7596 +class Prism::HashNode < ::Prism::Node + # def initialize: (Location opening_loc, Array[Node] elements, Location closing_loc, Location location) -> void # - # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode + # @return [HashNode] a new instance of HashNode # - # source://prism//prism/node.rb#8476 - def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#7619 + sig do + params( + opening_loc: Prism::Location, + elements: T::Array[Prism::Node], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(opening_loc, elements, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8491 + # source://prism//lib/prism/node.rb#7627 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? - # - # source://prism//prism/node.rb#8458 - def arguments; end - - # def attribute_write?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8551 - def attribute_write?; end - - # attr_reader block: Node? - # - # source://prism//prism/node.rb#8464 - def block; end - - # def call_operator: () -> String? - # - # source://prism//prism/node.rb#8556 - def call_operator; end - - # attr_reader call_operator_loc: Location? - # - # source://prism//prism/node.rb#8452 - def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8496 + # source://prism//lib/prism/node.rb#7632 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//prism/node.rb#8566 + # source://prism//lib/prism/node.rb#7670 + sig { returns(String) } def closing; end - # attr_reader closing_loc: Location + # The location of the closing brace. + # + # { a => b } + # ^ # - # source://prism//prism/node.rb#8461 + # source://prism//lib/prism/node.rb#7616 + sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8511 + # source://prism//lib/prism/node.rb#7642 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8501 + # source://prism//lib/prism/node.rb#7637 def compact_child_nodes; end - # def copy: (**params) -> IndexOperatorWriteNode + # def copy: (**params) -> HashNode # - # source://prism//prism/node.rb#8516 + # source://prism//lib/prism/node.rb#7647 + sig { params(params: T.untyped).returns(Prism::HashNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8496 + # source://prism//lib/prism/node.rb#7632 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, elements: Array[Node], closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#8536 + # source://prism//lib/prism/node.rb#7660 + 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(inspector: NodeInspector) -> String - # - # source://prism//prism/node.rb#8571 - def inspect(inspector = T.unsafe(nil)); end - - # def opening: () -> String + # The elements of the hash. These can be either `AssocNode`s or `AssocSplatNode`s. # - # source://prism//prism/node.rb#8561 - def opening; end - - # attr_reader opening_loc: Location + # { a: b } + # ^^^^ # - # source://prism//prism/node.rb#8455 - def opening_loc; end - - # attr_reader operator: Symbol + # { **foo } + # ^^^^^ # - # source://prism//prism/node.rb#8467 - def operator; end + # source://prism//lib/prism/node.rb#7610 + sig { returns(T::Array[Prism::Node]) } + def elements; end - # attr_reader operator_loc: Location + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8470 - def operator_loc; end + # source://prism//lib/prism/node.rb#7675 + def inspect(inspector = T.unsafe(nil)); end - # attr_reader receiver: Node? + # def opening: () -> String # - # source://prism//prism/node.rb#8449 - def receiver; end + # source://prism//lib/prism/node.rb#7665 + sig { returns(String) } + def opening; end - # def safe_navigation?: () -> bool + # The location of the opening brace. # - # @return [Boolean] + # { a => b } + # ^ # - # source://prism//prism/node.rb#8541 - def safe_navigation?; end + # source://prism//lib/prism/node.rb#7601 + sig { returns(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 @@ -12116,28 +13769,9 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8617 + # source://prism//lib/prism/node.rb#7697 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#8473 - def value; end - - # def variable_call?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8546 - def variable_call?; end - - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#8446 - 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. @@ -12146,132 +13780,129 @@ class Prism::IndexOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8627 + # source://prism//lib/prism/node.rb#7707 def type; end end end -# Represents the use of the `||=` operator on a call to `[]`. +# Represents a hash pattern in pattern matching. # -# foo.bar[baz] ||= value -# ^^^^^^^^^^^^^^^^^^^^^^ -class Prism::IndexOrWriteNode < ::Prism::Node - # def initialize: (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) -> void +# foo => { a: 1, b: 2 } +# ^^^^^^^^^^^^^^ +# +# foo => { a: 1, b: 2, **c } +# ^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#7719 +class Prism::HashPatternNode < ::Prism::Node + # def initialize: (Node? constant, Array[Node] elements, Node? rest, Location? opening_loc, Location? closing_loc, Location location) -> void # - # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode + # @return [HashPatternNode] a new instance of HashPatternNode # - # source://prism//prism/node.rb#8665 - def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#7736 + sig do + params( + constant: T.nilable(Prism::Node), + elements: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + opening_loc: T.nilable(Prism::Location), + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(constant, elements, rest, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8679 + # source://prism//lib/prism/node.rb#7746 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? - # - # source://prism//prism/node.rb#8650 - def arguments; end - - # def attribute_write?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8738 - def attribute_write?; end - - # attr_reader block: Node? - # - # source://prism//prism/node.rb#8656 - def block; end - - # def call_operator: () -> String? - # - # source://prism//prism/node.rb#8743 - def call_operator; end - - # attr_reader call_operator_loc: Location? - # - # source://prism//prism/node.rb#8644 - def call_operator_loc; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8684 + # source://prism//lib/prism/node.rb#7751 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String + # def closing: () -> String? # - # source://prism//prism/node.rb#8753 + # source://prism//lib/prism/node.rb#7795 + sig { returns(T.nilable(String)) } def closing; end - # attr_reader closing_loc: Location + # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#8653 + # source://prism//lib/prism/node.rb#7733 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8699 + # source://prism//lib/prism/node.rb#7765 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8689 + # source://prism//lib/prism/node.rb#7756 def compact_child_nodes; end - # def copy: (**params) -> IndexOrWriteNode + # attr_reader constant: Node? + # + # source://prism//lib/prism/node.rb#7721 + sig { returns(T.nilable(Prism::Node)) } + def constant; end + + # def copy: (**params) -> HashPatternNode # - # source://prism//prism/node.rb#8704 + # source://prism//lib/prism/node.rb#7770 + sig { params(params: T.untyped).returns(Prism::HashPatternNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8684 + # source://prism//lib/prism/node.rb#7751 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { constant: Node?, elements: Array[Node], rest: Node?, opening_loc: Location?, closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#8723 + # source://prism//lib/prism/node.rb#7785 + 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(inspector: NodeInspector) -> String + # attr_reader elements: Array[Node] + # + # source://prism//lib/prism/node.rb#7724 + sig { returns(T::Array[Prism::Node]) } + def elements; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#8763 + # source://prism//lib/prism/node.rb#7800 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String + # def opening: () -> String? # - # source://prism//prism/node.rb#8748 + # source://prism//lib/prism/node.rb#7790 + sig { returns(T.nilable(String)) } def opening; end - # attr_reader opening_loc: Location + # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#8647 + # source://prism//lib/prism/node.rb#7730 + sig { returns(T.nilable(Prism::Location)) } def opening_loc; end - # def operator: () -> String - # - # source://prism//prism/node.rb#8758 - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#8659 - def operator_loc; end - - # attr_reader receiver: Node? - # - # source://prism//prism/node.rb#8641 - def receiver; end - - # def safe_navigation?: () -> bool - # - # @return [Boolean] + # attr_reader rest: Node? # - # source://prism//prism/node.rb#8728 - def safe_navigation?; end + # source://prism//lib/prism/node.rb#7727 + sig { returns(T.nilable(Prism::Node)) } + def rest; 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 @@ -12288,28 +13919,9 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8808 + # source://prism//lib/prism/node.rb#7834 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#8662 - def value; end - - # def variable_call?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8733 - def variable_call?; end - - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#8638 - 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. @@ -12318,120 +13930,155 @@ class Prism::IndexOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8818 + # source://prism//lib/prism/node.rb#7844 def type; end end end -# Represents assigning to an index. +# source://prism//lib/prism/node_ext.rb#35 +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 + def heredoc?; end +end + +# Represents the use of the `if` keyword, either in the block form or the modifier form. # -# foo[bar], = 1 -# ^^^^^^^^ +# bar if foo +# ^^^^^^^^^^ # -# begin -# rescue => foo[bar] -# ^^^^^^^^ -# end +# if foo then bar end +# ^^^^^^^^^^^^^^^^^^^ # -# for foo[bar] in baz do end -# ^^^^^^^^ -class Prism::IndexTargetNode < ::Prism::Node - # def initialize: (flags: Integer, receiver: Node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, location: Location) -> void +# source://prism//lib/prism/node.rb#7856 +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 # - # @return [IndexTargetNode] a new instance of IndexTargetNode + # @return [IfNode] a new instance of IfNode # - # source://prism//prism/node.rb#8855 - def initialize(flags, receiver, opening_loc, arguments, closing_loc, block, location); end + # source://prism//lib/prism/node.rb#7876 + 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 + ).void + end + def initialize(if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#8866 + # source://prism//lib/prism/node.rb#7887 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? - # - # source://prism//prism/node.rb#8846 - def arguments; end - - # def attribute_write?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8921 - def attribute_write?; end - - # attr_reader block: Node? - # - # source://prism//prism/node.rb#8852 - def block; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8871 + # source://prism//lib/prism/node.rb#7896 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#8931 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#8849 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#8885 + # source://prism//lib/prism/node.rb#7910 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#8876 + # source://prism//lib/prism/node.rb#7901 def compact_child_nodes; end - # def copy: (**params) -> IndexTargetNode + # attr_reader consequent: Node? + # + # source://prism//lib/prism/node.rb#7870 + sig { returns(T.nilable(Prism::Node)) } + def consequent; end + + # def copy: (**params) -> IfNode # - # source://prism//prism/node.rb#8890 + # source://prism//lib/prism/node.rb#7915 + sig { params(params: T.untyped).returns(Prism::IfNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#8871 + # source://prism//lib/prism/node.rb#7896 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#8906 + # source://prism//lib/prism/node.rb#7931 + 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(inspector: NodeInspector) -> String + # def end_keyword: () -> String? # - # source://prism//prism/node.rb#8936 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#7946 + sig { returns(T.nilable(String)) } + def end_keyword; end - # def opening: () -> String + # attr_reader end_keyword_loc: Location? # - # source://prism//prism/node.rb#8926 - def opening; end + # source://prism//lib/prism/node.rb#7873 + sig { returns(T.nilable(Prism::Location)) } + def end_keyword_loc; end - # attr_reader opening_loc: Location + # def if_keyword: () -> String? # - # source://prism//prism/node.rb#8843 - def opening_loc; end + # source://prism//lib/prism/node.rb#7936 + sig { returns(T.nilable(String)) } + def if_keyword; end - # attr_reader receiver: Node + # attr_reader if_keyword_loc: Location? # - # source://prism//prism/node.rb#8840 - def receiver; end + # source://prism//lib/prism/node.rb#7858 + sig { returns(T.nilable(Prism::Location)) } + def if_keyword_loc; end - # def safe_navigation?: () -> bool + # def inspect(NodeInspector inspector) -> String # - # @return [Boolean] + # source://prism//lib/prism/node.rb#7951 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader predicate: Node # - # source://prism//prism/node.rb#8911 - def safe_navigation?; end + # source://prism//lib/prism/node.rb#7861 + sig { returns(Prism::Node) } + def predicate; end + + # source://prism//lib/prism/node.rb#7891 + def set_newline_flag(newline_marked); end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#7867 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end + + # def then_keyword: () -> String? + # + # source://prism//lib/prism/node.rb#7941 + sig { returns(T.nilable(String)) } + def then_keyword; end + + # attr_reader then_keyword_loc: Location? + # + # source://prism//lib/prism/node.rb#7864 + 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 @@ -12448,23 +14095,9 @@ class Prism::IndexTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#8973 + # source://prism//lib/prism/node.rb#7987 def type; end - # def variable_call?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#8916 - def variable_call?; end - - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#8837 - 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. @@ -12473,100 +14106,81 @@ class Prism::IndexTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#8983 + # source://prism//lib/prism/node.rb#7997 def type; end end end -# InlineComment objects are the most common. They correspond to comments in -# the source file like this one that start with #. -class Prism::InlineComment < ::Prism::Comment - # Returns a string representation of this comment. - # - # source://prism//prism/parse_result.rb#253 - def inspect; end - - # Returns true if this comment happens on the same line as other code and - # false if the comment is by itself. - # - # @return [Boolean] - # - # source://prism//prism/parse_result.rb#248 - def trailing?; end -end - -# Represents the use of the `&&=` operator for assignment to an instance variable. +# Represents an imaginary number literal. # -# @target &&= value -# ^^^^^^^^^^^^^^^^^ -class Prism::InstanceVariableAndWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void +# 1.0i +# ^^^^ +# +# source://prism//lib/prism/node.rb#8006 +class Prism::ImaginaryNode < ::Prism::Node + # def initialize: (Node numeric, Location location) -> void # - # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode + # @return [ImaginaryNode] a new instance of ImaginaryNode # - # source://prism//prism/node.rb#9006 - def initialize(name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#8011 + sig { params(numeric: Prism::Node, location: Prism::Location).void } + def initialize(numeric, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9015 + # source://prism//lib/prism/node.rb#8017 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9020 + # source://prism//lib/prism/node.rb#8022 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9030 + # source://prism//lib/prism/node.rb#8032 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9025 + # source://prism//lib/prism/node.rb#8027 def compact_child_nodes; end - # def copy: (**params) -> InstanceVariableAndWriteNode + # def copy: (**params) -> ImaginaryNode # - # source://prism//prism/node.rb#9035 + # source://prism//lib/prism/node.rb#8037 + sig { params(params: T.untyped).returns(Prism::ImaginaryNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9020 + # source://prism//lib/prism/node.rb#8022 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Node, location: Location } # - # source://prism//prism/node.rb#9049 + # source://prism//lib/prism/node.rb#8048 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9059 + # source://prism//lib/prism/node.rb#8053 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol - # - # source://prism//prism/node.rb#8994 - def name; end - - # attr_reader name_loc: Location - # - # source://prism//prism/node.rb#8997 - def name_loc; end - - # def operator: () -> String - # - # source://prism//prism/node.rb#9054 - def operator; end - - # attr_reader operator_loc: Location + # attr_reader numeric: Node # - # source://prism//prism/node.rb#9000 - def operator_loc; end + # source://prism//lib/prism/node.rb#8008 + sig { returns(Prism::Node) } + def numeric; 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 @@ -12583,12 +14197,12 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9083 + # source://prism//lib/prism/node.rb#8074 def type; end - # attr_reader value: Node + # Returns the value of the node as a Ruby Complex. # - # source://prism//prism/node.rb#9003 + # source://prism//lib/prism/node_ext.rb#69 def value; end class << self @@ -12599,84 +14213,82 @@ class Prism::InstanceVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9093 + # source://prism//lib/prism/node.rb#8084 def type; end end end -# Represents assigning to an instance variable using an operator that isn't `=`. +# Represents a node that is implicitly being added to the tree but doesn't correspond directly to a node in the source. # -# @target += value -# ^^^^^^^^^^^^^^^^ -class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void +# { foo: } +# ^^^^ +# +# { Foo: } +# ^^^^ +# +# foo in { bar: } +# ^^^^ +# +# source://prism//lib/prism/node.rb#8099 +class Prism::ImplicitNode < ::Prism::Node + # def initialize: (Node value, Location location) -> void # - # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode + # @return [ImplicitNode] a new instance of ImplicitNode # - # source://prism//prism/node.rb#9119 - def initialize(name, name_loc, operator_loc, value, operator, location); end + # source://prism//lib/prism/node.rb#8104 + sig { params(value: Prism::Node, location: Prism::Location).void } + def initialize(value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9129 + # source://prism//lib/prism/node.rb#8110 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9134 + # source://prism//lib/prism/node.rb#8115 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9144 + # source://prism//lib/prism/node.rb#8125 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9139 + # source://prism//lib/prism/node.rb#8120 def compact_child_nodes; end - # def copy: (**params) -> InstanceVariableOperatorWriteNode + # def copy: (**params) -> ImplicitNode # - # source://prism//prism/node.rb#9149 + # source://prism//lib/prism/node.rb#8130 + sig { params(params: T.untyped).returns(Prism::ImplicitNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9134 + # source://prism//lib/prism/node.rb#8115 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, location: Location } # - # source://prism//prism/node.rb#9164 + # source://prism//lib/prism/node.rb#8141 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9169 + # source://prism//lib/prism/node.rb#8146 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol - # - # source://prism//prism/node.rb#9104 - def name; end - - # attr_reader name_loc: Location - # - # source://prism//prism/node.rb#9107 - def name_loc; end - - # attr_reader operator: Symbol - # - # source://prism//prism/node.rb#9116 - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#9110 - 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 @@ -12692,12 +14304,13 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9194 + # source://prism//lib/prism/node.rb#8167 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#9113 + # source://prism//lib/prism/node.rb#8101 + sig { returns(Prism::Node) } def value; end class << self @@ -12708,84 +14321,85 @@ class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9204 + # source://prism//lib/prism/node.rb#8177 def type; end end end -# Represents the use of the `||=` operator for assignment to an instance variable. +# Represents using a trailing comma to indicate an implicit rest parameter. # -# @target ||= value -# ^^^^^^^^^^^^^^^^^ -class Prism::InstanceVariableOrWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void +# foo { |bar,| } +# ^ +# +# foo in [bar,] +# ^ +# +# for foo, in bar do end +# ^ +# +# foo, = bar +# ^ +# +# source://prism//lib/prism/node.rb#8195 +class Prism::ImplicitRestNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode + # @return [ImplicitRestNode] a new instance of ImplicitRestNode # - # source://prism//prism/node.rb#9227 - def initialize(name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#8197 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9236 + # source://prism//lib/prism/node.rb#8202 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9241 + # source://prism//lib/prism/node.rb#8207 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9251 + # source://prism//lib/prism/node.rb#8217 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9246 + # source://prism//lib/prism/node.rb#8212 def compact_child_nodes; end - # def copy: (**params) -> InstanceVariableOrWriteNode + # def copy: (**params) -> ImplicitRestNode # - # source://prism//prism/node.rb#9256 + # source://prism//lib/prism/node.rb#8222 + sig { params(params: T.untyped).returns(Prism::ImplicitRestNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9241 + # source://prism//lib/prism/node.rb#8207 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#9270 + # source://prism//lib/prism/node.rb#8232 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9280 + # source://prism//lib/prism/node.rb#8237 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol - # - # source://prism//prism/node.rb#9215 - def name; end - - # attr_reader name_loc: Location - # - # source://prism//prism/node.rb#9218 - def name_loc; end - - # def operator: () -> String - # - # source://prism//prism/node.rb#9275 - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#9221 - 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 @@ -12801,14 +14415,9 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9304 + # source://prism//lib/prism/node.rb#8256 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#9224 - 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. @@ -12817,68 +14426,119 @@ class Prism::InstanceVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9314 + # source://prism//lib/prism/node.rb#8266 def type; end end end -# Represents referencing an instance variable. +# Represents the use of the `in` keyword in a case statement. # -# @foo -# ^^^^ -class Prism::InstanceVariableReadNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void +# case a; in b then c end +# ^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8275 +class Prism::InNode < ::Prism::Node + # def initialize: (Node pattern, StatementsNode? statements, Location in_loc, Location? then_loc, Location location) -> void # - # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode + # @return [InNode] a new instance of InNode # - # source://prism//prism/node.rb#9328 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#8289 + sig do + params( + 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(pattern, statements, in_loc, then_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9334 + # source://prism//lib/prism/node.rb#8298 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9339 + # source://prism//lib/prism/node.rb#8303 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9349 + # source://prism//lib/prism/node.rb#8316 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9344 + # source://prism//lib/prism/node.rb#8308 def compact_child_nodes; end - # def copy: (**params) -> InstanceVariableReadNode + # def copy: (**params) -> InNode # - # source://prism//prism/node.rb#9354 + # source://prism//lib/prism/node.rb#8321 + sig { params(params: T.untyped).returns(Prism::InNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9339 + # source://prism//lib/prism/node.rb#8303 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { pattern: Node, statements: StatementsNode?, in_loc: Location, then_loc: Location?, location: Location } # - # source://prism//prism/node.rb#9365 + # source://prism//lib/prism/node.rb#8335 + 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(inspector: NodeInspector) -> String + # def in: () -> String + # + # source://prism//lib/prism/node.rb#8340 + sig { returns(String) } + def in; end + + # attr_reader in_loc: Location + # + # source://prism//lib/prism/node.rb#8283 + sig { returns(Prism::Location) } + def in_loc; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9370 + # source://prism//lib/prism/node.rb#8350 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # attr_reader pattern: Node # - # source://prism//prism/node.rb#9325 - def name; end + # source://prism//lib/prism/node.rb#8277 + sig { returns(Prism::Node) } + def pattern; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#8280 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end + + # def then: () -> String? + # + # source://prism//lib/prism/node.rb#8345 + sig { returns(T.nilable(String)) } + def then; end + + # attr_reader then_loc: Location? + # + # source://prism//lib/prism/node.rb#8286 + sig { returns(T.nilable(Prism::Location)) } + def then_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 @@ -12895,7 +14555,7 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9390 + # source://prism//lib/prism/node.rb#8379 def type; end class << self @@ -12906,173 +14566,179 @@ class Prism::InstanceVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9400 + # source://prism//lib/prism/node.rb#8389 def type; end end end -# Represents writing to an instance variable in a context that doesn't have an explicit value. +# Represents the use of the `&&=` operator on a call to the `[]` method. # -# @foo, @bar = baz -# ^^^^ ^^^^ -class Prism::InstanceVariableTargetNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void +# foo.bar[baz] &&= value +# ^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8398 +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 # - # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode + # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode # - # source://prism//prism/node.rb#9414 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#8427 + 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 + ).void + end + def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9420 + # source://prism//lib/prism/node.rb#8441 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//prism/node.rb#9425 - def child_nodes; end - - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//prism/node.rb#9435 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//prism/node.rb#9430 - def compact_child_nodes; end - - # def copy: (**params) -> InstanceVariableTargetNode + # attr_reader arguments: ArgumentsNode? # - # source://prism//prism/node.rb#9440 - def copy(**params); end + # source://prism//lib/prism/node.rb#8412 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def attribute_write?: () -> bool # - # source://prism//prism/node.rb#9425 - def deconstruct; end - - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # @return [Boolean] # - # source://prism//prism/node.rb#9451 - def deconstruct_keys(keys); end + # source://prism//lib/prism/node.rb#8500 + sig { returns(T::Boolean) } + def attribute_write?; end - # def inspect(inspector: NodeInspector) -> String + # attr_reader block: Node? # - # source://prism//prism/node.rb#9456 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8418 + sig { returns(T.nilable(Prism::Node)) } + def block; end - # attr_reader name: Symbol + # def call_operator: () -> String? # - # source://prism//prism/node.rb#9411 - def name; end + # source://prism//lib/prism/node.rb#8510 + sig { returns(T.nilable(String)) } + def call_operator; 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 + # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#9476 - 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//prism/node.rb#9486 - def type; end - end -end + # source://prism//lib/prism/node.rb#8406 + sig { returns(T.nilable(Prism::Location)) } + def call_operator_loc; end -# Represents writing to an instance variable. -# -# @foo = 1 -# ^^^^^^^^ -class Prism::InstanceVariableWriteNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void - # - # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9509 - def initialize(name, name_loc, value, operator_loc, location); end + # source://prism//lib/prism/node.rb#8446 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # def accept: (visitor: Visitor) -> void + # def closing: () -> String # - # source://prism//prism/node.rb#9518 - def accept(visitor); end + # source://prism//lib/prism/node.rb#8520 + sig { returns(String) } + def closing; end - # def child_nodes: () -> Array[nil | Node] + # attr_reader closing_loc: Location # - # source://prism//prism/node.rb#9523 - def child_nodes; end + # source://prism//lib/prism/node.rb#8415 + sig { returns(Prism::Location) } + def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9533 + # source://prism//lib/prism/node.rb#8461 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9528 + # source://prism//lib/prism/node.rb#8451 def compact_child_nodes; end - # def copy: (**params) -> InstanceVariableWriteNode + # def copy: (**params) -> IndexAndWriteNode # - # source://prism//prism/node.rb#9538 + # source://prism//lib/prism/node.rb#8466 + sig { params(params: T.untyped).returns(Prism::IndexAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9523 + # source://prism//lib/prism/node.rb#8446 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#9552 + # source://prism//lib/prism/node.rb#8485 + 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(inspector: NodeInspector) -> String + # def ignore_visibility?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#8505 + sig { returns(T::Boolean) } + def ignore_visibility?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9562 + # source://prism//lib/prism/node.rb#8530 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # def opening: () -> String # - # source://prism//prism/node.rb#9497 - def name; end + # source://prism//lib/prism/node.rb#8515 + sig { returns(String) } + def opening; end - # attr_reader name_loc: Location + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#9500 - def name_loc; end + # source://prism//lib/prism/node.rb#8409 + sig { returns(Prism::Location) } + def opening_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#9557 + # source://prism//lib/prism/node.rb#8525 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#9506 + # source://prism//lib/prism/node.rb#8421 + sig { returns(Prism::Location) } def operator_loc; end + # attr_reader receiver: Node? + # + # source://prism//lib/prism/node.rb#8403 + sig { returns(T.nilable(Prism::Node)) } + def receiver; end + + # def safe_navigation?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#8490 + sig { returns(T::Boolean) } + def safe_navigation?; 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 @@ -13088,14 +14754,31 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9586 + # source://prism//lib/prism/node.rb#8575 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#9503 + # source://prism//lib/prism/node.rb#8424 + sig { returns(Prism::Node) } def value; end + # def variable_call?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#8495 + sig { returns(T::Boolean) } + def variable_call?; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#8400 + 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. @@ -13104,114 +14787,179 @@ class Prism::InstanceVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9596 + # source://prism//lib/prism/node.rb#8585 def type; end end end -# Flags for integer nodes that correspond to the base of the integer. -module Prism::IntegerBaseFlags; end - -# 0b prefix +# Represents the use of an assignment operator on a call to `[]`. # -# source://prism//prism/node.rb#17312 -Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) - -# 0d or no prefix +# foo.bar[baz] += value +# ^^^^^^^^^^^^^^^^^^^^^ # -# source://prism//prism/node.rb#17315 -Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) +# source://prism//lib/prism/node.rb#8594 +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 + # + # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode + # + # source://prism//lib/prism/node.rb#8626 + 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: Symbol, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator, operator_loc, value, location); end -# 0x prefix -# -# source://prism//prism/node.rb#17321 -Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#8641 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end -# 0o or 0 prefix -# -# source://prism//prism/node.rb#17318 -Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#8608 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end -# Represents an integer number literal. -# -# 1 -# ^ -class Prism::IntegerNode < ::Prism::Node - # def initialize: (flags: Integer, location: Location) -> void + # def attribute_write?: () -> bool # - # @return [IntegerNode] a new instance of IntegerNode + # @return [Boolean] # - # source://prism//prism/node.rb#9610 - def initialize(flags, location); end + # source://prism//lib/prism/node.rb#8701 + sig { returns(T::Boolean) } + def attribute_write?; end - # def accept: (visitor: Visitor) -> void + # attr_reader block: Node? # - # source://prism//prism/node.rb#9616 - def accept(visitor); end + # source://prism//lib/prism/node.rb#8614 + sig { returns(T.nilable(Prism::Node)) } + def block; end - # def binary?: () -> bool + # def call_operator: () -> String? # - # @return [Boolean] + # source://prism//lib/prism/node.rb#8711 + sig { returns(T.nilable(String)) } + def call_operator; end + + # attr_reader call_operator_loc: Location? # - # source://prism//prism/node.rb#9652 - def binary?; end + # source://prism//lib/prism/node.rb#8602 + sig { returns(T.nilable(Prism::Location)) } + def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9621 + # source://prism//lib/prism/node.rb#8646 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#8721 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#8611 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9631 + # source://prism//lib/prism/node.rb#8661 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9626 + # source://prism//lib/prism/node.rb#8651 def compact_child_nodes; end - # def copy: (**params) -> IntegerNode + # def copy: (**params) -> IndexOperatorWriteNode # - # source://prism//prism/node.rb#9636 + # source://prism//lib/prism/node.rb#8666 + sig { params(params: T.untyped).returns(Prism::IndexOperatorWriteNode) } def copy(**params); end - # def decimal?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9657 - def decimal?; end - # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9621 + # source://prism//lib/prism/node.rb#8646 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#9647 + # source://prism//lib/prism/node.rb#8686 + 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 hexadecimal?: () -> bool + # def ignore_visibility?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9667 - def hexadecimal?; end + # source://prism//lib/prism/node.rb#8706 + sig { returns(T::Boolean) } + def ignore_visibility?; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9672 + # source://prism//lib/prism/node.rb#8726 def inspect(inspector = T.unsafe(nil)); end - # def octal?: () -> bool + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#8716 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#8605 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader operator: Symbol + # + # source://prism//lib/prism/node.rb#8617 + sig { returns(Symbol) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#8620 + sig { returns(Prism::Location) } + def operator_loc; end + + # attr_reader receiver: Node? + # + # source://prism//lib/prism/node.rb#8599 + sig { returns(T.nilable(Prism::Node)) } + def receiver; end + + # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9662 - def octal?; end + # source://prism//lib/prism/node.rb#8691 + sig { returns(T::Boolean) } + def safe_navigation?; 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 @@ -13228,19 +14976,29 @@ class Prism::IntegerNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9693 + # source://prism//lib/prism/node.rb#8772 def type; end - # Returns the value of the node as a Ruby Integer. + # attr_reader value: Node # - # source://prism//prism/node_ext.rb#76 + # source://prism//lib/prism/node.rb#8623 + sig { returns(Prism::Node) } def value; end + # def variable_call?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#8696 + sig { returns(T::Boolean) } + def variable_call?; end + private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#9607 + # source://prism//lib/prism/node.rb#8596 + sig { returns(Integer) } def flags; end class << self @@ -13251,158 +15009,178 @@ class Prism::IntegerNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9703 + # source://prism//lib/prism/node.rb#8782 def type; end end 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. +# Represents the use of the `||=` operator on a call to `[]`. # -# if /foo #{bar} baz/ then end -# ^^^^^^^^^^^^^^^^ -class Prism::InterpolatedMatchLastLineNode < ::Prism::Node - include ::Prism::RegularExpressionOptions - - # def initialize: (flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location) -> void +# foo.bar[baz] ||= value +# ^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8791 +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 # - # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode + # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode # - # source://prism//prism/node.rb#9728 - def initialize(flags, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#8820 + 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 + ).void + end + def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9737 + # source://prism//lib/prism/node.rb#8834 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # def ascii_8bit?: () -> bool + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#8805 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + + # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9806 - def ascii_8bit?; end + # source://prism//lib/prism/node.rb#8893 + sig { returns(T::Boolean) } + def attribute_write?; end + + # attr_reader block: Node? + # + # source://prism//lib/prism/node.rb#8811 + sig { returns(T.nilable(Prism::Node)) } + def block; end + + # def call_operator: () -> String? + # + # source://prism//lib/prism/node.rb#8903 + sig { returns(T.nilable(String)) } + def call_operator; end + + # attr_reader call_operator_loc: Location? + # + # source://prism//lib/prism/node.rb#8799 + sig { returns(T.nilable(Prism::Location)) } + def call_operator_loc; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9747 + # source://prism//lib/prism/node.rb#8839 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//prism/node.rb#9841 + # source://prism//lib/prism/node.rb#8913 + sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//prism/node.rb#9725 + # source://prism//lib/prism/node.rb#8808 + sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9757 + # source://prism//lib/prism/node.rb#8854 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9752 + # source://prism//lib/prism/node.rb#8844 def compact_child_nodes; end - # def copy: (**params) -> InterpolatedMatchLastLineNode + # def copy: (**params) -> IndexOrWriteNode # - # source://prism//prism/node.rb#9762 + # source://prism//lib/prism/node.rb#8859 + sig { params(params: T.untyped).returns(Prism::IndexOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9747 + # source://prism//lib/prism/node.rb#8839 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#9776 + # source://prism//lib/prism/node.rb#8878 + 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 euc_jp?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9801 - def euc_jp?; end - - # def extended?: () -> bool + # def ignore_visibility?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9786 - def extended?; end + # source://prism//lib/prism/node.rb#8898 + sig { returns(T::Boolean) } + def ignore_visibility?; end - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#9826 - def forced_binary_encoding?; end + # source://prism//lib/prism/node.rb#8923 + def inspect(inspector = T.unsafe(nil)); end - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] + # def opening: () -> String # - # source://prism//prism/node.rb#9831 - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/node.rb#8908 + sig { returns(String) } + def opening; end - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#9821 - def forced_utf8_encoding?; end + # source://prism//lib/prism/node.rb#8802 + sig { returns(Prism::Location) } + def opening_loc; end - # def ignore_case?: () -> bool - # - # @return [Boolean] + # def operator: () -> String # - # source://prism//prism/node.rb#9781 - def ignore_case?; end + # source://prism//lib/prism/node.rb#8918 + sig { returns(String) } + def operator; end - # def inspect(inspector: NodeInspector) -> String + # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#9846 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#8814 + sig { returns(Prism::Location) } + def operator_loc; end - # def multi_line?: () -> bool - # - # @return [Boolean] + # attr_reader receiver: Node? # - # source://prism//prism/node.rb#9791 - def multi_line?; end + # source://prism//lib/prism/node.rb#8796 + sig { returns(T.nilable(Prism::Node)) } + def receiver; end - # def once?: () -> bool + # def safe_navigation?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9796 - def once?; end - - # def opening: () -> String - # - # source://prism//prism/node.rb#9836 - def opening; end - - # attr_reader opening_loc: Location - # - # source://prism//prism/node.rb#9719 - def opening_loc; end - - # attr_reader parts: Array[Node] - # - # source://prism//prism/node.rb#9722 - def parts; end - - # source://prism//prism/node.rb#9741 - def set_newline_flag(newline_marked); end + # source://prism//lib/prism/node.rb#8883 + sig { returns(T::Boolean) } + def safe_navigation?; 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 @@ -13419,28 +15197,29 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#9870 + # source://prism//lib/prism/node.rb#8968 def type; end - # def utf_8?: () -> bool - # - # @return [Boolean] + # attr_reader value: Node # - # source://prism//prism/node.rb#9816 - def utf_8?; end + # source://prism//lib/prism/node.rb#8817 + sig { returns(Prism::Node) } + def value; end - # def windows_31j?: () -> bool + # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9811 - def windows_31j?; end + # source://prism//lib/prism/node.rb#8888 + sig { returns(T::Boolean) } + def variable_call?; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#9716 + # source://prism//lib/prism/node.rb#8793 + sig { returns(Integer) } def flags; end class << self @@ -13451,156 +15230,159 @@ class Prism::InterpolatedMatchLastLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#9880 + # source://prism//lib/prism/node.rb#8978 def type; end end end -# Represents a regular expression literal that contains interpolation. +# Represents assigning to an index. # -# /foo #{bar} baz/ -# ^^^^^^^^^^^^^^^^ -class Prism::InterpolatedRegularExpressionNode < ::Prism::Node - include ::Prism::RegularExpressionOptions - - # def initialize: (flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location) -> void +# foo[bar], = 1 +# ^^^^^^^^ +# +# begin +# rescue => foo[bar] +# ^^^^^^^^ +# end +# +# for foo[bar] in baz do end +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#8995 +class Prism::IndexTargetNode < ::Prism::Node + # def initialize: (Integer flags, Node receiver, Location opening_loc, ArgumentsNode? arguments, Location closing_loc, Node? block, Location location) -> void # - # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode + # @return [IndexTargetNode] a new instance of IndexTargetNode # - # source://prism//prism/node.rb#9903 - def initialize(flags, opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#9015 + 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 + ).void + end + def initialize(flags, receiver, opening_loc, arguments, closing_loc, block, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#9912 + # source://prism//lib/prism/node.rb#9026 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # def ascii_8bit?: () -> bool + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#9006 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + + # def attribute_write?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9981 - def ascii_8bit?; end + # source://prism//lib/prism/node.rb#9081 + sig { returns(T::Boolean) } + def attribute_write?; end + + # attr_reader block: Node? + # + # source://prism//lib/prism/node.rb#9012 + sig { returns(T.nilable(Prism::Node)) } + def block; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9922 + # source://prism//lib/prism/node.rb#9031 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//prism/node.rb#10016 + # source://prism//lib/prism/node.rb#9096 + sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//prism/node.rb#9900 + # source://prism//lib/prism/node.rb#9009 + sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#9932 + # source://prism//lib/prism/node.rb#9045 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#9927 + # source://prism//lib/prism/node.rb#9036 def compact_child_nodes; end - # def copy: (**params) -> InterpolatedRegularExpressionNode + # def copy: (**params) -> IndexTargetNode # - # source://prism//prism/node.rb#9937 + # source://prism//lib/prism/node.rb#9050 + sig { params(params: T.untyped).returns(Prism::IndexTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#9922 + # source://prism//lib/prism/node.rb#9031 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, receiver: Node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, location: Location } # - # source://prism//prism/node.rb#9951 + # source://prism//lib/prism/node.rb#9066 + 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 euc_jp?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9976 - def euc_jp?; end - - # def extended?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9961 - def extended?; end - - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#10001 - def forced_binary_encoding?; end - - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#10006 - def forced_us_ascii_encoding?; end - - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9996 - def forced_utf8_encoding?; end - - # def ignore_case?: () -> bool + # def ignore_visibility?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9956 - def ignore_case?; end + # source://prism//lib/prism/node.rb#9086 + sig { returns(T::Boolean) } + def ignore_visibility?; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10021 + # source://prism//lib/prism/node.rb#9101 def inspect(inspector = T.unsafe(nil)); end - # def multi_line?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9966 - def multi_line?; end - - # def once?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9971 - def once?; end - # def opening: () -> String # - # source://prism//prism/node.rb#10011 + # source://prism//lib/prism/node.rb#9091 + sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#9894 + # source://prism//lib/prism/node.rb#9003 + sig { returns(Prism::Location) } def opening_loc; end - # attr_reader parts: Array[Node] + # attr_reader receiver: Node # - # source://prism//prism/node.rb#9897 - def parts; end + # source://prism//lib/prism/node.rb#9000 + sig { returns(Prism::Node) } + def receiver; end - # source://prism//prism/node.rb#9916 - def set_newline_flag(newline_marked); end + # def safe_navigation?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9071 + sig { returns(T::Boolean) } + def safe_navigation?; 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 @@ -13617,28 +15399,23 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10045 + # source://prism//lib/prism/node.rb#9138 def type; end - # def utf_8?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#9991 - def utf_8?; end - - # def windows_31j?: () -> bool + # def variable_call?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#9986 - def windows_31j?; end + # source://prism//lib/prism/node.rb#9076 + sig { returns(T::Boolean) } + def variable_call?; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#9891 + # source://prism//lib/prism/node.rb#8997 + sig { returns(Integer) } def flags; end class << self @@ -13649,93 +15426,127 @@ class Prism::InterpolatedRegularExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10055 + # source://prism//lib/prism/node.rb#9148 def type; end end end -# Represents a string literal that contains interpolation. +# InlineComment objects are the most common. They correspond to comments in +# the source file like this one that start with #. # -# "foo #{bar} baz" -# ^^^^^^^^^^^^^^^^ -class Prism::InterpolatedStringNode < ::Prism::Node - include ::Prism::HeredocQuery +# source://prism//lib/prism/parse_result.rb#245 +class Prism::InlineComment < ::Prism::Comment + # Returns a string representation of this comment. + # + # source://prism//lib/prism/parse_result.rb#253 + def inspect; end - # def initialize: (opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location) -> void + # Returns true if this comment happens on the same line as other code and + # false if the comment is by itself. # - # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode + # @return [Boolean] # - # source://prism//prism/node.rb#10075 - def initialize(opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/parse_result.rb#248 + sig { override.returns(T::Boolean) } + def trailing?; end +end + +# Represents the use of the `&&=` operator for assignment to an instance variable. +# +# @target &&= value +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9157 +class Prism::InstanceVariableAndWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void + # + # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode + # + # source://prism//lib/prism/node.rb#9171 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10083 + # source://prism//lib/prism/node.rb#9180 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10093 + # source://prism//lib/prism/node.rb#9185 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String? - # - # source://prism//prism/node.rb#10131 - def closing; end - - # attr_reader closing_loc: Location? - # - # source://prism//prism/node.rb#10072 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10103 + # source://prism//lib/prism/node.rb#9195 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10098 + # source://prism//lib/prism/node.rb#9190 def compact_child_nodes; end - # def copy: (**params) -> InterpolatedStringNode + # def copy: (**params) -> InstanceVariableAndWriteNode # - # source://prism//prism/node.rb#10108 + # source://prism//lib/prism/node.rb#9200 + sig { params(params: T.untyped).returns(Prism::InstanceVariableAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10093 + # source://prism//lib/prism/node.rb#9185 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#10121 + # source://prism//lib/prism/node.rb#9214 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10136 + # source://prism//lib/prism/node.rb#9224 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String? + # attr_reader name: Symbol # - # source://prism//prism/node.rb#10126 - def opening; end + # source://prism//lib/prism/node.rb#9159 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location? + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#10066 - def opening_loc; end + # source://prism//lib/prism/node.rb#9162 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parts: Array[Node] + # def operator: () -> String # - # source://prism//prism/node.rb#10069 - def parts; end + # source://prism//lib/prism/node.rb#9219 + sig { returns(String) } + def operator; end - # source://prism//prism/node.rb#10087 - def set_newline_flag(newline_marked); end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#9165 + 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 @@ -13752,9 +15563,15 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10158 + # source://prism//lib/prism/node.rb#9248 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#9168 + 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. @@ -13763,91 +15580,108 @@ class Prism::InterpolatedStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10168 + # source://prism//lib/prism/node.rb#9258 def type; end end end -# Represents a symbol literal that contains interpolation. +# Represents assigning to an instance variable using an operator that isn't `=`. # -# :"foo #{bar} baz" -# ^^^^^^^^^^^^^^^^^ -class Prism::InterpolatedSymbolNode < ::Prism::Node - # def initialize: (opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location) -> void +# @target += value +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9267 +class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Symbol operator, Location location) -> void # - # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode + # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode # - # source://prism//prism/node.rb#10188 - def initialize(opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#9284 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + operator: Symbol, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, operator, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10196 + # source://prism//lib/prism/node.rb#9294 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10206 + # source://prism//lib/prism/node.rb#9299 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String? - # - # source://prism//prism/node.rb#10244 - def closing; end - - # attr_reader closing_loc: Location? - # - # source://prism//prism/node.rb#10185 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10216 + # source://prism//lib/prism/node.rb#9309 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10211 + # source://prism//lib/prism/node.rb#9304 def compact_child_nodes; end - # def copy: (**params) -> InterpolatedSymbolNode + # def copy: (**params) -> InstanceVariableOperatorWriteNode # - # source://prism//prism/node.rb#10221 + # source://prism//lib/prism/node.rb#9314 + sig { params(params: T.untyped).returns(Prism::InstanceVariableOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10206 + # source://prism//lib/prism/node.rb#9299 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location } # - # source://prism//prism/node.rb#10234 + # source://prism//lib/prism/node.rb#9329 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10249 + # source://prism//lib/prism/node.rb#9334 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String? + # attr_reader name: Symbol # - # source://prism//prism/node.rb#10239 - def opening; end + # source://prism//lib/prism/node.rb#9269 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location? + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#10179 - def opening_loc; end + # source://prism//lib/prism/node.rb#9272 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parts: Array[Node] + # attr_reader operator: Symbol # - # source://prism//prism/node.rb#10182 - def parts; end + # source://prism//lib/prism/node.rb#9281 + sig { returns(Symbol) } + def operator; end - # source://prism//prism/node.rb#10200 - def set_newline_flag(newline_marked); end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#9275 + 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 @@ -13864,9 +15698,15 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10271 + # source://prism//lib/prism/node.rb#9359 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#9278 + 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. @@ -13875,93 +15715,107 @@ class Prism::InterpolatedSymbolNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10281 + # source://prism//lib/prism/node.rb#9369 def type; end end end -# Represents an xstring literal that contains interpolation. +# Represents the use of the `||=` operator for assignment to an instance variable. # -# `foo #{bar} baz` -# ^^^^^^^^^^^^^^^^ -class Prism::InterpolatedXStringNode < ::Prism::Node - include ::Prism::HeredocQuery - - # def initialize: (opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location) -> void +# @target ||= value +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9378 +class Prism::InstanceVariableOrWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # - # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode + # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode # - # source://prism//prism/node.rb#10301 - def initialize(opening_loc, parts, closing_loc, location); end + # source://prism//lib/prism/node.rb#9392 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10309 + # source://prism//lib/prism/node.rb#9401 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10319 + # source://prism//lib/prism/node.rb#9406 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#10357 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#10298 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10329 + # source://prism//lib/prism/node.rb#9416 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10324 + # source://prism//lib/prism/node.rb#9411 def compact_child_nodes; end - # def copy: (**params) -> InterpolatedXStringNode + # def copy: (**params) -> InstanceVariableOrWriteNode # - # source://prism//prism/node.rb#10334 + # source://prism//lib/prism/node.rb#9421 + sig { params(params: T.untyped).returns(Prism::InstanceVariableOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10319 + # source://prism//lib/prism/node.rb#9406 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#10347 + # source://prism//lib/prism/node.rb#9435 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10362 + # source://prism//lib/prism/node.rb#9445 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//prism/node.rb#10352 - def opening; end + # source://prism//lib/prism/node.rb#9380 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#10292 - def opening_loc; end + # source://prism//lib/prism/node.rb#9383 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader parts: Array[Node] + # def operator: () -> String # - # source://prism//prism/node.rb#10295 - def parts; end + # source://prism//lib/prism/node.rb#9440 + sig { returns(String) } + def operator; end - # source://prism//prism/node.rb#10313 - def set_newline_flag(newline_marked); end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#9386 + 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 @@ -13978,9 +15832,15 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10384 + # source://prism//lib/prism/node.rb#9469 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#9389 + 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. @@ -13989,75 +15849,85 @@ class Prism::InterpolatedXStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10394 + # source://prism//lib/prism/node.rb#9479 def type; end end end -# Represents a hash literal without opening and closing braces. +# Represents referencing an instance variable. # -# foo(a: b) -# ^^^^ -class Prism::KeywordHashNode < ::Prism::Node - # def initialize: (flags: Integer, elements: Array[Node], location: Location) -> void +# @foo +# ^^^^ +# +# source://prism//lib/prism/node.rb#9488 +class Prism::InstanceVariableReadNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [KeywordHashNode] a new instance of KeywordHashNode + # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode # - # source://prism//prism/node.rb#10411 - def initialize(flags, elements, location); end + # source://prism//lib/prism/node.rb#9497 + sig { params(name: Symbol, location: Prism::Location).void } + def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10418 + # source://prism//lib/prism/node.rb#9503 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10423 + # source://prism//lib/prism/node.rb#9508 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10433 + # source://prism//lib/prism/node.rb#9518 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10428 + # source://prism//lib/prism/node.rb#9513 def compact_child_nodes; end - # def copy: (**params) -> KeywordHashNode + # def copy: (**params) -> InstanceVariableReadNode # - # source://prism//prism/node.rb#10438 + # source://prism//lib/prism/node.rb#9523 + sig { params(params: T.untyped).returns(Prism::InstanceVariableReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10423 + # source://prism//lib/prism/node.rb#9508 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#10450 + # source://prism//lib/prism/node.rb#9534 + 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 - # attr_reader elements: Array[Node] - # - # source://prism//prism/node.rb#10408 - def elements; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10460 + # source://prism//lib/prism/node.rb#9539 def inspect(inspector = T.unsafe(nil)); end - # def static_keys?: () -> bool + # 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). # - # @return [Boolean] + # @x # name `:@x` + # + # @_test # name `:@_test` # - # source://prism//prism/node.rb#10455 - def static_keys?; end + # source://prism//lib/prism/node.rb#9494 + 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 @@ -14074,16 +15944,9 @@ class Prism::KeywordHashNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10482 + # source://prism//lib/prism/node.rb#9559 def type; end - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#10405 - 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. @@ -14092,93 +15955,82 @@ class Prism::KeywordHashNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10492 + # source://prism//lib/prism/node.rb#9569 def type; end end end -# Flags for keyword hash nodes. -module Prism::KeywordHashNodeFlags; end - -# a keyword hash which only has `AssocNode` elements all with static literal keys, which means the elements can be treated as keyword arguments +# Represents writing to an instance variable in a context that doesn't have an explicit value. # -# source://prism//prism/node.rb#17327 -Prism::KeywordHashNodeFlags::STATIC_KEYS = T.let(T.unsafe(nil), Integer) - -# Represents a keyword rest parameter to a method, block, or lambda definition. +# @foo, @bar = baz +# ^^^^ ^^^^ # -# def a(**b) -# ^^^ -# end -class Prism::KeywordRestParameterNode < ::Prism::Node - # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location) -> void +# source://prism//lib/prism/node.rb#9578 +class Prism::InstanceVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Location location) -> void # - # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode + # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode # - # source://prism//prism/node.rb#10513 - def initialize(name, name_loc, operator_loc, location); end + # source://prism//lib/prism/node.rb#9583 + sig { params(name: Symbol, location: Prism::Location).void } + def initialize(name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10521 + # source://prism//lib/prism/node.rb#9589 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10526 + # source://prism//lib/prism/node.rb#9594 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10536 + # source://prism//lib/prism/node.rb#9604 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10531 + # source://prism//lib/prism/node.rb#9599 def compact_child_nodes; end - # def copy: (**params) -> KeywordRestParameterNode + # def copy: (**params) -> InstanceVariableTargetNode # - # source://prism//prism/node.rb#10541 + # source://prism//lib/prism/node.rb#9609 + sig { params(params: T.untyped).returns(Prism::InstanceVariableTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10526 + # source://prism//lib/prism/node.rb#9594 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, location: Location } # - # source://prism//prism/node.rb#10554 + # source://prism//lib/prism/node.rb#9620 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10564 + # source://prism//lib/prism/node.rb#9625 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol? + # attr_reader name: Symbol # - # source://prism//prism/node.rb#10504 + # source://prism//lib/prism/node.rb#9580 + sig { returns(Symbol) } def name; end - # attr_reader name_loc: Location? - # - # source://prism//prism/node.rb#10507 - def name_loc; end - - # def operator: () -> String - # - # source://prism//prism/node.rb#10559 - def operator; end - - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#10510 - 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 @@ -14194,7 +16046,7 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10590 + # source://prism//lib/prism/node.rb#9645 def type; end class << self @@ -14205,114 +16057,108 @@ class Prism::KeywordRestParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10600 + # source://prism//lib/prism/node.rb#9655 def type; end end end -# Represents using a lambda literal (not the lambda method call). +# Represents writing to an instance variable. # -# ->(value) { value * 2 } -# ^^^^^^^^^^^^^^^^^^^^^^^ -class Prism::LambdaNode < ::Prism::Node - # def initialize: (locals: Array[Symbol], locals_body_index: Integer, operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: Node?, body: Node?, location: Location) -> void +# @foo = 1 +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9664 +class Prism::InstanceVariableWriteNode < ::Prism::Node + # def initialize: (Symbol name, Location name_loc, Node value, Location operator_loc, Location location) -> void # - # @return [LambdaNode] a new instance of LambdaNode + # @return [InstanceVariableWriteNode] a new instance of InstanceVariableWriteNode # - # source://prism//prism/node.rb#10632 - def initialize(locals, locals_body_index, operator_loc, opening_loc, closing_loc, parameters, body, location); end + # source://prism//lib/prism/node.rb#9678 + sig do + params( + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(name, name_loc, value, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10644 + # source://prism//lib/prism/node.rb#9687 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader body: Node? - # - # source://prism//prism/node.rb#10629 - def body; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10649 + # source://prism//lib/prism/node.rb#9692 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#10699 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#10623 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10662 + # source://prism//lib/prism/node.rb#9702 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10654 + # source://prism//lib/prism/node.rb#9697 def compact_child_nodes; end - # def copy: (**params) -> LambdaNode + # def copy: (**params) -> InstanceVariableWriteNode # - # source://prism//prism/node.rb#10667 + # source://prism//lib/prism/node.rb#9707 + sig { params(params: T.untyped).returns(Prism::InstanceVariableWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10649 + # source://prism//lib/prism/node.rb#9692 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#10684 + # source://prism//lib/prism/node.rb#9721 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10704 + # source://prism//lib/prism/node.rb#9731 def inspect(inspector = T.unsafe(nil)); end - # attr_reader locals: Array[Symbol] - # - # source://prism//prism/node.rb#10611 - def locals; end - - # attr_reader locals_body_index: Integer - # - # source://prism//prism/node.rb#10614 - def locals_body_index; end - - # def opening: () -> String + # attr_reader name: Symbol # - # source://prism//prism/node.rb#10694 - def opening; end + # source://prism//lib/prism/node.rb#9666 + sig { returns(Symbol) } + def name; end - # attr_reader opening_loc: Location + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#10620 - def opening_loc; end + # source://prism//lib/prism/node.rb#9669 + sig { returns(Prism::Location) } + def name_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#10689 + # source://prism//lib/prism/node.rb#9726 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#10617 + # source://prism//lib/prism/node.rb#9675 + sig { returns(Prism::Location) } def operator_loc; end - # attr_reader parameters: Node? - # - # source://prism//prism/node.rb#10626 - def parameters; 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 @@ -14328,9 +16174,15 @@ class Prism::LambdaNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10740 + # source://prism//lib/prism/node.rb#9755 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#9672 + 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. @@ -14339,308 +16191,132 @@ class Prism::LambdaNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10750 + # source://prism//lib/prism/node.rb#9765 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. -class Prism::LexCompat - # @return [LexCompat] a new instance of LexCompat - # - # source://prism//prism/lex_compat.rb#599 - def initialize(source, **options); end +# Flags for integer nodes that correspond to the base of the integer. +# +# source://prism//lib/prism/node.rb#17587 +module Prism::IntegerBaseFlags; end - # Returns the value of attribute options. - # - # source://prism//prism/lex_compat.rb#597 - def options; end +# 0b prefix +# +# source://prism//lib/prism/node.rb#17589 +Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer) - # source://prism//prism/lex_compat.rb#604 - def result; end +# 0d or no prefix +# +# source://prism//lib/prism/node.rb#17592 +Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer) - # Returns the value of attribute source. - # - # source://prism//prism/lex_compat.rb#597 - def source; end -end +# 0x prefix +# +# source://prism//lib/prism/node.rb#17598 +Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer) -# 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. -class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token - # source://prism//prism/lex_compat.rb#211 - def ==(other); end -end +# 0o or 0 prefix +# +# source://prism//lib/prism/node.rb#17595 +Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer) -# 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. -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//prism/lex_compat.rb#583 - def build(opening); end - end -end +# Represents an integer number literal. +# +# 1 +# ^ +# +# source://prism//lib/prism/node.rb#9774 +class Prism::IntegerNode < ::Prism::Node + # def initialize: (Integer flags, Location location) -> void + # + # @return [IntegerNode] a new instance of IntegerNode + # + # source://prism//lib/prism/node.rb#9779 + sig { params(flags: Integer, location: Prism::Location).void } + def initialize(flags, location); 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. -class Prism::LexCompat::Heredoc::DashHeredoc - # @return [DashHeredoc] a new instance of DashHeredoc + # def accept: (Visitor visitor) -> void # - # source://prism//prism/lex_compat.rb#298 - def initialize(split); end + # source://prism//lib/prism/node.rb#9785 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/lex_compat.rb#303 - def <<(token); end + # def binary?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9821 + sig { returns(T::Boolean) } + def binary?; end - # source://prism//prism/lex_compat.rb#296 - def split; end - - # source://prism//prism/lex_compat.rb#307 - def to_a; end - - # source://prism//prism/lex_compat.rb#296 - def tokens; end -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. -class Prism::LexCompat::Heredoc::DedentingHeredoc - # @return [DedentingHeredoc] a new instance of DedentingHeredoc - # - # source://prism//prism/lex_compat.rb#359 - def initialize; end - - # As tokens are coming in, we track the minimum amount of common leading - # whitespace on plain string content tokens. This allows us to later - # remove that amount of whitespace from the beginning of each line. - # - # source://prism//prism/lex_compat.rb#370 - def <<(token); end - - # Returns the value of attribute dedent. - # - # source://prism//prism/lex_compat.rb#357 - def dedent; end - - # Returns the value of attribute dedent_next. - # - # source://prism//prism/lex_compat.rb#357 - def dedent_next; end - - # Returns the value of attribute embexpr_balance. - # - # source://prism//prism/lex_compat.rb#357 - def embexpr_balance; end - - # source://prism//prism/lex_compat.rb#407 - def to_a; end - - # Returns the value of attribute tokens. - # - # source://prism//prism/lex_compat.rb#357 - def tokens; end -end - -# source://prism//prism/lex_compat.rb#355 -Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer) - -# Heredocs that are no dash or tilde heredocs are just a list of tokens. -# 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. -class Prism::LexCompat::Heredoc::PlainHeredoc - # @return [PlainHeredoc] a new instance of PlainHeredoc - # - # source://prism//prism/lex_compat.rb#279 - def initialize; end - - # source://prism//prism/lex_compat.rb#283 - def <<(token); end - - # source://prism//prism/lex_compat.rb#287 - def to_a; end - - # source://prism//prism/lex_compat.rb#277 - 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. -class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token - # source://prism//prism/lex_compat.rb#229 - def ==(other); end -end - -# Tokens where state should be ignored -# used for :on_comment, :on_heredoc_end, :on_embexpr_end -class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token - # source://prism//prism/lex_compat.rb#219 - def ==(other); end -end - -# Ignored newlines can occasionally have a LABEL state attached to them, so -# we compare the state differently here. -class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token - # source://prism//prism/lex_compat.rb#240 - 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. -class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token - # source://prism//prism/lex_compat.rb#260 - 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//prism/lex_compat.rb#15 -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. -class Prism::LexCompat::Token < ::SimpleDelegator - # The type of the token. - # - # source://prism//prism/lex_compat.rb#193 - def event; end - - # The location of the token in the source. - # - # source://prism//prism/lex_compat.rb#188 - def location; end - - # The state of the lexer when this token was produced. - # - # source://prism//prism/lex_compat.rb#203 - def state; end - - # The slice of the source that this token represents. - # - # source://prism//prism/lex_compat.rb#198 - def value; end -end - -# This is a class that wraps the Ripper lexer to produce almost exactly the -# same tokens. -class Prism::LexRipper - # @return [LexRipper] a new instance of LexRipper - # - # source://prism//prism/lex_compat.rb#855 - def initialize(source); end - - # source://prism//prism/lex_compat.rb#859 - def result; end - - # source://prism//prism/lex_compat.rb#853 - def source; end -end - -# Represents the use of the `&&=` operator for assignment to a local variable. -# -# target &&= value -# ^^^^^^^^^^^^^^^^ -class Prism::LocalVariableAndWriteNode < ::Prism::Node - # def initialize: (name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location) -> void - # - # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode - # - # source://prism//prism/node.rb#10776 - def initialize(name_loc, operator_loc, value, name, depth, location); end - - # def accept: (visitor: Visitor) -> void - # - # source://prism//prism/node.rb#10786 - def accept(visitor); end - - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//prism/node.rb#10791 - def child_nodes; end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#9790 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10801 + # source://prism//lib/prism/node.rb#9800 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10796 + # source://prism//lib/prism/node.rb#9795 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableAndWriteNode + # def copy: (**params) -> IntegerNode # - # source://prism//prism/node.rb#10806 + # source://prism//lib/prism/node.rb#9805 + sig { params(params: T.untyped).returns(Prism::IntegerNode) } def copy(**params); end + # def decimal?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9826 + sig { returns(T::Boolean) } + def decimal?; end + # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10791 + # source://prism//lib/prism/node.rb#9790 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, location: Location } # - # source://prism//prism/node.rb#10821 + # source://prism//lib/prism/node.rb#9816 + 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 - # attr_reader depth: Integer - # - # source://prism//prism/node.rb#10773 - def depth; end - - # def inspect(inspector: NodeInspector) -> String + # def hexadecimal?: () -> bool # - # source://prism//prism/node.rb#10831 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader name: Symbol + # @return [Boolean] # - # source://prism//prism/node.rb#10770 - def name; end + # source://prism//lib/prism/node.rb#9836 + sig { returns(T::Boolean) } + def hexadecimal?; end - # attr_reader name_loc: Location + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#10761 - def name_loc; end + # source://prism//lib/prism/node.rb#9841 + def inspect(inspector = T.unsafe(nil)); end - # def operator: () -> String + # def octal?: () -> bool # - # source://prism//prism/node.rb#10826 - def operator; end - - # attr_reader operator_loc: Location + # @return [Boolean] # - # source://prism//prism/node.rb#10764 - def operator_loc; end + # source://prism//lib/prism/node.rb#9831 + sig { returns(T::Boolean) } + 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 @@ -14657,14 +16333,22 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10856 + # source://prism//lib/prism/node.rb#9862 def type; end - # attr_reader value: Node + # Returns the value of the node as a Ruby Integer. # - # source://prism//prism/node.rb#10767 + # source://prism//lib/prism/node_ext.rb#76 def value; end + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#9776 + 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. @@ -14673,88 +16357,190 @@ class Prism::LocalVariableAndWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10866 + # source://prism//lib/prism/node.rb#9872 def type; end end end -# Represents assigning to a local variable using an operator that isn't `=`. +# 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. # -# target += value -# ^^^^^^^^^^^^^^^ -class Prism::LocalVariableOperatorWriteNode < ::Prism::Node - # def initialize: (name_loc: Location, operator_loc: Location, value: Node, name: Symbol, operator: Symbol, depth: Integer, location: Location) -> void +# if /foo #{bar} baz/ then end +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#9881 +class Prism::InterpolatedMatchLastLineNode < ::Prism::Node + include ::Prism::RegularExpressionOptions + + # def initialize: (Integer flags, Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void # - # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode + # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode # - # source://prism//prism/node.rb#10895 - def initialize(name_loc, operator_loc, value, name, operator, depth, location); end + # source://prism//lib/prism/node.rb#9895 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[Prism::Node], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, opening_loc, parts, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#10906 + # source://prism//lib/prism/node.rb#9904 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # def ascii_8bit?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9973 + sig { returns(T::Boolean) } + def ascii_8bit?; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10911 + # source://prism//lib/prism/node.rb#9914 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#10008 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#9892 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#10921 + # source://prism//lib/prism/node.rb#9924 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#10916 + # source://prism//lib/prism/node.rb#9919 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableOperatorWriteNode + # def copy: (**params) -> InterpolatedMatchLastLineNode # - # source://prism//prism/node.rb#10926 + # source://prism//lib/prism/node.rb#9929 + sig { params(params: T.untyped).returns(Prism::InterpolatedMatchLastLineNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#10911 + # source://prism//lib/prism/node.rb#9914 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#10942 + # source://prism//lib/prism/node.rb#9943 + 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 - # attr_reader depth: Integer + # def euc_jp?: () -> bool # - # source://prism//prism/node.rb#10892 - def depth; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9968 + sig { returns(T::Boolean) } + def euc_jp?; end - # def inspect(inspector: NodeInspector) -> String + # def extended?: () -> bool # - # source://prism//prism/node.rb#10947 - def inspect(inspector = T.unsafe(nil)); end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9953 + sig { returns(T::Boolean) } + def extended?; end - # attr_reader name: Symbol + # def forced_binary_encoding?: () -> bool # - # source://prism//prism/node.rb#10886 - def name; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9993 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # attr_reader name_loc: Location + # def forced_us_ascii_encoding?: () -> bool # - # source://prism//prism/node.rb#10877 - def name_loc; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9998 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # attr_reader operator: Symbol + # def forced_utf8_encoding?: () -> bool # - # source://prism//prism/node.rb#10889 - def operator; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9988 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # attr_reader operator_loc: Location + # def ignore_case?: () -> bool # - # source://prism//prism/node.rb#10880 - def operator_loc; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9948 + sig { returns(T::Boolean) } + def ignore_case?; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#10013 + def inspect(inspector = T.unsafe(nil)); end + + # def multi_line?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9958 + sig { returns(T::Boolean) } + def multi_line?; end + + # def once?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9963 + sig { returns(T::Boolean) } + def once?; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#10003 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#9886 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader parts: Array[Node] + # + # source://prism//lib/prism/node.rb#9889 + sig { returns(T::Array[Prism::Node]) } + def parts; end + + # source://prism//lib/prism/node.rb#9908 + 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 @@ -14771,13 +16557,32 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#10973 + # source://prism//lib/prism/node.rb#10037 def type; end - # attr_reader value: Node + # def utf_8?: () -> bool # - # source://prism//prism/node.rb#10883 - def value; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9983 + sig { returns(T::Boolean) } + def utf_8?; end + + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#9978 + sig { returns(T::Boolean) } + def windows_31j?; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#9883 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -14787,88 +16592,190 @@ class Prism::LocalVariableOperatorWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#10983 + # source://prism//lib/prism/node.rb#10047 def type; end end end -# Represents the use of the `||=` operator for assignment to a local variable. +# Represents a regular expression literal that contains interpolation. # -# target ||= value +# /foo #{bar} baz/ # ^^^^^^^^^^^^^^^^ -class Prism::LocalVariableOrWriteNode < ::Prism::Node - # def initialize: (name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location) -> void +# +# source://prism//lib/prism/node.rb#10056 +class Prism::InterpolatedRegularExpressionNode < ::Prism::Node + include ::Prism::RegularExpressionOptions + + # def initialize: (Integer flags, Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void # - # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode + # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode # - # source://prism//prism/node.rb#11009 - def initialize(name_loc, operator_loc, value, name, depth, location); end + # source://prism//lib/prism/node.rb#10070 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + parts: T::Array[Prism::Node], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, opening_loc, parts, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11019 + # source://prism//lib/prism/node.rb#10079 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # def ascii_8bit?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10148 + sig { returns(T::Boolean) } + def ascii_8bit?; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11024 + # source://prism//lib/prism/node.rb#10089 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#10183 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#10067 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11034 + # source://prism//lib/prism/node.rb#10099 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11029 + # source://prism//lib/prism/node.rb#10094 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableOrWriteNode + # def copy: (**params) -> InterpolatedRegularExpressionNode # - # source://prism//prism/node.rb#11039 + # source://prism//lib/prism/node.rb#10104 + sig { params(params: T.untyped).returns(Prism::InterpolatedRegularExpressionNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11024 + # source://prism//lib/prism/node.rb#10089 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#11054 + # source://prism//lib/prism/node.rb#10118 + 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 - # attr_reader depth: Integer + # def euc_jp?: () -> bool # - # source://prism//prism/node.rb#11006 - def depth; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10143 + sig { returns(T::Boolean) } + def euc_jp?; end + + # def extended?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10128 + sig { returns(T::Boolean) } + def extended?; end + + # def forced_binary_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10168 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # def inspect(inspector: NodeInspector) -> String + # def forced_us_ascii_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10173 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end + + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10163 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end + + # def ignore_case?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10123 + sig { returns(T::Boolean) } + def ignore_case?; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11064 + # source://prism//lib/prism/node.rb#10188 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # def multi_line?: () -> bool # - # source://prism//prism/node.rb#11003 - def name; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10133 + sig { returns(T::Boolean) } + def multi_line?; end - # attr_reader name_loc: Location + # def once?: () -> bool # - # source://prism//prism/node.rb#10994 - def name_loc; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10138 + sig { returns(T::Boolean) } + def once?; end - # def operator: () -> String + # def opening: () -> String # - # source://prism//prism/node.rb#11059 - def operator; end + # source://prism//lib/prism/node.rb#10178 + sig { returns(String) } + def opening; end - # attr_reader operator_loc: Location + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#10997 - def operator_loc; end + # source://prism//lib/prism/node.rb#10061 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader parts: Array[Node] + # + # source://prism//lib/prism/node.rb#10064 + sig { returns(T::Array[Prism::Node]) } + def parts; end + + # source://prism//lib/prism/node.rb#10083 + 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 @@ -14885,13 +16792,32 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11089 + # source://prism//lib/prism/node.rb#10212 def type; end - # attr_reader value: Node + # def utf_8?: () -> bool # - # source://prism//prism/node.rb#11000 - def value; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10158 + sig { returns(T::Boolean) } + def utf_8?; end + + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#10153 + sig { returns(T::Boolean) } + def windows_31j?; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#10058 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -14901,75 +16827,117 @@ class Prism::LocalVariableOrWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11099 + # source://prism//lib/prism/node.rb#10222 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 a string literal that contains interpolation. # -# foo -# ^^^ -class Prism::LocalVariableReadNode < ::Prism::Node - # def initialize: (name: Symbol, depth: Integer, location: Location) -> void +# "foo #{bar} baz" +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10231 +class Prism::InterpolatedStringNode < ::Prism::Node + include ::Prism::HeredocQuery + + # def initialize: (Location? opening_loc, Array[Node] parts, Location? closing_loc, Location location) -> void # - # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode + # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode # - # source://prism//prism/node.rb#11118 - def initialize(name, depth, location); end + # source://prism//lib/prism/node.rb#10242 + sig do + params( + opening_loc: T.nilable(Prism::Location), + parts: T::Array[Prism::Node], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(opening_loc, parts, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11125 + # source://prism//lib/prism/node.rb#10250 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11130 + # source://prism//lib/prism/node.rb#10260 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#10298 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#10239 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11140 + # source://prism//lib/prism/node.rb#10270 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11135 + # source://prism//lib/prism/node.rb#10265 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableReadNode + # def copy: (**params) -> InterpolatedStringNode # - # source://prism//prism/node.rb#11145 + # source://prism//lib/prism/node.rb#10275 + sig { params(params: T.untyped).returns(Prism::InterpolatedStringNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11130 + # source://prism//lib/prism/node.rb#10260 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#11157 + # source://prism//lib/prism/node.rb#10288 + 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 - # attr_reader depth: Integer + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11115 - def depth; end + # source://prism//lib/prism/node.rb#10303 + def inspect(inspector = T.unsafe(nil)); end - # def inspect(inspector: NodeInspector) -> String + # def opening: () -> String? # - # source://prism//prism/node.rb#11162 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10293 + sig { returns(T.nilable(String)) } + def opening; end - # attr_reader name: Symbol + # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#11112 - def name; end + # source://prism//lib/prism/node.rb#10233 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end + + # attr_reader parts: Array[Node] + # + # source://prism//lib/prism/node.rb#10236 + sig { returns(T::Array[Prism::Node]) } + def parts; end + + # source://prism//lib/prism/node.rb#10254 + 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 @@ -14986,7 +16954,7 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11183 + # source://prism//lib/prism/node.rb#10325 def type; end class << self @@ -14997,73 +16965,115 @@ class Prism::LocalVariableReadNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11193 + # source://prism//lib/prism/node.rb#10335 def type; end end end -# Represents writing to a local variable in a context that doesn't have an explicit value. +# Represents a symbol literal that contains interpolation. # -# foo, bar = baz -# ^^^ ^^^ -class Prism::LocalVariableTargetNode < ::Prism::Node - # def initialize: (name: Symbol, depth: Integer, location: Location) -> void +# :"foo #{bar} baz" +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10344 +class Prism::InterpolatedSymbolNode < ::Prism::Node + # def initialize: (Location? opening_loc, Array[Node] parts, Location? closing_loc, Location location) -> void # - # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode + # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode # - # source://prism//prism/node.rb#11210 - def initialize(name, depth, location); end + # source://prism//lib/prism/node.rb#10355 + sig do + params( + opening_loc: T.nilable(Prism::Location), + parts: T::Array[Prism::Node], + closing_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(opening_loc, parts, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11217 + # source://prism//lib/prism/node.rb#10363 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11222 + # source://prism//lib/prism/node.rb#10373 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#10411 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#10352 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11232 + # source://prism//lib/prism/node.rb#10383 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11227 + # source://prism//lib/prism/node.rb#10378 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableTargetNode + # def copy: (**params) -> InterpolatedSymbolNode # - # source://prism//prism/node.rb#11237 + # source://prism//lib/prism/node.rb#10388 + sig { params(params: T.untyped).returns(Prism::InterpolatedSymbolNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11222 + # source://prism//lib/prism/node.rb#10373 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location } # - # source://prism//prism/node.rb#11249 + # source://prism//lib/prism/node.rb#10401 + 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 - # attr_reader depth: Integer + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11207 - def depth; end + # source://prism//lib/prism/node.rb#10416 + def inspect(inspector = T.unsafe(nil)); end - # def inspect(inspector: NodeInspector) -> String + # def opening: () -> String? # - # source://prism//prism/node.rb#11254 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10406 + sig { returns(T.nilable(String)) } + def opening; end - # attr_reader name: Symbol + # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#11204 - def name; end + # source://prism//lib/prism/node.rb#10346 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end + + # attr_reader parts: Array[Node] + # + # source://prism//lib/prism/node.rb#10349 + sig { returns(T::Array[Prism::Node]) } + def parts; end + + # source://prism//lib/prism/node.rb#10367 + 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 @@ -15080,7 +17090,7 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11275 + # source://prism//lib/prism/node.rb#10438 def type; end class << self @@ -15091,88 +17101,117 @@ class Prism::LocalVariableTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11285 + # source://prism//lib/prism/node.rb#10448 def type; end end end -# Represents writing to a local variable. +# Represents an xstring literal that contains interpolation. # -# foo = 1 -# ^^^^^^^ -class Prism::LocalVariableWriteNode < ::Prism::Node - # def initialize: (name: Symbol, depth: Integer, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void - # - # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode - # - # source://prism//prism/node.rb#11311 - def initialize(name, depth, name_loc, value, operator_loc, location); end +# `foo #{bar} baz` +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10457 +class Prism::InterpolatedXStringNode < ::Prism::Node + include ::Prism::HeredocQuery - # def accept: (visitor: Visitor) -> void + # def initialize: (Location opening_loc, Array[Node] parts, Location closing_loc, Location location) -> void # - # source://prism//prism/node.rb#11321 - def accept(visitor); end + # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode + # + # source://prism//lib/prism/node.rb#10468 + sig do + params( + opening_loc: Prism::Location, + parts: T::Array[Prism::Node], + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(opening_loc, parts, closing_loc, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#10476 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11326 + # source://prism//lib/prism/node.rb#10486 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#10524 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#10465 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11336 + # source://prism//lib/prism/node.rb#10496 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11331 + # source://prism//lib/prism/node.rb#10491 def compact_child_nodes; end - # def copy: (**params) -> LocalVariableWriteNode + # def copy: (**params) -> InterpolatedXStringNode # - # source://prism//prism/node.rb#11341 + # source://prism//lib/prism/node.rb#10501 + sig { params(params: T.untyped).returns(Prism::InterpolatedXStringNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11326 + # source://prism//lib/prism/node.rb#10486 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { opening_loc: Location, parts: Array[Node], closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#11356 + # source://prism//lib/prism/node.rb#10514 + 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 - # attr_reader depth: Integer - # - # source://prism//prism/node.rb#11299 - def depth; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11366 + # source://prism//lib/prism/node.rb#10529 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # def opening: () -> String # - # source://prism//prism/node.rb#11296 - def name; end + # source://prism//lib/prism/node.rb#10519 + sig { returns(String) } + def opening; end - # attr_reader name_loc: Location + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#11302 - def name_loc; end + # source://prism//lib/prism/node.rb#10459 + sig { returns(Prism::Location) } + def opening_loc; end - # def operator: () -> String + # attr_reader parts: Array[Node] # - # source://prism//prism/node.rb#11361 - def operator; end + # source://prism//lib/prism/node.rb#10462 + sig { returns(T::Array[Prism::Node]) } + def parts; end - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#11308 - def operator_loc; end + # source://prism//lib/prism/node.rb#10480 + 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 @@ -15189,14 +17228,9 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11391 + # source://prism//lib/prism/node.rb#10551 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#11305 - 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. @@ -15205,344 +17239,244 @@ class Prism::LocalVariableWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11401 + # source://prism//lib/prism/node.rb#10561 def type; end end end -# This represents a location in the source. -class Prism::Location - # Create a new location object with the given source, start byte offset, and - # byte length. - # - # @return [Location] a new instance of Location - # - # source://prism//prism/parse_result.rb#108 - def initialize(source, start_offset, length); end - - # Returns true if the given other location is equal to this location. - # - # source://prism//prism/parse_result.rb#202 - def ==(other); end - - # The list of comments attached to this location - # - # source://prism//prism/parse_result.rb#104 - def comments; end - - # Create a new location object with the given options. - # - # source://prism//prism/parse_result.rb#116 - def copy(**options); end - - # Implement the hash pattern matching interface for Location. - # - # source://prism//prism/parse_result.rb#192 - def deconstruct_keys(keys); end - - # The column number in characters where this location ends from the start of - # the line. +# Represents a hash literal without opening and closing braces. +# +# foo(a: b) +# ^^^^ +# +# source://prism//lib/prism/node.rb#10570 +class Prism::KeywordHashNode < ::Prism::Node + # def initialize: (Integer flags, Array[Node] elements, Location location) -> void # - # source://prism//prism/parse_result.rb#187 - def end_character_column; end - - # The character offset from the beginning of the source where this location - # ends. + # @return [KeywordHashNode] a new instance of KeywordHashNode # - # source://prism//prism/parse_result.rb#147 - def end_character_offset; end + # source://prism//lib/prism/node.rb#10578 + sig { params(flags: Integer, elements: T::Array[Prism::Node], location: Prism::Location).void } + def initialize(flags, elements, location); end - # The column number in bytes where this location ends from the start of the - # line. + # def accept: (Visitor visitor) -> void # - # source://prism//prism/parse_result.rb#181 - def end_column; end + # source://prism//lib/prism/node.rb#10585 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # The line number where this location ends. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/parse_result.rb#163 - def end_line; end + # source://prism//lib/prism/node.rb#10590 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # The byte offset from the beginning of the source where this location ends. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/parse_result.rb#141 - def end_offset; end + # source://prism//lib/prism/node.rb#10600 + def comment_targets; end - # Returns a string representation of this location. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/parse_result.rb#125 - def inspect; end + # source://prism//lib/prism/node.rb#10595 + def compact_child_nodes; 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. + # def copy: (**params) -> KeywordHashNode # - # source://prism//prism/parse_result.rb#211 - def join(other); end + # source://prism//lib/prism/node.rb#10605 + sig { params(params: T.untyped).returns(Prism::KeywordHashNode) } + def copy(**params); end - # The length of this location in bytes. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/parse_result.rb#101 - def length; end + # source://prism//lib/prism/node.rb#10590 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Implement the pretty print interface for Location. + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, elements: Array[Node], location: Location } # - # source://prism//prism/parse_result.rb#197 - def pretty_print(q); end + # source://prism//lib/prism/node.rb#10617 + 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 - # The source code that this location represents. + # attr_reader elements: Array[Node] # - # source://prism//prism/parse_result.rb#130 - def slice; end + # source://prism//lib/prism/node.rb#10575 + sig { returns(T::Array[Prism::Node]) } + def elements; end - # The column number in characters where this location ends from the start of - # the line. + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/parse_result.rb#175 - def start_character_column; end + # source://prism//lib/prism/node.rb#10627 + def inspect(inspector = T.unsafe(nil)); end - # The character offset from the beginning of the source where this location - # starts. + # def symbol_keys?: () -> bool # - # source://prism//prism/parse_result.rb#136 - def start_character_offset; end - - # The column number in bytes where this location starts from the start of - # the line. + # @return [Boolean] # - # source://prism//prism/parse_result.rb#169 - def start_column; end + # source://prism//lib/prism/node.rb#10622 + sig { returns(T::Boolean) } + def symbol_keys?; end - # The line number where this location starts. + # 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//prism/parse_result.rb#152 - def start_line; end - - # The content of the line where this location starts before this location. + # 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//prism/parse_result.rb#157 - def start_line_slice; end - - # The byte offset from the beginning of the source where this location - # starts. + # def type: () -> Symbol # - # source://prism//prism/parse_result.rb#98 - def start_offset; end + # source://prism//lib/prism/node.rb#10649 + def type; end - protected + private - # Returns the value of attribute source. + # Returns the value of attribute flags. # - # source://prism//prism/parse_result.rb#94 - def source; end + # source://prism//lib/prism/node.rb#10572 + sig { returns(Integer) } + def flags; 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. + # 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. # - # source://prism//prism/parse_result.rb#221 - def null; end + # def self.type: () -> Symbol + # + # source://prism//lib/prism/node.rb#10659 + def type; end end end -# Flags for while and until loop nodes. -module Prism::LoopFlags; end - -# a loop after a begin statement, so the body is executed first before the condition +# Flags for keyword hash nodes. # -# source://prism//prism/node.rb#17333 -Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) - -# This represents a magic comment that was encountered during parsing. -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//prism/parse_result.rb#281 - def initialize(key_loc, value_loc); end - - # Implement the hash pattern matching interface for MagicComment. - # - # source://prism//prism/parse_result.rb#297 - def deconstruct_keys(keys); end - - # Returns a string representation of this magic comment. - # - # source://prism//prism/parse_result.rb#302 - def inspect; end - - # Returns the key of the magic comment by slicing it from the source code. - # - # source://prism//prism/parse_result.rb#287 - def key; end - - # A Location object representing the location of the key in the source. - # - # source://prism//prism/parse_result.rb#275 - def key_loc; end - - # Returns the value of the magic comment by slicing it from the source code. - # - # source://prism//prism/parse_result.rb#292 - def value; end - - # A Location object representing the location of the value in the source. - # - # source://prism//prism/parse_result.rb#278 - def value_loc; end -end +# source://prism//lib/prism/node.rb#17602 +module Prism::KeywordHashNodeFlags; 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. +# a keyword hash which only has `AssocNode` elements all with symbol keys, which means the elements can be treated as keyword arguments # -# if /foo/i then end -# ^^^^^^ -class Prism::MatchLastLineNode < ::Prism::Node - include ::Prism::RegularExpressionOptions +# source://prism//lib/prism/node.rb#17604 +Prism::KeywordHashNodeFlags::SYMBOL_KEYS = T.let(T.unsafe(nil), Integer) - # def initialize: (flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location) -> void +# Represents a keyword rest parameter to a method, block, or lambda definition. +# +# def a(**b) +# ^^^ +# end +# +# source://prism//lib/prism/node.rb#10669 +class Prism::KeywordRestParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol? name, Location? name_loc, Location operator_loc, Location location) -> void # - # @return [MatchLastLineNode] a new instance of MatchLastLineNode + # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode # - # source://prism//prism/node.rb#11429 - def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end + # source://prism//lib/prism/node.rb#10683 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, name, name_loc, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11439 + # source://prism//lib/prism/node.rb#10692 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # def ascii_8bit?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11504 - def ascii_8bit?; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11444 + # source://prism//lib/prism/node.rb#10697 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#11544 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#11423 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11454 + # source://prism//lib/prism/node.rb#10707 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11449 + # source://prism//lib/prism/node.rb#10702 def compact_child_nodes; end - # def content: () -> String - # - # source://prism//prism/node.rb#11539 - def content; end - - # attr_reader content_loc: Location - # - # source://prism//prism/node.rb#11420 - def content_loc; end - - # def copy: (**params) -> MatchLastLineNode + # def copy: (**params) -> KeywordRestParameterNode # - # source://prism//prism/node.rb#11459 + # source://prism//lib/prism/node.rb#10712 + sig { params(params: T.untyped).returns(Prism::KeywordRestParameterNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11444 + # source://prism//lib/prism/node.rb#10697 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#11474 + # source://prism//lib/prism/node.rb#10726 + 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 euc_jp?: () -> bool - # - # @return [Boolean] + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11499 - def euc_jp?; end + # source://prism//lib/prism/node.rb#10741 + def inspect(inspector = T.unsafe(nil)); end - # def extended?: () -> bool + # attr_reader name: Symbol? # - # @return [Boolean] - # - # source://prism//prism/node.rb#11484 - def extended?; end - - # def forced_binary_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11524 - def forced_binary_encoding?; end - - # def forced_us_ascii_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11529 - def forced_us_ascii_encoding?; end - - # def forced_utf8_encoding?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11519 - def forced_utf8_encoding?; end + # source://prism//lib/prism/node.rb#10674 + sig { returns(T.nilable(Symbol)) } + def name; end - # def ignore_case?: () -> bool - # - # @return [Boolean] + # attr_reader name_loc: Location? # - # source://prism//prism/node.rb#11479 - def ignore_case?; end + # source://prism//lib/prism/node.rb#10677 + sig { returns(T.nilable(Prism::Location)) } + def name_loc; end - # def inspect(inspector: NodeInspector) -> String + # def operator: () -> String # - # source://prism//prism/node.rb#11549 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#10736 + sig { returns(String) } + def operator; end - # def multi_line?: () -> bool - # - # @return [Boolean] + # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#11489 - def multi_line?; end + # source://prism//lib/prism/node.rb#10680 + sig { returns(Prism::Location) } + def operator_loc; end - # def once?: () -> bool + # def repeated_parameter?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#11494 - def once?; end - - # def opening: () -> String - # - # source://prism//prism/node.rb#11534 - def opening; end - - # attr_reader opening_loc: Location - # - # source://prism//prism/node.rb#11417 - def opening_loc; end + # source://prism//lib/prism/node.rb#10731 + 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 @@ -15559,33 +17493,15 @@ class Prism::MatchLastLineNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11574 + # source://prism//lib/prism/node.rb#10769 def type; end - # attr_reader unescaped: String - # - # source://prism//prism/node.rb#11426 - def unescaped; end - - # def utf_8?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11514 - def utf_8?; end - - # def windows_31j?: () -> bool - # - # @return [Boolean] - # - # source://prism//prism/node.rb#11509 - def windows_31j?; end - private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#11414 + # source://prism//lib/prism/node.rb#10671 + sig { returns(Integer) } def flags; end class << self @@ -15596,78 +17512,139 @@ class Prism::MatchLastLineNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11584 + # source://prism//lib/prism/node.rb#10779 def type; end end end -# Represents the use of the modifier `in` operator. +# Represents using a lambda literal (not the lambda method call). # -# foo in bar -# ^^^^^^^^^^ -class Prism::MatchPredicateNode < ::Prism::Node - # def initialize: (value: Node, pattern: Node, operator_loc: Location, location: Location) -> void +# ->(value) { value * 2 } +# ^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10788 +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 # - # @return [MatchPredicateNode] a new instance of MatchPredicateNode + # @return [LambdaNode] a new instance of LambdaNode # - # source://prism//prism/node.rb#11604 - def initialize(value, pattern, operator_loc, location); end + # source://prism//lib/prism/node.rb#10808 + 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 + ).void + end + def initialize(locals, operator_loc, opening_loc, closing_loc, parameters, body, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11612 + # source://prism//lib/prism/node.rb#10819 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # attr_reader body: Node? + # + # source://prism//lib/prism/node.rb#10805 + sig { returns(T.nilable(Prism::Node)) } + def body; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11617 + # source://prism//lib/prism/node.rb#10824 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#10873 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#10799 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11627 + # source://prism//lib/prism/node.rb#10837 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11622 + # source://prism//lib/prism/node.rb#10829 def compact_child_nodes; end - # def copy: (**params) -> MatchPredicateNode + # def copy: (**params) -> LambdaNode # - # source://prism//prism/node.rb#11632 + # source://prism//lib/prism/node.rb#10842 + sig { params(params: T.untyped).returns(Prism::LambdaNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11617 + # source://prism//lib/prism/node.rb#10824 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], operator_loc: Location, opening_loc: Location, closing_loc: Location, parameters: Node?, body: Node?, location: Location } # - # source://prism//prism/node.rb#11645 + # source://prism//lib/prism/node.rb#10858 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11655 + # source://prism//lib/prism/node.rb#10878 def inspect(inspector = T.unsafe(nil)); end + # attr_reader locals: Array[Symbol] + # + # source://prism//lib/prism/node.rb#10790 + sig { returns(T::Array[Symbol]) } + def locals; end + + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#10868 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#10796 + sig { returns(Prism::Location) } + def opening_loc; end + # def operator: () -> String # - # source://prism//prism/node.rb#11650 + # source://prism//lib/prism/node.rb#10863 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#11601 + # source://prism//lib/prism/node.rb#10793 + sig { returns(Prism::Location) } def operator_loc; end - # attr_reader pattern: Node + # attr_reader parameters: Node? # - # source://prism//prism/node.rb#11598 - def pattern; end + # source://prism//lib/prism/node.rb#10802 + sig { returns(T.nilable(Prism::Node)) } + def parameters; 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 @@ -15684,14 +17661,9 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11679 + # source://prism//lib/prism/node.rb#10913 def type; end - # attr_reader value: Node - # - # source://prism//prism/node.rb#11595 - 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. @@ -15700,178 +17672,358 @@ class Prism::MatchPredicateNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11689 + # source://prism//lib/prism/node.rb#10923 def type; end end end -# Represents the use of the `=>` operator. +# 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. # -# foo => bar -# ^^^^^^^^^^ -class Prism::MatchRequiredNode < ::Prism::Node - # def initialize: (value: Node, pattern: Node, operator_loc: Location, location: Location) -> void - # - # @return [MatchRequiredNode] a new instance of MatchRequiredNode +# source://prism//lib/prism/lex_compat.rb#11 +class Prism::LexCompat + # @return [LexCompat] a new instance of LexCompat # - # source://prism//prism/node.rb#11709 - def initialize(value, pattern, operator_loc, location); end + # source://prism//lib/prism/lex_compat.rb#599 + def initialize(source, **options); end - # def accept: (visitor: Visitor) -> void + # Returns the value of attribute options. # - # source://prism//prism/node.rb#11717 - def accept(visitor); end + # source://prism//lib/prism/lex_compat.rb#597 + def options; end - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//prism/node.rb#11722 - def child_nodes; end + # source://prism//lib/prism/lex_compat.rb#604 + def result; end - # def comment_targets: () -> Array[Node | Location] + # Returns the value of attribute source. # - # source://prism//prism/node.rb#11732 - def comment_targets; end + # source://prism//lib/prism/lex_compat.rb#597 + def source; end +end - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//prism/node.rb#11727 - def compact_child_nodes; 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#210 +class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#211 + def ==(other); end +end - # def copy: (**params) -> MatchRequiredNode - # - # source://prism//prism/node.rb#11737 - def copy(**params); 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#271 +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#583 + def build(opening); end + end +end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] +# 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#295 +class Prism::LexCompat::Heredoc::DashHeredoc + # @return [DashHeredoc] a new instance of DashHeredoc # - # source://prism//prism/node.rb#11722 - def deconstruct; end + # source://prism//lib/prism/lex_compat.rb#298 + def initialize(split); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] - # - # source://prism//prism/node.rb#11750 - def deconstruct_keys(keys); end + # source://prism//lib/prism/lex_compat.rb#303 + def <<(token); end - # def inspect(inspector: NodeInspector) -> String - # - # source://prism//prism/node.rb#11760 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/lex_compat.rb#296 + def split; end - # def operator: () -> String - # - # source://prism//prism/node.rb#11755 - def operator; end + # source://prism//lib/prism/lex_compat.rb#307 + def to_a; end - # attr_reader operator_loc: Location - # - # source://prism//prism/node.rb#11706 - def operator_loc; end + # source://prism//lib/prism/lex_compat.rb#296 + def tokens; end +end - # attr_reader pattern: Node +# 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#354 +class Prism::LexCompat::Heredoc::DedentingHeredoc + # @return [DedentingHeredoc] a new instance of DedentingHeredoc # - # source://prism//prism/node.rb#11703 - def pattern; end + # source://prism//lib/prism/lex_compat.rb#359 + def initialize; 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 + # 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//prism/node.rb#11784 - def type; end + # source://prism//lib/prism/lex_compat.rb#370 + def <<(token); end - # attr_reader value: Node + # Returns the value of attribute dedent. # - # source://prism//prism/node.rb#11700 - 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//prism/node.rb#11794 - def type; end - end -end + # source://prism//lib/prism/lex_compat.rb#357 + def dedent; end -# Represents writing local variables using a regular expression match with -# named capture groups. -# -# /(?bar)/ =~ baz -# ^^^^^^^^^^^^^^^^^^^^ -class Prism::MatchWriteNode < ::Prism::Node - # def initialize: (call: CallNode, targets: Array[Node], location: Location) -> void - # - # @return [MatchWriteNode] a new instance of MatchWriteNode + # Returns the value of attribute dedent_next. # - # source://prism//prism/node.rb#11812 - def initialize(call, targets, location); end + # source://prism//lib/prism/lex_compat.rb#357 + def dedent_next; end - # def accept: (visitor: Visitor) -> void + # Returns the value of attribute embexpr_balance. # - # source://prism//prism/node.rb#11819 - def accept(visitor); end + # source://prism//lib/prism/lex_compat.rb#357 + def embexpr_balance; end - # attr_reader call: CallNode - # - # source://prism//prism/node.rb#11806 - def call; end + # source://prism//lib/prism/lex_compat.rb#407 + def to_a; end - # def child_nodes: () -> Array[nil | Node] + # Returns the value of attribute tokens. # - # source://prism//prism/node.rb#11824 - def child_nodes; end + # source://prism//lib/prism/lex_compat.rb#357 + def tokens; end +end + +# source://prism//lib/prism/lex_compat.rb#355 +Prism::LexCompat::Heredoc::DedentingHeredoc::TAB_WIDTH = T.let(T.unsafe(nil), Integer) + +# Heredocs that are no dash or tilde heredocs are just a list of tokens. +# 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#276 +class Prism::LexCompat::Heredoc::PlainHeredoc + # @return [PlainHeredoc] a new instance of PlainHeredoc + # + # source://prism//lib/prism/lex_compat.rb#279 + def initialize; end + + # source://prism//lib/prism/lex_compat.rb#283 + def <<(token); end + + # source://prism//lib/prism/lex_compat.rb#287 + def to_a; end + + # source://prism//lib/prism/lex_compat.rb#277 + 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#228 +class Prism::LexCompat::IdentToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#229 + 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#218 +class Prism::LexCompat::IgnoreStateToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#219 + 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#239 +class Prism::LexCompat::IgnoredNewlineToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#240 + 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#259 +class Prism::LexCompat::ParamToken < ::Prism::LexCompat::Token + # source://prism//lib/prism/lex_compat.rb#260 + 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#15 +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#186 +class Prism::LexCompat::Token < ::SimpleDelegator + # The type of the token. + # + # source://prism//lib/prism/lex_compat.rb#193 + def event; end + + # The location of the token in the source. + # + # source://prism//lib/prism/lex_compat.rb#188 + def location; end + + # The state of the lexer when this token was produced. + # + # source://prism//lib/prism/lex_compat.rb#203 + def state; end + + # The slice of the source that this token represents. + # + # source://prism//lib/prism/lex_compat.rb#198 + def value; end +end + +# This is a class that wraps the Ripper lexer to produce almost exactly the +# same tokens. +# +# source://prism//lib/prism/lex_compat.rb#852 +class Prism::LexRipper + # @return [LexRipper] a new instance of LexRipper + # + # source://prism//lib/prism/lex_compat.rb#855 + def initialize(source); end + + # source://prism//lib/prism/lex_compat.rb#859 + def result; end + + # source://prism//lib/prism/lex_compat.rb#853 + def source; end +end + +# Represents the use of the `&&=` operator for assignment to a local variable. +# +# target &&= value +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#10932 +class Prism::LocalVariableAndWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Integer depth, Location location) -> void + # + # @return [LocalVariableAndWriteNode] a new instance of LocalVariableAndWriteNode + # + # source://prism//lib/prism/node.rb#10949 + sig do + params( + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(name_loc, operator_loc, value, name, depth, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#10959 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#10964 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11834 + # source://prism//lib/prism/node.rb#10974 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11829 + # source://prism//lib/prism/node.rb#10969 def compact_child_nodes; end - # def copy: (**params) -> MatchWriteNode + # def copy: (**params) -> LocalVariableAndWriteNode # - # source://prism//prism/node.rb#11839 + # source://prism//lib/prism/node.rb#10979 + sig { params(params: T.untyped).returns(Prism::LocalVariableAndWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11824 + # source://prism//lib/prism/node.rb#10964 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location } # - # source://prism//prism/node.rb#11851 + # source://prism//lib/prism/node.rb#10994 + 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(inspector: NodeInspector) -> String + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#10946 + sig { returns(Integer) } + def depth; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11856 + # source://prism//lib/prism/node.rb#11004 def inspect(inspector = T.unsafe(nil)); end - # attr_reader targets: Array[Node] + # attr_reader name: Symbol # - # source://prism//prism/node.rb#11809 - def targets; end + # source://prism//lib/prism/node.rb#10943 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#10934 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#10999 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#10937 + 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 @@ -15888,9 +18040,15 @@ class Prism::MatchWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11878 + # source://prism//lib/prism/node.rb#11029 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#10940 + 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. @@ -15899,62 +18057,116 @@ class Prism::MatchWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11888 + # source://prism//lib/prism/node.rb#11039 def type; end end end -# Represents a node that is missing from the source and results in a syntax -# error. -class Prism::MissingNode < ::Prism::Node - # def initialize: (location: Location) -> void +# Represents assigning to a local variable using an operator that isn't `=`. +# +# target += value +# ^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11048 +class Prism::LocalVariableOperatorWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Symbol operator, Integer depth, Location location) -> void # - # @return [MissingNode] a new instance of MissingNode + # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode # - # source://prism//prism/node.rb#11897 - def initialize(location); end + # source://prism//lib/prism/node.rb#11068 + sig do + params( + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + operator: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(name_loc, operator_loc, value, name, operator, depth, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#11902 + # source://prism//lib/prism/node.rb#11079 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11907 + # source://prism//lib/prism/node.rb#11084 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#11917 + # source://prism//lib/prism/node.rb#11094 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#11912 + # source://prism//lib/prism/node.rb#11089 def compact_child_nodes; end - # def copy: (**params) -> MissingNode + # def copy: (**params) -> LocalVariableOperatorWriteNode # - # source://prism//prism/node.rb#11922 + # source://prism//lib/prism/node.rb#11099 + sig { params(params: T.untyped).returns(Prism::LocalVariableOperatorWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#11907 + # source://prism//lib/prism/node.rb#11084 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, operator: Symbol, depth: Integer, location: Location } # - # source://prism//prism/node.rb#11932 + # source://prism//lib/prism/node.rb#11115 + 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(inspector: NodeInspector) -> String + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#11065 + sig { returns(Integer) } + def depth; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#11937 + # source://prism//lib/prism/node.rb#11120 def inspect(inspector = T.unsafe(nil)); end + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#11059 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#11050 + sig { returns(Prism::Location) } + def name_loc; end + + # attr_reader operator: Symbol + # + # source://prism//lib/prism/node.rb#11062 + sig { returns(Symbol) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#11053 + 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 @@ -15970,9 +18182,15 @@ class Prism::MissingNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#11956 + # source://prism//lib/prism/node.rb#11146 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#11056 + 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. @@ -15981,103 +18199,114 @@ class Prism::MissingNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#11966 + # source://prism//lib/prism/node.rb#11156 def type; end end end -# Represents a module declaration involving the `module` keyword. +# Represents the use of the `||=` operator for assignment to a local variable. # -# module Foo end -# ^^^^^^^^^^^^^^ -class Prism::ModuleNode < ::Prism::Node - # def initialize: (locals: Array[Symbol], module_keyword_loc: Location, constant_path: Node, body: Node?, end_keyword_loc: Location, name: Symbol, location: Location) -> void +# target ||= value +# ^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11165 +class Prism::LocalVariableOrWriteNode < ::Prism::Node + # def initialize: (Location name_loc, Location operator_loc, Node value, Symbol name, Integer depth, Location location) -> void # - # @return [ModuleNode] a new instance of ModuleNode + # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode # - # source://prism//prism/node.rb#11995 - def initialize(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location); end + # source://prism//lib/prism/node.rb#11182 + sig do + params( + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + name: Symbol, + depth: Integer, + location: Prism::Location + ).void + end + def initialize(name_loc, operator_loc, value, name, depth, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12006 + # source://prism//lib/prism/node.rb#11192 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader body: Node? - # - # source://prism//prism/node.rb#11986 - def body; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12011 + # source://prism//lib/prism/node.rb#11197 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12024 + # source://prism//lib/prism/node.rb#11207 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12016 + # source://prism//lib/prism/node.rb#11202 def compact_child_nodes; end - # attr_reader constant_path: Node - # - # source://prism//prism/node.rb#11983 - def constant_path; end - - # def copy: (**params) -> ModuleNode + # def copy: (**params) -> LocalVariableOrWriteNode # - # source://prism//prism/node.rb#12029 + # source://prism//lib/prism/node.rb#11212 + sig { params(params: T.untyped).returns(Prism::LocalVariableOrWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12011 + # source://prism//lib/prism/node.rb#11197 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location } # - # source://prism//prism/node.rb#12045 + # source://prism//lib/prism/node.rb#11227 + 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 end_keyword: () -> String - # - # source://prism//prism/node.rb#12055 - def end_keyword; end - - # attr_reader end_keyword_loc: Location + # attr_reader depth: Integer # - # source://prism//prism/node.rb#11989 - def end_keyword_loc; end + # source://prism//lib/prism/node.rb#11179 + sig { returns(Integer) } + def depth; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12060 + # source://prism//lib/prism/node.rb#11237 def inspect(inspector = T.unsafe(nil)); end - # attr_reader locals: Array[Symbol] + # attr_reader name: Symbol # - # source://prism//prism/node.rb#11977 - def locals; end + # source://prism//lib/prism/node.rb#11176 + sig { returns(Symbol) } + def name; end - # def module_keyword: () -> String + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#12050 - def module_keyword; end + # source://prism//lib/prism/node.rb#11167 + sig { returns(Prism::Location) } + def name_loc; end - # attr_reader module_keyword_loc: Location + # def operator: () -> String # - # source://prism//prism/node.rb#11980 - def module_keyword_loc; end + # source://prism//lib/prism/node.rb#11232 + sig { returns(String) } + def operator; end - # attr_reader name: Symbol + # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#11992 - def name; end + # source://prism//lib/prism/node.rb#11170 + 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 @@ -16094,9 +18323,15 @@ class Prism::ModuleNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12091 + # source://prism//lib/prism/node.rb#11262 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#11173 + 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. @@ -16105,98 +18340,105 @@ class Prism::ModuleNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12101 + # source://prism//lib/prism/node.rb#11272 def type; end end end -# Represents a multi-target expression. +# 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. # -# a, (b, c) = 1, 2, 3 -# ^^^^^^ -class Prism::MultiTargetNode < ::Prism::Node - # def initialize: (lefts: Array[Node], rest: Node?, rights: Array[Node], lparen_loc: Location?, rparen_loc: Location?, location: Location) -> void +# foo +# ^^^ +# +# source://prism//lib/prism/node.rb#11281 +class Prism::LocalVariableReadNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location location) -> void # - # @return [MultiTargetNode] a new instance of MultiTargetNode + # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode # - # source://prism//prism/node.rb#12127 - def initialize(lefts, rest, rights, lparen_loc, rparen_loc, location); end + # source://prism//lib/prism/node.rb#11307 + sig { params(name: Symbol, depth: Integer, location: Prism::Location).void } + def initialize(name, depth, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12137 + # source://prism//lib/prism/node.rb#11314 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12142 + # source://prism//lib/prism/node.rb#11319 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12156 + # source://prism//lib/prism/node.rb#11329 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12147 + # source://prism//lib/prism/node.rb#11324 def compact_child_nodes; end - # def copy: (**params) -> MultiTargetNode + # def copy: (**params) -> LocalVariableReadNode # - # source://prism//prism/node.rb#12161 + # source://prism//lib/prism/node.rb#11334 + sig { params(params: T.untyped).returns(Prism::LocalVariableReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12142 + # source://prism//lib/prism/node.rb#11319 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//prism/node.rb#12176 + # source://prism//lib/prism/node.rb#11346 + 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(inspector: NodeInspector) -> String + # The number of visible scopes that should be searched to find the origin of this local variable. # - # source://prism//prism/node.rb#12191 - def inspect(inspector = T.unsafe(nil)); end - - # attr_reader lefts: Array[Node] + # foo = 1; foo # depth 0 # - # source://prism//prism/node.rb#12112 - def lefts; end - - # def lparen: () -> String? + # bar = 2; tap { bar } # depth 1 # - # source://prism//prism/node.rb#12181 - def lparen; end - - # attr_reader lparen_loc: Location? + # 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//prism/node.rb#12121 - def lparen_loc; end + # source://prism//lib/prism/node.rb#11304 + sig { returns(Integer) } + def depth; end - # attr_reader rest: Node? + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12115 - def rest; end + # source://prism//lib/prism/node.rb#11351 + def inspect(inspector = T.unsafe(nil)); end - # attr_reader rights: Array[Node] + # The name of the local variable, which is an [identifier](https://github.com/ruby/prism/blob/main/docs/parsing_rules.md#identifiers). # - # source://prism//prism/node.rb#12118 - def rights; end - - # def rparen: () -> String? + # x # name `:x` # - # source://prism//prism/node.rb#12186 - def rparen; end - - # attr_reader rparen_loc: Location? + # _Test # name `:_Test` # - # source://prism//prism/node.rb#12124 - def rparen_loc; end + # 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#11295 + 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 @@ -16213,7 +18455,7 @@ class Prism::MultiTargetNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12220 + # source://prism//lib/prism/node.rb#11372 def type; end class << self @@ -16224,108 +18466,222 @@ class Prism::MultiTargetNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12230 + # source://prism//lib/prism/node.rb#11382 def type; end end end -# Represents a write to a multi-target expression. +# Represents writing to a local variable in a context that doesn't have an explicit value. # -# a, b, c = 1, 2, 3 -# ^^^^^^^^^^^^^^^^^ -class Prism::MultiWriteNode < ::Prism::Node - # def initialize: (lefts: Array[Node], rest: Node?, rights: Array[Node], lparen_loc: Location?, rparen_loc: Location?, operator_loc: Location, value: Node, location: Location) -> void +# foo, bar = baz +# ^^^ ^^^ +# +# source://prism//lib/prism/node.rb#11391 +class Prism::LocalVariableTargetNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location location) -> void # - # @return [MultiWriteNode] a new instance of MultiWriteNode + # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode # - # source://prism//prism/node.rb#12262 - def initialize(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location); end + # source://prism//lib/prism/node.rb#11399 + sig { params(name: Symbol, depth: Integer, location: Prism::Location).void } + def initialize(name, depth, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12274 + # source://prism//lib/prism/node.rb#11406 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12279 + # source://prism//lib/prism/node.rb#11411 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12294 + # source://prism//lib/prism/node.rb#11421 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12284 + # source://prism//lib/prism/node.rb#11416 def compact_child_nodes; end - # def copy: (**params) -> MultiWriteNode + # def copy: (**params) -> LocalVariableTargetNode # - # source://prism//prism/node.rb#12299 + # source://prism//lib/prism/node.rb#11426 + sig { params(params: T.untyped).returns(Prism::LocalVariableTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12279 + # source://prism//lib/prism/node.rb#11411 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { name: Symbol, depth: Integer, location: Location } # - # source://prism//prism/node.rb#12316 + # source://prism//lib/prism/node.rb#11438 + 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(inspector: NodeInspector) -> String + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#11396 + sig { returns(Integer) } + def depth; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12336 + # source://prism//lib/prism/node.rb#11443 def inspect(inspector = T.unsafe(nil)); end - # attr_reader lefts: Array[Node] + # attr_reader name: Symbol # - # source://prism//prism/node.rb#12241 - def lefts; end + # source://prism//lib/prism/node.rb#11393 + sig { returns(Symbol) } + def name; end - # def lparen: () -> String? + # 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//prism/node.rb#12321 - def lparen; 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#11464 + def type; end - # attr_reader lparen_loc: Location? + 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#11474 + def type; end + end +end + +# Represents writing to a local variable. +# +# foo = 1 +# ^^^^^^^ +# +# source://prism//lib/prism/node.rb#11483 +class Prism::LocalVariableWriteNode < ::Prism::Node + # def initialize: (Symbol name, Integer depth, Location name_loc, Node value, Location operator_loc, Location location) -> void # - # source://prism//prism/node.rb#12250 - def lparen_loc; end + # @return [LocalVariableWriteNode] a new instance of LocalVariableWriteNode + # + # source://prism//lib/prism/node.rb#11500 + sig do + params( + name: Symbol, + depth: Integer, + name_loc: Prism::Location, + value: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(name, depth, name_loc, value, operator_loc, location); end - # def operator: () -> String + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12331 - def operator; end + # source://prism//lib/prism/node.rb#11510 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # attr_reader operator_loc: Location + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12256 - def operator_loc; end + # source://prism//lib/prism/node.rb#11515 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # attr_reader rest: Node? + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12244 - def rest; end + # source://prism//lib/prism/node.rb#11525 + def comment_targets; end - # attr_reader rights: Array[Node] + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12247 - def rights; end + # source://prism//lib/prism/node.rb#11520 + def compact_child_nodes; end - # def rparen: () -> String? + # def copy: (**params) -> LocalVariableWriteNode # - # source://prism//prism/node.rb#12326 - def rparen; end + # source://prism//lib/prism/node.rb#11530 + sig { params(params: T.untyped).returns(Prism::LocalVariableWriteNode) } + def copy(**params); end - # attr_reader rparen_loc: Location? + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12253 - def rparen_loc; end + # source://prism//lib/prism/node.rb#11515 + sig { 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 } + # + # source://prism//lib/prism/node.rb#11545 + 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 + + # attr_reader depth: Integer + # + # source://prism//lib/prism/node.rb#11488 + sig { returns(Integer) } + def depth; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#11555 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#11485 + sig { returns(Symbol) } + def name; end + + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#11491 + sig { returns(Prism::Location) } + def name_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#11550 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#11497 + 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 @@ -16342,12 +18698,13 @@ class Prism::MultiWriteNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12368 + # source://prism//lib/prism/node.rb#11580 def type; end # attr_reader value: Node # - # source://prism//prism/node.rb#12259 + # source://prism//lib/prism/node.rb#11494 + sig { returns(Prism::Node) } def value; end class << self @@ -16358,823 +18715,1033 @@ class Prism::MultiWriteNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12378 + # source://prism//lib/prism/node.rb#11590 def type; end end 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. -class Prism::MutationCompiler < ::Prism::Compiler - # Copy a AliasGlobalVariableNode node - # - # source://prism//prism/mutation_compiler.rb#14 - def visit_alias_global_variable_node(node); end - - # Copy a AliasMethodNode node +# This represents a location in the source. +# +# source://prism//lib/prism/parse_result.rb#91 +class Prism::Location + # Create a new location object with the given source, start byte offset, and + # byte length. # - # source://prism//prism/mutation_compiler.rb#19 - def visit_alias_method_node(node); end - - # Copy a AlternationPatternNode node + # @return [Location] a new instance of Location # - # source://prism//prism/mutation_compiler.rb#24 - def visit_alternation_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#108 + sig { params(source: Prism::Source, start_offset: Integer, length: Integer).void } + def initialize(source, start_offset, length); end - # Copy a AndNode node + # Returns true if the given other location is equal to this location. # - # source://prism//prism/mutation_compiler.rb#29 - def visit_and_node(node); end + # source://prism//lib/prism/parse_result.rb#202 + def ==(other); end - # Copy a ArgumentsNode node + # The list of comments attached to this location # - # source://prism//prism/mutation_compiler.rb#34 - def visit_arguments_node(node); end + # source://prism//lib/prism/parse_result.rb#104 + sig { returns(T::Array[Prism::Comment]) } + def comments; end - # Copy a ArrayNode node + # Create a new location object with the given options. # - # source://prism//prism/mutation_compiler.rb#39 - def visit_array_node(node); end + # source://prism//lib/prism/parse_result.rb#116 + sig { params(options: T.untyped).returns(Prism::Location) } + def copy(**options); end - # Copy a ArrayPatternNode node + # Implement the hash pattern matching interface for Location. # - # source://prism//prism/mutation_compiler.rb#44 - def visit_array_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#192 + def deconstruct_keys(keys); end - # Copy a AssocNode node + # The column number in characters where this location ends from the start of + # the line. # - # source://prism//prism/mutation_compiler.rb#49 - def visit_assoc_node(node); end + # source://prism//lib/prism/parse_result.rb#187 + def end_character_column; end - # Copy a AssocSplatNode node + # The character offset from the beginning of the source where this location + # ends. # - # source://prism//prism/mutation_compiler.rb#54 - def visit_assoc_splat_node(node); end + # source://prism//lib/prism/parse_result.rb#147 + def end_character_offset; end - # Copy a BackReferenceReadNode node + # The column number in bytes where this location ends from the start of the + # line. # - # source://prism//prism/mutation_compiler.rb#59 - def visit_back_reference_read_node(node); end + # source://prism//lib/prism/parse_result.rb#181 + sig { returns(Integer) } + def end_column; end - # Copy a BeginNode node + # The line number where this location ends. # - # source://prism//prism/mutation_compiler.rb#64 - def visit_begin_node(node); end + # source://prism//lib/prism/parse_result.rb#163 + sig { returns(Integer) } + def end_line; end - # Copy a BlockArgumentNode node + # The byte offset from the beginning of the source where this location ends. # - # source://prism//prism/mutation_compiler.rb#69 - def visit_block_argument_node(node); end + # source://prism//lib/prism/parse_result.rb#141 + sig { returns(Integer) } + def end_offset; end - # Copy a BlockLocalVariableNode node + # Returns a string representation of this location. # - # source://prism//prism/mutation_compiler.rb#74 - def visit_block_local_variable_node(node); end + # source://prism//lib/prism/parse_result.rb#125 + def inspect; end - # Copy a BlockNode node + # 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//prism/mutation_compiler.rb#79 - def visit_block_node(node); end + # source://prism//lib/prism/parse_result.rb#211 + def join(other); end - # Copy a BlockParameterNode node + # The length of this location in bytes. # - # source://prism//prism/mutation_compiler.rb#84 - def visit_block_parameter_node(node); end + # source://prism//lib/prism/parse_result.rb#101 + def length; end - # Copy a BlockParametersNode node + # Implement the pretty print interface for Location. # - # source://prism//prism/mutation_compiler.rb#89 - def visit_block_parameters_node(node); end + # source://prism//lib/prism/parse_result.rb#197 + def pretty_print(q); end - # Copy a BreakNode node + # The source code that this location represents. # - # source://prism//prism/mutation_compiler.rb#94 - def visit_break_node(node); end + # source://prism//lib/prism/parse_result.rb#130 + sig { returns(String) } + def slice; end - # Copy a CallAndWriteNode node + # The column number in characters where this location ends from the start of + # the line. # - # source://prism//prism/mutation_compiler.rb#99 - def visit_call_and_write_node(node); end + # source://prism//lib/prism/parse_result.rb#175 + def start_character_column; end - # Copy a CallNode node + # The character offset from the beginning of the source where this location + # starts. # - # source://prism//prism/mutation_compiler.rb#104 - def visit_call_node(node); end + # source://prism//lib/prism/parse_result.rb#136 + def start_character_offset; end - # Copy a CallOperatorWriteNode node + # The column number in bytes where this location starts from the start of + # the line. # - # source://prism//prism/mutation_compiler.rb#109 - def visit_call_operator_write_node(node); end + # source://prism//lib/prism/parse_result.rb#169 + sig { returns(Integer) } + def start_column; end - # Copy a CallOrWriteNode node + # The line number where this location starts. # - # source://prism//prism/mutation_compiler.rb#114 - def visit_call_or_write_node(node); end + # source://prism//lib/prism/parse_result.rb#152 + sig { returns(Integer) } + def start_line; end - # Copy a CallTargetNode node + # The content of the line where this location starts before this location. # - # source://prism//prism/mutation_compiler.rb#119 - def visit_call_target_node(node); end + # source://prism//lib/prism/parse_result.rb#157 + def start_line_slice; end - # Copy a CapturePatternNode node + # The byte offset from the beginning of the source where this location + # starts. # - # source://prism//prism/mutation_compiler.rb#124 - def visit_capture_pattern_node(node); end + # source://prism//lib/prism/parse_result.rb#98 + sig { returns(Integer) } + def start_offset; end - # Copy a CaseMatchNode node - # - # source://prism//prism/mutation_compiler.rb#129 - def visit_case_match_node(node); end + protected - # Copy a CaseNode node + # Returns the value of attribute source. # - # source://prism//prism/mutation_compiler.rb#134 - def visit_case_node(node); end + # source://prism//lib/prism/parse_result.rb#94 + def source; end - # Copy a ClassNode node - # - # source://prism//prism/mutation_compiler.rb#139 - def visit_class_node(node); end - - # Copy a ClassVariableAndWriteNode node - # - # source://prism//prism/mutation_compiler.rb#144 - def visit_class_variable_and_write_node(node); 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#221 + def null; end + end +end - # Copy a ClassVariableOperatorWriteNode node - # - # source://prism//prism/mutation_compiler.rb#149 - def visit_class_variable_operator_write_node(node); end +# Flags for while and until loop nodes. +# +# source://prism//lib/prism/node.rb#17608 +module Prism::LoopFlags; end - # Copy a ClassVariableOrWriteNode node - # - # source://prism//prism/mutation_compiler.rb#154 - def visit_class_variable_or_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#17610 +Prism::LoopFlags::BEGIN_MODIFIER = T.let(T.unsafe(nil), Integer) - # Copy a ClassVariableReadNode node +# This represents a magic comment that was encountered during parsing. +# +# source://prism//lib/prism/parse_result.rb#273 +class Prism::MagicComment + # Create a new magic comment object with the given key and value locations. # - # source://prism//prism/mutation_compiler.rb#159 - def visit_class_variable_read_node(node); end - - # Copy a ClassVariableTargetNode node + # @return [MagicComment] a new instance of MagicComment # - # source://prism//prism/mutation_compiler.rb#164 - def visit_class_variable_target_node(node); end + # source://prism//lib/prism/parse_result.rb#281 + def initialize(key_loc, value_loc); end - # Copy a ClassVariableWriteNode node + # Implement the hash pattern matching interface for MagicComment. # - # source://prism//prism/mutation_compiler.rb#169 - def visit_class_variable_write_node(node); end + # source://prism//lib/prism/parse_result.rb#297 + def deconstruct_keys(keys); end - # Copy a ConstantAndWriteNode node + # Returns a string representation of this magic comment. # - # source://prism//prism/mutation_compiler.rb#174 - def visit_constant_and_write_node(node); end + # source://prism//lib/prism/parse_result.rb#302 + def inspect; end - # Copy a ConstantOperatorWriteNode node + # Returns the key of the magic comment by slicing it from the source code. # - # source://prism//prism/mutation_compiler.rb#179 - def visit_constant_operator_write_node(node); end + # source://prism//lib/prism/parse_result.rb#287 + def key; end - # Copy a ConstantOrWriteNode node + # A Location object representing the location of the key in the source. # - # source://prism//prism/mutation_compiler.rb#184 - def visit_constant_or_write_node(node); end + # source://prism//lib/prism/parse_result.rb#275 + def key_loc; end - # Copy a ConstantPathAndWriteNode node + # Returns the value of the magic comment by slicing it from the source code. # - # source://prism//prism/mutation_compiler.rb#189 - def visit_constant_path_and_write_node(node); end + # source://prism//lib/prism/parse_result.rb#292 + def value; end - # Copy a ConstantPathNode node + # A Location object representing the location of the value in the source. # - # source://prism//prism/mutation_compiler.rb#194 - def visit_constant_path_node(node); end + # source://prism//lib/prism/parse_result.rb#278 + def value_loc; end +end - # Copy a ConstantPathOperatorWriteNode node - # - # source://prism//prism/mutation_compiler.rb#199 - def visit_constant_path_operator_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#11599 +class Prism::MatchLastLineNode < ::Prism::Node + include ::Prism::RegularExpressionOptions - # Copy a ConstantPathOrWriteNode node + # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void # - # source://prism//prism/mutation_compiler.rb#204 - def visit_constant_path_or_write_node(node); end - - # Copy a ConstantPathTargetNode node + # @return [MatchLastLineNode] a new instance of MatchLastLineNode # - # source://prism//prism/mutation_compiler.rb#209 - def visit_constant_path_target_node(node); end + # source://prism//lib/prism/node.rb#11616 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end + def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end - # Copy a ConstantPathWriteNode node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/mutation_compiler.rb#214 - def visit_constant_path_write_node(node); end + # source://prism//lib/prism/node.rb#11626 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Copy a ConstantReadNode node + # def ascii_8bit?: () -> bool # - # source://prism//prism/mutation_compiler.rb#219 - def visit_constant_read_node(node); end - - # Copy a ConstantTargetNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#224 - def visit_constant_target_node(node); end + # source://prism//lib/prism/node.rb#11691 + sig { returns(T::Boolean) } + def ascii_8bit?; end - # Copy a ConstantWriteNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#229 - def visit_constant_write_node(node); end + # source://prism//lib/prism/node.rb#11631 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a DefNode node + # def closing: () -> String # - # source://prism//prism/mutation_compiler.rb#234 - def visit_def_node(node); end + # source://prism//lib/prism/node.rb#11731 + sig { returns(String) } + def closing; end - # Copy a DefinedNode node + # attr_reader closing_loc: Location # - # source://prism//prism/mutation_compiler.rb#239 - def visit_defined_node(node); end + # source://prism//lib/prism/node.rb#11610 + sig { returns(Prism::Location) } + def closing_loc; end - # Copy a ElseNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/mutation_compiler.rb#244 - def visit_else_node(node); end + # source://prism//lib/prism/node.rb#11641 + def comment_targets; end - # Copy a EmbeddedStatementsNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/mutation_compiler.rb#249 - def visit_embedded_statements_node(node); end + # source://prism//lib/prism/node.rb#11636 + def compact_child_nodes; end - # Copy a EmbeddedVariableNode node + # def content: () -> String # - # source://prism//prism/mutation_compiler.rb#254 - def visit_embedded_variable_node(node); end + # source://prism//lib/prism/node.rb#11726 + sig { returns(String) } + def content; end - # Copy a EnsureNode node + # attr_reader content_loc: Location # - # source://prism//prism/mutation_compiler.rb#259 - def visit_ensure_node(node); end + # source://prism//lib/prism/node.rb#11607 + sig { returns(Prism::Location) } + def content_loc; end - # Copy a FalseNode node + # def copy: (**params) -> MatchLastLineNode # - # source://prism//prism/mutation_compiler.rb#264 - def visit_false_node(node); end + # source://prism//lib/prism/node.rb#11646 + sig { params(params: T.untyped).returns(Prism::MatchLastLineNode) } + def copy(**params); end - # Copy a FindPatternNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#269 - def visit_find_pattern_node(node); end + # source://prism//lib/prism/node.rb#11631 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a FlipFlopNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//prism/mutation_compiler.rb#274 - def visit_flip_flop_node(node); end + # source://prism//lib/prism/node.rb#11661 + 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 - # Copy a FloatNode node + # def euc_jp?: () -> bool # - # source://prism//prism/mutation_compiler.rb#279 - def visit_float_node(node); end - - # Copy a ForNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#284 - def visit_for_node(node); end + # source://prism//lib/prism/node.rb#11686 + sig { returns(T::Boolean) } + def euc_jp?; end - # Copy a ForwardingArgumentsNode node + # def extended?: () -> bool # - # source://prism//prism/mutation_compiler.rb#289 - def visit_forwarding_arguments_node(node); end - - # Copy a ForwardingParameterNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#294 - def visit_forwarding_parameter_node(node); end + # source://prism//lib/prism/node.rb#11671 + sig { returns(T::Boolean) } + def extended?; end - # Copy a ForwardingSuperNode node + # def forced_binary_encoding?: () -> bool # - # source://prism//prism/mutation_compiler.rb#299 - def visit_forwarding_super_node(node); end - - # Copy a GlobalVariableAndWriteNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#304 - def visit_global_variable_and_write_node(node); end + # source://prism//lib/prism/node.rb#11711 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # Copy a GlobalVariableOperatorWriteNode node + # def forced_us_ascii_encoding?: () -> bool # - # source://prism//prism/mutation_compiler.rb#309 - def visit_global_variable_operator_write_node(node); end - - # Copy a GlobalVariableOrWriteNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#314 - def visit_global_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#11716 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # Copy a GlobalVariableReadNode node + # def forced_utf8_encoding?: () -> bool # - # source://prism//prism/mutation_compiler.rb#319 - def visit_global_variable_read_node(node); end - - # Copy a GlobalVariableTargetNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#324 - def visit_global_variable_target_node(node); end + # source://prism//lib/prism/node.rb#11706 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # Copy a GlobalVariableWriteNode node + # def ignore_case?: () -> bool # - # source://prism//prism/mutation_compiler.rb#329 - def visit_global_variable_write_node(node); end - - # Copy a HashNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#334 - def visit_hash_node(node); end + # source://prism//lib/prism/node.rb#11666 + sig { returns(T::Boolean) } + def ignore_case?; end - # Copy a HashPatternNode node + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/mutation_compiler.rb#339 - def visit_hash_pattern_node(node); end + # source://prism//lib/prism/node.rb#11736 + def inspect(inspector = T.unsafe(nil)); end - # Copy a IfNode node + # def multi_line?: () -> bool # - # source://prism//prism/mutation_compiler.rb#344 - def visit_if_node(node); end - - # Copy a ImaginaryNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#349 - def visit_imaginary_node(node); end + # source://prism//lib/prism/node.rb#11676 + sig { returns(T::Boolean) } + def multi_line?; end - # Copy a ImplicitNode node + # def once?: () -> bool # - # source://prism//prism/mutation_compiler.rb#354 - def visit_implicit_node(node); end - - # Copy a ImplicitRestNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#359 - def visit_implicit_rest_node(node); end + # source://prism//lib/prism/node.rb#11681 + sig { returns(T::Boolean) } + def once?; end - # Copy a InNode node + # def opening: () -> String # - # source://prism//prism/mutation_compiler.rb#364 - def visit_in_node(node); end + # source://prism//lib/prism/node.rb#11721 + sig { returns(String) } + def opening; end - # Copy a IndexAndWriteNode node + # attr_reader opening_loc: Location # - # source://prism//prism/mutation_compiler.rb#369 - def visit_index_and_write_node(node); end + # source://prism//lib/prism/node.rb#11604 + sig { returns(Prism::Location) } + def opening_loc; end - # Copy a IndexOperatorWriteNode 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//prism/mutation_compiler.rb#374 - def visit_index_operator_write_node(node); end - - # Copy a IndexOrWriteNode 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//prism/mutation_compiler.rb#379 - def visit_index_or_write_node(node); end - - # Copy a IndexTargetNode node + # def type: () -> Symbol # - # source://prism//prism/mutation_compiler.rb#384 - def visit_index_target_node(node); end + # source://prism//lib/prism/node.rb#11761 + def type; end - # Copy a InstanceVariableAndWriteNode node + # attr_reader unescaped: String # - # source://prism//prism/mutation_compiler.rb#389 - def visit_instance_variable_and_write_node(node); end + # source://prism//lib/prism/node.rb#11613 + sig { returns(String) } + def unescaped; end - # Copy a InstanceVariableOperatorWriteNode node + # def utf_8?: () -> bool # - # source://prism//prism/mutation_compiler.rb#394 - def visit_instance_variable_operator_write_node(node); end - - # Copy a InstanceVariableOrWriteNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#399 - def visit_instance_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#11701 + sig { returns(T::Boolean) } + def utf_8?; end - # Copy a InstanceVariableReadNode node + # def windows_31j?: () -> bool # - # source://prism//prism/mutation_compiler.rb#404 - def visit_instance_variable_read_node(node); end - - # Copy a InstanceVariableTargetNode node + # @return [Boolean] # - # source://prism//prism/mutation_compiler.rb#409 - def visit_instance_variable_target_node(node); end + # source://prism//lib/prism/node.rb#11696 + sig { returns(T::Boolean) } + def windows_31j?; end - # Copy a InstanceVariableWriteNode node - # - # source://prism//prism/mutation_compiler.rb#414 - def visit_instance_variable_write_node(node); end + private - # Copy a IntegerNode node + # Returns the value of attribute flags. # - # source://prism//prism/mutation_compiler.rb#419 - def visit_integer_node(node); end + # source://prism//lib/prism/node.rb#11601 + sig { returns(Integer) } + def flags; end - # Copy a InterpolatedMatchLastLineNode node - # - # source://prism//prism/mutation_compiler.rb#424 - def visit_interpolated_match_last_line_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#11771 + def type; end + end +end - # Copy a InterpolatedRegularExpressionNode node +# Represents the use of the modifier `in` operator. +# +# foo in bar +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11780 +class Prism::MatchPredicateNode < ::Prism::Node + # def initialize: (Node value, Node pattern, Location operator_loc, Location location) -> void # - # source://prism//prism/mutation_compiler.rb#429 - def visit_interpolated_regular_expression_node(node); end - - # Copy a InterpolatedStringNode node + # @return [MatchPredicateNode] a new instance of MatchPredicateNode # - # source://prism//prism/mutation_compiler.rb#434 - def visit_interpolated_string_node(node); end + # source://prism//lib/prism/node.rb#11791 + sig do + params( + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(value, pattern, operator_loc, location); end - # Copy a InterpolatedSymbolNode node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/mutation_compiler.rb#439 - def visit_interpolated_symbol_node(node); end + # source://prism//lib/prism/node.rb#11799 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Copy a InterpolatedXStringNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#444 - def visit_interpolated_x_string_node(node); end + # source://prism//lib/prism/node.rb#11804 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a KeywordHashNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/mutation_compiler.rb#449 - def visit_keyword_hash_node(node); end + # source://prism//lib/prism/node.rb#11814 + def comment_targets; end - # Copy a KeywordRestParameterNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/mutation_compiler.rb#454 - def visit_keyword_rest_parameter_node(node); end + # source://prism//lib/prism/node.rb#11809 + def compact_child_nodes; end - # Copy a LambdaNode node + # def copy: (**params) -> MatchPredicateNode # - # source://prism//prism/mutation_compiler.rb#459 - def visit_lambda_node(node); end + # source://prism//lib/prism/node.rb#11819 + sig { params(params: T.untyped).returns(Prism::MatchPredicateNode) } + def copy(**params); end - # Copy a LocalVariableAndWriteNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#464 - def visit_local_variable_and_write_node(node); end + # source://prism//lib/prism/node.rb#11804 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a LocalVariableOperatorWriteNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, pattern: Node, operator_loc: Location, location: Location } # - # source://prism//prism/mutation_compiler.rb#469 - def visit_local_variable_operator_write_node(node); end + # source://prism//lib/prism/node.rb#11832 + 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 - # Copy a LocalVariableOrWriteNode node + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/mutation_compiler.rb#474 - def visit_local_variable_or_write_node(node); end + # source://prism//lib/prism/node.rb#11842 + def inspect(inspector = T.unsafe(nil)); end - # Copy a LocalVariableReadNode node + # def operator: () -> String # - # source://prism//prism/mutation_compiler.rb#479 - def visit_local_variable_read_node(node); end + # source://prism//lib/prism/node.rb#11837 + sig { returns(String) } + def operator; end - # Copy a LocalVariableTargetNode node + # attr_reader operator_loc: Location # - # source://prism//prism/mutation_compiler.rb#484 - def visit_local_variable_target_node(node); end + # source://prism//lib/prism/node.rb#11788 + sig { returns(Prism::Location) } + def operator_loc; end - # Copy a LocalVariableWriteNode node + # attr_reader pattern: Node # - # source://prism//prism/mutation_compiler.rb#489 - def visit_local_variable_write_node(node); end + # source://prism//lib/prism/node.rb#11785 + sig { returns(Prism::Node) } + def pattern; end - # Copy a MatchLastLineNode 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//prism/mutation_compiler.rb#494 - def visit_match_last_line_node(node); end - - # Copy a MatchPredicateNode 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//prism/mutation_compiler.rb#499 - def visit_match_predicate_node(node); end - - # Copy a MatchRequiredNode node + # def type: () -> Symbol # - # source://prism//prism/mutation_compiler.rb#504 - def visit_match_required_node(node); end + # source://prism//lib/prism/node.rb#11866 + def type; end - # Copy a MatchWriteNode node + # attr_reader value: Node # - # source://prism//prism/mutation_compiler.rb#509 - def visit_match_write_node(node); end + # source://prism//lib/prism/node.rb#11782 + sig { returns(Prism::Node) } + def value; end - # Copy a MissingNode node - # - # source://prism//prism/mutation_compiler.rb#514 - def visit_missing_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#11876 + def type; end + end +end - # Copy a ModuleNode node +# Represents the use of the `=>` operator. +# +# foo => bar +# ^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11885 +class Prism::MatchRequiredNode < ::Prism::Node + # def initialize: (Node value, Node pattern, Location operator_loc, Location location) -> void # - # source://prism//prism/mutation_compiler.rb#519 - def visit_module_node(node); end - - # Copy a MultiTargetNode node + # @return [MatchRequiredNode] a new instance of MatchRequiredNode # - # source://prism//prism/mutation_compiler.rb#524 - def visit_multi_target_node(node); end + # source://prism//lib/prism/node.rb#11896 + sig do + params( + value: Prism::Node, + pattern: Prism::Node, + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(value, pattern, operator_loc, location); end - # Copy a MultiWriteNode node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/mutation_compiler.rb#529 - def visit_multi_write_node(node); end + # source://prism//lib/prism/node.rb#11904 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Copy a NextNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#534 - def visit_next_node(node); end + # source://prism//lib/prism/node.rb#11909 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a NilNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/mutation_compiler.rb#539 - def visit_nil_node(node); end + # source://prism//lib/prism/node.rb#11919 + def comment_targets; end - # Copy a NoKeywordsParameterNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/mutation_compiler.rb#544 - def visit_no_keywords_parameter_node(node); end + # source://prism//lib/prism/node.rb#11914 + def compact_child_nodes; end - # Copy a NumberedParametersNode node + # def copy: (**params) -> MatchRequiredNode # - # source://prism//prism/mutation_compiler.rb#549 - def visit_numbered_parameters_node(node); end + # source://prism//lib/prism/node.rb#11924 + sig { params(params: T.untyped).returns(Prism::MatchRequiredNode) } + def copy(**params); end - # Copy a NumberedReferenceReadNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#554 - def visit_numbered_reference_read_node(node); end + # source://prism//lib/prism/node.rb#11909 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a OptionalKeywordParameterNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { value: Node, pattern: Node, operator_loc: Location, location: Location } # - # source://prism//prism/mutation_compiler.rb#559 - def visit_optional_keyword_parameter_node(node); end + # source://prism//lib/prism/node.rb#11937 + 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 - # Copy a OptionalParameterNode node + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/mutation_compiler.rb#564 - def visit_optional_parameter_node(node); end + # source://prism//lib/prism/node.rb#11947 + def inspect(inspector = T.unsafe(nil)); end - # Copy a OrNode node + # def operator: () -> String # - # source://prism//prism/mutation_compiler.rb#569 - def visit_or_node(node); end + # source://prism//lib/prism/node.rb#11942 + sig { returns(String) } + def operator; end - # Copy a ParametersNode node + # attr_reader operator_loc: Location # - # source://prism//prism/mutation_compiler.rb#574 - def visit_parameters_node(node); end + # source://prism//lib/prism/node.rb#11893 + sig { returns(Prism::Location) } + def operator_loc; end - # Copy a ParenthesesNode node + # attr_reader pattern: Node # - # source://prism//prism/mutation_compiler.rb#579 - def visit_parentheses_node(node); end + # source://prism//lib/prism/node.rb#11890 + sig { returns(Prism::Node) } + def pattern; end - # Copy a PinnedExpressionNode 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//prism/mutation_compiler.rb#584 - def visit_pinned_expression_node(node); end - - # Copy a PinnedVariableNode 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//prism/mutation_compiler.rb#589 - def visit_pinned_variable_node(node); end - - # Copy a PostExecutionNode node + # def type: () -> Symbol # - # source://prism//prism/mutation_compiler.rb#594 - def visit_post_execution_node(node); end + # source://prism//lib/prism/node.rb#11971 + def type; end - # Copy a PreExecutionNode node + # attr_reader value: Node # - # source://prism//prism/mutation_compiler.rb#599 - def visit_pre_execution_node(node); end + # source://prism//lib/prism/node.rb#11887 + sig { returns(Prism::Node) } + def value; end - # Copy a ProgramNode node - # - # source://prism//prism/mutation_compiler.rb#604 - def visit_program_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#11981 + def type; end + end +end - # Copy a RangeNode node +# Represents writing local variables using a regular expression match with named capture groups. +# +# /(?bar)/ =~ baz +# ^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#11990 +class Prism::MatchWriteNode < ::Prism::Node + # def initialize: (CallNode call, Array[Node] targets, Location location) -> void # - # source://prism//prism/mutation_compiler.rb#609 - def visit_range_node(node); end - - # Copy a RationalNode node + # @return [MatchWriteNode] a new instance of MatchWriteNode # - # source://prism//prism/mutation_compiler.rb#614 - def visit_rational_node(node); end + # source://prism//lib/prism/node.rb#11998 + sig { params(call: Prism::CallNode, targets: T::Array[Prism::Node], location: Prism::Location).void } + def initialize(call, targets, location); end - # Copy a RedoNode node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/mutation_compiler.rb#619 - def visit_redo_node(node); end + # source://prism//lib/prism/node.rb#12005 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Copy a RegularExpressionNode node + # attr_reader call: CallNode # - # source://prism//prism/mutation_compiler.rb#624 - def visit_regular_expression_node(node); end + # source://prism//lib/prism/node.rb#11992 + sig { returns(Prism::CallNode) } + def call; end - # Copy a RequiredKeywordParameterNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#629 - def visit_required_keyword_parameter_node(node); end + # source://prism//lib/prism/node.rb#12010 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a RequiredParameterNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/mutation_compiler.rb#634 - def visit_required_parameter_node(node); end + # source://prism//lib/prism/node.rb#12020 + def comment_targets; end - # Copy a RescueModifierNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/mutation_compiler.rb#639 - def visit_rescue_modifier_node(node); end + # source://prism//lib/prism/node.rb#12015 + def compact_child_nodes; end - # Copy a RescueNode node + # def copy: (**params) -> MatchWriteNode # - # source://prism//prism/mutation_compiler.rb#644 - def visit_rescue_node(node); end + # source://prism//lib/prism/node.rb#12025 + sig { params(params: T.untyped).returns(Prism::MatchWriteNode) } + def copy(**params); end - # Copy a RestParameterNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#649 - def visit_rest_parameter_node(node); end + # source://prism//lib/prism/node.rb#12010 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a RetryNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { call: CallNode, targets: Array[Node], location: Location } # - # source://prism//prism/mutation_compiler.rb#654 - def visit_retry_node(node); end + # source://prism//lib/prism/node.rb#12037 + 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 - # Copy a ReturnNode node + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/mutation_compiler.rb#659 - def visit_return_node(node); end + # source://prism//lib/prism/node.rb#12042 + def inspect(inspector = T.unsafe(nil)); end - # Copy a SelfNode node + # attr_reader targets: Array[Node] # - # source://prism//prism/mutation_compiler.rb#664 - def visit_self_node(node); end + # source://prism//lib/prism/node.rb#11995 + sig { returns(T::Array[Prism::Node]) } + def targets; end - # Copy a SingletonClassNode 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//prism/mutation_compiler.rb#669 - def visit_singleton_class_node(node); end - - # Copy a SourceEncodingNode 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//prism/mutation_compiler.rb#674 - def visit_source_encoding_node(node); end - - # Copy a SourceFileNode node + # def type: () -> Symbol # - # source://prism//prism/mutation_compiler.rb#679 - def visit_source_file_node(node); end + # source://prism//lib/prism/node.rb#12064 + def type; end - # Copy a SourceLineNode node - # - # source://prism//prism/mutation_compiler.rb#684 - def visit_source_line_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#12074 + def type; end + end +end - # Copy a SplatNode node +# Represents a node that is missing from the source and results in a syntax error. +# +# source://prism//lib/prism/node.rb#12080 +class Prism::MissingNode < ::Prism::Node + # def initialize: (Location location) -> void # - # source://prism//prism/mutation_compiler.rb#689 - def visit_splat_node(node); end - - # Copy a StatementsNode node + # @return [MissingNode] a new instance of MissingNode # - # source://prism//prism/mutation_compiler.rb#694 - def visit_statements_node(node); end + # source://prism//lib/prism/node.rb#12082 + sig { params(location: Prism::Location).void } + def initialize(location); end - # Copy a StringNode node + # def accept: (Visitor visitor) -> void # - # source://prism//prism/mutation_compiler.rb#699 - def visit_string_node(node); end + # source://prism//lib/prism/node.rb#12087 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Copy a SuperNode node + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#704 - def visit_super_node(node); end + # source://prism//lib/prism/node.rb#12092 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Copy a SymbolNode node + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/mutation_compiler.rb#709 - def visit_symbol_node(node); end + # source://prism//lib/prism/node.rb#12102 + def comment_targets; end - # Copy a TrueNode node + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/mutation_compiler.rb#714 - def visit_true_node(node); end + # source://prism//lib/prism/node.rb#12097 + def compact_child_nodes; end - # Copy a UndefNode node + # def copy: (**params) -> MissingNode # - # source://prism//prism/mutation_compiler.rb#719 - def visit_undef_node(node); end + # source://prism//lib/prism/node.rb#12107 + sig { params(params: T.untyped).returns(Prism::MissingNode) } + def copy(**params); end - # Copy a UnlessNode node + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/mutation_compiler.rb#724 - def visit_unless_node(node); end + # source://prism//lib/prism/node.rb#12092 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Copy a UntilNode node + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/mutation_compiler.rb#729 - def visit_until_node(node); end + # source://prism//lib/prism/node.rb#12117 + 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 - # Copy a WhenNode node + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/mutation_compiler.rb#734 - def visit_when_node(node); end + # source://prism//lib/prism/node.rb#12122 + def inspect(inspector = T.unsafe(nil)); end - # Copy a WhileNode 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//prism/mutation_compiler.rb#739 - def visit_while_node(node); end - - # Copy a XStringNode 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//prism/mutation_compiler.rb#744 - def visit_x_string_node(node); end - - # Copy a YieldNode node + # def type: () -> Symbol # - # source://prism//prism/mutation_compiler.rb#749 - def visit_yield_node(node); end + # source://prism//lib/prism/node.rb#12141 + 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#12151 + def type; end + end end -# Represents the use of the `next` keyword. +# Represents a module declaration involving the `module` keyword. # -# next 1 -# ^^^^^^ -class Prism::NextNode < ::Prism::Node - # def initialize: (arguments: ArgumentsNode?, keyword_loc: Location, location: Location) -> void +# module Foo end +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#12160 +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 # - # @return [NextNode] a new instance of NextNode + # @return [ModuleNode] a new instance of ModuleNode # - # source://prism//prism/node.rb#12395 - def initialize(arguments, keyword_loc, location); end + # source://prism//lib/prism/node.rb#12180 + 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 + ).void + end + def initialize(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12402 + # source://prism//lib/prism/node.rb#12191 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? + # attr_reader body: Node? # - # source://prism//prism/node.rb#12389 - def arguments; end + # source://prism//lib/prism/node.rb#12171 + sig { returns(T.nilable(Prism::Node)) } + def body; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12407 + # source://prism//lib/prism/node.rb#12196 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12419 + # source://prism//lib/prism/node.rb#12209 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12412 + # source://prism//lib/prism/node.rb#12201 def compact_child_nodes; end - # def copy: (**params) -> NextNode + # attr_reader constant_path: Node + # + # source://prism//lib/prism/node.rb#12168 + sig { returns(Prism::Node) } + def constant_path; end + + # def copy: (**params) -> ModuleNode # - # source://prism//prism/node.rb#12424 + # source://prism//lib/prism/node.rb#12214 + sig { params(params: T.untyped).returns(Prism::ModuleNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12407 + # source://prism//lib/prism/node.rb#12196 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#12436 + # source://prism//lib/prism/node.rb#12230 + 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(inspector: NodeInspector) -> String + # def end_keyword: () -> String + # + # source://prism//lib/prism/node.rb#12240 + sig { returns(String) } + def end_keyword; end + + # attr_reader end_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#12174 + sig { returns(Prism::Location) } + def end_keyword_loc; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12446 + # source://prism//lib/prism/node.rb#12245 def inspect(inspector = T.unsafe(nil)); end - # def keyword: () -> String + # attr_reader locals: Array[Symbol] # - # source://prism//prism/node.rb#12441 - def keyword; end + # source://prism//lib/prism/node.rb#12162 + sig { returns(T::Array[Symbol]) } + def locals; end - # attr_reader keyword_loc: Location + # def module_keyword: () -> String # - # source://prism//prism/node.rb#12392 - def keyword_loc; end + # source://prism//lib/prism/node.rb#12235 + sig { returns(String) } + def module_keyword; end + + # attr_reader module_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#12165 + sig { returns(Prism::Location) } + def module_keyword_loc; end + + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#12177 + 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 @@ -17191,7 +19758,7 @@ class Prism::NextNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12472 + # source://prism//lib/prism/node.rb#12276 def type; end class << self @@ -17202,64 +19769,127 @@ class Prism::NextNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12482 + # source://prism//lib/prism/node.rb#12286 def type; end end end -# Represents the use of the `nil` keyword. +# Represents a multi-target expression. # -# nil -# ^^^ -class Prism::NilNode < ::Prism::Node - # def initialize: (location: Location) -> void +# a, (b, c) = 1, 2, 3 +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#12295 +class Prism::MultiTargetNode < ::Prism::Node + # def initialize: (Array[Node] lefts, Node? rest, Array[Node] rights, Location? lparen_loc, Location? rparen_loc, Location location) -> void # - # @return [NilNode] a new instance of NilNode + # @return [MultiTargetNode] a new instance of MultiTargetNode # - # source://prism//prism/node.rb#12493 - def initialize(location); end + # source://prism//lib/prism/node.rb#12312 + sig do + params( + lefts: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + rights: T::Array[Prism::Node], + lparen_loc: T.nilable(Prism::Location), + rparen_loc: T.nilable(Prism::Location), + location: Prism::Location + ).void + end + def initialize(lefts, rest, rights, lparen_loc, rparen_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12498 + # source://prism//lib/prism/node.rb#12322 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12503 + # source://prism//lib/prism/node.rb#12327 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12513 + # source://prism//lib/prism/node.rb#12341 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12508 + # source://prism//lib/prism/node.rb#12332 def compact_child_nodes; end - # def copy: (**params) -> NilNode + # def copy: (**params) -> MultiTargetNode # - # source://prism//prism/node.rb#12518 + # source://prism//lib/prism/node.rb#12346 + sig { params(params: T.untyped).returns(Prism::MultiTargetNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12503 + # source://prism//lib/prism/node.rb#12327 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { lefts: Array[Node], rest: Node?, rights: Array[Node], lparen_loc: Location?, rparen_loc: Location?, location: Location } # - # source://prism//prism/node.rb#12528 + # source://prism//lib/prism/node.rb#12361 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12533 + # source://prism//lib/prism/node.rb#12376 def inspect(inspector = T.unsafe(nil)); end + # attr_reader lefts: Array[Node] + # + # source://prism//lib/prism/node.rb#12297 + sig { returns(T::Array[Prism::Node]) } + def lefts; end + + # def lparen: () -> String? + # + # source://prism//lib/prism/node.rb#12366 + sig { returns(T.nilable(String)) } + def lparen; end + + # attr_reader lparen_loc: Location? + # + # source://prism//lib/prism/node.rb#12306 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end + + # attr_reader rest: Node? + # + # source://prism//lib/prism/node.rb#12300 + sig { returns(T.nilable(Prism::Node)) } + def rest; end + + # attr_reader rights: Array[Node] + # + # source://prism//lib/prism/node.rb#12303 + sig { returns(T::Array[Prism::Node]) } + def rights; end + + # def rparen: () -> String? + # + # source://prism//lib/prism/node.rb#12371 + sig { returns(T.nilable(String)) } + def rparen; end + + # attr_reader rparen_loc: Location? + # + # source://prism//lib/prism/node.rb#12309 + 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 # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -17275,7 +19905,7 @@ class Prism::NilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12552 + # source://prism//lib/prism/node.rb#12405 def type; end class << self @@ -17286,85 +19916,141 @@ class Prism::NilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12562 + # source://prism//lib/prism/node.rb#12415 def type; end end end -# Represents the use of `**nil` inside method arguments. +# Represents a write to a multi-target expression. # -# def a(**nil) -# ^^^^^ -# end -class Prism::NoKeywordsParameterNode < ::Prism::Node - # def initialize: (operator_loc: Location, keyword_loc: Location, location: Location) -> void +# a, b, c = 1, 2, 3 +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#12424 +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 [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode + # @return [MultiWriteNode] a new instance of MultiWriteNode # - # source://prism//prism/node.rb#12580 - def initialize(operator_loc, keyword_loc, location); end + # source://prism//lib/prism/node.rb#12447 + sig do + params( + lefts: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + rights: T::Array[Prism::Node], + 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(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#12587 + # source://prism//lib/prism/node.rb#12459 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12592 + # source://prism//lib/prism/node.rb#12464 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#12602 + # source://prism//lib/prism/node.rb#12479 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#12597 + # source://prism//lib/prism/node.rb#12469 def compact_child_nodes; end - # def copy: (**params) -> NoKeywordsParameterNode + # def copy: (**params) -> MultiWriteNode # - # source://prism//prism/node.rb#12607 + # source://prism//lib/prism/node.rb#12484 + sig { params(params: T.untyped).returns(Prism::MultiWriteNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#12592 + # source://prism//lib/prism/node.rb#12464 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#12619 + # source://prism//lib/prism/node.rb#12501 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#12634 + # source://prism//lib/prism/node.rb#12521 def inspect(inspector = T.unsafe(nil)); end - # def keyword: () -> String + # attr_reader lefts: Array[Node] # - # source://prism//prism/node.rb#12629 - def keyword; end + # source://prism//lib/prism/node.rb#12426 + sig { returns(T::Array[Prism::Node]) } + def lefts; end - # attr_reader keyword_loc: Location + # def lparen: () -> String? # - # source://prism//prism/node.rb#12577 - def keyword_loc; end + # source://prism//lib/prism/node.rb#12506 + sig { returns(T.nilable(String)) } + def lparen; end + + # attr_reader lparen_loc: Location? + # + # source://prism//lib/prism/node.rb#12435 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end # def operator: () -> String # - # source://prism//prism/node.rb#12624 + # source://prism//lib/prism/node.rb#12516 + sig { returns(String) } def operator; end # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#12574 + # source://prism//lib/prism/node.rb#12441 + sig { returns(Prism::Location) } def operator_loc; end + # attr_reader rest: Node? + # + # source://prism//lib/prism/node.rb#12429 + sig { returns(T.nilable(Prism::Node)) } + def rest; end + + # attr_reader rights: Array[Node] + # + # source://prism//lib/prism/node.rb#12432 + sig { returns(T::Array[Prism::Node]) } + def rights; end + + # def rparen: () -> String? + # + # source://prism//lib/prism/node.rb#12511 + sig { returns(T.nilable(String)) } + def rparen; end + + # attr_reader rparen_loc: Location? + # + # source://prism//lib/prism/node.rb#12438 + 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 # calling `[cls1, cls2].include?(node.class)` or putting the node into a @@ -17380,9 +20066,15 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#12655 + # source://prism//lib/prism/node.rb#12553 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#12444 + 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. @@ -17391,919 +20083,846 @@ class Prism::NoKeywordsParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#12665 + # source://prism//lib/prism/node.rb#12563 def type; end end end -# This represents a node in the tree. It is the parent class of all of the -# various node types. -class Prism::Node - # A Location instance that represents the location of this node in the - # source. +# 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 # - # source://prism//prism/node.rb#14 - def location; end + # source://prism//lib/prism/mutation_compiler.rb#14 + def visit_alias_global_variable_node(node); end - # @return [Boolean] + # Copy a AliasMethodNode node # - # source://prism//prism/node.rb#16 - def newline?; end + # source://prism//lib/prism/mutation_compiler.rb#19 + def visit_alias_method_node(node); end - # Similar to inspect, but respects the current level of indentation given by - # the pretty print object. + # Copy a AlternationPatternNode node # - # source://prism//prism/node.rb#35 - def pretty_print(q); end - - # source://prism//prism/node.rb#20 - def set_newline_flag(newline_marked); end + # source://prism//lib/prism/mutation_compiler.rb#24 + def visit_alternation_pattern_node(node); end - # Slice the location of the node from the source. + # Copy a AndNode node # - # source://prism//prism/node.rb#29 - def slice; end + # source://prism//lib/prism/mutation_compiler.rb#29 + def visit_and_node(node); end - # Convert this node into a graphviz dot graph string. + # Copy a ArgumentsNode node # - # source://prism//prism/node.rb#43 - def to_dot; end -end + # source://prism//lib/prism/mutation_compiler.rb#34 + def visit_arguments_node(node); end -# This object is responsible for generating the output for the inspect method -# implementations of child nodes. -class Prism::NodeInspector - # @return [NodeInspector] a new instance of NodeInspector + # Copy a ArrayNode node # - # source://prism//prism/node_inspector.rb#9 - def initialize(prefix = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#39 + def visit_array_node(node); end - # Appends a line to the output with the current prefix. + # Copy a ArrayPatternNode node # - # source://prism//prism/node_inspector.rb#15 - def <<(line); end + # source://prism//lib/prism/mutation_compiler.rb#44 + def visit_array_pattern_node(node); end - # Returns a new inspector that can be used to inspect a child node. + # Copy a AssocNode node # - # source://prism//prism/node_inspector.rb#59 - def child_inspector(append); end + # source://prism//lib/prism/mutation_compiler.rb#49 + def visit_assoc_node(node); end - # Generates a string that represents a child node. + # Copy a AssocSplatNode node # - # source://prism//prism/node_inspector.rb#54 - def child_node(node, append); end + # source://prism//lib/prism/mutation_compiler.rb#54 + def visit_assoc_splat_node(node); end - # This generates a string that is used as the header of the inspect output - # for any given node. + # Copy a BackReferenceReadNode node # - # source://prism//prism/node_inspector.rb#21 - def header(node); end + # source://prism//lib/prism/mutation_compiler.rb#59 + def visit_back_reference_read_node(node); end - # Generates a string that represents a list of nodes. It handles properly - # using the box drawing characters to make the output look nice. + # Copy a BeginNode node # - # source://prism//prism/node_inspector.rb#31 - def list(prefix, nodes); end + # source://prism//lib/prism/mutation_compiler.rb#64 + def visit_begin_node(node); end - # Generates a string that represents a location field on a node. + # Copy a BlockArgumentNode node # - # source://prism//prism/node_inspector.rb#45 - def location(value); end - - # source://prism//prism/node_inspector.rb#7 - def output; end - - # source://prism//prism/node_inspector.rb#7 - def prefix; end + # source://prism//lib/prism/mutation_compiler.rb#69 + def visit_block_argument_node(node); end - # Returns the output as a string. + # Copy a BlockLocalVariableNode node # - # source://prism//prism/node_inspector.rb#64 - def to_str; end -end + # source://prism//lib/prism/mutation_compiler.rb#74 + def visit_block_local_variable_node(node); end -# Represents an implicit set of parameters through the use of numbered -# parameters within a block or lambda. -# -# -> { _1 + _2 } -# ^^^^^^^^^^^^^^ -class Prism::NumberedParametersNode < ::Prism::Node - # def initialize: (maximum: Integer, location: Location) -> void - # - # @return [NumberedParametersNode] a new instance of NumberedParametersNode + # Copy a BlockNode node # - # source://prism//prism/node.rb#12680 - def initialize(maximum, location); end + # source://prism//lib/prism/mutation_compiler.rb#79 + def visit_block_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a BlockParameterNode node # - # source://prism//prism/node.rb#12686 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#84 + def visit_block_parameter_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a BlockParametersNode node # - # source://prism//prism/node.rb#12691 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#89 + def visit_block_parameters_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a BreakNode node # - # source://prism//prism/node.rb#12701 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#94 + def visit_break_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a CallAndWriteNode node # - # source://prism//prism/node.rb#12696 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#99 + def visit_call_and_write_node(node); end - # def copy: (**params) -> NumberedParametersNode + # Copy a CallNode node # - # source://prism//prism/node.rb#12706 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#104 + def visit_call_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a CallOperatorWriteNode node # - # source://prism//prism/node.rb#12691 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#109 + def visit_call_operator_write_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a CallOrWriteNode node # - # source://prism//prism/node.rb#12717 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#114 + def visit_call_or_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a CallTargetNode node # - # source://prism//prism/node.rb#12722 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#119 + def visit_call_target_node(node); end - # attr_reader maximum: Integer + # Copy a CapturePatternNode node # - # source://prism//prism/node.rb#12677 - def maximum; end + # source://prism//lib/prism/mutation_compiler.rb#124 + 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. - # - # 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 + # Copy a CaseMatchNode node # - # source://prism//prism/node.rb#12742 - 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//prism/node.rb#12752 - def type; end - end -end + # source://prism//lib/prism/mutation_compiler.rb#129 + def visit_case_match_node(node); end -# Represents reading a numbered reference to a capture in the previous match. -# -# $1 -# ^^ -class Prism::NumberedReferenceReadNode < ::Prism::Node - # def initialize: (number: Integer, location: Location) -> void - # - # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode + # Copy a CaseNode node # - # source://prism//prism/node.rb#12766 - def initialize(number, location); end + # source://prism//lib/prism/mutation_compiler.rb#134 + def visit_case_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a ClassNode node # - # source://prism//prism/node.rb#12772 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#139 + def visit_class_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a ClassVariableAndWriteNode node # - # source://prism//prism/node.rb#12777 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#144 + def visit_class_variable_and_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a ClassVariableOperatorWriteNode node # - # source://prism//prism/node.rb#12787 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#149 + def visit_class_variable_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a ClassVariableOrWriteNode node # - # source://prism//prism/node.rb#12782 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#154 + def visit_class_variable_or_write_node(node); end - # def copy: (**params) -> NumberedReferenceReadNode + # Copy a ClassVariableReadNode node # - # source://prism//prism/node.rb#12792 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#159 + def visit_class_variable_read_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a ClassVariableTargetNode node # - # source://prism//prism/node.rb#12777 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#164 + def visit_class_variable_target_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a ClassVariableWriteNode node # - # source://prism//prism/node.rb#12803 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#169 + def visit_class_variable_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a ConstantAndWriteNode node # - # source://prism//prism/node.rb#12808 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#174 + def visit_constant_and_write_node(node); end - # attr_reader number: Integer + # Copy a ConstantOperatorWriteNode node # - # source://prism//prism/node.rb#12763 - def number; end + # source://prism//lib/prism/mutation_compiler.rb#179 + 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. - # - # 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 + # Copy a ConstantOrWriteNode node # - # source://prism//prism/node.rb#12828 - 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//prism/node.rb#12838 - def type; end - end -end + # source://prism//lib/prism/mutation_compiler.rb#184 + def visit_constant_or_write_node(node); end -# Represents an optional keyword parameter to a method, block, or lambda definition. -# -# def a(b: 1) -# ^^^^ -# end -class Prism::OptionalKeywordParameterNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, value: Node, location: Location) -> void - # - # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode + # Copy a ConstantPathAndWriteNode node # - # source://prism//prism/node.rb#12859 - def initialize(name, name_loc, value, location); end + # source://prism//lib/prism/mutation_compiler.rb#189 + def visit_constant_path_and_write_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a ConstantPathNode node # - # source://prism//prism/node.rb#12867 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#194 + def visit_constant_path_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a ConstantPathOperatorWriteNode node # - # source://prism//prism/node.rb#12872 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#199 + def visit_constant_path_operator_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a ConstantPathOrWriteNode node # - # source://prism//prism/node.rb#12882 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#204 + def visit_constant_path_or_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a ConstantPathTargetNode node # - # source://prism//prism/node.rb#12877 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#209 + def visit_constant_path_target_node(node); end - # def copy: (**params) -> OptionalKeywordParameterNode + # Copy a ConstantPathWriteNode node # - # source://prism//prism/node.rb#12887 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#214 + def visit_constant_path_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a ConstantReadNode node # - # source://prism//prism/node.rb#12872 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#219 + def visit_constant_read_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a ConstantTargetNode node # - # source://prism//prism/node.rb#12900 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#224 + def visit_constant_target_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a ConstantWriteNode node # - # source://prism//prism/node.rb#12905 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#229 + def visit_constant_write_node(node); end - # attr_reader name: Symbol + # Copy a DefNode node # - # source://prism//prism/node.rb#12850 - def name; end + # source://prism//lib/prism/mutation_compiler.rb#234 + def visit_def_node(node); end - # attr_reader name_loc: Location + # Copy a DefinedNode node # - # source://prism//prism/node.rb#12853 - def name_loc; end + # source://prism//lib/prism/mutation_compiler.rb#239 + def visit_defined_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 ElseNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#244 + def visit_else_node(node); end + + # Copy a EmbeddedStatementsNode node # - # source://prism//prism/node.rb#12928 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#249 + def visit_embedded_statements_node(node); end - # attr_reader value: Node + # Copy a EmbeddedVariableNode node # - # source://prism//prism/node.rb#12856 - def value; end + # source://prism//lib/prism/mutation_compiler.rb#254 + def visit_embedded_variable_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//prism/node.rb#12938 - def type; end - end -end + # Copy a EnsureNode node + # + # source://prism//lib/prism/mutation_compiler.rb#259 + def visit_ensure_node(node); end -# Represents an optional parameter to a method, block, or lambda definition. -# -# def a(b = 1) -# ^^^^^ -# end -class Prism::OptionalParameterNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void + # Copy a FalseNode node # - # @return [OptionalParameterNode] a new instance of OptionalParameterNode + # source://prism//lib/prism/mutation_compiler.rb#264 + def visit_false_node(node); end + + # Copy a FindPatternNode node # - # source://prism//prism/node.rb#12962 - def initialize(name, name_loc, operator_loc, value, location); end + # source://prism//lib/prism/mutation_compiler.rb#269 + def visit_find_pattern_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a FlipFlopNode node # - # source://prism//prism/node.rb#12971 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#274 + def visit_flip_flop_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a FloatNode node # - # source://prism//prism/node.rb#12976 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#279 + def visit_float_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a ForNode node # - # source://prism//prism/node.rb#12986 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#284 + def visit_for_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a ForwardingArgumentsNode node # - # source://prism//prism/node.rb#12981 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#289 + def visit_forwarding_arguments_node(node); end - # def copy: (**params) -> OptionalParameterNode + # Copy a ForwardingParameterNode node # - # source://prism//prism/node.rb#12991 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#294 + def visit_forwarding_parameter_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a ForwardingSuperNode node # - # source://prism//prism/node.rb#12976 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#299 + def visit_forwarding_super_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a GlobalVariableAndWriteNode node # - # source://prism//prism/node.rb#13005 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#304 + def visit_global_variable_and_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a GlobalVariableOperatorWriteNode node # - # source://prism//prism/node.rb#13015 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#309 + def visit_global_variable_operator_write_node(node); end - # attr_reader name: Symbol + # Copy a GlobalVariableOrWriteNode node # - # source://prism//prism/node.rb#12950 - def name; end + # source://prism//lib/prism/mutation_compiler.rb#314 + def visit_global_variable_or_write_node(node); end - # attr_reader name_loc: Location + # Copy a GlobalVariableReadNode node # - # source://prism//prism/node.rb#12953 - def name_loc; end + # source://prism//lib/prism/mutation_compiler.rb#319 + def visit_global_variable_read_node(node); end - # def operator: () -> String + # Copy a GlobalVariableTargetNode node # - # source://prism//prism/node.rb#13010 - def operator; end + # source://prism//lib/prism/mutation_compiler.rb#324 + def visit_global_variable_target_node(node); end - # attr_reader operator_loc: Location + # Copy a GlobalVariableWriteNode node # - # source://prism//prism/node.rb#12956 - def operator_loc; end + # source://prism//lib/prism/mutation_compiler.rb#329 + def visit_global_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. + # Copy a HashNode 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#334 + def visit_hash_node(node); end + + # Copy a HashPatternNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#339 + def visit_hash_pattern_node(node); end + + # Copy a IfNode node # - # source://prism//prism/node.rb#13039 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#344 + def visit_if_node(node); end - # attr_reader value: Node + # Copy a ImaginaryNode node # - # source://prism//prism/node.rb#12959 - def value; end + # source://prism//lib/prism/mutation_compiler.rb#349 + def visit_imaginary_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//prism/node.rb#13049 - def type; end - end -end + # Copy a ImplicitNode node + # + # source://prism//lib/prism/mutation_compiler.rb#354 + def visit_implicit_node(node); end -# Represents the use of the `||` operator or the `or` keyword. -# -# left or right -# ^^^^^^^^^^^^^ -class Prism::OrNode < ::Prism::Node - # def initialize: (left: Node, right: Node, operator_loc: Location, location: Location) -> void + # Copy a ImplicitRestNode node # - # @return [OrNode] a new instance of OrNode + # source://prism//lib/prism/mutation_compiler.rb#359 + def visit_implicit_rest_node(node); end + + # Copy a InNode node # - # source://prism//prism/node.rb#13069 - def initialize(left, right, operator_loc, location); end + # source://prism//lib/prism/mutation_compiler.rb#364 + def visit_in_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a IndexAndWriteNode node # - # source://prism//prism/node.rb#13077 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#369 + def visit_index_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a IndexOperatorWriteNode node # - # source://prism//prism/node.rb#13082 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#374 + def visit_index_operator_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a IndexOrWriteNode node # - # source://prism//prism/node.rb#13092 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#379 + def visit_index_or_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a IndexTargetNode node # - # source://prism//prism/node.rb#13087 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#384 + def visit_index_target_node(node); end - # def copy: (**params) -> OrNode + # Copy a InstanceVariableAndWriteNode node # - # source://prism//prism/node.rb#13097 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#389 + def visit_instance_variable_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a InstanceVariableOperatorWriteNode node # - # source://prism//prism/node.rb#13082 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#394 + def visit_instance_variable_operator_write_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a InstanceVariableOrWriteNode node # - # source://prism//prism/node.rb#13110 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#399 + def visit_instance_variable_or_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a InstanceVariableReadNode node # - # source://prism//prism/node.rb#13120 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#404 + def visit_instance_variable_read_node(node); end - # attr_reader left: Node + # Copy a InstanceVariableTargetNode node # - # source://prism//prism/node.rb#13060 - def left; end + # source://prism//lib/prism/mutation_compiler.rb#409 + def visit_instance_variable_target_node(node); end - # def operator: () -> String + # Copy a InstanceVariableWriteNode node # - # source://prism//prism/node.rb#13115 - def operator; end + # source://prism//lib/prism/mutation_compiler.rb#414 + def visit_instance_variable_write_node(node); end - # attr_reader operator_loc: Location + # Copy a IntegerNode node # - # source://prism//prism/node.rb#13066 - def operator_loc; end + # source://prism//lib/prism/mutation_compiler.rb#419 + def visit_integer_node(node); end - # attr_reader right: Node + # Copy a InterpolatedMatchLastLineNode node # - # source://prism//prism/node.rb#13063 - def right; end + # source://prism//lib/prism/mutation_compiler.rb#424 + def visit_interpolated_match_last_line_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 InterpolatedRegularExpressionNode 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#429 + def visit_interpolated_regular_expression_node(node); end + + # Copy a InterpolatedStringNode node # - # def type: () -> Symbol + # source://prism//lib/prism/mutation_compiler.rb#434 + def visit_interpolated_string_node(node); end + + # Copy a InterpolatedSymbolNode node # - # source://prism//prism/node.rb#13144 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#439 + def visit_interpolated_symbol_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//prism/node.rb#13154 - def type; end - end -end + # Copy a InterpolatedXStringNode node + # + # source://prism//lib/prism/mutation_compiler.rb#444 + def visit_interpolated_x_string_node(node); end -# A parser for the pack template language. -module Prism::Pack - class << self - def parse(_arg0, _arg1, _arg2); end - end -end + # Copy a KeywordHashNode node + # + # source://prism//lib/prism/mutation_compiler.rb#449 + def visit_keyword_hash_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol) + # Copy a KeywordRestParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#454 + def visit_keyword_rest_parameter_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol) + # Copy a LambdaNode node + # + # source://prism//lib/prism/mutation_compiler.rb#459 + def visit_lambda_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::BER = T.let(T.unsafe(nil), Symbol) + # Copy a LocalVariableAndWriteNode node + # + # source://prism//lib/prism/mutation_compiler.rb#464 + def visit_local_variable_and_write_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol) - -# A directive in the pack template language. -class Prism::Pack::Directive - # Initialize a new directive with the given values. - # - # @return [Directive] a new instance of Directive + # Copy a LocalVariableOperatorWriteNode node # - # source://prism//prism/pack.rb#88 - def initialize(version, variant, source, type, signed, endian, size, length_type, length); end + # source://prism//lib/prism/mutation_compiler.rb#469 + def visit_local_variable_operator_write_node(node); end - # Provide a human-readable description of the directive. + # Copy a LocalVariableOrWriteNode node # - # source://prism//prism/pack.rb#130 - def describe; end + # source://prism//lib/prism/mutation_compiler.rb#474 + def visit_local_variable_or_write_node(node); end - # The type of endianness of the directive. + # Copy a LocalVariableReadNode node # - # source://prism//prism/pack.rb#76 - def endian; end + # source://prism//lib/prism/mutation_compiler.rb#479 + def visit_local_variable_read_node(node); end - # The length of this directive (used for integers). + # Copy a LocalVariableTargetNode node # - # source://prism//prism/pack.rb#85 - def length; end + # source://prism//lib/prism/mutation_compiler.rb#484 + def visit_local_variable_target_node(node); end - # The length type of this directive (used for integers). + # Copy a LocalVariableWriteNode node # - # source://prism//prism/pack.rb#82 - def length_type; end + # source://prism//lib/prism/mutation_compiler.rb#489 + def visit_local_variable_write_node(node); end - # The type of signedness of the directive. + # Copy a MatchLastLineNode node # - # source://prism//prism/pack.rb#73 - def signed; end + # source://prism//lib/prism/mutation_compiler.rb#494 + def visit_match_last_line_node(node); end - # The size of the directive. + # Copy a MatchPredicateNode node # - # source://prism//prism/pack.rb#79 - def size; end + # source://prism//lib/prism/mutation_compiler.rb#499 + def visit_match_predicate_node(node); end - # A byteslice of the source string that this directive represents. + # Copy a MatchRequiredNode node # - # source://prism//prism/pack.rb#67 - def source; end + # source://prism//lib/prism/mutation_compiler.rb#504 + def visit_match_required_node(node); end - # The type of the directive. + # Copy a MatchWriteNode node # - # source://prism//prism/pack.rb#70 - def type; end + # source://prism//lib/prism/mutation_compiler.rb#509 + def visit_match_write_node(node); end - # A symbol representing whether or not we are packing or unpacking. + # Copy a MissingNode node # - # source://prism//prism/pack.rb#64 - def variant; end + # source://prism//lib/prism/mutation_compiler.rb#514 + def visit_missing_node(node); end - # A symbol representing the version of Ruby. + # Copy a ModuleNode node # - # source://prism//prism/pack.rb#61 - def version; end -end - -# The descriptions of the various types of endianness. -# -# source://prism//prism/pack.rb#101 -Prism::Pack::Directive::ENDIAN_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) - -# The descriptions of the various types of signedness. -# -# source://prism//prism/pack.rb#110 -Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) - -# The descriptions of the various types of sizes. -# -# source://prism//prism/pack.rb#117 -Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) - -# source://prism//prism/pack.rb#55 -Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol) + # source://prism//lib/prism/mutation_compiler.rb#519 + def visit_module_node(node); end -# The result of parsing a pack template. -class Prism::Pack::Format - # Create a new Format with the given directives and encoding. - # - # @return [Format] a new instance of Format + # Copy a MultiTargetNode node # - # source://prism//prism/pack.rb#203 - def initialize(directives, encoding); end + # source://prism//lib/prism/mutation_compiler.rb#524 + def visit_multi_target_node(node); end - # Provide a human-readable description of the format. + # Copy a MultiWriteNode node # - # source://prism//prism/pack.rb#209 - def describe; end + # source://prism//lib/prism/mutation_compiler.rb#529 + def visit_multi_write_node(node); end - # A list of the directives in the template. + # Copy a NextNode node # - # source://prism//prism/pack.rb#197 - def directives; end + # source://prism//lib/prism/mutation_compiler.rb#534 + def visit_next_node(node); end - # The encoding of the template. + # Copy a NilNode node # - # source://prism//prism/pack.rb#200 - def encoding; end -end - -# source://prism//prism/pack.rb#55 -Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIGNED = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIGNED_NA = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol) - -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol) + # source://prism//lib/prism/mutation_compiler.rb#539 + def visit_nil_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol) + # Copy a NoKeywordsParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#544 + def visit_no_keywords_parameter_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol) + # Copy a NumberedParametersNode node + # + # source://prism//lib/prism/mutation_compiler.rb#549 + def visit_numbered_parameters_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol) + # Copy a NumberedReferenceReadNode node + # + # source://prism//lib/prism/mutation_compiler.rb#554 + def visit_numbered_reference_read_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol) + # Copy a OptionalKeywordParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#559 + def visit_optional_keyword_parameter_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol) + # Copy a OptionalParameterNode node + # + # source://prism//lib/prism/mutation_compiler.rb#564 + def visit_optional_parameter_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol) + # Copy a OrNode node + # + # source://prism//lib/prism/mutation_compiler.rb#569 + def visit_or_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol) + # Copy a ParametersNode node + # + # source://prism//lib/prism/mutation_compiler.rb#574 + def visit_parameters_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol) + # Copy a ParenthesesNode node + # + # source://prism//lib/prism/mutation_compiler.rb#579 + def visit_parentheses_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol) + # Copy a PinnedExpressionNode node + # + # source://prism//lib/prism/mutation_compiler.rb#584 + def visit_pinned_expression_node(node); end -# source://prism//prism/pack.rb#55 -Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) + # Copy a PinnedVariableNode node + # + # source://prism//lib/prism/mutation_compiler.rb#589 + def visit_pinned_variable_node(node); end -# Represents the list of parameters on a method, block, or lambda definition. -# -# def a(b, c, d) -# ^^^^^^^ -# end -class Prism::ParametersNode < ::Prism::Node - # def initialize: (requireds: Array[Node], optionals: Array[Node], rest: Node?, posts: Array[Node], keywords: Array[Node], keyword_rest: Node?, block: BlockParameterNode?, location: Location) -> void + # Copy a PostExecutionNode node # - # @return [ParametersNode] a new instance of ParametersNode + # source://prism//lib/prism/mutation_compiler.rb#594 + def visit_post_execution_node(node); end + + # Copy a PreExecutionNode node # - # source://prism//prism/node.rb#13187 - def initialize(requireds, optionals, rest, posts, keywords, keyword_rest, block, location); end + # source://prism//lib/prism/mutation_compiler.rb#599 + def visit_pre_execution_node(node); end - # def accept: (visitor: Visitor) -> void + # Copy a ProgramNode node # - # source://prism//prism/node.rb#13199 - def accept(visitor); end + # source://prism//lib/prism/mutation_compiler.rb#604 + def visit_program_node(node); end - # attr_reader block: BlockParameterNode? + # Copy a RangeNode node # - # source://prism//prism/node.rb#13184 - def block; end + # source://prism//lib/prism/mutation_compiler.rb#609 + def visit_range_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Copy a RationalNode node # - # source://prism//prism/node.rb#13204 - def child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#614 + def visit_rational_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Copy a RedoNode node # - # source://prism//prism/node.rb#13222 - def comment_targets; end + # source://prism//lib/prism/mutation_compiler.rb#619 + def visit_redo_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Copy a RegularExpressionNode node # - # source://prism//prism/node.rb#13209 - def compact_child_nodes; end + # source://prism//lib/prism/mutation_compiler.rb#624 + def visit_regular_expression_node(node); end - # def copy: (**params) -> ParametersNode + # Copy a RequiredKeywordParameterNode node # - # source://prism//prism/node.rb#13227 - def copy(**params); end + # source://prism//lib/prism/mutation_compiler.rb#629 + def visit_required_keyword_parameter_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Copy a RequiredParameterNode node # - # source://prism//prism/node.rb#13204 - def deconstruct; end + # source://prism//lib/prism/mutation_compiler.rb#634 + def visit_required_parameter_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Copy a RescueModifierNode node # - # source://prism//prism/node.rb#13244 - def deconstruct_keys(keys); end + # source://prism//lib/prism/mutation_compiler.rb#639 + def visit_rescue_modifier_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Copy a RescueNode node # - # source://prism//prism/node.rb#13249 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/mutation_compiler.rb#644 + def visit_rescue_node(node); end - # attr_reader keyword_rest: Node? + # Copy a RestParameterNode node # - # source://prism//prism/node.rb#13181 - def keyword_rest; end + # source://prism//lib/prism/mutation_compiler.rb#649 + def visit_rest_parameter_node(node); end - # attr_reader keywords: Array[Node] + # Copy a RetryNode node # - # source://prism//prism/node.rb#13178 - def keywords; end + # source://prism//lib/prism/mutation_compiler.rb#654 + def visit_retry_node(node); end - # attr_reader optionals: Array[Node] + # Copy a ReturnNode node # - # source://prism//prism/node.rb#13169 - def optionals; end + # source://prism//lib/prism/mutation_compiler.rb#659 + def visit_return_node(node); end - # attr_reader posts: Array[Node] + # Copy a SelfNode node # - # source://prism//prism/node.rb#13175 - def posts; end + # source://prism//lib/prism/mutation_compiler.rb#664 + def visit_self_node(node); end - # attr_reader requireds: Array[Node] + # Copy a SingletonClassNode node # - # source://prism//prism/node.rb#13166 - def requireds; end + # source://prism//lib/prism/mutation_compiler.rb#669 + def visit_singleton_class_node(node); end - # attr_reader rest: Node? + # Copy a SourceEncodingNode node # - # source://prism//prism/node.rb#13172 - def rest; end + # source://prism//lib/prism/mutation_compiler.rb#674 + def visit_source_encoding_node(node); end - # Mirrors the Method#parameters method. + # Copy a SourceFileNode node # - # source://prism//prism/node_ext.rb#149 - def signature; end + # 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#12572 +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#12580 + sig do + params( + arguments: T.nilable(Prism::ArgumentsNode), + keyword_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(arguments, keyword_loc, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#12587 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#12574 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#12592 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#12604 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#12597 + def compact_child_nodes; end + + # def copy: (**params) -> NextNode + # + # source://prism//lib/prism/node.rb#12609 + sig { params(params: T.untyped).returns(Prism::NextNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#12592 + sig { 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#12621 + 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 + # + # source://prism//lib/prism/node.rb#12631 + def inspect(inspector = T.unsafe(nil)); end + + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#12626 + sig { returns(String) } + def keyword; end + + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#12577 + 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 @@ -18320,7 +20939,7 @@ class Prism::ParametersNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13290 + # source://prism//lib/prism/node.rb#12657 def type; end class << self @@ -18331,92 +20950,76 @@ class Prism::ParametersNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13300 + # source://prism//lib/prism/node.rb#12667 def type; end end end -# Represents a parenthesized expression +# Represents the use of the `nil` keyword. # -# (10 + 34) -# ^^^^^^^^^ -class Prism::ParenthesesNode < ::Prism::Node - # def initialize: (body: Node?, opening_loc: Location, closing_loc: Location, location: Location) -> void +# nil +# ^^^ +# +# source://prism//lib/prism/node.rb#12676 +class Prism::NilNode < ::Prism::Node + # def initialize: (Location location) -> void # - # @return [ParenthesesNode] a new instance of ParenthesesNode + # @return [NilNode] a new instance of NilNode # - # source://prism//prism/node.rb#13320 - def initialize(body, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#12678 + sig { params(location: Prism::Location).void } + def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#13328 + # source://prism//lib/prism/node.rb#12683 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader body: Node? - # - # source://prism//prism/node.rb#13311 - def body; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13337 + # source://prism//lib/prism/node.rb#12688 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#13377 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#13317 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#13349 + # source://prism//lib/prism/node.rb#12698 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#13342 + # source://prism//lib/prism/node.rb#12693 def compact_child_nodes; end - # def copy: (**params) -> ParenthesesNode + # def copy: (**params) -> NilNode # - # source://prism//prism/node.rb#13354 + # source://prism//lib/prism/node.rb#12703 + sig { params(params: T.untyped).returns(Prism::NilNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13337 + # source://prism//lib/prism/node.rb#12688 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#13367 + # source://prism//lib/prism/node.rb#12713 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#13382 + # source://prism//lib/prism/node.rb#12718 def inspect(inspector = T.unsafe(nil)); end - # def opening: () -> String - # - # source://prism//prism/node.rb#13372 - def opening; end - - # attr_reader opening_loc: Location - # - # source://prism//prism/node.rb#13314 - def opening_loc; end - - # source://prism//prism/node.rb#13332 - 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 @@ -18432,7 +21035,7 @@ class Prism::ParenthesesNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13409 + # source://prism//lib/prism/node.rb#12737 def type; end class << self @@ -18443,535 +21046,466 @@ class Prism::ParenthesesNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13419 + # source://prism//lib/prism/node.rb#12747 def type; end end end -# This represents an error that was encountered during parsing. -class Prism::ParseError - # Create a new error object with the given message and location. - # - # @return [ParseError] a new instance of ParseError - # - # source://prism//prism/parse_result.rb#316 - def initialize(message, location); end - - # Implement the hash pattern matching interface for ParseError. +# Represents the use of `**nil` inside method arguments. +# +# def a(**nil) +# ^^^^^ +# end +# +# source://prism//lib/prism/node.rb#12757 +class Prism::NoKeywordsParameterNode < ::Prism::Node + # def initialize: (Location operator_loc, Location keyword_loc, Location location) -> void # - # source://prism//prism/parse_result.rb#322 - def deconstruct_keys(keys); end - - # Returns a string representation of this error. + # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode # - # source://prism//prism/parse_result.rb#327 - def inspect; end + # source://prism//lib/prism/node.rb#12765 + sig { params(operator_loc: Prism::Location, keyword_loc: Prism::Location, location: Prism::Location).void } + def initialize(operator_loc, keyword_loc, location); end - # A Location object representing the location of this error in the source. + # def accept: (Visitor visitor) -> void # - # source://prism//prism/parse_result.rb#313 - def location; end + # source://prism//lib/prism/node.rb#12772 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # The message associated with this error. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/parse_result.rb#310 - def message; end -end + # source://prism//lib/prism/node.rb#12777 + sig { 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. -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//prism/parse_result.rb#387 - def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end + # source://prism//lib/prism/node.rb#12787 + def comment_targets; end - # Attach the list of comments to their respective locations in the tree. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/parse_result/comments.rb#173 - def attach_comments!; end + # source://prism//lib/prism/node.rb#12782 + def compact_child_nodes; end - # The list of comments that were encountered during parsing. + # def copy: (**params) -> NoKeywordsParameterNode # - # source://prism//prism/parse_result.rb#367 - def comments; end + # source://prism//lib/prism/node.rb#12792 + sig { params(params: T.untyped).returns(Prism::NoKeywordsParameterNode) } + def copy(**params); end - # An optional location that represents the location of the content after the - # __END__ marker. 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//prism/parse_result.rb#375 - def data_loc; end + # source://prism//lib/prism/node.rb#12777 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Implement the hash pattern matching interface for ParseResult. + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, keyword_loc: Location, location: Location } # - # source://prism//prism/parse_result.rb#398 + # source://prism//lib/prism/node.rb#12804 + 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 - # The list of errors that were generated during parsing. + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/parse_result.rb#378 - def errors; end + # source://prism//lib/prism/node.rb#12819 + def inspect(inspector = T.unsafe(nil)); end - # Returns true if there were errors during parsing and false if there were - # not. - # - # @return [Boolean] + # def keyword: () -> String # - # source://prism//prism/parse_result.rb#410 - def failure?; end + # source://prism//lib/prism/node.rb#12814 + sig { returns(String) } + def keyword; end - # The list of magic comments that were encountered during parsing. + # attr_reader keyword_loc: Location # - # source://prism//prism/parse_result.rb#370 - def magic_comments; end + # source://prism//lib/prism/node.rb#12762 + sig { returns(Prism::Location) } + def keyword_loc; end - # Walk the tree and mark nodes that are on a new line. + # def operator: () -> String # - # source://prism//prism/parse_result/newlines.rb#60 - def mark_newlines!; end + # source://prism//lib/prism/node.rb#12809 + sig { returns(String) } + def operator; end - # A Source instance that represents the source code that was parsed. + # attr_reader operator_loc: Location # - # source://prism//prism/parse_result.rb#384 - def source; end + # source://prism//lib/prism/node.rb#12759 + sig { returns(Prism::Location) } + def operator_loc; end - # Returns true if there were no errors during parsing and false if there - # were. - # - # @return [Boolean] + # 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//prism/parse_result.rb#404 - 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. + # 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//prism/parse_result.rb#364 - def value; end - - # The list of warnings that were generated during parsing. + # def type: () -> Symbol # - # source://prism//prism/parse_result.rb#381 - def warnings; end -end + # source://prism//lib/prism/node.rb#12840 + def type; 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. + 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#12850 + def type; end + end +end + +# This represents a node in the tree. It is the parent class of all of the +# various node types. # -# 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. -class Prism::ParseResult::Comments - # Create a new Comments object that will attach comments to the given - # parse result. +# source://prism//lib/prism/node.rb#11 +class Prism::Node + # Accepts a visitor and calls back into the specialized visit function. # - # @return [Comments] a new instance of Comments + # @raise [NoMethodError] # - # source://prism//prism/parse_result/comments.rb#78 - def initialize(parse_result); end + # source://prism//lib/prism/node.rb#55 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # Attach the comments to their respective locations in the tree by - # mutating the parse result. + # Returns an array of child nodes, including `nil`s in the place of optional + # nodes that were not present. # - # source://prism//prism/parse_result/comments.rb#84 - def attach!; end - - # The parse result that we are attaching comments to. + # @raise [NoMethodError] # - # source://prism//prism/parse_result/comments.rb#74 - def parse_result; end - - private + # source://prism//lib/prism/node.rb#61 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # Responsible for finding the nearest targets to the given comment within - # the context of the given encapsulating node. + # Returns an array of child nodes and locations that could potentially have + # comments attached to them. # - # source://prism//prism/parse_result/comments.rb#103 - 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. -class Prism::ParseResult::Comments::LocationTarget - # @return [LocationTarget] a new instance of LocationTarget + # @raise [NoMethodError] # - # source://prism//prism/parse_result/comments.rb#52 - def initialize(location); end - - # source://prism//prism/parse_result/comments.rb#68 - def <<(comment); end + # source://prism//lib/prism/node.rb#75 + def comment_targets; end - # @return [Boolean] + # Returns an array of child nodes, excluding any `nil`s in the place of + # optional nodes that were not present. # - # source://prism//prism/parse_result/comments.rb#64 - def encloses?(comment); end + # @raise [NoMethodError] + # + # source://prism//lib/prism/node.rb#69 + sig { returns(T::Array[Prism::Node]) } + def compact_child_nodes; end - # source://prism//prism/parse_result/comments.rb#60 - def end_offset; 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#61 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/parse_result/comments.rb#50 + # A Location instance that represents the location of this node in the + # source. + # + # source://prism//lib/prism/node.rb#14 + sig { returns(Prism::Location) } def location; end - # source://prism//prism/parse_result/comments.rb#56 - def start_offset; end -end - -# A target for attaching comments that is based on a specific node's -# location. -class Prism::ParseResult::Comments::NodeTarget - # @return [NodeTarget] a new instance of NodeTarget + # @return [Boolean] # - # source://prism//prism/parse_result/comments.rb#25 - def initialize(node); end - - # source://prism//prism/parse_result/comments.rb#42 - def <<(comment); end + # source://prism//lib/prism/node.rb#16 + def newline?; end - # @return [Boolean] + # Similar to inspect, but respects the current level of indentation given by + # the pretty print object. # - # source://prism//prism/parse_result/comments.rb#37 - def encloses?(comment); end + # source://prism//lib/prism/node.rb#35 + def pretty_print(q); end - # source://prism//prism/parse_result/comments.rb#33 - def end_offset; end + # source://prism//lib/prism/node.rb#20 + def set_newline_flag(newline_marked); end - # source://prism//prism/parse_result/comments.rb#23 - def node; end + # Slice the location of the node from the source. + # + # source://prism//lib/prism/node.rb#29 + sig { returns(String) } + def slice; end - # source://prism//prism/parse_result/comments.rb#29 - def start_offset; end -end + # Convert this node into a graphviz dot graph string. + # + # source://prism//lib/prism/node.rb#43 + sig { returns(String) } + def to_dot; 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. -class Prism::ParseResult::Newlines < ::Prism::Visitor - # Create a new Newlines visitor with the given newline offsets. + # Returns a symbol symbolizing the type of node that this represents. This + # is particularly useful for case statements and array comparisons. # - # @return [Newlines] a new instance of Newlines + # @raise [NoMethodError] # - # source://prism//prism/parse_result/newlines.rb#22 - def initialize(newline_marked); end + # source://prism//lib/prism/node.rb#81 + sig { returns(Symbol) } + def type; end +end - # Permit block/lambda nodes to mark newlines within themselves. +# This object is responsible for generating the output for the inspect method +# implementations of child nodes. +# +# source://prism//lib/prism/node_inspector.rb#6 +class Prism::NodeInspector + # @return [NodeInspector] a new instance of NodeInspector # - # source://prism//prism/parse_result/newlines.rb#27 - def visit_block_node(node); end + # source://prism//lib/prism/node_inspector.rb#9 + def initialize(prefix = T.unsafe(nil)); end - # Mark if/unless nodes as newlines. + # Appends a line to the output with the current prefix. # - # source://prism//prism/parse_result/newlines.rb#41 - def visit_if_node(node); end + # source://prism//lib/prism/node_inspector.rb#15 + sig { params(line: String).void } + def <<(line); end - # Permit block/lambda nodes to mark newlines within themselves. + # Returns a new inspector that can be used to inspect a child node. # - # source://prism//prism/parse_result/newlines.rb#27 - def visit_lambda_node(node); end + # source://prism//lib/prism/node_inspector.rb#59 + sig { params(append: String).returns(Prism::NodeInspector) } + def child_inspector(append); end - # Permit statements lists to mark newlines within themselves. + # Generates a string that represents a child node. # - # source://prism//prism/parse_result/newlines.rb#49 - def visit_statements_node(node); end + # source://prism//lib/prism/node_inspector.rb#54 + sig { params(node: Prism::Node, append: String).returns(String) } + def child_node(node, append); end - # Mark if/unless nodes as newlines. + # This generates a string that is used as the header of the inspect output + # for any given node. # - # source://prism//prism/parse_result/newlines.rb#41 - def visit_unless_node(node); end -end + # 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 -# This represents a warning that was encountered during parsing. -class Prism::ParseWarning - # Create a new warning object with the given message and location. - # - # @return [ParseWarning] a new instance of ParseWarning + # Generates a string that represents a list of nodes. It handles properly + # using the box drawing characters to make the output look nice. # - # source://prism//prism/parse_result.rb#341 - def initialize(message, location); end + # 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 - # Implement the hash pattern matching interface for ParseWarning. + # Generates a string that represents a location field on a node. # - # source://prism//prism/parse_result.rb#347 - def deconstruct_keys(keys); end + # source://prism//lib/prism/node_inspector.rb#45 + sig { params(value: Prism::Location).returns(String) } + def location(value); end - # Returns a string representation of this warning. - # - # source://prism//prism/parse_result.rb#352 - def inspect; end + # source://prism//lib/prism/node_inspector.rb#7 + sig { returns(String) } + def output; end - # A Location object representing the location of this warning in the source. - # - # source://prism//prism/parse_result.rb#338 - def location; end + # source://prism//lib/prism/node_inspector.rb#7 + sig { returns(String) } + def prefix; end - # The message associated with this warning. + # Returns the output as a string. # - # source://prism//prism/parse_result.rb#335 - def message; end + # source://prism//lib/prism/node_inspector.rb#64 + sig { returns(String) } + def to_str; 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. +# Represents an implicit set of parameters through the use of numbered parameters within a block or lambda. # -# 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 +# -> { _1 + _2 } +# ^^^^^^^^^^^^^^ # -# 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. -class Prism::Pattern - # Create a new pattern with the given query. The query should be a string - # containing a Ruby pattern matching expression. +# source://prism//lib/prism/node.rb#12859 +class Prism::NumberedParametersNode < ::Prism::Node + # def initialize: (Integer maximum, Location location) -> void # - # @return [Pattern] a new instance of Pattern + # @return [NumberedParametersNode] a new instance of NumberedParametersNode # - # source://prism//prism/pattern.rb#63 - def initialize(query); end + # source://prism//lib/prism/node.rb#12864 + sig { params(maximum: Integer, location: Prism::Location).void } + def initialize(maximum, location); end - # Compile the query into a callable object that can be used to match against - # nodes. + # def accept: (Visitor visitor) -> void # - # source://prism//prism/pattern.rb#70 - def compile; end + # source://prism//lib/prism/node.rb#12870 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # The query that this pattern was initialized with. + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/pattern.rb#59 - def query; end + # source://prism//lib/prism/node.rb#12875 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; 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. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/pattern.rb#79 - def scan(root); end - - private + # source://prism//lib/prism/node.rb#12885 + def comment_targets; end - # Shortcut for combining two procs into one that returns true if both return - # true. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/pattern.rb#95 - def combine_and(left, right); end + # source://prism//lib/prism/node.rb#12880 + def compact_child_nodes; end - # Shortcut for combining two procs into one that returns true if either - # returns true. + # def copy: (**params) -> NumberedParametersNode # - # source://prism//prism/pattern.rb#101 - def combine_or(left, right); end + # source://prism//lib/prism/node.rb#12890 + sig { params(params: T.untyped).returns(Prism::NumberedParametersNode) } + def copy(**params); end - # in foo | bar + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/pattern.rb#136 - def compile_alternation_pattern_node(node); end + # source://prism//lib/prism/node.rb#12875 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # in [foo, bar, baz] + # def deconstruct_keys: (Array[Symbol] keys) -> { maximum: Integer, location: Location } # - # source://prism//prism/pattern.rb#111 - def compile_array_pattern_node(node); end + # source://prism//lib/prism/node.rb#12901 + 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 - # in Prism::ConstantReadNode + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/pattern.rb#141 - def compile_constant_path_node(node); end + # source://prism//lib/prism/node.rb#12906 + def inspect(inspector = T.unsafe(nil)); end - # in ConstantReadNode - # in String + # attr_reader maximum: Integer # - # source://prism//prism/pattern.rb#153 - def compile_constant_read_node(node); end + # source://prism//lib/prism/node.rb#12861 + sig { returns(Integer) } + def maximum; end - # Raise an error because the given node is not supported. - # - # @raise [CompilationError] - # - # source://prism//prism/pattern.rb#106 - def compile_error(node); end - - # in InstanceVariableReadNode[name: Symbol] - # in { name: Symbol } - # - # source://prism//prism/pattern.rb#171 - def compile_hash_pattern_node(node); end - - # in nil - # - # source://prism//prism/pattern.rb#196 - 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//prism/pattern.rb#225 - def compile_node(node); end - - # in /foo/ + # 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//prism/pattern.rb#201 - def compile_regular_expression_node(node); end - - # in "" - # in "foo" + # 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//prism/pattern.rb#209 - def compile_string_node(node); end - - # in :+ - # in :foo + # def type: () -> Symbol # - # source://prism//prism/pattern.rb#217 - def compile_symbol_node(node); end -end + # source://prism//lib/prism/node.rb#12926 + def type; end -# Raised when the query given to a pattern is either invalid Ruby syntax or -# is using syntax that we don't yet support. -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//prism/pattern.rb#43 - def initialize(repr); 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#12936 + def type; end + end end -# Represents the use of the `^` operator for pinning an expression in a -# pattern matching expression. +# Represents reading a numbered reference to a capture in the previous match. # -# foo in ^(bar) -# ^^^^^^ -class Prism::PinnedExpressionNode < ::Prism::Node - # def initialize: (expression: Node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location) -> void +# $1 +# ^^ +# +# source://prism//lib/prism/node.rb#12945 +class Prism::NumberedReferenceReadNode < ::Prism::Node + # def initialize: (Integer number, Location location) -> void # - # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode + # @return [NumberedReferenceReadNode] a new instance of NumberedReferenceReadNode # - # source://prism//prism/node.rb#13443 - def initialize(expression, operator_loc, lparen_loc, rparen_loc, location); end + # source://prism//lib/prism/node.rb#12956 + sig { params(number: Integer, location: Prism::Location).void } + def initialize(number, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#13452 + # source://prism//lib/prism/node.rb#12962 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13457 + # source://prism//lib/prism/node.rb#12967 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#13467 + # source://prism//lib/prism/node.rb#12977 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#13462 + # source://prism//lib/prism/node.rb#12972 def compact_child_nodes; end - # def copy: (**params) -> PinnedExpressionNode + # def copy: (**params) -> NumberedReferenceReadNode # - # source://prism//prism/node.rb#13472 + # source://prism//lib/prism/node.rb#12982 + sig { params(params: T.untyped).returns(Prism::NumberedReferenceReadNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13457 + # source://prism//lib/prism/node.rb#12967 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { number: Integer, location: Location } # - # source://prism//prism/node.rb#13486 + # source://prism//lib/prism/node.rb#12993 + 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 - # attr_reader expression: Node - # - # source://prism//prism/node.rb#13431 - def expression; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#13506 + # source://prism//lib/prism/node.rb#12998 def inspect(inspector = T.unsafe(nil)); end - # def lparen: () -> String - # - # source://prism//prism/node.rb#13496 - def lparen; end - - # attr_reader lparen_loc: Location - # - # source://prism//prism/node.rb#13437 - def lparen_loc; end - - # def operator: () -> String + # 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`. # - # source://prism//prism/node.rb#13491 - def operator; end - - # attr_reader operator_loc: Location + # $1 # number `1` # - # source://prism//prism/node.rb#13434 - def operator_loc; end - - # def rparen: () -> String + # $5432 # number `5432` # - # source://prism//prism/node.rb#13501 - def rparen; end - - # attr_reader rparen_loc: Location + # $4294967296 # number `4294967295` # - # source://prism//prism/node.rb#13440 - def rparen_loc; end + # source://prism//lib/prism/node.rb#12953 + 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 @@ -18988,7 +21522,7 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13530 + # source://prism//lib/prism/node.rb#13018 def type; end class << self @@ -18999,74 +21533,104 @@ class Prism::PinnedExpressionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13540 + # source://prism//lib/prism/node.rb#13028 def type; end end end -# Represents the use of the `^` operator for pinning a variable in a pattern -# matching expression. +# Represents an optional keyword parameter to a method, block, or lambda definition. # -# foo in ^bar -# ^^^^ -class Prism::PinnedVariableNode < ::Prism::Node - # def initialize: (variable: Node, operator_loc: Location, location: Location) -> void +# def a(b: 1) +# ^^^^ +# end +# +# source://prism//lib/prism/node.rb#13038 +class Prism::OptionalKeywordParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Node value, Location location) -> void # - # @return [PinnedVariableNode] a new instance of PinnedVariableNode + # @return [OptionalKeywordParameterNode] a new instance of OptionalKeywordParameterNode # - # source://prism//prism/node.rb#13558 - def initialize(variable, operator_loc, location); end + # source://prism//lib/prism/node.rb#13052 + sig do + params( + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(flags, name, name_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#13565 + # source://prism//lib/prism/node.rb#13061 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13570 + # source://prism//lib/prism/node.rb#13066 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#13580 + # source://prism//lib/prism/node.rb#13076 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#13575 + # source://prism//lib/prism/node.rb#13071 def compact_child_nodes; end - # def copy: (**params) -> PinnedVariableNode + # def copy: (**params) -> OptionalKeywordParameterNode # - # source://prism//prism/node.rb#13585 + # source://prism//lib/prism/node.rb#13081 + sig { params(params: T.untyped).returns(Prism::OptionalKeywordParameterNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13570 + # source://prism//lib/prism/node.rb#13066 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#13597 + # source://prism//lib/prism/node.rb#13095 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#13607 + # source://prism//lib/prism/node.rb#13105 def inspect(inspector = T.unsafe(nil)); end - # def operator: () -> String + # attr_reader name: Symbol # - # source://prism//prism/node.rb#13602 - def operator; end + # source://prism//lib/prism/node.rb#13043 + sig { returns(Symbol) } + def name; end - # attr_reader operator_loc: Location + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#13555 - def operator_loc; end + # source://prism//lib/prism/node.rb#13046 + sig { returns(Prism::Location) } + def name_loc; end + + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#13100 + 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 @@ -19083,13 +21647,22 @@ class Prism::PinnedVariableNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13629 + # source://prism//lib/prism/node.rb#13130 def type; end - # attr_reader variable: Node + # attr_reader value: Node # - # source://prism//prism/node.rb#13552 - def variable; end + # source://prism//lib/prism/node.rb#13049 + sig { returns(Prism::Node) } + def value; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#13040 + sig { returns(Integer) } + def flags; end class << self # Similar to #type, this method returns a symbol that you can use for @@ -19099,98 +21672,117 @@ class Prism::PinnedVariableNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13639 + # source://prism//lib/prism/node.rb#13140 def type; end end end -# Represents the use of the `END` keyword. +# Represents an optional parameter to a method, block, or lambda definition. # -# END { foo } -# ^^^^^^^^^^^ -class Prism::PostExecutionNode < ::Prism::Node - # def initialize: (statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location) -> void +# def a(b = 1) +# ^^^^^ +# end +# +# source://prism//lib/prism/node.rb#13150 +class Prism::OptionalParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Location operator_loc, Node value, Location location) -> void # - # @return [PostExecutionNode] a new instance of PostExecutionNode + # @return [OptionalParameterNode] a new instance of OptionalParameterNode # - # source://prism//prism/node.rb#13662 - def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#13167 + sig do + params( + flags: Integer, + name: Symbol, + name_loc: Prism::Location, + operator_loc: Prism::Location, + value: Prism::Node, + location: Prism::Location + ).void + end + def initialize(flags, name, name_loc, operator_loc, value, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#13671 + # source://prism//lib/prism/node.rb#13177 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13676 + # source://prism//lib/prism/node.rb#13182 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#13722 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#13659 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#13688 + # source://prism//lib/prism/node.rb#13192 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#13681 + # source://prism//lib/prism/node.rb#13187 def compact_child_nodes; end - # def copy: (**params) -> PostExecutionNode + # def copy: (**params) -> OptionalParameterNode # - # source://prism//prism/node.rb#13693 + # source://prism//lib/prism/node.rb#13197 + sig { params(params: T.untyped).returns(Prism::OptionalParameterNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13676 + # source://prism//lib/prism/node.rb#13182 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location } # - # source://prism//prism/node.rb#13707 + # source://prism//lib/prism/node.rb#13212 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#13727 + # source://prism//lib/prism/node.rb#13227 def inspect(inspector = T.unsafe(nil)); end - # def keyword: () -> String + # attr_reader name: Symbol # - # source://prism//prism/node.rb#13712 - def keyword; end + # source://prism//lib/prism/node.rb#13155 + sig { returns(Symbol) } + def name; end - # attr_reader keyword_loc: Location + # attr_reader name_loc: Location # - # source://prism//prism/node.rb#13653 - def keyword_loc; end + # source://prism//lib/prism/node.rb#13158 + sig { returns(Prism::Location) } + def name_loc; end - # def opening: () -> String + # def operator: () -> String # - # source://prism//prism/node.rb#13717 - def opening; end + # source://prism//lib/prism/node.rb#13222 + sig { returns(String) } + def operator; end - # attr_reader opening_loc: Location + # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#13656 - def opening_loc; end + # source://prism//lib/prism/node.rb#13161 + sig { returns(Prism::Location) } + def operator_loc; end - # attr_reader statements: StatementsNode? + # def repeated_parameter?: () -> bool # - # source://prism//prism/node.rb#13650 - def statements; end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#13217 + 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 @@ -19207,9 +21799,23 @@ class Prism::PostExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13755 + # source://prism//lib/prism/node.rb#13253 def type; end + # attr_reader value: Node + # + # source://prism//lib/prism/node.rb#13164 + sig { returns(Prism::Node) } + def value; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#13152 + 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. @@ -19218,98 +21824,114 @@ class Prism::PostExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13765 + # source://prism//lib/prism/node.rb#13263 def type; end end end -# Represents the use of the `BEGIN` keyword. +# Represents the use of the `||` operator or the `or` keyword. # -# BEGIN { foo } +# left or right # ^^^^^^^^^^^^^ -class Prism::PreExecutionNode < ::Prism::Node - # def initialize: (statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location) -> void +# +# source://prism//lib/prism/node.rb#13272 +class Prism::OrNode < ::Prism::Node + # def initialize: (Node left, Node right, Location operator_loc, Location location) -> void # - # @return [PreExecutionNode] a new instance of PreExecutionNode + # @return [OrNode] a new instance of OrNode # - # source://prism//prism/node.rb#13788 - def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end + # source://prism//lib/prism/node.rb#13298 + sig { params(left: Prism::Node, right: Prism::Node, operator_loc: Prism::Location, location: Prism::Location).void } + def initialize(left, right, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#13797 + # source://prism//lib/prism/node.rb#13306 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13802 + # source://prism//lib/prism/node.rb#13311 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end - # def closing: () -> String - # - # source://prism//prism/node.rb#13848 - def closing; end - - # attr_reader closing_loc: Location - # - # source://prism//prism/node.rb#13785 - def closing_loc; end - # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#13814 + # source://prism//lib/prism/node.rb#13321 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#13807 + # source://prism//lib/prism/node.rb#13316 def compact_child_nodes; end - # def copy: (**params) -> PreExecutionNode + # def copy: (**params) -> OrNode # - # source://prism//prism/node.rb#13819 + # source://prism//lib/prism/node.rb#13326 + sig { params(params: T.untyped).returns(Prism::OrNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#13802 + # source://prism//lib/prism/node.rb#13311 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { left: Node, right: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#13833 + # source://prism//lib/prism/node.rb#13339 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#13853 + # source://prism//lib/prism/node.rb#13349 def inspect(inspector = T.unsafe(nil)); end - # def keyword: () -> String + # 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). # - # source://prism//prism/node.rb#13838 - def keyword; end - - # attr_reader keyword_loc: Location + # left or right + # ^^^^ # - # source://prism//prism/node.rb#13779 - def keyword_loc; end + # 1 || 2 + # ^ + # + # source://prism//lib/prism/node.rb#13280 + sig { returns(Prism::Node) } + def left; end - # def opening: () -> String + # def operator: () -> String # - # source://prism//prism/node.rb#13843 - def opening; end + # source://prism//lib/prism/node.rb#13344 + sig { returns(String) } + def operator; end - # attr_reader opening_loc: Location + # The location of the `or` keyword or the `||` operator. # - # source://prism//prism/node.rb#13782 - def opening_loc; end + # left or right + # ^^ + # + # source://prism//lib/prism/node.rb#13295 + sig { returns(Prism::Location) } + def operator_loc; end - # attr_reader statements: StatementsNode? + # 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). # - # source://prism//prism/node.rb#13776 - def statements; end + # left || right + # ^^^^^ + # + # 1 or 2 + # ^ + # + # source://prism//lib/prism/node.rb#13289 + 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 @@ -19326,7 +21948,7 @@ class Prism::PreExecutionNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#13881 + # source://prism//lib/prism/node.rb#13373 def type; end class << self @@ -19337,192 +21959,386 @@ class Prism::PreExecutionNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#13891 + # source://prism//lib/prism/node.rb#13383 def type; end end end -# The top level node of any parse tree. -class Prism::ProgramNode < ::Prism::Node - # def initialize: (locals: Array[Symbol], statements: StatementsNode, location: Location) -> void - # - # @return [ProgramNode] a new instance of ProgramNode - # - # source://prism//prism/node.rb#13905 - def initialize(locals, statements, location); 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 - # def accept: (visitor: Visitor) -> void - # - # source://prism//prism/node.rb#13912 - def accept(visitor); end +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol) - # def child_nodes: () -> Array[nil | Node] - # - # source://prism//prism/node.rb#13917 - def child_nodes; end +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol) - # def comment_targets: () -> Array[Node | Location] - # - # source://prism//prism/node.rb#13927 - def comment_targets; end +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::BER = T.let(T.unsafe(nil), Symbol) - # def compact_child_nodes: () -> Array[Node] - # - # source://prism//prism/node.rb#13922 - def compact_child_nodes; end +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::BIG_ENDIAN = T.let(T.unsafe(nil), Symbol) - # def copy: (**params) -> ProgramNode +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::COMMENT = T.let(T.unsafe(nil), Symbol) + +# 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. # - # source://prism//prism/node.rb#13932 - def copy(**params); end + # @return [Directive] a new instance of Directive + # + # source://prism//lib/prism/pack.rb#88 + def initialize(version, variant, source, type, signed, endian, size, length_type, length); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Provide a human-readable description of the directive. # - # source://prism//prism/node.rb#13917 - def deconstruct; end + # source://prism//lib/prism/pack.rb#130 + def describe; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # The type of endianness of the directive. # - # source://prism//prism/node.rb#13944 - def deconstruct_keys(keys); end + # source://prism//lib/prism/pack.rb#76 + def endian; end - # def inspect(inspector: NodeInspector) -> String + # The length of this directive (used for integers). # - # source://prism//prism/node.rb#13949 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/pack.rb#85 + def length; end - # attr_reader locals: Array[Symbol] + # The length type of this directive (used for integers). # - # source://prism//prism/node.rb#13899 - def locals; end + # source://prism//lib/prism/pack.rb#82 + def length_type; end - # attr_reader statements: StatementsNode + # The type of signedness of the directive. # - # source://prism//prism/node.rb#13902 - def statements; end + # source://prism//lib/prism/pack.rb#73 + def signed; 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 size of the directive. # - # 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/pack.rb#79 + def size; end + + # A byteslice of the source string that this directive represents. # - # def type: () -> Symbol + # source://prism//lib/prism/pack.rb#67 + def source; end + + # The type of the directive. # - # source://prism//prism/node.rb#13971 + # source://prism//lib/prism/pack.rb#70 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//prism/node.rb#13981 - def type; end - end + # A symbol representing whether or not we are packing or unpacking. + # + # source://prism//lib/prism/pack.rb#64 + def variant; end + + # A symbol representing the version of Ruby. + # + # source://prism//lib/prism/pack.rb#61 + def version; end end -# Flags for range and flip-flop nodes. -module Prism::RangeFlags; 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) -# ... operator +# The descriptions of the various types of signedness. # -# source://prism//prism/node.rb#17339 -Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) +# source://prism//lib/prism/pack.rb#110 +Prism::Pack::Directive::SIGNED_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) -# Represents the use of the `..` or `...` operators. +# The descriptions of the various types of sizes. # -# 1..2 -# ^^^^ +# source://prism//lib/prism/pack.rb#117 +Prism::Pack::Directive::SIZE_DESCRIPTIONS = T.let(T.unsafe(nil), Hash) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::ENDIAN_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::FLOAT = T.let(T.unsafe(nil), Symbol) + +# The result of parsing a pack template. # -# c if a =~ /left/ ... b =~ /right/ -# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -class Prism::RangeNode < ::Prism::Node - # def initialize: (flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location) -> void +# source://prism//lib/prism/pack.rb#195 +class Prism::Pack::Format + # Create a new Format with the given directives and encoding. # - # @return [RangeNode] a new instance of RangeNode + # @return [Format] a new instance of Format # - # source://prism//prism/node.rb#14007 - def initialize(flags, left, right, operator_loc, location); end + # source://prism//lib/prism/pack.rb#203 + def initialize(directives, encoding); end + + # Provide a human-readable description of the format. + # + # source://prism//lib/prism/pack.rb#209 + def describe; end + + # A list of the directives in the template. + # + # source://prism//lib/prism/pack.rb#197 + def directives; end + + # The encoding of the template. + # + # source://prism//lib/prism/pack.rb#200 + def encoding; end +end + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::INTEGER = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::LENGTH_FIXED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::LENGTH_MAX = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::LENGTH_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::LENGTH_RELATIVE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::LITTLE_ENDIAN = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::MOVE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::NATIVE_ENDIAN = T.let(T.unsafe(nil), Symbol) - # def accept: (visitor: Visitor) -> void +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::NULL = T.let(T.unsafe(nil), Symbol) + +# 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) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_16 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_32 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_64 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_8 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_INT = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_LONG = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_LONG_LONG = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_NA = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_P = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SIZE_SHORT = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::SPACE = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_BASE64 = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_FIXED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_HEX_HIGH = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_HEX_LOW = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol) + +# source://prism//lib/prism/pack.rb#55 +Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol) + +# Flags for parameter nodes. +# +# source://prism//lib/prism/node.rb#17614 +module Prism::ParameterFlags; end + +# a parameter name that has been repeated in the method signature +# +# source://prism//lib/prism/node.rb#17616 +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#13393 +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 + # + # @return [ParametersNode] a new instance of ParametersNode + # + # source://prism//lib/prism/node.rb#13416 + sig do + params( + requireds: T::Array[Prism::Node], + optionals: T::Array[Prism::Node], + rest: T.nilable(Prism::Node), + posts: T::Array[Prism::Node], + keywords: T::Array[Prism::Node], + keyword_rest: T.nilable(Prism::Node), + block: T.nilable(Prism::BlockParameterNode), + location: Prism::Location + ).void + end + def initialize(requireds, optionals, rest, posts, keywords, keyword_rest, block, location); end + + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14016 + # source://prism//lib/prism/node.rb#13428 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # attr_reader block: BlockParameterNode? + # + # source://prism//lib/prism/node.rb#13413 + sig { returns(T.nilable(Prism::BlockParameterNode)) } + def block; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14021 + # source://prism//lib/prism/node.rb#13433 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14034 + # source://prism//lib/prism/node.rb#13451 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14026 + # source://prism//lib/prism/node.rb#13438 def compact_child_nodes; end - # def copy: (**params) -> RangeNode + # def copy: (**params) -> ParametersNode # - # source://prism//prism/node.rb#14039 + # source://prism//lib/prism/node.rb#13456 + sig { params(params: T.untyped).returns(Prism::ParametersNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14021 + # source://prism//lib/prism/node.rb#13433 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#14053 + # source://prism//lib/prism/node.rb#13473 + 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 exclude_end?: () -> bool + # def inspect(NodeInspector inspector) -> String # - # @return [Boolean] + # source://prism//lib/prism/node.rb#13478 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader keyword_rest: Node? # - # source://prism//prism/node.rb#14058 - def exclude_end?; end + # source://prism//lib/prism/node.rb#13410 + sig { returns(T.nilable(Prism::Node)) } + def keyword_rest; end - # def inspect(inspector: NodeInspector) -> String + # attr_reader keywords: Array[Node] # - # source://prism//prism/node.rb#14068 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#13407 + sig { returns(T::Array[Prism::Node]) } + def keywords; end - # attr_reader left: Node? + # attr_reader optionals: Array[Node] # - # source://prism//prism/node.rb#13998 - def left; end + # source://prism//lib/prism/node.rb#13398 + sig { returns(T::Array[Prism::Node]) } + def optionals; end - # def operator: () -> String + # attr_reader posts: Array[Node] # - # source://prism//prism/node.rb#14063 - def operator; end + # source://prism//lib/prism/node.rb#13404 + sig { returns(T::Array[Prism::Node]) } + def posts; end - # attr_reader operator_loc: Location + # attr_reader requireds: Array[Node] # - # source://prism//prism/node.rb#14004 - def operator_loc; end + # source://prism//lib/prism/node.rb#13395 + sig { returns(T::Array[Prism::Node]) } + def requireds; end - # attr_reader right: Node? + # attr_reader rest: Node? # - # source://prism//prism/node.rb#14001 - def right; end + # source://prism//lib/prism/node.rb#13401 + sig { returns(T.nilable(Prism::Node)) } + def rest; end + + # Mirrors the Method#parameters method. + # + # source://prism//lib/prism/node_ext.rb#149 + 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 @@ -19539,16 +22355,9 @@ class Prism::RangeNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14102 + # source://prism//lib/prism/node.rb#13519 def type; end - private - - # Returns the value of attribute flags. - # - # source://prism//prism/node.rb#13995 - 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. @@ -19557,68 +22366,115 @@ class Prism::RangeNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#14112 + # source://prism//lib/prism/node.rb#13529 def type; end end end -# Represents a rational number literal. +# Represents a parenthesized expression # -# 1.0r -# ^^^^ -class Prism::RationalNode < ::Prism::Node - # def initialize: (numeric: Node, location: Location) -> void +# (10 + 34) +# ^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#13538 +class Prism::ParenthesesNode < ::Prism::Node + # def initialize: (Node? body, Location opening_loc, Location closing_loc, Location location) -> void # - # @return [RationalNode] a new instance of RationalNode + # @return [ParenthesesNode] a new instance of ParenthesesNode # - # source://prism//prism/node.rb#14126 - def initialize(numeric, location); end + # source://prism//lib/prism/node.rb#13549 + sig do + params( + body: T.nilable(Prism::Node), + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(body, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14132 + # source://prism//lib/prism/node.rb#13557 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end + # attr_reader body: Node? + # + # source://prism//lib/prism/node.rb#13540 + sig { returns(T.nilable(Prism::Node)) } + def body; end + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14137 + # source://prism//lib/prism/node.rb#13566 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#13606 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#13546 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14147 + # source://prism//lib/prism/node.rb#13578 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14142 + # source://prism//lib/prism/node.rb#13571 def compact_child_nodes; end - # def copy: (**params) -> RationalNode + # def copy: (**params) -> ParenthesesNode # - # source://prism//prism/node.rb#14152 + # source://prism//lib/prism/node.rb#13583 + sig { params(params: T.untyped).returns(Prism::ParenthesesNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14137 + # source://prism//lib/prism/node.rb#13566 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { body: Node?, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#14163 + # source://prism//lib/prism/node.rb#13596 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#14168 + # source://prism//lib/prism/node.rb#13611 def inspect(inspector = T.unsafe(nil)); end - # attr_reader numeric: Node + # def opening: () -> String # - # source://prism//prism/node.rb#14123 - def numeric; end + # source://prism//lib/prism/node.rb#13601 + sig { returns(String) } + def opening; end + + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#13543 + sig { returns(Prism::Location) } + def opening_loc; end + + # source://prism//lib/prism/node.rb#13561 + 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 @@ -19635,14 +22491,9 @@ class Prism::RationalNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14189 + # source://prism//lib/prism/node.rb#13638 def type; end - # Returns the value of the node as a Ruby Rational. - # - # source://prism//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. @@ -19651,519 +22502,598 @@ class Prism::RationalNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#14199 + # source://prism//lib/prism/node.rb#13648 def type; end end end -# Represents the use of the `redo` keyword. +# This represents an error that was encountered during parsing. # -# redo -# ^^^^ -class Prism::RedoNode < ::Prism::Node - # def initialize: (location: Location) -> void +# source://prism//lib/prism/parse_result.rb#308 +class Prism::ParseError + # Create a new error object with the given message and location. # - # @return [RedoNode] a new instance of RedoNode + # @return [ParseError] a new instance of ParseError # - # source://prism//prism/node.rb#14210 - def initialize(location); end + # source://prism//lib/prism/parse_result.rb#319 + def initialize(message, location, level); end - # def accept: (visitor: Visitor) -> void + # Implement the hash pattern matching interface for ParseError. # - # source://prism//prism/node.rb#14215 - def accept(visitor); end + # source://prism//lib/prism/parse_result.rb#326 + def deconstruct_keys(keys); end - # def child_nodes: () -> Array[nil | Node] + # Returns a string representation of this error. # - # source://prism//prism/node.rb#14220 - def child_nodes; end + # source://prism//lib/prism/parse_result.rb#331 + def inspect; end - # def comment_targets: () -> Array[Node | Location] + # The level of this error. # - # source://prism//prism/node.rb#14230 - def comment_targets; end + # source://prism//lib/prism/parse_result.rb#316 + def level; end - # def compact_child_nodes: () -> Array[Node] + # A Location object representing the location of this error in the source. # - # source://prism//prism/node.rb#14225 - def compact_child_nodes; end + # source://prism//lib/prism/parse_result.rb#313 + sig { returns(Prism::Location) } + def location; end - # def copy: (**params) -> RedoNode + # The message associated with this error. # - # source://prism//prism/node.rb#14235 - def copy(**params); end + # source://prism//lib/prism/parse_result.rb#310 + sig { returns(String) } + def message; end +end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] +# 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#368 +class Prism::ParseResult + # Create a new parse result object with the given values. # - # source://prism//prism/node.rb#14220 - def deconstruct; end - - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # @return [ParseResult] a new instance of ParseResult # - # source://prism//prism/node.rb#14245 - def deconstruct_keys(keys); end + # source://prism//lib/prism/parse_result.rb#395 + def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end - # def inspect(inspector: NodeInspector) -> String + # Attach the list of comments to their respective locations in the tree. # - # source://prism//prism/node.rb#14250 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/parse_result/comments.rb#173 + def attach_comments!; 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 + # The list of comments that were encountered during parsing. # - # source://prism//prism/node.rb#14269 - 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//prism/node.rb#14279 - def type; end - end -end - -# Flags for regular expression and match last line nodes. -module Prism::RegularExpressionFlags; end - -# n - forces the ASCII-8BIT encoding -# -# source://prism//prism/node.rb#17360 -Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) - -# e - forces the EUC-JP encoding -# -# source://prism//prism/node.rb#17357 -Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer) - -# x - ignores whitespace and allows comments in regular expressions -# -# source://prism//prism/node.rb#17348 -Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) - -# internal bytes forced the encoding to binary -# -# source://prism//prism/node.rb#17372 -Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) - -# internal bytes forced the encoding to US-ASCII -# -# source://prism//prism/node.rb#17375 -Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) - -# internal bytes forced the encoding to UTF-8 -# -# source://prism//prism/node.rb#17369 -Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) - -# i - ignores the case of characters when matching -# -# source://prism//prism/node.rb#17345 -Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer) - -# m - allows $ to match the end of lines within strings -# -# source://prism//prism/node.rb#17351 -Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer) - -# o - only interpolates values into the regular expression once -# -# source://prism//prism/node.rb#17354 -Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) - -# u - forces the UTF-8 encoding -# -# source://prism//prism/node.rb#17366 -Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) - -# s - forces the Windows-31J encoding -# -# source://prism//prism/node.rb#17363 -Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) - -# Represents a regular expression literal with no interpolation. -# -# /foo/i -# ^^^^^^ -class Prism::RegularExpressionNode < ::Prism::Node - include ::Prism::RegularExpressionOptions + # source://prism//lib/prism/parse_result.rb#375 + sig { returns(T::Array[Prism::Comment]) } + def comments; end - # def initialize: (flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location) -> void + # 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. # - # @return [RegularExpressionNode] a new instance of RegularExpressionNode + # source://prism//lib/prism/parse_result.rb#383 + def data_loc; end + + # Implement the hash pattern matching interface for ParseResult. # - # source://prism//prism/node.rb#14305 - def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end + # source://prism//lib/prism/parse_result.rb#406 + def deconstruct_keys(keys); end - # def accept: (visitor: Visitor) -> void + # The list of errors that were generated during parsing. # - # source://prism//prism/node.rb#14315 - def accept(visitor); end + # source://prism//lib/prism/parse_result.rb#386 + sig { returns(T::Array[Prism::ParseError]) } + def errors; end - # def ascii_8bit?: () -> bool + # Returns true if there were errors during parsing and false if there were + # not. # # @return [Boolean] # - # source://prism//prism/node.rb#14380 - def ascii_8bit?; end + # source://prism//lib/prism/parse_result.rb#418 + def failure?; end - # def child_nodes: () -> Array[nil | Node] + # The list of magic comments that were encountered during parsing. # - # source://prism//prism/node.rb#14320 - def child_nodes; end + # source://prism//lib/prism/parse_result.rb#378 + def magic_comments; end - # def closing: () -> String + # Walk the tree and mark nodes that are on a new line. # - # source://prism//prism/node.rb#14420 - def closing; end + # source://prism//lib/prism/parse_result/newlines.rb#60 + def mark_newlines!; end - # attr_reader closing_loc: Location + # A Source instance that represents the source code that was parsed. # - # source://prism//prism/node.rb#14299 - def closing_loc; end + # source://prism//lib/prism/parse_result.rb#392 + sig { returns(Prism::Source) } + def source; end - # def comment_targets: () -> Array[Node | Location] + # Returns true if there were no errors during parsing and false if there + # were. # - # source://prism//prism/node.rb#14330 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] + # @return [Boolean] # - # source://prism//prism/node.rb#14325 - def compact_child_nodes; end + # source://prism//lib/prism/parse_result.rb#412 + def success?; end - # def content: () -> String + # 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. # - # source://prism//prism/node.rb#14415 - def content; end + # source://prism//lib/prism/parse_result.rb#372 + sig { returns(Prism::ProgramNode) } + def value; end - # attr_reader content_loc: Location + # The list of warnings that were generated during parsing. # - # source://prism//prism/node.rb#14296 - def content_loc; end + # source://prism//lib/prism/parse_result.rb#389 + sig { returns(T::Array[Prism::ParseWarning]) } + def warnings; end +end - # def copy: (**params) -> RegularExpressionNode +# 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. # - # source://prism//prism/node.rb#14335 - def copy(**params); end - - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # @return [Comments] a new instance of Comments # - # source://prism//prism/node.rb#14320 - def deconstruct; end + # source://prism//lib/prism/parse_result/comments.rb#78 + def initialize(parse_result); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Attach the comments to their respective locations in the tree by + # mutating the parse result. # - # source://prism//prism/node.rb#14350 - def deconstruct_keys(keys); end + # source://prism//lib/prism/parse_result/comments.rb#84 + def attach!; end - # def euc_jp?: () -> bool + # The parse result that we are attaching comments to. # - # @return [Boolean] + # source://prism//lib/prism/parse_result/comments.rb#74 + 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//prism/node.rb#14375 - def euc_jp?; end + # source://prism//lib/prism/parse_result/comments.rb#103 + def nearest_targets(node, comment); end +end - # def extended?: () -> bool +# 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 # + # source://prism//lib/prism/parse_result/comments.rb#52 + def initialize(location); end + + # source://prism//lib/prism/parse_result/comments.rb#68 + def <<(comment); end + # @return [Boolean] # - # source://prism//prism/node.rb#14360 - def extended?; end + # source://prism//lib/prism/parse_result/comments.rb#64 + def encloses?(comment); end - # def forced_binary_encoding?: () -> bool + # source://prism//lib/prism/parse_result/comments.rb#60 + def end_offset; end + + # source://prism//lib/prism/parse_result/comments.rb#50 + def location; end + + # source://prism//lib/prism/parse_result/comments.rb#56 + def start_offset; 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 + + # source://prism//lib/prism/parse_result/comments.rb#42 + def <<(comment); end + # @return [Boolean] # - # source://prism//prism/node.rb#14400 - def forced_binary_encoding?; end + # source://prism//lib/prism/parse_result/comments.rb#37 + def encloses?(comment); end - # def forced_us_ascii_encoding?: () -> bool + # source://prism//lib/prism/parse_result/comments.rb#33 + def end_offset; 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 +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 [Boolean] + # @return [Newlines] a new instance of Newlines # - # source://prism//prism/node.rb#14405 - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/parse_result/newlines.rb#22 + def initialize(newline_marked); end - # def forced_utf8_encoding?: () -> bool + # Permit block/lambda nodes to mark newlines within themselves. # - # @return [Boolean] + # source://prism//lib/prism/parse_result/newlines.rb#27 + def visit_block_node(node); end + + # Mark if/unless nodes as newlines. # - # source://prism//prism/node.rb#14395 - def forced_utf8_encoding?; end + # source://prism//lib/prism/parse_result/newlines.rb#41 + def visit_if_node(node); end - # def ignore_case?: () -> bool + # Permit block/lambda nodes to mark newlines within themselves. # - # @return [Boolean] + # 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//prism/node.rb#14355 - def ignore_case?; end + # source://prism//lib/prism/parse_result/newlines.rb#49 + def visit_statements_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Mark if/unless nodes as newlines. # - # source://prism//prism/node.rb#14425 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/parse_result/newlines.rb#41 + def visit_unless_node(node); end +end - # def multi_line?: () -> bool +# This represents a warning that was encountered during parsing. +# +# source://prism//lib/prism/parse_result.rb#337 +class Prism::ParseWarning + # Create a new warning object with the given message and location. # - # @return [Boolean] + # @return [ParseWarning] a new instance of ParseWarning # - # source://prism//prism/node.rb#14365 - def multi_line?; end + # source://prism//lib/prism/parse_result.rb#348 + def initialize(message, location, level); end - # def once?: () -> bool + # Implement the hash pattern matching interface for ParseWarning. # - # @return [Boolean] + # source://prism//lib/prism/parse_result.rb#355 + def deconstruct_keys(keys); end + + # Returns a string representation of this warning. # - # source://prism//prism/node.rb#14370 - def once?; end + # source://prism//lib/prism/parse_result.rb#360 + def inspect; end - # def opening: () -> String + # The level of this warning. # - # source://prism//prism/node.rb#14410 - def opening; end + # source://prism//lib/prism/parse_result.rb#345 + def level; end - # attr_reader opening_loc: Location + # A Location object representing the location of this warning in the source. # - # source://prism//prism/node.rb#14293 - def opening_loc; end + # source://prism//lib/prism/parse_result.rb#342 + sig { returns(Prism::Location) } + def location; 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 message associated with this warning. # - # 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#339 + sig { returns(String) } + def message; 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. # - # def type: () -> Symbol + # @return [Pattern] a new instance of Pattern # - # source://prism//prism/node.rb#14450 - def type; end + # source://prism//lib/prism/pattern.rb#63 + def initialize(query); end - # attr_reader unescaped: String + # Compile the query into a callable object that can be used to match against + # nodes. # - # source://prism//prism/node.rb#14302 - def unescaped; end + # source://prism//lib/prism/pattern.rb#70 + def compile; end - # def utf_8?: () -> bool - # - # @return [Boolean] + # The query that this pattern was initialized with. # - # source://prism//prism/node.rb#14390 - def utf_8?; end + # source://prism//lib/prism/pattern.rb#59 + def query; end - # def windows_31j?: () -> bool - # - # @return [Boolean] + # 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//prism/node.rb#14385 - def windows_31j?; end + # source://prism//lib/prism/pattern.rb#79 + def scan(root); end private - # Returns the value of attribute flags. + # Shortcut for combining two procs into one that returns true if both return + # true. # - # source://prism//prism/node.rb#14290 - 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//prism/node.rb#14460 - def type; end - end -end + # source://prism//lib/prism/pattern.rb#95 + def combine_and(left, right); end -module Prism::RegularExpressionOptions - # Returns a numeric value that represents the flags that were used to create - # the regular expression. + # Shortcut for combining two procs into one that returns true if either + # returns true. # - # source://prism//prism/node_ext.rb#9 - def options; end -end + # source://prism//lib/prism/pattern.rb#101 + def combine_or(left, right); end -# Represents a required keyword parameter to a method, block, or lambda definition. -# -# def a(b: ) -# ^^ -# end -class Prism::RequiredKeywordParameterNode < ::Prism::Node - # def initialize: (name: Symbol, name_loc: Location, location: Location) -> void - # - # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode + # in foo | bar # - # source://prism//prism/node.rb#14478 - def initialize(name, name_loc, location); end + # source://prism//lib/prism/pattern.rb#136 + def compile_alternation_pattern_node(node); end - # def accept: (visitor: Visitor) -> void + # in [foo, bar, baz] # - # source://prism//prism/node.rb#14485 - def accept(visitor); end + # source://prism//lib/prism/pattern.rb#111 + def compile_array_pattern_node(node); end - # def child_nodes: () -> Array[nil | Node] + # in Prism::ConstantReadNode # - # source://prism//prism/node.rb#14490 - def child_nodes; end + # source://prism//lib/prism/pattern.rb#141 + def compile_constant_path_node(node); end - # def comment_targets: () -> Array[Node | Location] + # in ConstantReadNode + # in String # - # source://prism//prism/node.rb#14500 - def comment_targets; end + # source://prism//lib/prism/pattern.rb#153 + def compile_constant_read_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Raise an error because the given node is not supported. # - # source://prism//prism/node.rb#14495 - def compact_child_nodes; end - - # def copy: (**params) -> RequiredKeywordParameterNode + # @raise [CompilationError] # - # source://prism//prism/node.rb#14505 - def copy(**params); end + # source://prism//lib/prism/pattern.rb#106 + def compile_error(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # in InstanceVariableReadNode[name: Symbol] + # in { name: Symbol } # - # source://prism//prism/node.rb#14490 - def deconstruct; end + # source://prism//lib/prism/pattern.rb#171 + def compile_hash_pattern_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # in nil # - # source://prism//prism/node.rb#14517 - def deconstruct_keys(keys); end + # source://prism//lib/prism/pattern.rb#196 + def compile_nil_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Compile any kind of node. Dispatch out to the individual compilation + # methods based on the type of node. # - # source://prism//prism/node.rb#14522 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/pattern.rb#225 + def compile_node(node); end - # attr_reader name: Symbol + # in /foo/ # - # source://prism//prism/node.rb#14472 - def name; end + # source://prism//lib/prism/pattern.rb#201 + def compile_regular_expression_node(node); end - # attr_reader name_loc: Location + # in "" + # in "foo" # - # source://prism//prism/node.rb#14475 - def name_loc; end + # source://prism//lib/prism/pattern.rb#209 + def compile_string_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. + # in :+ + # in :foo # - # 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#217 + 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. # - # def type: () -> Symbol + # @return [CompilationError] a new instance of CompilationError # - # source://prism//prism/node.rb#14543 - 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//prism/node.rb#14553 - def type; end - end + # source://prism//lib/prism/pattern.rb#43 + def initialize(repr); end end -# Represents a required parameter to a method, block, or lambda definition. +# Represents the use of the `^` operator for pinning an expression in a pattern matching expression. # -# def a(b) -# ^ -# end -class Prism::RequiredParameterNode < ::Prism::Node - # def initialize: (name: Symbol, location: Location) -> void +# foo in ^(bar) +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#13657 +class Prism::PinnedExpressionNode < ::Prism::Node + # def initialize: (Node expression, Location operator_loc, Location lparen_loc, Location rparen_loc, Location location) -> void # - # @return [RequiredParameterNode] a new instance of RequiredParameterNode + # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode # - # source://prism//prism/node.rb#14568 - def initialize(name, location); end + # source://prism//lib/prism/node.rb#13671 + sig do + params( + expression: Prism::Node, + operator_loc: Prism::Location, + lparen_loc: Prism::Location, + rparen_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(expression, operator_loc, lparen_loc, rparen_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14574 + # source://prism//lib/prism/node.rb#13680 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14579 + # source://prism//lib/prism/node.rb#13685 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14589 + # source://prism//lib/prism/node.rb#13695 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14584 + # source://prism//lib/prism/node.rb#13690 def compact_child_nodes; end - # def copy: (**params) -> RequiredParameterNode + # def copy: (**params) -> PinnedExpressionNode # - # source://prism//prism/node.rb#14594 + # source://prism//lib/prism/node.rb#13700 + sig { params(params: T.untyped).returns(Prism::PinnedExpressionNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14579 + # source://prism//lib/prism/node.rb#13685 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location } # - # source://prism//prism/node.rb#14605 + # source://prism//lib/prism/node.rb#13714 + 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(inspector: NodeInspector) -> String + # attr_reader expression: Node + # + # source://prism//lib/prism/node.rb#13659 + sig { returns(Prism::Node) } + def expression; end + + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#14610 + # source://prism//lib/prism/node.rb#13734 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol + # def lparen: () -> String # - # source://prism//prism/node.rb#14565 - def name; end + # source://prism//lib/prism/node.rb#13724 + sig { returns(String) } + def lparen; end + + # attr_reader lparen_loc: Location + # + # source://prism//lib/prism/node.rb#13665 + sig { returns(Prism::Location) } + def lparen_loc; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#13719 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#13662 + sig { returns(Prism::Location) } + def operator_loc; end + + # def rparen: () -> String + # + # source://prism//lib/prism/node.rb#13729 + sig { returns(String) } + def rparen; end + + # attr_reader rparen_loc: Location + # + # source://prism//lib/prism/node.rb#13668 + 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 @@ -20180,7 +23110,7 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14630 + # source://prism//lib/prism/node.rb#13758 def type; end class << self @@ -20191,86 +23121,87 @@ class Prism::RequiredParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#14640 + # source://prism//lib/prism/node.rb#13768 def type; end end end -# Represents an expression modified with a rescue. +# Represents the use of the `^` operator for pinning a variable in a pattern matching expression. # -# foo rescue nil -# ^^^^^^^^^^^^^^ -class Prism::RescueModifierNode < ::Prism::Node - # def initialize: (expression: Node, keyword_loc: Location, rescue_expression: Node, location: Location) -> void +# foo in ^bar +# ^^^^ +# +# source://prism//lib/prism/node.rb#13777 +class Prism::PinnedVariableNode < ::Prism::Node + # def initialize: (Node variable, Location operator_loc, Location location) -> void # - # @return [RescueModifierNode] a new instance of RescueModifierNode + # @return [PinnedVariableNode] a new instance of PinnedVariableNode # - # source://prism//prism/node.rb#14660 - def initialize(expression, keyword_loc, rescue_expression, location); end + # source://prism//lib/prism/node.rb#13785 + sig { params(variable: Prism::Node, operator_loc: Prism::Location, location: Prism::Location).void } + def initialize(variable, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14668 + # source://prism//lib/prism/node.rb#13792 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14677 + # source://prism//lib/prism/node.rb#13797 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14687 + # source://prism//lib/prism/node.rb#13807 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14682 + # source://prism//lib/prism/node.rb#13802 def compact_child_nodes; end - # def copy: (**params) -> RescueModifierNode + # def copy: (**params) -> PinnedVariableNode # - # source://prism//prism/node.rb#14692 + # source://prism//lib/prism/node.rb#13812 + sig { params(params: T.untyped).returns(Prism::PinnedVariableNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14677 + # source://prism//lib/prism/node.rb#13797 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { variable: Node, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#14705 + # source://prism//lib/prism/node.rb#13824 + 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 - # attr_reader expression: Node - # - # source://prism//prism/node.rb#14651 - def expression; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#14715 + # source://prism//lib/prism/node.rb#13834 def inspect(inspector = T.unsafe(nil)); end - # def keyword: () -> String - # - # source://prism//prism/node.rb#14710 - def keyword; end - - # attr_reader keyword_loc: Location + # def operator: () -> String # - # source://prism//prism/node.rb#14654 - def keyword_loc; end + # source://prism//lib/prism/node.rb#13829 + sig { returns(String) } + def operator; end - # attr_reader rescue_expression: Node + # attr_reader operator_loc: Location # - # source://prism//prism/node.rb#14657 - def rescue_expression; end - - # source://prism//prism/node.rb#14672 - def set_newline_flag(newline_marked); end + # source://prism//lib/prism/node.rb#13782 + 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 @@ -20287,9 +23218,15 @@ class Prism::RescueModifierNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14739 + # source://prism//lib/prism/node.rb#13856 def type; end + # attr_reader variable: Node + # + # source://prism//lib/prism/node.rb#13779 + 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. @@ -20298,108 +23235,124 @@ class Prism::RescueModifierNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#14749 + # source://prism//lib/prism/node.rb#13866 def type; end end end -# Represents a rescue statement. +# Represents the use of the `END` keyword. # -# begin -# rescue Foo, *splat, Bar => ex -# foo -# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -# end +# END { foo } +# ^^^^^^^^^^^ # -# `Foo, *splat, Bar` are in the `exceptions` field. -# `ex` is in the `exception` field. -class Prism::RescueNode < ::Prism::Node - # def initialize: (keyword_loc: Location, exceptions: Array[Node], operator_loc: Location?, reference: Node?, statements: StatementsNode?, consequent: RescueNode?, location: Location) -> void +# source://prism//lib/prism/node.rb#13875 +class Prism::PostExecutionNode < ::Prism::Node + # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void # - # @return [RescueNode] a new instance of RescueNode + # @return [PostExecutionNode] a new instance of PostExecutionNode # - # source://prism//prism/node.rb#14784 - def initialize(keyword_loc, exceptions, operator_loc, reference, statements, consequent, location); end + # source://prism//lib/prism/node.rb#13889 + sig do + params( + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14795 + # source://prism//lib/prism/node.rb#13898 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14800 + # source://prism//lib/prism/node.rb#13903 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#13949 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#13886 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14815 + # source://prism//lib/prism/node.rb#13915 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14805 + # source://prism//lib/prism/node.rb#13908 def compact_child_nodes; end - # attr_reader consequent: RescueNode? - # - # source://prism//prism/node.rb#14781 - def consequent; end - - # def copy: (**params) -> RescueNode + # def copy: (**params) -> PostExecutionNode # - # source://prism//prism/node.rb#14820 + # source://prism//lib/prism/node.rb#13920 + sig { params(params: T.untyped).returns(Prism::PostExecutionNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14800 + # source://prism//lib/prism/node.rb#13903 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#14836 + # source://prism//lib/prism/node.rb#13934 + 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 - # attr_reader exceptions: Array[Node] - # - # source://prism//prism/node.rb#14769 - def exceptions; end - - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#14851 + # source://prism//lib/prism/node.rb#13954 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#14841 + # source://prism//lib/prism/node.rb#13939 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#14766 + # source://prism//lib/prism/node.rb#13880 + sig { returns(Prism::Location) } def keyword_loc; end - # def operator: () -> String? - # - # source://prism//prism/node.rb#14846 - def operator; end - - # attr_reader operator_loc: Location? + # def opening: () -> String # - # source://prism//prism/node.rb#14772 - def operator_loc; end + # source://prism//lib/prism/node.rb#13944 + sig { returns(String) } + def opening; end - # attr_reader reference: Node? + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#14775 - def reference; end + # source://prism//lib/prism/node.rb#13883 + sig { returns(Prism::Location) } + def opening_loc; end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#14778 + # source://prism//lib/prism/node.rb#13877 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Sometimes you want to check an instance of a node against a list of @@ -20417,7 +23370,7 @@ class Prism::RescueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14891 + # source://prism//lib/prism/node.rb#13982 def type; end class << self @@ -20428,84 +23381,125 @@ class Prism::RescueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#14901 + # source://prism//lib/prism/node.rb#13992 def type; end end end -# Represents a rest parameter to a method, block, or lambda definition. +# Represents the use of the `BEGIN` keyword. # -# def a(*b) -# ^^ -# end -class Prism::RestParameterNode < ::Prism::Node - # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location) -> void +# BEGIN { foo } +# ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14001 +class Prism::PreExecutionNode < ::Prism::Node + # def initialize: (StatementsNode? statements, Location keyword_loc, Location opening_loc, Location closing_loc, Location location) -> void # - # @return [RestParameterNode] a new instance of RestParameterNode + # @return [PreExecutionNode] a new instance of PreExecutionNode # - # source://prism//prism/node.rb#14922 - def initialize(name, name_loc, operator_loc, location); end + # source://prism//lib/prism/node.rb#14015 + sig do + params( + statements: T.nilable(Prism::StatementsNode), + keyword_loc: Prism::Location, + opening_loc: Prism::Location, + closing_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#14930 + # source://prism//lib/prism/node.rb#14024 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14935 + # source://prism//lib/prism/node.rb#14029 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#14075 + sig { returns(String) } + def closing; end + + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#14012 + sig { returns(Prism::Location) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#14945 + # source://prism//lib/prism/node.rb#14041 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#14940 + # source://prism//lib/prism/node.rb#14034 def compact_child_nodes; end - # def copy: (**params) -> RestParameterNode + # def copy: (**params) -> PreExecutionNode # - # source://prism//prism/node.rb#14950 + # source://prism//lib/prism/node.rb#14046 + sig { params(params: T.untyped).returns(Prism::PreExecutionNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#14935 + # source://prism//lib/prism/node.rb#14029 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location } # - # source://prism//prism/node.rb#14963 + # source://prism//lib/prism/node.rb#14060 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#14973 + # source://prism//lib/prism/node.rb#14080 def inspect(inspector = T.unsafe(nil)); end - # attr_reader name: Symbol? + # def keyword: () -> String # - # source://prism//prism/node.rb#14913 - def name; end + # source://prism//lib/prism/node.rb#14065 + sig { returns(String) } + def keyword; end - # attr_reader name_loc: Location? + # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#14916 - def name_loc; end + # source://prism//lib/prism/node.rb#14006 + sig { returns(Prism::Location) } + def keyword_loc; end - # def operator: () -> String + # def opening: () -> String # - # source://prism//prism/node.rb#14968 - def operator; end + # source://prism//lib/prism/node.rb#14070 + sig { returns(String) } + def opening; end - # attr_reader operator_loc: Location + # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#14919 - def operator_loc; end + # source://prism//lib/prism/node.rb#14009 + sig { returns(Prism::Location) } + def opening_loc; end + + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#14003 + 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 @@ -20522,7 +23516,7 @@ class Prism::RestParameterNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#14999 + # source://prism//lib/prism/node.rb#14108 def type; end class << self @@ -20533,64 +23527,85 @@ class Prism::RestParameterNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#15009 + # source://prism//lib/prism/node.rb#14118 def type; end end end -# Represents the use of the `retry` keyword. +# The top level node of any parse tree. # -# retry -# ^^^^^ -class Prism::RetryNode < ::Prism::Node - # def initialize: (location: Location) -> void +# source://prism//lib/prism/node.rb#14124 +class Prism::ProgramNode < ::Prism::Node + # def initialize: (Array[Symbol] locals, StatementsNode statements, Location location) -> void # - # @return [RetryNode] a new instance of RetryNode + # @return [ProgramNode] a new instance of ProgramNode # - # source://prism//prism/node.rb#15020 - def initialize(location); end + # source://prism//lib/prism/node.rb#14132 + sig { params(locals: T::Array[Symbol], statements: Prism::StatementsNode, location: Prism::Location).void } + def initialize(locals, statements, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#15025 + # source://prism//lib/prism/node.rb#14139 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#15030 + # source://prism//lib/prism/node.rb#14144 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#15040 + # source://prism//lib/prism/node.rb#14154 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#15035 + # source://prism//lib/prism/node.rb#14149 def compact_child_nodes; end - # def copy: (**params) -> RetryNode + # def copy: (**params) -> ProgramNode # - # source://prism//prism/node.rb#15045 + # source://prism//lib/prism/node.rb#14159 + sig { params(params: T.untyped).returns(Prism::ProgramNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#15030 + # source://prism//lib/prism/node.rb#14144 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { locals: Array[Symbol], statements: StatementsNode, location: Location } # - # source://prism//prism/node.rb#15055 + # source://prism//lib/prism/node.rb#14171 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#15060 + # source://prism//lib/prism/node.rb#14176 def inspect(inspector = T.unsafe(nil)); end + # attr_reader locals: Array[Symbol] + # + # source://prism//lib/prism/node.rb#14126 + sig { returns(T::Array[Symbol]) } + def locals; end + + # attr_reader statements: StatementsNode + # + # source://prism//lib/prism/node.rb#14129 + sig { returns(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 @@ -20606,7 +23621,7 @@ class Prism::RetryNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#15079 + # source://prism//lib/prism/node.rb#14198 def type; end class << self @@ -20617,78 +23632,141 @@ class Prism::RetryNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#15089 + # source://prism//lib/prism/node.rb#14208 def type; end end end -# Represents the use of the `return` keyword. +# Flags for range and flip-flop nodes. # -# return 1 -# ^^^^^^^^ -class Prism::ReturnNode < ::Prism::Node - # def initialize: (keyword_loc: Location, arguments: ArgumentsNode?, location: Location) -> void +# source://prism//lib/prism/node.rb#17620 +module Prism::RangeFlags; end + +# ... operator +# +# source://prism//lib/prism/node.rb#17622 +Prism::RangeFlags::EXCLUDE_END = T.let(T.unsafe(nil), Integer) + +# Represents the use of the `..` or `...` operators. +# +# 1..2 +# ^^^^ +# +# c if a =~ /left/ ... b =~ /right/ +# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14220 +class Prism::RangeNode < ::Prism::Node + # def initialize: (Integer flags, Node? left, Node? right, Location operator_loc, Location location) -> void # - # @return [ReturnNode] a new instance of ReturnNode + # @return [RangeNode] a new instance of RangeNode # - # source://prism//prism/node.rb#15106 - def initialize(keyword_loc, arguments, location); end + # source://prism//lib/prism/node.rb#14247 + sig do + params( + flags: Integer, + left: T.nilable(Prism::Node), + right: T.nilable(Prism::Node), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, left, right, operator_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#15113 + # source://prism//lib/prism/node.rb#14256 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end - # attr_reader arguments: ArgumentsNode? - # - # source://prism//prism/node.rb#15103 - def arguments; end - # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#15118 + # source://prism//lib/prism/node.rb#14261 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#15130 + # source://prism//lib/prism/node.rb#14274 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#15123 + # source://prism//lib/prism/node.rb#14266 def compact_child_nodes; end - # def copy: (**params) -> ReturnNode + # def copy: (**params) -> RangeNode # - # source://prism//prism/node.rb#15135 + # source://prism//lib/prism/node.rb#14279 + sig { params(params: T.untyped).returns(Prism::RangeNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#15118 + # source://prism//lib/prism/node.rb#14261 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location } # - # source://prism//prism/node.rb#15147 + # source://prism//lib/prism/node.rb#14293 + 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(inspector: NodeInspector) -> String + # def exclude_end?: () -> bool # - # source://prism//prism/node.rb#15157 - def inspect(inspector = T.unsafe(nil)); end + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14298 + sig { returns(T::Boolean) } + def exclude_end?; end - # def keyword: () -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#15152 - def keyword; end + # source://prism//lib/prism/node.rb#14308 + def inspect(inspector = T.unsafe(nil)); end - # attr_reader keyword_loc: Location + # 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//prism/node.rb#15100 - def keyword_loc; end + # 1... + # ^ + # + # hello...goodbye + # ^^^^^ + # + # source://prism//lib/prism/node.rb#14231 + sig { returns(T.nilable(Prism::Node)) } + def left; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#14303 + sig { returns(String) } + def operator; end + + # The location of the `..` or `...` operator. + # + # source://prism//lib/prism/node.rb#14244 + sig { returns(Prism::Location) } + def operator_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. + # + # source://prism//lib/prism/node.rb#14241 + sig { returns(T.nilable(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 @@ -20705,9 +23783,17 @@ class Prism::ReturnNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#15183 + # source://prism//lib/prism/node.rb#14342 def type; end + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#14222 + 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. @@ -20716,1425 +23802,4314 @@ class Prism::ReturnNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#15193 + # source://prism//lib/prism/node.rb#14352 def type; end end 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. +# Represents a rational number literal. # -# 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. +# 1.0r +# ^^^^ # -# To use this class, you treat `Prism::RipperCompat` effectively as you would -# treat the `Ripper` class. -class Prism::RipperCompat < ::Prism::Visitor - # Create a new RipperCompat object with the given source. +# source://prism//lib/prism/node.rb#14361 +class Prism::RationalNode < ::Prism::Node + # def initialize: (Node numeric, Location location) -> void # - # @return [RipperCompat] a new instance of RipperCompat + # @return [RationalNode] a new instance of RationalNode # - # source://prism//prism/ripper_compat.rb#74 - def initialize(source); end + # source://prism//lib/prism/node.rb#14366 + sig { params(numeric: Prism::Node, location: Prism::Location).void } + def initialize(numeric, location); end - # The current column number of the parser. + # def accept: (Visitor visitor) -> void # - # source://prism//prism/ripper_compat.rb#71 - def column; end + # source://prism//lib/prism/node.rb#14372 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # True if the parser encountered an error during parsing. - # - # @return [Boolean] + # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/ripper_compat.rb#86 - def error?; end + # source://prism//lib/prism/node.rb#14377 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # The current line number of the parser. + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/ripper_compat.rb#68 - def lineno; end + # source://prism//lib/prism/node.rb#14387 + def comment_targets; end - # Parse the source and return the result. + # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/ripper_compat.rb#91 - def parse; end + # source://prism//lib/prism/node.rb#14382 + def compact_child_nodes; end - # The source that is being parsed. + # def copy: (**params) -> RationalNode # - # source://prism//prism/ripper_compat.rb#65 - def source; end + # source://prism//lib/prism/node.rb#14392 + sig { params(params: T.untyped).returns(Prism::RationalNode) } + def copy(**params); end - # Visit a CallNode node. + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/ripper_compat.rb#110 - def visit_call_node(node); end + # source://prism//lib/prism/node.rb#14377 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # Visit a FloatNode node. + # def deconstruct_keys: (Array[Symbol] keys) -> { numeric: Node, location: Location } # - # source://prism//prism/ripper_compat.rb#123 - def visit_float_node(node); end + # source://prism//lib/prism/node.rb#14403 + 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 - # Visit a ImaginaryNode node. + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/ripper_compat.rb#129 - def visit_imaginary_node(node); end + # source://prism//lib/prism/node.rb#14408 + def inspect(inspector = T.unsafe(nil)); end - # Visit an IntegerNode node. + # attr_reader numeric: Node # - # source://prism//prism/ripper_compat.rb#135 - def visit_integer_node(node); end + # source://prism//lib/prism/node.rb#14363 + sig { returns(Prism::Node) } + def numeric; end - # Visit a ProgramNode 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//prism/ripper_compat.rb#155 - def visit_program_node(node); 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#14429 + def type; end - # Visit a RationalNode node. + # Returns the value of the node as a Ruby Rational. # - # source://prism//prism/ripper_compat.rb#141 - def visit_rational_node(node); end + # source://prism//lib/prism/node_ext.rb#83 + def value; end - # Visit a StatementsNode node. + 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#14439 + def type; end + end +end + +# Represents the use of the `redo` keyword. +# +# redo +# ^^^^ +# +# source://prism//lib/prism/node.rb#14448 +class Prism::RedoNode < ::Prism::Node + # def initialize: (Location location) -> void # - # source://prism//prism/ripper_compat.rb#147 - def visit_statements_node(node); end + # @return [RedoNode] a new instance of RedoNode + # + # source://prism//lib/prism/node.rb#14450 + sig { params(location: Prism::Location).void } + def initialize(location); end - private + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14455 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#192 - def _dispatch0; end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14460 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def _dispatch1(_); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14470 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#194 - def _dispatch2(_, _); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#14465 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#195 - def _dispatch3(_, _, _); end + # def copy: (**params) -> RedoNode + # + # source://prism//lib/prism/node.rb#14475 + sig { params(params: T.untyped).returns(Prism::RedoNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#196 - def _dispatch4(_, _, _, _); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14460 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#197 - def _dispatch5(_, _, _, _, _); end + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#14485 + 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//prism/ripper_compat.rb#198 - def _dispatch7(_, _, _, _, _, _, _); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#14490 + def inspect(inspector = T.unsafe(nil)); end - # This method is responsible for updating lineno and column information - # to reflect the current 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. # - # This method could be drastically improved with some caching on the start - # of every line, but for now it's good enough. + # 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//prism/ripper_compat.rb#182 - def bounds(location); end + # def type: () -> Symbol + # + # source://prism//lib/prism/node.rb#14509 + def type; end - # source://prism//prism/ripper_compat.rb#193 - def on_BEGIN(_); 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#14519 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#193 - def on_CHAR(_); end +# Flags for regular expression and match last line nodes. +# +# source://prism//lib/prism/node.rb#17626 +module Prism::RegularExpressionFlags; end - # source://prism//prism/ripper_compat.rb#193 - def on_END(_); end +# n - forces the ASCII-8BIT encoding +# +# source://prism//lib/prism/node.rb#17643 +Prism::RegularExpressionFlags::ASCII_8BIT = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#193 - def on___end__(_); end +# e - forces the EUC-JP encoding +# +# source://prism//lib/prism/node.rb#17640 +Prism::RegularExpressionFlags::EUC_JP = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_alias(_, _); end +# x - ignores whitespace and allows comments in regular expressions +# +# source://prism//lib/prism/node.rb#17631 +Prism::RegularExpressionFlags::EXTENDED = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_alias_error(_, _); end +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#17655 +Prism::RegularExpressionFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_aref(_, _); end +# internal bytes forced the encoding to US-ASCII +# +# source://prism//lib/prism/node.rb#17658 +Prism::RegularExpressionFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_aref_field(_, _); end +# internal bytes forced the encoding to UTF-8 +# +# source://prism//lib/prism/node.rb#17652 +Prism::RegularExpressionFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#193 - def on_arg_ambiguous(_); end +# i - ignores the case of characters when matching +# +# source://prism//lib/prism/node.rb#17628 +Prism::RegularExpressionFlags::IGNORE_CASE = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#193 - def on_arg_paren(_); end +# m - allows $ to match the end of lines within strings +# +# source://prism//lib/prism/node.rb#17634 +Prism::RegularExpressionFlags::MULTI_LINE = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_args_add(_, _); end +# o - only interpolates values into the regular expression once +# +# source://prism//lib/prism/node.rb#17637 +Prism::RegularExpressionFlags::ONCE = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_args_add_block(_, _); end +# u - forces the UTF-8 encoding +# +# source://prism//lib/prism/node.rb#17649 +Prism::RegularExpressionFlags::UTF_8 = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#194 - def on_args_add_star(_, _); end +# s - forces the Windows-31J encoding +# +# source://prism//lib/prism/node.rb#17646 +Prism::RegularExpressionFlags::WINDOWS_31J = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#192 - def on_args_forward; end +# Represents a regular expression literal with no interpolation. +# +# /foo/i +# ^^^^^^ +# +# source://prism//lib/prism/node.rb#14528 +class Prism::RegularExpressionNode < ::Prism::Node + include ::Prism::RegularExpressionOptions - # source://prism//prism/ripper_compat.rb#192 - def on_args_new; end + # 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#14545 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end + def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end - # source://prism//prism/ripper_compat.rb#193 - def on_array(_); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14555 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#196 - def on_aryptn(_, _, _, _); end + # def ascii_8bit?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14620 + sig { returns(T::Boolean) } + def ascii_8bit?; end - # source://prism//prism/ripper_compat.rb#194 - def on_assign(_, _); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14560 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#194 - def on_assign_error(_, _); end + # def closing: () -> String + # + # source://prism//lib/prism/node.rb#14660 + sig { returns(String) } + def closing; end - # source://prism//prism/ripper_compat.rb#194 - def on_assoc_new(_, _); end + # attr_reader closing_loc: Location + # + # source://prism//lib/prism/node.rb#14539 + sig { returns(Prism::Location) } + def closing_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_assoc_splat(_); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14570 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_assoclist_from_args(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#14565 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_backref(_); end + # def content: () -> String + # + # source://prism//lib/prism/node.rb#14655 + sig { returns(String) } + def content; end - # source://prism//prism/ripper_compat.rb#193 - def on_backtick(_); end + # attr_reader content_loc: Location + # + # source://prism//lib/prism/node.rb#14536 + sig { returns(Prism::Location) } + def content_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_bare_assoc_hash(_); end + # def copy: (**params) -> RegularExpressionNode + # + # source://prism//lib/prism/node.rb#14575 + sig { params(params: T.untyped).returns(Prism::RegularExpressionNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_begin(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14560 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#195 - def on_binary(_, _, _); 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#14590 + 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//prism/ripper_compat.rb#194 - def on_block_var(_, _); end + # def euc_jp?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14615 + sig { returns(T::Boolean) } + def euc_jp?; end - # source://prism//prism/ripper_compat.rb#193 - def on_blockarg(_); end + # def extended?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14600 + sig { returns(T::Boolean) } + def extended?; end - # source://prism//prism/ripper_compat.rb#196 - def on_bodystmt(_, _, _, _); end + # def forced_binary_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14640 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # source://prism//prism/ripper_compat.rb#194 - def on_brace_block(_, _); end + # def forced_us_ascii_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14645 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end - # source://prism//prism/ripper_compat.rb#193 - def on_break(_); end + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14635 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # source://prism//prism/ripper_compat.rb#195 - def on_call(_, _, _); end + # def ignore_case?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14595 + sig { returns(T::Boolean) } + def ignore_case?; end - # source://prism//prism/ripper_compat.rb#194 - def on_case(_, _); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#14665 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#195 - def on_class(_, _, _); end + # def multi_line?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14605 + sig { returns(T::Boolean) } + def multi_line?; end - # source://prism//prism/ripper_compat.rb#194 - def on_class_name_error(_, _); end + # def once?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14610 + sig { returns(T::Boolean) } + def once?; end - # source://prism//prism/ripper_compat.rb#193 - def on_comma(_); end + # def opening: () -> String + # + # source://prism//lib/prism/node.rb#14650 + sig { returns(String) } + def opening; end - # source://prism//prism/ripper_compat.rb#194 - def on_command(_, _); end + # attr_reader opening_loc: Location + # + # source://prism//lib/prism/node.rb#14533 + sig { returns(Prism::Location) } + def opening_loc; end - # source://prism//prism/ripper_compat.rb#196 - def on_command_call(_, _, _, _); 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#14690 + def type; end - # source://prism//prism/ripper_compat.rb#193 - def on_comment(_); end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#14542 + sig { returns(String) } + def unescaped; end - # source://prism//prism/ripper_compat.rb#193 - def on_const(_); end + # def utf_8?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14630 + sig { returns(T::Boolean) } + def utf_8?; end - # source://prism//prism/ripper_compat.rb#194 - def on_const_path_field(_, _); end + # def windows_31j?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14625 + sig { returns(T::Boolean) } + def windows_31j?; end - # source://prism//prism/ripper_compat.rb#194 - def on_const_path_ref(_, _); end + private - # source://prism//prism/ripper_compat.rb#193 - def on_const_ref(_); end + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#14530 + sig { returns(Integer) } + def flags; end - # source://prism//prism/ripper_compat.rb#193 - def on_cvar(_); 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#14700 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#195 - def on_def(_, _, _); 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 - # source://prism//prism/ripper_compat.rb#193 - def on_defined(_); end +# Represents a required keyword parameter to a method, block, or lambda definition. +# +# def a(b: ) +# ^^ +# end +# +# source://prism//lib/prism/node.rb#14710 +class Prism::RequiredKeywordParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location name_loc, Location location) -> void + # + # @return [RequiredKeywordParameterNode] a new instance of RequiredKeywordParameterNode + # + # source://prism//lib/prism/node.rb#14721 + sig { params(flags: Integer, name: Symbol, name_loc: Prism::Location, location: Prism::Location).void } + def initialize(flags, name, name_loc, location); end - # source://prism//prism/ripper_compat.rb#197 - def on_defs(_, _, _, _, _); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14729 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#194 - def on_do_block(_, _); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14734 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#194 - def on_dot2(_, _); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14744 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#194 - def on_dot3(_, _); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#14739 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_dyna_symbol(_); end + # def copy: (**params) -> RequiredKeywordParameterNode + # + # source://prism//lib/prism/node.rb#14749 + sig { params(params: T.untyped).returns(Prism::RequiredKeywordParameterNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_else(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14734 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#195 - def on_elsif(_, _, _); end + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, name_loc: Location, location: Location } + # + # source://prism//lib/prism/node.rb#14762 + 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//prism/ripper_compat.rb#193 - def on_embdoc(_); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#14772 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_embdoc_beg(_); end + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#14715 + sig { returns(Symbol) } + def name; end - # source://prism//prism/ripper_compat.rb#193 - def on_embdoc_end(_); end + # attr_reader name_loc: Location + # + # source://prism//lib/prism/node.rb#14718 + sig { returns(Prism::Location) } + def name_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_embexpr_beg(_); end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14767 + sig { returns(T::Boolean) } + def repeated_parameter?; end - # source://prism//prism/ripper_compat.rb#193 - def on_embexpr_end(_); 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#14795 + def type; end - # source://prism//prism/ripper_compat.rb#193 - def on_embvar(_); end + private - # source://prism//prism/ripper_compat.rb#193 - def on_ensure(_); end + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#14712 + sig { returns(Integer) } + def flags; end - # source://prism//prism/ripper_compat.rb#192 - def on_excessed_comma; 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#14805 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#193 - def on_fcall(_); end - - # source://prism//prism/ripper_compat.rb#195 - def on_field(_, _, _); end +# Represents a required parameter to a method, block, or lambda definition. +# +# def a(b) +# ^ +# end +# +# source://prism//lib/prism/node.rb#14815 +class Prism::RequiredParameterNode < ::Prism::Node + # def initialize: (Integer flags, Symbol name, Location location) -> void + # + # @return [RequiredParameterNode] a new instance of RequiredParameterNode + # + # source://prism//lib/prism/node.rb#14823 + sig { params(flags: Integer, name: Symbol, location: Prism::Location).void } + def initialize(flags, name, location); end - # source://prism//prism/ripper_compat.rb#193 - def on_float(_); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14830 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#196 - def on_fndptn(_, _, _, _); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14835 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#195 - def on_for(_, _, _); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14845 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_gvar(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#14840 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_hash(_); end + # def copy: (**params) -> RequiredParameterNode + # + # source://prism//lib/prism/node.rb#14850 + sig { params(params: T.untyped).returns(Prism::RequiredParameterNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_heredoc_beg(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14835 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#194 - def on_heredoc_dedent(_, _); end + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, name: Symbol, location: Location } + # + # source://prism//lib/prism/node.rb#14862 + 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//prism/ripper_compat.rb#193 - def on_heredoc_end(_); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#14872 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#195 - def on_hshptn(_, _, _); end + # attr_reader name: Symbol + # + # source://prism//lib/prism/node.rb#14820 + sig { returns(Symbol) } + def name; end - # source://prism//prism/ripper_compat.rb#193 - def on_ident(_); end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#14867 + sig { returns(T::Boolean) } + def repeated_parameter?; end - # source://prism//prism/ripper_compat.rb#195 - def on_if(_, _, _); 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#14894 + def type; end - # source://prism//prism/ripper_compat.rb#194 - def on_if_mod(_, _); end + private - # source://prism//prism/ripper_compat.rb#195 - def on_ifop(_, _, _); end + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#14817 + sig { returns(Integer) } + def flags; end - # source://prism//prism/ripper_compat.rb#193 - def on_ignored_nl(_); 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#14904 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#193 - def on_ignored_sp(_); end +# Represents an expression modified with a rescue. +# +# foo rescue nil +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#14913 +class Prism::RescueModifierNode < ::Prism::Node + # def initialize: (Node expression, Location keyword_loc, Node rescue_expression, Location location) -> void + # + # @return [RescueModifierNode] a new instance of RescueModifierNode + # + # source://prism//lib/prism/node.rb#14924 + sig do + params( + expression: Prism::Node, + keyword_loc: Prism::Location, + rescue_expression: Prism::Node, + location: Prism::Location + ).void + end + def initialize(expression, keyword_loc, rescue_expression, location); end - # source://prism//prism/ripper_compat.rb#193 - def on_imaginary(_); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#14932 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#195 - def on_in(_, _, _); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14941 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_int(_); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#14951 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_ivar(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#14946 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_kw(_); end + # def copy: (**params) -> RescueModifierNode + # + # source://prism//lib/prism/node.rb#14956 + sig { params(params: T.untyped).returns(Prism::RescueModifierNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_kwrest_param(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#14941 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#193 - def on_label(_); end + # def deconstruct_keys: (Array[Symbol] keys) -> { expression: Node, keyword_loc: Location, rescue_expression: Node, location: Location } + # + # source://prism//lib/prism/node.rb#14969 + 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//prism/ripper_compat.rb#193 - def on_label_end(_); end + # attr_reader expression: Node + # + # source://prism//lib/prism/node.rb#14915 + sig { returns(Prism::Node) } + def expression; end - # source://prism//prism/ripper_compat.rb#194 - def on_lambda(_, _); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#14979 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_lbrace(_); end + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#14974 + sig { returns(String) } + def keyword; end - # source://prism//prism/ripper_compat.rb#193 - def on_lbracket(_); end + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#14918 + sig { returns(Prism::Location) } + def keyword_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_lparen(_); end + # attr_reader rescue_expression: Node + # + # source://prism//lib/prism/node.rb#14921 + sig { returns(Prism::Node) } + def rescue_expression; end - # source://prism//prism/ripper_compat.rb#194 - def on_magic_comment(_, _); end + # source://prism//lib/prism/node.rb#14936 + def set_newline_flag(newline_marked); end - # source://prism//prism/ripper_compat.rb#194 - def on_massign(_, _); 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#15003 + def type; end - # source://prism//prism/ripper_compat.rb#194 - def on_method_add_arg(_, _); 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#15013 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#194 - def on_method_add_block(_, _); end +# Represents a rescue statement. +# +# begin +# rescue Foo, *splat, Bar => ex +# foo +# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ +# end +# +# `Foo, *splat, Bar` are in the `exceptions` field. `ex` is in the `exception` field. +# +# source://prism//lib/prism/node.rb#15027 +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 + # + # @return [RescueNode] a new instance of RescueNode + # + # source://prism//lib/prism/node.rb#15047 + 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 + ).void + end + def initialize(keyword_loc, exceptions, operator_loc, reference, statements, consequent, location); end - # source://prism//prism/ripper_compat.rb#194 - def on_mlhs_add(_, _); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15058 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#194 - def on_mlhs_add_post(_, _); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#194 - def on_mlhs_add_star(_, _); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15078 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#192 - def on_mlhs_new; end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15068 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_mlhs_paren(_); end + # attr_reader consequent: RescueNode? + # + # source://prism//lib/prism/node.rb#15044 + sig { returns(T.nilable(Prism::RescueNode)) } + def consequent; end - # source://prism//prism/ripper_compat.rb#194 - def on_module(_, _); end + # def copy: (**params) -> RescueNode + # + # source://prism//lib/prism/node.rb#15083 + sig { params(params: T.untyped).returns(Prism::RescueNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#194 - def on_mrhs_add(_, _); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#194 - def on_mrhs_add_star(_, _); end + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, exceptions: Array[Node], operator_loc: Location?, reference: Node?, statements: StatementsNode?, consequent: RescueNode?, location: Location } + # + # source://prism//lib/prism/node.rb#15099 + 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//prism/ripper_compat.rb#192 - def on_mrhs_new; end + # attr_reader exceptions: Array[Node] + # + # source://prism//lib/prism/node.rb#15032 + sig { returns(T::Array[Prism::Node]) } + def exceptions; end - # source://prism//prism/ripper_compat.rb#193 - def on_mrhs_new_from_args(_); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15114 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_next(_); end + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#15104 + sig { returns(String) } + def keyword; end - # source://prism//prism/ripper_compat.rb#193 - def on_nl(_); end + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15029 + sig { returns(Prism::Location) } + def keyword_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_nokw_param(_); end + # def operator: () -> String? + # + # source://prism//lib/prism/node.rb#15109 + sig { returns(T.nilable(String)) } + def operator; end - # source://prism//prism/ripper_compat.rb#193 - def on_op(_); end + # attr_reader operator_loc: Location? + # + # source://prism//lib/prism/node.rb#15035 + sig { returns(T.nilable(Prism::Location)) } + def operator_loc; end - # source://prism//prism/ripper_compat.rb#195 - def on_opassign(_, _, _); end + # attr_reader reference: Node? + # + # source://prism//lib/prism/node.rb#15038 + sig { returns(T.nilable(Prism::Node)) } + def reference; end - # source://prism//prism/ripper_compat.rb#194 - def on_operator_ambiguous(_, _); end + # attr_reader statements: StatementsNode? + # + # source://prism//lib/prism/node.rb#15041 + sig { returns(T.nilable(Prism::StatementsNode)) } + def statements; end - # source://prism//prism/ripper_compat.rb#194 - def on_param_error(_, _); end - - # source://prism//prism/ripper_compat.rb#198 - def on_params(_, _, _, _, _, _, _); 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#15154 + def type; end - # source://prism//prism/ripper_compat.rb#193 - def on_paren(_); 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#15164 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#193 - def on_parse_error(_); end +# Represents a rest parameter to a method, block, or lambda definition. +# +# def a(*b) +# ^^ +# end +# +# source://prism//lib/prism/node.rb#15174 +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/node.rb#15188 + sig do + params( + flags: Integer, + name: T.nilable(Symbol), + name_loc: T.nilable(Prism::Location), + operator_loc: Prism::Location, + location: Prism::Location + ).void + end + def initialize(flags, name, name_loc, operator_loc, location); end - # source://prism//prism/ripper_compat.rb#193 - def on_period(_); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15197 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#193 - def on_program(_); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15202 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#194 - def on_qsymbols_add(_, _); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15212 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_qsymbols_beg(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15207 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#192 - def on_qsymbols_new; end + # def copy: (**params) -> RestParameterNode + # + # source://prism//lib/prism/node.rb#15217 + sig { params(params: T.untyped).returns(Prism::RestParameterNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#194 - def on_qwords_add(_, _); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15202 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#193 - def on_qwords_beg(_); 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#15231 + 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//prism/ripper_compat.rb#192 - def on_qwords_new; end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15246 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_rational(_); end + # attr_reader name: Symbol? + # + # source://prism//lib/prism/node.rb#15179 + sig { returns(T.nilable(Symbol)) } + def name; end - # source://prism//prism/ripper_compat.rb#193 - def on_rbrace(_); end + # attr_reader name_loc: Location? + # + # source://prism//lib/prism/node.rb#15182 + sig { returns(T.nilable(Prism::Location)) } + def name_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_rbracket(_); end + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#15241 + sig { returns(String) } + def operator; end - # source://prism//prism/ripper_compat.rb#192 - def on_redo; end + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#15185 + sig { returns(Prism::Location) } + def operator_loc; end - # source://prism//prism/ripper_compat.rb#194 - def on_regexp_add(_, _); end + # def repeated_parameter?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#15236 + sig { returns(T::Boolean) } + def repeated_parameter?; end - # source://prism//prism/ripper_compat.rb#193 - def on_regexp_beg(_); 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#15274 + def type; end - # source://prism//prism/ripper_compat.rb#193 - def on_regexp_end(_); end + private - # source://prism//prism/ripper_compat.rb#194 - def on_regexp_literal(_, _); end + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#15176 + sig { returns(Integer) } + def flags; end - # source://prism//prism/ripper_compat.rb#192 - def on_regexp_new; 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#15284 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#196 - def on_rescue(_, _, _, _); end +# Represents the use of the `retry` keyword. +# +# retry +# ^^^^^ +# +# source://prism//lib/prism/node.rb#15293 +class Prism::RetryNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [RetryNode] a new instance of RetryNode + # + # source://prism//lib/prism/node.rb#15295 + sig { params(location: Prism::Location).void } + def initialize(location); end - # source://prism//prism/ripper_compat.rb#194 - def on_rescue_mod(_, _); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15300 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#193 - def on_rest_param(_); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15305 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#192 - def on_retry; end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15315 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_return(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15310 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#192 - def on_return0; end + # def copy: (**params) -> RetryNode + # + # source://prism//lib/prism/node.rb#15320 + sig { params(params: T.untyped).returns(Prism::RetryNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_rparen(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15305 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#194 - def on_sclass(_, _); end + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#15330 + 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//prism/ripper_compat.rb#193 - def on_semicolon(_); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15335 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_sp(_); 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#15354 + def type; end - # source://prism//prism/ripper_compat.rb#194 - def on_stmts_add(_, _); 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#15364 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#192 - def on_stmts_new; end +# Represents the use of the `return` keyword. +# +# return 1 +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15373 +class Prism::ReturnNode < ::Prism::Node + # def initialize: (Location keyword_loc, ArgumentsNode? arguments, Location location) -> void + # + # @return [ReturnNode] a new instance of ReturnNode + # + # source://prism//lib/prism/node.rb#15381 + sig do + params( + keyword_loc: Prism::Location, + arguments: T.nilable(Prism::ArgumentsNode), + location: Prism::Location + ).void + end + def initialize(keyword_loc, arguments, location); end - # source://prism//prism/ripper_compat.rb#194 - def on_string_add(_, _); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15388 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#194 - def on_string_concat(_, _); end + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#15378 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end - # source://prism//prism/ripper_compat.rb#192 - def on_string_content; end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15393 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_string_dvar(_); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15405 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#193 - def on_string_embexpr(_); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15398 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#193 - def on_string_literal(_); end + # def copy: (**params) -> ReturnNode + # + # source://prism//lib/prism/node.rb#15410 + sig { params(params: T.untyped).returns(Prism::ReturnNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#193 - def on_super(_); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15393 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#193 - def on_symbeg(_); end + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, arguments: ArgumentsNode?, location: Location } + # + # source://prism//lib/prism/node.rb#15422 + 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//prism/ripper_compat.rb#193 - def on_symbol(_); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15432 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#193 - def on_symbol_literal(_); end + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#15427 + sig { returns(String) } + def keyword; end - # source://prism//prism/ripper_compat.rb#194 - def on_symbols_add(_, _); end + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15375 + sig { returns(Prism::Location) } + def keyword_loc; end - # source://prism//prism/ripper_compat.rb#193 - def on_symbols_beg(_); 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#15458 + def type; end - # source://prism//prism/ripper_compat.rb#192 - def on_symbols_new; 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#15468 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#193 - def on_tlambda(_); 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::RipperCompat` effectively as you would +# treat the `Ripper` class. +# +# source://prism//lib/prism/ripper_compat.rb#20 +class Prism::RipperCompat < ::Prism::Visitor + # Create a new RipperCompat object with the given source. + # + # @return [RipperCompat] a new instance of RipperCompat + # + # source://prism//lib/prism/ripper_compat.rb#74 + def initialize(source); end - # source://prism//prism/ripper_compat.rb#193 - def on_tlambeg(_); end + # The current column number of the parser. + # + # source://prism//lib/prism/ripper_compat.rb#71 + def column; end - # source://prism//prism/ripper_compat.rb#193 - def on_top_const_field(_); end + # True if the parser encountered an error during parsing. + # + # @return [Boolean] + # + # source://prism//lib/prism/ripper_compat.rb#86 + def error?; end - # source://prism//prism/ripper_compat.rb#193 - def on_top_const_ref(_); end + # The current line number of the parser. + # + # source://prism//lib/prism/ripper_compat.rb#68 + def lineno; end - # source://prism//prism/ripper_compat.rb#193 - def on_tstring_beg(_); end + # Parse the source and return the result. + # + # source://prism//lib/prism/ripper_compat.rb#91 + def parse; end - # source://prism//prism/ripper_compat.rb#193 - def on_tstring_content(_); end + # The source that is being parsed. + # + # source://prism//lib/prism/ripper_compat.rb#65 + def source; end - # source://prism//prism/ripper_compat.rb#193 - def on_tstring_end(_); end + # Visit a CallNode node. + # + # source://prism//lib/prism/ripper_compat.rb#110 + def visit_call_node(node); end - # source://prism//prism/ripper_compat.rb#194 - def on_unary(_, _); end + # Visit a FloatNode node. + # + # source://prism//lib/prism/ripper_compat.rb#123 + def visit_float_node(node); end - # source://prism//prism/ripper_compat.rb#193 - def on_undef(_); end + # Visit a ImaginaryNode node. + # + # source://prism//lib/prism/ripper_compat.rb#129 + def visit_imaginary_node(node); end - # source://prism//prism/ripper_compat.rb#195 - def on_unless(_, _, _); end + # Visit an IntegerNode node. + # + # source://prism//lib/prism/ripper_compat.rb#135 + def visit_integer_node(node); end - # source://prism//prism/ripper_compat.rb#194 - def on_unless_mod(_, _); end + # Visit a ProgramNode node. + # + # source://prism//lib/prism/ripper_compat.rb#155 + def visit_program_node(node); end - # source://prism//prism/ripper_compat.rb#194 - def on_until(_, _); end + # Visit a RationalNode node. + # + # source://prism//lib/prism/ripper_compat.rb#141 + def visit_rational_node(node); end - # source://prism//prism/ripper_compat.rb#194 - def on_until_mod(_, _); end + # Visit a StatementsNode node. + # + # source://prism//lib/prism/ripper_compat.rb#147 + def visit_statements_node(node); end - # source://prism//prism/ripper_compat.rb#194 - def on_var_alias(_, _); end + private - # source://prism//prism/ripper_compat.rb#193 - def on_var_field(_); end + # source://prism//lib/prism/ripper_compat.rb#192 + def _dispatch0; end - # source://prism//prism/ripper_compat.rb#193 - def on_var_ref(_); end + # source://prism//lib/prism/ripper_compat.rb#193 + def _dispatch1(_); end - # source://prism//prism/ripper_compat.rb#193 - def on_vcall(_); end + # source://prism//lib/prism/ripper_compat.rb#194 + def _dispatch2(_, _); end - # source://prism//prism/ripper_compat.rb#192 - def on_void_stmt; end + # source://prism//lib/prism/ripper_compat.rb#195 + def _dispatch3(_, _, _); end - # source://prism//prism/ripper_compat.rb#195 - def on_when(_, _, _); end + # source://prism//lib/prism/ripper_compat.rb#196 + def _dispatch4(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#194 - def on_while(_, _); end + # source://prism//lib/prism/ripper_compat.rb#197 + def _dispatch5(_, _, _, _, _); end - # source://prism//prism/ripper_compat.rb#194 - def on_while_mod(_, _); end + # source://prism//lib/prism/ripper_compat.rb#198 + def _dispatch7(_, _, _, _, _, _, _); end - # source://prism//prism/ripper_compat.rb#194 - def on_word_add(_, _); end + # This method is responsible for updating lineno and column information + # to reflect the current node. + # + # 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/ripper_compat.rb#182 + def bounds(location); end - # source://prism//prism/ripper_compat.rb#192 - def on_word_new; end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_BEGIN(_); end - # source://prism//prism/ripper_compat.rb#194 - def on_words_add(_, _); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_CHAR(_); end - # source://prism//prism/ripper_compat.rb#193 - def on_words_beg(_); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_END(_); end - # source://prism//prism/ripper_compat.rb#192 - def on_words_new; end + # source://prism//lib/prism/ripper_compat.rb#193 + def on___end__(_); end - # source://prism//prism/ripper_compat.rb#193 - def on_words_sep(_); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_alias(_, _); end - # source://prism//prism/ripper_compat.rb#194 - def on_xstring_add(_, _); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_alias_error(_, _); end - # source://prism//prism/ripper_compat.rb#193 - def on_xstring_literal(_); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_aref(_, _); end - # source://prism//prism/ripper_compat.rb#192 - def on_xstring_new; end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_aref_field(_, _); end - # source://prism//prism/ripper_compat.rb#193 - def on_yield(_); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_arg_ambiguous(_); end - # source://prism//prism/ripper_compat.rb#192 - def on_yield0; end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_arg_paren(_); end - # source://prism//prism/ripper_compat.rb#192 - def on_zsuper; end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_args_add(_, _); end - # Lazily initialize the parse result. - # - # source://prism//prism/ripper_compat.rb#188 - def result; end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_args_add_block(_, _); end - class << self - # This is a convenience method that runs the SexpBuilderPP subclass parser. - # - # source://prism//prism/ripper_compat.rb#171 - def sexp(source); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_args_add_star(_, _); end - # This is a convenience method that runs the SexpBuilder subclass parser. - # - # source://prism//prism/ripper_compat.rb#166 - def sexp_raw(source); end - end -end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_args_forward; end -# This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that -# returns the arrays of [type, *children]. -class Prism::RipperCompat::SexpBuilder < ::Prism::RipperCompat - private + # source://prism//lib/prism/ripper_compat.rb#192 + def on_args_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_BEGIN(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_array(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_CHAR(value); end + # source://prism//lib/prism/ripper_compat.rb#196 + def on_aryptn(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_END(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_assign(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on___end__(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_assign_error(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_alias(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_assoc_new(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_alias_error(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_assoc_splat(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_aref(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_assoclist_from_args(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_aref_field(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_backref(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_arg_ambiguous(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_backtick(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_arg_paren(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_bare_assoc_hash(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_args_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_begin(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_args_add_block(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_binary(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_args_add_star(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_block_var(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_args_forward(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_blockarg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_args_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#196 + def on_bodystmt(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_array(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_brace_block(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_aryptn(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_break(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_assign(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_call(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_assign_error(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_case(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_assoc_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_class(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_assoc_splat(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_class_name_error(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_assoclist_from_args(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_comma(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_backref(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_command(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_backtick(value); end + # source://prism//lib/prism/ripper_compat.rb#196 + def on_command_call(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_bare_assoc_hash(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_comment(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_begin(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_const(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_binary(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_const_path_field(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_block_var(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_const_path_ref(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_blockarg(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_const_ref(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_bodystmt(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_cvar(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_brace_block(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_def(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_break(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_defined(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_call(*args); end + # source://prism//lib/prism/ripper_compat.rb#197 + def on_defs(_, _, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_case(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_do_block(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_class(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_dot2(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_class_name_error(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_dot3(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_comma(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_dyna_symbol(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_command(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_else(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_command_call(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_elsif(_, _, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_comment(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embdoc(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_const(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embdoc_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_const_path_field(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embdoc_end(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_const_path_ref(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embexpr_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_const_ref(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embexpr_end(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_cvar(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_embvar(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_def(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_ensure(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_defined(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_excessed_comma; end - # source://prism//prism/ripper_compat.rb#27 - def on_defs(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_fcall(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_do_block(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_field(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_dot2(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_float(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_dot3(*args); end + # source://prism//lib/prism/ripper_compat.rb#196 + def on_fndptn(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_dyna_symbol(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_for(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_else(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_gvar(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_elsif(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_hash(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_embdoc(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_heredoc_beg(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_embdoc_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_heredoc_dedent(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_embdoc_end(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_heredoc_end(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_embexpr_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_hshptn(_, _, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_embexpr_end(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_ident(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_embvar(value); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_if(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_ensure(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_if_mod(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_excessed_comma(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_ifop(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_fcall(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_ignored_nl(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_field(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_ignored_sp(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_float(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_imaginary(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_fndptn(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_in(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_for(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_int(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_gvar(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_ivar(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_hash(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_kw(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_heredoc_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_kwrest_param(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_heredoc_dedent(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_label(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_heredoc_end(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_label_end(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_hshptn(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_lambda(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_ident(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_lbrace(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_if(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_lbracket(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_if_mod(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_lparen(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_ifop(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_magic_comment(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_ignored_nl(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_massign(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_ignored_sp(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_method_add_arg(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_imaginary(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_method_add_block(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_in(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_mlhs_add(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_int(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_mlhs_add_post(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_ivar(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_mlhs_add_star(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_kw(value); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_mlhs_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_kwrest_param(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_mlhs_paren(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_label(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_module(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_label_end(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_mrhs_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_lambda(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_mrhs_add_star(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_lbrace(value); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_mrhs_new; end - # source://prism//prism/ripper_compat.rb#33 - def on_lbracket(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_mrhs_new_from_args(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_lparen(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_next(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_magic_comment(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_nl(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_massign(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_nokw_param(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_method_add_arg(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_op(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_method_add_block(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_opassign(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_mlhs_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_operator_ambiguous(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_mlhs_add_post(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_param_error(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_mlhs_add_star(*args); end + # source://prism//lib/prism/ripper_compat.rb#198 + def on_params(_, _, _, _, _, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_mlhs_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_paren(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_mlhs_paren(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_parse_error(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_module(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_period(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_mrhs_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_program(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_mrhs_add_star(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_qsymbols_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_mrhs_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_qsymbols_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_mrhs_new_from_args(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_qsymbols_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_next(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_qwords_add(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_nl(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_qwords_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_nokw_param(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_qwords_new; end - # source://prism//prism/ripper_compat.rb#33 - def on_op(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_rational(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_opassign(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_rbrace(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_operator_ambiguous(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_rbracket(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_param_error(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_redo; end - # source://prism//prism/ripper_compat.rb#27 - def on_params(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_regexp_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_paren(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_regexp_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_parse_error(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_regexp_end(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_period(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_regexp_literal(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_program(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_regexp_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_qsymbols_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#196 + def on_rescue(_, _, _, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_qsymbols_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_rescue_mod(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_qsymbols_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_rest_param(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_qwords_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_retry; end - # source://prism//prism/ripper_compat.rb#33 - def on_qwords_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_return(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_qwords_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_return0; end - # source://prism//prism/ripper_compat.rb#33 - def on_rational(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_rparen(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_rbrace(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_sclass(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_rbracket(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_semicolon(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_redo(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_sp(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_regexp_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_stmts_add(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_regexp_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_stmts_new; end - # source://prism//prism/ripper_compat.rb#33 - def on_regexp_end(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_string_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_regexp_literal(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_string_concat(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_regexp_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_string_content; end - # source://prism//prism/ripper_compat.rb#27 - def on_rescue(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_string_dvar(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_rescue_mod(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_string_embexpr(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_rest_param(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_string_literal(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_retry(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_super(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_return(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_symbeg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_return0(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_symbol(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_rparen(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_symbol_literal(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_sclass(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_symbols_add(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_semicolon(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_symbols_beg(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_sp(value); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_symbols_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_stmts_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_tlambda(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_stmts_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_tlambeg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_top_const_field(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_concat(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_top_const_ref(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_content(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_tstring_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_dvar(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_tstring_content(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_embexpr(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_tstring_end(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_string_literal(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_unary(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_super(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_undef(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_symbeg(value); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_unless(_, _, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_symbol(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_unless_mod(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_symbol_literal(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_until(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_symbols_add(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_until_mod(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_symbols_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_var_alias(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_symbols_new(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_var_field(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_tlambda(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_var_ref(_); end - # source://prism//prism/ripper_compat.rb#33 - def on_tlambeg(value); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_vcall(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_top_const_field(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_void_stmt; end - # source://prism//prism/ripper_compat.rb#27 - def on_top_const_ref(*args); end + # source://prism//lib/prism/ripper_compat.rb#195 + def on_when(_, _, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_tstring_beg(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_while(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_tstring_content(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_while_mod(_, _); end - # source://prism//prism/ripper_compat.rb#33 - def on_tstring_end(value); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_word_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_unary(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_word_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_undef(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_words_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_unless(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_words_beg(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_unless_mod(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_words_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_until(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_words_sep(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_until_mod(*args); end + # source://prism//lib/prism/ripper_compat.rb#194 + def on_xstring_add(_, _); end - # source://prism//prism/ripper_compat.rb#27 - def on_var_alias(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_xstring_literal(_); end - # source://prism//prism/ripper_compat.rb#27 - def on_var_field(*args); end + # source://prism//lib/prism/ripper_compat.rb#192 + def on_xstring_new; end - # source://prism//prism/ripper_compat.rb#27 - def on_var_ref(*args); end + # source://prism//lib/prism/ripper_compat.rb#193 + def on_yield(_); end - # source://prism//prism/ripper_compat.rb#27 + # source://prism//lib/prism/ripper_compat.rb#192 + def on_yield0; end + + # source://prism//lib/prism/ripper_compat.rb#192 + def on_zsuper; end + + # Lazily initialize the parse result. + # + # source://prism//lib/prism/ripper_compat.rb#188 + def result; end + + class << self + # This is a convenience method that runs the SexpBuilderPP subclass parser. + # + # source://prism//lib/prism/ripper_compat.rb#171 + def sexp(source); end + + # This is a convenience method that runs the SexpBuilder subclass parser. + # + # source://prism//lib/prism/ripper_compat.rb#166 + def sexp_raw(source); end + end +end + +# This class mirrors the ::Ripper::SexpBuilder subclass of ::Ripper that +# returns the arrays of [type, *children]. +# +# source://prism//lib/prism/ripper_compat.rb#23 +class Prism::RipperCompat::SexpBuilder < ::Prism::RipperCompat + private + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_BEGIN(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_CHAR(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_END(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on___end__(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_alias(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_alias_error(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_aref(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_aref_field(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_arg_ambiguous(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_arg_paren(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_args_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_args_add_block(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_args_add_star(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_args_forward(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_args_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_array(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_aryptn(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_assign(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_assign_error(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_assoc_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_assoc_splat(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_assoclist_from_args(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_backref(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_backtick(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_bare_assoc_hash(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_begin(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_binary(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_block_var(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_blockarg(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_bodystmt(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_brace_block(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_break(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_call(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_case(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_class(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_class_name_error(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_comma(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_command(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_command_call(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_comment(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_const(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_const_path_field(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_const_path_ref(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_const_ref(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_cvar(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_def(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_defined(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_defs(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_do_block(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_dot2(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_dot3(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_dyna_symbol(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_else(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_elsif(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embdoc(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embdoc_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embdoc_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embexpr_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embexpr_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_embvar(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_ensure(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_excessed_comma(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_fcall(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_field(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_float(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_fndptn(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_for(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_gvar(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_hash(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_heredoc_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_heredoc_dedent(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_heredoc_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_hshptn(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_ident(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_if(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_if_mod(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_ifop(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_ignored_nl(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_ignored_sp(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_imaginary(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_in(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_int(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_ivar(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_kw(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_kwrest_param(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_label(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_label_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_lambda(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_lbrace(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_lbracket(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_lparen(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_magic_comment(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_massign(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_method_add_arg(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_method_add_block(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mlhs_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mlhs_add_post(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mlhs_add_star(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mlhs_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mlhs_paren(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_module(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mrhs_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mrhs_add_star(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mrhs_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_mrhs_new_from_args(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_next(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_nl(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_nokw_param(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_op(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_opassign(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_operator_ambiguous(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_param_error(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_params(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_paren(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_parse_error(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_period(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_program(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_qsymbols_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_qsymbols_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_qsymbols_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_qwords_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_qwords_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_qwords_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_rational(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_rbrace(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_rbracket(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_redo(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_regexp_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_regexp_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_regexp_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_regexp_literal(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_regexp_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_rescue(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_rescue_mod(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_rest_param(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_retry(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_return(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_return0(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_rparen(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_sclass(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_semicolon(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_sp(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_stmts_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_stmts_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_concat(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_content(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_dvar(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_embexpr(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_string_literal(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_super(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_symbeg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_symbol(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_symbol_literal(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_symbols_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_symbols_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_symbols_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_tlambda(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_tlambeg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_top_const_field(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_top_const_ref(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_tstring_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_tstring_content(value); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_tstring_end(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_unary(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_undef(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_unless(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_unless_mod(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_until(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_until_mod(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_var_alias(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_var_field(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_var_ref(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 def on_vcall(*args); end - # source://prism//prism/ripper_compat.rb#27 - def on_void_stmt(*args); end + # source://prism//lib/prism/ripper_compat.rb#27 + def on_void_stmt(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_when(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_while(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_while_mod(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_word_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_word_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_words_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_words_beg(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_words_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#33 + def on_words_sep(value); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_xstring_add(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_xstring_literal(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_xstring_new(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_yield(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_yield0(*args); end + + # source://prism//lib/prism/ripper_compat.rb#27 + def on_zsuper(*args); 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/ripper_compat.rb#42 +class Prism::RipperCompat::SexpBuilderPP < ::Prism::RipperCompat::SexpBuilder + private + + # source://prism//lib/prism/ripper_compat.rb#45 + def _dispatch_event_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def _dispatch_event_push(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_args_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_args_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_mlhs_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_mlhs_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_mrhs_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_mrhs_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_qsymbols_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_qsymbols_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_qwords_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_qwords_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_regexp_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_regexp_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_stmts_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_stmts_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_string_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_symbols_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_symbols_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_word_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_word_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_words_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_words_new; end + + # source://prism//lib/prism/ripper_compat.rb#49 + def on_xstring_add(list, item); end + + # source://prism//lib/prism/ripper_compat.rb#45 + def on_xstring_new; end +end + +# Represents the `self` keyword. +# +# self +# ^^^^ +# +# source://prism//lib/prism/node.rb#15477 +class Prism::SelfNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [SelfNode] a new instance of SelfNode + # + # source://prism//lib/prism/node.rb#15479 + sig { params(location: Prism::Location).void } + def initialize(location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15484 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15489 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15499 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15494 + def compact_child_nodes; end + + # def copy: (**params) -> SelfNode + # + # source://prism//lib/prism/node.rb#15504 + sig { params(params: T.untyped).returns(Prism::SelfNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15489 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#15514 + 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 + # + # source://prism//lib/prism/node.rb#15519 + def inspect(inspector = T.unsafe(nil)); 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#15538 + 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#15548 + def type; end + end +end + +# A module responsible for deserializing parse results. +# +# 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#92 + 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#102 + def load_metadata; end + + # source://prism//lib/prism/serialize.rb#135 + def load_nodes; end + + # source://prism//lib/prism/serialize.rb#148 + def load_result; end + + # source://prism//lib/prism/serialize.rb#88 + def load_start_line; end + + # source://prism//lib/prism/serialize.rb#111 + def load_tokens; end + + # source://prism//lib/prism/serialize.rb#124 + def load_tokens_result; end + + # Returns the value of attribute serialized. + # + # source://prism//lib/prism/serialize.rb#54 + def serialized; end + + # Returns the value of attribute source. + # + # source://prism//lib/prism/serialize.rb#55 + def source; end + + # Returns the value of attribute start_line. + # + # source://prism//lib/prism/serialize.rb#56 + def start_line; end + + private + + # source://prism//lib/prism/serialize.rb#211 + def load_constant(index); end + + # source://prism//lib/prism/serialize.rb#187 + def load_embedded_string; end + + # source://prism//lib/prism/serialize.rb#241 + def load_error_level; end + + # source://prism//lib/prism/serialize.rb#203 + def load_location; end + + # source://prism//lib/prism/serialize.rb#266 + def load_node; end + + # source://prism//lib/prism/serialize.rb#236 + def load_optional_constant; end + + # source://prism//lib/prism/serialize.rb#207 + def load_optional_location; end + + # source://prism//lib/prism/serialize.rb#180 + def load_optional_node; end + + # source://prism//lib/prism/serialize.rb#232 + def load_required_constant; end + + # source://prism//lib/prism/serialize.rb#176 + def load_serialized_length; end + + # source://prism//lib/prism/serialize.rb#191 + def load_string; end + + # source://prism//lib/prism/serialize.rb#171 + 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#157 + def load_varuint; end + + # source://prism//lib/prism/serialize.rb#252 + def load_warning_level; end +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) + +# 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) + +# 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) + +# The token types that can be indexed by their enum values. +# +# source://prism//lib/prism/serialize.rb#1178 +Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) + +# Represents a singleton class declaration involving the `class` keyword. +# +# class << self end +# ^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15557 +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 + # + # @return [SingletonClassNode] a new instance of SingletonClassNode + # + # source://prism//lib/prism/node.rb#15577 + 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 + ).void + end + def initialize(locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15588 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # attr_reader body: Node? + # + # source://prism//lib/prism/node.rb#15571 + sig { returns(T.nilable(Prism::Node)) } + def body; end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15593 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def class_keyword: () -> String + # + # source://prism//lib/prism/node.rb#15632 + sig { returns(String) } + def class_keyword; end + + # attr_reader class_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15562 + sig { returns(Prism::Location) } + def class_keyword_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15606 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15598 + def compact_child_nodes; end + + # def copy: (**params) -> SingletonClassNode + # + # source://prism//lib/prism/node.rb#15611 + sig { params(params: T.untyped).returns(Prism::SingletonClassNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15593 + sig { 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 } + # + # source://prism//lib/prism/node.rb#15627 + 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 end_keyword: () -> String + # + # source://prism//lib/prism/node.rb#15642 + sig { returns(String) } + def end_keyword; end + + # attr_reader end_keyword_loc: Location + # + # source://prism//lib/prism/node.rb#15574 + sig { returns(Prism::Location) } + def end_keyword_loc; end + + # attr_reader expression: Node + # + # source://prism//lib/prism/node.rb#15568 + sig { returns(Prism::Node) } + def expression; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15647 + def inspect(inspector = T.unsafe(nil)); end + + # attr_reader locals: Array[Symbol] + # + # source://prism//lib/prism/node.rb#15559 + sig { returns(T::Array[Symbol]) } + def locals; end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#15637 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#15565 + 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#15678 + 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#15688 + 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. +# +# source://prism//lib/prism/parse_result.rb#7 +class Prism::Source + # Create a new source object with the given source code and newline byte + # offsets. If no newline byte offsets are given, they will be computed from + # the source code. + # + # @return [Source] a new instance of Source + # + # source://prism//lib/prism/parse_result.rb#20 + def initialize(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end + + # Return the column number in characters for the given byte offset. + # + # source://prism//lib/prism/parse_result.rb#55 + def character_column(byte_offset); end + + # Return the character offset for the given byte offset. + # + # source://prism//lib/prism/parse_result.rb#50 + def character_offset(byte_offset); end + + # Return the column number for the given byte offset. + # + # source://prism//lib/prism/parse_result.rb#45 + def column(byte_offset); end + + # Binary search through the offsets to find the line number for the given + # byte offset. + # + # source://prism//lib/prism/parse_result.rb#34 + def line(byte_offset); end + + sig { params(value: Integer).returns(Integer) } + def line_offset(value); end + + # Return the byte offset of the start of the line corresponding to the given + # byte offset. + # + # source://prism//lib/prism/parse_result.rb#40 + def line_start(byte_offset); end + + # The list of newline byte offsets in the source code. + # + # source://prism//lib/prism/parse_result.rb#15 + sig { returns(T::Array[Integer]) } + def offsets; end + + # Perform a byteslice on the source code using the given byte offset and + # byte length. + # + # source://prism//lib/prism/parse_result.rb#28 + def slice(byte_offset, length); end + + # The source code that this source object represents. + # + # source://prism//lib/prism/parse_result.rb#9 + sig { returns(String) } + def source; end + + # The line number where this source starts. + # + # source://prism//lib/prism/parse_result.rb#12 + def start_line; end + + # The line number where this source starts. + # + # source://prism//lib/prism/parse_result.rb#12 + def start_line=(_arg0); end + + private + + # Find all of the newlines in the source code and return their byte offsets + # from the start of the string an array. + # + # source://prism//lib/prism/parse_result.rb#83 + def compute_offsets(code); end + + # Binary search through the offsets to find the line number for the given + # byte offset. + # + # source://prism//lib/prism/parse_result.rb#63 + def find_line(byte_offset); end +end + +# Represents the use of the `__ENCODING__` keyword. +# +# __ENCODING__ +# ^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15697 +class Prism::SourceEncodingNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [SourceEncodingNode] a new instance of SourceEncodingNode + # + # source://prism//lib/prism/node.rb#15699 + sig { params(location: Prism::Location).void } + def initialize(location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15704 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15709 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15719 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15714 + def compact_child_nodes; end + + # def copy: (**params) -> SourceEncodingNode + # + # source://prism//lib/prism/node.rb#15724 + sig { params(params: T.untyped).returns(Prism::SourceEncodingNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15709 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#15734 + 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 + # + # source://prism//lib/prism/node.rb#15739 + def inspect(inspector = T.unsafe(nil)); 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#15758 + 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#15768 + def type; end + end +end + +# Represents the use of the `__FILE__` keyword. +# +# __FILE__ +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15777 +class Prism::SourceFileNode < ::Prism::Node + # def initialize: (String filepath, Location location) -> void + # + # @return [SourceFileNode] a new instance of SourceFileNode + # + # source://prism//lib/prism/node.rb#15782 + sig { params(filepath: String, location: Prism::Location).void } + def initialize(filepath, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15788 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15793 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15803 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15798 + def compact_child_nodes; end + + # def copy: (**params) -> SourceFileNode + # + # source://prism//lib/prism/node.rb#15808 + sig { params(params: T.untyped).returns(Prism::SourceFileNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15793 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { filepath: String, location: Location } + # + # source://prism//lib/prism/node.rb#15819 + 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 + + # attr_reader filepath: String + # + # source://prism//lib/prism/node.rb#15779 + sig { returns(String) } + def filepath; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#15824 + def inspect(inspector = T.unsafe(nil)); 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#15844 + 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#15854 + def type; end + end +end + +# Represents the use of the `__LINE__` keyword. +# +# __LINE__ +# ^^^^^^^^ +# +# source://prism//lib/prism/node.rb#15863 +class Prism::SourceLineNode < ::Prism::Node + # def initialize: (Location location) -> void + # + # @return [SourceLineNode] a new instance of SourceLineNode + # + # source://prism//lib/prism/node.rb#15865 + sig { params(location: Prism::Location).void } + def initialize(location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15870 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15875 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15885 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15880 + def compact_child_nodes; end + + # def copy: (**params) -> SourceLineNode + # + # source://prism//lib/prism/node.rb#15890 + sig { params(params: T.untyped).returns(Prism::SourceLineNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15875 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } + # + # source://prism//lib/prism/node.rb#15900 + 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 + # + # source://prism//lib/prism/node.rb#15905 + def inspect(inspector = T.unsafe(nil)); 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#15924 + 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#15934 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#27 - def on_when(*args); end +# Represents the use of the splat operator. +# +# [*a] +# ^^ +# +# source://prism//lib/prism/node.rb#15943 +class Prism::SplatNode < ::Prism::Node + # def initialize: (Location operator_loc, Node? expression, Location location) -> void + # + # @return [SplatNode] a new instance of SplatNode + # + # source://prism//lib/prism/node.rb#15951 + sig { params(operator_loc: Prism::Location, expression: T.nilable(Prism::Node), location: Prism::Location).void } + def initialize(operator_loc, expression, location); end - # source://prism//prism/ripper_compat.rb#27 - def on_while(*args); end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#15958 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#27 - def on_while_mod(*args); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15963 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#27 - def on_word_add(*args); end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#15975 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#27 - def on_word_new(*args); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#15968 + def compact_child_nodes; end + + # def copy: (**params) -> SplatNode + # + # source://prism//lib/prism/node.rb#15980 + sig { params(params: T.untyped).returns(Prism::SplatNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#15963 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { operator_loc: Location, expression: Node?, location: Location } + # + # source://prism//lib/prism/node.rb#15992 + 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 + + # attr_reader expression: Node? + # + # source://prism//lib/prism/node.rb#15948 + sig { returns(T.nilable(Prism::Node)) } + def expression; end + + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#16002 + def inspect(inspector = T.unsafe(nil)); end + + # def operator: () -> String + # + # source://prism//lib/prism/node.rb#15997 + sig { returns(String) } + def operator; end + + # attr_reader operator_loc: Location + # + # source://prism//lib/prism/node.rb#15945 + 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#16028 + 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#16038 + def type; end + end +end + +# Represents a set of statements contained within some scope. +# +# foo; bar; baz +# ^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16047 +class Prism::StatementsNode < ::Prism::Node + # def initialize: (Array[Node] body, Location location) -> void + # + # @return [StatementsNode] a new instance of StatementsNode + # + # source://prism//lib/prism/node.rb#16052 + sig { params(body: T::Array[Prism::Node], location: Prism::Location).void } + def initialize(body, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#16058 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # attr_reader body: Array[Node] + # + # source://prism//lib/prism/node.rb#16049 + sig { returns(T::Array[Prism::Node]) } + def body; end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#16073 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#16068 + def compact_child_nodes; end + + # def copy: (**params) -> StatementsNode + # + # source://prism//lib/prism/node.rb#16078 + sig { params(params: T.untyped).returns(Prism::StatementsNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end + + # def deconstruct_keys: (Array[Symbol] keys) -> { body: Array[Node], location: Location } + # + # source://prism//lib/prism/node.rb#16089 + 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 + # + # source://prism//lib/prism/node.rb#16094 + def inspect(inspector = T.unsafe(nil)); 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#16114 + 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#16124 + def type; end + end +end + +# Flags for string nodes. +# +# source://prism//lib/prism/node.rb#17662 +module Prism::StringFlags; end + +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#17667 +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#17664 +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#17670 +Prism::StringFlags::FROZEN = 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" +# ^^^^^ +# +# %w[foo] +# ^^^ +# +# "foo #{bar} baz" +# ^^^^ ^^^^ +# +# source://prism//lib/prism/node.rb#16139 +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 [StringNode] a new instance of StringNode + # + # source://prism//lib/prism/node.rb#16156 + sig do + params( + 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(flags, opening_loc, content_loc, closing_loc, unescaped, location); end + + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#16166 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end + + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16171 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end + + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#16231 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#16150 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#16181 + def comment_targets; end + + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#16176 + def compact_child_nodes; end + + # def content: () -> String + # + # source://prism//lib/prism/node.rb#16226 + sig { returns(String) } + def content; end + + # attr_reader content_loc: Location + # + # source://prism//lib/prism/node.rb#16147 + sig { returns(Prism::Location) } + def content_loc; end + + # def copy: (**params) -> StringNode + # + # source://prism//lib/prism/node.rb#16186 + sig { params(params: T.untyped).returns(Prism::StringNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#27 - def on_words_add(*args); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16171 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#33 - def on_words_beg(value); 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#16201 + 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//prism/ripper_compat.rb#27 - def on_words_new(*args); end + # def forced_binary_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16211 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end - # source://prism//prism/ripper_compat.rb#33 - def on_words_sep(value); end + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16206 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # source://prism//prism/ripper_compat.rb#27 - def on_xstring_add(*args); end + # def frozen?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16216 + sig { returns(T::Boolean) } + def frozen?; end - # source://prism//prism/ripper_compat.rb#27 - def on_xstring_literal(*args); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#16236 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#27 - def on_xstring_new(*args); end + # def opening: () -> String? + # + # source://prism//lib/prism/node.rb#16221 + sig { returns(T.nilable(String)) } + def opening; end - # source://prism//prism/ripper_compat.rb#27 - def on_yield(*args); end + # attr_reader opening_loc: Location? + # + # source://prism//lib/prism/node.rb#16144 + sig { returns(T.nilable(Prism::Location)) } + def opening_loc; end - # source://prism//prism/ripper_compat.rb#27 - def on_yield0(*args); 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#16261 + def type; end - # source://prism//prism/ripper_compat.rb#27 - def on_zsuper(*args); end -end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#16153 + sig { returns(String) } + def unescaped; 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. -class Prism::RipperCompat::SexpBuilderPP < ::Prism::RipperCompat::SexpBuilder private - # source://prism//prism/ripper_compat.rb#45 - def _dispatch_event_new; end + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#16141 + sig { returns(Integer) } + def flags; end - # source://prism//prism/ripper_compat.rb#49 - def _dispatch_event_push(list, item); 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#16271 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#49 - def on_args_add(list, item); end +# Represents the use of the `super` keyword with parentheses or arguments. +# +# super() +# ^^^^^^^ +# +# super foo, bar +# ^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16283 +class Prism::SuperNode < ::Prism::Node + # def initialize: (Location keyword_loc, Location? lparen_loc, ArgumentsNode? arguments, Location? rparen_loc, Node? block, Location location) -> void + # + # @return [SuperNode] a new instance of SuperNode + # + # source://prism//lib/prism/node.rb#16300 + 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 + ).void + end + def initialize(keyword_loc, lparen_loc, arguments, rparen_loc, block, location); end - # source://prism//prism/ripper_compat.rb#45 - def on_args_new; end + # def accept: (Visitor visitor) -> void + # + # source://prism//lib/prism/node.rb#16310 + sig { params(visitor: Prism::Visitor).void } + def accept(visitor); end - # source://prism//prism/ripper_compat.rb#49 - def on_mlhs_add(list, item); end + # attr_reader arguments: ArgumentsNode? + # + # source://prism//lib/prism/node.rb#16291 + sig { returns(T.nilable(Prism::ArgumentsNode)) } + def arguments; end - # source://prism//prism/ripper_compat.rb#45 - def on_mlhs_new; end + # attr_reader block: Node? + # + # source://prism//lib/prism/node.rb#16297 + sig { returns(T.nilable(Prism::Node)) } + def block; end - # source://prism//prism/ripper_compat.rb#49 - def on_mrhs_add(list, item); end + # def child_nodes: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16315 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def child_nodes; end - # source://prism//prism/ripper_compat.rb#45 - def on_mrhs_new; end + # def comment_targets: () -> Array[Node | Location] + # + # source://prism//lib/prism/node.rb#16328 + def comment_targets; end - # source://prism//prism/ripper_compat.rb#49 - def on_qsymbols_add(list, item); end + # def compact_child_nodes: () -> Array[Node] + # + # source://prism//lib/prism/node.rb#16320 + def compact_child_nodes; end - # source://prism//prism/ripper_compat.rb#45 - def on_qsymbols_new; end + # def copy: (**params) -> SuperNode + # + # source://prism//lib/prism/node.rb#16333 + sig { params(params: T.untyped).returns(Prism::SuperNode) } + def copy(**params); end - # source://prism//prism/ripper_compat.rb#49 - def on_qwords_add(list, item); end + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16315 + sig { returns(T::Array[T.nilable(Prism::Node)]) } + def deconstruct; end - # source://prism//prism/ripper_compat.rb#45 - def on_qwords_new; end + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: Node?, location: Location } + # + # source://prism//lib/prism/node.rb#16348 + 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//prism/ripper_compat.rb#49 - def on_regexp_add(list, item); end + # def inspect(NodeInspector inspector) -> String + # + # source://prism//lib/prism/node.rb#16368 + def inspect(inspector = T.unsafe(nil)); end - # source://prism//prism/ripper_compat.rb#45 - def on_regexp_new; end + # def keyword: () -> String + # + # source://prism//lib/prism/node.rb#16353 + sig { returns(String) } + def keyword; end - # source://prism//prism/ripper_compat.rb#49 - def on_stmts_add(list, item); end + # attr_reader keyword_loc: Location + # + # source://prism//lib/prism/node.rb#16285 + sig { returns(Prism::Location) } + def keyword_loc; end - # source://prism//prism/ripper_compat.rb#45 - def on_stmts_new; end + # def lparen: () -> String? + # + # source://prism//lib/prism/node.rb#16358 + sig { returns(T.nilable(String)) } + def lparen; end - # source://prism//prism/ripper_compat.rb#49 - def on_string_add(list, item); end + # attr_reader lparen_loc: Location? + # + # source://prism//lib/prism/node.rb#16288 + sig { returns(T.nilable(Prism::Location)) } + def lparen_loc; end - # source://prism//prism/ripper_compat.rb#49 - def on_symbols_add(list, item); end + # def rparen: () -> String? + # + # source://prism//lib/prism/node.rb#16363 + sig { returns(T.nilable(String)) } + def rparen; end - # source://prism//prism/ripper_compat.rb#45 - def on_symbols_new; end + # attr_reader rparen_loc: Location? + # + # source://prism//lib/prism/node.rb#16294 + sig { returns(T.nilable(Prism::Location)) } + def rparen_loc; end - # source://prism//prism/ripper_compat.rb#49 - def on_word_add(list, item); 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#16402 + def type; end - # source://prism//prism/ripper_compat.rb#45 - def on_word_new; 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#16412 + def type; end + end +end - # source://prism//prism/ripper_compat.rb#49 - def on_words_add(list, item); end +# Flags for symbol nodes. +# +# source://prism//lib/prism/node.rb#17674 +module Prism::SymbolFlags; end - # source://prism//prism/ripper_compat.rb#45 - def on_words_new; end +# internal bytes forced the encoding to binary +# +# source://prism//lib/prism/node.rb#17679 +Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#49 - def on_xstring_add(list, item); end +# internal bytes forced the encoding to US-ASCII +# +# source://prism//lib/prism/node.rb#17682 +Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) - # source://prism//prism/ripper_compat.rb#45 - def on_xstring_new; end -end +# internal bytes forced the encoding to UTF-8 +# +# source://prism//lib/prism/node.rb#17676 +Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) -# Represents the `self` keyword. +# Represents a symbol literal or a symbol contained within a `%i` list. # -# self +# :foo # ^^^^ -class Prism::SelfNode < ::Prism::Node - # def initialize: (location: Location) -> void +# +# %i[foo] +# ^^^ +# +# source://prism//lib/prism/node.rb#16424 +class Prism::SymbolNode < ::Prism::Node + # def initialize: (Integer flags, Location? opening_loc, Location? value_loc, Location? closing_loc, String unescaped, Location location) -> void # - # @return [SelfNode] a new instance of SelfNode + # @return [SymbolNode] a new instance of SymbolNode # - # source://prism//prism/node.rb#15204 - def initialize(location); end + # source://prism//lib/prism/node.rb#16441 + 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 + ).void + end + def initialize(flags, opening_loc, value_loc, closing_loc, unescaped, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#15209 + # source://prism//lib/prism/node.rb#16451 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#15214 + # source://prism//lib/prism/node.rb#16456 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end + # def closing: () -> String? + # + # source://prism//lib/prism/node.rb#16516 + sig { returns(T.nilable(String)) } + def closing; end + + # attr_reader closing_loc: Location? + # + # source://prism//lib/prism/node.rb#16435 + sig { returns(T.nilable(Prism::Location)) } + def closing_loc; end + # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#15224 + # source://prism//lib/prism/node.rb#16466 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#15219 + # source://prism//lib/prism/node.rb#16461 def compact_child_nodes; end - # def copy: (**params) -> SelfNode + # def copy: (**params) -> SymbolNode + # + # source://prism//lib/prism/node.rb#16471 + sig { params(params: T.untyped).returns(Prism::SymbolNode) } + def copy(**params); end + + # def child_nodes: () -> Array[nil | Node] + # def deconstruct: () -> Array[nil | Node] + # + # source://prism//lib/prism/node.rb#16456 + sig { 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#16486 + 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 forced_binary_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16496 + sig { returns(T::Boolean) } + def forced_binary_encoding?; end + + # def forced_us_ascii_encoding?: () -> bool + # + # @return [Boolean] + # + # source://prism//lib/prism/node.rb#16501 + sig { returns(T::Boolean) } + def forced_us_ascii_encoding?; end + + # def forced_utf8_encoding?: () -> bool + # + # @return [Boolean] # - # source://prism//prism/node.rb#15229 - def copy(**params); end + # source://prism//lib/prism/node.rb#16491 + sig { returns(T::Boolean) } + def forced_utf8_encoding?; end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#15214 - def deconstruct; end + # source://prism//lib/prism/node.rb#16521 + def inspect(inspector = T.unsafe(nil)); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def opening: () -> String? # - # source://prism//prism/node.rb#15239 - def deconstruct_keys(keys); end + # source://prism//lib/prism/node.rb#16506 + sig { returns(T.nilable(String)) } + def opening; end - # def inspect(inspector: NodeInspector) -> String + # attr_reader opening_loc: Location? # - # source://prism//prism/node.rb#15244 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/node.rb#16429 + 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 @@ -22151,9 +28126,35 @@ class Prism::SelfNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#15263 + # source://prism//lib/prism/node.rb#16546 def type; end + # attr_reader unescaped: String + # + # source://prism//lib/prism/node.rb#16438 + sig { returns(String) } + def unescaped; end + + # def value: () -> String? + # + # source://prism//lib/prism/node.rb#16511 + sig { returns(T.nilable(String)) } + def value; end + + # attr_reader value_loc: Location? + # + # source://prism//lib/prism/node.rb#16432 + sig { returns(T.nilable(Prism::Location)) } + def value_loc; end + + private + + # Returns the value of attribute flags. + # + # source://prism//lib/prism/node.rb#16426 + 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. @@ -22162,1380 +28163,1430 @@ class Prism::SelfNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#15273 + # source://prism//lib/prism/node.rb#16556 def type; end end end -# A module responsible for deserializing parse results. -module Prism::Serialize - class << self - # Deserialize the AST represented by the given string into a parse result. - # - # source://prism//prism/serialize.rb#37 - def load(input, serialized); end - - # Deserialize the tokens represented by the given string into a parse - # result. - # - # source://prism//prism/serialize.rb#49 - def load_tokens(source, serialized); end - end -end - -class Prism::Serialize::Loader - # @return [Loader] a new instance of Loader +# This represents a token from the Ruby source. +# +# source://prism//lib/prism/parse_result.rb#424 +class Prism::Token + # Create a new token object with the given type, value, and location. # - # source://prism//prism/serialize.rb#58 - def initialize(source, serialized); end - - # Returns the value of attribute constant_pool. + # @return [Token] a new instance of Token # - # source://prism//prism/serialize.rb#55 - def constant_pool; end + # source://prism//lib/prism/parse_result.rb#435 + sig { params(type: T.untyped, value: String, location: Prism::Location).void } + def initialize(type, value, location); end - # Returns the value of attribute constant_pool_offset. + # Returns true if the given other token is equal to this token. # - # source://prism//prism/serialize.rb#55 - def constant_pool_offset; end + # source://prism//lib/prism/parse_result.rb#462 + sig { params(other: T.untyped).returns(T::Boolean) } + def ==(other); end - # Returns the value of attribute encoding. + # Implement the hash pattern matching interface for Token. # - # source://prism//prism/serialize.rb#54 - def encoding; end + # source://prism//lib/prism/parse_result.rb#442 + sig { params(keys: T.untyped).returns(T.untyped) } + def deconstruct_keys(keys); end - # Returns the value of attribute input. + # A Location object representing the location of this token in the source. # - # source://prism//prism/serialize.rb#54 - def input; end + # source://prism//lib/prism/parse_result.rb#432 + sig { returns(Prism::Location) } + def location; end - # Returns the value of attribute io. + # Implement the pretty print interface for Token. # - # source://prism//prism/serialize.rb#54 - def io; end - - # source://prism//prism/serialize.rb#92 - def load_comments; end - - # source://prism//prism/serialize.rb#82 - def load_encoding; end - - # source://prism//prism/serialize.rb#73 - def load_header; end - - # source://prism//prism/serialize.rb#102 - def load_metadata; end - - # source://prism//prism/serialize.rb#135 - def load_nodes; end - - # source://prism//prism/serialize.rb#148 - def load_result; end + # source://prism//lib/prism/parse_result.rb#447 + sig { params(q: T.untyped).returns(T.untyped) } + def pretty_print(q); end - # source://prism//prism/serialize.rb#88 - def load_start_line; end + # The type of token that this token is. + # + # source://prism//lib/prism/parse_result.rb#426 + sig { returns(T.untyped) } + def type; end - # source://prism//prism/serialize.rb#111 - def load_tokens; end + # A byteslice of the source that this token represents. + # + # source://prism//lib/prism/parse_result.rb#429 + sig { returns(String) } + def value; end +end - # source://prism//prism/serialize.rb#124 - def load_tokens_result; end +# This module is responsible for converting the prism syntax tree into other +# syntax trees. At the moment it only supports converting to the +# whitequark/parser gem's syntax tree, but support is planned for the +# seattlerb/ruby_parser gem's syntax tree as well. +# +# source://prism//lib/prism/translation.rb#8 +module Prism::Translation; end - # Returns the value of attribute serialized. +# 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. # - # source://prism//prism/serialize.rb#54 - def serialized; end + # source://prism//lib/prism/translation/parser.rb#33 + def default_encoding; end - # Returns the value of attribute source. + # Parses a source buffer and returns the AST. # - # source://prism//prism/serialize.rb#55 - def source; end + # source://prism//lib/prism/translation/parser.rb#41 + def parse(source_buffer); end - # Returns the value of attribute start_line. + # Parses a source buffer and returns the AST and the source code comments. # - # source://prism//prism/serialize.rb#56 - def start_line; end - - private - - # source://prism//prism/serialize.rb#211 - def load_constant(index); end - - # source://prism//prism/serialize.rb#187 - def load_embedded_string; end - - # source://prism//prism/serialize.rb#203 - def load_location; end - - # source://prism//prism/serialize.rb#242 - def load_node; end + # source://prism//lib/prism/translation/parser.rb#54 + def parse_with_comments(source_buffer); end - # source://prism//prism/serialize.rb#236 - def load_optional_constant; end - - # source://prism//prism/serialize.rb#207 - def load_optional_location; end - - # source://prism//prism/serialize.rb#180 - def load_optional_node; end + # Parses a source buffer and returns the AST, the source code comments, + # and the tokens emitted by the lexer. + # + # source://prism//lib/prism/translation/parser.rb#71 + def tokenize(source_buffer, _recover = T.unsafe(nil)); end - # source://prism//prism/serialize.rb#232 - def load_required_constant; end + # Since prism resolves num params for us, we don't need to support this + # kind of logic here. + # + # source://prism//lib/prism/translation/parser.rb#91 + def try_declare_numparam(node); end - # source://prism//prism/serialize.rb#176 - def load_serialized_length; end + # source://prism//lib/prism/translation/parser.rb#28 + def version; end - # source://prism//prism/serialize.rb#191 - def load_string; end + # source://prism//lib/prism/translation/parser.rb#37 + def yyerror; end - # source://prism//prism/serialize.rb#171 - def load_varsint; end + private - # variable-length integer using https://en.wikipedia.org/wiki/LEB128 - # This is also what protobuf uses: https://protobuf.dev/programming-guides/encoding/#varints + # Build the parser gem AST from the prism AST. # - # source://prism//prism/serialize.rb#157 - def load_varuint; end -end - -# The major version of prism that we are expecting to find in the serialized -# strings. -# -# source://prism//prism/serialize.rb#26 -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//prism/serialize.rb#30 -Prism::Serialize::MINOR_VERSION = T.let(T.unsafe(nil), Integer) - -# The patch version of prism that we are expecting to find in the serialized -# strings. -# -# source://prism//prism/serialize.rb#34 -Prism::Serialize::PATCH_VERSION = T.let(T.unsafe(nil), Integer) + # source://prism//lib/prism/translation/parser.rb#139 + def build_ast(program, offset_cache); end -# The token types that can be indexed by their enum values. -# -# source://prism//prism/serialize.rb#1154 -Prism::Serialize::TOKEN_TYPES = T.let(T.unsafe(nil), Array) + # Build the parser gem comments from the prism comments. + # + # source://prism//lib/prism/translation/parser.rb#144 + def build_comments(comments, offset_cache); end -# Represents a singleton class declaration involving the `class` keyword. -# -# class << self end -# ^^^^^^^^^^^^^^^^^ -class Prism::SingletonClassNode < ::Prism::Node - # def initialize: (locals: Array[Symbol], class_keyword_loc: Location, operator_loc: Location, expression: Node, body: Node?, end_keyword_loc: Location, location: Location) -> void + # 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. # - # @return [SingletonClassNode] a new instance of SingletonClassNode + # If the bytesize of the source is the same as the length, then we can + # just use the offset directly. Otherwise, we build a hash that functions + # as a cache for the conversion. # - # source://prism//prism/node.rb#15302 - def initialize(locals, class_keyword_loc, operator_loc, expression, body, end_keyword_loc, location); end - - # def accept: (visitor: Visitor) -> void + # This is a good opportunity for some optimizations. If the source file + # has any multi-byte characters, this can tank the performance of the + # translator. We could make this significantly faster by using a + # different data structure for the cache. # - # source://prism//prism/node.rb#15313 - def accept(visitor); end + # source://prism//lib/prism/translation/parser.rb#128 + def build_offset_cache(source); end - # attr_reader body: Node? + # Build a range from a prism location. # - # source://prism//prism/node.rb#15296 - def body; end + # source://prism//lib/prism/translation/parser.rb#156 + def build_range(location, offset_cache); end - # def child_nodes: () -> Array[nil | Node] + # Build the parser gem tokens from the prism tokens. # - # source://prism//prism/node.rb#15318 - def child_nodes; end + # source://prism//lib/prism/translation/parser.rb#151 + def build_tokens(tokens, offset_cache); end - # def class_keyword: () -> String + # If there was a error generated during the parse, then raise an + # appropriate syntax error. Otherwise return the result. # - # source://prism//prism/node.rb#15357 - def class_keyword; end + # source://prism//lib/prism/translation/parser.rb#105 + def unwrap(result, offset_cache); end - # attr_reader class_keyword_loc: Location + # This is a hook to allow consumers to disable some errors if they don't + # want them to block creating the syntax tree. # - # source://prism//prism/node.rb#15287 - def class_keyword_loc; end - - # def comment_targets: () -> Array[Node | Location] + # @return [Boolean] # - # source://prism//prism/node.rb#15331 - def comment_targets; end + # source://prism//lib/prism/translation/parser.rb#99 + def valid_error?(error); end +end - # def compact_child_nodes: () -> Array[Node] +# 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. # - # source://prism//prism/node.rb#15323 - def compact_child_nodes; end - - # def copy: (**params) -> SingletonClassNode + # @return [Compiler] a new instance of Compiler # - # source://prism//prism/node.rb#15336 - def copy(**params); 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 child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # The Parser::Builders::Default instance that is being used to build the + # AST. # - # source://prism//prism/node.rb#15318 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#18 + def builder; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # The types of values that can be forwarded in the current scope. # - # source://prism//prism/node.rb#15352 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#29 + def forwarding; end - # def end_keyword: () -> String + # Whether or not the current node is in a destructure. # - # source://prism//prism/node.rb#15367 - def end_keyword; end + # source://prism//lib/prism/translation/parser/compiler.rb#32 + def in_destructure; end - # attr_reader end_keyword_loc: Location + # Whether or not the current node is in a pattern. # - # source://prism//prism/node.rb#15299 - def end_keyword_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#35 + def in_pattern; end - # attr_reader expression: Node + # The offset cache that is used to map between byte and character + # offsets in the file. # - # source://prism//prism/node.rb#15293 - def expression; end + # source://prism//lib/prism/translation/parser/compiler.rb#26 + def offset_cache; end - # def inspect(inspector: NodeInspector) -> String + # The Parser::Base instance that is being used to build the AST. # - # source://prism//prism/node.rb#15372 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#14 + def parser; end - # attr_reader locals: Array[Symbol] + # The Parser::Source::Buffer instance that is holding a reference to the + # source code. # - # source://prism//prism/node.rb#15284 - def locals; end + # source://prism//lib/prism/translation/parser/compiler.rb#22 + def source_buffer; end - # def operator: () -> String + # alias $foo $bar + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15362 - def operator; end + # source://prism//lib/prism/translation/parser/compiler.rb#58 + def visit_alias_global_variable_node(node); end - # attr_reader operator_loc: Location + # alias foo bar + # ^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15290 - def operator_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#52 + def visit_alias_method_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 | baz + # ^^^^^^^^^ # - # source://prism//prism/node.rb#15403 - 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//prism/node.rb#15413 - def type; end - end -end + # source://prism//lib/prism/translation/parser/compiler.rb#64 + def visit_alternation_pattern_node(node); 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. -class Prism::Source - # Create a new source object with the given source code and newline byte - # offsets. If no newline byte offsets are given, they will be computed from - # the source code. - # - # @return [Source] a new instance of Source + # a and b + # ^^^^^^^ # - # source://prism//prism/parse_result.rb#20 - def initialize(source, start_line = T.unsafe(nil), offsets = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#70 + def visit_and_node(node); end - # Return the column number in characters for the given byte offset. + # foo(bar) + # ^^^ # - # source://prism//prism/parse_result.rb#55 - def character_column(byte_offset); end + # source://prism//lib/prism/translation/parser/compiler.rb#101 + def visit_arguments_node(node); end - # Return the character offset for the given byte offset. + # [] + # ^^ # - # source://prism//prism/parse_result.rb#50 - def character_offset(byte_offset); end + # source://prism//lib/prism/translation/parser/compiler.rb#76 + def visit_array_node(node); end - # Return the column number for the given byte offset. + # foo => [bar] + # ^^^^^ # - # source://prism//prism/parse_result.rb#45 - def column(byte_offset); end + # source://prism//lib/prism/translation/parser/compiler.rb#82 + def visit_array_pattern_node(node); end - # Binary search through the offsets to find the line number for the given - # byte offset. + # { a: 1 } + # ^^^^ # - # source://prism//prism/parse_result.rb#34 - def line(byte_offset); end + # source://prism//lib/prism/translation/parser/compiler.rb#107 + def visit_assoc_node(node); end - # Return the byte offset of the start of the line corresponding to the given - # byte offset. + # def foo(**); bar(**); end + # ^^ # - # source://prism//prism/parse_result.rb#40 - def line_start(byte_offset); end - - # The list of newline byte offsets in the source code. + # { **foo } + # ^^^^^ # - # source://prism//prism/parse_result.rb#15 - def offsets; end + # source://prism//lib/prism/translation/parser/compiler.rb#141 + def visit_assoc_splat_node(node); end - # Perform a byteslice on the source code using the given byte offset and - # byte length. + # $+ + # ^^ # - # source://prism//prism/parse_result.rb#28 - def slice(byte_offset, length); end + # source://prism//lib/prism/translation/parser/compiler.rb#151 + def visit_back_reference_read_node(node); end - # The source code that this source object represents. + # begin end + # ^^^^^^^^^ # - # source://prism//prism/parse_result.rb#9 - def source; end + # source://prism//lib/prism/translation/parser/compiler.rb#157 + def visit_begin_node(node); end - # The line number where this source starts. + # foo(&bar) + # ^^^^ # - # source://prism//prism/parse_result.rb#12 - def start_line; end + # source://prism//lib/prism/translation/parser/compiler.rb#195 + def visit_block_argument_node(node); end - # The line number where this source starts. + # foo { |; bar| } + # ^^^ # - # source://prism//prism/parse_result.rb#12 - def start_line=(_arg0); end + # source://prism//lib/prism/translation/parser/compiler.rb#201 + def visit_block_local_variable_node(node); end - private + # A block on a keyword or method call. + # + # @raise [CompilationError] + # + # source://prism//lib/prism/translation/parser/compiler.rb#206 + def visit_block_node(node); end - # Find all of the newlines in the source code and return their byte offsets - # from the start of the string an array. + # def foo(&bar); end + # ^^^^ # - # source://prism//prism/parse_result.rb#83 - def compute_offsets(code); end + # source://prism//lib/prism/translation/parser/compiler.rb#212 + def visit_block_parameter_node(node); end - # Binary search through the offsets to find the line number for the given - # byte offset. + # A block's parameters. # - # source://prism//prism/parse_result.rb#63 - def find_line(byte_offset); end -end + # source://prism//lib/prism/translation/parser/compiler.rb#217 + def visit_block_parameters_node(node); end -# Represents the use of the `__ENCODING__` keyword. -# -# __ENCODING__ -# ^^^^^^^^^^^^ -class Prism::SourceEncodingNode < ::Prism::Node - # def initialize: (location: Location) -> void + # break + # ^^^^^ # - # @return [SourceEncodingNode] a new instance of SourceEncodingNode + # break foo + # ^^^^^^^^^ # - # source://prism//prism/node.rb#15424 - def initialize(location); end + # source://prism//lib/prism/translation/parser/compiler.rb#226 + def visit_break_node(node); end - # def accept: (visitor: Visitor) -> void + # foo.bar += baz + # ^^^^^^^^^^^^^^^ + # foo.bar &&= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15429 - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#300 + def visit_call_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # foo + # ^^^ # - # source://prism//prism/node.rb#15434 - def child_nodes; end + # foo.bar + # ^^^^^^^ + # + # foo.bar() {} + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#238 + def visit_call_node(node); end - # def comment_targets: () -> Array[Node | Location] + # foo.bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15444 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#300 + def visit_call_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # foo.bar += baz + # ^^^^^^^^^^^^^^^ + # foo.bar ||= baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15439 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#300 + def visit_call_or_write_node(node); end - # def copy: (**params) -> SourceEncodingNode + # foo.bar, = 1 + # ^^^^^^^ # - # source://prism//prism/node.rb#15449 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#327 + def visit_call_target_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # foo => bar => baz + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#15434 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#339 + def visit_capture_pattern_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15459 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#358 + def visit_case_match_node(node); end - # def inspect(inspector: NodeInspector) -> String + # case foo; when bar; end + # ^^^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15464 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#345 + def visit_case_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. + # class Foo; 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#371 + def visit_class_node(node); end + + # @@foo += bar + # ^^^^^^^^^^^^ + # @@foo &&= bar + # ^^^^^^^^^^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#403 + def visit_class_variable_and_write_node(node); end + + # @@foo += bar + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15483 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#403 + def visit_class_variable_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//prism/node.rb#15493 - def type; end - end -end + # @@foo += bar + # ^^^^^^^^^^^^ + # @@foo ||= bar + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#403 + def visit_class_variable_or_write_node(node); end -# Represents the use of the `__FILE__` keyword. -# -# __FILE__ -# ^^^^^^^^ -class Prism::SourceFileNode < ::Prism::Node - # def initialize: (filepath: String, location: Location) -> void + # @@foo + # ^^^^^ # - # @return [SourceFileNode] a new instance of SourceFileNode + # source://prism//lib/prism/translation/parser/compiler.rb#384 + def visit_class_variable_read_node(node); end + + # @@foo, = bar + # ^^^^^ # - # source://prism//prism/node.rb#15507 - def initialize(filepath, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#421 + def visit_class_variable_target_node(node); end - # def accept: (visitor: Visitor) -> void + # @@foo = 1 + # ^^^^^^^^^ # - # source://prism//prism/node.rb#15513 - def accept(visitor); end + # @@foo, @@bar = 1 + # ^^^^^ ^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#393 + def visit_class_variable_write_node(node); end - # def child_nodes: () -> Array[nil | Node] + # Foo += bar + # ^^^^^^^^^^^ + # Foo &&= bar + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15518 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#442 + def visit_constant_and_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # Foo += bar + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15528 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#442 + def visit_constant_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # Foo += bar + # ^^^^^^^^^^^ + # Foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15523 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#442 + def visit_constant_or_write_node(node); end - # def copy: (**params) -> SourceFileNode + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ + # Foo::Bar &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15533 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#496 + def visit_constant_path_and_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # Foo::Bar + # ^^^^^^^^ # - # source://prism//prism/node.rb#15518 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#466 + def visit_constant_path_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15544 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#496 + def visit_constant_path_operator_write_node(node); end - # attr_reader filepath: String + # Foo::Bar += baz + # ^^^^^^^^^^^^^^^ + # Foo::Bar ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15504 - def filepath; end + # source://prism//lib/prism/translation/parser/compiler.rb#496 + def visit_constant_path_or_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # Foo::Bar, = baz + # ^^^^^^^^ # - # source://prism//prism/node.rb#15549 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#514 + def visit_constant_path_target_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 = 1 + # ^^^^^^^^^^^^ # - # 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. + # Foo::Foo, Bar::Bar = 1 + # ^^^^^^^^ ^^^^^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#486 + def visit_constant_path_write_node(node); end + + # Foo + # ^^^ # - # source://prism//prism/node.rb#15569 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#427 + def visit_constant_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//prism/node.rb#15579 - def type; end - end -end + # Foo, = bar + # ^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#460 + def visit_constant_target_node(node); end -# Represents the use of the `__LINE__` keyword. -# -# __LINE__ -# ^^^^^^^^ -class Prism::SourceLineNode < ::Prism::Node - # def initialize: (location: Location) -> void + # Foo = 1 + # ^^^^^^^ # - # @return [SourceLineNode] a new instance of SourceLineNode + # Foo, Bar = 1 + # ^^^ ^^^ # - # source://prism//prism/node.rb#15590 - def initialize(location); end + # source://prism//lib/prism/translation/parser/compiler.rb#436 + def visit_constant_write_node(node); end - # def accept: (visitor: Visitor) -> void + # def foo; end + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15595 - def accept(visitor); end - - # def child_nodes: () -> Array[nil | Node] + # def self.foo; end + # ^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15600 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#523 + def visit_def_node(node); end - # def comment_targets: () -> Array[Node | Location] + # defined? a + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#15610 - def comment_targets; end - - # def compact_child_nodes: () -> Array[Node] + # defined?(a) + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15605 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#570 + def visit_defined_node(node); end - # def copy: (**params) -> SourceLineNode + # if foo then bar else baz end + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15615 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#582 + def visit_else_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # "foo #{bar}" + # ^^^^^^ # - # source://prism//prism/node.rb#15600 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#588 + def visit_embedded_statements_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # "foo #@bar" + # ^^^^^ # - # source://prism//prism/node.rb#15625 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#598 + def visit_embedded_variable_node(node); end - # def inspect(inspector: NodeInspector) -> String + # begin; foo; ensure; bar; end + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15630 - def inspect(inspector = T.unsafe(nil)); 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#604 + def visit_ensure_node(node); end + + # false + # ^^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#610 + def visit_false_node(node); end + + # foo => [*, bar, *] + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15649 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#616 + 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//prism/node.rb#15659 - def type; end - end -end + # 0..5 + # ^^^^ + # if foo .. bar; end + # ^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1292 + def visit_flip_flop_node(node); end -# Represents the use of the splat operator. -# -# [*a] -# ^^ -class Prism::SplatNode < ::Prism::Node - # def initialize: (operator_loc: Location, expression: Node?, location: Location) -> void + # 1.0 + # ^^^ # - # @return [SplatNode] a new instance of SplatNode + # source://prism//lib/prism/translation/parser/compiler.rb#628 + def visit_float_node(node); end + + # for foo in bar do end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15676 - def initialize(operator_loc, expression, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#634 + def visit_for_node(node); end - # def accept: (visitor: Visitor) -> void + # def foo(...); bar(...); end + # ^^^ # - # source://prism//prism/node.rb#15683 - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#652 + def visit_forwarding_arguments_node(node); end - # def child_nodes: () -> Array[nil | Node] + # def foo(...); end + # ^^^ # - # source://prism//prism/node.rb#15688 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#658 + def visit_forwarding_parameter_node(node); end - # def comment_targets: () -> Array[Node | Location] + # super + # ^^^^^ # - # source://prism//prism/node.rb#15700 - def comment_targets; end + # super {} + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#667 + def visit_forwarding_super_node(node); end - # def compact_child_nodes: () -> Array[Node] + # $foo += bar + # ^^^^^^^^^^^ + # $foo &&= bar + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15693 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#698 + def visit_global_variable_and_write_node(node); end - # def copy: (**params) -> SplatNode + # $foo += bar + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15705 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#698 + def visit_global_variable_operator_write_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # $foo += bar + # ^^^^^^^^^^^ + # $foo ||= bar + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15688 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#698 + def visit_global_variable_or_write_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # $foo + # ^^^^ # - # source://prism//prism/node.rb#15717 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#679 + def visit_global_variable_read_node(node); end - # attr_reader expression: Node? + # $foo, = bar + # ^^^^ # - # source://prism//prism/node.rb#15673 - def expression; end + # source://prism//lib/prism/translation/parser/compiler.rb#716 + def visit_global_variable_target_node(node); end - # def inspect(inspector: NodeInspector) -> String + # $foo = 1 + # ^^^^^^^^ # - # source://prism//prism/node.rb#15727 - def inspect(inspector = T.unsafe(nil)); end + # $foo, $bar = 1 + # ^^^^ ^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#688 + def visit_global_variable_write_node(node); end - # def operator: () -> String + # {} + # ^^ # - # source://prism//prism/node.rb#15722 - def operator; end + # source://prism//lib/prism/translation/parser/compiler.rb#722 + def visit_hash_node(node); end - # attr_reader operator_loc: Location + # foo => {} + # ^^ # - # source://prism//prism/node.rb#15670 - def operator_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#732 + 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. + # if foo then 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. + # bar if foo + # ^^^^^^^^^^ # - # def type: () -> Symbol + # foo ? bar : baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15753 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#750 + def visit_if_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//prism/node.rb#15763 - def type; end - end -end + # 1i + # + # source://prism//lib/prism/translation/parser/compiler.rb#791 + def visit_imaginary_node(node); end -# Represents a set of statements contained within some scope. -# -# foo; bar; baz -# ^^^^^^^^^^^^^ -class Prism::StatementsNode < ::Prism::Node - # def initialize: (body: Array[Node], location: Location) -> void + # { foo: } + # ^^^^ # - # @return [StatementsNode] a new instance of StatementsNode + # @raise [CompilationError] # - # source://prism//prism/node.rb#15777 - def initialize(body, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#797 + def visit_implicit_node(node); end - # def accept: (visitor: Visitor) -> void + # foo { |bar,| } + # ^ # - # source://prism//prism/node.rb#15783 - def accept(visitor); end + # @raise [CompilationError] + # + # source://prism//lib/prism/translation/parser/compiler.rb#803 + def visit_implicit_rest_node(node); end - # attr_reader body: Array[Node] + # case foo; in bar; end + # ^^^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15774 - def body; end + # source://prism//lib/prism/translation/parser/compiler.rb#809 + def visit_in_node(node); end - # def child_nodes: () -> Array[nil | Node] + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ + # foo[bar] &&= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15788 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#835 + def visit_index_and_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15798 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#835 + def visit_index_operator_write_node(node); end - # def compact_child_nodes: () -> Array[Node] + # foo[bar] += baz + # ^^^^^^^^^^^^^^^ + # foo[bar] ||= baz + # ^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15793 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#835 + def visit_index_or_write_node(node); end - # def copy: (**params) -> StatementsNode + # foo[bar], = 1 + # ^^^^^^^^ # - # source://prism//prism/node.rb#15803 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#861 + def visit_index_target_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # ^^^^^^^^^^^ + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15788 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#891 + def visit_instance_variable_and_write_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15814 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#891 + def visit_instance_variable_operator_write_node(node); end - # def inspect(inspector: NodeInspector) -> String + # ^^^^^^^^^^^ + # ^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15819 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#891 + def visit_instance_variable_or_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. + # ^^^^ # - # 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#872 + def visit_instance_variable_read_node(node); end + + # @foo, = bar + # ^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#909 + def visit_instance_variable_target_node(node); end + + # ^^^^^^^^ # - # source://prism//prism/node.rb#15839 - def type; end + # @foo, @bar = 1 + # ^^^^ ^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#881 + def visit_instance_variable_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//prism/node.rb#15849 - def type; end - end -end + # 1 + # ^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#915 + def visit_integer_node(node); end -# Flags for string nodes. -module Prism::StringFlags; end + # /foo #{bar}/ + # ^^^^^^^^^^^^ + # if /foo #{bar}/ then end + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#921 + def visit_interpolated_match_last_line_node(node); end -# internal bytes forced the encoding to binary -# -# source://prism//prism/node.rb#17384 -Prism::StringFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) + # /foo #{bar}/ + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#921 + def visit_interpolated_regular_expression_node(node); end -# internal bytes forced the encoding to UTF-8 -# -# source://prism//prism/node.rb#17381 -Prism::StringFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + # "foo #{bar}" + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#936 + def visit_interpolated_string_node(node); end -# frozen by virtue of a `frozen_string_literal` comment -# -# source://prism//prism/node.rb#17387 -Prism::StringFlags::FROZEN = T.let(T.unsafe(nil), Integer) + # :"foo #{bar}" + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#951 + def visit_interpolated_symbol_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" -# ^^^^ ^^^^ -class Prism::StringNode < ::Prism::Node - include ::Prism::HeredocQuery + # `foo #{bar}` + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#961 + def visit_interpolated_x_string_node(node); end - # def initialize: (flags: Integer, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String, location: Location) -> void + # foo(bar: baz) + # ^^^^^^^^ # - # @return [StringNode] a new instance of StringNode + # source://prism//lib/prism/translation/parser/compiler.rb#976 + def visit_keyword_hash_node(node); end + + # def foo(**bar); end + # ^^^^^ # - # source://prism//prism/node.rb#15882 - def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end + # def foo(**); end + # ^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#985 + def visit_keyword_rest_parameter_node(node); end - # def accept: (visitor: Visitor) -> void + # -> {} # - # source://prism//prism/node.rb#15892 - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#993 + def visit_lambda_node(node); end - # def child_nodes: () -> Array[nil | Node] + # foo += bar + # ^^^^^^^^^^ + # foo &&= bar + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15897 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#1037 + def visit_local_variable_and_write_node(node); end - # def closing: () -> String? + # foo += bar + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#15957 - def closing; end + # source://prism//lib/prism/translation/parser/compiler.rb#1037 + def visit_local_variable_operator_write_node(node); end - # attr_reader closing_loc: Location? + # foo += bar + # ^^^^^^^^^^ + # foo ||= bar + # ^^^^^^^^^^^ # - # source://prism//prism/node.rb#15876 - def closing_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1037 + def visit_local_variable_or_write_node(node); end - # def comment_targets: () -> Array[Node | Location] + # foo + # ^^^ # - # source://prism//prism/node.rb#15907 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#1018 + def visit_local_variable_read_node(node); end - # def compact_child_nodes: () -> Array[Node] + # foo, = bar + # ^^^ # - # source://prism//prism/node.rb#15902 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#1055 + def visit_local_variable_target_node(node); end - # def content: () -> String + # foo = 1 + # ^^^^^^^ # - # source://prism//prism/node.rb#15952 - def content; end + # foo, bar = 1 + # ^^^ ^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1027 + def visit_local_variable_write_node(node); end - # attr_reader content_loc: Location + # /foo/ + # ^^^^^ + # if /foo/ then end + # ^^^^^ # - # source://prism//prism/node.rb#15873 - def content_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1326 + def visit_match_last_line_node(node); end - # def copy: (**params) -> StringNode + # foo in bar + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#15912 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#1065 + def visit_match_predicate_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # foo => bar + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#15897 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#1075 + def visit_match_required_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # /(?foo)/ =~ bar + # ^^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15927 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#1085 + def visit_match_write_node(node); end - # def forced_binary_encoding?: () -> bool + # 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. # - # @return [Boolean] + # source://prism//lib/prism/translation/parser/compiler.rb#1096 + def visit_missing_node(node); end + + # module Foo; end + # ^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15937 - def forced_binary_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1102 + def visit_module_node(node); end - # def forced_utf8_encoding?: () -> bool + # foo, bar = baz + # ^^^^^^^^ # - # @return [Boolean] + # source://prism//lib/prism/translation/parser/compiler.rb#1113 + def visit_multi_target_node(node); end + + # foo, bar = baz + # ^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15932 - def forced_utf8_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1127 + def visit_multi_write_node(node); end - # def frozen?: () -> bool + # next + # ^^^^ # - # @return [Boolean] + # next foo + # ^^^^^^^^ # - # source://prism//prism/node.rb#15942 - def frozen?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1148 + def visit_next_node(node); end - # def inspect(inspector: NodeInspector) -> String + # nil + # ^^^ # - # source://prism//prism/node.rb#15962 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#1160 + def visit_nil_node(node); end - # def opening: () -> String? + # def foo(**nil); end + # ^^^^^ # - # source://prism//prism/node.rb#15947 - def opening; end + # source://prism//lib/prism/translation/parser/compiler.rb#1166 + def visit_no_keywords_parameter_node(node); end - # attr_reader opening_loc: Location? + # -> { _1 + _2 } + # ^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#15870 - def opening_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1176 + def visit_numbered_parameters_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. + # $1 + # ^^ # - # def type: () -> Symbol - # - # source://prism//prism/node.rb#15987 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#1182 + def visit_numbered_reference_read_node(node); end - # attr_reader unescaped: String + # def foo(bar: baz); end + # ^^^^^^^^ # - # source://prism//prism/node.rb#15879 - def unescaped; end - - private + # source://prism//lib/prism/translation/parser/compiler.rb#1188 + def visit_optional_keyword_parameter_node(node); end - # Returns the value of attribute flags. + # def foo(bar = 1); end + # ^^^^^^^ # - # source://prism//prism/node.rb#15867 - 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//prism/node.rb#15997 - def type; end - end -end + # source://prism//lib/prism/translation/parser/compiler.rb#1194 + def visit_optional_parameter_node(node); end -# Represents the use of the `super` keyword with parentheses or arguments. -# -# super() -# ^^^^^^^ -# -# super foo, bar -# ^^^^^^^^^^^^^^ -class Prism::SuperNode < ::Prism::Node - # def initialize: (keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, block: Node?, location: Location) -> void + # a or b + # ^^^^^^ # - # @return [SuperNode] a new instance of SuperNode + # source://prism//lib/prism/translation/parser/compiler.rb#1200 + def visit_or_node(node); end + + # def foo(bar, *baz); end + # ^^^^^^^^^ # - # source://prism//prism/node.rb#16026 - def initialize(keyword_loc, lparen_loc, arguments, rparen_loc, block, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#1206 + def visit_parameters_node(node); end - # def accept: (visitor: Visitor) -> void + # () + # ^^ # - # source://prism//prism/node.rb#16036 - def accept(visitor); end + # (1) + # ^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1245 + def visit_parentheses_node(node); end - # attr_reader arguments: ArgumentsNode? + # foo => ^(bar) + # ^^^^^^ # - # source://prism//prism/node.rb#16017 - def arguments; end + # source://prism//lib/prism/translation/parser/compiler.rb#1255 + def visit_pinned_expression_node(node); end - # attr_reader block: Node? + # foo = 1 and bar => ^foo + # ^^^^ # - # source://prism//prism/node.rb#16023 - def block; end + # source://prism//lib/prism/translation/parser/compiler.rb#1261 + def visit_pinned_variable_node(node); end - # def child_nodes: () -> Array[nil | Node] + # END {} # - # source://prism//prism/node.rb#16041 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#1266 + def visit_post_execution_node(node); end - # def comment_targets: () -> Array[Node | Location] + # BEGIN {} # - # source://prism//prism/node.rb#16054 - def comment_targets; end + # source://prism//lib/prism/translation/parser/compiler.rb#1276 + def visit_pre_execution_node(node); end - # def compact_child_nodes: () -> Array[Node] + # The top-level program node. # - # source://prism//prism/node.rb#16046 - def compact_child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#1286 + def visit_program_node(node); end - # def copy: (**params) -> SuperNode + # 0..5 + # ^^^^ # - # source://prism//prism/node.rb#16059 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#1292 + def visit_range_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # 1r + # ^^ # - # source://prism//prism/node.rb#16041 - def deconstruct; end + # source://prism//lib/prism/translation/parser/compiler.rb#1314 + def visit_rational_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # redo + # ^^^^ # - # source://prism//prism/node.rb#16074 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#1320 + def visit_redo_node(node); end - # def inspect(inspector: NodeInspector) -> String + # /foo/ + # ^^^^^ # - # source://prism//prism/node.rb#16094 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#1326 + def visit_regular_expression_node(node); end - # def keyword: () -> String + # def foo(bar:); end + # ^^^^ # - # source://prism//prism/node.rb#16079 - def keyword; end + # source://prism//lib/prism/translation/parser/compiler.rb#1341 + def visit_required_keyword_parameter_node(node); end - # attr_reader keyword_loc: Location + # def foo(bar); end + # ^^^ # - # source://prism//prism/node.rb#16011 - def keyword_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1347 + def visit_required_parameter_node(node); end - # def lparen: () -> String? + # foo rescue bar + # ^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#16084 - def lparen; end + # source://prism//lib/prism/translation/parser/compiler.rb#1353 + def visit_rescue_modifier_node(node); end - # attr_reader lparen_loc: Location? + # begin; rescue; end + # ^^^^^^^ # - # source://prism//prism/node.rb#16014 - def lparen_loc; end + # @raise [CompilationError] + # + # source://prism//lib/prism/translation/parser/compiler.rb#1371 + def visit_rescue_node(node); end - # def rparen: () -> String? + # def foo(*bar); end + # ^^^^ # - # source://prism//prism/node.rb#16089 - def rparen; end + # def foo(*); end + # ^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1380 + def visit_rest_parameter_node(node); end - # attr_reader rparen_loc: Location? + # retry + # ^^^^^ # - # source://prism//prism/node.rb#16020 - def rparen_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1386 + def visit_retry_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. + # return + # ^^^^^^ # - # 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 1 + # ^^^^^^^^ # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#1395 + def visit_return_node(node); end + + # self + # ^^^^ # - # source://prism//prism/node.rb#16128 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#1407 + def visit_self_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//prism/node.rb#16138 - def type; end - end -end + # class << self; end + # ^^^^^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1413 + def visit_singleton_class_node(node); end -# Flags for symbol nodes. -module Prism::SymbolFlags; end + # __ENCODING__ + # ^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1425 + def visit_source_encoding_node(node); end -# internal bytes forced the encoding to binary -# -# source://prism//prism/node.rb#17396 -Prism::SymbolFlags::FORCED_BINARY_ENCODING = T.let(T.unsafe(nil), Integer) + # __FILE__ + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1431 + def visit_source_file_node(node); end -# internal bytes forced the encoding to US-ASCII -# -# source://prism//prism/node.rb#17399 -Prism::SymbolFlags::FORCED_US_ASCII_ENCODING = T.let(T.unsafe(nil), Integer) + # __LINE__ + # ^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1437 + def visit_source_line_node(node); end -# internal bytes forced the encoding to UTF-8 -# -# source://prism//prism/node.rb#17393 -Prism::SymbolFlags::FORCED_UTF8_ENCODING = T.let(T.unsafe(nil), Integer) + # foo(*bar) + # ^^^^ + # + # def foo((bar, *baz)); end + # ^^^^ + # + # def foo(*); bar(*); end + # ^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1449 + def visit_splat_node(node); end -# Represents a symbol literal or a symbol contained within a `%i` list. -# -# :foo -# ^^^^ -# -# %i[foo] -# ^^^ -class Prism::SymbolNode < ::Prism::Node - # def initialize: (flags: Integer, opening_loc: Location?, value_loc: Location?, closing_loc: Location?, unescaped: String, location: Location) -> void + # A list of statements. # - # @return [SymbolNode] a new instance of SymbolNode + # source://prism//lib/prism/translation/parser/compiler.rb#1462 + def visit_statements_node(node); end + + # "foo" + # ^^^^^ # - # source://prism//prism/node.rb#16167 - def initialize(flags, opening_loc, value_loc, closing_loc, unescaped, location); end + # source://prism//lib/prism/translation/parser/compiler.rb#1468 + def visit_string_node(node); end - # def accept: (visitor: Visitor) -> void + # super(foo) + # ^^^^^^^^^^ # - # source://prism//prism/node.rb#16177 - def accept(visitor); end + # source://prism//lib/prism/translation/parser/compiler.rb#1485 + def visit_super_node(node); end - # def child_nodes: () -> Array[nil | Node] + # :foo + # ^^^^ # - # source://prism//prism/node.rb#16182 - def child_nodes; end + # source://prism//lib/prism/translation/parser/compiler.rb#1508 + def visit_symbol_node(node); end - # def closing: () -> String? + # true + # ^^^^ # - # source://prism//prism/node.rb#16242 - def closing; end + # source://prism//lib/prism/translation/parser/compiler.rb#1526 + def visit_true_node(node); end - # attr_reader closing_loc: Location? + # undef foo + # ^^^^^^^^^ # - # source://prism//prism/node.rb#16161 - def closing_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1532 + def visit_undef_node(node); end - # def comment_targets: () -> Array[Node | Location] + # unless foo; bar end + # ^^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#16192 - def comment_targets; end + # bar unless foo + # ^^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1541 + def visit_unless_node(node); end - # def compact_child_nodes: () -> Array[Node] + # until foo; bar end + # ^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#16187 - def compact_child_nodes; end + # bar until foo + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1571 + def visit_until_node(node); end - # def copy: (**params) -> SymbolNode + # case foo; when bar; end + # ^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#16197 - def copy(**params); end + # source://prism//lib/prism/translation/parser/compiler.rb#1593 + def visit_when_node(node); end - # def child_nodes: () -> Array[nil | Node] - # def deconstruct: () -> Array[nil | Node] + # while foo; bar end + # ^^^^^^^^^^^^^^^^^^ # - # source://prism//prism/node.rb#16182 - def deconstruct; end + # bar while foo + # ^^^^^^^^^^^^^ + # + # source://prism//lib/prism/translation/parser/compiler.rb#1607 + def visit_while_node(node); end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # `foo` + # ^^^^^ # - # source://prism//prism/node.rb#16212 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/compiler.rb#1629 + def visit_x_string_node(node); end - # def forced_binary_encoding?: () -> bool + # yield + # ^^^^^ # - # @return [Boolean] + # yield 1 + # ^^^^^^^ # - # source://prism//prism/node.rb#16222 - def forced_binary_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1647 + def visit_yield_node(node); end - # def forced_us_ascii_encoding?: () -> bool + private + + # Initialize a new compiler with the given option overrides, used to + # visit a subtree with the given options. # - # @return [Boolean] + # source://prism//lib/prism/translation/parser/compiler.rb#1661 + 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//prism/node.rb#16227 - def forced_us_ascii_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1668 + def find_forwarding(node); end - # def forced_utf8_encoding?: () -> bool + # 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. # # @return [Boolean] # - # source://prism//prism/node.rb#16217 - def forced_utf8_encoding?; end + # source://prism//lib/prism/translation/parser/compiler.rb#1683 + def procarg0?(parameters); end - # def inspect(inspector: NodeInspector) -> String + # Constructs a new source range from the given start and end offsets. # - # source://prism//prism/node.rb#16247 - def inspect(inspector = T.unsafe(nil)); end + # source://prism//lib/prism/translation/parser/compiler.rb#1700 + def srange(location); end - # def opening: () -> String? + # 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. # - # source://prism//prism/node.rb#16232 - def opening; end + # source://prism//lib/prism/translation/parser/compiler.rb#1712 + def srange_find(start_offset, end_offset, tokens); end - # attr_reader opening_loc: Location? + # Constructs a new source range from the given start and end offsets. # - # source://prism//prism/node.rb#16155 - def opening_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1705 + def srange_offsets(start_offset, end_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. + # Transform a location into a token that the parser gem expects. # - # def type: () -> Symbol + # source://prism//lib/prism/translation/parser/compiler.rb#1721 + def token(location); end + + # Visit a block node on a call. # - # source://prism//prism/node.rb#16272 - def type; end + # source://prism//lib/prism/translation/parser/compiler.rb#1726 + def visit_block(call, block); end - # attr_reader unescaped: String + # Visit a heredoc that can be either a string or an xstring. # - # source://prism//prism/node.rb#16164 - def unescaped; end + # source://prism//lib/prism/translation/parser/compiler.rb#1759 + def visit_heredoc(node); end - # def value: () -> String? + # Visit a numeric node and account for the optional sign. # - # source://prism//prism/node.rb#16237 - def value; end + # source://prism//lib/prism/translation/parser/compiler.rb#1805 + def visit_numeric(node, value); end - # attr_reader value_loc: Location? + # Within the given block, track that we're within a pattern. # - # source://prism//prism/node.rb#16158 - def value_loc; end + # source://prism//lib/prism/translation/parser/compiler.rb#1817 + def within_pattern; end +end - private +# 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 - # Returns the value of attribute flags. +# 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#1697 +Prism::Translation::Parser::Compiler::Range = Parser::Source::Range + +# 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. # - # source://prism//prism/node.rb#16152 - def flags; end + # @return [Diagnostic] a new instance of Diagnostic + # + # source://prism//lib/prism/translation/parser.rb#20 + def initialize(message, location); 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//prism/node.rb#16282 - def type; end - end + # The message generated by prism. + # + # source://prism//lib/prism/translation/parser.rb#17 + def message; end end -# This represents a token from the Ruby source. -class Prism::Token - # Create a new token object with the given type, value, and location. +# 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 [Token] a new instance of Token + # @return [Lexer] a new instance of Lexer # - # source://prism//prism/parse_result.rb#427 - def initialize(type, value, location); end + # source://prism//lib/prism/translation/parser/lexer.rb#193 + def initialize(source_buffer, lexed, offset_cache); end - # Returns true if the given other token is equal to this token. + # An array of prism tokens that we lexed. # - # source://prism//prism/parse_result.rb#454 - def ==(other); end + # source://prism//lib/prism/translation/parser/lexer.rb#186 + def lexed; end - # Implement the hash pattern matching interface for Token. + # A hash that maps offsets in bytes to offsets in characters. # - # source://prism//prism/parse_result.rb#434 - def deconstruct_keys(keys); end + # source://prism//lib/prism/translation/parser/lexer.rb#189 + def offset_cache; end - # A Location object representing the location of this token in the source. + # The Parser::Source::Buffer that the tokens were lexed from. # - # source://prism//prism/parse_result.rb#424 - def location; end + # source://prism//lib/prism/translation/parser/lexer.rb#183 + def source_buffer; end - # Implement the pretty print interface for Token. + # Convert the prism tokens into the expected format for the parser gem. # - # source://prism//prism/parse_result.rb#439 - def pretty_print(q); end + # source://prism//lib/prism/translation/parser/lexer.rb#203 + def to_a; end - # The type of token that this token is. + private + + # Parse a complex from the string representation. # - # source://prism//prism/parse_result.rb#418 - def type; end + # source://prism//lib/prism/translation/parser/lexer.rb#310 + def parse_complex(value); end - # A byteslice of the source that this token represents. + # Parse a rational from the string representation. # - # source://prism//prism/parse_result.rb#421 - def value; end + # source://prism//lib/prism/translation/parser/lexer.rb#323 + def parse_rational(value); end end +# source://prism//lib/prism/translation/parser/lexer.rb#199 +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) + +# source://prism//lib/prism/translation/parser.rb#26 +Prism::Translation::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass) + # Represents the use of the literal `true` keyword. # # true # ^^^^ +# +# source://prism//lib/prism/node.rb#16565 class Prism::TrueNode < ::Prism::Node - # def initialize: (location: Location) -> void + # def initialize: (Location location) -> void # # @return [TrueNode] a new instance of TrueNode # - # source://prism//prism/node.rb#16293 + # source://prism//lib/prism/node.rb#16567 + sig { params(location: Prism::Location).void } def initialize(location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16298 + # source://prism//lib/prism/node.rb#16572 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16303 + # source://prism//lib/prism/node.rb#16577 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16313 + # source://prism//lib/prism/node.rb#16587 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16308 + # source://prism//lib/prism/node.rb#16582 def compact_child_nodes; end # def copy: (**params) -> TrueNode # - # source://prism//prism/node.rb#16318 + # source://prism//lib/prism/node.rb#16592 + sig { params(params: T.untyped).returns(Prism::TrueNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16303 + # source://prism//lib/prism/node.rb#16577 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { location: Location } # - # source://prism//prism/node.rb#16328 + # source://prism//lib/prism/node.rb#16602 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16333 + # source://prism//lib/prism/node.rb#16607 def inspect(inspector = T.unsafe(nil)); end # Sometimes you want to check an instance of a node against a list of @@ -23553,7 +29604,7 @@ class Prism::TrueNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16352 + # source://prism//lib/prism/node.rb#16626 def type; end class << self @@ -23564,7 +29615,7 @@ class Prism::TrueNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#16362 + # source://prism//lib/prism/node.rb#16636 def type; end end end @@ -23573,68 +29624,83 @@ end # # undef :foo, :bar, :baz # ^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16645 class Prism::UndefNode < ::Prism::Node - # def initialize: (names: Array[Node], keyword_loc: Location, location: Location) -> void + # def initialize: (Array[Node] names, Location keyword_loc, Location location) -> void # # @return [UndefNode] a new instance of UndefNode # - # source://prism//prism/node.rb#16379 + # source://prism//lib/prism/node.rb#16653 + sig { params(names: T::Array[Prism::Node], keyword_loc: Prism::Location, location: Prism::Location).void } def initialize(names, keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16386 + # source://prism//lib/prism/node.rb#16660 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16391 + # source://prism//lib/prism/node.rb#16665 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16401 + # source://prism//lib/prism/node.rb#16675 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16396 + # source://prism//lib/prism/node.rb#16670 def compact_child_nodes; end # def copy: (**params) -> UndefNode # - # source://prism//prism/node.rb#16406 + # source://prism//lib/prism/node.rb#16680 + sig { params(params: T.untyped).returns(Prism::UndefNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16391 + # source://prism//lib/prism/node.rb#16665 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { names: Array[Node], keyword_loc: Location, location: Location } # - # source://prism//prism/node.rb#16418 + # source://prism//lib/prism/node.rb#16692 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16428 + # source://prism//lib/prism/node.rb#16702 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#16423 + # source://prism//lib/prism/node.rb#16697 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#16376 + # source://prism//lib/prism/node.rb#16650 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader names: Array[Node] # - # source://prism//prism/node.rb#16373 + # source://prism//lib/prism/node.rb#16647 + sig { returns(T::Array[Prism::Node]) } def names; end # Sometimes you want to check an instance of a node against a list of @@ -23652,7 +29718,7 @@ class Prism::UndefNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16449 + # source://prism//lib/prism/node.rb#16723 def type; end class << self @@ -23663,7 +29729,7 @@ class Prism::UndefNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#16459 + # source://prism//lib/prism/node.rb#16733 def type; end end end @@ -23675,101 +29741,132 @@ end # # unless foo then bar end # ^^^^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16745 class Prism::UnlessNode < ::Prism::Node - # def initialize: (keyword_loc: Location, predicate: Node, then_keyword_loc: Location?, statements: StatementsNode?, consequent: ElseNode?, end_keyword_loc: Location?, location: Location) -> void + # def initialize: (Location keyword_loc, 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//prism/node.rb#16491 + # source://prism//lib/prism/node.rb#16765 + 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 + ).void + end def initialize(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16502 + # source://prism//lib/prism/node.rb#16776 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16511 + # source://prism//lib/prism/node.rb#16785 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16525 + # source://prism//lib/prism/node.rb#16799 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16516 + # source://prism//lib/prism/node.rb#16790 def compact_child_nodes; end # attr_reader consequent: ElseNode? # - # source://prism//prism/node.rb#16485 + # source://prism//lib/prism/node.rb#16759 + sig { returns(T.nilable(Prism::ElseNode)) } def consequent; end # def copy: (**params) -> UnlessNode # - # source://prism//prism/node.rb#16530 + # source://prism//lib/prism/node.rb#16804 + sig { params(params: T.untyped).returns(Prism::UnlessNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16511 + # source://prism//lib/prism/node.rb#16785 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # 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 } # - # source://prism//prism/node.rb#16546 + # source://prism//lib/prism/node.rb#16820 + 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 end_keyword: () -> String? # - # source://prism//prism/node.rb#16561 + # source://prism//lib/prism/node.rb#16835 + sig { returns(T.nilable(String)) } def end_keyword; end # attr_reader end_keyword_loc: Location? # - # source://prism//prism/node.rb#16488 + # source://prism//lib/prism/node.rb#16762 + sig { returns(T.nilable(Prism::Location)) } def end_keyword_loc; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16566 + # source://prism//lib/prism/node.rb#16840 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#16551 + # source://prism//lib/prism/node.rb#16825 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#16473 + # source://prism//lib/prism/node.rb#16747 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader predicate: Node # - # source://prism//prism/node.rb#16476 + # source://prism//lib/prism/node.rb#16750 + sig { returns(Prism::Node) } def predicate; end - # source://prism//prism/node.rb#16506 + # source://prism//lib/prism/node.rb#16780 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#16482 + # source://prism//lib/prism/node.rb#16756 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # def then_keyword: () -> String? # - # source://prism//prism/node.rb#16556 + # source://prism//lib/prism/node.rb#16830 + sig { returns(T.nilable(String)) } def then_keyword; end # attr_reader then_keyword_loc: Location? # - # source://prism//prism/node.rb#16479 + # source://prism//lib/prism/node.rb#16753 + 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 @@ -23787,7 +29884,7 @@ class Prism::UnlessNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16602 + # source://prism//lib/prism/node.rb#16876 def type; end class << self @@ -23798,7 +29895,7 @@ class Prism::UnlessNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#16612 + # source://prism//lib/prism/node.rb#16886 def type; end end end @@ -23810,93 +29907,121 @@ end # # until foo do bar end # ^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#16898 class Prism::UntilNode < ::Prism::Node - # def initialize: (flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location) -> void + # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Node predicate, StatementsNode? statements, Location location) -> void # # @return [UntilNode] a new instance of UntilNode # - # source://prism//prism/node.rb#16641 + # source://prism//lib/prism/node.rb#16915 + 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 + ).void + end def initialize(flags, keyword_loc, closing_loc, predicate, statements, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16651 + # source://prism//lib/prism/node.rb#16925 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def begin_modifier?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#16698 + # source://prism//lib/prism/node.rb#16972 + sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16660 + # source://prism//lib/prism/node.rb#16934 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#16708 + # source://prism//lib/prism/node.rb#16982 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#16632 + # source://prism//lib/prism/node.rb#16906 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16673 + # source://prism//lib/prism/node.rb#16947 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16665 + # source://prism//lib/prism/node.rb#16939 def compact_child_nodes; end # def copy: (**params) -> UntilNode # - # source://prism//prism/node.rb#16678 + # source://prism//lib/prism/node.rb#16952 + sig { params(params: T.untyped).returns(Prism::UntilNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16660 + # source://prism//lib/prism/node.rb#16934 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location } # - # source://prism//prism/node.rb#16693 + # source://prism//lib/prism/node.rb#16967 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16713 + # source://prism//lib/prism/node.rb#16987 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#16703 + # source://prism//lib/prism/node.rb#16977 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#16629 + # source://prism//lib/prism/node.rb#16903 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader predicate: Node # - # source://prism//prism/node.rb#16635 + # source://prism//lib/prism/node.rb#16909 + sig { returns(Prism::Node) } def predicate; end - # source://prism//prism/node.rb#16655 + # source://prism//lib/prism/node.rb#16929 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#16638 + # source://prism//lib/prism/node.rb#16912 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Sometimes you want to check an instance of a node against a list of @@ -23914,14 +30039,15 @@ class Prism::UntilNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16744 + # source://prism//lib/prism/node.rb#17018 def type; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#16626 + # source://prism//lib/prism/node.rb#16900 + sig { returns(Integer) } def flags; end class << self @@ -23932,11 +30058,14 @@ class Prism::UntilNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#16754 + # source://prism//lib/prism/node.rb#17028 def type; end end end +# The version constant is set by reading the result of calling pm_version. +Prism::VERSION = T.let(T.unsafe(nil), String) + # A visitor is a class that provides a default implementation for every accept # method defined on the nodes. This means it can walk a tree without the # caller needing to define any special handling. This allows you to handle a @@ -23955,745 +30084,895 @@ end # super # end # end +# +# source://prism//lib/prism/visitor.rb#50 class Prism::Visitor < ::Prism::BasicVisitor # Visit a AliasGlobalVariableNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AliasGlobalVariableNode).void } def visit_alias_global_variable_node(node); end # Visit a AliasMethodNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AliasMethodNode).void } def visit_alias_method_node(node); end # Visit a AlternationPatternNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AlternationPatternNode).void } def visit_alternation_pattern_node(node); end # Visit a AndNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AndNode).void } def visit_and_node(node); end # Visit a ArgumentsNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ArgumentsNode).void } def visit_arguments_node(node); end # Visit a ArrayNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ArrayNode).void } def visit_array_node(node); end # Visit a ArrayPatternNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ArrayPatternNode).void } def visit_array_pattern_node(node); end # Visit a AssocNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AssocNode).void } def visit_assoc_node(node); end # Visit a AssocSplatNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::AssocSplatNode).void } def visit_assoc_splat_node(node); end # Visit a BackReferenceReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BackReferenceReadNode).void } def visit_back_reference_read_node(node); end # Visit a BeginNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BeginNode).void } def visit_begin_node(node); end # Visit a BlockArgumentNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BlockArgumentNode).void } def visit_block_argument_node(node); end # Visit a BlockLocalVariableNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BlockLocalVariableNode).void } def visit_block_local_variable_node(node); end # Visit a BlockNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BlockNode).void } def visit_block_node(node); end # Visit a BlockParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BlockParameterNode).void } def visit_block_parameter_node(node); end # Visit a BlockParametersNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BlockParametersNode).void } def visit_block_parameters_node(node); end # Visit a BreakNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::BreakNode).void } def visit_break_node(node); end # Visit a CallAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CallAndWriteNode).void } def visit_call_and_write_node(node); end # Visit a CallNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CallNode).void } def visit_call_node(node); end # Visit a CallOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CallOperatorWriteNode).void } def visit_call_operator_write_node(node); end # Visit a CallOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CallOrWriteNode).void } def visit_call_or_write_node(node); end # Visit a CallTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CallTargetNode).void } def visit_call_target_node(node); end # Visit a CapturePatternNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CapturePatternNode).void } def visit_capture_pattern_node(node); end # Visit a CaseMatchNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CaseMatchNode).void } def visit_case_match_node(node); end # Visit a CaseNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::CaseNode).void } def visit_case_node(node); end # Visit a ClassNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassNode).void } def visit_class_node(node); end # Visit a ClassVariableAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableAndWriteNode).void } def visit_class_variable_and_write_node(node); end # Visit a ClassVariableOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableOperatorWriteNode).void } def visit_class_variable_operator_write_node(node); end # Visit a ClassVariableOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableOrWriteNode).void } def visit_class_variable_or_write_node(node); end # Visit a ClassVariableReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableReadNode).void } def visit_class_variable_read_node(node); end # Visit a ClassVariableTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableTargetNode).void } def visit_class_variable_target_node(node); end # Visit a ClassVariableWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ClassVariableWriteNode).void } def visit_class_variable_write_node(node); end # Visit a ConstantAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantAndWriteNode).void } def visit_constant_and_write_node(node); end # Visit a ConstantOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantOperatorWriteNode).void } def visit_constant_operator_write_node(node); end # Visit a ConstantOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantOrWriteNode).void } def visit_constant_or_write_node(node); end # Visit a ConstantPathAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathAndWriteNode).void } def visit_constant_path_and_write_node(node); end # Visit a ConstantPathNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathNode).void } def visit_constant_path_node(node); end # Visit a ConstantPathOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathOperatorWriteNode).void } def visit_constant_path_operator_write_node(node); end # Visit a ConstantPathOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathOrWriteNode).void } def visit_constant_path_or_write_node(node); end # Visit a ConstantPathTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathTargetNode).void } def visit_constant_path_target_node(node); end # Visit a ConstantPathWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantPathWriteNode).void } def visit_constant_path_write_node(node); end # Visit a ConstantReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantReadNode).void } def visit_constant_read_node(node); end # Visit a ConstantTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantTargetNode).void } def visit_constant_target_node(node); end # Visit a ConstantWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ConstantWriteNode).void } def visit_constant_write_node(node); end # Visit a DefNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::DefNode).void } def visit_def_node(node); end # Visit a DefinedNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::DefinedNode).void } def visit_defined_node(node); end # Visit a ElseNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ElseNode).void } def visit_else_node(node); end # Visit a EmbeddedStatementsNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::EmbeddedStatementsNode).void } def visit_embedded_statements_node(node); end # Visit a EmbeddedVariableNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::EmbeddedVariableNode).void } def visit_embedded_variable_node(node); end # Visit a EnsureNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::EnsureNode).void } def visit_ensure_node(node); end # Visit a FalseNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::FalseNode).void } def visit_false_node(node); end # Visit a FindPatternNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::FindPatternNode).void } def visit_find_pattern_node(node); end # Visit a FlipFlopNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::FlipFlopNode).void } def visit_flip_flop_node(node); end # Visit a FloatNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::FloatNode).void } def visit_float_node(node); end # Visit a ForNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ForNode).void } def visit_for_node(node); end # Visit a ForwardingArgumentsNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ForwardingArgumentsNode).void } def visit_forwarding_arguments_node(node); end # Visit a ForwardingParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ForwardingParameterNode).void } def visit_forwarding_parameter_node(node); end # Visit a ForwardingSuperNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ForwardingSuperNode).void } def visit_forwarding_super_node(node); end # Visit a GlobalVariableAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableAndWriteNode).void } def visit_global_variable_and_write_node(node); end # Visit a GlobalVariableOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableOperatorWriteNode).void } def visit_global_variable_operator_write_node(node); end # Visit a GlobalVariableOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableOrWriteNode).void } def visit_global_variable_or_write_node(node); end # Visit a GlobalVariableReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableReadNode).void } def visit_global_variable_read_node(node); end # Visit a GlobalVariableTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableTargetNode).void } def visit_global_variable_target_node(node); end # Visit a GlobalVariableWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::GlobalVariableWriteNode).void } def visit_global_variable_write_node(node); end # Visit a HashNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::HashNode).void } def visit_hash_node(node); end # Visit a HashPatternNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::HashPatternNode).void } def visit_hash_pattern_node(node); end # Visit a IfNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IfNode).void } def visit_if_node(node); end # Visit a ImaginaryNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ImaginaryNode).void } def visit_imaginary_node(node); end # Visit a ImplicitNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ImplicitNode).void } def visit_implicit_node(node); end # Visit a ImplicitRestNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ImplicitRestNode).void } def visit_implicit_rest_node(node); end # Visit a InNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InNode).void } def visit_in_node(node); end # Visit a IndexAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IndexAndWriteNode).void } def visit_index_and_write_node(node); end # Visit a IndexOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IndexOperatorWriteNode).void } def visit_index_operator_write_node(node); end # Visit a IndexOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IndexOrWriteNode).void } def visit_index_or_write_node(node); end # Visit a IndexTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IndexTargetNode).void } def visit_index_target_node(node); end # Visit a InstanceVariableAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableAndWriteNode).void } def visit_instance_variable_and_write_node(node); end # Visit a InstanceVariableOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableOperatorWriteNode).void } def visit_instance_variable_operator_write_node(node); end # Visit a InstanceVariableOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableOrWriteNode).void } def visit_instance_variable_or_write_node(node); end # Visit a InstanceVariableReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableReadNode).void } def visit_instance_variable_read_node(node); end # Visit a InstanceVariableTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableTargetNode).void } def visit_instance_variable_target_node(node); end # Visit a InstanceVariableWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InstanceVariableWriteNode).void } def visit_instance_variable_write_node(node); end # Visit a IntegerNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::IntegerNode).void } def visit_integer_node(node); end # Visit a InterpolatedMatchLastLineNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InterpolatedMatchLastLineNode).void } def visit_interpolated_match_last_line_node(node); end # Visit a InterpolatedRegularExpressionNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InterpolatedRegularExpressionNode).void } def visit_interpolated_regular_expression_node(node); end # Visit a InterpolatedStringNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InterpolatedStringNode).void } def visit_interpolated_string_node(node); end # Visit a InterpolatedSymbolNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InterpolatedSymbolNode).void } def visit_interpolated_symbol_node(node); end # Visit a InterpolatedXStringNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::InterpolatedXStringNode).void } def visit_interpolated_x_string_node(node); end # Visit a KeywordHashNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::KeywordHashNode).void } def visit_keyword_hash_node(node); end # Visit a KeywordRestParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::KeywordRestParameterNode).void } def visit_keyword_rest_parameter_node(node); end # Visit a LambdaNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LambdaNode).void } def visit_lambda_node(node); end # Visit a LocalVariableAndWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableAndWriteNode).void } def visit_local_variable_and_write_node(node); end # Visit a LocalVariableOperatorWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableOperatorWriteNode).void } def visit_local_variable_operator_write_node(node); end # Visit a LocalVariableOrWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableOrWriteNode).void } def visit_local_variable_or_write_node(node); end # Visit a LocalVariableReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableReadNode).void } def visit_local_variable_read_node(node); end # Visit a LocalVariableTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableTargetNode).void } def visit_local_variable_target_node(node); end # Visit a LocalVariableWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::LocalVariableWriteNode).void } def visit_local_variable_write_node(node); end # Visit a MatchLastLineNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MatchLastLineNode).void } def visit_match_last_line_node(node); end # Visit a MatchPredicateNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MatchPredicateNode).void } def visit_match_predicate_node(node); end # Visit a MatchRequiredNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MatchRequiredNode).void } def visit_match_required_node(node); end # Visit a MatchWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MatchWriteNode).void } def visit_match_write_node(node); end # Visit a MissingNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MissingNode).void } def visit_missing_node(node); end # Visit a ModuleNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ModuleNode).void } def visit_module_node(node); end # Visit a MultiTargetNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MultiTargetNode).void } def visit_multi_target_node(node); end # Visit a MultiWriteNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::MultiWriteNode).void } def visit_multi_write_node(node); end # Visit a NextNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::NextNode).void } def visit_next_node(node); end # Visit a NilNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::NilNode).void } def visit_nil_node(node); end # Visit a NoKeywordsParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::NoKeywordsParameterNode).void } def visit_no_keywords_parameter_node(node); end # Visit a NumberedParametersNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::NumberedParametersNode).void } def visit_numbered_parameters_node(node); end # Visit a NumberedReferenceReadNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::NumberedReferenceReadNode).void } def visit_numbered_reference_read_node(node); end # Visit a OptionalKeywordParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::OptionalKeywordParameterNode).void } def visit_optional_keyword_parameter_node(node); end # Visit a OptionalParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::OptionalParameterNode).void } def visit_optional_parameter_node(node); end # Visit a OrNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::OrNode).void } def visit_or_node(node); end # Visit a ParametersNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ParametersNode).void } def visit_parameters_node(node); end # Visit a ParenthesesNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ParenthesesNode).void } def visit_parentheses_node(node); end # Visit a PinnedExpressionNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::PinnedExpressionNode).void } def visit_pinned_expression_node(node); end # Visit a PinnedVariableNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::PinnedVariableNode).void } def visit_pinned_variable_node(node); end # Visit a PostExecutionNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::PostExecutionNode).void } def visit_post_execution_node(node); end # Visit a PreExecutionNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::PreExecutionNode).void } def visit_pre_execution_node(node); end # Visit a ProgramNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ProgramNode).void } def visit_program_node(node); end # Visit a RangeNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RangeNode).void } def visit_range_node(node); end # Visit a RationalNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RationalNode).void } def visit_rational_node(node); end # Visit a RedoNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RedoNode).void } def visit_redo_node(node); end # Visit a RegularExpressionNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RegularExpressionNode).void } def visit_regular_expression_node(node); end # Visit a RequiredKeywordParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RequiredKeywordParameterNode).void } def visit_required_keyword_parameter_node(node); end # Visit a RequiredParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RequiredParameterNode).void } def visit_required_parameter_node(node); end # Visit a RescueModifierNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RescueModifierNode).void } def visit_rescue_modifier_node(node); end # Visit a RescueNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RescueNode).void } def visit_rescue_node(node); end # Visit a RestParameterNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RestParameterNode).void } def visit_rest_parameter_node(node); end # Visit a RetryNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::RetryNode).void } def visit_retry_node(node); end # Visit a ReturnNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::ReturnNode).void } def visit_return_node(node); end # Visit a SelfNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SelfNode).void } def visit_self_node(node); end # Visit a SingletonClassNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SingletonClassNode).void } def visit_singleton_class_node(node); end # Visit a SourceEncodingNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SourceEncodingNode).void } def visit_source_encoding_node(node); end # Visit a SourceFileNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SourceFileNode).void } def visit_source_file_node(node); end # Visit a SourceLineNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SourceLineNode).void } def visit_source_line_node(node); end # Visit a SplatNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SplatNode).void } def visit_splat_node(node); end # Visit a StatementsNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::StatementsNode).void } def visit_statements_node(node); end # Visit a StringNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::StringNode).void } def visit_string_node(node); end # Visit a SuperNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SuperNode).void } def visit_super_node(node); end # Visit a SymbolNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::SymbolNode).void } def visit_symbol_node(node); end # Visit a TrueNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::TrueNode).void } def visit_true_node(node); end # Visit a UndefNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::UndefNode).void } def visit_undef_node(node); end # Visit a UnlessNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::UnlessNode).void } def visit_unless_node(node); end # Visit a UntilNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::UntilNode).void } def visit_until_node(node); end # Visit a WhenNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::WhenNode).void } def visit_when_node(node); end # Visit a WhileNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::WhileNode).void } def visit_while_node(node); end # Visit a XStringNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::XStringNode).void } def visit_x_string_node(node); end # Visit a YieldNode node # - # source://prism//prism/visitor.rb#26 + # source://prism//lib/prism/visitor.rb#26 + sig { params(node: Prism::YieldNode).void } def visit_yield_node(node); end end @@ -24703,73 +30982,96 @@ end # when true # ^^^^^^^^^ # end +# +# source://prism//lib/prism/node.rb#17039 class Prism::WhenNode < ::Prism::Node - # def initialize: (keyword_loc: Location, conditions: Array[Node], statements: StatementsNode?, location: Location) -> void + # def initialize: (Location keyword_loc, Array[Node] conditions, StatementsNode? statements, Location location) -> void # # @return [WhenNode] a new instance of WhenNode # - # source://prism//prism/node.rb#16776 + # source://prism//lib/prism/node.rb#17050 + sig do + params( + keyword_loc: Prism::Location, + conditions: T::Array[Prism::Node], + statements: T.nilable(Prism::StatementsNode), + location: Prism::Location + ).void + end def initialize(keyword_loc, conditions, statements, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16784 + # source://prism//lib/prism/node.rb#17058 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16789 + # source://prism//lib/prism/node.rb#17063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16802 + # source://prism//lib/prism/node.rb#17076 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16794 + # source://prism//lib/prism/node.rb#17068 def compact_child_nodes; end # attr_reader conditions: Array[Node] # - # source://prism//prism/node.rb#16770 + # source://prism//lib/prism/node.rb#17044 + sig { returns(T::Array[Prism::Node]) } def conditions; end # def copy: (**params) -> WhenNode # - # source://prism//prism/node.rb#16807 + # source://prism//lib/prism/node.rb#17081 + sig { params(params: T.untyped).returns(Prism::WhenNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16789 + # source://prism//lib/prism/node.rb#17063 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, conditions: Array[Node], statements: StatementsNode?, location: Location } # - # source://prism//prism/node.rb#16820 + # source://prism//lib/prism/node.rb#17094 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16830 + # source://prism//lib/prism/node.rb#17104 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#16825 + # source://prism//lib/prism/node.rb#17099 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#16767 + # source://prism//lib/prism/node.rb#17041 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#16773 + # source://prism//lib/prism/node.rb#17047 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Sometimes you want to check an instance of a node against a list of @@ -24787,7 +31089,7 @@ class Prism::WhenNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16857 + # source://prism//lib/prism/node.rb#17131 def type; end class << self @@ -24798,7 +31100,7 @@ class Prism::WhenNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#16867 + # source://prism//lib/prism/node.rb#17141 def type; end end end @@ -24810,93 +31112,121 @@ end # # while foo do bar end # ^^^^^^^^^^^^^^^^^^^^ +# +# source://prism//lib/prism/node.rb#17153 class Prism::WhileNode < ::Prism::Node - # def initialize: (flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location) -> void + # def initialize: (Integer flags, Location keyword_loc, Location? closing_loc, Node predicate, StatementsNode? statements, Location location) -> void # # @return [WhileNode] a new instance of WhileNode # - # source://prism//prism/node.rb#16896 + # source://prism//lib/prism/node.rb#17170 + 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 + ).void + end def initialize(flags, keyword_loc, closing_loc, predicate, statements, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#16906 + # source://prism//lib/prism/node.rb#17180 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def begin_modifier?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#16953 + # source://prism//lib/prism/node.rb#17227 + sig { returns(T::Boolean) } def begin_modifier?; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16915 + # source://prism//lib/prism/node.rb#17189 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String? # - # source://prism//prism/node.rb#16963 + # source://prism//lib/prism/node.rb#17237 + sig { returns(T.nilable(String)) } def closing; end # attr_reader closing_loc: Location? # - # source://prism//prism/node.rb#16887 + # source://prism//lib/prism/node.rb#17161 + sig { returns(T.nilable(Prism::Location)) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#16928 + # source://prism//lib/prism/node.rb#17202 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#16920 + # source://prism//lib/prism/node.rb#17194 def compact_child_nodes; end # def copy: (**params) -> WhileNode # - # source://prism//prism/node.rb#16933 + # source://prism//lib/prism/node.rb#17207 + sig { params(params: T.untyped).returns(Prism::WhileNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#16915 + # source://prism//lib/prism/node.rb#17189 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location } # - # source://prism//prism/node.rb#16948 + # source://prism//lib/prism/node.rb#17222 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#16968 + # source://prism//lib/prism/node.rb#17242 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#16958 + # source://prism//lib/prism/node.rb#17232 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#16884 + # source://prism//lib/prism/node.rb#17158 + sig { returns(Prism::Location) } def keyword_loc; end # attr_reader predicate: Node # - # source://prism//prism/node.rb#16890 + # source://prism//lib/prism/node.rb#17164 + sig { returns(Prism::Node) } def predicate; end - # source://prism//prism/node.rb#16910 + # source://prism//lib/prism/node.rb#17184 def set_newline_flag(newline_marked); end # attr_reader statements: StatementsNode? # - # source://prism//prism/node.rb#16893 + # source://prism//lib/prism/node.rb#17167 + sig { returns(T.nilable(Prism::StatementsNode)) } def statements; end # Sometimes you want to check an instance of a node against a list of @@ -24914,14 +31244,15 @@ class Prism::WhileNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#16999 + # source://prism//lib/prism/node.rb#17273 def type; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#16881 + # source://prism//lib/prism/node.rb#17155 + sig { returns(Integer) } def flags; end class << self @@ -24932,7 +31263,7 @@ class Prism::WhileNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#17009 + # source://prism//lib/prism/node.rb#17283 def type; end end end @@ -24941,99 +31272,128 @@ end # # `foo` # ^^^^^ +# +# source://prism//lib/prism/node.rb#17292 class Prism::XStringNode < ::Prism::Node include ::Prism::HeredocQuery - # def initialize: (flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location) -> void + # def initialize: (Integer flags, Location opening_loc, Location content_loc, Location closing_loc, String unescaped, Location location) -> void # # @return [XStringNode] a new instance of XStringNode # - # source://prism//prism/node.rb#17035 + # source://prism//lib/prism/node.rb#17309 + sig do + params( + flags: Integer, + opening_loc: Prism::Location, + content_loc: Prism::Location, + closing_loc: Prism::Location, + unescaped: String, + location: Prism::Location + ).void + end def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#17045 + # source://prism//lib/prism/node.rb#17319 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#17050 + # source://prism//lib/prism/node.rb#17324 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def closing: () -> String # - # source://prism//prism/node.rb#17105 + # source://prism//lib/prism/node.rb#17379 + sig { returns(String) } def closing; end # attr_reader closing_loc: Location # - # source://prism//prism/node.rb#17029 + # source://prism//lib/prism/node.rb#17303 + sig { returns(Prism::Location) } def closing_loc; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#17060 + # source://prism//lib/prism/node.rb#17334 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#17055 + # source://prism//lib/prism/node.rb#17329 def compact_child_nodes; end # def content: () -> String # - # source://prism//prism/node.rb#17100 + # source://prism//lib/prism/node.rb#17374 + sig { returns(String) } def content; end # attr_reader content_loc: Location # - # source://prism//prism/node.rb#17026 + # source://prism//lib/prism/node.rb#17300 + sig { returns(Prism::Location) } def content_loc; end # def copy: (**params) -> XStringNode # - # source://prism//prism/node.rb#17065 + # source://prism//lib/prism/node.rb#17339 + sig { params(params: T.untyped).returns(Prism::XStringNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#17050 + # source://prism//lib/prism/node.rb#17324 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location } # - # source://prism//prism/node.rb#17080 + # source://prism//lib/prism/node.rb#17354 + 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 forced_binary_encoding?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#17090 + # source://prism//lib/prism/node.rb#17364 + sig { returns(T::Boolean) } def forced_binary_encoding?; end # def forced_utf8_encoding?: () -> bool # # @return [Boolean] # - # source://prism//prism/node.rb#17085 + # source://prism//lib/prism/node.rb#17359 + sig { returns(T::Boolean) } def forced_utf8_encoding?; end - # def inspect(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#17110 + # source://prism//lib/prism/node.rb#17384 def inspect(inspector = T.unsafe(nil)); end # def opening: () -> String # - # source://prism//prism/node.rb#17095 + # source://prism//lib/prism/node.rb#17369 + sig { returns(String) } def opening; end # attr_reader opening_loc: Location # - # source://prism//prism/node.rb#17023 + # source://prism//lib/prism/node.rb#17297 + sig { returns(Prism::Location) } def opening_loc; end # Sometimes you want to check an instance of a node against a list of @@ -25051,19 +31411,21 @@ class Prism::XStringNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#17135 + # source://prism//lib/prism/node.rb#17409 def type; end # attr_reader unescaped: String # - # source://prism//prism/node.rb#17032 + # source://prism//lib/prism/node.rb#17306 + sig { returns(String) } def unescaped; end private # Returns the value of attribute flags. # - # source://prism//prism/node.rb#17020 + # source://prism//lib/prism/node.rb#17294 + sig { returns(Integer) } def flags; end class << self @@ -25074,7 +31436,7 @@ class Prism::XStringNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#17145 + # source://prism//lib/prism/node.rb#17419 def type; end end end @@ -25083,88 +31445,115 @@ end # # yield 1 # ^^^^^^^ +# +# source://prism//lib/prism/node.rb#17428 class Prism::YieldNode < ::Prism::Node - # def initialize: (keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, location: Location) -> void + # 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//prism/node.rb#17168 + # source://prism//lib/prism/node.rb#17442 + 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 + ).void + end def initialize(keyword_loc, lparen_loc, arguments, rparen_loc, location); end - # def accept: (visitor: Visitor) -> void + # def accept: (Visitor visitor) -> void # - # source://prism//prism/node.rb#17177 + # source://prism//lib/prism/node.rb#17451 + sig { params(visitor: Prism::Visitor).void } def accept(visitor); end # attr_reader arguments: ArgumentsNode? # - # source://prism//prism/node.rb#17162 + # source://prism//lib/prism/node.rb#17436 + sig { returns(T.nilable(Prism::ArgumentsNode)) } def arguments; end # def child_nodes: () -> Array[nil | Node] # - # source://prism//prism/node.rb#17182 + # source://prism//lib/prism/node.rb#17456 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def child_nodes; end # def comment_targets: () -> Array[Node | Location] # - # source://prism//prism/node.rb#17194 + # source://prism//lib/prism/node.rb#17468 def comment_targets; end # def compact_child_nodes: () -> Array[Node] # - # source://prism//prism/node.rb#17187 + # source://prism//lib/prism/node.rb#17461 def compact_child_nodes; end # def copy: (**params) -> YieldNode # - # source://prism//prism/node.rb#17199 + # source://prism//lib/prism/node.rb#17473 + sig { params(params: T.untyped).returns(Prism::YieldNode) } def copy(**params); end # def child_nodes: () -> Array[nil | Node] # def deconstruct: () -> Array[nil | Node] # - # source://prism//prism/node.rb#17182 + # source://prism//lib/prism/node.rb#17456 + sig { returns(T::Array[T.nilable(Prism::Node)]) } def deconstruct; end - # def deconstruct_keys: (keys: Array[Symbol]) -> Hash[Symbol, nil | Node | Array[Node] | String | Token | Array[Token] | Location] + # def deconstruct_keys: (Array[Symbol] keys) -> { keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, location: Location } # - # source://prism//prism/node.rb#17213 + # source://prism//lib/prism/node.rb#17487 + 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(inspector: NodeInspector) -> String + # def inspect(NodeInspector inspector) -> String # - # source://prism//prism/node.rb#17233 + # source://prism//lib/prism/node.rb#17507 def inspect(inspector = T.unsafe(nil)); end # def keyword: () -> String # - # source://prism//prism/node.rb#17218 + # source://prism//lib/prism/node.rb#17492 + sig { returns(String) } def keyword; end # attr_reader keyword_loc: Location # - # source://prism//prism/node.rb#17156 + # source://prism//lib/prism/node.rb#17430 + sig { returns(Prism::Location) } def keyword_loc; end # def lparen: () -> String? # - # source://prism//prism/node.rb#17223 + # source://prism//lib/prism/node.rb#17497 + sig { returns(T.nilable(String)) } def lparen; end # attr_reader lparen_loc: Location? # - # source://prism//prism/node.rb#17159 + # source://prism//lib/prism/node.rb#17433 + sig { returns(T.nilable(Prism::Location)) } def lparen_loc; end # def rparen: () -> String? # - # source://prism//prism/node.rb#17228 + # source://prism//lib/prism/node.rb#17502 + sig { returns(T.nilable(String)) } def rparen; end # attr_reader rparen_loc: Location? # - # source://prism//prism/node.rb#17165 + # source://prism//lib/prism/node.rb#17439 + sig { returns(T.nilable(Prism::Location)) } def rparen_loc; end # Sometimes you want to check an instance of a node against a list of @@ -25182,7 +31571,7 @@ class Prism::YieldNode < ::Prism::Node # # def type: () -> Symbol # - # source://prism//prism/node.rb#17261 + # source://prism//lib/prism/node.rb#17535 def type; end class << self @@ -25193,7 +31582,7 @@ class Prism::YieldNode < ::Prism::Node # # def self.type: () -> Symbol # - # source://prism//prism/node.rb#17271 + # source://prism//lib/prism/node.rb#17545 def type; end end end diff --git a/sorbet/rbi/gems/rbi@0.1.6.rbi b/sorbet/rbi/gems/rbi@0.1.8.rbi similarity index 99% rename from sorbet/rbi/gems/rbi@0.1.6.rbi rename to sorbet/rbi/gems/rbi@0.1.8.rbi index b7b3472..cf5f5fb 100644 --- a/sorbet/rbi/gems/rbi@0.1.6.rbi +++ b/sorbet/rbi/gems/rbi@0.1.8.rbi @@ -1820,7 +1820,7 @@ class RBI::Rewriters::Merge::Conflict < ::T::Struct def to_s; end class << self - # source://sorbet-runtime/0.5.11221/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11255/lib/types/struct.rb#13 def inherited(s); end end end @@ -2037,7 +2037,7 @@ class RBI::Rewriters::RemoveKnownDefinitions::Operation < ::T::Struct def to_s; end class << self - # source://sorbet-runtime/0.5.11221/lib/types/struct.rb#13 + # source://sorbet-runtime/0.5.11255/lib/types/struct.rb#13 def inherited(s); end end end diff --git a/sorbet/rbi/gems/rubocop-sorbet@0.7.6.rbi b/sorbet/rbi/gems/rubocop-sorbet@0.7.7.rbi similarity index 100% rename from sorbet/rbi/gems/rubocop-sorbet@0.7.6.rbi rename to sorbet/rbi/gems/rubocop-sorbet@0.7.7.rbi diff --git a/sorbet/rbi/gems/rubocop@1.59.0.rbi b/sorbet/rbi/gems/rubocop@1.60.2.rbi similarity index 98% rename from sorbet/rbi/gems/rubocop@1.59.0.rbi rename to sorbet/rbi/gems/rubocop@1.60.2.rbi index d5a99e3..ed45e7f 100644 --- a/sorbet/rbi/gems/rubocop@1.59.0.rbi +++ b/sorbet/rbi/gems/rubocop@1.60.2.rbi @@ -749,7 +749,7 @@ class RuboCop::CommentConfig # @return [CommentConfig] a new instance of CommentConfig # - # source://standard/1.33.0/lib/standard/rubocop/ext.rb#20 + # source://standard/1.34.0/lib/standard/rubocop/ext.rb#20 def initialize(processed_source); end # @return [Boolean] @@ -949,7 +949,7 @@ end # during a run of the rubocop program, if files in several # directories are inspected. # -# source://rubocop//lib/rubocop/config.rb#14 +# source://rubocop//lib/rubocop/config.rb#12 class RuboCop::Config include ::RuboCop::PathUtil include ::RuboCop::FileFinder @@ -957,7 +957,7 @@ class RuboCop::Config # @return [Config] a new instance of Config # - # source://rubocop//lib/rubocop/config.rb#32 + # source://rubocop//lib/rubocop/config.rb#30 def initialize(hash = T.unsafe(nil), loaded_path = T.unsafe(nil)); end # source://forwardable/1.3.3/forwardable.rb#231 @@ -968,15 +968,15 @@ class RuboCop::Config # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#172 + # source://rubocop//lib/rubocop/config.rb#170 def active_support_extensions_enabled?; end - # source://rubocop//lib/rubocop/config.rb#98 + # source://rubocop//lib/rubocop/config.rb#96 def add_excludes_from_higher_level(highest_config); end # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#195 + # source://rubocop//lib/rubocop/config.rb#193 def allowed_camel_case_file?(file); end # Paths specified in configuration files starting with .rubocop are @@ -985,25 +985,25 @@ class RuboCop::Config # config/default.yml, for example, are not relative to RuboCop's config # directory since that wouldn't work. # - # source://rubocop//lib/rubocop/config.rb#239 + # source://rubocop//lib/rubocop/config.rb#237 def base_dir_for_path_parameters; end - # source://rubocop//lib/rubocop/config.rb#264 + # source://rubocop//lib/rubocop/config.rb#262 def bundler_lock_file_path; end - # source://rubocop//lib/rubocop/config.rb#53 + # source://rubocop//lib/rubocop/config.rb#51 def check; end # @api private # @return [Boolean] whether config for this badge has 'Include' or 'Exclude' keys # - # source://rubocop//lib/rubocop/config.rb#144 + # source://rubocop//lib/rubocop/config.rb#142 def clusivity_config_for_badge?(badge); end # source://forwardable/1.3.3/forwardable.rb#231 def delete(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#110 + # source://rubocop//lib/rubocop/config.rb#108 def deprecation_check; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1011,7 +1011,7 @@ class RuboCop::Config # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#164 + # source://rubocop//lib/rubocop/config.rb#162 def disabled_new_cops?; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1022,7 +1022,7 @@ class RuboCop::Config # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#168 + # source://rubocop//lib/rubocop/config.rb#166 def enabled_new_cops?; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1030,22 +1030,22 @@ class RuboCop::Config # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#217 + # source://rubocop//lib/rubocop/config.rb#215 def file_to_exclude?(file); end # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#176 + # source://rubocop//lib/rubocop/config.rb#174 def file_to_include?(file); end - # source://rubocop//lib/rubocop/config.rb#160 + # source://rubocop//lib/rubocop/config.rb#158 def for_all_cops; end # Note: the 'Enabled' attribute is same as that returned by `for_cop` # # @return [Config] for the given cop merged with that of its department (if any) # - # source://rubocop//lib/rubocop/config.rb#130 + # source://rubocop//lib/rubocop/config.rb#128 def for_badge(badge); end # Note: the 'Enabled' attribute is calculated according to the department's @@ -1053,7 +1053,7 @@ class RuboCop::Config # # @return [Config] for the given cop / cop name. # - # source://rubocop//lib/rubocop/config.rb#124 + # source://rubocop//lib/rubocop/config.rb#122 def for_cop(cop); end # Note: the 'Enabled' attribute will be present only if specified @@ -1061,17 +1061,17 @@ class RuboCop::Config # # @return [Config] for the given department name. # - # source://rubocop//lib/rubocop/config.rb#155 + # source://rubocop//lib/rubocop/config.rb#153 def for_department(department_name); end - # source://rubocop//lib/rubocop/config.rb#287 + # source://rubocop//lib/rubocop/config.rb#285 def inspect; end # True if this is a config file that is shipped with RuboCop # # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#78 + # source://rubocop//lib/rubocop/config.rb#76 def internal?; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1080,15 +1080,15 @@ class RuboCop::Config # source://forwardable/1.3.3/forwardable.rb#231 def keys(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#49 + # source://rubocop//lib/rubocop/config.rb#47 def loaded_features; end # Returns the value of attribute loaded_path. # - # source://rubocop//lib/rubocop/config.rb#22 + # source://rubocop//lib/rubocop/config.rb#20 def loaded_path; end - # source://rubocop//lib/rubocop/config.rb#83 + # source://rubocop//lib/rubocop/config.rb#81 def make_excludes_absolute; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1097,16 +1097,16 @@ class RuboCop::Config # source://forwardable/1.3.3/forwardable.rb#231 def merge(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#230 + # source://rubocop//lib/rubocop/config.rb#228 def path_relative_to_config(path); end - # source://rubocop//lib/rubocop/config.rb#226 + # source://rubocop//lib/rubocop/config.rb#224 def patterns_to_exclude; end - # source://rubocop//lib/rubocop/config.rb#222 + # source://rubocop//lib/rubocop/config.rb#220 def patterns_to_include; end - # source://rubocop//lib/rubocop/config.rb#275 + # source://rubocop//lib/rubocop/config.rb#273 def pending_cops; end # Returns true if there's a chance that an Include pattern matches hidden @@ -1114,19 +1114,19 @@ class RuboCop::Config # # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#209 + # source://rubocop//lib/rubocop/config.rb#207 def possibly_include_hidden?; end # source://forwardable/1.3.3/forwardable.rb#231 def replace(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#73 + # source://rubocop//lib/rubocop/config.rb#71 def signature; end - # source://rubocop//lib/rubocop/config.rb#260 + # source://rubocop//lib/rubocop/config.rb#258 def smart_loaded_path; end - # source://rubocop//lib/rubocop/config.rb#249 + # source://rubocop//lib/rubocop/config.rb#247 def target_rails_version; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1138,7 +1138,7 @@ class RuboCop::Config # source://forwardable/1.3.3/forwardable.rb#231 def to_hash(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#69 + # source://rubocop//lib/rubocop/config.rb#67 def to_s; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -1147,32 +1147,32 @@ class RuboCop::Config # source://forwardable/1.3.3/forwardable.rb#231 def validate(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config.rb#60 + # source://rubocop//lib/rubocop/config.rb#58 def validate_after_resolution; end private - # source://rubocop//lib/rubocop/config.rb#322 + # source://rubocop//lib/rubocop/config.rb#320 def department_of(qualified_cop_name); end # @return [Boolean] # - # source://rubocop//lib/rubocop/config.rb#310 + # source://rubocop//lib/rubocop/config.rb#308 def enable_cop?(qualified_cop_name, cop_options); end - # source://rubocop//lib/rubocop/config.rb#297 + # source://rubocop//lib/rubocop/config.rb#295 def read_rails_version_from_bundler_lock_file; end - # source://rubocop//lib/rubocop/config.rb#293 + # source://rubocop//lib/rubocop/config.rb#291 def target_rails_version_from_bundler_lock_file; end class << self - # source://rubocop//lib/rubocop/config.rb#24 + # source://rubocop//lib/rubocop/config.rb#22 def create(hash, path, check: T.unsafe(nil)); end end end -# source://rubocop//lib/rubocop/config.rb#19 +# source://rubocop//lib/rubocop/config.rb#17 class RuboCop::Config::CopConfig < ::Struct # Returns the value of attribute metadata # @@ -1205,7 +1205,7 @@ class RuboCop::Config::CopConfig < ::Struct end end -# source://rubocop//lib/rubocop/config.rb#21 +# source://rubocop//lib/rubocop/config.rb#19 RuboCop::Config::DEFAULT_RAILS_VERSION = T.let(T.unsafe(nil), Float) # This class has methods related to finding configuration path. @@ -1290,12 +1290,12 @@ RuboCop::ConfigFinder::XDG_CONFIG = T.let(T.unsafe(nil), String) # during a run of the rubocop program, if files in several # directories are inspected. # -# source://rubocop//lib/rubocop/config_loader.rb#18 +# source://rubocop//lib/rubocop/config_loader.rb#17 class RuboCop::ConfigLoader extend ::RuboCop::FileFinder class << self - # source://rubocop//lib/rubocop/config_loader.rb#138 + # source://rubocop//lib/rubocop/config_loader.rb#137 def add_excludes_from_files(config, config_file); end # Used to add features that were required inside a config or from @@ -1303,13 +1303,13 @@ class RuboCop::ConfigLoader # # @api private # - # source://rubocop//lib/rubocop/config_loader.rb#199 + # source://rubocop//lib/rubocop/config_loader.rb#198 def add_loaded_features(loaded_features); end - # source://rubocop//lib/rubocop/config_loader.rb#81 + # source://rubocop//lib/rubocop/config_loader.rb#80 def add_missing_namespaces(path, hash); end - # source://rubocop//lib/rubocop/config_loader.rb#42 + # source://rubocop//lib/rubocop/config_loader.rb#41 def clear_options; end # Returns the path of .rubocop.yml searching upwards in the @@ -1318,128 +1318,128 @@ class RuboCop::ConfigLoader # user's home directory is checked. If there's no .rubocop.yml # there either, the path to the default file is returned. # - # source://rubocop//lib/rubocop/config_loader.rb#105 + # source://rubocop//lib/rubocop/config_loader.rb#104 def configuration_file_for(target_dir); end - # source://rubocop//lib/rubocop/config_loader.rb#109 + # source://rubocop//lib/rubocop/config_loader.rb#108 def configuration_from_file(config_file, check: T.unsafe(nil)); end # Returns the value of attribute debug. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def debug; end # Sets the attribute debug # # @param value the value to set the attribute debug to. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def debug=(_arg0); end # Returns the value of attribute debug. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def debug?; end - # source://rubocop//lib/rubocop/config_loader.rb#148 + # source://rubocop//lib/rubocop/config_loader.rb#147 def default_configuration; end # Sets the attribute default_configuration # # @param value the value to set the attribute default_configuration to. # - # source://rubocop//lib/rubocop/config_loader.rb#36 + # source://rubocop//lib/rubocop/config_loader.rb#35 def default_configuration=(_arg0); end # Returns the value of attribute disable_pending_cops. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def disable_pending_cops; end # Sets the attribute disable_pending_cops # # @param value the value to set the attribute disable_pending_cops to. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def disable_pending_cops=(_arg0); end # Returns the value of attribute enable_pending_cops. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def enable_pending_cops; end # Sets the attribute enable_pending_cops # # @param value the value to set the attribute enable_pending_cops to. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def enable_pending_cops=(_arg0); end # Returns the value of attribute ignore_parent_exclusion. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def ignore_parent_exclusion; end # Sets the attribute ignore_parent_exclusion # # @param value the value to set the attribute ignore_parent_exclusion to. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def ignore_parent_exclusion=(_arg0); end # Returns the value of attribute ignore_parent_exclusion. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def ignore_parent_exclusion?; end # Returns the value of attribute ignore_unrecognized_cops. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def ignore_unrecognized_cops; end # Sets the attribute ignore_unrecognized_cops # # @param value the value to set the attribute ignore_unrecognized_cops to. # - # source://rubocop//lib/rubocop/config_loader.rb#34 + # source://rubocop//lib/rubocop/config_loader.rb#33 def ignore_unrecognized_cops=(_arg0); end # @api private # - # source://rubocop//lib/rubocop/config_loader.rb#156 + # source://rubocop//lib/rubocop/config_loader.rb#155 def inject_defaults!(project_root); end - # source://rubocop//lib/rubocop/config_loader.rb#48 + # source://rubocop//lib/rubocop/config_loader.rb#47 def load_file(file, check: T.unsafe(nil)); end # @raise [TypeError] # - # source://rubocop//lib/rubocop/config_loader.rb#68 + # source://rubocop//lib/rubocop/config_loader.rb#67 def load_yaml_configuration(absolute_path); end # Returns the value of attribute loaded_features. # - # source://rubocop//lib/rubocop/config_loader.rb#37 + # source://rubocop//lib/rubocop/config_loader.rb#36 def loaded_features; end # Return a recursive merge of two hashes. That is, a normal hash merge, # with the addition that any value that is a hash, and occurs in both # arguments, will also be merged. And so on. # - # source://rubocop//lib/rubocop/config_loader.rb#96 + # source://rubocop//lib/rubocop/config_loader.rb#95 def merge(base_hash, derived_hash); end # Merges the given configuration with the default one. # - # source://rubocop//lib/rubocop/config_loader.rb#192 + # source://rubocop//lib/rubocop/config_loader.rb#191 def merge_with_default(config, config_file, unset_nil: T.unsafe(nil)); end - # source://rubocop//lib/rubocop/config_loader.rb#129 + # source://rubocop//lib/rubocop/config_loader.rb#128 def pending_cops_only_qualified(pending_cops); end # @return [Boolean] # - # source://rubocop//lib/rubocop/config_loader.rb#133 + # source://rubocop//lib/rubocop/config_loader.rb#132 def possible_new_cops?(config); end # Returns the path RuboCop inferred as the root of the project. No file @@ -1447,48 +1447,48 @@ class RuboCop::ConfigLoader # # @deprecated Use `RuboCop::ConfigFinder.project_root` instead. # - # source://rubocop//lib/rubocop/config_loader.rb#167 + # source://rubocop//lib/rubocop/config_loader.rb#166 def project_root; end - # source://rubocop//lib/rubocop/config_loader.rb#176 + # source://rubocop//lib/rubocop/config_loader.rb#175 def warn_on_pending_cops(pending_cops); end - # source://rubocop//lib/rubocop/config_loader.rb#184 + # source://rubocop//lib/rubocop/config_loader.rb#183 def warn_pending_cop(cop); end private - # source://rubocop//lib/rubocop/config_loader.rb#213 + # source://rubocop//lib/rubocop/config_loader.rb#212 def check_duplication(yaml_code, absolute_path); end - # source://rubocop//lib/rubocop/config_loader.rb#205 + # source://rubocop//lib/rubocop/config_loader.rb#204 def file_path(file); end # Read the specified file, or exit with a friendly, concise message on # stderr. Care is taken to use the standard OS exit code for a "file not # found" error. # - # source://rubocop//lib/rubocop/config_loader.rb#233 + # source://rubocop//lib/rubocop/config_loader.rb#232 def read_file(absolute_path); end - # source://rubocop//lib/rubocop/config_loader.rb#209 + # source://rubocop//lib/rubocop/config_loader.rb#208 def resolver; end - # source://rubocop//lib/rubocop/config_loader.rb#239 + # source://rubocop//lib/rubocop/config_loader.rb#238 def yaml_safe_load(yaml_code, filename); end - # source://rubocop//lib/rubocop/config_loader.rb#249 + # source://rubocop//lib/rubocop/config_loader.rb#248 def yaml_safe_load!(yaml_code, filename); end end end -# source://rubocop//lib/rubocop/config_loader.rb#21 +# source://rubocop//lib/rubocop/config_loader.rb#20 RuboCop::ConfigLoader::DEFAULT_FILE = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/config_loader.rb#19 +# source://rubocop//lib/rubocop/config_loader.rb#18 RuboCop::ConfigLoader::DOTFILE = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/config_loader.rb#20 +# source://rubocop//lib/rubocop/config_loader.rb#19 RuboCop::ConfigLoader::RUBOCOP_HOME = T.let(T.unsafe(nil), String) # A help class for ConfigLoader that handles configuration resolution. @@ -1641,7 +1641,7 @@ end # Raised when a RuboCop configuration file is not found. # -# source://rubocop//lib/rubocop/config_loader.rb#10 +# source://rubocop//lib/rubocop/config_loader.rb#9 class RuboCop::ConfigNotFoundError < ::RuboCop::Error; end # This class handles obsolete configuration. @@ -2210,13 +2210,13 @@ end # Handles validation of configuration, for example cop names, parameter # names, and Ruby versions. # -# source://rubocop//lib/rubocop/config_validator.rb#8 +# source://rubocop//lib/rubocop/config_validator.rb#6 class RuboCop::ConfigValidator extend ::Forwardable # @return [ConfigValidator] a new instance of ConfigValidator # - # source://rubocop//lib/rubocop/config_validator.rb#27 + # source://rubocop//lib/rubocop/config_validator.rb#25 def initialize(config); end # source://forwardable/1.3.3/forwardable.rb#231 @@ -2225,10 +2225,10 @@ class RuboCop::ConfigValidator # source://forwardable/1.3.3/forwardable.rb#231 def smart_loaded_path(*args, **_arg1, &block); end - # source://rubocop//lib/rubocop/config_validator.rb#63 + # source://rubocop//lib/rubocop/config_validator.rb#61 def target_ruby_version; end - # source://rubocop//lib/rubocop/config_validator.rb#33 + # source://rubocop//lib/rubocop/config_validator.rb#31 def validate; end # Validations that should only be run after all config resolving has @@ -2237,100 +2237,100 @@ class RuboCop::ConfigValidator # chain has been loaded so that only the final value is validated, and # any obsolete but overridden values are ignored. # - # source://rubocop//lib/rubocop/config_validator.rb#59 + # source://rubocop//lib/rubocop/config_validator.rb#57 def validate_after_resolution; end # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#67 + # source://rubocop//lib/rubocop/config_validator.rb#65 def validate_section_presence(name); end private # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#104 + # source://rubocop//lib/rubocop/config_validator.rb#102 def alert_about_unrecognized_cops(invalid_cop_names); end - # source://rubocop//lib/rubocop/config_validator.rb#253 + # source://rubocop//lib/rubocop/config_validator.rb#251 def check_cop_config_value(hash, parent = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/config_validator.rb#77 + # source://rubocop//lib/rubocop/config_validator.rb#75 def check_obsoletions; end # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#84 + # source://rubocop//lib/rubocop/config_validator.rb#82 def check_target_ruby; end - # source://rubocop//lib/rubocop/config_validator.rb#195 + # source://rubocop//lib/rubocop/config_validator.rb#193 def each_invalid_parameter(cop_name); end - # source://rubocop//lib/rubocop/config_validator.rb#120 + # source://rubocop//lib/rubocop/config_validator.rb#118 def list_unknown_cops(invalid_cop_names); end # FIXME: Handling colors in exception messages like this is ugly. # - # source://rubocop//lib/rubocop/config_validator.rb#266 + # source://rubocop//lib/rubocop/config_validator.rb#264 def msg_not_boolean(parent, key, value); end - # source://rubocop//lib/rubocop/config_validator.rb#242 + # source://rubocop//lib/rubocop/config_validator.rb#240 def reject_conflicting_safe_settings; end # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#233 + # source://rubocop//lib/rubocop/config_validator.rb#231 def reject_mutually_exclusive_defaults; end - # source://rubocop//lib/rubocop/config_validator.rb#142 + # source://rubocop//lib/rubocop/config_validator.rb#140 def suggestion(name); end # Returns the value of attribute target_ruby. # - # source://rubocop//lib/rubocop/config_validator.rb#75 + # source://rubocop//lib/rubocop/config_validator.rb#73 def target_ruby; end - # source://rubocop//lib/rubocop/config_validator.rb#207 + # source://rubocop//lib/rubocop/config_validator.rb#205 def validate_enforced_styles(valid_cop_names); end # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#169 + # source://rubocop//lib/rubocop/config_validator.rb#167 def validate_new_cops_parameter; end - # source://rubocop//lib/rubocop/config_validator.rb#180 + # source://rubocop//lib/rubocop/config_validator.rb#178 def validate_parameter_names(valid_cop_names); end - # source://rubocop//lib/rubocop/config_validator.rb#227 + # source://rubocop//lib/rubocop/config_validator.rb#225 def validate_support_and_has_list(name, formats, valid); end # @raise [ValidationError] # - # source://rubocop//lib/rubocop/config_validator.rb#158 + # source://rubocop//lib/rubocop/config_validator.rb#156 def validate_syntax_cop; end end # @api private # -# source://rubocop//lib/rubocop/config_validator.rb#12 +# source://rubocop//lib/rubocop/config_validator.rb#10 RuboCop::ConfigValidator::COMMON_PARAMS = T.let(T.unsafe(nil), Array) -# source://rubocop//lib/rubocop/config_validator.rb#22 +# source://rubocop//lib/rubocop/config_validator.rb#20 RuboCop::ConfigValidator::CONFIG_CHECK_DEPARTMENTS = T.let(T.unsafe(nil), Array) # @api private # -# source://rubocop//lib/rubocop/config_validator.rb#21 +# source://rubocop//lib/rubocop/config_validator.rb#19 RuboCop::ConfigValidator::CONFIG_CHECK_KEYS = T.let(T.unsafe(nil), Set) # @api private # -# source://rubocop//lib/rubocop/config_validator.rb#14 +# source://rubocop//lib/rubocop/config_validator.rb#12 RuboCop::ConfigValidator::INTERNAL_PARAMS = T.let(T.unsafe(nil), Array) # @api private # -# source://rubocop//lib/rubocop/config_validator.rb#18 +# source://rubocop//lib/rubocop/config_validator.rb#16 RuboCop::ConfigValidator::NEW_COPS_VALUES = T.let(T.unsafe(nil), Array) # source://rubocop//lib/rubocop/cop/util.rb#4 @@ -3099,6 +3099,14 @@ class RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/base.rb#456 def find_severity(_range, severity); end + # This experimental feature has been under consideration for a while. + # + # @api private + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/base.rb#487 + def lsp_mode?; end + # source://rubocop//lib/rubocop/cop/base.rb#477 def range_for_original(range); end @@ -4754,7 +4762,7 @@ module RuboCop::Cop::ConfigurableFormatting # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/mixin/configurable_formatting.rb#29 + # source://rubocop//lib/rubocop/cop/mixin/configurable_formatting.rb#30 def class_emitter_method?(node, name); end # source://rubocop//lib/rubocop/cop/mixin/configurable_formatting.rb#17 @@ -4762,7 +4770,7 @@ module RuboCop::Cop::ConfigurableFormatting # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/mixin/configurable_formatting.rb#23 + # source://rubocop//lib/rubocop/cop/mixin/configurable_formatting.rb#24 def valid_name?(node, name, given_style = T.unsafe(nil)); end end @@ -10102,54 +10110,54 @@ class RuboCop::Cop::Layout::EndAlignment < ::RuboCop::Cop::Base include ::RuboCop::Cop::EndKeywordAlignment extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#105 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#109 def on_case(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#105 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#109 def on_case_match(node); end # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#81 def on_class(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#93 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#97 def on_if(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#89 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#93 def on_module(node); end # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#85 def on_sclass(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#101 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#105 def on_until(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#97 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#101 def on_while(node); end private - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#161 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#165 def alignment_node(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#178 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#182 def alignment_node_for_variable_style(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#142 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#146 def asgn_variable_align_with(outer_node, inner_node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#196 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#200 def assignment_or_operator_method(node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#116 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#120 def autocorrect(corrector, node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#131 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#135 def check_asgn_alignment(outer_node, inner_node); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#120 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#124 def check_assignment(node, rhs); end - # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#152 + # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#156 def check_other_alignment(node); end end @@ -10538,7 +10546,10 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin # Checks the indentation of the first element in an array literal # where the opening bracket and the first element are on separate lines. -# The other elements' indentations are handled by the ArrayAlignment cop. +# The other elements' indentations are handled by `Layout/ArrayAlignment` cop. +# +# This cop will respect `Layout/ArrayAlignment` and will not work when +# `EnforcedStyle: with_fixed_indentation` is specified for `Layout/ArrayAlignment`. # # By default, array literals that are arguments in a method call with # parentheses, and where the opening square bracket of the array is on the @@ -10611,49 +10622,57 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin # :completely_different # ] # -# source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#82 +# source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#85 class RuboCop::Cop::Layout::FirstArrayElementIndentation < ::RuboCop::Cop::Base include ::RuboCop::Cop::Alignment include ::RuboCop::Cop::ConfigurableEnforcedStyle include ::RuboCop::Cop::MultilineElementIndentation extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#91 + # 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#95 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#98 def on_csend(node); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#95 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#98 def on_send(node); end private - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#104 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#189 + def array_alignment_config; end + + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#109 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#142 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#147 def base_description(indent_base_type); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#108 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#113 def brace_alignment_style; end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#112 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#117 def check(array_node, left_parenthesis); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#126 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#131 def check_right_bracket(right_bracket, first_elem, left_bracket, left_parenthesis); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#155 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#183 + def enforce_first_argument_with_fixed_indentation?; end + + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#160 def message(base_description); end - # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#163 + # source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#168 def message_for_right_bracket(indent_base_type); end end -# source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#88 +# source://rubocop//lib/rubocop/cop/layout/first_array_element_indentation.rb#91 RuboCop::Cop::Layout::FirstArrayElementIndentation::MSG = T.let(T.unsafe(nil), String) # Checks for a line break before the first element in a @@ -14094,17 +14113,17 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#121 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#125 def comment_within?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#91 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#95 def configured_to_not_be_inspected?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#115 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#119 def convertible_block?(node); end # @return [Boolean] @@ -14112,7 +14131,12 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#69 def end_with_percent_blank_string?(processed_source); end - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#143 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#91 + def index_access_call_chained?(node); end + + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#147 def max_line_length; end # @return [Boolean] @@ -14122,7 +14146,7 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#98 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#102 def other_cop_takes_precedence?(node); end # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#79 @@ -14130,20 +14154,20 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#104 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#108 def single_line_block_chain_enabled?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#108 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#112 def suitable_as_single_line?(node); end - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#134 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#138 def to_single_line(source); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#129 + # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#133 def too_long?(node); end end @@ -16865,7 +16889,7 @@ class RuboCop::Cop::Lint::AssignmentInCondition < ::RuboCop::Cop::Base include ::RuboCop::Cop::SafeAssignment extend ::RuboCop::Cop::AutoCorrector - # source://standard/1.33.0/lib/standard/rubocop/ext.rb#4 + # source://standard/1.34.0/lib/standard/rubocop/ext.rb#4 def message(_); end # source://rubocop//lib/rubocop/cop/lint/assignment_in_condition.rb#55 @@ -19998,14 +20022,14 @@ class RuboCop::Cop::Lint::LiteralAssignmentInCondition < ::RuboCop::Cop::Base # @return [Boolean] # # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#62 - def forbidden_literal?(node); end + def all_literals?(node); end - # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#72 + # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#79 def offense_range(asgn_node, rhs); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#68 + # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#75 def parallel_assignment_with_splat_operator?(node); end # @yield [node] @@ -23225,7 +23249,7 @@ class RuboCop::Cop::Lint::ShadowedArgument < ::RuboCop::Cop::Base # Get argument references without assignments' references # - # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#160 + # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#161 def argument_references(argument); end # Find the first argument assignment, which doesn't reference the @@ -23241,17 +23265,17 @@ class RuboCop::Cop::Lint::ShadowedArgument < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#170 + # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#171 def ignore_implicit_references?; end # Check whether the given node is nested into block or conditional. # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#151 + # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#152 def node_within_block_or_conditional?(node, stop_search_node); end - # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#143 + # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#144 def reference_pos(node); end # source://rubocop//lib/rubocop/cop/lint/shadowed_argument.rb#95 @@ -23722,13 +23746,13 @@ class RuboCop::Cop::Lint::Syntax < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/lint/syntax.rb#19 def add_offense_from_diagnostic(diagnostic, ruby_version); end - # source://rubocop//lib/rubocop/cop/lint/syntax.rb#26 + # source://rubocop//lib/rubocop/cop/lint/syntax.rb#29 def add_offense_from_error(error); end - # source://rubocop//lib/rubocop/cop/lint/syntax.rb#31 + # source://rubocop//lib/rubocop/cop/lint/syntax.rb#34 def beautify_message(message); end - # source://rubocop//lib/rubocop/cop/lint/syntax.rb#37 + # source://rubocop//lib/rubocop/cop/lint/syntax.rb#40 def find_severity(_range, _severity); end end @@ -27426,43 +27450,43 @@ 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#54 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#55 def on_def(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#54 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#55 def on_defs(node); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#87 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#95 def anonymous_block_argument?(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#119 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#127 def block_forwarding_name; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#73 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#81 def expected_block_forwarding_style?(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#99 def explicit_block_argument?(node); end - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#95 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#103 def register_offense(block_argument, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#111 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#119 def use_block_argument_as_local_variable?(node, last_argument); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#83 + # source://rubocop//lib/rubocop/cop/naming/block_forwarding.rb#91 def use_kwarg_in_method_definition?(node); end class << self @@ -30085,6 +30109,7 @@ RuboCop::Cop::Security::MarshalLoad::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Arr # # bad # open(something) # open("| #{something}") +# open("| foo") # URI.open(something) # # # good @@ -30094,7 +30119,6 @@ RuboCop::Cop::Security::MarshalLoad::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Arr # # # good (literal strings) # open("foo.text") -# open("| foo") # URI.open("http://example.com") # # source://rubocop//lib/rubocop/cop/security/open.rb#37 @@ -30921,7 +30945,7 @@ RuboCop::Cop::Style::AndOr::MSG = T.let(T.unsafe(nil), String) # Names not on this list are likely to be meaningful and are allowed by default. # # @example RedundantBlockArgumentNames: ['blk', 'block', 'proc'] (default) -# # bad +# # bad - But it is good with `EnforcedStyle: explicit` set for `Naming/BlockForwarding`. # def foo(&block) # bar(&block) # end @@ -31010,70 +31034,83 @@ class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector extend ::RuboCop::Cop::TargetRubyVersion - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#134 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#135 def on_def(node); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#134 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#135 def on_defs(node); end private - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#174 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#176 def add_forward_all_offenses(node, send_classifications, forwardable_args); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#295 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#329 def add_parens_if_missing(node, corrector); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#183 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#199 def add_post_ruby_32_offenses(def_node, send_classifications, forwardable_args); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#287 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#321 def allow_only_rest_arguments?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#279 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#313 def arguments_range(node, first_node); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#226 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#242 def classification_and_forwards(def_node, send_node, referenced_lvars, forwardable_args); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#211 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#227 def classify_send_nodes(def_node, send_nodes, referenced_lvars, forwardable_args); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#158 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#473 + def explicit_block_name?; end + + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#159 def extract_forwardable_args(args); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#201 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#217 def non_splat_or_block_pass_lvar_references(body); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#170 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#171 def only_forwards_all?(send_classifications); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#162 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#271 + def outside_block?(node); end + + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#163 def redundant_forwardable_named_args(restarg, kwrestarg, blockarg); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#243 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#261 def redundant_named_arg(arg, config_name, keyword); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#269 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#303 def register_forward_all_offense(def_or_send, send_or_arguments, rest_or_splat); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#253 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#277 def register_forward_args_offense(def_arguments_or_send, rest_arg_or_splat); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#261 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#293 + def register_forward_block_arg_offense(add_parens, def_arguments_or_send, block_arg); end + + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#285 def register_forward_kwargs_offense(add_parens, def_arguments_or_send, kwrest_arg_or_splat); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#291 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#325 def use_anonymous_forwarding?; end class << self - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#130 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#131 def autocorrect_incompatible_with; end end end @@ -31084,6 +31121,9 @@ RuboCop::Cop::Style::ArgumentsForwarding::ADDITIONAL_ARG_TYPES = T.let(T.unsafe( # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#127 RuboCop::Cop::Style::ArgumentsForwarding::ARGS_MSG = T.let(T.unsafe(nil), String) +# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#129 +RuboCop::Cop::Style::ArgumentsForwarding::BLOCK_MSG = T.let(T.unsafe(nil), String) + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#123 RuboCop::Cop::Style::ArgumentsForwarding::FORWARDING_LVAR_TYPES = T.let(T.unsafe(nil), Array) @@ -31095,110 +31135,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#302 +# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#336 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#314 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#348 def initialize(def_node, send_node, referenced_lvars, forwardable_args, **config); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#342 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#376 def classification; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#309 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#343 def extract_forwarded_kwrest_arg(param0 = T.unsafe(nil), param1); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#336 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#370 def forwarded_block_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#312 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#346 def forwarded_block_arg?(param0 = T.unsafe(nil), param1); end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#330 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#364 def forwarded_kwrest_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#324 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#358 def forwarded_rest_arg; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#306 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#340 def forwarded_rest_arg?(param0 = T.unsafe(nil), param1); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#410 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#444 def additional_kwargs?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#406 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#440 def additional_kwargs_or_forwarded_kwargs?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#420 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#454 def allow_offense_for_no_block?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#391 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#425 def any_arg_referenced?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#375 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#409 def arguments; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#354 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#388 def can_forward_all?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#414 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#448 def forward_additional_kwargs?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#371 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#405 def forwarded_rest_and_kwrest_args; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#424 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#467 + def missing_rest_arg_or_kwrest_arg?; end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#458 def no_additional_args?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#399 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#433 def no_post_splat_args?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#367 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#401 def offensive_block_forwarding?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#387 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#421 def referenced_block_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#383 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#417 def referenced_kwrest_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#379 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#413 def referenced_rest_arg?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#363 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#397 def ruby_32_missing_rest_or_kwest?; end - # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#395 + # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#429 def target_ruby_version; end end @@ -32800,6 +32845,8 @@ RuboCop::Cop::Style::ClassVars::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # array.reject { |e| e.nil? } # array.delete_if { |e| e.nil? } # array.select { |e| !e.nil? } +# array.grep_v(nil) +# array.grep_v(NilClass) # # # good # array.compact @@ -32815,52 +32862,55 @@ RuboCop::Cop::Style::ClassVars::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # # good # params.reject(&:nil?) # -# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#42 +# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#44 class RuboCop::Cop::Style::CollectionCompact < ::RuboCop::Cop::Base include ::RuboCop::Cop::AllowedReceivers include ::RuboCop::Cop::RangeHelp extend ::RuboCop::Cop::AutoCorrector extend ::RuboCop::Cop::TargetRubyVersion - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#82 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#85 + def grep_v_with_nil?(param0 = T.unsafe(nil)); end + + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#89 def on_csend(node); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#82 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#89 def on_send(node); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#62 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#64 def reject_method?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#55 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#57 def reject_method_with_block_pass?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#72 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#74 def select_method?(param0 = T.unsafe(nil)); end private - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#120 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#129 def good_method_name(node); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#98 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#106 def offense_range(node); end - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#128 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#137 def range(begin_pos_node, end_pos_node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#114 + # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#123 def to_enum_method?(node); end end -# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#48 +# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#50 RuboCop::Cop::Style::CollectionCompact::MSG = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#49 +# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#51 RuboCop::Cop::Style::CollectionCompact::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) -# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#50 +# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#52 RuboCop::Cop::Style::CollectionCompact::TO_ENUM_METHODS = T.let(T.unsafe(nil), Array) # Enforces the use of consistent method names @@ -34847,7 +34897,7 @@ class RuboCop::Cop::Style::EachForSimpleLoop < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/each_for_simple_loop.rb#48 + # source://rubocop//lib/rubocop/cop/style/each_for_simple_loop.rb#46 def offending?(node); end end @@ -35713,40 +35763,40 @@ class RuboCop::Cop::Style::EvalWithLocation < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#195 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#184 def add_offense_for_different_line(node, line_node, line_diff); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#142 + # 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#210 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#199 def add_offense_for_missing_line(node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#217 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#206 def add_offense_for_missing_location(node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#189 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#178 def add_offense_for_same_line(node, line_node); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#154 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#143 def check_file(node, file_node); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#167 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#156 def check_line(node, code); end # 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#202 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#191 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#177 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#166 def line_difference(line_node, code); end - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#229 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#218 def missing_line(node, code); end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#109 @@ -35762,20 +35812,13 @@ 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#181 + # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#170 def string_first_line(str_node); end # @return [Boolean] # # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#127 def with_binding?(node); end - - # FIXME: It's a Style/ConditionalAssignment's false positive. - # - # @return [Boolean] - # - # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#133 - def with_lineno?(node); end end # source://rubocop//lib/rubocop/cop/style/eval_with_location.rb#59 @@ -37458,19 +37501,22 @@ class RuboCop::Cop::Style::HashEachMethods < ::RuboCop::Cop::Base include ::RuboCop::Cop::Lint::UnusedArgument extend ::RuboCop::Cop::AutoCorrector - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#50 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#74 + def check_unused_block_args(node, key, value); end + + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#51 def each_arguments(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#45 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#46 def kv_each(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#55 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#56 def kv_each_with_block_pass(param0 = T.unsafe(nil)); end # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#60 def on_block(node); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#85 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#95 def on_block_pass(node); end # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#60 @@ -37478,55 +37524,63 @@ class RuboCop::Cop::Style::HashEachMethods < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#159 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#180 def check_argument(variable); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#183 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#204 def correct_args(node, corrector); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#169 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#190 def correct_implicit(node, corrector, method_name); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#174 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#195 def correct_key_value_each(node, corrector); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#155 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#176 def format_message(method_name, current); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#93 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#103 def handleable?(node); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#190 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#211 def kv_range(outer_node); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#122 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#133 def message(prefer, method_name, unused_code); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#128 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#139 def register_each_args_offense(node, message, prefer, unused_range); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#99 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#110 def register_kv_offense(target, method); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#135 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#146 def register_kv_with_block_pass_offense(node, target, method); end - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#146 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#167 def root_receiver(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#110 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#121 def unused_block_arg_exist?(node, block_arg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#165 + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#157 + def use_array_converter_method_as_preceding?(node); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#186 def used?(arg); end end +# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#43 +RuboCop::Cop::Style::HashEachMethods::ARRAY_CONVERTER_METHODS = T.let(T.unsafe(nil), Array) + # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#41 RuboCop::Cop::Style::HashEachMethods::MSG = T.let(T.unsafe(nil), String) @@ -38047,43 +38101,43 @@ class RuboCop::Cop::Style::IdenticalConditionalBranches < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#181 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#184 def assignable_condition_value(node); end # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#140 def check_branches(node, branches); end - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#190 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#193 def check_expressions(node, expressions, insert_position); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#170 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#173 def duplicated_expressions?(node, expressions); end # `elsif` branches show up in the if node as nested `else` branches. We # need to recursively iterate over all `else` branches. # - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#230 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#233 def expand_elses(branch); end - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#245 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#248 def head(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#214 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#217 def last_child_of_parent?(node); end - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#224 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#227 def message(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#220 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#223 def single_child_branch?(branch_node); end - # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#241 + # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#244 def tail(node); end end @@ -38915,24 +38969,33 @@ class RuboCop::Cop::Style::InvertibleUnlessCondition < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#91 + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#128 def autocorrect(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#104 + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#141 def autocorrect_send_node(corrector, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#85 + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#88 def inheritance_check?(node); end - # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#112 + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#149 def inverse_methods; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#70 + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#73 def invertible?(node); end + + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#94 + def preferred_condition(node); end + + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#121 + def preferred_logical_condition(node); end + + # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#102 + def preferred_send_condition(node); end end # source://rubocop//lib/rubocop/cop/style/invertible_unless_condition.rb#54 @@ -39593,7 +39656,7 @@ class RuboCop::Cop::Style::MapToHash < ::RuboCop::Cop::Base extend ::RuboCop::Cop::TargetRubyVersion # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#41 - def map_to_h?(param0 = T.unsafe(nil)); end + def map_to_h(param0 = T.unsafe(nil)); end # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#52 def on_csend(node); end @@ -39603,7 +39666,7 @@ class RuboCop::Cop::Style::MapToHash < ::RuboCop::Cop::Base private - # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#67 + # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#68 def autocorrect(corrector, to_h, map); end class << self @@ -39858,23 +39921,20 @@ class RuboCop::Cop::Style::MethodCallWithArgsParentheses < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#217 def on_send(node); end - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#217 - def on_super(node); end - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#217 def on_yield(node); end private - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#226 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#225 def args_begin(node); end - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#235 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#233 def args_end(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#239 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses.rb#237 def args_parenthesized?(node); end class << self @@ -39896,12 +39956,12 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#166 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#174 def allowed_chained_call_with_parentheses?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#162 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#170 def allowed_multiline_call_with_parentheses?(node); end # @return [Boolean] @@ -39911,17 +39971,17 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#175 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#183 def ambiguous_literal?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#204 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#212 def assigned_before?(node, target); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#212 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#220 def assignment_in_condition?(node); end # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#31 @@ -39929,9 +39989,14 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#143 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#151 def call_as_argument_or_chain?(node); end + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#144 + def call_in_argument_with_block?(node); end + # @return [Boolean] # # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#100 @@ -39944,7 +40009,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#149 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#157 def call_in_match_pattern?(node); end # @return [Boolean] @@ -39964,22 +40029,22 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#139 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#140 def call_with_braced_block?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#222 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#230 def forwards_anonymous_rest_arguments?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#191 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#199 def hash_literal?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#155 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#163 def hash_literal_in_arguments?(node); end # @return [Boolean] @@ -39989,7 +40054,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#208 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#216 def inside_string_interpolation?(node); end # Require hash value omission be enclosed in parentheses to prevent the following issue: @@ -40007,7 +40072,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#187 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#195 def logical_operator?(node); end # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#40 @@ -40023,7 +40088,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#195 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#203 def regexp_slash_literal?(node); end # @return [Boolean] @@ -40033,7 +40098,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#179 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#187 def splat?(node); end # @return [Boolean] @@ -40048,12 +40113,12 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#183 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#191 def ternary_if?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#199 + # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#207 def unary_literal?(node); end end @@ -41226,12 +41291,12 @@ class RuboCop::Cop::Style::MultilineTernaryOperator < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#60 def autocorrect(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#84 + # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#82 def comments_in_condition(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#90 + # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#88 def enforce_single_line_ternary_operator?(node); end # @return [Boolean] @@ -41239,12 +41304,12 @@ class RuboCop::Cop::Style::MultilineTernaryOperator < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#56 def offense?(node); end - # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#70 + # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#68 def replacement(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#94 + # source://rubocop//lib/rubocop/cop/style/multiline_ternary_operator.rb#92 def use_assignment_method?(node); end end @@ -43376,7 +43441,7 @@ class RuboCop::Cop::Style::ParallelAssignment::AssignmentSorter def tsort_each_child(assignment); end # source://rubocop//lib/rubocop/cop/style/parallel_assignment.rb#145 - def tsort_each_node(&block); end + def tsort_each_node(*_arg0, **_arg1, &_arg2); end # source://rubocop//lib/rubocop/cop/style/parallel_assignment.rb#136 def uses_var?(param0, param1); end @@ -43548,20 +43613,20 @@ class RuboCop::Cop::Style::ParenthesesAroundCondition < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#122 + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#130 def allow_multiline_conditions?; end - # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#110 + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#118 def message(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#103 + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#111 def modifier_op?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#116 + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#124 def parens_allowed?(node); end # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#80 @@ -43569,7 +43634,12 @@ class RuboCop::Cop::Style::ParenthesesAroundCondition < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#95 + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#96 + def require_parentheses?(node, condition_body); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/parentheses_around_condition.rb#103 def semicolon_separated_expressions?(first_exp, rest_exps); end end @@ -44883,21 +44953,24 @@ RuboCop::Cop::Style::RedundantDoubleSplatHashBraces::MSG = T.let(T.unsafe(nil), class RuboCop::Cop::Style::RedundantEach < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#43 + def on_csend(node); end + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#43 def on_send(node); end private - # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#93 + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#96 def message(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#85 + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#86 def range(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#63 + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#64 def redundant_each_method(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#104 + # source://rubocop//lib/rubocop/cop/style/redundant_each.rb#107 def remove_redundant_each(corrector, range, redundant_node); end end @@ -45545,35 +45618,40 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#168 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#175 def argument_is_method?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#136 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#143 def argument_newline?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#100 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#101 def ends_with_backslash_without_comment?(source_line); end - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#148 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#155 def find_node_for_line(line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#124 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#131 def inside_string_literal?(range, token); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#108 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#109 def inside_string_literal_or_method_with_argument?(range); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#175 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#117 + def leading_dot_method_chain_with_blank_line?(range); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#182 def method_call_with_arguments?(node); end # A method call without parentheses such as the following cannot remove `\`: @@ -45583,12 +45661,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#132 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#139 def method_with_argument?(current_token, next_token); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#116 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#123 def redundant_line_continuation?(range); end # @return [Boolean] @@ -45598,17 +45676,17 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#154 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#161 def same_line?(node, line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#179 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#186 def start_with_arithmetic_operator?(source_line); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#104 + # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#105 def string_concatenation?(source_line); end end @@ -45642,16 +45720,16 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#35 def arg_in_call_with_block?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#253 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#269 def first_send_argument?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#258 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#274 def first_super_argument?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#263 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#279 def first_yield_argument?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#166 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#175 def interpolation?(param0 = T.unsafe(nil)); end # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#26 @@ -45668,6 +45746,11 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base private + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#177 + def allow_in_multiline_conditions?; end + # @return [Boolean] # # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#68 @@ -45695,39 +45778,39 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#267 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#283 def call_chain_starts_with_int?(begin_node, send_node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#129 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#136 def check(begin_node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#168 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#184 def check_send(begin_node, node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#177 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#193 def check_unary(begin_node, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#201 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#217 def disallowed_literal?(begin_node, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#107 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#114 def empty_parentheses?(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#140 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#147 def find_offense_message(begin_node, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#112 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#119 def first_arg_begins_with_hash_literal?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#242 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#258 def first_argument?(node); end # @return [Boolean] @@ -45737,12 +45820,12 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#197 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#213 def keyword_ancestor?(node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#216 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#232 def keyword_with_redundant_parentheses?(node); end # @return [Boolean] @@ -45752,18 +45835,23 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#229 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#245 def method_call_with_redundant_parentheses?(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#121 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#128 def method_chain_begins_with_hash_literal(node); end - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#187 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#107 + def multiline_control_flow_statements?(node); end + + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#203 def offense(node, msg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#238 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#254 def only_begin_arg?(args); end # @return [Boolean] @@ -45773,12 +45861,12 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#205 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#221 def raised_to_power_negative_numeric?(begin_node, node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#193 + # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#209 def suspect_unary?(node); end # @return [Boolean] @@ -48346,32 +48434,69 @@ RuboCop::Cop::Style::SingleLineMethods::MSG = T.let(T.unsafe(nil), String) # source://rubocop//lib/rubocop/cop/style/single_line_methods.rb#39 RuboCop::Cop::Style::SingleLineMethods::NOT_SUPPORTED_ENDLESS_METHOD_BODY_TYPES = T.let(T.unsafe(nil), Array) -# Checks that arrays are sliced with endless ranges instead of -# `ary[start..-1]` on Ruby 2.6+. +# Checks that arrays are not sliced with the redundant `ary[0..-1]`, replacing it with `ary`, +# and ensures arrays are sliced with endless ranges instead of `ary[start..-1]` on Ruby 2.6+, +# and with beginless ranges instead of `ary[nil..end]` on Ruby 2.7+. # # @example # # bad -# items[1..-1] +# items[0..-1] +# items[0..nil] +# items[0...nil] +# +# # good +# items +# +# # bad +# items[1..-1] # Ruby 2.6+ +# items[1..nil] # Ruby 2.6+ +# +# # good +# items[1..] # Ruby 2.6+ +# +# # bad +# items[nil..42] # Ruby 2.7+ # # # good -# items[1..] +# items[..42] # Ruby 2.7+ +# items[0..42] # Ruby 2.7+ # -# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#28 +# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#46 class RuboCop::Cop::Style::SlicingWithRange < ::RuboCop::Cop::Base extend ::RuboCop::Cop::AutoCorrector extend ::RuboCop::Cop::TargetRubyVersion - # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#40 + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#77 def on_send(node); end - # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#38 + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#73 + def range_from_zero?(param0 = T.unsafe(nil)); end + + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#57 + def range_from_zero_till_minus_one?(param0 = T.unsafe(nil)); end + + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#65 def range_till_minus_one?(param0 = T.unsafe(nil)); end + + private + + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#111 + def beginless(range_node); end + + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#107 + def endless(range_node); end + + # source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#93 + def offense_message_with_removal_range(range_node, selector); end end -# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#34 +# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#52 RuboCop::Cop::Style::SlicingWithRange::MSG = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#35 +# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#53 +RuboCop::Cop::Style::SlicingWithRange::MSG_USELESS_RANGE = T.let(T.unsafe(nil), String) + +# source://rubocop//lib/rubocop/cop/style/slicing_with_range.rb#54 RuboCop::Cop::Style::SlicingWithRange::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array) # If the branch of a conditional consists solely of a conditional node, @@ -49531,7 +49656,7 @@ RuboCop::Cop::Style::SymbolLiteral::MSG = T.let(T.unsafe(nil), String) # # good # something.map(&:upcase) # -# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#87 +# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#123 class RuboCop::Cop::Style::SymbolProc < ::RuboCop::Cop::Base include ::RuboCop::Cop::CommentsHelp include ::RuboCop::Cop::RangeHelp @@ -49541,81 +49666,81 @@ class RuboCop::Cop::Style::SymbolProc < ::RuboCop::Cop::Base # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#136 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#172 def destructuring_block_argument?(argument_node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#116 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#152 def on_block(node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#116 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#152 def on_numblock(node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#98 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#134 def proc_node?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#104 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#140 def symbol_proc?(param0 = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#101 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#137 def symbol_proc_receiver?(param0 = T.unsafe(nil)); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#204 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#240 def allow_comments?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#200 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#236 def allow_if_method_has_argument?(send_node); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#151 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#187 def allowed_method_name?(name); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#164 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#200 def autocorrect(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#176 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#212 def autocorrect_with_args(corrector, node, args, method_name); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#172 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#208 def autocorrect_without_args(corrector, node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#190 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#226 def begin_pos_for_replacement(node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#185 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#221 def block_range_with_space(node); end - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#155 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#191 def register_offense(node, method_name, block_method_name); end # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#147 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#183 def unsafe_array_usage?(node); end # See: https://github.com/rubocop/rubocop/issues/10864 # # @return [Boolean] # - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#143 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#179 def unsafe_hash_usage?(node); end class << self - # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#111 + # source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#147 def autocorrect_incompatible_with; end end end -# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#94 +# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#130 RuboCop::Cop::Style::SymbolProc::MSG = T.let(T.unsafe(nil), String) -# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#95 +# source://rubocop//lib/rubocop/cop/style/symbol_proc.rb#131 RuboCop::Cop::Style::SymbolProc::SUPER_TYPES = T.let(T.unsafe(nil), Array) # Corrector to correct conditional assignment in ternary conditions. @@ -53780,7 +53905,12 @@ module RuboCop::Ext::RegexpNode private - # source://rubocop//lib/rubocop/ext/regexp_node.rb#68 + # @return [Boolean] + # + # source://rubocop//lib/rubocop/ext/regexp_node.rb#65 + def named_capturing?(exp, event, named); end + + # source://rubocop//lib/rubocop/ext/regexp_node.rb#73 def with_interpolations_blanked; end end @@ -54219,100 +54349,108 @@ class RuboCop::Formatter::DisabledConfigFormatter < ::RuboCop::Formatter::BaseFo # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#27 def initialize(output, options = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#39 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#40 def file_finished(file, offenses); end # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#33 - def file_started(_file, _file_info); end + def file_started(_file, options); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#47 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#48 def finished(_inspected_files); end private # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#68 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#69 def auto_gen_enforced_style?; end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#72 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#73 def command; end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#156 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#161 def cop_config_params(default_cfg, cfg); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#176 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#181 def default_config(cop_name); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#220 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#225 def excludes(offending_files, cop_name, parent); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#191 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#196 def filtered_config(cfg); end + # Returns true if the given arr include the given elm or if any of the + # given arr is a regexp that matches the given elm. + # # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#241 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#273 + def include_or_match?(arr, elm); end + + # @return [Boolean] + # + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#246 def merge_mode_for_exclude?(cfg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#262 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#267 def no_exclude_limit?; end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#101 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#102 def output_cop(cop_name, offense_count); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#128 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#133 def output_cop_comments(output_buffer, cfg, cop_name, offense_count); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#180 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#185 def output_cop_config(output_buffer, cfg, cop_name); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#163 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#168 def output_cop_param_comments(output_buffer, params, default_cfg); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#210 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#215 def output_exclude_list(output_buffer, offending_files, cop_name); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#245 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#250 def output_exclude_path(output_buffer, exclude_path, parent); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#199 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#204 def output_offending_files(output_buffer, cfg, cop_name); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#95 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#96 def output_offenses; end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#258 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#263 def safe_autocorrect?(config); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#115 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#116 def set_max(cfg, cop_name); end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#64 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#65 def show_offense_counts?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#60 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#61 def show_timestamp?; end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#148 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#153 def supports_safe_autocorrect?(cop_class, default_cfg); end # @return [Boolean] # - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#152 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#157 def supports_unsafe_autocorrect?(cop_class, default_cfg); end - # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#91 + # source://rubocop//lib/rubocop/formatter/disabled_config_formatter.rb#92 def timestamp; end class << self @@ -54455,33 +54593,33 @@ RuboCop::Formatter::FuubarStyleFormatter::RESET_SEQUENCE = T.let(T.unsafe(nil), # This formatter formats report data as GitHub Workflow commands resulting # in GitHub check annotations when run within GitHub Actions. # -# source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#7 +# source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#7 class RuboCop::Formatter::GitHubActionsFormatter < ::RuboCop::Formatter::BaseFormatter - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#14 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#14 def file_finished(file, offenses); end - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#18 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#18 def finished(_inspected_files); end - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#10 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#10 def started(_target_files); end private - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#29 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#29 def github_escape(string); end - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#41 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#41 def github_severity(offense); end - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#33 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#33 def minimum_severity_to_fail; end - # source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#45 + # source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#45 def report_offense(file, offense); end end -# source://rubocop//lib/rubocop/formatter/git_hub_actions_formatter.rb#8 +# source://rubocop//lib/rubocop/formatter/github_actions_formatter.rb#8 RuboCop::Formatter::GitHubActionsFormatter::ESCAPE_MAP = T.let(T.unsafe(nil), Hash) # This formatter saves the output as an html file. @@ -54720,22 +54858,22 @@ RuboCop::Formatter::HTMLFormatter::TEMPLATE_PATH = T.let(T.unsafe(nil), String) # This formatter formats the report data in JSON format. # -# source://rubocop//lib/rubocop/formatter/json_formatter.rb#9 +# source://rubocop//lib/rubocop/formatter/json_formatter.rb#8 class RuboCop::Formatter::JSONFormatter < ::RuboCop::Formatter::BaseFormatter include ::RuboCop::PathUtil # @return [JSONFormatter] a new instance of JSONFormatter # - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#14 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#13 def initialize(output, options = T.unsafe(nil)); end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#23 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#22 def file_finished(file, offenses); end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#28 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#27 def finished(inspected_files); end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#43 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#42 def hash_for_file(file, offenses); end # TODO: Consider better solution for Offense#real_column. @@ -54743,21 +54881,21 @@ class RuboCop::Formatter::JSONFormatter < ::RuboCop::Formatter::BaseFormatter # So, the minimum value of `last_column` should be 1. # And non-zero value of `last_column` should be used as is. # - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#65 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#64 def hash_for_location(offense); end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#50 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#49 def hash_for_offense(offense); end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#33 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#32 def metadata_hash; end # Returns the value of attribute output_hash. # - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#12 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#11 def output_hash; end - # source://rubocop//lib/rubocop/formatter/json_formatter.rb#19 + # source://rubocop//lib/rubocop/formatter/json_formatter.rb#18 def started(target_files); end end @@ -55894,22 +56032,22 @@ RuboCop::Options::E_STDIN_NO_PATH = T.let(T.unsafe(nil), String) # # @api private # -# source://rubocop//lib/rubocop/options.rb#497 +# source://rubocop//lib/rubocop/options.rb#489 module RuboCop::OptionsHelp; end # @api private # -# source://rubocop//lib/rubocop/options.rb#499 +# source://rubocop//lib/rubocop/options.rb#491 RuboCop::OptionsHelp::FORMATTER_OPTION_LIST = T.let(T.unsafe(nil), Array) # @api private # -# source://rubocop//lib/rubocop/options.rb#498 +# source://rubocop//lib/rubocop/options.rb#490 RuboCop::OptionsHelp::MAX_EXCL = T.let(T.unsafe(nil), String) # @api private # -# source://rubocop//lib/rubocop/options.rb#501 +# source://rubocop//lib/rubocop/options.rb#493 RuboCop::OptionsHelp::TEXT = T.let(T.unsafe(nil), Hash) # Validates option arguments and the options' compatibility with each other. @@ -55927,57 +56065,51 @@ class RuboCop::OptionsValidator # @api private # @return [Boolean] # - # source://rubocop//lib/rubocop/options.rb#471 + # source://rubocop//lib/rubocop/options.rb#463 def boolean_or_empty_cache?; end # @api private # - # source://rubocop//lib/rubocop/options.rb#437 + # source://rubocop//lib/rubocop/options.rb#433 def disable_parallel_when_invalid_option_combo; end # @api private # @return [Boolean] # - # source://rubocop//lib/rubocop/options.rb#463 - def display_only_fail_level_offenses_with_autocorrect?; end - - # @api private - # @return [Boolean] - # - # source://rubocop//lib/rubocop/options.rb#467 + # source://rubocop//lib/rubocop/options.rb#459 def except_syntax?; end # @api private # - # source://rubocop//lib/rubocop/options.rb#475 + # source://rubocop//lib/rubocop/options.rb#467 def incompatible_options; end # @api private # - # source://rubocop//lib/rubocop/options.rb#450 + # source://rubocop//lib/rubocop/options.rb#446 def invalid_arguments_for_parallel; end # @api private # @return [Boolean] # - # source://rubocop//lib/rubocop/options.rb#458 + # source://rubocop//lib/rubocop/options.rb#454 def only_includes_redundant_disable?; end # @api private # - # source://rubocop//lib/rubocop/options.rb#384 + # source://rubocop//lib/rubocop/options.rb#380 def validate_auto_gen_config; end # @api private # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/options.rb#423 + # source://rubocop//lib/rubocop/options.rb#419 def validate_autocorrect; end # @api private # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/options.rb#487 + # source://rubocop//lib/rubocop/options.rb#479 def validate_cache_enabled_for_cache_root; end # @api private @@ -55994,25 +56126,25 @@ class RuboCop::OptionsValidator # @api private # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/options.rb#405 + # source://rubocop//lib/rubocop/options.rb#401 def validate_display_only_correctable_and_autocorrect; end # @api private # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/options.rb#397 + # source://rubocop//lib/rubocop/options.rb#393 def validate_display_only_failed; end # @api private # @raise [OptionArgumentError] # - # source://rubocop//lib/rubocop/options.rb#414 + # source://rubocop//lib/rubocop/options.rb#410 def validate_display_only_failed_and_display_only_correctable; end # @api private # @raise [OptionParser::MissingArgument] # - # source://rubocop//lib/rubocop/options.rb#479 + # source://rubocop//lib/rubocop/options.rb#471 def validate_exclude_limit_option; end class << self diff --git a/sorbet/rbi/gems/standard@1.33.0.rbi b/sorbet/rbi/gems/standard@1.34.0.rbi similarity index 88% rename from sorbet/rbi/gems/standard@1.33.0.rbi rename to sorbet/rbi/gems/standard@1.34.0.rbi index ad076de..2c252ed 100644 --- a/sorbet/rbi/gems/standard@1.33.0.rbi +++ b/sorbet/rbi/gems/standard@1.34.0.rbi @@ -14,25 +14,25 @@ class RuboCop::CommentConfig # source://standard//lib/standard/rubocop/ext.rb#20 def initialize(processed_source); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#63 + # source://rubocop/1.60.2/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.59.0/lib/rubocop/comment_config.rb#51 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#51 def cop_disabled_line_ranges; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#39 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#39 def cop_enabled_at_line?(cop, line_number); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#47 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#47 def cop_opted_in?(cop); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#55 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#55 def extra_enabled_comments; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#30 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#30 def processed_source; end # source://forwardable/1.3.3/forwardable.rb#231 @@ -40,49 +40,49 @@ class RuboCop::CommentConfig private - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#96 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#96 def analyze; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#124 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#124 def analyze_cop(analysis, directive); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#144 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#144 def analyze_disabled(analysis, directive); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#155 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#155 def analyze_rest(analysis, directive); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#135 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#135 def analyze_single_line(analysis, directive); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#164 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#164 def cop_line_ranges(analysis); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#170 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#170 def each_directive; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#69 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#69 def extra_enabled_comments_with_names(extras:, names:); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#190 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#190 def handle_enable_all(directive, names, extras); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#204 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#204 def handle_switch(directive, names, extras); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#115 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#115 def inject_disabled_cops_directives(analyses); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#183 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#183 def non_comment_token_line_numbers; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#34 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#34 def old_initialize(processed_source); end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#83 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#83 def opt_in_cops; end - # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#179 + # source://rubocop/1.60.2/lib/rubocop/comment_config.rb#179 def qualified_cop_name(cop_name); end end @@ -94,114 +94,114 @@ class RuboCop::Cop::Lint::AssignmentInCondition < ::RuboCop::Cop::Base # source://standard//lib/standard/rubocop/ext.rb#4 def message(_); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_if(node); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_until(node); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#55 def on_while(node); end private - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#82 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#82 def allowed_construct?(asgn_node); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#86 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#86 def conditional_assignment?(asgn_node); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#90 + # source://rubocop/1.60.2/lib/rubocop/cop/lint/assignment_in_condition.rb#90 def skip_children?(asgn_node); end - # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#96 + # source://rubocop/1.60.2/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.59.0/lib/rubocop/directive_comment.rb#30 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#30 def initialize(comment, cop_registry = T.unsafe(nil)); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#80 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#80 def all_cops?; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#28 def comment; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#85 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#85 def cop_names; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#28 def cop_registry; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#28 def cops; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#91 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#91 def department_names; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#105 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#105 def directive_count; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#60 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#60 def disabled?; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#75 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#75 def disabled_all?; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#65 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#65 def enabled?; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#70 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#70 def enabled_all?; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#96 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#96 def in_directive_department?(cop); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#110 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#110 def line_number; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#42 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#42 def match?(cop_names); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#55 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#55 def match_captures; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#28 def mode; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#101 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#101 def overridden_by_department?(cop); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#46 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#46 def range; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#37 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#37 def single_line?; end private - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#130 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#130 def all_cop_names; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#134 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#134 def cop_names_for_department(department); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#126 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#126 def department?(name); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#140 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#140 def exclude_redundant_directive_cop(cops); end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#120 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#120 def parsed_cop_names; end - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#116 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#116 def splitted_cops_string; end class << self - # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#24 + # source://rubocop/1.60.2/lib/rubocop/directive_comment.rb#24 def before_comment(line); end end end