diff --git a/.github/workflows/main.yml b/.github/workflows/main.yml
index 06ac32d..c983670 100644
--- a/.github/workflows/main.yml
+++ b/.github/workflows/main.yml
@@ -12,7 +12,7 @@ jobs:
- name: Set up Ruby
uses: ruby/setup-ruby@v1
with:
- ruby-version: 3.2
+ ruby-version: 3.3
bundler-cache: true
- run: bin/tapioca gem --verify
build:
@@ -25,6 +25,7 @@ jobs:
- '3.0'
- '3.1'
- '3.2'
+ - '3.3'
steps:
- uses: actions/checkout@v3
- name: Set up Ruby
diff --git a/.github/workflows/release_gem.yml b/.github/workflows/release_gem.yml
index 7ca1348..63a55d4 100644
--- a/.github/workflows/release_gem.yml
+++ b/.github/workflows/release_gem.yml
@@ -20,7 +20,7 @@ jobs:
- name: Set up Ruby
uses: ruby/setup-ruby@v1
with:
- ruby-version: 3.2
+ ruby-version: 3.3
- name: Setup
run: |
git config user.email "maxveldink@gmail.com"
diff --git a/.rubocop.yml b/.rubocop.yml
deleted file mode 100644
index 74417e8..0000000
--- a/.rubocop.yml
+++ /dev/null
@@ -1,33 +0,0 @@
-inherit_mode:
- merge:
- - Exclude
-
-require:
- - rubocop-minitest
- - rubocop-rake
- - rubocop-sorbet
-
-AllCops:
- NewCops: enable
- TargetRubyVersion: 3.0
- Exclude:
- - sorbet/**/*.rbi
-
-Style/AccessorGrouping:
- Enabled: false
-
-Style/StringLiterals:
- Enabled: true
- EnforcedStyle: double_quotes
-
-Style/StringLiteralsInInterpolation:
- Enabled: true
- EnforcedStyle: double_quotes
-
-Layout/LineLength:
- Max: 120
-
-Lint/UselessMethodDefinition:
- Exclude:
- - lib/typed/failure.rb
- - lib/typed/success.rb
diff --git a/.ruby-version b/.ruby-version
index be94e6f..15a2799 100644
--- a/.ruby-version
+++ b/.ruby-version
@@ -1 +1 @@
-3.2.2
+3.3.0
diff --git a/.tool-versions b/.tool-versions
index f2a971a..3294aed 100644
--- a/.tool-versions
+++ b/.tool-versions
@@ -1 +1 @@
-ruby 3.2.2
+ruby 3.3.0
diff --git a/Gemfile.lock b/Gemfile.lock
index 234caca..0ecba65 100644
--- a/Gemfile.lock
+++ b/Gemfile.lock
@@ -9,110 +9,109 @@ GEM
remote: https://rubygems.org/
specs:
ast (2.4.2)
- base64 (0.1.1)
- debug (1.8.0)
- irb (>= 1.5.0)
- reline (>= 0.3.1)
- diff-lcs (1.5.0)
+ debug (1.9.1)
+ irb (~> 1.10)
+ reline (>= 0.3.8)
erubi (1.12.0)
- io-console (0.6.0)
- irb (1.7.1)
- reline (>= 0.3.0)
- json (2.6.3)
+ io-console (0.7.2)
+ irb (1.11.1)
+ rdoc
+ reline (>= 0.4.2)
+ json (2.7.1)
language_server-protocol (3.17.0.3)
lint_roller (1.1.0)
- minitest (5.18.1)
+ minitest (5.21.2)
netrc (0.11.0)
- parallel (1.23.0)
- parser (3.2.2.4)
+ parallel (1.24.0)
+ parser (3.3.0.4)
ast (~> 2.4.1)
racc
prettier_print (1.2.1)
- racc (1.7.1)
+ prism (0.19.0)
+ psych (5.1.2)
+ stringio
+ racc (1.7.3)
rainbow (3.1.1)
- rake (13.0.6)
- rbi (0.0.16)
- ast
- parser (>= 2.6.4.0)
+ rake (13.1.0)
+ rbi (0.1.6)
+ prism (>= 0.18.0, < 0.20)
sorbet-runtime (>= 0.5.9204)
- unparser
- regexp_parser (2.8.2)
- reline (0.3.5)
+ rdoc (6.6.2)
+ psych (>= 4.0.0)
+ regexp_parser (2.9.0)
+ reline (0.4.2)
io-console (~> 0.5)
rexml (3.2.6)
- rubocop (1.56.4)
- base64 (~> 0.1.1)
+ rubocop (1.59.0)
json (~> 2.3)
language_server-protocol (>= 3.17.0)
parallel (~> 1.10)
- parser (>= 3.2.2.3)
+ parser (>= 3.2.2.4)
rainbow (>= 2.2.2, < 4.0)
regexp_parser (>= 1.8, < 3.0)
rexml (>= 3.2.5, < 4.0)
- rubocop-ast (>= 1.28.1, < 2.0)
+ rubocop-ast (>= 1.30.0, < 2.0)
ruby-progressbar (~> 1.7)
unicode-display_width (>= 2.4.0, < 3.0)
- rubocop-ast (1.29.0)
+ rubocop-ast (1.30.0)
parser (>= 3.2.1.0)
- rubocop-performance (1.19.1)
- rubocop (>= 1.7.0, < 2.0)
- rubocop-ast (>= 0.4.0)
- rubocop-sorbet (0.7.4)
+ rubocop-performance (1.20.2)
+ rubocop (>= 1.48.1, < 2.0)
+ rubocop-ast (>= 1.30.0, < 2.0)
+ rubocop-sorbet (0.7.6)
rubocop (>= 0.90.0)
ruby-progressbar (1.13.0)
- sorbet (0.5.10900)
- sorbet-static (= 0.5.10900)
- sorbet-runtime (0.5.10900)
- sorbet-static (0.5.10900-universal-darwin-22)
- sorbet-static (0.5.10900-x86_64-linux)
- sorbet-static-and-runtime (0.5.10900)
- sorbet (= 0.5.10900)
- sorbet-runtime (= 0.5.10900)
- spoom (1.2.2)
+ sorbet (0.5.11212)
+ sorbet-static (= 0.5.11212)
+ sorbet-runtime (0.5.11212)
+ sorbet-static (0.5.11212-universal-darwin)
+ sorbet-static (0.5.11212-x86_64-linux)
+ sorbet-static-and-runtime (0.5.11212)
+ sorbet (= 0.5.11212)
+ sorbet-runtime (= 0.5.11212)
+ spoom (1.2.4)
erubi (>= 1.10.0)
- sorbet (>= 0.5.10187)
- sorbet-runtime (>= 0.5.9204)
+ sorbet-static-and-runtime (>= 0.5.10187)
syntax_tree (>= 6.1.1)
thor (>= 0.19.2)
- standard (1.31.2)
+ standard (1.33.0)
language_server-protocol (~> 3.17.0.2)
lint_roller (~> 1.0)
- rubocop (~> 1.56.4)
+ rubocop (~> 1.59.0)
standard-custom (~> 1.0.0)
- standard-performance (~> 1.2)
+ standard-performance (~> 1.3)
standard-custom (1.0.2)
lint_roller (~> 1.0)
rubocop (~> 1.50)
- standard-performance (1.2.1)
+ standard-performance (1.3.1)
lint_roller (~> 1.1)
- rubocop-performance (~> 1.19.1)
+ rubocop-performance (~> 1.20.2)
standard-sorbet (0.0.2)
lint_roller (~> 1.1)
rubocop-sorbet (~> 0.7.0)
- syntax_tree (6.1.1)
+ stringio (3.1.0)
+ syntax_tree (6.2.0)
prettier_print (>= 1.2.0)
- tapioca (0.11.7)
+ tapioca (0.11.17)
bundler (>= 2.2.25)
netrc (>= 0.11.0)
parallel (>= 1.21.0)
- rbi (~> 0.0.0, >= 0.0.16)
- sorbet-static-and-runtime (>= 0.5.10187)
+ rbi (>= 0.1.4, < 0.2)
+ sorbet-static-and-runtime (>= 0.5.10820)
spoom (~> 1.2.0, >= 1.2.0)
thor (>= 1.2.0)
yard-sorbet
- thor (1.2.2)
+ thor (1.3.0)
unicode-display_width (2.5.0)
- unparser (0.6.8)
- diff-lcs (~> 1.3)
- parser (>= 3.2.0)
yard (0.9.34)
yard-sorbet (0.8.1)
sorbet-runtime (>= 0.5)
yard (>= 0.9)
- zeitwerk (2.6.8)
+ zeitwerk (2.6.12)
PLATFORMS
arm64-darwin-22
+ arm64-darwin-23
x86_64-linux
DEPENDENCIES
diff --git a/sorbet/rbi/gems/.gitattributes b/sorbet/rbi/gems/.gitattributes
new file mode 100644
index 0000000..d9bb82a
--- /dev/null
+++ b/sorbet/rbi/gems/.gitattributes
@@ -0,0 +1 @@
+**/*.rbi linguist-generated=true
diff --git a/sorbet/rbi/gems/base64@0.1.1.rbi b/sorbet/rbi/gems/base64@0.1.1.rbi
deleted file mode 100644
index 58bcecc..0000000
--- a/sorbet/rbi/gems/base64@0.1.1.rbi
+++ /dev/null
@@ -1,172 +0,0 @@
-# typed: true
-
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `base64` gem.
-# Please instead update this file by running `bin/tapioca gem base64`.
-
-# The Base64 module provides for the encoding (#encode64, #strict_encode64,
-# #urlsafe_encode64) and decoding (#decode64, #strict_decode64,
-# #urlsafe_decode64) of binary data using a Base64 representation.
-#
-# == Example
-#
-# A simple encoding and decoding.
-#
-# require "base64"
-#
-# enc = Base64.encode64('Send reinforcements')
-# # -> "U2VuZCByZWluZm9yY2VtZW50cw==\n"
-# plain = Base64.decode64(enc)
-# # -> "Send reinforcements"
-#
-# The purpose of using base64 to encode data is that it translates any
-# binary data into purely printable characters.
-module Base64
- private
-
- # Returns the Base64-decoded version of +str+.
- # This method complies with RFC 2045.
- # Characters outside the base alphabet are ignored.
- #
- # require 'base64'
- # str = 'VGhpcyBpcyBsaW5lIG9uZQpUaGlzIG' +
- # 'lzIGxpbmUgdHdvClRoaXMgaXMgbGlu' +
- # 'ZSB0aHJlZQpBbmQgc28gb24uLi4K'
- # puts Base64.decode64(str)
- #
- # Generates:
- #
- # This is line one
- # This is line two
- # This is line three
- # And so on...
- #
- # source://base64//base64.rb#58
- def decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with RFC 2045.
- # Line feeds are added to every 60 encoded characters.
- #
- # require 'base64'
- # Base64.encode64("Now is the time for all good coders\nto learn Ruby")
- #
- # Generates:
- #
- # Tm93IGlzIHRoZSB0aW1lIGZvciBhbGwgZ29vZCBjb2RlcnMKdG8gbGVhcm4g
- # UnVieQ==
- #
- # source://base64//base64.rb#38
- def encode64(bin); end
-
- # Returns the Base64-decoded version of +str+.
- # This method complies with RFC 4648.
- # ArgumentError is raised if +str+ is incorrectly padded or contains
- # non-alphabet characters. Note that CR or LF are also rejected.
- #
- # source://base64//base64.rb#73
- def strict_decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with RFC 4648.
- # No line feeds are added.
- #
- # source://base64//base64.rb#65
- def strict_encode64(bin); end
-
- # Returns the Base64-decoded version of +str+.
- # This method complies with ``Base 64 Encoding with URL and Filename Safe
- # Alphabet'' in RFC 4648.
- # The alphabet uses '-' instead of '+' and '_' instead of '/'.
- #
- # The padding character is optional.
- # This method accepts both correctly-padded and unpadded input.
- # Note that it still rejects incorrectly-padded input.
- #
- # source://base64//base64.rb#98
- def urlsafe_decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with ``Base 64 Encoding with URL and Filename Safe
- # Alphabet'' in RFC 4648.
- # The alphabet uses '-' instead of '+' and '_' instead of '/'.
- # Note that the result can still contain '='.
- # You can remove the padding by setting +padding+ as false.
- #
- # source://base64//base64.rb#83
- def urlsafe_encode64(bin, padding: T.unsafe(nil)); end
-
- class << self
- # Returns the Base64-decoded version of +str+.
- # This method complies with RFC 2045.
- # Characters outside the base alphabet are ignored.
- #
- # require 'base64'
- # str = 'VGhpcyBpcyBsaW5lIG9uZQpUaGlzIG' +
- # 'lzIGxpbmUgdHdvClRoaXMgaXMgbGlu' +
- # 'ZSB0aHJlZQpBbmQgc28gb24uLi4K'
- # puts Base64.decode64(str)
- #
- # Generates:
- #
- # This is line one
- # This is line two
- # This is line three
- # And so on...
- #
- # source://base64//base64.rb#58
- def decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with RFC 2045.
- # Line feeds are added to every 60 encoded characters.
- #
- # require 'base64'
- # Base64.encode64("Now is the time for all good coders\nto learn Ruby")
- #
- # Generates:
- #
- # Tm93IGlzIHRoZSB0aW1lIGZvciBhbGwgZ29vZCBjb2RlcnMKdG8gbGVhcm4g
- # UnVieQ==
- #
- # source://base64//base64.rb#38
- def encode64(bin); end
-
- # Returns the Base64-decoded version of +str+.
- # This method complies with RFC 4648.
- # ArgumentError is raised if +str+ is incorrectly padded or contains
- # non-alphabet characters. Note that CR or LF are also rejected.
- #
- # source://base64//base64.rb#73
- def strict_decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with RFC 4648.
- # No line feeds are added.
- #
- # source://base64//base64.rb#65
- def strict_encode64(bin); end
-
- # Returns the Base64-decoded version of +str+.
- # This method complies with ``Base 64 Encoding with URL and Filename Safe
- # Alphabet'' in RFC 4648.
- # The alphabet uses '-' instead of '+' and '_' instead of '/'.
- #
- # The padding character is optional.
- # This method accepts both correctly-padded and unpadded input.
- # Note that it still rejects incorrectly-padded input.
- #
- # source://base64//base64.rb#98
- def urlsafe_decode64(str); end
-
- # Returns the Base64-encoded version of +bin+.
- # This method complies with ``Base 64 Encoding with URL and Filename Safe
- # Alphabet'' in RFC 4648.
- # The alphabet uses '-' instead of '+' and '_' instead of '/'.
- # Note that the result can still contain '='.
- # You can remove the padding by setting +padding+ as false.
- #
- # source://base64//base64.rb#83
- def urlsafe_encode64(bin, padding: T.unsafe(nil)); end
- end
-end
diff --git a/sorbet/rbi/gems/diff-lcs@1.5.0.rbi b/sorbet/rbi/gems/diff-lcs@1.5.0.rbi
deleted file mode 100644
index 7c80d24..0000000
--- a/sorbet/rbi/gems/diff-lcs@1.5.0.rbi
+++ /dev/null
@@ -1,8 +0,0 @@
-# typed: true
-
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `diff-lcs` gem.
-# Please instead update this file by running `bin/tapioca gem diff-lcs`.
-
-# THIS IS AN EMPTY RBI FILE.
-# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/io-console@0.6.0.rbi b/sorbet/rbi/gems/io-console@0.7.2.rbi
similarity index 100%
rename from sorbet/rbi/gems/io-console@0.6.0.rbi
rename to sorbet/rbi/gems/io-console@0.7.2.rbi
diff --git a/sorbet/rbi/gems/irb@1.7.1.rbi b/sorbet/rbi/gems/irb@1.7.1.rbi
deleted file mode 100644
index fb94d0d..0000000
--- a/sorbet/rbi/gems/irb@1.7.1.rbi
+++ /dev/null
@@ -1,342 +0,0 @@
-# typed: true
-
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `irb` gem.
-# Please instead update this file by running `bin/tapioca gem irb`.
-
-# An output formatter used internally by the lexer.
-#
-# source://irb//lib/irb/notifier.rb#11
-module IRB::Notifier
- private
-
- # Define a new Notifier output source, returning a new CompositeNotifier
- # with the given +prefix+ and +output_method+.
- #
- # The optional +prefix+ will be appended to all objects being inspected
- # during output, using the given +output_method+ as the output source. If
- # no +output_method+ is given, StdioOutputMethod will be used, and all
- # expressions will be sent directly to STDOUT without any additional
- # formatting.
- #
- # source://irb//lib/irb/notifier.rb#31
- def def_notifier(prefix = T.unsafe(nil), output_method = T.unsafe(nil)); end
-
- class << self
- # Define a new Notifier output source, returning a new CompositeNotifier
- # with the given +prefix+ and +output_method+.
- #
- # The optional +prefix+ will be appended to all objects being inspected
- # during output, using the given +output_method+ as the output source. If
- # no +output_method+ is given, StdioOutputMethod will be used, and all
- # expressions will be sent directly to STDOUT without any additional
- # formatting.
- #
- # source://irb//lib/irb/notifier.rb#31
- def def_notifier(prefix = T.unsafe(nil), output_method = T.unsafe(nil)); end
- end
-end
-
-# An abstract class, or superclass, for CompositeNotifier and
-# LeveledNotifier to inherit. It provides several wrapper methods for the
-# OutputMethod object used by the Notifier.
-#
-# source://irb//lib/irb/notifier.rb#39
-class IRB::Notifier::AbstractNotifier
- # Creates a new Notifier object
- #
- # @return [AbstractNotifier] a new instance of AbstractNotifier
- #
- # source://irb//lib/irb/notifier.rb#41
- def initialize(prefix, base_notifier); end
-
- # Execute the given block if notifications are enabled.
- #
- # @yield [@base_notifier]
- #
- # source://irb//lib/irb/notifier.rb#99
- def exec_if; end
-
- # A wrapper method used to determine whether notifications are enabled.
- #
- # Defaults to +true+.
- #
- # @return [Boolean]
- #
- # source://irb//lib/irb/notifier.rb#53
- def notify?; end
-
- # Same as #ppx, except it uses the #prefix given during object
- # initialization.
- # See OutputMethod#ppx for more detail.
- #
- # source://irb//lib/irb/notifier.rb#82
- def pp(*objs); end
-
- # Same as #pp, except it concatenates the given +prefix+ with the #prefix
- # given during object initialization.
- #
- # See OutputMethod#ppx for more detail.
- #
- # source://irb//lib/irb/notifier.rb#92
- def ppx(prefix, *objs); end
-
- # The +prefix+ for this Notifier, which is appended to all objects being
- # inspected during output.
- #
- # source://irb//lib/irb/notifier.rb#48
- def prefix; end
-
- # See OutputMethod#print for more detail.
- #
- # source://irb//lib/irb/notifier.rb#58
- def print(*opts); end
-
- # See OutputMethod#printf for more detail.
- #
- # source://irb//lib/irb/notifier.rb#68
- def printf(format, *opts); end
-
- # See OutputMethod#printn for more detail.
- #
- # source://irb//lib/irb/notifier.rb#63
- def printn(*opts); end
-
- # See OutputMethod#puts for more detail.
- #
- # source://irb//lib/irb/notifier.rb#73
- def puts(*objs); end
-end
-
-# A class that can be used to create a group of notifier objects with the
-# intent of representing a leveled notification system for irb.
-#
-# This class will allow you to generate other notifiers, and assign them
-# the appropriate level for output.
-#
-# The Notifier class provides a class-method Notifier.def_notifier to
-# create a new composite notifier. Using the first composite notifier
-# object you create, sibling notifiers can be initialized with
-# #def_notifier.
-#
-# source://irb//lib/irb/notifier.rb#114
-class IRB::Notifier::CompositeNotifier < ::IRB::Notifier::AbstractNotifier
- # Create a new composite notifier object with the given +prefix+, and
- # +base_notifier+ to use for output.
- #
- # @return [CompositeNotifier] a new instance of CompositeNotifier
- #
- # source://irb//lib/irb/notifier.rb#117
- def initialize(prefix, base_notifier); end
-
- # Creates a new LeveledNotifier in the composite #notifiers group.
- #
- # The given +prefix+ will be assigned to the notifier, and +level+ will
- # be used as the index of the #notifiers Array.
- #
- # This method returns the newly created instance.
- #
- # source://irb//lib/irb/notifier.rb#133
- def def_notifier(level, prefix = T.unsafe(nil)); end
-
- # Returns the leveled notifier for this object
- #
- # source://irb//lib/irb/notifier.rb#140
- def level; end
-
- # Sets the leveled notifier for this object.
- #
- # When the given +value+ is an instance of AbstractNotifier,
- # #level_notifier is set to the given object.
- #
- # When an Integer is given, #level_notifier is set to the notifier at the
- # index +value+ in the #notifiers Array.
- #
- # If no notifier exists at the index +value+ in the #notifiers Array, an
- # ErrUndefinedNotifier exception is raised.
- #
- # An ErrUnrecognizedLevel exception is raised if the given +value+ is not
- # found in the existing #notifiers Array, or an instance of
- # AbstractNotifier
- #
- # source://irb//lib/irb/notifier.rb#157
- def level=(value); end
-
- # Returns the leveled notifier for this object
- #
- # source://irb//lib/irb/notifier.rb#140
- def level_notifier; end
-
- # Sets the leveled notifier for this object.
- #
- # When the given +value+ is an instance of AbstractNotifier,
- # #level_notifier is set to the given object.
- #
- # When an Integer is given, #level_notifier is set to the notifier at the
- # index +value+ in the #notifiers Array.
- #
- # If no notifier exists at the index +value+ in the #notifiers Array, an
- # ErrUndefinedNotifier exception is raised.
- #
- # An ErrUnrecognizedLevel exception is raised if the given +value+ is not
- # found in the existing #notifiers Array, or an instance of
- # AbstractNotifier
- #
- # source://irb//lib/irb/notifier.rb#157
- def level_notifier=(value); end
-
- # List of notifiers in the group
- #
- # source://irb//lib/irb/notifier.rb#125
- def notifiers; end
-end
-
-# source://irb//lib/irb/notifier.rb#12
-class IRB::Notifier::ErrUndefinedNotifier < ::StandardError
- # @return [ErrUndefinedNotifier] a new instance of ErrUndefinedNotifier
- #
- # source://irb//lib/irb/notifier.rb#13
- def initialize(val); end
-end
-
-# source://irb//lib/irb/notifier.rb#17
-class IRB::Notifier::ErrUnrecognizedLevel < ::StandardError
- # @return [ErrUnrecognizedLevel] a new instance of ErrUnrecognizedLevel
- #
- # source://irb//lib/irb/notifier.rb#18
- def initialize(val); end
-end
-
-# A leveled notifier is comparable to the composite group from
-# CompositeNotifier#notifiers.
-#
-# source://irb//lib/irb/notifier.rb#175
-class IRB::Notifier::LeveledNotifier < ::IRB::Notifier::AbstractNotifier
- include ::Comparable
-
- # Create a new leveled notifier with the given +base+, and +prefix+ to
- # send to AbstractNotifier.new
- #
- # The given +level+ is used to compare other leveled notifiers in the
- # CompositeNotifier group to determine whether or not to output
- # notifications.
- #
- # @return [LeveledNotifier] a new instance of LeveledNotifier
- #
- # source://irb//lib/irb/notifier.rb#184
- def initialize(base, level, prefix); end
-
- # Compares the level of this notifier object with the given +other+
- # notifier.
- #
- # See the Comparable module for more information.
- #
- # source://irb//lib/irb/notifier.rb#197
- def <=>(other); end
-
- # The current level of this notifier object
- #
- # source://irb//lib/irb/notifier.rb#191
- def level; end
-
- # Whether to output messages to the output method, depending on the level
- # of this notifier object.
- #
- # @return [Boolean]
- #
- # source://irb//lib/irb/notifier.rb#203
- def notify?; end
-end
-
-# NoMsgNotifier is a LeveledNotifier that's used as the default notifier
-# when creating a new CompositeNotifier.
-#
-# This notifier is used as the +zero+ index, or level +0+, for
-# CompositeNotifier#notifiers, and will not output messages of any sort.
-#
-# source://irb//lib/irb/notifier.rb#213
-class IRB::Notifier::NoMsgNotifier < ::IRB::Notifier::LeveledNotifier
- # Creates a new notifier that should not be used to output messages.
- #
- # @return [NoMsgNotifier] a new instance of NoMsgNotifier
- #
- # source://irb//lib/irb/notifier.rb#215
- def initialize; end
-
- # Ensures notifications are ignored, see AbstractNotifier#notify? for
- # more information.
- #
- # @return [Boolean]
- #
- # source://irb//lib/irb/notifier.rb#223
- def notify?; end
-end
-
-# An abstract output class for IO in irb. This is mainly used internally by
-# IRB::Notifier. You can define your own output method to use with Irb.new,
-# or Context.new
-#
-# source://irb//lib/irb/output-method.rb#11
-class IRB::OutputMethod
- # Returns an array of the given +format+ and +opts+ to be used by
- # Kernel#sprintf, if there was a successful Regexp match in the given
- # +format+ from #printf
- #
- # %
- # [#0- +]
- # (\*|\*[1-9][0-9]*\$|[1-9][0-9]*)
- # .(\*|\*[1-9][0-9]*\$|[1-9][0-9]*|)?
- # #(hh|h|l|ll|L|q|j|z|t)
- # [diouxXeEfgGcsb%]
- #
- # source://irb//lib/irb/output-method.rb#48
- def parse_printf_format(format, opts); end
-
- # Prints the given +objs+ calling Object#inspect on each.
- #
- # See #puts for more detail.
- #
- # source://irb//lib/irb/output-method.rb#64
- def pp(*objs); end
-
- # Prints the given +objs+ calling Object#inspect on each and appending the
- # given +prefix+.
- #
- # See #puts for more detail.
- #
- # source://irb//lib/irb/output-method.rb#72
- def ppx(prefix, *objs); end
-
- # Open this method to implement your own output method, raises a
- # NotImplementedError if you don't define #print in your own class.
- #
- # @raise [NotImplementedError]
- #
- # source://irb//lib/irb/output-method.rb#20
- def print(*opts); end
-
- # Extends IO#printf to format the given +opts+ for Kernel#sprintf using
- # #parse_printf_format
- #
- # source://irb//lib/irb/output-method.rb#31
- def printf(format, *opts); end
-
- # Prints the given +opts+, with a newline delimiter.
- #
- # source://irb//lib/irb/output-method.rb#25
- def printn(*opts); end
-
- # Calls #print on each element in the given +objs+, followed by a newline
- # character.
- #
- # source://irb//lib/irb/output-method.rb#54
- def puts(*objs); end
-end
-
-# source://irb//lib/irb/output-method.rb#12
-class IRB::OutputMethod::NotImplementedError < ::StandardError
- # @return [NotImplementedError] a new instance of NotImplementedError
- #
- # source://irb//lib/irb/output-method.rb#13
- def initialize(val); end
-end
diff --git a/sorbet/rbi/gems/json@2.6.3.rbi b/sorbet/rbi/gems/json@2.7.1.rbi
similarity index 94%
rename from sorbet/rbi/gems/json@2.6.3.rbi
rename to sorbet/rbi/gems/json@2.7.1.rbi
index 259116a..47754dc 100644
--- a/sorbet/rbi/gems/json@2.6.3.rbi
+++ b/sorbet/rbi/gems/json@2.7.1.rbi
@@ -1,4 +1,4 @@
-# typed: true
+# typed: false
# DO NOT EDIT MANUALLY
# This is an autogenerated file for types exported from the `json` gem.
@@ -13,7 +13,7 @@ class Class < ::Module
#
# @return [Boolean]
#
- # source://json//json/common.rb#700
+ # source://json//json/common.rb#694
def json_creatable?; end
end
@@ -300,6 +300,15 @@ end
# # Raises JSON::NestingError (nesting of 2 is too deep):
# JSON.generate(obj, max_nesting: 2)
#
+# ====== Escaping Options
+#
+# Options +script_safe+ (boolean) specifies wether '\u2028', '\u2029'
+# and '/' should be escaped as to make the JSON object safe to interpolate in script
+# tags.
+#
+# Options +ascii_only+ (boolean) specifies wether all characters outside the ASCII range
+# should be escaped.
+#
# ====== Output Options
#
# The default formatting options generate the most compact
@@ -617,8 +626,8 @@ module JSON
# Output:
# {"foo":[0,1],"bar":{"baz":2,"bat":3},"bam":"bad"}
#
- # source://json//json/common.rb#631
- def dump(obj, anIO = T.unsafe(nil), limit = T.unsafe(nil)); end
+ # source://json//json/common.rb#614
+ def dump(obj, anIO = T.unsafe(nil), limit = T.unsafe(nil), kwargs = T.unsafe(nil)); end
# :call-seq:
# JSON.fast_generate(obj, opts) -> new_string
@@ -634,13 +643,13 @@ module JSON
# # Raises SystemStackError (stack level too deep):
# JSON.fast_generate(a)
#
- # source://json//json/common.rb#335
+ # source://json//json/common.rb#328
def fast_generate(obj, opts = T.unsafe(nil)); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and later delete them.
#
- # source://json//json/common.rb#335
+ # source://json//json/common.rb#328
def fast_unparse(obj, opts = T.unsafe(nil)); end
# :call-seq:
@@ -679,7 +688,7 @@ module JSON
# # Raises JSON::NestingError (nesting of 100 is too deep):
# JSON.generate(a)
#
- # source://json//json/common.rb#296
+ # source://json//json/common.rb#299
def generate(obj, opts = T.unsafe(nil)); end
# :call-seq:
@@ -810,7 +819,7 @@ module JSON
# #"Admin", "password"=>"0wn3d"}>}
#
- # source://json//json/common.rb#557
+ # source://json//json/common.rb#540
def load(source, proc = T.unsafe(nil), options = T.unsafe(nil)); end
# :call-seq:
@@ -821,7 +830,7 @@ module JSON
#
# See method #parse.
#
- # source://json//json/common.rb#245
+ # source://json//json/common.rb#248
def load_file(filespec, opts = T.unsafe(nil)); end
# :call-seq:
@@ -832,9 +841,12 @@ module JSON
#
# See method #parse!
#
- # source://json//json/common.rb#256
+ # source://json//json/common.rb#259
def load_file!(filespec, opts = T.unsafe(nil)); end
+ # source://json//json/common.rb#642
+ def merge_dump_options(opts, strict: T.unsafe(nil)); end
+
# :call-seq:
# JSON.parse(source, opts) -> object
#
@@ -883,7 +895,7 @@ module JSON
# # Raises JSON::ParserError (783: unexpected token at ''):
# JSON.parse('')
#
- # source://json//json/common.rb#215
+ # source://json//json/common.rb#218
def parse(source, opts = T.unsafe(nil)); end
# :call-seq:
@@ -898,7 +910,7 @@ module JSON
# which disables checking for nesting depth.
# - Option +allow_nan+, if not provided, defaults to +true+.
#
- # source://json//json/common.rb#230
+ # source://json//json/common.rb#233
def parse!(source, opts = T.unsafe(nil)); end
# :call-seq:
@@ -931,28 +943,28 @@ module JSON
# }
# }
#
- # source://json//json/common.rb#390
+ # source://json//json/common.rb#373
def pretty_generate(obj, opts = T.unsafe(nil)); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and later delete them.
#
- # source://json//json/common.rb#390
+ # source://json//json/common.rb#373
def pretty_unparse(obj, opts = T.unsafe(nil)); end
# Recursively calls passed _Proc_ if the parsed data structure is an _Array_ or _Hash_
#
- # source://json//json/common.rb#575
+ # source://json//json/common.rb#558
def recurse_proc(result, &proc); end
- # source://json//json/common.rb#557
+ # source://json//json/common.rb#540
def restore(source, proc = T.unsafe(nil), options = T.unsafe(nil)); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and
# later delete them.
#
- # source://json//json/common.rb#296
+ # source://json//json/common.rb#299
def unparse(obj, opts = T.unsafe(nil)); end
class << self
@@ -968,26 +980,26 @@ module JSON
# ruby = [0, 1, nil]
# JSON[ruby] # => '[0,1,null]'
#
- # source://json//json/common.rb#18
+ # source://json//json/common.rb#21
def [](object, opts = T.unsafe(nil)); end
- # source://json//json/common.rb#81
+ # source://json//json/common.rb#84
def create_fast_state; end
# Returns the current create identifier.
# See also JSON.create_id=.
#
- # source://json//json/common.rb#126
+ # source://json//json/common.rb#129
def create_id; end
# Sets create identifier, which is used to decide if the _json_create_
# hook of a class should be called; initial value is +json_class+:
# JSON.create_id # => 'json_class'
#
- # source://json//json/common.rb#120
+ # source://json//json/common.rb#123
def create_id=(new_value); end
- # source://json//json/common.rb#91
+ # source://json//json/common.rb#94
def create_pretty_state; end
# Return the constant located at _path_. The format of _path_ has to be
@@ -995,7 +1007,7 @@ module JSON
# level (absolute namespace path?). If there doesn't exist a constant at
# the given path, an ArgumentError is raised.
#
- # source://json//json/common.rb#42
+ # source://json//json/common.rb#45
def deep_const_get(path); end
# :call-seq:
@@ -1026,23 +1038,23 @@ module JSON
# Output:
# {"foo":[0,1],"bar":{"baz":2,"bat":3},"bam":"bad"}
#
- # source://json//json/common.rb#631
- def dump(obj, anIO = T.unsafe(nil), limit = T.unsafe(nil)); end
+ # source://json//json/common.rb#614
+ def dump(obj, anIO = T.unsafe(nil), limit = T.unsafe(nil), kwargs = T.unsafe(nil)); end
# Sets or returns the default options for the JSON.dump method.
# Initially:
# opts = JSON.dump_default_options
- # opts # => {:max_nesting=>false, :allow_nan=>true, :escape_slash=>false}
+ # opts # => {:max_nesting=>false, :allow_nan=>true, :script_safe=>false}
#
- # source://json//json/common.rb#596
+ # source://json//json/common.rb#579
def dump_default_options; end
# Sets or returns the default options for the JSON.dump method.
# Initially:
# opts = JSON.dump_default_options
- # opts # => {:max_nesting=>false, :allow_nan=>true, :escape_slash=>false}
+ # opts # => {:max_nesting=>false, :allow_nan=>true, :script_safe=>false}
#
- # source://json//json/common.rb#596
+ # source://json//json/common.rb#579
def dump_default_options=(_arg0); end
# :call-seq:
@@ -1059,13 +1071,13 @@ module JSON
# # Raises SystemStackError (stack level too deep):
# JSON.fast_generate(a)
#
- # source://json//json/common.rb#335
+ # source://json//json/common.rb#328
def fast_generate(obj, opts = T.unsafe(nil)); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and later delete them.
#
- # source://json//json/common.rb#335
+ # source://json//json/common.rb#328
def fast_unparse(obj, opts = T.unsafe(nil)); end
# :call-seq:
@@ -1104,24 +1116,24 @@ module JSON
# # Raises JSON::NestingError (nesting of 100 is too deep):
# JSON.generate(a)
#
- # source://json//json/common.rb#296
+ # source://json//json/common.rb#299
def generate(obj, opts = T.unsafe(nil)); end
# Returns the JSON generator module that is used by JSON. This is
# either JSON::Ext::Generator or JSON::Pure::Generator:
# JSON.generator # => JSON::Ext::Generator
#
- # source://json//json/common.rb#103
+ # source://json//json/common.rb#106
def generator; end
# Set the module _generator_ to be used by JSON.
#
- # source://json//json/common.rb#58
+ # source://json//json/common.rb#61
def generator=(generator); end
# Encodes string using String.encode.
#
- # source://json//json/common.rb#653
+ # source://json//json/common.rb#638
def iconv(to, from, string); end
# :call-seq:
@@ -1252,7 +1264,7 @@ module JSON
# #"Admin", "password"=>"0wn3d"}>}
#
- # source://json//json/common.rb#557
+ # source://json//json/common.rb#540
def load(source, proc = T.unsafe(nil), options = T.unsafe(nil)); end
# Sets or returns default options for the JSON.load method.
@@ -1260,7 +1272,7 @@ module JSON
# opts = JSON.load_default_options
# opts # => {:max_nesting=>false, :allow_nan=>true, :allow_blank=>true, :create_additions=>true}
#
- # source://json//json/common.rb#420
+ # source://json//json/common.rb#403
def load_default_options; end
# Sets or returns default options for the JSON.load method.
@@ -1268,7 +1280,7 @@ module JSON
# opts = JSON.load_default_options
# opts # => {:max_nesting=>false, :allow_nan=>true, :allow_blank=>true, :create_additions=>true}
#
- # source://json//json/common.rb#420
+ # source://json//json/common.rb#403
def load_default_options=(_arg0); end
# :call-seq:
@@ -1279,7 +1291,7 @@ module JSON
#
# See method #parse.
#
- # source://json//json/common.rb#245
+ # source://json//json/common.rb#248
def load_file(filespec, opts = T.unsafe(nil)); end
# :call-seq:
@@ -1290,7 +1302,7 @@ module JSON
#
# See method #parse!
#
- # source://json//json/common.rb#256
+ # source://json//json/common.rb#259
def load_file!(filespec, opts = T.unsafe(nil)); end
# :call-seq:
@@ -1341,7 +1353,7 @@ module JSON
# # Raises JSON::ParserError (783: unexpected token at ''):
# JSON.parse('')
#
- # source://json//json/common.rb#215
+ # source://json//json/common.rb#218
def parse(source, opts = T.unsafe(nil)); end
# :call-seq:
@@ -1356,19 +1368,19 @@ module JSON
# which disables checking for nesting depth.
# - Option +allow_nan+, if not provided, defaults to +true+.
#
- # source://json//json/common.rb#230
+ # source://json//json/common.rb#233
def parse!(source, opts = T.unsafe(nil)); end
# Returns the JSON parser class that is used by JSON. This is either
# JSON::Ext::Parser or JSON::Pure::Parser:
# JSON.parser # => JSON::Ext::Parser
#
- # source://json//json/common.rb#29
+ # source://json//json/common.rb#32
def parser; end
# Set the JSON parser class _parser_ to be used by JSON.
#
- # source://json//json/common.rb#32
+ # source://json//json/common.rb#35
def parser=(parser); end
# :call-seq:
@@ -1401,50 +1413,55 @@ module JSON
# }
# }
#
- # source://json//json/common.rb#390
+ # source://json//json/common.rb#373
def pretty_generate(obj, opts = T.unsafe(nil)); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and later delete them.
#
- # source://json//json/common.rb#390
+ # source://json//json/common.rb#373
def pretty_unparse(obj, opts = T.unsafe(nil)); end
# Recursively calls passed _Proc_ if the parsed data structure is an _Array_ or _Hash_
#
- # source://json//json/common.rb#575
+ # source://json//json/common.rb#558
def recurse_proc(result, &proc); end
- # source://json//json/common.rb#557
+ # source://json//json/common.rb#540
def restore(source, proc = T.unsafe(nil), options = T.unsafe(nil)); end
# Sets or Returns the JSON generator state class that is used by JSON. This is
# either JSON::Ext::Generator::State or JSON::Pure::Generator::State:
# JSON.state # => JSON::Ext::Generator::State
#
- # source://json//json/common.rb#108
+ # source://json//json/common.rb#111
def state; end
# Sets or Returns the JSON generator state class that is used by JSON. This is
# either JSON::Ext::Generator::State or JSON::Pure::Generator::State:
# JSON.state # => JSON::Ext::Generator::State
#
- # source://json//json/common.rb#108
+ # source://json//json/common.rb#111
def state=(_arg0); end
# :stopdoc:
# I want to deprecate these later, so I'll first be silent about them, and
# later delete them.
#
- # source://json//json/common.rb#296
+ # source://json//json/common.rb#299
def unparse(obj, opts = T.unsafe(nil)); end
+
+ private
+
+ # source://json//json/common.rb#642
+ def merge_dump_options(opts, strict: T.unsafe(nil)); end
end
end
-# source://json//json/common.rb#114
+# source://json//json/common.rb#117
JSON::CREATE_ID_TLS_KEY = T.let(T.unsafe(nil), String)
-# source://json//json/common.rb#111
+# source://json//json/common.rb#114
JSON::DEFAULT_CREATE_ID = T.let(T.unsafe(nil), String)
class JSON::GenericObject < ::OpenStruct
@@ -1490,20 +1507,23 @@ end
# The base exception for JSON errors.
class JSON::JSONError < ::StandardError
class << self
- # source://json//json/common.rb#138
+ # source://json//json/common.rb#141
def wrap(exception); end
end
end
-# source://json//json/common.rb#35
+# source://json//json/common.rb#6
+JSON::NOT_SET = T.let(T.unsafe(nil), Object)
+
+# source://json//json/common.rb#38
JSON::Parser = JSON::Ext::Parser
-# source://json//json/common.rb#73
+# source://json//json/common.rb#76
JSON::State = JSON::Ext::Generator::State
# For backwards compatibility
#
-# source://json//json/common.rb#159
+# source://json//json/common.rb#162
JSON::UnparserError = JSON::GeneratorError
module Kernel
@@ -1516,18 +1536,18 @@ module Kernel
# The _opts_ argument is passed through to generate/parse respectively. See
# generate and parse for their documentation.
#
- # source://json//json/common.rb#685
+ # source://json//json/common.rb#679
def JSON(object, *args); end
# Outputs _objs_ to STDOUT as JSON strings in the shortest form, that is in
# one line.
#
- # source://json//json/common.rb#663
+ # source://json//json/common.rb#657
def j(*objs); end
# Outputs _objs_ to STDOUT as JSON strings in a pretty format, with
# indentation and over many lines.
#
- # source://json//json/common.rb#672
+ # source://json//json/common.rb#666
def jj(*objs); end
end
diff --git a/sorbet/rbi/gems/minitest@5.18.1.rbi b/sorbet/rbi/gems/minitest@5.21.2.rbi
similarity index 82%
rename from sorbet/rbi/gems/minitest@5.18.1.rbi
rename to sorbet/rbi/gems/minitest@5.21.2.rbi
index b3f525d..f6bb41a 100644
--- a/sorbet/rbi/gems/minitest@5.18.1.rbi
+++ b/sorbet/rbi/gems/minitest@5.21.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#173
+ # source://minitest//lib/minitest.rb#176
def __run(reporter, options); end
# A simple hook allowing you to run a block of code after everything
@@ -64,12 +64,18 @@ module Minitest
#
# Minitest.after_run { p $debugging_info }
#
- # source://minitest//lib/minitest.rb#94
+ # source://minitest//lib/minitest.rb#97
def after_run(&block); end
+ # source://minitest//lib/minitest.rb#19
+ def allow_fork; end
+
+ # source://minitest//lib/minitest.rb#19
+ def allow_fork=(_arg0); end
+
# Registers Minitest to run at process exit
#
- # source://minitest//lib/minitest.rb#66
+ # source://minitest//lib/minitest.rb#69
def autorun; end
# source://minitest//lib/minitest.rb#19
@@ -81,7 +87,7 @@ module Minitest
# source://minitest//lib/minitest.rb#18
def cattr_accessor(name); end
- # source://minitest//lib/minitest.rb#1073
+ # source://minitest//lib/minitest.rb#1134
def clock_time; end
# source://minitest//lib/minitest.rb#19
@@ -90,7 +96,7 @@ module Minitest
# source://minitest//lib/minitest.rb#19
def extensions=(_arg0); end
- # source://minitest//lib/minitest.rb#264
+ # source://minitest//lib/minitest.rb#271
def filter_backtrace(bt); end
# source://minitest//lib/minitest.rb#19
@@ -99,10 +105,10 @@ module Minitest
# source://minitest//lib/minitest.rb#19
def info_signal=(_arg0); end
- # source://minitest//lib/minitest.rb#98
+ # source://minitest//lib/minitest.rb#101
def init_plugins(options); end
- # source://minitest//lib/minitest.rb#105
+ # source://minitest//lib/minitest.rb#108
def load_plugins; end
# source://minitest//lib/minitest.rb#19
@@ -111,7 +117,7 @@ module Minitest
# source://minitest//lib/minitest.rb#19
def parallel_executor=(_arg0); end
- # source://minitest//lib/minitest.rb#186
+ # source://minitest//lib/minitest.rb#189
def process_args(args = T.unsafe(nil)); end
# source://minitest//lib/minitest.rb#19
@@ -136,10 +142,10 @@ module Minitest
# Minitest.run_one_method(klass, runnable_method)
# klass.new(runnable_method).run
#
- # source://minitest//lib/minitest.rb#140
+ # source://minitest//lib/minitest.rb#143
def run(args = T.unsafe(nil)); end
- # source://minitest//lib/minitest.rb#1064
+ # source://minitest//lib/minitest.rb#1125
def run_one_method(klass, method_name); end
# source://minitest//lib/minitest.rb#19
@@ -153,27 +159,24 @@ end
# Defines the API for Reporters. Subclass this and override whatever
# you want. Go nuts.
#
-# source://minitest//lib/minitest.rb#592
+# source://minitest//lib/minitest.rb#627
class Minitest::AbstractReporter
- include ::Mutex_m
-
- # source://mutex_m/0.1.2/mutex_m.rb#93
- def lock; end
-
- # source://mutex_m/0.1.2/mutex_m.rb#83
- def locked?; end
+ # @return [AbstractReporter] a new instance of AbstractReporter
+ #
+ # source://minitest//lib/minitest.rb#629
+ def initialize; end
# Did this run pass?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#626
+ # source://minitest//lib/minitest.rb#664
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#605
+ # source://minitest//lib/minitest.rb#643
def prerecord(klass, name); end
# Output and record the result of the test. Call
@@ -181,48 +184,45 @@ class Minitest::AbstractReporter
# result character string. Stores the result of the run if the run
# did not pass.
#
- # source://minitest//lib/minitest.rb#614
+ # source://minitest//lib/minitest.rb#652
def record(result); end
# Outputs the summary of the run.
#
- # source://minitest//lib/minitest.rb#620
+ # source://minitest//lib/minitest.rb#658
def report; end
# Starts reporting on the run.
#
- # source://minitest//lib/minitest.rb#598
+ # source://minitest//lib/minitest.rb#636
def start; end
- # source://mutex_m/0.1.2/mutex_m.rb#78
+ # source://minitest//lib/minitest.rb#668
def synchronize(&block); end
-
- # source://mutex_m/0.1.2/mutex_m.rb#88
- def try_lock; end
-
- # source://mutex_m/0.1.2/mutex_m.rb#98
- def unlock; end
end
# Represents run failures.
#
-# source://minitest//lib/minitest.rb#909
+# source://minitest//lib/minitest.rb#951
class Minitest::Assertion < ::Exception
- # source://minitest//lib/minitest.rb#910
+ # source://minitest//lib/minitest.rb#954
def error; end
# Where was this run before an assertion was raised?
#
- # source://minitest//lib/minitest.rb#917
+ # source://minitest//lib/minitest.rb#961
def location; end
- # source://minitest//lib/minitest.rb#926
+ # source://minitest//lib/minitest.rb#968
def result_code; end
- # source://minitest//lib/minitest.rb#930
+ # source://minitest//lib/minitest.rb#972
def result_label; end
end
+# source://minitest//lib/minitest.rb#952
+Minitest::Assertion::RE = T.let(T.unsafe(nil), Regexp)
+
# Minitest Assertions. All assertion methods accept a +msg+ which is
# printed if the assertion fails.
#
@@ -237,6 +237,9 @@ module Minitest::Assertions
# source://minitest//lib/minitest/assertions.rb#188
def _synchronize; end
+ # source://minitest//lib/minitest/assertions.rb#201
+ def _where; end
+
# Fails unless +test+ is truthy.
#
# source://minitest//lib/minitest/assertions.rb#178
@@ -259,7 +262,7 @@ module Minitest::Assertions
#
# See also: Minitest::Assertions.diff
#
- # source://minitest//lib/minitest/assertions.rb#216
+ # source://minitest//lib/minitest/assertions.rb#221
def assert_equal(exp, act, msg = T.unsafe(nil)); end
# For comparing Floats. Fails unless +exp+ and +act+ are within +delta+
@@ -267,50 +270,50 @@ module Minitest::Assertions
#
# assert_in_delta Math::PI, (22.0 / 7.0), 0.01
#
- # source://minitest//lib/minitest/assertions.rb#240
+ # source://minitest//lib/minitest/assertions.rb#242
def assert_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end
# For comparing Floats. Fails unless +exp+ and +act+ have a relative
# error less than +epsilon+.
#
- # source://minitest//lib/minitest/assertions.rb#252
+ # source://minitest//lib/minitest/assertions.rb#254
def assert_in_epsilon(exp, act, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end
# Fails unless +collection+ includes +obj+.
#
- # source://minitest//lib/minitest/assertions.rb#259
+ # source://minitest//lib/minitest/assertions.rb#261
def assert_includes(collection, obj, msg = T.unsafe(nil)); end
# Fails unless +obj+ is an instance of +cls+.
#
- # source://minitest//lib/minitest/assertions.rb#270
+ # source://minitest//lib/minitest/assertions.rb#272
def assert_instance_of(cls, obj, msg = T.unsafe(nil)); end
# Fails unless +obj+ is a kind of +cls+.
#
- # source://minitest//lib/minitest/assertions.rb#281
+ # source://minitest//lib/minitest/assertions.rb#283
def assert_kind_of(cls, obj, msg = T.unsafe(nil)); end
# Fails unless +matcher+ =~ +obj+.
#
- # source://minitest//lib/minitest/assertions.rb#291
+ # source://minitest//lib/minitest/assertions.rb#293
def assert_match(matcher, obj, msg = T.unsafe(nil)); end
# Assert that the mock verifies correctly.
#
- # source://minitest//lib/minitest/mock.rb#248
+ # source://minitest//lib/minitest/mock.rb#250
def assert_mock(mock); end
# Fails unless +obj+ is nil
#
- # source://minitest//lib/minitest/assertions.rb#303
+ # source://minitest//lib/minitest/assertions.rb#305
def assert_nil(obj, msg = T.unsafe(nil)); end
# For testing with binary operators. Eg:
#
# assert_operator 5, :<=, 4
#
- # source://minitest//lib/minitest/assertions.rb#313
+ # source://minitest//lib/minitest/assertions.rb#315
def assert_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end
# Fails if stdout or stderr do not output the expected results.
@@ -324,12 +327,12 @@ module Minitest::Assertions
#
# See also: #assert_silent
#
- # source://minitest//lib/minitest/assertions.rb#331
+ # source://minitest//lib/minitest/assertions.rb#333
def assert_output(stdout = T.unsafe(nil), stderr = T.unsafe(nil)); end
# Fails unless +path+ exists.
#
- # source://minitest//lib/minitest/assertions.rb#355
+ # source://minitest//lib/minitest/assertions.rb#357
def assert_path_exists(path, msg = T.unsafe(nil)); end
# For testing with pattern matching (only supported with Ruby 3.0 and later)
@@ -347,7 +350,7 @@ module Minitest::Assertions
#
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest/assertions.rb#374
+ # source://minitest//lib/minitest/assertions.rb#376
def assert_pattern; end
# For testing with predicates. Eg:
@@ -358,7 +361,7 @@ module Minitest::Assertions
#
# str.must_be :empty?
#
- # source://minitest//lib/minitest/assertions.rb#395
+ # source://minitest//lib/minitest/assertions.rb#397
def assert_predicate(o1, op, msg = T.unsafe(nil)); end
# Fails unless the block raises one of +exp+. Returns the
@@ -382,36 +385,37 @@ module Minitest::Assertions
#
# assert_equal 'This is really bad', error.message
#
- # source://minitest//lib/minitest/assertions.rb#422
+ # source://minitest//lib/minitest/assertions.rb#424
def assert_raises(*exp); end
# Fails unless +obj+ responds to +meth+.
+ # include_all defaults to false to match Object#respond_to?
#
- # source://minitest//lib/minitest/assertions.rb#453
- def assert_respond_to(obj, meth, msg = T.unsafe(nil)); end
+ # source://minitest//lib/minitest/assertions.rb#456
+ def assert_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end
# Fails unless +exp+ and +act+ are #equal?
#
- # source://minitest//lib/minitest/assertions.rb#463
+ # source://minitest//lib/minitest/assertions.rb#466
def assert_same(exp, act, msg = T.unsafe(nil)); end
# +send_ary+ is a receiver, message and arguments.
#
# Fails unless the call returns a true value
#
- # source://minitest//lib/minitest/assertions.rb#476
+ # source://minitest//lib/minitest/assertions.rb#479
def assert_send(send_ary, m = T.unsafe(nil)); end
# Fails if the block outputs anything to stderr or stdout.
#
# See also: #assert_output
#
- # source://minitest//lib/minitest/assertions.rb#492
+ # source://minitest//lib/minitest/assertions.rb#493
def assert_silent; end
# Fails unless the block throws +sym+
#
- # source://minitest//lib/minitest/assertions.rb#501
+ # source://minitest//lib/minitest/assertions.rb#502
def assert_throws(sym, msg = T.unsafe(nil)); end
# Captures $stdout and $stderr into strings:
@@ -428,7 +432,7 @@ module Minitest::Assertions
# capture IO for subprocesses. Use #capture_subprocess_io for
# that.
#
- # source://minitest//lib/minitest/assertions.rb#542
+ # source://minitest//lib/minitest/assertions.rb#543
def capture_io; end
# Captures $stdout and $stderr into strings, using Tempfile to
@@ -445,7 +449,7 @@ module Minitest::Assertions
# NOTE: This method is approximately 10x slower than #capture_io so
# only use it when you need to test the output of a subprocess.
#
- # source://minitest//lib/minitest/assertions.rb#575
+ # source://minitest//lib/minitest/assertions.rb#576
def capture_subprocess_io; end
# Returns a diff between +exp+ and +act+. If there is no known
@@ -460,24 +464,24 @@ module Minitest::Assertions
# Returns details for exception +e+
#
- # source://minitest//lib/minitest/assertions.rb#607
+ # source://minitest//lib/minitest/assertions.rb#608
def exception_details(e, msg); end
# Fails after a given date (in the local time zone). This allows
# you to put time-bombs in your tests if you need to keep
# something around until a later date lest you forget about it.
#
- # source://minitest//lib/minitest/assertions.rb#623
+ # source://minitest//lib/minitest/assertions.rb#624
def fail_after(y, m, d, msg); end
# Fails with +msg+.
#
- # source://minitest//lib/minitest/assertions.rb#630
+ # source://minitest//lib/minitest/assertions.rb#631
def flunk(msg = T.unsafe(nil)); end
# Returns a proc that will output +msg+ along with the default message.
#
- # source://minitest//lib/minitest/assertions.rb#638
+ # source://minitest//lib/minitest/assertions.rb#639
def message(msg = T.unsafe(nil), ending = T.unsafe(nil), &default); end
# This returns a human-readable version of +obj+. By default
@@ -499,62 +503,62 @@ module Minitest::Assertions
# used for counting assertions
#
- # source://minitest//lib/minitest/assertions.rb#649
+ # source://minitest//lib/minitest/assertions.rb#650
def pass(_msg = T.unsafe(nil)); end
# Fails if +test+ is truthy.
#
- # source://minitest//lib/minitest/assertions.rb#656
+ # source://minitest//lib/minitest/assertions.rb#657
def refute(test, msg = T.unsafe(nil)); end
# Fails if +obj+ is empty.
#
- # source://minitest//lib/minitest/assertions.rb#664
+ # source://minitest//lib/minitest/assertions.rb#665
def refute_empty(obj, msg = T.unsafe(nil)); end
# Fails if exp == act.
#
# For floats use refute_in_delta.
#
- # source://minitest//lib/minitest/assertions.rb#675
+ # source://minitest//lib/minitest/assertions.rb#676
def refute_equal(exp, act, msg = T.unsafe(nil)); end
# For comparing Floats. Fails if +exp+ is within +delta+ of +act+.
#
# refute_in_delta Math::PI, (22.0 / 7.0)
#
- # source://minitest//lib/minitest/assertions.rb#687
+ # source://minitest//lib/minitest/assertions.rb#688
def refute_in_delta(exp, act, delta = T.unsafe(nil), msg = T.unsafe(nil)); end
# For comparing Floats. Fails if +exp+ and +act+ have a relative error
# less than +epsilon+.
#
- # source://minitest//lib/minitest/assertions.rb#699
+ # source://minitest//lib/minitest/assertions.rb#700
def refute_in_epsilon(a, b, epsilon = T.unsafe(nil), msg = T.unsafe(nil)); end
# Fails if +collection+ includes +obj+.
#
- # source://minitest//lib/minitest/assertions.rb#706
+ # source://minitest//lib/minitest/assertions.rb#707
def refute_includes(collection, obj, msg = T.unsafe(nil)); end
# Fails if +obj+ is an instance of +cls+.
#
- # source://minitest//lib/minitest/assertions.rb#717
+ # source://minitest//lib/minitest/assertions.rb#718
def refute_instance_of(cls, obj, msg = T.unsafe(nil)); end
# Fails if +obj+ is a kind of +cls+.
#
- # source://minitest//lib/minitest/assertions.rb#727
+ # source://minitest//lib/minitest/assertions.rb#728
def refute_kind_of(cls, obj, msg = T.unsafe(nil)); end
# Fails if +matcher+ =~ +obj+.
#
- # source://minitest//lib/minitest/assertions.rb#735
+ # source://minitest//lib/minitest/assertions.rb#736
def refute_match(matcher, obj, msg = T.unsafe(nil)); end
# Fails if +obj+ is nil.
#
- # source://minitest//lib/minitest/assertions.rb#745
+ # source://minitest//lib/minitest/assertions.rb#746
def refute_nil(obj, msg = T.unsafe(nil)); end
# Fails if +o1+ is not +op+ +o2+. Eg:
@@ -562,12 +566,12 @@ module Minitest::Assertions
# refute_operator 1, :>, 2 #=> pass
# refute_operator 1, :<, 2 #=> fail
#
- # source://minitest//lib/minitest/assertions.rb#780
+ # source://minitest//lib/minitest/assertions.rb#781
def refute_operator(o1, op, o2 = T.unsafe(nil), msg = T.unsafe(nil)); end
# Fails if +path+ exists.
#
- # source://minitest//lib/minitest/assertions.rb#789
+ # source://minitest//lib/minitest/assertions.rb#790
def refute_path_exists(path, msg = T.unsafe(nil)); end
# For testing with pattern matching (only supported with Ruby 3.0 and later)
@@ -583,7 +587,7 @@ module Minitest::Assertions
#
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest/assertions.rb#762
+ # source://minitest//lib/minitest/assertions.rb#763
def refute_pattern; end
# For testing with predicates.
@@ -594,17 +598,18 @@ module Minitest::Assertions
#
# str.wont_be :empty?
#
- # source://minitest//lib/minitest/assertions.rb#803
+ # source://minitest//lib/minitest/assertions.rb#804
def refute_predicate(o1, op, msg = T.unsafe(nil)); end
# Fails if +obj+ responds to the message +meth+.
+ # include_all defaults to false to match Object#respond_to?
#
- # source://minitest//lib/minitest/assertions.rb#811
- def refute_respond_to(obj, meth, msg = T.unsafe(nil)); end
+ # source://minitest//lib/minitest/assertions.rb#813
+ def refute_respond_to(obj, meth, msg = T.unsafe(nil), include_all: T.unsafe(nil)); end
# Fails if +exp+ is the same (by object identity) as +act+.
#
- # source://minitest//lib/minitest/assertions.rb#820
+ # source://minitest//lib/minitest/assertions.rb#822
def refute_same(exp, act, msg = T.unsafe(nil)); end
# Skips the current run. If run in verbose-mode, the skipped run
@@ -613,22 +618,22 @@ module Minitest::Assertions
#
# @raise [Minitest::Skip]
#
- # source://minitest//lib/minitest/assertions.rb#833
- def skip(msg = T.unsafe(nil), bt = T.unsafe(nil)); end
+ # source://minitest//lib/minitest/assertions.rb#835
+ def skip(msg = T.unsafe(nil), _ignored = T.unsafe(nil)); end
# Skips the current run until a given date (in the local time
# zone). This allows you to put some fixes on hold until a later
# date, but still holds you accountable and prevents you from
# forgetting it.
#
- # source://minitest//lib/minitest/assertions.rb#845
+ # source://minitest//lib/minitest/assertions.rb#847
def skip_until(y, m, d, msg); end
# Was this testcase skipped? Meant for #teardown.
#
# @return [Boolean]
#
- # source://minitest//lib/minitest/assertions.rb#854
+ # source://minitest//lib/minitest/assertions.rb#856
def skipped?; end
# Returns things to diff [expect, butwas], or [nil, nil] if nothing to diff.
@@ -657,7 +662,7 @@ module Minitest::Assertions
end
end
-# source://minitest//lib/minitest/assertions.rb#201
+# source://minitest//lib/minitest/assertions.rb#206
Minitest::Assertions::E = T.let(T.unsafe(nil), String)
# source://minitest//lib/minitest/assertions.rb#19
@@ -667,63 +672,91 @@ Minitest::Assertions::UNDEFINED = T.let(T.unsafe(nil), Object)
#
# See Minitest.backtrace_filter=.
#
-# source://minitest//lib/minitest.rb#1041
+# source://minitest//lib/minitest.rb#1096
class Minitest::BacktraceFilter
+ # @return [BacktraceFilter] a new instance of BacktraceFilter
+ #
+ # source://minitest//lib/minitest.rb#1102
+ 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#1049
+ # source://minitest//lib/minitest.rb#1110
def filter(bt); end
+
+ # Returns the value of attribute regexp.
+ #
+ # source://minitest//lib/minitest.rb#1100
+ def regexp; end
+
+ # Sets the attribute regexp
+ #
+ # @param value the value to set the attribute regexp to.
+ #
+ # source://minitest//lib/minitest.rb#1100
+ def regexp=(_arg0); end
end
-# source://minitest//lib/minitest.rb#1043
+# source://minitest//lib/minitest.rb#1098
Minitest::BacktraceFilter::MT_RE = T.let(T.unsafe(nil), Regexp)
# Dispatch to multiple reporters as one.
#
-# source://minitest//lib/minitest.rb#858
+# source://minitest//lib/minitest.rb#900
class Minitest::CompositeReporter < ::Minitest::AbstractReporter
# @return [CompositeReporter] a new instance of CompositeReporter
#
- # source://minitest//lib/minitest.rb#864
+ # source://minitest//lib/minitest.rb#906
def initialize(*reporters); end
# Add another reporter to the mix.
#
- # source://minitest//lib/minitest.rb#876
+ # source://minitest//lib/minitest.rb#918
def <<(reporter); end
- # source://minitest//lib/minitest.rb#869
+ # source://minitest//lib/minitest.rb#911
def io; end
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#880
+ # source://minitest//lib/minitest.rb#922
def passed?; end
- # source://minitest//lib/minitest.rb#888
+ # source://minitest//lib/minitest.rb#930
def prerecord(klass, name); end
- # source://minitest//lib/minitest.rb#895
+ # source://minitest//lib/minitest.rb#937
def record(result); end
- # source://minitest//lib/minitest.rb#901
+ # source://minitest//lib/minitest.rb#943
def report; end
# The list of reporters to dispatch to.
#
- # source://minitest//lib/minitest.rb#862
+ # source://minitest//lib/minitest.rb#904
def reporters; end
# The list of reporters to dispatch to.
#
- # source://minitest//lib/minitest.rb#862
+ # source://minitest//lib/minitest.rb#904
def reporters=(_arg0); end
- # source://minitest//lib/minitest.rb#884
+ # source://minitest//lib/minitest.rb#926
def start; end
end
+# Compresses backtraces.
+#
+# source://minitest//lib/minitest/compress.rb#5
+module Minitest::Compress
+ # Takes a backtrace (array of strings) and compresses repeating
+ # cycles in it to make it more readable.
+ #
+ # source://minitest//lib/minitest/compress.rb#11
+ def compress(orig); end
+end
+
# source://minitest//lib/minitest/spec.rb#41
class Minitest::Expectation < ::Struct
def ctx; end
@@ -980,48 +1013,48 @@ end
# # ... lots of test methods ...
# end
#
-# source://minitest//lib/minitest.rb#985
+# source://minitest//lib/minitest.rb#1040
module Minitest::Guard
# Is this running on jruby?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#990
+ # source://minitest//lib/minitest.rb#1045
def jruby?(platform = T.unsafe(nil)); end
# Is this running on maglev?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#997
+ # source://minitest//lib/minitest.rb#1052
def maglev?(platform = T.unsafe(nil)); end
# Is this running on mri?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#1007
+ # source://minitest//lib/minitest.rb#1062
def mri?(platform = T.unsafe(nil)); end
# Is this running on macOS?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#1014
+ # source://minitest//lib/minitest.rb#1069
def osx?(platform = T.unsafe(nil)); end
# Is this running on rubinius?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#1021
+ # source://minitest//lib/minitest.rb#1076
def rubinius?(platform = T.unsafe(nil)); end
# Is this running on windows?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#1031
+ # source://minitest//lib/minitest.rb#1086
def windows?(platform = T.unsafe(nil)); end
end
@@ -1033,18 +1066,18 @@ end
class Minitest::Mock
# @return [Mock] a new instance of Mock
#
- # source://minitest//lib/minitest/mock.rb#48
+ # source://minitest//lib/minitest/mock.rb#50
def initialize(delegator = T.unsafe(nil)); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def ===(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#120
+ # source://minitest//lib/minitest/mock.rb#122
def __call(name, data); end
def __respond_to?(*_arg0); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def class(*args, **kwargs, &b); end
# Expect that method +name+ is called, optionally with +args+ (and
@@ -1080,48 +1113,48 @@ class Minitest::Mock
# @mock.ordinal_increment # => 'second'
# @mock.ordinal_increment # => raises MockExpectationError "No more expects available for :ordinal_increment"
#
- # source://minitest//lib/minitest/mock.rb#91
+ # source://minitest//lib/minitest/mock.rb#93
def expect(name, retval, args = T.unsafe(nil), **kwargs, &blk); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def inspect(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def instance_eval(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def instance_variables(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#150
+ # source://minitest//lib/minitest/mock.rb#152
def method_missing(sym, *args, **kwargs, &block); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def object_id(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def public_send(*args, **kwargs, &b); end
# @return [Boolean]
#
- # source://minitest//lib/minitest/mock.rb#236
+ # source://minitest//lib/minitest/mock.rb#238
def respond_to?(sym, include_private = T.unsafe(nil)); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def send(*args, **kwargs, &b); end
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def to_s(*args, **kwargs, &b); end
# Verify that all methods were called as expected. Raises
# +MockExpectationError+ if the mock object was not called as
# expected.
#
- # source://minitest//lib/minitest/mock.rb#140
+ # source://minitest//lib/minitest/mock.rb#142
def verify; end
private
- # source://minitest//lib/minitest/mock.rb#31
+ # source://minitest//lib/minitest/mock.rb#33
def respond_to_missing?(*args, **kwargs, &b); end
end
@@ -1184,36 +1217,36 @@ end
# plugin, pull this out of the composite and replace it with your
# own.
#
-# source://minitest//lib/minitest.rb#657
+# source://minitest//lib/minitest.rb#699
class Minitest::ProgressReporter < ::Minitest::Reporter
- # source://minitest//lib/minitest.rb#658
+ # source://minitest//lib/minitest.rb#700
def prerecord(klass, name); end
- # source://minitest//lib/minitest.rb#665
+ # source://minitest//lib/minitest.rb#707
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#489
+# source://minitest//lib/minitest.rb#521
module Minitest::Reportable
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest.rb#509
+ # source://minitest//lib/minitest.rb#543
def class_name; end
# Did this run error?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#530
+ # source://minitest//lib/minitest.rb#564
def error?; end
# The location identifier of this test. Depends on a method
# existing called class_name.
#
- # source://minitest//lib/minitest.rb#504
+ # source://minitest//lib/minitest.rb#538
def location; end
# Did this run pass?
@@ -1223,47 +1256,50 @@ module Minitest::Reportable
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#496
+ # source://minitest//lib/minitest.rb#528
def passed?; end
# Returns ".", "F", or "E" based on the result of the run.
#
- # source://minitest//lib/minitest.rb#516
+ # source://minitest//lib/minitest.rb#550
def result_code; end
# Was this run skipped?
#
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#523
+ # source://minitest//lib/minitest.rb#557
def skipped?; end
end
-# source://minitest//lib/minitest.rb#633
+# source://minitest//lib/minitest.rb#532
+Minitest::Reportable::BASE_DIR = T.let(T.unsafe(nil), String)
+
+# source://minitest//lib/minitest.rb#675
class Minitest::Reporter < ::Minitest::AbstractReporter
# @return [Reporter] a new instance of Reporter
#
- # source://minitest//lib/minitest.rb#642
+ # source://minitest//lib/minitest.rb#684
def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end
# The IO used to report.
#
- # source://minitest//lib/minitest.rb#635
+ # source://minitest//lib/minitest.rb#677
def io; end
# The IO used to report.
#
- # source://minitest//lib/minitest.rb#635
+ # source://minitest//lib/minitest.rb#677
def io=(_arg0); end
# Command-line options for this run.
#
- # source://minitest//lib/minitest.rb#640
+ # source://minitest//lib/minitest.rb#682
def options; end
# Command-line options for this run.
#
- # source://minitest//lib/minitest.rb#640
+ # source://minitest//lib/minitest.rb#682
def options=(_arg0); end
end
@@ -1273,90 +1309,112 @@ 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#542
+# source://minitest//lib/minitest.rb#576
class Minitest::Result < ::Minitest::Runnable
include ::Minitest::Reportable
- # source://minitest//lib/minitest.rb#575
+ # source://minitest//lib/minitest.rb#610
def class_name; end
# The class name of the test result.
#
- # source://minitest//lib/minitest.rb#551
+ # source://minitest//lib/minitest.rb#585
def klass; end
# The class name of the test result.
#
- # source://minitest//lib/minitest.rb#551
+ # source://minitest//lib/minitest.rb#585
def klass=(_arg0); end
# The location of the test method.
#
- # source://minitest//lib/minitest.rb#556
+ # source://minitest//lib/minitest.rb#590
def source_location; end
# The location of the test method.
#
- # source://minitest//lib/minitest.rb#556
+ # source://minitest//lib/minitest.rb#590
def source_location=(_arg0); end
- # source://minitest//lib/minitest.rb#579
+ # source://minitest//lib/minitest.rb#614
def to_s; end
class << self
# Create a new test result from a Runnable instance.
#
- # source://minitest//lib/minitest.rb#561
+ # source://minitest//lib/minitest.rb#595
def from(runnable); end
end
end
# re-open
#
-# source://minitest//lib/minitest.rb#277
+# source://minitest//lib/minitest.rb#284
class Minitest::Runnable
# @return [Runnable] a new instance of Runnable
#
- # source://minitest//lib/minitest.rb#445
+ # source://minitest//lib/minitest.rb#452
def initialize(name); end
# Number of assertions executed in this run.
#
- # source://minitest//lib/minitest.rb#281
+ # source://minitest//lib/minitest.rb#288
def assertions; end
# Number of assertions executed in this run.
#
- # source://minitest//lib/minitest.rb#281
+ # source://minitest//lib/minitest.rb#288
def assertions=(_arg0); end
- # source://minitest//lib/minitest.rb#441
+ # source://minitest//lib/minitest.rb#448
def failure; end
# An assertion raised during the run, if any.
#
- # source://minitest//lib/minitest.rb#286
+ # source://minitest//lib/minitest.rb#293
def failures; end
# An assertion raised during the run, if any.
#
- # source://minitest//lib/minitest.rb#286
+ # source://minitest//lib/minitest.rb#293
def failures=(_arg0); end
- # source://minitest//lib/minitest.rb#427
+ # source://minitest//lib/minitest.rb#434
def marshal_dump; end
- # source://minitest//lib/minitest.rb#437
+ # source://minitest//lib/minitest.rb#444
def marshal_load(ary); end
+ # Metadata you attach to the test results that get sent to the reporter.
+ #
+ # Lazily initializes to a hash, to keep memory down.
+ #
+ # NOTE: this data *must* be plain (read: marshal-able) data!
+ # Hashes! Arrays! Strings!
+ #
+ # source://minitest//lib/minitest.rb#467
+ def metadata; end
+
+ # Sets metadata, mainly used for +Result.from+.
+ #
+ # source://minitest//lib/minitest.rb#474
+ def metadata=(_arg0); end
+
+ # Returns true if metadata exists.
+ #
+ # @return [Boolean]
+ #
+ # source://minitest//lib/minitest.rb#479
+ def metadata?; end
+
# Name of the run.
#
- # source://minitest//lib/minitest.rb#304
+ # source://minitest//lib/minitest.rb#311
def name; end
# Set the name of the run.
#
- # source://minitest//lib/minitest.rb#311
+ # source://minitest//lib/minitest.rb#318
def name=(o); end
# Did this run pass?
@@ -1367,7 +1425,7 @@ class Minitest::Runnable
# @raise [NotImplementedError]
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#464
+ # source://minitest//lib/minitest.rb#496
def passed?; end
# Returns a single character string to print based on the result
@@ -1376,14 +1434,14 @@ class Minitest::Runnable
#
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest.rb#473
+ # source://minitest//lib/minitest.rb#505
def result_code; end
# Runs a single method. Needs to return self.
#
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest.rb#454
+ # source://minitest//lib/minitest.rb#486
def run; end
# Was this run skipped? See #passed? for more information.
@@ -1391,42 +1449,42 @@ class Minitest::Runnable
# @raise [NotImplementedError]
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#480
+ # source://minitest//lib/minitest.rb#512
def skipped?; end
# The time it took to run.
#
- # source://minitest//lib/minitest.rb#291
+ # source://minitest//lib/minitest.rb#298
def time; end
# The time it took to run.
#
- # source://minitest//lib/minitest.rb#291
+ # source://minitest//lib/minitest.rb#298
def time=(_arg0); end
- # source://minitest//lib/minitest.rb#293
+ # source://minitest//lib/minitest.rb#300
def time_it; end
class << self
- # source://minitest//lib/minitest.rb#1083
+ # source://minitest//lib/minitest.rb#1144
def inherited(klass); end
# Returns all instance methods matching the pattern +re+.
#
- # source://minitest//lib/minitest.rb#318
+ # source://minitest//lib/minitest.rb#325
def methods_matching(re); end
- # source://minitest//lib/minitest.rb#397
+ # source://minitest//lib/minitest.rb#404
def on_signal(name, action); end
- # source://minitest//lib/minitest.rb#322
+ # source://minitest//lib/minitest.rb#329
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#333
+ # source://minitest//lib/minitest.rb#340
def run(reporter, options = T.unsafe(nil)); end
# Runs a single method and has the reporter record the result.
@@ -1434,7 +1492,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#369
+ # source://minitest//lib/minitest.rb#376
def run_one_method(klass, method_name, reporter); end
# Each subclass of Runnable is responsible for overriding this
@@ -1442,33 +1500,33 @@ class Minitest::Runnable
#
# @raise [NotImplementedError]
#
- # source://minitest//lib/minitest.rb#414
+ # source://minitest//lib/minitest.rb#421
def runnable_methods; end
# Returns all subclasses of Runnable.
#
- # source://minitest//lib/minitest.rb#421
+ # source://minitest//lib/minitest.rb#428
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#378
+ # source://minitest//lib/minitest.rb#385
def test_order; end
- # source://minitest//lib/minitest.rb#382
+ # source://minitest//lib/minitest.rb#389
def with_info_handler(reporter, &block); end
end
end
-# source://minitest//lib/minitest.rb#395
+# source://minitest//lib/minitest.rb#402
Minitest::Runnable::SIGNALS = T.let(T.unsafe(nil), Hash)
# Assertion raised when skipping a run.
#
-# source://minitest//lib/minitest.rb#938
+# source://minitest//lib/minitest.rb#980
class Minitest::Skip < ::Minitest::Assertion
- # source://minitest//lib/minitest.rb#939
+ # source://minitest//lib/minitest.rb#981
def result_label; end
end
@@ -1725,113 +1783,113 @@ Minitest::Spec::TYPES = T.let(T.unsafe(nil), Array)
# end
# end
#
-# source://minitest//lib/minitest.rb#693
+# source://minitest//lib/minitest.rb#735
class Minitest::StatisticsReporter < ::Minitest::Reporter
# @return [StatisticsReporter] a new instance of StatisticsReporter
#
- # source://minitest//lib/minitest.rb#737
+ # source://minitest//lib/minitest.rb#779
def initialize(io = T.unsafe(nil), options = T.unsafe(nil)); end
# Total number of assertions.
#
- # source://minitest//lib/minitest.rb#697
+ # source://minitest//lib/minitest.rb#739
def assertions; end
# Total number of assertions.
#
- # source://minitest//lib/minitest.rb#697
+ # source://minitest//lib/minitest.rb#739
def assertions=(_arg0); end
# Total number of test cases.
#
- # source://minitest//lib/minitest.rb#702
+ # source://minitest//lib/minitest.rb#744
def count; end
# Total number of test cases.
#
- # source://minitest//lib/minitest.rb#702
+ # source://minitest//lib/minitest.rb#744
def count=(_arg0); end
# Total number of tests that erred.
#
- # source://minitest//lib/minitest.rb#730
+ # source://minitest//lib/minitest.rb#772
def errors; end
# Total number of tests that erred.
#
- # source://minitest//lib/minitest.rb#730
+ # source://minitest//lib/minitest.rb#772
def errors=(_arg0); end
# Total number of tests that failed.
#
- # source://minitest//lib/minitest.rb#725
+ # source://minitest//lib/minitest.rb#767
def failures; end
# Total number of tests that failed.
#
- # source://minitest//lib/minitest.rb#725
+ # source://minitest//lib/minitest.rb#767
def failures=(_arg0); end
# @return [Boolean]
#
- # source://minitest//lib/minitest.rb#750
+ # source://minitest//lib/minitest.rb#792
def passed?; end
- # source://minitest//lib/minitest.rb#758
+ # source://minitest//lib/minitest.rb#800
def record(result); end
# Report on the tracked statistics.
#
- # source://minitest//lib/minitest.rb#768
+ # source://minitest//lib/minitest.rb#810
def report; end
# An +Array+ of test cases that failed or were skipped.
#
- # source://minitest//lib/minitest.rb#707
+ # source://minitest//lib/minitest.rb#749
def results; end
# An +Array+ of test cases that failed or were skipped.
#
- # source://minitest//lib/minitest.rb#707
+ # source://minitest//lib/minitest.rb#749
def results=(_arg0); end
# Total number of tests that where skipped.
#
- # source://minitest//lib/minitest.rb#735
+ # source://minitest//lib/minitest.rb#777
def skips; end
# Total number of tests that where skipped.
#
- # source://minitest//lib/minitest.rb#735
+ # source://minitest//lib/minitest.rb#777
def skips=(_arg0); end
- # source://minitest//lib/minitest.rb#754
+ # source://minitest//lib/minitest.rb#796
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#714
+ # source://minitest//lib/minitest.rb#756
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#714
+ # source://minitest//lib/minitest.rb#756
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#720
+ # source://minitest//lib/minitest.rb#762
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#720
+ # source://minitest//lib/minitest.rb#762
def total_time=(_arg0); end
end
@@ -1843,48 +1901,48 @@ end
# plugin, pull this out of the composite and replace it with your
# own.
#
-# source://minitest//lib/minitest.rb#788
+# source://minitest//lib/minitest.rb#830
class Minitest::SummaryReporter < ::Minitest::StatisticsReporter
- # source://minitest//lib/minitest.rb#823
+ # source://minitest//lib/minitest.rb#865
def aggregated_results(io); end
# Returns the value of attribute old_sync.
#
- # source://minitest//lib/minitest.rb#791
+ # source://minitest//lib/minitest.rb#833
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#791
+ # source://minitest//lib/minitest.rb#833
def old_sync=(_arg0); end
- # source://minitest//lib/minitest.rb#806
+ # source://minitest//lib/minitest.rb#848
def report; end
# :startdoc:
#
- # source://minitest//lib/minitest.rb#794
+ # source://minitest//lib/minitest.rb#836
def start; end
- # source://minitest//lib/minitest.rb#818
+ # source://minitest//lib/minitest.rb#860
def statistics; end
- # source://minitest//lib/minitest.rb#843
+ # source://minitest//lib/minitest.rb#885
def summary; end
# :stopdoc:
#
- # source://minitest//lib/minitest.rb#790
+ # source://minitest//lib/minitest.rb#832
def sync; end
# :stopdoc:
#
- # source://minitest//lib/minitest.rb#790
+ # source://minitest//lib/minitest.rb#832
def sync=(_arg0); end
- # source://minitest//lib/minitest.rb#839
+ # source://minitest//lib/minitest.rb#881
def to_s; end
end
@@ -2022,7 +2080,7 @@ module Minitest::Test::LifecycleHooks
# end
# end
#
- # class MiniTest::Test
+ # class Minitest::Test
# include MyMinitestPlugin
# end
#
@@ -2062,54 +2120,37 @@ 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#947
+# source://minitest//lib/minitest.rb#989
class Minitest::UnexpectedError < ::Minitest::Assertion
+ include ::Minitest::Compress
+
# @return [UnexpectedError] a new instance of UnexpectedError
#
- # source://minitest//lib/minitest.rb#951
+ # source://minitest//lib/minitest.rb#995
def initialize(error); end
- # source://minitest//lib/minitest.rb#956
+ # source://minitest//lib/minitest.rb#1008
def backtrace; end
# TODO: figure out how to use `cause` instead
#
- # source://minitest//lib/minitest.rb#949
+ # source://minitest//lib/minitest.rb#993
def error; end
# TODO: figure out how to use `cause` instead
#
- # source://minitest//lib/minitest.rb#949
+ # source://minitest//lib/minitest.rb#993
def error=(_arg0); end
- # source://minitest//lib/minitest.rb#960
+ # source://minitest//lib/minitest.rb#1014
def message; end
- # source://minitest//lib/minitest.rb#965
+ # source://minitest//lib/minitest.rb#1020
def result_label; end
end
-# source://minitest//lib/minitest/unit.rb#20
-class Minitest::Unit
- class << self
- # source://minitest//lib/minitest/unit.rb#36
- def after_tests(&b); end
-
- # source://minitest//lib/minitest/unit.rb#30
- def autorun; end
- end
-end
-
-# source://minitest//lib/minitest/unit.rb#22
-class Minitest::Unit::TestCase < ::Minitest::Test
- class << self
- # source://minitest//lib/minitest/unit.rb#23
- def inherited(klass); end
- end
-end
-
-# source://minitest//lib/minitest/unit.rb#21
-Minitest::Unit::VERSION = T.let(T.unsafe(nil), String)
+# source://minitest//lib/minitest.rb#1012
+Minitest::UnexpectedError::BASE_RE = T.let(T.unsafe(nil), Regexp)
# source://minitest//lib/minitest.rb#12
Minitest::VERSION = T.let(T.unsafe(nil), String)
@@ -2148,6 +2189,6 @@ class Object < ::BasicObject
# NOTE: keyword args in callables are NOT checked for correctness
# against the existing method. Too many edge cases to be worth it.
#
- # source://minitest//lib/minitest/mock.rb#278
+ # source://minitest//lib/minitest/mock.rb#280
def stub(name, val_or_callable, *block_args, **block_kwargs, &block); end
end
diff --git a/sorbet/rbi/gems/parallel@1.23.0.rbi b/sorbet/rbi/gems/parallel@1.24.0.rbi
similarity index 95%
rename from sorbet/rbi/gems/parallel@1.23.0.rbi
rename to sorbet/rbi/gems/parallel@1.24.0.rbi
index c8b319a..5dd7375 100644
--- a/sorbet/rbi/gems/parallel@1.23.0.rbi
+++ b/sorbet/rbi/gems/parallel@1.24.0.rbi
@@ -78,7 +78,14 @@ module Parallel
# source://parallel//lib/parallel.rb#642
def instrument_finish(item, index, result, options); end
- # source://parallel//lib/parallel.rb#647
+ # yield results in the order of the input items
+ # needs to use `options` to store state between executions
+ # needs to use `done` index since a nil result would also be valid
+ #
+ # source://parallel//lib/parallel.rb#651
+ def instrument_finish_in_order(item, index, result, options); end
+
+ # source://parallel//lib/parallel.rb#671
def instrument_start(item, index, options); end
# source://parallel//lib/parallel.rb#590
diff --git a/sorbet/rbi/gems/parser@3.2.2.4.rbi b/sorbet/rbi/gems/parser@3.3.0.4.rbi
similarity index 92%
rename from sorbet/rbi/gems/parser@3.2.2.4.rbi
rename to sorbet/rbi/gems/parser@3.3.0.4.rbi
index ac559e2..0acdc76 100644
--- a/sorbet/rbi/gems/parser@3.2.2.4.rbi
+++ b/sorbet/rbi/gems/parser@3.3.0.4.rbi
@@ -869,7 +869,7 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#243
def initialize; end
- # source://parser//lib/parser/builders/default.rb#690
+ # source://parser//lib/parser/builders/default.rb#703
def __ENCODING__(__ENCODING__t); end
# source://parser//lib/parser/builders/default.rb#348
@@ -878,79 +878,79 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#312
def __LINE__(__LINE__t); end
- # source://parser//lib/parser/builders/default.rb#616
+ # source://parser//lib/parser/builders/default.rb#622
def accessible(node); end
- # source://parser//lib/parser/builders/default.rb#865
+ # source://parser//lib/parser/builders/default.rb#878
def alias(alias_t, to, from); end
- # source://parser//lib/parser/builders/default.rb#904
+ # source://parser//lib/parser/builders/default.rb#917
def arg(name_t); end
- # source://parser//lib/parser/builders/default.rb#994
+ # source://parser//lib/parser/builders/default.rb#1007
def arg_expr(expr); end
- # source://parser//lib/parser/builders/default.rb#874
+ # source://parser//lib/parser/builders/default.rb#887
def args(begin_t, args, end_t, check_args = T.unsafe(nil)); end
# source://parser//lib/parser/builders/default.rb#440
def array(begin_t, elements, end_t); end
- # source://parser//lib/parser/builders/default.rb#1577
+ # source://parser//lib/parser/builders/default.rb#1590
def array_pattern(lbrack_t, elements, rbrack_t); end
- # source://parser//lib/parser/builders/default.rb#754
+ # source://parser//lib/parser/builders/default.rb#767
def assign(lhs, eql_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#699
+ # source://parser//lib/parser/builders/default.rb#712
def assignable(node); end
# source://parser//lib/parser/builders/default.rb#540
def associate(begin_t, pairs, end_t); end
- # source://parser//lib/parser/builders/default.rb#1158
+ # source://parser//lib/parser/builders/default.rb#1171
def attr_asgn(receiver, dot_t, selector_t); end
- # source://parser//lib/parser/builders/default.rb#606
+ # source://parser//lib/parser/builders/default.rb#612
def back_ref(token); end
- # source://parser//lib/parser/builders/default.rb#1422
+ # source://parser//lib/parser/builders/default.rb#1435
def begin(begin_t, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#1364
+ # source://parser//lib/parser/builders/default.rb#1377
def begin_body(compound_stmt, rescue_bodies = T.unsafe(nil), else_t = T.unsafe(nil), else_ = T.unsafe(nil), ensure_t = T.unsafe(nil), ensure_ = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1440
+ # source://parser//lib/parser/builders/default.rb#1453
def begin_keyword(begin_t, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#1192
+ # source://parser//lib/parser/builders/default.rb#1205
def binary_op(receiver, operator_t, arg); end
- # source://parser//lib/parser/builders/default.rb#1109
+ # source://parser//lib/parser/builders/default.rb#1122
def block(method_call, begin_t, args, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#1144
+ # source://parser//lib/parser/builders/default.rb#1157
def block_pass(amper_t, arg); end
- # source://parser//lib/parser/builders/default.rb#969
+ # source://parser//lib/parser/builders/default.rb#982
def blockarg(amper_t, name_t); end
- # source://parser//lib/parser/builders/default.rb#1014
+ # source://parser//lib/parser/builders/default.rb#1027
def blockarg_expr(amper_t, expr); end
- # source://parser//lib/parser/builders/default.rb#1100
+ # source://parser//lib/parser/builders/default.rb#1113
def call_lambda(lambda_t); end
- # source://parser//lib/parser/builders/default.rb#1083
+ # source://parser//lib/parser/builders/default.rb#1096
def call_method(receiver, dot_t, selector_t, lparen_t = T.unsafe(nil), args = T.unsafe(nil), rparen_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1055
+ # source://parser//lib/parser/builders/default.rb#1068
def call_type_for_dot(dot_t); end
- # source://parser//lib/parser/builders/default.rb#1297
+ # source://parser//lib/parser/builders/default.rb#1310
def case(case_t, expr, when_bodies, else_t, else_body, end_t); end
- # source://parser//lib/parser/builders/default.rb#1460
+ # source://parser//lib/parser/builders/default.rb#1473
def case_match(case_t, expr, in_bodies, else_t, else_body, end_t); end
# source://parser//lib/parser/builders/default.rb#343
@@ -959,55 +959,55 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#284
def complex(complex_t); end
- # source://parser//lib/parser/builders/default.rb#1410
+ # source://parser//lib/parser/builders/default.rb#1423
def compstmt(statements); end
- # source://parser//lib/parser/builders/default.rb#1273
+ # source://parser//lib/parser/builders/default.rb#1286
def condition(cond_t, cond, then_t, if_true, else_t, if_false, end_t); end
- # source://parser//lib/parser/builders/default.rb#1279
+ # source://parser//lib/parser/builders/default.rb#1292
def condition_mod(if_true, if_false, cond_t, cond); end
- # source://parser//lib/parser/builders/default.rb#673
+ # source://parser//lib/parser/builders/default.rb#686
def const(name_t); end
- # source://parser//lib/parser/builders/default.rb#685
+ # source://parser//lib/parser/builders/default.rb#698
def const_fetch(scope, t_colon2, name_t); end
- # source://parser//lib/parser/builders/default.rb#678
+ # source://parser//lib/parser/builders/default.rb#691
def const_global(t_colon3, name_t); end
- # source://parser//lib/parser/builders/default.rb#750
+ # source://parser//lib/parser/builders/default.rb#763
def const_op_assignable(node); end
- # source://parser//lib/parser/builders/default.rb#1607
+ # source://parser//lib/parser/builders/default.rb#1620
def const_pattern(const, ldelim_t, pattern, rdelim_t); end
- # source://parser//lib/parser/builders/default.rb#601
+ # source://parser//lib/parser/builders/default.rb#607
def cvar(token); end
# source://parser//lib/parser/builders/default.rb#388
def dedent_string(node, dedent_level); end
- # source://parser//lib/parser/builders/default.rb#801
+ # source://parser//lib/parser/builders/default.rb#814
def def_class(class_t, name, lt_t, superclass, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#832
+ # source://parser//lib/parser/builders/default.rb#845
def def_endless_method(def_t, name_t, args, assignment_t, body); end
- # source://parser//lib/parser/builders/default.rb#850
+ # source://parser//lib/parser/builders/default.rb#863
def def_endless_singleton(def_t, definee, dot_t, name_t, args, assignment_t, body); end
- # source://parser//lib/parser/builders/default.rb#824
+ # source://parser//lib/parser/builders/default.rb#837
def def_method(def_t, name_t, args, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#814
+ # source://parser//lib/parser/builders/default.rb#827
def def_module(module_t, name, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#808
+ # source://parser//lib/parser/builders/default.rb#821
def def_sclass(class_t, lshft_t, expr, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#840
+ # source://parser//lib/parser/builders/default.rb#853
def def_singleton(def_t, definee, dot_t, name_t, args, body, end_t); end
# source://parser//lib/parser/builders/default.rb#237
@@ -1019,52 +1019,52 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#265
def false(false_t); end
- # source://parser//lib/parser/builders/default.rb#1598
+ # source://parser//lib/parser/builders/default.rb#1611
def find_pattern(lbrack_t, elements, rbrack_t); end
# source://parser//lib/parser/builders/default.rb#276
def float(float_t); end
- # source://parser//lib/parser/builders/default.rb#1318
+ # source://parser//lib/parser/builders/default.rb#1331
def for(for_t, iterator, in_t, iteratee, do_t, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#900
+ # source://parser//lib/parser/builders/default.rb#913
def forward_arg(dots_t); end
- # source://parser//lib/parser/builders/default.rb#890
+ # source://parser//lib/parser/builders/default.rb#903
def forward_only_args(begin_t, dots_t, end_t); end
- # source://parser//lib/parser/builders/default.rb#1071
+ # source://parser//lib/parser/builders/default.rb#1084
def forwarded_args(dots_t); end
- # source://parser//lib/parser/builders/default.rb#1079
+ # source://parser//lib/parser/builders/default.rb#1092
def forwarded_kwrestarg(dstar_t); end
- # source://parser//lib/parser/builders/default.rb#1075
+ # source://parser//lib/parser/builders/default.rb#1088
def forwarded_restarg(star_t); end
# source://parser//lib/parser/builders/default.rb#596
def gvar(token); end
- # source://parser//lib/parser/builders/default.rb#1571
+ # source://parser//lib/parser/builders/default.rb#1584
def hash_pattern(lbrace_t, kwargs, rbrace_t); end
# source://parser//lib/parser/builders/default.rb#586
def ident(token); end
- # source://parser//lib/parser/builders/default.rb#1487
+ # source://parser//lib/parser/builders/default.rb#1500
def if_guard(if_t, if_body); end
- # source://parser//lib/parser/builders/default.rb#1466
+ # source://parser//lib/parser/builders/default.rb#1479
def in_match(lhs, in_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#1481
+ # source://parser//lib/parser/builders/default.rb#1494
def in_pattern(in_t, pattern, guard, then_t, body); end
- # source://parser//lib/parser/builders/default.rb#1167
+ # source://parser//lib/parser/builders/default.rb#1180
def index(receiver, lbrack_t, indexes, rbrack_t); end
- # source://parser//lib/parser/builders/default.rb#1181
+ # source://parser//lib/parser/builders/default.rb#1194
def index_asgn(receiver, lbrack_t, indexes, rbrack_t); end
# source://parser//lib/parser/builders/default.rb#272
@@ -1073,103 +1073,103 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#591
def ivar(token); end
- # source://parser//lib/parser/builders/default.rb#1326
+ # source://parser//lib/parser/builders/default.rb#1339
def keyword_cmd(type, keyword_t, lparen_t = T.unsafe(nil), args = T.unsafe(nil), rparen_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#931
+ # source://parser//lib/parser/builders/default.rb#944
def kwarg(name_t); end
- # source://parser//lib/parser/builders/default.rb#957
+ # source://parser//lib/parser/builders/default.rb#970
def kwnilarg(dstar_t, nil_t); end
- # source://parser//lib/parser/builders/default.rb#938
+ # source://parser//lib/parser/builders/default.rb#951
def kwoptarg(name_t, value); end
- # source://parser//lib/parser/builders/default.rb#945
+ # source://parser//lib/parser/builders/default.rb#958
def kwrestarg(dstar_t, name_t = T.unsafe(nil)); end
# source://parser//lib/parser/builders/default.rb#535
def kwsplat(dstar_t, arg); end
- # source://parser//lib/parser/builders/default.rb#1266
+ # source://parser//lib/parser/builders/default.rb#1279
def logical_op(type, lhs, op_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#1304
+ # source://parser//lib/parser/builders/default.rb#1317
def loop(type, keyword_t, cond, do_t, body, end_t); end
- # source://parser//lib/parser/builders/default.rb#1309
+ # source://parser//lib/parser/builders/default.rb#1322
def loop_mod(type, body, keyword_t, cond); end
- # source://parser//lib/parser/builders/default.rb#1621
+ # source://parser//lib/parser/builders/default.rb#1634
def match_alt(left, pipe_t, right); end
- # source://parser//lib/parser/builders/default.rb#1628
+ # source://parser//lib/parser/builders/default.rb#1641
def match_as(value, assoc_t, as); end
- # source://parser//lib/parser/builders/default.rb#1507
+ # source://parser//lib/parser/builders/default.rb#1520
def match_hash_var(name_t); end
- # source://parser//lib/parser/builders/default.rb#1521
+ # source://parser//lib/parser/builders/default.rb#1534
def match_hash_var_from_str(begin_t, strings, end_t); end
- # source://parser//lib/parser/builders/default.rb#1659
+ # source://parser//lib/parser/builders/default.rb#1672
def match_label(label_type, label); end
- # source://parser//lib/parser/builders/default.rb#1635
+ # source://parser//lib/parser/builders/default.rb#1648
def match_nil_pattern(dstar_t, nil_t); end
- # source://parser//lib/parser/builders/default.rb#1214
+ # source://parser//lib/parser/builders/default.rb#1227
def match_op(receiver, match_t, arg); end
- # source://parser//lib/parser/builders/default.rb#1640
+ # source://parser//lib/parser/builders/default.rb#1653
def match_pair(label_type, label, value); end
- # source://parser//lib/parser/builders/default.rb#1471
+ # source://parser//lib/parser/builders/default.rb#1484
def match_pattern(lhs, match_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#1476
+ # source://parser//lib/parser/builders/default.rb#1489
def match_pattern_p(lhs, match_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#1560
+ # source://parser//lib/parser/builders/default.rb#1573
def match_rest(star_t, name_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1495
+ # source://parser//lib/parser/builders/default.rb#1508
def match_var(name_t); end
- # source://parser//lib/parser/builders/default.rb#1603
+ # source://parser//lib/parser/builders/default.rb#1616
def match_with_trailing_comma(match, comma_t); end
- # source://parser//lib/parser/builders/default.rb#792
+ # source://parser//lib/parser/builders/default.rb#805
def multi_assign(lhs, eql_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#787
+ # source://parser//lib/parser/builders/default.rb#800
def multi_lhs(begin_t, items, end_t); end
# source://parser//lib/parser/builders/default.rb#255
def nil(nil_t); end
- # source://parser//lib/parser/builders/default.rb#1242
+ # source://parser//lib/parser/builders/default.rb#1255
def not_op(not_t, begin_t = T.unsafe(nil), receiver = T.unsafe(nil), end_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#611
+ # source://parser//lib/parser/builders/default.rb#617
def nth_ref(token); end
- # source://parser//lib/parser/builders/default.rb#886
+ # source://parser//lib/parser/builders/default.rb#899
def numargs(max_numparam); end
- # source://parser//lib/parser/builders/default.rb#1025
+ # source://parser//lib/parser/builders/default.rb#1038
def objc_kwarg(kwname_t, assoc_t, name_t); end
- # source://parser//lib/parser/builders/default.rb#1039
+ # source://parser//lib/parser/builders/default.rb#1052
def objc_restarg(star_t, name = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1149
+ # source://parser//lib/parser/builders/default.rb#1162
def objc_varargs(pair, rest_of_varargs); end
- # source://parser//lib/parser/builders/default.rb#761
+ # source://parser//lib/parser/builders/default.rb#774
def op_assign(lhs, op_t, rhs); end
- # source://parser//lib/parser/builders/default.rb#911
+ # source://parser//lib/parser/builders/default.rb#924
def optarg(name_t, eql_t, value); end
# source://parser//lib/parser/builders/default.rb#488
@@ -1193,16 +1193,16 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#225
def parser=(_arg0); end
- # source://parser//lib/parser/builders/default.rb#1616
+ # source://parser//lib/parser/builders/default.rb#1629
def pin(pin_t, var); end
- # source://parser//lib/parser/builders/default.rb#1349
+ # source://parser//lib/parser/builders/default.rb#1362
def postexe(postexe_t, lbrace_t, compstmt, rbrace_t); end
- # source://parser//lib/parser/builders/default.rb#1344
+ # source://parser//lib/parser/builders/default.rb#1357
def preexe(preexe_t, lbrace_t, compstmt, rbrace_t); end
- # source://parser//lib/parser/builders/default.rb#979
+ # source://parser//lib/parser/builders/default.rb#992
def procarg0(arg); end
# source://parser//lib/parser/builders/default.rb#572
@@ -1220,19 +1220,19 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#417
def regexp_options(regopt_t); end
- # source://parser//lib/parser/builders/default.rb#1356
+ # source://parser//lib/parser/builders/default.rb#1369
def rescue_body(rescue_t, exc_list, assoc_t, exc_var, then_t, compound_stmt); end
- # source://parser//lib/parser/builders/default.rb#920
+ # source://parser//lib/parser/builders/default.rb#933
def restarg(star_t, name_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1003
+ # source://parser//lib/parser/builders/default.rb#1016
def restarg_expr(star_t, expr = T.unsafe(nil)); end
# source://parser//lib/parser/builders/default.rb#581
def self(token); end
- # source://parser//lib/parser/builders/default.rb#962
+ # source://parser//lib/parser/builders/default.rb#975
def shadowarg(name_t); end
# source://parser//lib/parser/builders/default.rb#445
@@ -1259,7 +1259,7 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#469
def symbols_compose(begin_t, parts, end_t); end
- # source://parser//lib/parser/builders/default.rb#1284
+ # source://parser//lib/parser/builders/default.rb#1297
def ternary(cond, question_t, if_true, colon_t, if_false); end
# source://parser//lib/parser/builders/default.rb#260
@@ -1268,16 +1268,16 @@ class Parser::Builders::Default
# source://parser//lib/parser/builders/default.rb#294
def unary_num(unary_t, numeric); end
- # source://parser//lib/parser/builders/default.rb#1230
+ # source://parser//lib/parser/builders/default.rb#1243
def unary_op(op_t, receiver); end
- # source://parser//lib/parser/builders/default.rb#860
+ # source://parser//lib/parser/builders/default.rb#873
def undef_method(undef_t, names); end
- # source://parser//lib/parser/builders/default.rb#1491
+ # source://parser//lib/parser/builders/default.rb#1504
def unless_guard(unless_t, unless_body); end
- # source://parser//lib/parser/builders/default.rb#1291
+ # source://parser//lib/parser/builders/default.rb#1304
def when(when_t, patterns, then_t, body); end
# source://parser//lib/parser/builders/default.rb#455
@@ -1291,184 +1291,184 @@ class Parser::Builders::Default
private
- # source://parser//lib/parser/builders/default.rb#1808
+ # source://parser//lib/parser/builders/default.rb#1821
def arg_name_collides?(this_name, that_name); end
- # source://parser//lib/parser/builders/default.rb#2004
+ # source://parser//lib/parser/builders/default.rb#2017
def arg_prefix_map(op_t, name_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1978
+ # source://parser//lib/parser/builders/default.rb#1991
def binary_op_map(left_e, op_t, right_e); end
- # source://parser//lib/parser/builders/default.rb#2106
+ # source://parser//lib/parser/builders/default.rb#2119
def block_map(receiver_l, begin_t, end_t); end
- # source://parser//lib/parser/builders/default.rb#1783
+ # source://parser//lib/parser/builders/default.rb#1796
def check_assignment_to_numparam(name, loc); end
- # source://parser//lib/parser/builders/default.rb#1675
+ # source://parser//lib/parser/builders/default.rb#1688
def check_condition(cond); end
- # source://parser//lib/parser/builders/default.rb#1754
+ # source://parser//lib/parser/builders/default.rb#1767
def check_duplicate_arg(this_arg, map = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1729
+ # source://parser//lib/parser/builders/default.rb#1742
def check_duplicate_args(args, map = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1841
+ # source://parser//lib/parser/builders/default.rb#1854
def check_duplicate_pattern_key(name, loc); end
- # source://parser//lib/parser/builders/default.rb#1831
+ # source://parser//lib/parser/builders/default.rb#1844
def check_duplicate_pattern_variable(name, loc); end
- # source://parser//lib/parser/builders/default.rb#1823
+ # source://parser//lib/parser/builders/default.rb#1836
def check_lvar_name(name, loc); end
- # source://parser//lib/parser/builders/default.rb#1798
+ # source://parser//lib/parser/builders/default.rb#1811
def check_reserved_for_numparam(name, loc); end
- # source://parser//lib/parser/builders/default.rb#2263
+ # source://parser//lib/parser/builders/default.rb#2280
def collapse_string_parts?(parts); end
- # source://parser//lib/parser/builders/default.rb#1929
+ # source://parser//lib/parser/builders/default.rb#1942
def collection_map(begin_t, parts, end_t); end
- # source://parser//lib/parser/builders/default.rb#2133
+ # source://parser//lib/parser/builders/default.rb#2146
def condition_map(keyword_t, cond_e, begin_t, body_e, else_t, else_e, end_t); end
- # source://parser//lib/parser/builders/default.rb#1964
+ # source://parser//lib/parser/builders/default.rb#1977
def constant_map(scope, colon2_t, name_t); end
- # source://parser//lib/parser/builders/default.rb#2037
+ # source://parser//lib/parser/builders/default.rb#2050
def definition_map(keyword_t, operator_t, name_t, end_t); end
- # source://parser//lib/parser/builders/default.rb#1870
+ # source://parser//lib/parser/builders/default.rb#1883
def delimited_string_map(string_t); end
- # source://parser//lib/parser/builders/default.rb#2285
+ # source://parser//lib/parser/builders/default.rb#2302
def diagnostic(type, reason, arguments, location, highlights = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#2177
+ # source://parser//lib/parser/builders/default.rb#2190
def eh_keyword_map(compstmt_e, keyword_t, body_es, else_t, else_e); end
- # source://parser//lib/parser/builders/default.rb#2043
+ # source://parser//lib/parser/builders/default.rb#2056
def endless_definition_map(keyword_t, operator_t, name_t, assignment_t, body_e); end
- # source://parser//lib/parser/builders/default.rb#1925
+ # source://parser//lib/parser/builders/default.rb#1938
def expr_map(loc); end
- # source://parser//lib/parser/builders/default.rb#2158
+ # source://parser//lib/parser/builders/default.rb#2171
def for_map(keyword_t, in_t, begin_t, end_t); end
- # source://parser//lib/parser/builders/default.rb#2205
+ # source://parser//lib/parser/builders/default.rb#2218
def guard_map(keyword_t, guard_body_e); end
- # source://parser//lib/parser/builders/default.rb#2095
+ # source://parser//lib/parser/builders/default.rb#2108
def index_map(receiver_e, lbrack_t, rbrack_t); end
- # source://parser//lib/parser/builders/default.rb#1861
+ # source://parser//lib/parser/builders/default.rb#1874
def join_exprs(left_expr, right_expr); end
- # source://parser//lib/parser/builders/default.rb#2111
+ # source://parser//lib/parser/builders/default.rb#2124
def keyword_map(keyword_t, begin_t, args, end_t); end
- # source://parser//lib/parser/builders/default.rb#2128
+ # source://parser//lib/parser/builders/default.rb#2141
def keyword_mod_map(pre_e, keyword_t, post_e); end
- # source://parser//lib/parser/builders/default.rb#2014
+ # source://parser//lib/parser/builders/default.rb#2027
def kwarg_map(name_t, value_e = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#2316
+ # source://parser//lib/parser/builders/default.rb#2333
def kwargs?(node); end
- # source://parser//lib/parser/builders/default.rb#2280
+ # source://parser//lib/parser/builders/default.rb#2297
def loc(token); end
- # source://parser//lib/parser/builders/default.rb#2027
+ # source://parser//lib/parser/builders/default.rb#2040
def module_definition_map(keyword_t, name_e, operator_t, end_t); end
- # source://parser//lib/parser/builders/default.rb#1853
+ # source://parser//lib/parser/builders/default.rb#1866
def n(type, children, source_map); end
- # source://parser//lib/parser/builders/default.rb#1857
+ # source://parser//lib/parser/builders/default.rb#1870
def n0(type, source_map); end
# source://parser//lib/parser/builders/default.rb#288
def numeric(kind, token); end
- # source://parser//lib/parser/builders/default.rb#1895
+ # source://parser//lib/parser/builders/default.rb#1908
def pair_keyword_map(key_t, value_e); end
- # source://parser//lib/parser/builders/default.rb#1910
+ # source://parser//lib/parser/builders/default.rb#1923
def pair_quoted_map(begin_t, end_t, value_e); end
- # source://parser//lib/parser/builders/default.rb#1881
+ # source://parser//lib/parser/builders/default.rb#1894
def prefix_string_map(symbol); end
- # source://parser//lib/parser/builders/default.rb#1992
+ # source://parser//lib/parser/builders/default.rb#2005
def range_map(start_e, op_t, end_e); end
- # source://parser//lib/parser/builders/default.rb#1959
+ # source://parser//lib/parser/builders/default.rb#1972
def regexp_map(begin_t, end_t, options_e); end
- # source://parser//lib/parser/builders/default.rb#2164
+ # source://parser//lib/parser/builders/default.rb#2177
def rescue_body_map(keyword_t, exc_list_e, assoc_t, exc_var_e, then_t, compstmt_e); end
- # source://parser//lib/parser/builders/default.rb#2306
+ # source://parser//lib/parser/builders/default.rb#2323
def rewrite_hash_args_to_kwargs(args); end
- # source://parser//lib/parser/builders/default.rb#2077
+ # source://parser//lib/parser/builders/default.rb#2090
def send_binary_op_map(lhs_e, selector_t, rhs_e); end
- # source://parser//lib/parser/builders/default.rb#2100
+ # source://parser//lib/parser/builders/default.rb#2113
def send_index_map(receiver_e, lbrack_t, rbrack_t); end
- # source://parser//lib/parser/builders/default.rb#2051
+ # source://parser//lib/parser/builders/default.rb#2064
def send_map(receiver_e, dot_t, selector_t, begin_t = T.unsafe(nil), args = T.unsafe(nil), end_t = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#2083
+ # source://parser//lib/parser/builders/default.rb#2096
def send_unary_op_map(selector_t, arg_e); end
- # source://parser//lib/parser/builders/default.rb#2236
+ # source://parser//lib/parser/builders/default.rb#2249
def static_regexp(parts, options); end
- # source://parser//lib/parser/builders/default.rb#2256
+ # source://parser//lib/parser/builders/default.rb#2269
def static_regexp_node(node); end
- # source://parser//lib/parser/builders/default.rb#2219
+ # source://parser//lib/parser/builders/default.rb#2232
def static_string(nodes); end
- # source://parser//lib/parser/builders/default.rb#1945
+ # source://parser//lib/parser/builders/default.rb#1958
def string_map(begin_t, parts, end_t); end
- # source://parser//lib/parser/builders/default.rb#2272
+ # source://parser//lib/parser/builders/default.rb#2289
def string_value(token); end
- # source://parser//lib/parser/builders/default.rb#2153
+ # source://parser//lib/parser/builders/default.rb#2166
def ternary_map(begin_e, question_t, mid_e, colon_t, end_e); end
- # source://parser//lib/parser/builders/default.rb#1866
+ # source://parser//lib/parser/builders/default.rb#1879
def token_map(token); end
- # source://parser//lib/parser/builders/default.rb#1982
+ # source://parser//lib/parser/builders/default.rb#1995
def unary_op_map(op_t, arg_e = T.unsafe(nil)); end
- # source://parser//lib/parser/builders/default.rb#1890
+ # source://parser//lib/parser/builders/default.rb#1903
def unquoted_map(token); end
- # source://parser//lib/parser/builders/default.rb#2294
+ # source://parser//lib/parser/builders/default.rb#2311
def validate_definee(definee); end
- # source://parser//lib/parser/builders/default.rb#1768
+ # source://parser//lib/parser/builders/default.rb#1781
def validate_no_forward_arg_after_restarg(args); end
- # source://parser//lib/parser/builders/default.rb#2268
+ # source://parser//lib/parser/builders/default.rb#2285
def value(token); end
- # source://parser//lib/parser/builders/default.rb#2071
+ # source://parser//lib/parser/builders/default.rb#2084
def var_send_map(variable_e); end
- # source://parser//lib/parser/builders/default.rb#1974
+ # source://parser//lib/parser/builders/default.rb#1987
def variable_map(name_t); end
class << self
@@ -2080,69 +2080,69 @@ class Parser::Lexer
protected
- # source://parser//lib/parser/lexer-F1.rb#14631
+ # source://parser//lib/parser/lexer-F1.rb#14692
def arg_or_cmdarg(cmd_state); end
- # source://parser//lib/parser/lexer-F1.rb#14693
+ # source://parser//lib/parser/lexer-F1.rb#14754
def check_ambiguous_slash(tm); end
- # source://parser//lib/parser/lexer-F1.rb#14655
+ # source://parser//lib/parser/lexer-F1.rb#14716
def diagnostic(type, reason, arguments = T.unsafe(nil), location = T.unsafe(nil), highlights = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14661
+ # source://parser//lib/parser/lexer-F1.rb#14722
def e_lbrace; end
- # source://parser//lib/parser/lexer-F1.rb#14605
+ # source://parser//lib/parser/lexer-F1.rb#14666
def emit(type, value = T.unsafe(nil), s = T.unsafe(nil), e = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14714
+ # source://parser//lib/parser/lexer-F1.rb#14775
def emit_class_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14742
+ # source://parser//lib/parser/lexer-F1.rb#14803
def emit_colon_with_digits(p, tm, diag_msg); end
- # source://parser//lib/parser/lexer-F1.rb#14639
+ # source://parser//lib/parser/lexer-F1.rb#14700
def emit_comment(s = T.unsafe(nil), e = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14651
+ # source://parser//lib/parser/lexer-F1.rb#14712
def emit_comment_from_range(p, pe); end
- # source://parser//lib/parser/lexer-F1.rb#14621
+ # source://parser//lib/parser/lexer-F1.rb#14682
def emit_do(do_block = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14704
+ # source://parser//lib/parser/lexer-F1.rb#14765
def emit_global_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14722
+ # source://parser//lib/parser/lexer-F1.rb#14783
def emit_instance_var(ts = T.unsafe(nil), te = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14730
+ # source://parser//lib/parser/lexer-F1.rb#14791
def emit_rbrace_rparen_rbrack; end
- # source://parser//lib/parser/lexer-F1.rb#14752
+ # source://parser//lib/parser/lexer-F1.rb#14813
def emit_singleton_class; end
- # source://parser//lib/parser/lexer-F1.rb#14615
+ # source://parser//lib/parser/lexer-F1.rb#14676
def emit_table(table, s = T.unsafe(nil), e = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14670
+ # source://parser//lib/parser/lexer-F1.rb#14731
def numeric_literal_int; end
- # source://parser//lib/parser/lexer-F1.rb#14689
+ # source://parser//lib/parser/lexer-F1.rb#14750
def on_newline(p); end
- # source://parser//lib/parser/lexer-F1.rb#14601
+ # source://parser//lib/parser/lexer-F1.rb#14662
def range(s = T.unsafe(nil), e = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer-F1.rb#14592
+ # source://parser//lib/parser/lexer-F1.rb#14653
def stack_pop; end
- # source://parser//lib/parser/lexer-F1.rb#14597
+ # source://parser//lib/parser/lexer-F1.rb#14658
def tok(s = T.unsafe(nil), e = T.unsafe(nil)); end
# @return [Boolean]
#
- # source://parser//lib/parser/lexer-F1.rb#14588
+ # source://parser//lib/parser/lexer-F1.rb#14649
def version?(*versions); end
class << self
@@ -2489,13 +2489,13 @@ end
# source://parser//lib/parser/lexer/dedenter.rb#7
Parser::Lexer::Dedenter::TAB_WIDTH = T.let(T.unsafe(nil), Integer)
-# source://parser//lib/parser/lexer-F1.rb#14799
+# source://parser//lib/parser/lexer-F1.rb#14860
Parser::Lexer::ESCAPE_WHITESPACE = T.let(T.unsafe(nil), Hash)
-# source://parser//lib/parser/lexer-F1.rb#14785
+# source://parser//lib/parser/lexer-F1.rb#14846
Parser::Lexer::KEYWORDS = T.let(T.unsafe(nil), Hash)
-# source://parser//lib/parser/lexer-F1.rb#14792
+# source://parser//lib/parser/lexer-F1.rb#14853
Parser::Lexer::KEYWORDS_BEGIN = T.let(T.unsafe(nil), Hash)
# source://parser//lib/parser/lexer-F1.rb#8362
@@ -2503,108 +2503,114 @@ Parser::Lexer::LEX_STATES = T.let(T.unsafe(nil), Hash)
# source://parser//lib/parser/lexer/literal.rb#6
class Parser::Lexer::Literal
- # source://parser//lib/parser/lexer/literal.rb#40
+ # source://parser//lib/parser/lexer/literal.rb#42
def initialize(lexer, str_type, delimiter, str_s, heredoc_e = T.unsafe(nil), indent = T.unsafe(nil), dedent_body = T.unsafe(nil), label_allowed = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer/literal.rb#114
+ # source://parser//lib/parser/lexer/literal.rb#116
def backslash_delimited?; end
- # source://parser//lib/parser/lexer/literal.rb#37
+ # source://parser//lib/parser/lexer/literal.rb#39
def dedent_level; end
- # source://parser//lib/parser/lexer/literal.rb#189
+ # source://parser//lib/parser/lexer/literal.rb#191
def end_interp_brace_and_try_closing; end
- # source://parser//lib/parser/lexer/literal.rb#216
+ # source://parser//lib/parser/lexer/literal.rb#218
def extend_content; end
- # source://parser//lib/parser/lexer/literal.rb#220
+ # source://parser//lib/parser/lexer/literal.rb#222
def extend_space(ts, te); end
- # source://parser//lib/parser/lexer/literal.rb#195
+ # source://parser//lib/parser/lexer/literal.rb#197
def extend_string(string, ts, te); end
- # source://parser//lib/parser/lexer/literal.rb#202
+ # source://parser//lib/parser/lexer/literal.rb#204
def flush_string; end
- # source://parser//lib/parser/lexer/literal.rb#102
+ # source://parser//lib/parser/lexer/literal.rb#104
def heredoc?; end
- # source://parser//lib/parser/lexer/literal.rb#37
+ # source://parser//lib/parser/lexer/literal.rb#39
def heredoc_e; end
- # source://parser//lib/parser/lexer/literal.rb#166
+ # source://parser//lib/parser/lexer/literal.rb#168
def infer_indent_level(line); end
- # source://parser//lib/parser/lexer/literal.rb#89
+ # source://parser//lib/parser/lexer/literal.rb#91
def interpolate?; end
- # source://parser//lib/parser/lexer/literal.rb#122
+ # source://parser//lib/parser/lexer/literal.rb#124
def munge_escape?(character); end
- # source://parser//lib/parser/lexer/literal.rb#132
+ # source://parser//lib/parser/lexer/literal.rb#134
def nest_and_try_closing(delimiter, ts, te, lookahead = T.unsafe(nil)); end
- # source://parser//lib/parser/lexer/literal.rb#106
+ # source://parser//lib/parser/lexer/literal.rb#108
def plain_heredoc?; end
- # source://parser//lib/parser/lexer/literal.rb#98
+ # source://parser//lib/parser/lexer/literal.rb#100
def regexp?; end
- # source://parser//lib/parser/lexer/literal.rb#38
+ # source://parser//lib/parser/lexer/literal.rb#40
def saved_herebody_s; end
- # source://parser//lib/parser/lexer/literal.rb#38
+ # source://parser//lib/parser/lexer/literal.rb#40
def saved_herebody_s=(_arg0); end
- # source://parser//lib/parser/lexer/literal.rb#110
+ # source://parser//lib/parser/lexer/literal.rb#112
def squiggly_heredoc?; end
- # source://parser//lib/parser/lexer/literal.rb#185
+ # source://parser//lib/parser/lexer/literal.rb#187
def start_interp_brace; end
- # source://parser//lib/parser/lexer/literal.rb#37
+ # source://parser//lib/parser/lexer/literal.rb#39
def str_s; end
- # source://parser//lib/parser/lexer/literal.rb#230
+ # source://parser//lib/parser/lexer/literal.rb#232
def supports_line_continuation_via_slash?; end
- # source://parser//lib/parser/lexer/literal.rb#118
+ # source://parser//lib/parser/lexer/literal.rb#120
def type; end
- # source://parser//lib/parser/lexer/literal.rb#93
+ # source://parser//lib/parser/lexer/literal.rb#95
def words?; end
protected
- # source://parser//lib/parser/lexer/literal.rb#248
+ # source://parser//lib/parser/lexer/literal.rb#263
def clear_buffer; end
- # source://parser//lib/parser/lexer/literal.rb#244
+ # source://parser//lib/parser/lexer/literal.rb#259
def coerce_encoding(string); end
- # source://parser//lib/parser/lexer/literal.rb#236
+ # source://parser//lib/parser/lexer/literal.rb#238
def delimiter?(delimiter); end
- # source://parser//lib/parser/lexer/literal.rb#264
+ # source://parser//lib/parser/lexer/literal.rb#279
def emit(token, type, s, e); end
- # source://parser//lib/parser/lexer/literal.rb#259
+ # source://parser//lib/parser/lexer/literal.rb#274
def emit_start_tok; end
end
# source://parser//lib/parser/lexer/literal.rb#7
Parser::Lexer::Literal::DELIMITERS = T.let(T.unsafe(nil), Hash)
+# source://parser//lib/parser/lexer/literal.rb#8
+Parser::Lexer::Literal::SPACE = T.let(T.unsafe(nil), Integer)
+
# source://parser//lib/parser/lexer/literal.rb#9
+Parser::Lexer::Literal::TAB = T.let(T.unsafe(nil), Integer)
+
+# source://parser//lib/parser/lexer/literal.rb#11
Parser::Lexer::Literal::TYPES = T.let(T.unsafe(nil), Hash)
# Mapping of strings to parser tokens.
#
-# source://parser//lib/parser/lexer-F1.rb#14759
+# source://parser//lib/parser/lexer-F1.rb#14820
Parser::Lexer::PUNCTUATION = T.let(T.unsafe(nil), Hash)
-# source://parser//lib/parser/lexer-F1.rb#14779
+# source://parser//lib/parser/lexer-F1.rb#14840
Parser::Lexer::PUNCTUATION_BEGIN = T.let(T.unsafe(nil), Hash)
# source://parser//lib/parser/lexer/stack_state.rb#5
@@ -3190,7 +3196,7 @@ Parser::MaxNumparamStack::ORDINARY_PARAMS = T.let(T.unsafe(nil), Integer)
# @api private
#
-# source://parser//lib/parser/messages.rb#107
+# source://parser//lib/parser/messages.rb#112
module Parser::Messages
class << self
# Formats the message, returns a raw template if there's nothing to interpolate
@@ -3200,7 +3206,7 @@ module Parser::Messages
#
# @api private
#
- # source://parser//lib/parser/messages.rb#114
+ # source://parser//lib/parser/messages.rb#119
def compile(reason, arguments); end
end
end
@@ -5218,10 +5224,10 @@ class Parser::StaticEnvironment
# source://parser//lib/parser/static_environment.rb#58
def declare_anonymous_blockarg; end
- # source://parser//lib/parser/static_environment.rb#74
+ # source://parser//lib/parser/static_environment.rb#82
def declare_anonymous_kwrestarg; end
- # source://parser//lib/parser/static_environment.rb#66
+ # source://parser//lib/parser/static_environment.rb#70
def declare_anonymous_restarg; end
# source://parser//lib/parser/static_environment.rb#50
@@ -5239,12 +5245,12 @@ class Parser::StaticEnvironment
# @return [Boolean]
#
- # source://parser//lib/parser/static_environment.rb#78
+ # source://parser//lib/parser/static_environment.rb#86
def declared_anonymous_kwrestarg?; end
# @return [Boolean]
#
- # source://parser//lib/parser/static_environment.rb#70
+ # source://parser//lib/parser/static_environment.rb#74
def declared_anonymous_restarg?; end
# @return [Boolean]
@@ -5254,7 +5260,7 @@ class Parser::StaticEnvironment
# @return [Boolean]
#
- # source://parser//lib/parser/static_environment.rb#82
+ # source://parser//lib/parser/static_environment.rb#94
def empty?; end
# source://parser//lib/parser/static_environment.rb#27
@@ -5263,6 +5269,21 @@ class Parser::StaticEnvironment
# source://parser//lib/parser/static_environment.rb#20
def extend_static; end
+ # @return [Boolean]
+ #
+ # source://parser//lib/parser/static_environment.rb#66
+ def parent_has_anonymous_blockarg?; end
+
+ # @return [Boolean]
+ #
+ # source://parser//lib/parser/static_environment.rb#90
+ def parent_has_anonymous_kwrestarg?; end
+
+ # @return [Boolean]
+ #
+ # source://parser//lib/parser/static_environment.rb#78
+ def parent_has_anonymous_restarg?; end
+
# source://parser//lib/parser/static_environment.rb#15
def reset; end
diff --git a/sorbet/rbi/gems/prism@0.19.0.rbi b/sorbet/rbi/gems/prism@0.19.0.rbi
new file mode 100644
index 0000000..b4e4868
--- /dev/null
+++ b/sorbet/rbi/gems/prism@0.19.0.rbi
@@ -0,0 +1,25199 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `prism` gem.
+# Please instead update this file by running `bin/tapioca gem prism`.
+
+# This file is generated by the templates/template.rb script and should not be
+# modified manually. See templates/lib/prism/visitor.rb.erb
+# if you are looking to modify the template
+module Prism
+ class << self
+ # Mirror the Prism.dump API by using the serialization API.
+ def dump(*_arg0); end
+
+ # Mirror the Prism.dump_file API by using the serialization API.
+ def dump_file(*_arg0); end
+
+ # Mirror the Prism.lex API by using the serialization API.
+ def lex(*_arg0); end
+
+ # :call-seq:
+ # Prism::lex_compat(source, **options) -> ParseResult
+ #
+ # Returns a parse result whose value is an array of tokens that closely
+ # resembles the return value of Ripper::lex. The main difference is that the
+ # `:on_sp` token is not emitted.
+ #
+ # For supported options, see Prism::parse.
+ #
+ # source://prism//prism.rb#46
+ def lex_compat(source, **options); end
+
+ # Mirror the Prism.lex_file API by using the serialization API.
+ def lex_file(*_arg0); end
+
+ # :call-seq:
+ # Prism::lex_ripper(source) -> Array
+ #
+ # This lexes with the Ripper lex. It drops any space events but otherwise
+ # returns the same tokens. Raises SyntaxError if the syntax in source is
+ # invalid.
+ #
+ # source://prism//prism.rb#56
+ def lex_ripper(source); end
+
+ # :call-seq:
+ # Prism::load(source, serialized) -> ParseResult
+ #
+ # Load the serialized AST using the source as a reference into a tree.
+ #
+ # source://prism//prism.rb#64
+ def load(source, serialized); end
+
+ # Mirror the Prism.parse API by using the serialization API.
+ def parse(*_arg0); end
+
+ # Mirror the Prism.parse_comments API by using the serialization API.
+ def parse_comments(*_arg0); end
+
+ # :call-seq:
+ # Prism::parse_failure?(source, **options) -> bool
+ #
+ # Returns true if the source parses with errors.
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism.rb#72
+ def parse_failure?(source, **options); end
+
+ # Mirror the Prism.parse_file API by using the serialization API. This uses
+ # native strings instead of Ruby strings because it allows us to use mmap when
+ # it is available.
+ def parse_file(*_arg0); end
+
+ # Mirror the Prism.parse_file_comments API by using the serialization
+ # API. This uses native strings instead of Ruby strings because it allows us
+ # to use mmap when it is available.
+ def parse_file_comments(*_arg0); end
+
+ # :call-seq:
+ # Prism::parse_file_failure?(filepath, **options) -> bool
+ #
+ # Returns true if the file at filepath parses with errors.
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism.rb#80
+ def parse_file_failure?(filepath, **options); end
+
+ # Mirror the Prism.parse_file_success? API by using the serialization API.
+ #
+ # @return [Boolean]
+ def parse_file_success?(*_arg0); end
+
+ # Mirror the Prism.parse_lex API by using the serialization API.
+ def parse_lex(*_arg0); end
+
+ # Mirror the Prism.parse_lex_file API by using the serialization API.
+ def parse_lex_file(*_arg0); end
+
+ # Mirror the Prism.parse_success? API by using the serialization API.
+ #
+ # @return [Boolean]
+ def parse_success?(*_arg0); end
+ end
+end
+
+# Represents the use of the `alias` keyword to alias a global variable.
+#
+# alias $foo $bar
+# ^^^^^^^^^^^^^^^
+class Prism::AliasGlobalVariableNode < ::Prism::Node
+ # def initialize: (new_name: Node, old_name: Node, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [AliasGlobalVariableNode] a new instance of AliasGlobalVariableNode
+ #
+ # source://prism//prism/node.rb#63
+ def initialize(new_name, old_name, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#71
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#76
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#86
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#81
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AliasGlobalVariableNode
+ #
+ # source://prism//prism/node.rb#91
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#76
+ 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#104
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#114
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#109
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#60
+ def keyword_loc; end
+
+ # attr_reader new_name: Node
+ #
+ # source://prism//prism/node.rb#54
+ def new_name; end
+
+ # attr_reader old_name: Node
+ #
+ # source://prism//prism/node.rb#57
+ def old_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
+ # 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//prism/node.rb#138
+ 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#148
+ def type; end
+ end
+end
+
+# Represents the use of the `alias` keyword to alias a method.
+#
+# alias foo bar
+# ^^^^^^^^^^^^^
+class Prism::AliasMethodNode < ::Prism::Node
+ # def initialize: (new_name: Node, old_name: Node, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [AliasMethodNode] a new instance of AliasMethodNode
+ #
+ # source://prism//prism/node.rb#168
+ def initialize(new_name, old_name, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#176
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#181
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#191
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#186
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AliasMethodNode
+ #
+ # source://prism//prism/node.rb#196
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#181
+ 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#209
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#219
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#214
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#165
+ def keyword_loc; end
+
+ # attr_reader new_name: Node
+ #
+ # source://prism//prism/node.rb#159
+ def new_name; end
+
+ # attr_reader old_name: Node
+ #
+ # source://prism//prism/node.rb#162
+ def old_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
+ # 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//prism/node.rb#243
+ 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#253
+ def type; end
+ end
+end
+
+# Represents an alternation pattern in pattern matching.
+#
+# foo => bar | baz
+# ^^^^^^^^^
+class Prism::AlternationPatternNode < ::Prism::Node
+ # def initialize: (left: Node, right: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [AlternationPatternNode] a new instance of AlternationPatternNode
+ #
+ # source://prism//prism/node.rb#273
+ def initialize(left, right, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#281
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#286
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#296
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#291
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AlternationPatternNode
+ #
+ # source://prism//prism/node.rb#301
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#286
+ 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#314
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#324
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node
+ #
+ # source://prism//prism/node.rb#264
+ def left; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#319
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#270
+ def operator_loc; end
+
+ # attr_reader right: Node
+ #
+ # source://prism//prism/node.rb#267
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#348
+ 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#358
+ def type; end
+ end
+end
+
+# Represents the use of the `&&` operator or the `and` keyword.
+#
+# left and right
+# ^^^^^^^^^^^^^^
+class Prism::AndNode < ::Prism::Node
+ # def initialize: (left: Node, right: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [AndNode] a new instance of AndNode
+ #
+ # source://prism//prism/node.rb#378
+ def initialize(left, right, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#386
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#391
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#401
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#396
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AndNode
+ #
+ # source://prism//prism/node.rb#406
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#391
+ 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#419
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#429
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node
+ #
+ # source://prism//prism/node.rb#369
+ def left; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#424
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#375
+ def operator_loc; end
+
+ # attr_reader right: Node
+ #
+ # source://prism//prism/node.rb#372
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#453
+ 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#463
+ def type; end
+ end
+end
+
+# Represents a set of arguments to a method or a keyword.
+#
+# return foo, bar, baz
+# ^^^^^^^^^^^^^
+class Prism::ArgumentsNode < ::Prism::Node
+ # def initialize: (flags: Integer, arguments: Array[Node], location: Location) -> void
+ #
+ # @return [ArgumentsNode] a new instance of ArgumentsNode
+ #
+ # source://prism//prism/node.rb#480
+ def initialize(flags, arguments, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#487
+ def accept(visitor); end
+
+ # attr_reader arguments: Array[Node]
+ #
+ # source://prism//prism/node.rb#477
+ def arguments; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#492
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#502
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#497
+ def compact_child_nodes; end
+
+ # def contains_keyword_splat?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#524
+ def contains_keyword_splat?; end
+
+ # def copy: (**params) -> ArgumentsNode
+ #
+ # source://prism//prism/node.rb#507
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#492
+ 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#519
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#529
+ 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//prism/node.rb#551
+ def type; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#474
+ 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#561
+ def type; end
+ end
+end
+
+# Flags for arguments nodes.
+module Prism::ArgumentsNodeFlags; end
+
+# if arguments contain keyword splat
+#
+# source://prism//prism/node.rb#17279
+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.
+#
+# [1, 2, 3]
+# ^^^^^^^^^
+class Prism::ArrayNode < ::Prism::Node
+ # def initialize: (flags: Integer, elements: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location) -> void
+ #
+ # @return [ArrayNode] a new instance of ArrayNode
+ #
+ # source://prism//prism/node.rb#585
+ def initialize(flags, elements, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#594
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#599
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#643
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#582
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#609
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#604
+ def compact_child_nodes; end
+
+ # def contains_splat?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#633
+ def contains_splat?; end
+
+ # def copy: (**params) -> ArrayNode
+ #
+ # source://prism//prism/node.rb#614
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#599
+ 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#628
+ def deconstruct_keys(keys); end
+
+ # attr_reader elements: Array[Node]
+ #
+ # source://prism//prism/node.rb#576
+ def elements; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#648
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#638
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#579
+ def opening_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # 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//prism/node.rb#672
+ def type; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#573
+ 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#682
+ def type; end
+ end
+end
+
+# Flags for array nodes.
+module Prism::ArrayNodeFlags; end
+
+# if array contains splat nodes
+#
+# source://prism//prism/node.rb#17285
+Prism::ArrayNodeFlags::CONTAINS_SPLAT = T.let(T.unsafe(nil), Integer)
+
+# Represents an array pattern in pattern matching.
+#
+# foo in 1, 2
+# ^^^^^^^^^^^
+#
+# foo in [1, 2]
+# ^^^^^^^^^^^^^
+#
+# foo in *1
+# ^^^^^^^^^
+#
+# foo in Bar[]
+# ^^^^^^^^^^^^
+#
+# foo in Bar[1, 2, 3]
+# ^^^^^^^^^^^^^^^^^^^
+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
+ #
+ # @return [ArrayPatternNode] a new instance of ArrayPatternNode
+ #
+ # source://prism//prism/node.rb#723
+ def initialize(constant, requireds, rest, posts, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#734
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#739
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#785
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#720
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#754
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#744
+ def compact_child_nodes; end
+
+ # attr_reader constant: Node?
+ #
+ # source://prism//prism/node.rb#705
+ def constant; end
+
+ # def copy: (**params) -> ArrayPatternNode
+ #
+ # source://prism//prism/node.rb#759
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#739
+ 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#775
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#790
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#780
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#717
+ def opening_loc; end
+
+ # attr_reader posts: Array[Node]
+ #
+ # source://prism//prism/node.rb#714
+ def posts; end
+
+ # attr_reader requireds: Array[Node]
+ #
+ # source://prism//prism/node.rb#708
+ def requireds; end
+
+ # attr_reader rest: Node?
+ #
+ # source://prism//prism/node.rb#711
+ 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
+ # 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//prism/node.rb#825
+ 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#835
+ def type; end
+ end
+end
+
+# Represents a hash key/value pair.
+#
+# { a => b }
+# ^^^^^^
+class Prism::AssocNode < ::Prism::Node
+ # def initialize: (key: Node, value: Node?, operator_loc: Location?, location: Location) -> void
+ #
+ # @return [AssocNode] a new instance of AssocNode
+ #
+ # source://prism//prism/node.rb#855
+ def initialize(key, value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#863
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#868
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#881
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#873
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AssocNode
+ #
+ # source://prism//prism/node.rb#886
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#868
+ 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#899
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#909
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader key: Node
+ #
+ # source://prism//prism/node.rb#846
+ def key; end
+
+ # def operator: () -> String?
+ #
+ # source://prism//prism/node.rb#904
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#852
+ 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//prism/node.rb#937
+ def type; end
+
+ # attr_reader value: Node?
+ #
+ # source://prism//prism/node.rb#849
+ 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#947
+ def type; end
+ end
+end
+
+# Represents a splat in a hash literal.
+#
+# { **foo }
+# ^^^^^
+class Prism::AssocSplatNode < ::Prism::Node
+ # def initialize: (value: Node?, operator_loc: Location, location: Location) -> void
+ #
+ # @return [AssocSplatNode] a new instance of AssocSplatNode
+ #
+ # source://prism//prism/node.rb#964
+ def initialize(value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#971
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#976
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#988
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#981
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> AssocSplatNode
+ #
+ # source://prism//prism/node.rb#993
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#976
+ 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#1005
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1015
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#1010
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#961
+ 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//prism/node.rb#1041
+ def type; end
+
+ # attr_reader value: Node?
+ #
+ # source://prism//prism/node.rb#958
+ 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#1051
+ def type; end
+ end
+end
+
+# Represents reading a reference to a field in the previous match.
+#
+# $'
+# ^^
+class Prism::BackReferenceReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [BackReferenceReadNode] a new instance of BackReferenceReadNode
+ #
+ # source://prism//prism/node.rb#1065
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1071
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1076
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1086
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1081
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BackReferenceReadNode
+ #
+ # source://prism//prism/node.rb#1091
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1076
+ 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#1102
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1107
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#1062
+ 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
+ # 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//prism/node.rb#1127
+ 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#1137
+ def type; end
+ end
+end
+
+# A class that knows how to walk down the tree. None of the individual visit
+# 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.
+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
+ def visit(node); end
+
+ # Visits each node in `nodes` by calling `accept` on each one.
+ #
+ # source://prism//prism/visitor.rb#21
+ def visit_all(nodes); end
+
+ # Visits the child nodes of `node` by calling `accept` on each one.
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_child_nodes(node); end
+end
+
+# Represents a begin statement.
+#
+# begin
+# foo
+# end
+# ^^^^^
+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
+ #
+ # @return [BeginNode] a new instance of BeginNode
+ #
+ # source://prism//prism/node.rb#1168
+ def initialize(begin_keyword_loc, statements, rescue_clause, else_clause, ensure_clause, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1179
+ def accept(visitor); end
+
+ # def begin_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#1229
+ def begin_keyword; end
+
+ # attr_reader begin_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#1150
+ def begin_keyword_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1188
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1203
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1193
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BeginNode
+ #
+ # source://prism//prism/node.rb#1208
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1188
+ 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#1224
+ def deconstruct_keys(keys); end
+
+ # attr_reader else_clause: ElseNode?
+ #
+ # source://prism//prism/node.rb#1159
+ def else_clause; end
+
+ # def end_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#1234
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#1165
+ def end_keyword_loc; end
+
+ # attr_reader ensure_clause: EnsureNode?
+ #
+ # source://prism//prism/node.rb#1162
+ def ensure_clause; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1239
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader rescue_clause: RescueNode?
+ #
+ # source://prism//prism/node.rb#1156
+ def rescue_clause; end
+
+ # source://prism//prism/node.rb#1183
+ def set_newline_flag(newline_marked); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#1153
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#1284
+ 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#1294
+ def type; end
+ end
+end
+
+# Represents block method arguments.
+#
+# bar(&args)
+# ^^^^^^^^^^
+class Prism::BlockArgumentNode < ::Prism::Node
+ # def initialize: (expression: Node?, operator_loc: Location, location: Location) -> void
+ #
+ # @return [BlockArgumentNode] a new instance of BlockArgumentNode
+ #
+ # source://prism//prism/node.rb#1311
+ def initialize(expression, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1318
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1323
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1335
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1328
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BlockArgumentNode
+ #
+ # source://prism//prism/node.rb#1340
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1323
+ 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#1352
+ def deconstruct_keys(keys); end
+
+ # attr_reader expression: Node?
+ #
+ # source://prism//prism/node.rb#1305
+ def expression; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1362
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#1357
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#1308
+ 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//prism/node.rb#1388
+ 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#1398
+ def type; end
+ end
+end
+
+# Represents a block local variable.
+#
+# a { |; b| }
+# ^
+class Prism::BlockLocalVariableNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [BlockLocalVariableNode] a new instance of BlockLocalVariableNode
+ #
+ # source://prism//prism/node.rb#1412
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1418
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1423
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1433
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1428
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BlockLocalVariableNode
+ #
+ # source://prism//prism/node.rb#1438
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1423
+ 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#1449
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1454
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#1409
+ 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
+ # 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//prism/node.rb#1474
+ 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#1484
+ def type; end
+ end
+end
+
+# Represents a block of ruby code.
+#
+# [1, 2, 3].each { |i| puts x }
+# ^^^^^^^^^^^^^^
+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
+ #
+ # @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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1524
+ def accept(visitor); end
+
+ # attr_reader body: Node?
+ #
+ # source://prism//prism/node.rb#1504
+ def body; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1529
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#1573
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#1510
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1542
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1534
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BlockNode
+ #
+ # source://prism//prism/node.rb#1547
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1529
+ 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#1563
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1578
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#1495
+ 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
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#1507
+ def opening_loc; end
+
+ # attr_reader parameters: Node?
+ #
+ # source://prism//prism/node.rb#1501
+ 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
+ # 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//prism/node.rb#1613
+ 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#1623
+ def type; end
+ end
+end
+
+# Represents a block parameter to a method, block, or lambda definition.
+#
+# def a(&b)
+# ^^
+# end
+class Prism::BlockParameterNode < ::Prism::Node
+ # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, 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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1652
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1657
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1667
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1662
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BlockParameterNode
+ #
+ # source://prism//prism/node.rb#1672
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1657
+ 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#1685
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1695
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol?
+ #
+ # source://prism//prism/node.rb#1635
+ def name; end
+
+ # attr_reader name_loc: Location?
+ #
+ # source://prism//prism/node.rb#1638
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#1690
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#1641
+ 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//prism/node.rb#1721
+ 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#1731
+ def type; end
+ end
+end
+
+# Represents a block's parameters declaration.
+#
+# -> (a, b = 1; local) { }
+# ^^^^^^^^^^^^^^^^^
+#
+# foo do |a, b = 1; local|
+# ^^^^^^^^^^^^^^^^^
+# end
+class Prism::BlockParametersNode < ::Prism::Node
+ # def initialize: (parameters: ParametersNode?, locals: Array[Node], opening_loc: Location?, closing_loc: Location?, location: Location) -> void
+ #
+ # @return [BlockParametersNode] a new instance of BlockParametersNode
+ #
+ # source://prism//prism/node.rb#1758
+ def initialize(parameters, locals, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1767
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1772
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#1814
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#1755
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1785
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1777
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BlockParametersNode
+ #
+ # source://prism//prism/node.rb#1790
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1772
+ 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#1804
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1819
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Node]
+ #
+ # source://prism//prism/node.rb#1749
+ def locals; end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#1809
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#1752
+ def opening_loc; end
+
+ # attr_reader parameters: ParametersNode?
+ #
+ # source://prism//prism/node.rb#1746
+ 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
+ # 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//prism/node.rb#1847
+ 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#1857
+ def type; end
+ end
+end
+
+# Represents the use of the `break` keyword.
+#
+# break foo
+# ^^^^^^^^^
+class Prism::BreakNode < ::Prism::Node
+ # def initialize: (arguments: ArgumentsNode?, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [BreakNode] a new instance of BreakNode
+ #
+ # source://prism//prism/node.rb#1874
+ def initialize(arguments, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#1881
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#1868
+ def arguments; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1886
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#1898
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#1891
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> BreakNode
+ #
+ # source://prism//prism/node.rb#1903
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#1886
+ 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#1915
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#1925
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#1920
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#1871
+ def keyword_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#1951
+ 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#1961
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator on a call.
+#
+# foo.bar &&= value
+# ^^^^^^^^^^^^^^^^^
+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
+ #
+ # @return [CallAndWriteNode] a new instance of CallAndWriteNode
+ #
+ # source://prism//prism/node.rb#1996
+ def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2009
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2065
+ def attribute_write?; end
+
+ # def call_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#2070
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#1978
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2014
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2027
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2019
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CallAndWriteNode
+ #
+ # source://prism//prism/node.rb#2032
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2014
+ 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#2050
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2085
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def message: () -> String?
+ #
+ # source://prism//prism/node.rb#2075
+ def message; end
+
+ # attr_reader message_loc: Location?
+ #
+ # source://prism//prism/node.rb#1981
+ def message_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#2080
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#1990
+ def operator_loc; end
+
+ # attr_reader read_name: Symbol
+ #
+ # source://prism//prism/node.rb#1984
+ def read_name; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#1975
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2055
+ 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
+ # 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//prism/node.rb#2119
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#1993
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2060
+ def variable_call?; end
+
+ # attr_reader write_name: Symbol
+ #
+ # source://prism//prism/node.rb#1987
+ def write_name; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#1972
+ 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#2129
+ def type; end
+ end
+end
+
+# Represents a method call, in all of the various forms that can take.
+#
+# foo
+# ^^^
+#
+# foo()
+# ^^^^^
+#
+# +foo
+# ^^^^
+#
+# foo + bar
+# ^^^^^^^^^
+#
+# foo.bar
+# ^^^^^^^
+#
+# foo&.bar
+# ^^^^^^^^
+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
+ #
+ # @return [CallNode] a new instance of CallNode
+ #
+ # source://prism//prism/node.rb#2182
+ def initialize(flags, receiver, call_operator_loc, name, message_loc, opening_loc, arguments, closing_loc, block, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2196
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#2173
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2254
+ def attribute_write?; end
+
+ # attr_reader block: Node?
+ #
+ # source://prism//prism/node.rb#2179
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#2259
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#2161
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2201
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#2274
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#2176
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2215
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2206
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CallNode
+ #
+ # source://prism//prism/node.rb#2220
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2201
+ 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#2239
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2279
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def message: () -> String?
+ #
+ # source://prism//prism/node.rb#2264
+ def message; end
+
+ # attr_reader message_loc: Location?
+ #
+ # source://prism//prism/node.rb#2167
+ def message_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#2164
+ def name; end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#2269
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#2170
+ def opening_loc; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#2158
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2244
+ 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
+ # 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//prism/node.rb#2323
+ def type; end
+
+ # def variable_call?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2249
+ def variable_call?; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#2155
+ 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#2333
+ def type; end
+ end
+end
+
+# Flags for call nodes.
+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
+Prism::CallNodeFlags::ATTRIBUTE_WRITE = T.let(T.unsafe(nil), Integer)
+
+# &. operator
+#
+# source://prism//prism/node.rb#17291
+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
+Prism::CallNodeFlags::VARIABLE_CALL = T.let(T.unsafe(nil), Integer)
+
+# Represents the use of an assignment operator on a call.
+#
+# foo.bar += baz
+# ^^^^^^^^^^^^^^
+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
+ #
+ # @return [CallOperatorWriteNode] a new instance of CallOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#2371
+ def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2385
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2442
+ def attribute_write?; end
+
+ # def call_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#2447
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#2350
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2390
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2403
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2395
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CallOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#2408
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2390
+ 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#2427
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2457
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def message: () -> String?
+ #
+ # source://prism//prism/node.rb#2452
+ def message; end
+
+ # attr_reader message_loc: Location?
+ #
+ # source://prism//prism/node.rb#2353
+ def message_loc; end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#2362
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#2365
+ def operator_loc; end
+
+ # attr_reader read_name: Symbol
+ #
+ # source://prism//prism/node.rb#2356
+ def read_name; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#2347
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2432
+ 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
+ # 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//prism/node.rb#2492
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#2368
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2437
+ def variable_call?; end
+
+ # attr_reader write_name: Symbol
+ #
+ # source://prism//prism/node.rb#2359
+ def write_name; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#2344
+ 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#2502
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator on a call.
+#
+# foo.bar ||= value
+# ^^^^^^^^^^^^^^^^^
+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
+ #
+ # @return [CallOrWriteNode] a new instance of CallOrWriteNode
+ #
+ # source://prism//prism/node.rb#2537
+ def initialize(flags, receiver, call_operator_loc, message_loc, read_name, write_name, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2550
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2606
+ def attribute_write?; end
+
+ # def call_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#2611
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#2519
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2555
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2568
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2560
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CallOrWriteNode
+ #
+ # source://prism//prism/node.rb#2573
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2555
+ 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#2591
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2626
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def message: () -> String?
+ #
+ # source://prism//prism/node.rb#2616
+ def message; end
+
+ # attr_reader message_loc: Location?
+ #
+ # source://prism//prism/node.rb#2522
+ def message_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#2621
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#2531
+ def operator_loc; end
+
+ # attr_reader read_name: Symbol
+ #
+ # source://prism//prism/node.rb#2525
+ def read_name; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#2516
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2596
+ 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
+ # 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//prism/node.rb#2660
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#2534
+ def value; end
+
+ # def variable_call?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2601
+ def variable_call?; end
+
+ # attr_reader write_name: Symbol
+ #
+ # source://prism//prism/node.rb#2528
+ def write_name; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#2513
+ 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#2670
+ def type; end
+ end
+end
+
+# Represents assigning to a method call.
+#
+# foo.bar, = 1
+# ^^^^^^^
+#
+# begin
+# rescue => foo.bar
+# ^^^^^^^
+# end
+#
+# for foo.bar in baz do end
+# ^^^^^^^
+class Prism::CallTargetNode < ::Prism::Node
+ # def initialize: (flags: Integer, receiver: Node, call_operator_loc: Location, name: Symbol, message_loc: Location, location: Location) -> void
+ #
+ # @return [CallTargetNode] a new instance of CallTargetNode
+ #
+ # source://prism//prism/node.rb#2704
+ def initialize(flags, receiver, call_operator_loc, name, message_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2714
+ def accept(visitor); end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2764
+ def attribute_write?; end
+
+ # def call_operator: () -> String
+ #
+ # source://prism//prism/node.rb#2769
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location
+ #
+ # source://prism//prism/node.rb#2695
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2719
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2729
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2724
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CallTargetNode
+ #
+ # source://prism//prism/node.rb#2734
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2719
+ 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#2749
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2779
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def message: () -> String
+ #
+ # source://prism//prism/node.rb#2774
+ def message; end
+
+ # attr_reader message_loc: Location
+ #
+ # source://prism//prism/node.rb#2701
+ def message_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#2698
+ def name; end
+
+ # attr_reader receiver: Node
+ #
+ # source://prism//prism/node.rb#2692
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2754
+ 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
+ # 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//prism/node.rb#2805
+ def type; end
+
+ # def variable_call?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#2759
+ def variable_call?; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#2689
+ 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#2815
+ def type; end
+ end
+end
+
+# Represents assigning to a local variable in pattern matching.
+#
+# foo => [bar => baz]
+# ^^^^^^^^^^^^
+class Prism::CapturePatternNode < ::Prism::Node
+ # def initialize: (value: Node, target: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [CapturePatternNode] a new instance of CapturePatternNode
+ #
+ # source://prism//prism/node.rb#2835
+ def initialize(value, target, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2843
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2848
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2858
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2853
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> CapturePatternNode
+ #
+ # source://prism//prism/node.rb#2863
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2848
+ 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#2876
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#2886
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#2881
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#2832
+ def operator_loc; end
+
+ # attr_reader target: Node
+ #
+ # source://prism//prism/node.rb#2829
+ def target; 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//prism/node.rb#2910
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#2826
+ 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#2920
+ def type; end
+ end
+end
+
+# Represents the use of a case statement for pattern matching.
+#
+# case true
+# in false
+# end
+# ^^^^^^^^^
+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
+ #
+ # @return [CaseMatchNode] a new instance of CaseMatchNode
+ #
+ # source://prism//prism/node.rb#2948
+ def initialize(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#2958
+ def accept(visitor); end
+
+ # def case_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3002
+ def case_keyword; end
+
+ # attr_reader case_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#2942
+ def case_keyword_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2963
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#2977
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#2968
+ def compact_child_nodes; end
+
+ # attr_reader conditions: Array[Node]
+ #
+ # source://prism//prism/node.rb#2936
+ def conditions; end
+
+ # attr_reader consequent: ElseNode?
+ #
+ # source://prism//prism/node.rb#2939
+ def consequent; end
+
+ # def copy: (**params) -> CaseMatchNode
+ #
+ # source://prism//prism/node.rb#2982
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#2963
+ 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#2997
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3007
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#2945
+ def end_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3012
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader predicate: Node?
+ #
+ # source://prism//prism/node.rb#2933
+ def predicate; 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//prism/node.rb#3046
+ 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#3056
+ def type; end
+ end
+end
+
+# Represents the use of a case statement.
+#
+# case true
+# when false
+# end
+# ^^^^^^^^^^
+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
+ #
+ # @return [CaseNode] a new instance of CaseNode
+ #
+ # source://prism//prism/node.rb#3084
+ def initialize(predicate, conditions, consequent, case_keyword_loc, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3094
+ def accept(visitor); end
+
+ # def case_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3138
+ def case_keyword; end
+
+ # attr_reader case_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#3078
+ def case_keyword_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3099
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3113
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3104
+ def compact_child_nodes; end
+
+ # attr_reader conditions: Array[Node]
+ #
+ # source://prism//prism/node.rb#3072
+ def conditions; end
+
+ # attr_reader consequent: ElseNode?
+ #
+ # source://prism//prism/node.rb#3075
+ def consequent; end
+
+ # def copy: (**params) -> CaseNode
+ #
+ # source://prism//prism/node.rb#3118
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3099
+ 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#3133
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3143
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#3081
+ def end_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3148
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader predicate: Node?
+ #
+ # source://prism//prism/node.rb#3069
+ def predicate; 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//prism/node.rb#3182
+ 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#3192
+ def type; end
+ end
+end
+
+# Represents a class declaration involving the `class` keyword.
+#
+# class Foo end
+# ^^^^^^^^^^^^^
+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
+ #
+ # @return [ClassNode] a new instance of ClassNode
+ #
+ # source://prism//prism/node.rb#3227
+ def initialize(locals, class_keyword_loc, constant_path, inheritance_operator_loc, superclass, body, end_keyword_loc, name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3240
+ def accept(visitor); end
+
+ # attr_reader body: Node?
+ #
+ # source://prism//prism/node.rb#3218
+ def body; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3245
+ def child_nodes; end
+
+ # def class_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3287
+ def class_keyword; end
+
+ # attr_reader class_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#3206
+ def class_keyword_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3259
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3250
+ def compact_child_nodes; end
+
+ # attr_reader constant_path: Node
+ #
+ # source://prism//prism/node.rb#3209
+ def constant_path; end
+
+ # def copy: (**params) -> ClassNode
+ #
+ # source://prism//prism/node.rb#3264
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3245
+ 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#3282
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#3297
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#3221
+ def end_keyword_loc; end
+
+ # def inheritance_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#3292
+ def inheritance_operator; end
+
+ # attr_reader inheritance_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#3212
+ def inheritance_operator_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3302
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#3203
+ def locals; end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3224
+ def name; end
+
+ # attr_reader superclass: Node?
+ #
+ # source://prism//prism/node.rb#3215
+ def superclass; 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//prism/node.rb#3340
+ 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#3350
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a class variable.
+#
+# @@target &&= value
+# ^^^^^^^^^^^^^^^^^^
+class Prism::ClassVariableAndWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ClassVariableAndWriteNode] a new instance of ClassVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#3373
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3382
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3387
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3397
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3392
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#3402
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3387
+ 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#3416
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3426
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3361
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#3364
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#3421
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#3367
+ 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//prism/node.rb#3450
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#3370
+ 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#3460
+ def type; end
+ end
+end
+
+# Represents assigning to a class variable using an operator that isn't `=`.
+#
+# @@target += value
+# ^^^^^^^^^^^^^^^^^
+class Prism::ClassVariableOperatorWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void
+ #
+ # @return [ClassVariableOperatorWriteNode] a new instance of ClassVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#3486
+ def initialize(name, name_loc, operator_loc, value, operator, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3496
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3501
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3511
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3506
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#3516
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3501
+ 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#3531
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3536
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3471
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#3474
+ def name_loc; end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#3483
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#3477
+ 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//prism/node.rb#3561
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#3480
+ 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#3571
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a class variable.
+#
+# @@target ||= value
+# ^^^^^^^^^^^^^^^^^^
+class Prism::ClassVariableOrWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ClassVariableOrWriteNode] a new instance of ClassVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#3594
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3603
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3608
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3618
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3613
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#3623
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3608
+ 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#3637
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3647
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3582
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#3585
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#3642
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#3588
+ 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//prism/node.rb#3671
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#3591
+ 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#3681
+ def type; end
+ end
+end
+
+# Represents referencing a class variable.
+#
+# @@foo
+# ^^^^^
+class Prism::ClassVariableReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [ClassVariableReadNode] a new instance of ClassVariableReadNode
+ #
+ # source://prism//prism/node.rb#3695
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3701
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3706
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3716
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3711
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableReadNode
+ #
+ # source://prism//prism/node.rb#3721
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3706
+ 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#3732
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3737
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3692
+ 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
+ # 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//prism/node.rb#3757
+ 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#3767
+ def type; end
+ end
+end
+
+# Represents writing to a class variable in a context that doesn't have an explicit value.
+#
+# @@foo, @@bar = baz
+# ^^^^^ ^^^^^
+class Prism::ClassVariableTargetNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [ClassVariableTargetNode] a new instance of ClassVariableTargetNode
+ #
+ # source://prism//prism/node.rb#3781
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3787
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3792
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3802
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3797
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableTargetNode
+ #
+ # source://prism//prism/node.rb#3807
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3792
+ 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#3818
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3823
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3778
+ 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
+ # 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//prism/node.rb#3843
+ 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#3853
+ def type; end
+ end
+end
+
+# Represents writing to a class variable.
+#
+# @@foo = 1
+# ^^^^^^^^^
+class Prism::ClassVariableWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location?, location: Location) -> void
+ #
+ # @return [ClassVariableWriteNode] a new instance of ClassVariableWriteNode
+ #
+ # source://prism//prism/node.rb#3876
+ def initialize(name, name_loc, value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3885
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3890
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#3900
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#3895
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ClassVariableWriteNode
+ #
+ # source://prism//prism/node.rb#3905
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#3890
+ 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#3919
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#3929
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3864
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#3867
+ def name_loc; end
+
+ # def operator: () -> String?
+ #
+ # source://prism//prism/node.rb#3924
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#3873
+ 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//prism/node.rb#3953
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#3870
+ 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#3963
+ def type; end
+ end
+end
+
+# This represents a comment that was encountered during parsing. It is the
+# base class for all comment types.
+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
+ def initialize(location); end
+
+ # Implement the hash pattern matching interface for Comment.
+ #
+ # source://prism//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
+ def location; end
+end
+
+# A compiler is a visitor that returns the value of each node as it visits.
+# This is as opposed to a visitor which will only walk the tree. This can be
+# useful when you are trying to compile a tree into a different format.
+#
+# For example, to build a representation of the tree as s-expressions, you
+# could write:
+#
+# class SExpressions < Prism::Compiler
+# def visit_arguments_node(node) = [:arguments, super]
+# def visit_call_node(node) = [:call, super]
+# def visit_integer_node(node) = [:integer]
+# def visit_program_node(node) = [:program, super]
+# end
+#
+# Prism.parse("1 + 2").value.accept(SExpressions.new)
+# # => [:program, [[[:call, [[:integer], [:arguments, [[:integer]]]]]]]]
+class Prism::Compiler
+ # Visit an individual node.
+ #
+ # source://prism//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
+ 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
+ def visit_alias_method_node(node); end
+
+ # Visit a list of nodes.
+ #
+ # source://prism//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
+ 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
+ def visit_and_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ArgumentsNode node
+ #
+ # source://prism//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
+ def visit_array_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ArrayPatternNode node
+ #
+ # source://prism//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
+ def visit_assoc_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a AssocSplatNode node
+ #
+ # source://prism//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
+ 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
+ def visit_begin_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a BlockArgumentNode node
+ #
+ # source://prism//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
+ 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
+ def visit_block_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a BlockParameterNode node
+ #
+ # source://prism//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
+ 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
+ def visit_break_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a CallAndWriteNode node
+ #
+ # source://prism//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
+ def visit_call_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a CallOperatorWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ def visit_case_node(node); end
+
+ # Visit the child nodes of the given node.
+ #
+ # source://prism//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
+ def visit_class_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ClassVariableAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_def_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a DefinedNode node
+ #
+ # source://prism//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
+ def visit_else_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a EmbeddedStatementsNode node
+ #
+ # source://prism//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
+ 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
+ def visit_ensure_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a FalseNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def visit_float_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ForNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_hash_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a HashPatternNode node
+ #
+ # source://prism//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
+ def visit_if_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ImaginaryNode node
+ #
+ # source://prism//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
+ def visit_implicit_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ImplicitRestNode node
+ #
+ # source://prism//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
+ def visit_in_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a IndexAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_integer_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a InterpolatedMatchLastLineNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_lambda_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a LocalVariableAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_missing_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ModuleNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def visit_next_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a NilNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_or_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ParametersNode node
+ #
+ # source://prism//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
+ def visit_parentheses_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a PinnedExpressionNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ def visit_program_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a RangeNode node
+ #
+ # source://prism//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
+ def visit_rational_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a RedoNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ def visit_rescue_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a RestParameterNode node
+ #
+ # source://prism//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
+ def visit_retry_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a ReturnNode node
+ #
+ # source://prism//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
+ def visit_self_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a SingletonClassNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ def visit_splat_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a StatementsNode node
+ #
+ # source://prism//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
+ def visit_string_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a SuperNode node
+ #
+ # source://prism//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
+ def visit_symbol_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a TrueNode node
+ #
+ # source://prism//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
+ def visit_undef_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a UnlessNode node
+ #
+ # source://prism//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
+ def visit_until_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a WhenNode node
+ #
+ # source://prism//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
+ def visit_while_node(node); end
+
+ # Visit the child nodes of the given node.
+ # Compile a XStringNode node
+ #
+ # source://prism//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
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `&&=` operator for assignment to a constant.
+#
+# Target &&= value
+# ^^^^^^^^^^^^^^^^
+class Prism::ConstantAndWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ConstantAndWriteNode] a new instance of ConstantAndWriteNode
+ #
+ # source://prism//prism/node.rb#3986
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#3995
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4000
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4010
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4005
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantAndWriteNode
+ #
+ # source://prism//prism/node.rb#4015
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4000
+ 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#4029
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4039
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#3974
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#3977
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#4034
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#3980
+ 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//prism/node.rb#4063
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#3983
+ 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#4073
+ def type; end
+ end
+end
+
+# Represents assigning to a constant using an operator that isn't `=`.
+#
+# Target += value
+# ^^^^^^^^^^^^^^^
+class Prism::ConstantOperatorWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void
+ #
+ # @return [ConstantOperatorWriteNode] a new instance of ConstantOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#4099
+ def initialize(name, name_loc, operator_loc, value, operator, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4109
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4114
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4124
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4119
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#4129
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4114
+ 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#4144
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4149
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#4084
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#4087
+ def name_loc; end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#4096
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4090
+ 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//prism/node.rb#4174
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4093
+ 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#4184
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a constant.
+#
+# Target ||= value
+# ^^^^^^^^^^^^^^^^
+class Prism::ConstantOrWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ConstantOrWriteNode] a new instance of ConstantOrWriteNode
+ #
+ # source://prism//prism/node.rb#4207
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4216
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4221
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4231
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4226
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantOrWriteNode
+ #
+ # source://prism//prism/node.rb#4236
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4221
+ 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#4250
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4260
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#4195
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#4198
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#4255
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4201
+ 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//prism/node.rb#4284
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4204
+ 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#4294
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a constant path.
+#
+# Parent::Child &&= value
+# ^^^^^^^^^^^^^^^^^^^^^^^
+class Prism::ConstantPathAndWriteNode < ::Prism::Node
+ # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ConstantPathAndWriteNode] a new instance of ConstantPathAndWriteNode
+ #
+ # source://prism//prism/node.rb#4314
+ def initialize(target, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4322
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4327
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4337
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4332
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathAndWriteNode
+ #
+ # source://prism//prism/node.rb#4342
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4327
+ 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#4355
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4365
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#4360
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4308
+ def operator_loc; end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4305
+ def target; 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//prism/node.rb#4389
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4311
+ 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#4399
+ def type; end
+ end
+end
+
+# Represents accessing a constant through a path of `::` operators.
+#
+# Foo::Bar
+# ^^^^^^^^
+class Prism::ConstantPathNode < ::Prism::Node
+ # def initialize: (parent: Node?, child: Node, delimiter_loc: Location, location: Location) -> void
+ #
+ # @return [ConstantPathNode] a new instance of ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4419
+ def initialize(parent, child, delimiter_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4427
+ def accept(visitor); end
+
+ # attr_reader child: Node
+ #
+ # source://prism//prism/node.rb#4413
+ def child; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4432
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4445
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4437
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4450
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4432
+ 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#4463
+ def deconstruct_keys(keys); end
+
+ # def delimiter: () -> String
+ #
+ # source://prism//prism/node.rb#4468
+ def delimiter; end
+
+ # attr_reader delimiter_loc: Location
+ #
+ # source://prism//prism/node.rb#4416
+ def delimiter_loc; end
+
+ # Returns the full name of this constant path. For example: "Foo::Bar"
+ #
+ # source://prism//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
+ def full_name_parts; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4473
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader parent: Node?
+ #
+ # source://prism//prism/node.rb#4410
+ def parent; 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//prism/node.rb#4501
+ 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#4511
+ def type; end
+ end
+end
+
+# An error class raised when dynamic parts are found while computing a
+# constant path's full name. For example:
+# Foo::Bar::Baz -> does not raise because all parts of the constant path are
+# simple constants
+# var::Bar::Baz -> raises because the first part of the constant path is a
+# local variable
+class Prism::ConstantPathNode::DynamicPartsInConstantPathError < ::StandardError; end
+
+# Represents assigning to a constant path using an operator that isn't `=`.
+#
+# Parent::Child += value
+# ^^^^^^^^^^^^^^^^^^^^^^
+class Prism::ConstantPathOperatorWriteNode < ::Prism::Node
+ # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void
+ #
+ # @return [ConstantPathOperatorWriteNode] a new instance of ConstantPathOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#4534
+ def initialize(target, operator_loc, value, operator, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4543
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4548
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4558
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4553
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#4563
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4548
+ 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#4577
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4582
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#4531
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4525
+ def operator_loc; end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4522
+ def target; 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//prism/node.rb#4607
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4528
+ 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#4617
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a constant path.
+#
+# Parent::Child ||= value
+# ^^^^^^^^^^^^^^^^^^^^^^^
+class Prism::ConstantPathOrWriteNode < ::Prism::Node
+ # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ConstantPathOrWriteNode] a new instance of ConstantPathOrWriteNode
+ #
+ # source://prism//prism/node.rb#4637
+ def initialize(target, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4645
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4650
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4660
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4655
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathOrWriteNode
+ #
+ # source://prism//prism/node.rb#4665
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4650
+ 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#4678
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4688
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#4683
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4631
+ def operator_loc; end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4628
+ def target; 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//prism/node.rb#4712
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4634
+ 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#4722
+ def type; end
+ end
+end
+
+# Represents writing to a constant path in a context that doesn't have an explicit value.
+#
+# Foo::Foo, Bar::Bar = baz
+# ^^^^^^^^ ^^^^^^^^
+class Prism::ConstantPathTargetNode < ::Prism::Node
+ # def initialize: (parent: Node?, child: Node, delimiter_loc: Location, location: Location) -> void
+ #
+ # @return [ConstantPathTargetNode] a new instance of ConstantPathTargetNode
+ #
+ # source://prism//prism/node.rb#4742
+ def initialize(parent, child, delimiter_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4750
+ def accept(visitor); end
+
+ # attr_reader child: Node
+ #
+ # source://prism//prism/node.rb#4736
+ def child; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4755
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4768
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4760
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathTargetNode
+ #
+ # source://prism//prism/node.rb#4773
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4755
+ 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#4786
+ def deconstruct_keys(keys); end
+
+ # def delimiter: () -> String
+ #
+ # source://prism//prism/node.rb#4791
+ def delimiter; end
+
+ # attr_reader delimiter_loc: Location
+ #
+ # source://prism//prism/node.rb#4739
+ def delimiter_loc; end
+
+ # Returns the full name of this constant path. For example: "Foo::Bar"
+ #
+ # source://prism//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
+ def full_name_parts; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4796
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader parent: Node?
+ #
+ # source://prism//prism/node.rb#4733
+ def parent; 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//prism/node.rb#4824
+ 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#4834
+ def type; end
+ end
+end
+
+# Represents writing to a constant path.
+#
+# ::Foo = 1
+# ^^^^^^^^^
+#
+# Foo::Bar = 1
+# ^^^^^^^^^^^^
+#
+# ::Foo::Bar = 1
+# ^^^^^^^^^^^^^^
+class Prism::ConstantPathWriteNode < ::Prism::Node
+ # def initialize: (target: ConstantPathNode, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [ConstantPathWriteNode] a new instance of ConstantPathWriteNode
+ #
+ # source://prism//prism/node.rb#4860
+ def initialize(target, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4868
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4873
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4883
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4878
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantPathWriteNode
+ #
+ # source://prism//prism/node.rb#4888
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4873
+ 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#4901
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#4911
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#4906
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#4854
+ def operator_loc; end
+
+ # attr_reader target: ConstantPathNode
+ #
+ # source://prism//prism/node.rb#4851
+ def target; 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//prism/node.rb#4935
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#4857
+ 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#4945
+ def type; end
+ end
+end
+
+# Represents referencing a constant.
+#
+# Foo
+# ^^^
+class Prism::ConstantReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [ConstantReadNode] a new instance of ConstantReadNode
+ #
+ # source://prism//prism/node.rb#4959
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#4965
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4970
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#4980
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#4975
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantReadNode
+ #
+ # source://prism//prism/node.rb#4985
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#4970
+ 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#4996
+ def deconstruct_keys(keys); end
+
+ # Returns the full name of this constant. For example: "Foo"
+ #
+ # source://prism//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
+ def full_name_parts; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5001
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#4956
+ 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
+ # 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//prism/node.rb#5021
+ 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#5031
+ def type; end
+ end
+end
+
+# Represents writing to a constant in a context that doesn't have an explicit value.
+#
+# Foo, Bar = baz
+# ^^^ ^^^
+class Prism::ConstantTargetNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [ConstantTargetNode] a new instance of ConstantTargetNode
+ #
+ # source://prism//prism/node.rb#5045
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5051
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5056
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5066
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5061
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantTargetNode
+ #
+ # source://prism//prism/node.rb#5071
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5056
+ 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#5082
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5087
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#5042
+ 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
+ # 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//prism/node.rb#5107
+ 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#5117
+ def type; end
+ end
+end
+
+# Represents writing to a constant.
+#
+# Foo = 1
+# ^^^^^^^
+class Prism::ConstantWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [ConstantWriteNode] a new instance of ConstantWriteNode
+ #
+ # source://prism//prism/node.rb#5140
+ def initialize(name, name_loc, value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5149
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5154
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5164
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5159
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ConstantWriteNode
+ #
+ # source://prism//prism/node.rb#5169
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5154
+ 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#5183
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5193
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#5128
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#5131
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#5188
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#5137
+ 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//prism/node.rb#5217
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#5134
+ 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#5227
+ def type; end
+ end
+end
+
+# The DSL module provides a set of methods that can be used to create prism
+# nodes in a more concise manner. For example, instead of writing:
+#
+# source = Prism::Source.new("[1]")
+#
+# Prism::ArrayNode.new(
+# [
+# Prism::IntegerNode.new(
+# Prism::IntegerBaseFlags::DECIMAL,
+# Prism::Location.new(source, 1, 1),
+# )
+# ],
+# Prism::Location.new(source, 0, 1),
+# Prism::Location.new(source, 2, 1)
+# )
+#
+# you could instead write:
+#
+# source = Prism::Source.new("[1]")
+#
+# ArrayNode(
+# IntegerNode(Prism::IntegerBaseFlags::DECIMAL, Location(source, 1, 1))),
+# Location(source, 0, 1),
+# Location(source, 2, 1)
+# )
+#
+# This is mostly helpful in the context of writing tests, but can also be used
+# to generate trees programmatically.
+module Prism::DSL
+ private
+
+ # Create a new AliasGlobalVariableNode node
+ #
+ # source://prism//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
+ def AliasMethodNode(new_name, old_name, keyword_loc, location = T.unsafe(nil)); end
+
+ # Create a new AlternationPatternNode node
+ #
+ # source://prism//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
+ def AndNode(left, right, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new ArgumentsNode node
+ #
+ # source://prism//prism/dsl.rb#66
+ def ArgumentsNode(flags, arguments, location = T.unsafe(nil)); end
+
+ # Create a new ArrayNode node
+ #
+ # source://prism//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
+ 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
+ def AssocNode(key, value, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new AssocSplatNode node
+ #
+ # source://prism//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
+ def BackReferenceReadNode(name, location = T.unsafe(nil)); end
+
+ # Create a new BeginNode node
+ #
+ # source://prism//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
+ 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
+
+ # 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
+
+ # Create a new BlockParameterNode node
+ #
+ # source://prism//prism/dsl.rb#116
+ def BlockParameterNode(name, name_loc, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new BlockParametersNode node
+ #
+ # source://prism//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
+ def BreakNode(arguments, keyword_loc, location = T.unsafe(nil)); end
+
+ # Create a new CallAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ def CapturePatternNode(value, target, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new CaseMatchNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def ClassVariableAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ClassVariableOperatorWriteNode node
+ #
+ # source://prism//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
+ def ClassVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ClassVariableReadNode node
+ #
+ # source://prism//prism/dsl.rb#191
+ def ClassVariableReadNode(name, location = T.unsafe(nil)); end
+
+ # Create a new ClassVariableTargetNode node
+ #
+ # source://prism//prism/dsl.rb#196
+ def ClassVariableTargetNode(name, location = T.unsafe(nil)); end
+
+ # Create a new ClassVariableWriteNode node
+ #
+ # source://prism//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
+ def ConstantAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ConstantOperatorWriteNode node
+ #
+ # source://prism//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
+ def ConstantOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ConstantPathAndWriteNode node
+ #
+ # source://prism//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
+ def ConstantPathNode(parent, child, delimiter_loc, location = T.unsafe(nil)); end
+
+ # Create a new ConstantPathOperatorWriteNode node
+ #
+ # source://prism//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
+ def ConstantPathOrWriteNode(target, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ConstantPathTargetNode node
+ #
+ # source://prism//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
+ def ConstantPathWriteNode(target, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new ConstantReadNode node
+ #
+ # source://prism//prism/dsl.rb#251
+ def ConstantReadNode(name, location = T.unsafe(nil)); end
+
+ # Create a new ConstantTargetNode node
+ #
+ # source://prism//prism/dsl.rb#256
+ def ConstantTargetNode(name, location = T.unsafe(nil)); end
+
+ # Create a new ConstantWriteNode node
+ #
+ # source://prism//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
+
+ # Create a new DefinedNode node
+ #
+ # source://prism//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
+ 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
+ def EmbeddedStatementsNode(opening_loc, statements, closing_loc, location = T.unsafe(nil)); end
+
+ # Create a new EmbeddedVariableNode node
+ #
+ # source://prism//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
+ 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
+ def FalseNode(location = T.unsafe(nil)); end
+
+ # Create a new FindPatternNode node
+ #
+ # source://prism//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
+ def FlipFlopNode(flags, left, right, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new FloatNode node
+ #
+ # source://prism//prism/dsl.rb#311
+ def FloatNode(location = T.unsafe(nil)); end
+
+ # Create a new ForNode node
+ #
+ # source://prism//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
+ def ForwardingArgumentsNode(location = T.unsafe(nil)); end
+
+ # Create a new ForwardingParameterNode node
+ #
+ # source://prism//prism/dsl.rb#326
+ def ForwardingParameterNode(location = T.unsafe(nil)); end
+
+ # Create a new ForwardingSuperNode node
+ #
+ # source://prism//prism/dsl.rb#331
+ def ForwardingSuperNode(block, location = T.unsafe(nil)); end
+
+ # Create a new GlobalVariableAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ def GlobalVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new GlobalVariableReadNode node
+ #
+ # source://prism//prism/dsl.rb#351
+ def GlobalVariableReadNode(name, location = T.unsafe(nil)); end
+
+ # Create a new GlobalVariableTargetNode node
+ #
+ # source://prism//prism/dsl.rb#356
+ def GlobalVariableTargetNode(name, location = T.unsafe(nil)); end
+
+ # Create a new GlobalVariableWriteNode node
+ #
+ # source://prism//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
+ def HashNode(opening_loc, elements, closing_loc, location = T.unsafe(nil)); end
+
+ # Create a new HashPatternNode node
+ #
+ # source://prism//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
+ 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
+ def ImaginaryNode(numeric, location = T.unsafe(nil)); end
+
+ # Create a new ImplicitNode node
+ #
+ # source://prism//prism/dsl.rb#386
+ def ImplicitNode(value, location = T.unsafe(nil)); end
+
+ # Create a new ImplicitRestNode node
+ #
+ # source://prism//prism/dsl.rb#391
+ def ImplicitRestNode(location = T.unsafe(nil)); end
+
+ # Create a new InNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ def InstanceVariableAndWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new InstanceVariableOperatorWriteNode node
+ #
+ # source://prism//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
+ def InstanceVariableOrWriteNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new InstanceVariableReadNode node
+ #
+ # source://prism//prism/dsl.rb#436
+ def InstanceVariableReadNode(name, location = T.unsafe(nil)); end
+
+ # Create a new InstanceVariableTargetNode node
+ #
+ # source://prism//prism/dsl.rb#441
+ def InstanceVariableTargetNode(name, location = T.unsafe(nil)); end
+
+ # Create a new InstanceVariableWriteNode node
+ #
+ # source://prism//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
+ def IntegerNode(flags, location = T.unsafe(nil)); end
+
+ # Create a new InterpolatedMatchLastLineNode node
+ #
+ # source://prism//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
+ def InterpolatedRegularExpressionNode(flags, opening_loc, parts, closing_loc, location = T.unsafe(nil)); end
+
+ # Create a new InterpolatedStringNode node
+ #
+ # source://prism//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
+ def InterpolatedSymbolNode(opening_loc, parts, closing_loc, location = T.unsafe(nil)); end
+
+ # Create a new InterpolatedXStringNode node
+ #
+ # source://prism//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
+ 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
+
+ # 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
+
+ # Create a new LocalVariableAndWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def LocalVariableReadNode(name, depth, location = T.unsafe(nil)); end
+
+ # Create a new LocalVariableTargetNode node
+ #
+ # source://prism//prism/dsl.rb#516
+ def LocalVariableTargetNode(name, depth, location = T.unsafe(nil)); end
+
+ # Create a new LocalVariableWriteNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def MatchPredicateNode(value, pattern, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new MatchRequiredNode node
+ #
+ # source://prism//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
+ def MatchWriteNode(call, targets, location = T.unsafe(nil)); end
+
+ # Create a new MissingNode node
+ #
+ # source://prism//prism/dsl.rb#546
+ def MissingNode(location = T.unsafe(nil)); end
+
+ # Create a new ModuleNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def NextNode(arguments, keyword_loc, location = T.unsafe(nil)); end
+
+ # Create a new NilNode node
+ #
+ # source://prism//prism/dsl.rb#571
+ def NilNode(location = T.unsafe(nil)); end
+
+ # Create a new NoKeywordsParameterNode node
+ #
+ # source://prism//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
+ def NumberedParametersNode(maximum, location = T.unsafe(nil)); end
+
+ # Create a new NumberedReferenceReadNode node
+ #
+ # source://prism//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
+
+ # Create a new OptionalParameterNode node
+ #
+ # source://prism//prism/dsl.rb#596
+ def OptionalParameterNode(name, name_loc, operator_loc, value, location = T.unsafe(nil)); end
+
+ # Create a new OrNode node
+ #
+ # source://prism//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
+ 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
+ def ParenthesesNode(body, opening_loc, closing_loc, location = T.unsafe(nil)); end
+
+ # Create a new PinnedExpressionNode node
+ #
+ # source://prism//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
+ def PinnedVariableNode(variable, operator_loc, location = T.unsafe(nil)); end
+
+ # Create a new PostExecutionNode node
+ #
+ # source://prism//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
+ 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
+ def ProgramNode(locals, statements, location = T.unsafe(nil)); end
+
+ # Create a new RangeNode node
+ #
+ # source://prism//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
+ def RationalNode(numeric, location = T.unsafe(nil)); end
+
+ # Create a new RedoNode node
+ #
+ # source://prism//prism/dsl.rb#651
+ def RedoNode(location = T.unsafe(nil)); end
+
+ # Create a new RegularExpressionNode node
+ #
+ # source://prism//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
+
+ # Create a new RequiredParameterNode node
+ #
+ # source://prism//prism/dsl.rb#666
+ def RequiredParameterNode(name, location = T.unsafe(nil)); end
+
+ # Create a new RescueModifierNode node
+ #
+ # source://prism//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
+ 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
+
+ # Create a new RetryNode node
+ #
+ # source://prism//prism/dsl.rb#686
+ def RetryNode(location = T.unsafe(nil)); end
+
+ # Create a new ReturnNode node
+ #
+ # source://prism//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
+ def SelfNode(location = T.unsafe(nil)); end
+
+ # Create a new SingletonClassNode node
+ #
+ # source://prism//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
+ def SourceEncodingNode(location = T.unsafe(nil)); end
+
+ # Create a new SourceFileNode node
+ #
+ # source://prism//prism/dsl.rb#711
+ def SourceFileNode(filepath, location = T.unsafe(nil)); end
+
+ # Create a new SourceLineNode node
+ #
+ # source://prism//prism/dsl.rb#716
+ def SourceLineNode(location = T.unsafe(nil)); end
+
+ # Create a new SplatNode node
+ #
+ # source://prism//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
+ def StatementsNode(body, location = T.unsafe(nil)); end
+
+ # Create a new StringNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def TrueNode(location = T.unsafe(nil)); end
+
+ # Create a new UndefNode node
+ #
+ # source://prism//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
+ 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
+ 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
+ def WhenNode(keyword_loc, conditions, statements, location = T.unsafe(nil)); end
+
+ # Create a new WhileNode node
+ #
+ # source://prism//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
+ 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
+ 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.
+module Prism::Debug
+ class << self
+ # :call-seq:
+ # Debug::cruby_locals(source) -> Array
+ #
+ # 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
+ def cruby_locals(source); end
+
+ def inspect_node(_arg0); end
+ def memsize(_arg0); end
+ def named_captures(_arg0); end
+
+ # :call-seq:
+ # Debug::newlines(source) -> Array
+ #
+ # For the given source string, return the byte offsets of every newline in
+ # the source.
+ #
+ # source://prism//prism/debug.rb#196
+ def newlines(source); end
+
+ # :call-seq:
+ # Debug::prism_locals(source) -> Array
+ #
+ # 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
+ def prism_locals(source); end
+
+ def profile_file(_arg0); end
+ end
+end
+
+# Used to hold the place of a local that will be in the local table but
+# cannot be accessed directly from the source code. For example, the
+# iteration variable in a for loop or the positional parameter on a method
+# definition that is destructured.
+#
+# source://prism//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.
+class Prism::Debug::ISeq
+ # @return [ISeq] a new instance of ISeq
+ #
+ # source://prism//prism/debug.rb#12
+ def initialize(parts); end
+
+ # source://prism//prism/debug.rb#28
+ def each_child; end
+
+ # source://prism//prism/debug.rb#24
+ def instructions; end
+
+ # source://prism//prism/debug.rb#20
+ def local_table; end
+
+ # source://prism//prism/debug.rb#10
+ def parts; end
+
+ # source://prism//prism/debug.rb#16
+ def type; end
+end
+
+# Represents a method definition.
+#
+# def method
+# end
+# ^^^^^^^^^^
+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
+ #
+ # @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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5296
+ def accept(visitor); end
+
+ # attr_reader body: Node?
+ #
+ # source://prism//prism/node.rb#5251
+ def body; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5301
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5315
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5306
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> DefNode
+ #
+ # source://prism//prism/node.rb#5320
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5301
+ 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#5343
+ def deconstruct_keys(keys); end
+
+ # def def_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#5348
+ def def_keyword; end
+
+ # attr_reader def_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#5260
+ def def_keyword_loc; end
+
+ # def end_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#5373
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#5275
+ def end_keyword_loc; end
+
+ # def equal: () -> String?
+ #
+ # source://prism//prism/node.rb#5368
+ def equal; end
+
+ # attr_reader equal_loc: Location?
+ #
+ # source://prism//prism/node.rb#5272
+ def equal_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5378
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#5254
+ 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
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#5266
+ def lparen_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#5239
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#5242
+ def name_loc; end
+
+ # def operator: () -> String?
+ #
+ # source://prism//prism/node.rb#5353
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#5263
+ def operator_loc; end
+
+ # attr_reader parameters: ParametersNode?
+ #
+ # source://prism//prism/node.rb#5248
+ def parameters; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#5245
+ def receiver; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#5363
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#5269
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5425
+ 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#5435
+ def type; end
+ end
+end
+
+# Represents the use of the `defined?` keyword.
+#
+# defined?(a)
+# ^^^^^^^^^^^
+class Prism::DefinedNode < ::Prism::Node
+ # def initialize: (lparen_loc: Location?, value: Node, rparen_loc: Location?, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [DefinedNode] a new instance of DefinedNode
+ #
+ # source://prism//prism/node.rb#5458
+ def initialize(lparen_loc, value, rparen_loc, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5467
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5472
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5482
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5477
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> DefinedNode
+ #
+ # source://prism//prism/node.rb#5487
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5472
+ 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#5501
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5521
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#5516
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#5455
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # source://prism//prism/node.rb#5506
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#5446
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#5511
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#5452
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5545
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#5449
+ 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#5555
+ 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.
+class Prism::DesugarCompiler < ::Prism::MutationCompiler
+ # @@foo &&= bar
+ #
+ # becomes
+ #
+ # @@foo && @@foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#12
+ def visit_class_variable_and_write_node(node); end
+
+ # @@foo += bar
+ #
+ # becomes
+ #
+ # @@foo = @@foo + bar
+ #
+ # source://prism//prism/desugar_compiler.rb#30
+ def visit_class_variable_operator_write_node(node); end
+
+ # @@foo ||= bar
+ #
+ # becomes
+ #
+ # defined?(@@foo) ? @@foo : @@foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#21
+ def visit_class_variable_or_write_node(node); end
+
+ # Foo &&= bar
+ #
+ # becomes
+ #
+ # Foo && Foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#39
+ def visit_constant_and_write_node(node); end
+
+ # Foo += bar
+ #
+ # becomes
+ #
+ # Foo = Foo + bar
+ #
+ # source://prism//prism/desugar_compiler.rb#57
+ def visit_constant_operator_write_node(node); end
+
+ # Foo ||= bar
+ #
+ # becomes
+ #
+ # defined?(Foo) ? Foo : Foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#48
+ def visit_constant_or_write_node(node); end
+
+ # $foo &&= bar
+ #
+ # becomes
+ #
+ # $foo && $foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#66
+ def visit_global_variable_and_write_node(node); end
+
+ # $foo += bar
+ #
+ # becomes
+ #
+ # $foo = $foo + bar
+ #
+ # source://prism//prism/desugar_compiler.rb#84
+ def visit_global_variable_operator_write_node(node); end
+
+ # $foo ||= bar
+ #
+ # becomes
+ #
+ # defined?($foo) ? $foo : $foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#75
+ def visit_global_variable_or_write_node(node); end
+
+ # becomes
+ #
+ # source://prism//prism/desugar_compiler.rb#93
+ def visit_instance_variable_and_write_node(node); end
+
+ # becomes
+ #
+ # source://prism//prism/desugar_compiler.rb#111
+ def visit_instance_variable_operator_write_node(node); end
+
+ # becomes
+ #
+ # source://prism//prism/desugar_compiler.rb#102
+ def visit_instance_variable_or_write_node(node); end
+
+ # foo &&= bar
+ #
+ # becomes
+ #
+ # foo && foo = bar
+ #
+ # source://prism//prism/desugar_compiler.rb#120
+ def visit_local_variable_and_write_node(node); end
+
+ # foo += bar
+ #
+ # becomes
+ #
+ # foo = foo + bar
+ #
+ # source://prism//prism/desugar_compiler.rb#138
+ def visit_local_variable_operator_write_node(node); end
+
+ # foo ||= bar
+ #
+ # becomes
+ #
+ # foo || foo = bar
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ def desugar_or_write_node(node, read_class, write_class, *arguments); end
+end
+
+# The dispatcher class fires events for nodes that are found while walking an
+# AST to all registered listeners. It's useful for performing different types
+# of analysis on the AST while only having to walk the tree once.
+#
+# To use the dispatcher, you would first instantiate it and register listeners
+# for the events you're interested in:
+#
+# class OctalListener
+# def on_integer_node_enter(node)
+# if node.octal? && !node.slice.start_with?("0o")
+# warn("Octal integers should be written with the 0o prefix")
+# end
+# end
+# end
+#
+# dispatcher = Dispatcher.new
+# dispatcher.register(listener, :on_integer_node_enter)
+#
+# Then, you can walk any number of trees and dispatch events to the listeners:
+#
+# result = Prism.parse("001 + 002 + 003")
+# dispatcher.dispatch(result.value)
+#
+# Optionally, you can also use `#dispatch_once` to dispatch enter and leave
+# events for a single node without recursing further down the tree. This can
+# be useful in circumstances where you want to reuse the listeners you already
+# have registers but want to stop walking the tree at a certain point.
+#
+# integer = result.value.statements.body.first.receiver.receiver
+# dispatcher.dispatch_once(integer)
+class Prism::Dispatcher < ::Prism::Visitor
+ # Initialize a new dispatcher.
+ #
+ # @return [Dispatcher] a new instance of Dispatcher
+ #
+ # source://prism//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
+ 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
+ def dispatch_once(node); end
+
+ # attr_reader listeners: Hash[Symbol, Array[Listener]]
+ #
+ # source://prism//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
+ def register(listener, *events); end
+
+ # Dispatch enter and leave events for AliasGlobalVariableNode nodes and continue
+ # walking the tree.
+ #
+ # source://prism//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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ 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
+ def visit_yield_node(node); end
+end
+
+class Prism::Dispatcher::DispatchOnce < ::Prism::Visitor
+ # @return [DispatchOnce] a new instance of DispatchOnce
+ #
+ # source://prism//prism/dispatcher.rb#1255
+ def initialize(listeners); end
+
+ # Returns the value of attribute listeners.
+ #
+ # source://prism//prism/dispatcher.rb#1253
+ def listeners; end
+
+ # Dispatch enter and leave events for AliasGlobalVariableNode nodes.
+ #
+ # source://prism//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
+ def visit_alias_method_node(node); end
+
+ # Dispatch enter and leave events for AlternationPatternNode nodes.
+ #
+ # source://prism//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
+ def visit_and_node(node); end
+
+ # Dispatch enter and leave events for ArgumentsNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1284
+ def visit_arguments_node(node); end
+
+ # Dispatch enter and leave events for ArrayNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1290
+ def visit_array_node(node); end
+
+ # Dispatch enter and leave events for ArrayPatternNode nodes.
+ #
+ # source://prism//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
+ def visit_assoc_node(node); end
+
+ # Dispatch enter and leave events for AssocSplatNode nodes.
+ #
+ # source://prism//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
+ def visit_back_reference_read_node(node); end
+
+ # Dispatch enter and leave events for BeginNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1320
+ def visit_begin_node(node); end
+
+ # Dispatch enter and leave events for BlockArgumentNode nodes.
+ #
+ # source://prism//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
+ def visit_block_local_variable_node(node); end
+
+ # Dispatch enter and leave events for BlockNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1338
+ def visit_block_node(node); end
+
+ # Dispatch enter and leave events for BlockParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_block_parameters_node(node); end
+
+ # Dispatch enter and leave events for BreakNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1356
+ def visit_break_node(node); end
+
+ # Dispatch enter and leave events for CallAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_call_node(node); end
+
+ # Dispatch enter and leave events for CallOperatorWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_call_or_write_node(node); end
+
+ # Dispatch enter and leave events for CallTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_capture_pattern_node(node); end
+
+ # Dispatch enter and leave events for CaseMatchNode nodes.
+ #
+ # source://prism//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
+ def visit_case_node(node); end
+
+ # Dispatch enter and leave events for ClassNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1410
+ def visit_class_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_class_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_class_variable_read_node(node); end
+
+ # Dispatch enter and leave events for ClassVariableTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_class_variable_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_path_and_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_path_operator_write_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_path_target_node(node); end
+
+ # Dispatch enter and leave events for ConstantPathWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_read_node(node); end
+
+ # Dispatch enter and leave events for ConstantTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_constant_write_node(node); end
+
+ # Dispatch enter and leave events for DefNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1524
+ def visit_def_node(node); end
+
+ # Dispatch enter and leave events for DefinedNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1530
+ def visit_defined_node(node); end
+
+ # Dispatch enter and leave events for ElseNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1536
+ def visit_else_node(node); end
+
+ # Dispatch enter and leave events for EmbeddedStatementsNode nodes.
+ #
+ # source://prism//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
+ def visit_embedded_variable_node(node); end
+
+ # Dispatch enter and leave events for EnsureNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1554
+ def visit_ensure_node(node); end
+
+ # Dispatch enter and leave events for FalseNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1560
+ def visit_false_node(node); end
+
+ # Dispatch enter and leave events for FindPatternNode nodes.
+ #
+ # source://prism//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
+ def visit_flip_flop_node(node); end
+
+ # Dispatch enter and leave events for FloatNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1578
+ def visit_float_node(node); end
+
+ # Dispatch enter and leave events for ForNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1584
+ def visit_for_node(node); end
+
+ # Dispatch enter and leave events for ForwardingArgumentsNode nodes.
+ #
+ # source://prism//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
+ def visit_forwarding_parameter_node(node); end
+
+ # Dispatch enter and leave events for ForwardingSuperNode nodes.
+ #
+ # source://prism//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
+ def visit_global_variable_and_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableOperatorWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_global_variable_or_write_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableReadNode nodes.
+ #
+ # source://prism//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
+ def visit_global_variable_target_node(node); end
+
+ # Dispatch enter and leave events for GlobalVariableWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_hash_node(node); end
+
+ # Dispatch enter and leave events for HashPatternNode nodes.
+ #
+ # source://prism//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
+ def visit_if_node(node); end
+
+ # Dispatch enter and leave events for ImaginaryNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1662
+ def visit_imaginary_node(node); end
+
+ # Dispatch enter and leave events for ImplicitNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1668
+ def visit_implicit_node(node); end
+
+ # Dispatch enter and leave events for ImplicitRestNode nodes.
+ #
+ # source://prism//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
+ def visit_in_node(node); end
+
+ # Dispatch enter and leave events for IndexAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_index_operator_write_node(node); end
+
+ # Dispatch enter and leave events for IndexOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_index_target_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_instance_variable_read_node(node); end
+
+ # Dispatch enter and leave events for InstanceVariableTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_instance_variable_write_node(node); end
+
+ # Dispatch enter and leave events for IntegerNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1746
+ def visit_integer_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedMatchLastLineNode nodes.
+ #
+ # source://prism//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
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedStringNode nodes.
+ #
+ # source://prism//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
+ def visit_interpolated_symbol_node(node); end
+
+ # Dispatch enter and leave events for InterpolatedXStringNode nodes.
+ #
+ # source://prism//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
+ def visit_keyword_hash_node(node); end
+
+ # Dispatch enter and leave events for KeywordRestParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_lambda_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableAndWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_local_variable_operator_write_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableOrWriteNode nodes.
+ #
+ # source://prism//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
+ def visit_local_variable_read_node(node); end
+
+ # Dispatch enter and leave events for LocalVariableTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_local_variable_write_node(node); end
+
+ # Dispatch enter and leave events for MatchLastLineNode nodes.
+ #
+ # source://prism//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
+ def visit_match_predicate_node(node); end
+
+ # Dispatch enter and leave events for MatchRequiredNode nodes.
+ #
+ # source://prism//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
+ def visit_match_write_node(node); end
+
+ # Dispatch enter and leave events for MissingNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1860
+ def visit_missing_node(node); end
+
+ # Dispatch enter and leave events for ModuleNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1866
+ def visit_module_node(node); end
+
+ # Dispatch enter and leave events for MultiTargetNode nodes.
+ #
+ # source://prism//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
+ def visit_multi_write_node(node); end
+
+ # Dispatch enter and leave events for NextNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1884
+ def visit_next_node(node); end
+
+ # Dispatch enter and leave events for NilNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1890
+ def visit_nil_node(node); end
+
+ # Dispatch enter and leave events for NoKeywordsParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_numbered_parameters_node(node); end
+
+ # Dispatch enter and leave events for NumberedReferenceReadNode nodes.
+ #
+ # source://prism//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
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for OptionalParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_or_node(node); end
+
+ # Dispatch enter and leave events for ParametersNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1932
+ def visit_parameters_node(node); end
+
+ # Dispatch enter and leave events for ParenthesesNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1938
+ def visit_parentheses_node(node); end
+
+ # Dispatch enter and leave events for PinnedExpressionNode nodes.
+ #
+ # source://prism//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
+ def visit_pinned_variable_node(node); end
+
+ # Dispatch enter and leave events for PostExecutionNode nodes.
+ #
+ # source://prism//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
+ def visit_pre_execution_node(node); end
+
+ # Dispatch enter and leave events for ProgramNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1968
+ def visit_program_node(node); end
+
+ # Dispatch enter and leave events for RangeNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1974
+ def visit_range_node(node); end
+
+ # Dispatch enter and leave events for RationalNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1980
+ def visit_rational_node(node); end
+
+ # Dispatch enter and leave events for RedoNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#1986
+ def visit_redo_node(node); end
+
+ # Dispatch enter and leave events for RegularExpressionNode nodes.
+ #
+ # source://prism//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
+ def visit_required_keyword_parameter_node(node); end
+
+ # Dispatch enter and leave events for RequiredParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_rescue_modifier_node(node); end
+
+ # Dispatch enter and leave events for RescueNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2016
+ def visit_rescue_node(node); end
+
+ # Dispatch enter and leave events for RestParameterNode nodes.
+ #
+ # source://prism//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
+ def visit_retry_node(node); end
+
+ # Dispatch enter and leave events for ReturnNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2034
+ def visit_return_node(node); end
+
+ # Dispatch enter and leave events for SelfNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2040
+ def visit_self_node(node); end
+
+ # Dispatch enter and leave events for SingletonClassNode nodes.
+ #
+ # source://prism//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
+ def visit_source_encoding_node(node); end
+
+ # Dispatch enter and leave events for SourceFileNode nodes.
+ #
+ # source://prism//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
+ def visit_source_line_node(node); end
+
+ # Dispatch enter and leave events for SplatNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2070
+ def visit_splat_node(node); end
+
+ # Dispatch enter and leave events for StatementsNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2076
+ def visit_statements_node(node); end
+
+ # Dispatch enter and leave events for StringNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2082
+ def visit_string_node(node); end
+
+ # Dispatch enter and leave events for SuperNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2088
+ def visit_super_node(node); end
+
+ # Dispatch enter and leave events for SymbolNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2094
+ def visit_symbol_node(node); end
+
+ # Dispatch enter and leave events for TrueNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2100
+ def visit_true_node(node); end
+
+ # Dispatch enter and leave events for UndefNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2106
+ def visit_undef_node(node); end
+
+ # Dispatch enter and leave events for UnlessNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2112
+ def visit_unless_node(node); end
+
+ # Dispatch enter and leave events for UntilNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2118
+ def visit_until_node(node); end
+
+ # Dispatch enter and leave events for WhenNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2124
+ def visit_when_node(node); end
+
+ # Dispatch enter and leave events for WhileNode nodes.
+ #
+ # source://prism//prism/dispatcher.rb#2130
+ def visit_while_node(node); end
+
+ # Dispatch enter and leave events for XStringNode nodes.
+ #
+ # source://prism//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
+ def visit_yield_node(node); end
+end
+
+# Represents an `else` clause in a `case`, `if`, or `unless` statement.
+#
+# 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
+ #
+ # @return [ElseNode] a new instance of ElseNode
+ #
+ # source://prism//prism/node.rb#5575
+ def initialize(else_keyword_loc, statements, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5583
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5588
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5600
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5593
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ElseNode
+ #
+ # source://prism//prism/node.rb#5605
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5588
+ 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#5618
+ def deconstruct_keys(keys); end
+
+ # def else_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#5623
+ def else_keyword; end
+
+ # attr_reader else_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#5566
+ def else_keyword_loc; end
+
+ # def end_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#5628
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#5572
+ def end_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5633
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#5569
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5660
+ 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#5670
+ def type; end
+ end
+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.
+ #
+ # source://prism//prism/parse_result.rb#267
+ def inspect; end
+
+ # This can only be true for inline comments.
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/parse_result.rb#262
+ def trailing?; end
+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
+ #
+ # @return [EmbeddedStatementsNode] a new instance of EmbeddedStatementsNode
+ #
+ # source://prism//prism/node.rb#5690
+ def initialize(opening_loc, statements, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5698
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5703
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#5743
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#5687
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5715
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5708
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> EmbeddedStatementsNode
+ #
+ # source://prism//prism/node.rb#5720
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5703
+ 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#5733
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5748
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#5738
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#5681
+ def opening_loc; end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#5684
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5775
+ 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#5785
+ def type; end
+ end
+end
+
+# Represents an interpolated variable.
+#
+# "foo #@bar"
+# ^^^^^
+class Prism::EmbeddedVariableNode < ::Prism::Node
+ # def initialize: (operator_loc: Location, variable: Node, location: Location) -> void
+ #
+ # @return [EmbeddedVariableNode] a new instance of EmbeddedVariableNode
+ #
+ # source://prism//prism/node.rb#5802
+ def initialize(operator_loc, variable, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5809
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5814
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5824
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5819
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> EmbeddedVariableNode
+ #
+ # source://prism//prism/node.rb#5829
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5814
+ 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#5841
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5851
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#5846
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#5796
+ 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//prism/node.rb#5873
+ def type; end
+
+ # attr_reader variable: Node
+ #
+ # source://prism//prism/node.rb#5799
+ def variable; end
+
+ class << self
+ # Similar to #type, this method returns a symbol that you can use for
+ # splitting on the type of the node without having to do a long === chain.
+ # Note that like #type, it will still be slower than using == for a single
+ # class, but should be faster in a case statement or an array comparison.
+ #
+ # def self.type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5883
+ def type; end
+ end
+end
+
+# Flags for nodes that have unescaped content.
+module Prism::EncodingFlags; 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)
+
+# 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)
+
+# 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
+ #
+ # @return [EnsureNode] a new instance of EnsureNode
+ #
+ # source://prism//prism/node.rb#5907
+ def initialize(ensure_keyword_loc, statements, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#5915
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5920
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#5932
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#5925
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> EnsureNode
+ #
+ # source://prism//prism/node.rb#5937
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#5920
+ 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#5950
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#5960
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#5904
+ def end_keyword_loc; end
+
+ # def ensure_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#5955
+ def ensure_keyword; end
+
+ # attr_reader ensure_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#5898
+ def ensure_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#5965
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#5901
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#5992
+ 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#6002
+ def type; end
+ end
+end
+
+# Represents the use of the literal `false` keyword.
+#
+# false
+# ^^^^^
+class Prism::FalseNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [FalseNode] a new instance of FalseNode
+ #
+ # source://prism//prism/node.rb#6013
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6018
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6023
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6033
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6028
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> FalseNode
+ #
+ # source://prism//prism/node.rb#6038
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6023
+ 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#6048
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6053
+ 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//prism/node.rb#6072
+ 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#6082
+ def type; end
+ end
+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
+ #
+ # @return [FindPatternNode] a new instance of FindPatternNode
+ #
+ # source://prism//prism/node.rb#6117
+ def initialize(constant, left, requireds, right, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6128
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6133
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#6179
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#6114
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6148
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6138
+ def compact_child_nodes; end
+
+ # attr_reader constant: Node?
+ #
+ # source://prism//prism/node.rb#6099
+ def constant; end
+
+ # def copy: (**params) -> FindPatternNode
+ #
+ # source://prism//prism/node.rb#6153
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6133
+ 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#6169
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6184
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node
+ #
+ # source://prism//prism/node.rb#6102
+ def left; end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#6174
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#6111
+ def opening_loc; end
+
+ # attr_reader requireds: Array[Node]
+ #
+ # source://prism//prism/node.rb#6105
+ def requireds; end
+
+ # attr_reader right: Node
+ #
+ # source://prism//prism/node.rb#6108
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#6216
+ 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#6226
+ def type; end
+ end
+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
+ #
+ # @return [FlipFlopNode] a new instance of FlipFlopNode
+ #
+ # source://prism//prism/node.rb#6249
+ def initialize(flags, left, right, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6258
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6263
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6276
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6268
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> FlipFlopNode
+ #
+ # source://prism//prism/node.rb#6281
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6263
+ 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#6295
+ def deconstruct_keys(keys); end
+
+ # def exclude_end?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#6300
+ def exclude_end?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6310
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node?
+ #
+ # source://prism//prism/node.rb#6240
+ def left; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#6305
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#6246
+ def operator_loc; end
+
+ # attr_reader right: Node?
+ #
+ # source://prism//prism/node.rb#6243
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#6344
+ def type; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#6237
+ 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#6354
+ def type; end
+ end
+end
+
+# Represents a floating point number literal.
+#
+# 1.0
+# ^^^
+class Prism::FloatNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [FloatNode] a new instance of FloatNode
+ #
+ # source://prism//prism/node.rb#6365
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6370
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6375
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6385
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6380
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> FloatNode
+ #
+ # source://prism//prism/node.rb#6390
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6375
+ 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#6400
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6405
+ 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//prism/node.rb#6424
+ def type; end
+
+ # Returns the value of the node as a Ruby Float.
+ #
+ # source://prism//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.
+ # 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
+
+# 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
+ #
+ # @return [ForNode] a new instance of ForNode
+ #
+ # 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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6478
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6483
+ def child_nodes; end
+
+ # attr_reader collection: Node
+ #
+ # source://prism//prism/node.rb#6448
+ def collection; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6497
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6488
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ForNode
+ #
+ # source://prism//prism/node.rb#6502
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6483
+ 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#6519
+ def deconstruct_keys(keys); end
+
+ # def do_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#6534
+ def do_keyword; end
+
+ # attr_reader do_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#6460
+ def do_keyword_loc; end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#6539
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#6463
+ def end_keyword_loc; end
+
+ # def for_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#6524
+ def for_keyword; end
+
+ # attr_reader for_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#6454
+ def for_keyword_loc; end
+
+ # def in_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#6529
+ def in_keyword; end
+
+ # attr_reader in_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#6457
+ def in_keyword_loc; end
+
+ # attr_reader index: Node
+ #
+ # source://prism//prism/node.rb#6445
+ def index; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6544
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#6451
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#6577
+ 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#6587
+ def type; end
+ end
+end
+
+# Represents forwarding all arguments to this method to another method.
+#
+# def foo(...)
+# bar(...)
+# ^^^
+# end
+class Prism::ForwardingArgumentsNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [ForwardingArgumentsNode] a new instance of ForwardingArgumentsNode
+ #
+ # source://prism//prism/node.rb#6600
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6605
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6610
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6620
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6615
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ForwardingArgumentsNode
+ #
+ # source://prism//prism/node.rb#6625
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6610
+ 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#6635
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6640
+ 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//prism/node.rb#6659
+ 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#6669
+ def type; end
+ end
+end
+
+# Represents the use of the forwarding parameter in a method, block, or lambda declaration.
+#
+# 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//prism/node.rb#6686
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6691
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6701
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6696
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ForwardingParameterNode
+ #
+ # source://prism//prism/node.rb#6706
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6691
+ 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#6716
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6721
+ 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//prism/node.rb#6740
+ 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#6750
+ def type; end
+ end
+end
+
+# Represents the use of the `super` keyword without parentheses or arguments.
+#
+# super
+# ^^^^^
+class Prism::ForwardingSuperNode < ::Prism::Node
+ # def initialize: (block: BlockNode?, location: Location) -> void
+ #
+ # @return [ForwardingSuperNode] a new instance of ForwardingSuperNode
+ #
+ # source://prism//prism/node.rb#6764
+ def initialize(block, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6770
+ 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
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6787
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6780
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ForwardingSuperNode
+ #
+ # source://prism//prism/node.rb#6792
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6775
+ 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#6803
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6808
+ 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//prism/node.rb#6833
+ 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#6843
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator for assignment to a global variable.
+#
+# $target &&= value
+# ^^^^^^^^^^^^^^^^^
+class Prism::GlobalVariableAndWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [GlobalVariableAndWriteNode] a new instance of GlobalVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#6866
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6875
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6880
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#6890
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6885
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#6895
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6880
+ 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#6909
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#6919
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#6854
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#6857
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#6914
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#6860
+ 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//prism/node.rb#6943
+ 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.
+ # 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#6953
+ def type; end
+ end
+end
+
+# Represents assigning to a global variable using an operator that isn't `=`.
+#
+# $target += value
+# ^^^^^^^^^^^^^^^^
+class Prism::GlobalVariableOperatorWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void
+ #
+ # @return [GlobalVariableOperatorWriteNode] a new instance of GlobalVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#6979
+ def initialize(name, name_loc, operator_loc, value, operator, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#6989
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6994
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7004
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#6999
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#7009
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#6994
+ 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#7024
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7029
+ 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
+ # 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//prism/node.rb#7054
+ 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.
+ # 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#7064
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a global variable.
+#
+# $target ||= value
+# ^^^^^^^^^^^^^^^^^
+class Prism::GlobalVariableOrWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [GlobalVariableOrWriteNode] a new instance of GlobalVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#7087
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7096
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7101
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7111
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7106
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#7116
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7101
+ 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#7130
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7140
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#7075
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#7078
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#7135
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#7081
+ 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//prism/node.rb#7164
+ 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.
+ # 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#7174
+ def type; end
+ end
+end
+
+# Represents referencing a global variable.
+#
+# $foo
+# ^^^^
+class Prism::GlobalVariableReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [GlobalVariableReadNode] a new instance of GlobalVariableReadNode
+ #
+ # source://prism//prism/node.rb#7188
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7194
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7199
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7209
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7204
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableReadNode
+ #
+ # source://prism//prism/node.rb#7214
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7199
+ 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#7225
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7230
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#7185
+ 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
+ # 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//prism/node.rb#7250
+ 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#7260
+ def type; end
+ end
+end
+
+# Represents writing to a global variable in a context that doesn't have an explicit value.
+#
+# $foo, $bar = baz
+# ^^^^ ^^^^
+class Prism::GlobalVariableTargetNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [GlobalVariableTargetNode] a new instance of GlobalVariableTargetNode
+ #
+ # source://prism//prism/node.rb#7274
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7280
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7285
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7295
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7290
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableTargetNode
+ #
+ # source://prism//prism/node.rb#7300
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7285
+ 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#7311
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7316
+ 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
+ # 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//prism/node.rb#7336
+ 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#7346
+ def type; end
+ end
+end
+
+# Represents writing to a global variable.
+#
+# $foo = 1
+# ^^^^^^^^
+class Prism::GlobalVariableWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, value: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [GlobalVariableWriteNode] a new instance of GlobalVariableWriteNode
+ #
+ # source://prism//prism/node.rb#7369
+ def initialize(name, name_loc, value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7378
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7383
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7393
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7388
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> GlobalVariableWriteNode
+ #
+ # source://prism//prism/node.rb#7398
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7383
+ 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#7412
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7422
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#7357
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#7360
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#7417
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#7366
+ 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//prism/node.rb#7446
+ 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.
+ # 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#7456
+ def type; end
+ end
+end
+
+# Represents a hash literal.
+#
+# { a => b }
+# ^^^^^^^^^^
+class Prism::HashNode < ::Prism::Node
+ # def initialize: (opening_loc: Location, elements: Array[Node], closing_loc: Location, location: Location) -> void
+ #
+ # @return [HashNode] a new instance of HashNode
+ #
+ # source://prism//prism/node.rb#7476
+ def initialize(opening_loc, elements, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7484
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7489
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7494
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> HashNode
+ #
+ # source://prism//prism/node.rb#7504
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7489
+ 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#7517
+ def deconstruct_keys(keys); end
+
+ # attr_reader elements: Array[Node]
+ #
+ # source://prism//prism/node.rb#7470
+ def elements; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7532
+ 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
+ # 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//prism/node.rb#7554
+ 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#7564
+ def type; end
+ end
+end
+
+# Represents a hash pattern in pattern matching.
+#
+# foo => { a: 1, b: 2 }
+# ^^^^^^^^^^^^^^
+#
+# 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
+ #
+ # @return [HashPatternNode] a new instance of HashPatternNode
+ #
+ # source://prism//prism/node.rb#7593
+ def initialize(constant, elements, rest, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7603
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7608
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7613
+ def compact_child_nodes; end
+
+ # attr_reader constant: Node?
+ #
+ # source://prism//prism/node.rb#7578
+ def constant; end
+
+ # def copy: (**params) -> HashPatternNode
+ #
+ # source://prism//prism/node.rb#7627
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7608
+ 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#7642
+ def deconstruct_keys(keys); end
+
+ # attr_reader elements: Array[Node]
+ #
+ # source://prism//prism/node.rb#7581
+ def elements; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7657
+ 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
+ # 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//prism/node.rb#7691
+ 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#7701
+ 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.
+#
+# bar if foo
+# ^^^^^^^^^^
+#
+# 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
+ #
+ # @return [IfNode] a new instance of IfNode
+ #
+ # source://prism//prism/node.rb#7733
+ def initialize(if_keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7744
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7753
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7767
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7758
+ def compact_child_nodes; end
+
+ # attr_reader consequent: Node?
+ #
+ # source://prism//prism/node.rb#7727
+ def consequent; end
+
+ # def copy: (**params) -> IfNode
+ #
+ # source://prism//prism/node.rb#7772
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7753
+ 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#7788
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#7803
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#7730
+ def end_keyword_loc; end
+
+ # def if_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#7793
+ def if_keyword; end
+
+ # attr_reader if_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#7715
+ def if_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7808
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader predicate: Node
+ #
+ # source://prism//prism/node.rb#7718
+ def predicate; end
+
+ # source://prism//prism/node.rb#7748
+ def set_newline_flag(newline_marked); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#7724
+ def statements; end
+
+ # def then_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#7798
+ def then_keyword; end
+
+ # attr_reader then_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#7721
+ def then_keyword_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # 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//prism/node.rb#7844
+ 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#7854
+ def type; end
+ end
+end
+
+# Represents an imaginary number literal.
+#
+# 1.0i
+# ^^^^
+class Prism::ImaginaryNode < ::Prism::Node
+ # def initialize: (numeric: Node, location: Location) -> void
+ #
+ # @return [ImaginaryNode] a new instance of ImaginaryNode
+ #
+ # source://prism//prism/node.rb#7868
+ def initialize(numeric, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7874
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7879
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7889
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7884
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ImaginaryNode
+ #
+ # source://prism//prism/node.rb#7894
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7879
+ 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#7905
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#7910
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader numeric: Node
+ #
+ # source://prism//prism/node.rb#7865
+ 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
+ # 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//prism/node.rb#7931
+ def type; end
+
+ # Returns the value of the node as a Ruby Complex.
+ #
+ # source://prism//prism/node_ext.rb#69
+ 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#7941
+ 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.
+#
+# { foo: }
+# ^^^^
+#
+# { Foo: }
+# ^^^^
+class Prism::ImplicitNode < ::Prism::Node
+ # def initialize: (value: Node, location: Location) -> void
+ #
+ # @return [ImplicitNode] a new instance of ImplicitNode
+ #
+ # source://prism//prism/node.rb#7959
+ def initialize(value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#7965
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7970
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#7980
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#7975
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ImplicitNode
+ #
+ # source://prism//prism/node.rb#7985
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#7970
+ 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#7996
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#8001
+ 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//prism/node.rb#8022
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#7956
+ 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#8032
+ def type; end
+ end
+end
+
+# Represents using a trailing comma to indicate an implicit rest parameter.
+#
+# foo { |bar,| }
+# ^
+#
+# foo in [bar,]
+# ^
+#
+# for foo, in bar do end
+# ^
+#
+# foo, = bar
+# ^
+class Prism::ImplicitRestNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [ImplicitRestNode] a new instance of ImplicitRestNode
+ #
+ # source://prism//prism/node.rb#8052
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8057
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8062
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#8072
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#8067
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ImplicitRestNode
+ #
+ # source://prism//prism/node.rb#8077
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8062
+ 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#8087
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#8092
+ 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//prism/node.rb#8111
+ 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#8121
+ def type; end
+ end
+end
+
+# Represents the use of the `in` keyword in a case statement.
+#
+# 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
+ #
+ # @return [InNode] a new instance of InNode
+ #
+ # source://prism//prism/node.rb#8144
+ def initialize(pattern, statements, in_loc, then_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8153
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8158
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#8171
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#8163
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InNode
+ #
+ # source://prism//prism/node.rb#8176
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8158
+ 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#8190
+ 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
+ #
+ # source://prism//prism/node.rb#8205
+ 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?
+ #
+ # source://prism//prism/node.rb#8141
+ 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
+ # 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//prism/node.rb#8234
+ 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#8244
+ def type; end
+ end
+end
+
+# Represents the use of the `&&=` operator on a call to the `[]` method.
+#
+# 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
+ #
+ # @return [IndexAndWriteNode] a new instance of IndexAndWriteNode
+ #
+ # source://prism//prism/node.rb#8282
+ def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8296
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#8267
+ def arguments; end
+
+ # def attribute_write?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#8355
+ def attribute_write?; end
+
+ # attr_reader block: Node?
+ #
+ # source://prism//prism/node.rb#8273
+ def block; end
+
+ # def call_operator: () -> String?
+ #
+ # source://prism//prism/node.rb#8360
+ def call_operator; end
+
+ # attr_reader call_operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#8261
+ def call_operator_loc; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8301
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#8370
+ def closing; 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
+ #
+ # source://prism//prism/node.rb#8380
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#8365
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#8264
+ def opening_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#8375
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#8276
+ 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
+ # 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//prism/node.rb#8425
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#8279
+ 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.
+ # 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#8435
+ def type; end
+ end
+end
+
+# Represents the use of an assignment operator on a call to `[]`.
+#
+# 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
+ #
+ # @return [IndexOperatorWriteNode] a new instance of IndexOperatorWriteNode
+ #
+ # 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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8491
+ 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
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#8566
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#8461
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#8511
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#8501
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> IndexOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#8516
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8496
+ 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#8536
+ 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
+ #
+ # source://prism//prism/node.rb#8561
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#8455
+ def opening_loc; end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#8467
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#8470
+ def operator_loc; end
+
+ # attr_reader receiver: Node?
+ #
+ # source://prism//prism/node.rb#8449
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#8541
+ 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
+ # 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//prism/node.rb#8617
+ 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.
+ # 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#8627
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator on a call to `[]`.
+#
+# 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
+ #
+ # @return [IndexOrWriteNode] a new instance of IndexOrWriteNode
+ #
+ # source://prism//prism/node.rb#8665
+ def initialize(flags, receiver, call_operator_loc, opening_loc, arguments, closing_loc, block, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8679
+ 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
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#8753
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#8653
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#8699
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#8689
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> IndexOrWriteNode
+ #
+ # source://prism//prism/node.rb#8704
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8684
+ 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#8723
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#8763
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#8748
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#8647
+ 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]
+ #
+ # source://prism//prism/node.rb#8728
+ 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
+ # 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//prism/node.rb#8808
+ 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.
+ # 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#8818
+ def type; end
+ end
+end
+
+# Represents assigning to an index.
+#
+# foo[bar], = 1
+# ^^^^^^^^
+#
+# begin
+# rescue => foo[bar]
+# ^^^^^^^^
+# end
+#
+# for foo[bar] in baz do end
+# ^^^^^^^^
+class Prism::IndexTargetNode < ::Prism::Node
+ # def initialize: (flags: Integer, receiver: Node, opening_loc: Location, arguments: ArgumentsNode?, closing_loc: Location, block: Node?, location: Location) -> void
+ #
+ # @return [IndexTargetNode] a new instance of IndexTargetNode
+ #
+ # source://prism//prism/node.rb#8855
+ def initialize(flags, receiver, opening_loc, arguments, closing_loc, block, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#8866
+ 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
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#8876
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> IndexTargetNode
+ #
+ # source://prism//prism/node.rb#8890
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#8871
+ 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#8906
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#8936
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#8926
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#8843
+ def opening_loc; end
+
+ # attr_reader receiver: Node
+ #
+ # source://prism//prism/node.rb#8840
+ def receiver; end
+
+ # def safe_navigation?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#8911
+ 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
+ # 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//prism/node.rb#8973
+ 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.
+ # 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#8983
+ 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.
+#
+# @target &&= value
+# ^^^^^^^^^^^^^^^^^
+class Prism::InstanceVariableAndWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [InstanceVariableAndWriteNode] a new instance of InstanceVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#9006
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9015
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9020
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9030
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9025
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InstanceVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#9035
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9020
+ 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#9049
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9059
+ 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
+ #
+ # source://prism//prism/node.rb#9000
+ 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//prism/node.rb#9083
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#9003
+ 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#9093
+ def type; end
+ end
+end
+
+# Represents assigning to an instance variable using an operator that isn't `=`.
+#
+# @target += value
+# ^^^^^^^^^^^^^^^^
+class Prism::InstanceVariableOperatorWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, operator: Symbol, location: Location) -> void
+ #
+ # @return [InstanceVariableOperatorWriteNode] a new instance of InstanceVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#9119
+ def initialize(name, name_loc, operator_loc, value, operator, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9129
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9134
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9144
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9139
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InstanceVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#9149
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9134
+ 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#9164
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9169
+ 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
+ # 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//prism/node.rb#9194
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#9113
+ 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#9204
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to an instance variable.
+#
+# @target ||= value
+# ^^^^^^^^^^^^^^^^^
+class Prism::InstanceVariableOrWriteNode < ::Prism::Node
+ # def initialize: (name: Symbol, name_loc: Location, operator_loc: Location, value: Node, location: Location) -> void
+ #
+ # @return [InstanceVariableOrWriteNode] a new instance of InstanceVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#9227
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9236
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9241
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9251
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9246
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InstanceVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#9256
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9241
+ 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#9270
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9280
+ 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
+ # 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//prism/node.rb#9304
+ 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.
+ # 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#9314
+ def type; end
+ end
+end
+
+# Represents referencing an instance variable.
+#
+# @foo
+# ^^^^
+class Prism::InstanceVariableReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [InstanceVariableReadNode] a new instance of InstanceVariableReadNode
+ #
+ # source://prism//prism/node.rb#9328
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9334
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9339
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9349
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9344
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InstanceVariableReadNode
+ #
+ # source://prism//prism/node.rb#9354
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9339
+ 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#9365
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9370
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#9325
+ 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
+ # 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//prism/node.rb#9390
+ 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#9400
+ def type; end
+ end
+end
+
+# Represents writing to an instance variable in a context that doesn't have an explicit value.
+#
+# @foo, @bar = baz
+# ^^^^ ^^^^
+class Prism::InstanceVariableTargetNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [InstanceVariableTargetNode] a new instance of InstanceVariableTargetNode
+ #
+ # source://prism//prism/node.rb#9414
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9420
+ 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
+ #
+ # source://prism//prism/node.rb#9440
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # 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]
+ #
+ # source://prism//prism/node.rb#9451
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9456
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#9411
+ 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
+ # 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//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
+
+# 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
+ #
+ # source://prism//prism/node.rb#9509
+ def initialize(name, name_loc, value, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9518
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9523
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9533
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9528
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InstanceVariableWriteNode
+ #
+ # source://prism//prism/node.rb#9538
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9523
+ 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#9552
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9562
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#9497
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#9500
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#9557
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#9506
+ 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//prism/node.rb#9586
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#9503
+ 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#9596
+ def type; end
+ end
+end
+
+# Flags for integer nodes that correspond to the base of the integer.
+module Prism::IntegerBaseFlags; end
+
+# 0b prefix
+#
+# source://prism//prism/node.rb#17312
+Prism::IntegerBaseFlags::BINARY = T.let(T.unsafe(nil), Integer)
+
+# 0d or no prefix
+#
+# source://prism//prism/node.rb#17315
+Prism::IntegerBaseFlags::DECIMAL = T.let(T.unsafe(nil), Integer)
+
+# 0x prefix
+#
+# source://prism//prism/node.rb#17321
+Prism::IntegerBaseFlags::HEXADECIMAL = T.let(T.unsafe(nil), Integer)
+
+# 0o or 0 prefix
+#
+# source://prism//prism/node.rb#17318
+Prism::IntegerBaseFlags::OCTAL = T.let(T.unsafe(nil), Integer)
+
+# Represents an integer number literal.
+#
+# 1
+# ^
+class Prism::IntegerNode < ::Prism::Node
+ # def initialize: (flags: Integer, location: Location) -> void
+ #
+ # @return [IntegerNode] a new instance of IntegerNode
+ #
+ # source://prism//prism/node.rb#9610
+ def initialize(flags, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9616
+ def accept(visitor); end
+
+ # def binary?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9652
+ def binary?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9621
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9631
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9626
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> IntegerNode
+ #
+ # source://prism//prism/node.rb#9636
+ 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
+ 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#9647
+ def deconstruct_keys(keys); end
+
+ # def hexadecimal?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9667
+ def hexadecimal?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9672
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def octal?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9662
+ 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
+ # 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//prism/node.rb#9693
+ def type; end
+
+ # Returns the value of the node as a Ruby Integer.
+ #
+ # source://prism//prism/node_ext.rb#76
+ def value; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#9607
+ 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#9703
+ 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.
+#
+# 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
+ #
+ # @return [InterpolatedMatchLastLineNode] a new instance of InterpolatedMatchLastLineNode
+ #
+ # source://prism//prism/node.rb#9728
+ def initialize(flags, opening_loc, parts, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9737
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9806
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9747
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#9841
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#9725
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9757
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9752
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InterpolatedMatchLastLineNode
+ #
+ # source://prism//prism/node.rb#9762
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9747
+ 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#9776
+ def deconstruct_keys(keys); end
+
+ # def euc_jp?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9801
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9786
+ def extended?; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9826
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9831
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9821
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9781
+ def ignore_case?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#9846
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def multi_line?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9791
+ def multi_line?; end
+
+ # def once?: () -> 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
+
+ # 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//prism/node.rb#9870
+ def type; end
+
+ # def utf_8?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9816
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9811
+ def windows_31j?; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#9716
+ 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#9880
+ def type; end
+ end
+end
+
+# Represents a regular expression literal that contains interpolation.
+#
+# /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
+ #
+ # @return [InterpolatedRegularExpressionNode] a new instance of InterpolatedRegularExpressionNode
+ #
+ # source://prism//prism/node.rb#9903
+ def initialize(flags, opening_loc, parts, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#9912
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9981
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9922
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#10016
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#9900
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#9932
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#9927
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InterpolatedRegularExpressionNode
+ #
+ # source://prism//prism/node.rb#9937
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#9922
+ 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#9951
+ 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
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9956
+ def ignore_case?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10021
+ 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
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#9894
+ def opening_loc; end
+
+ # attr_reader parts: Array[Node]
+ #
+ # source://prism//prism/node.rb#9897
+ def parts; end
+
+ # source://prism//prism/node.rb#9916
+ def set_newline_flag(newline_marked); end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#10045
+ def type; end
+
+ # def utf_8?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9991
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#9986
+ def windows_31j?; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#9891
+ 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#10055
+ def type; end
+ end
+end
+
+# Represents a string literal that contains interpolation.
+#
+# "foo #{bar} baz"
+# ^^^^^^^^^^^^^^^^
+class Prism::InterpolatedStringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # def initialize: (opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location) -> void
+ #
+ # @return [InterpolatedStringNode] a new instance of InterpolatedStringNode
+ #
+ # source://prism//prism/node.rb#10075
+ def initialize(opening_loc, parts, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10083
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10093
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10098
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InterpolatedStringNode
+ #
+ # source://prism//prism/node.rb#10108
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10093
+ 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#10121
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10136
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#10126
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#10066
+ def opening_loc; end
+
+ # attr_reader parts: Array[Node]
+ #
+ # source://prism//prism/node.rb#10069
+ def parts; end
+
+ # source://prism//prism/node.rb#10087
+ def set_newline_flag(newline_marked); end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#10158
+ 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#10168
+ def type; end
+ end
+end
+
+# Represents a symbol literal that contains interpolation.
+#
+# :"foo #{bar} baz"
+# ^^^^^^^^^^^^^^^^^
+class Prism::InterpolatedSymbolNode < ::Prism::Node
+ # def initialize: (opening_loc: Location?, parts: Array[Node], closing_loc: Location?, location: Location) -> void
+ #
+ # @return [InterpolatedSymbolNode] a new instance of InterpolatedSymbolNode
+ #
+ # source://prism//prism/node.rb#10188
+ def initialize(opening_loc, parts, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10196
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10206
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10211
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InterpolatedSymbolNode
+ #
+ # source://prism//prism/node.rb#10221
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10206
+ 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#10234
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10249
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#10239
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#10179
+ def opening_loc; end
+
+ # attr_reader parts: Array[Node]
+ #
+ # source://prism//prism/node.rb#10182
+ def parts; end
+
+ # source://prism//prism/node.rb#10200
+ def set_newline_flag(newline_marked); end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#10271
+ 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#10281
+ def type; end
+ end
+end
+
+# Represents an xstring literal that contains interpolation.
+#
+# `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
+ #
+ # @return [InterpolatedXStringNode] a new instance of InterpolatedXStringNode
+ #
+ # source://prism//prism/node.rb#10301
+ def initialize(opening_loc, parts, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10309
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10319
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10324
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> InterpolatedXStringNode
+ #
+ # source://prism//prism/node.rb#10334
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10319
+ 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#10347
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10362
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#10352
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#10292
+ def opening_loc; end
+
+ # attr_reader parts: Array[Node]
+ #
+ # source://prism//prism/node.rb#10295
+ def parts; end
+
+ # source://prism//prism/node.rb#10313
+ def set_newline_flag(newline_marked); end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#10384
+ 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#10394
+ def type; end
+ end
+end
+
+# Represents a hash literal without opening and closing braces.
+#
+# foo(a: b)
+# ^^^^
+class Prism::KeywordHashNode < ::Prism::Node
+ # def initialize: (flags: Integer, elements: Array[Node], location: Location) -> void
+ #
+ # @return [KeywordHashNode] a new instance of KeywordHashNode
+ #
+ # source://prism//prism/node.rb#10411
+ def initialize(flags, elements, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10418
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10423
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#10433
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10428
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> KeywordHashNode
+ #
+ # source://prism//prism/node.rb#10438
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10423
+ 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#10450
+ def deconstruct_keys(keys); end
+
+ # attr_reader elements: Array[Node]
+ #
+ # source://prism//prism/node.rb#10408
+ def elements; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10460
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def static_keys?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#10455
+ def static_keys?; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#10482
+ 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.
+ # 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#10492
+ 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
+#
+# 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.
+#
+# def a(**b)
+# ^^^
+# end
+class Prism::KeywordRestParameterNode < ::Prism::Node
+ # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location) -> void
+ #
+ # @return [KeywordRestParameterNode] a new instance of KeywordRestParameterNode
+ #
+ # source://prism//prism/node.rb#10513
+ def initialize(name, name_loc, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10521
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10526
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#10536
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10531
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> KeywordRestParameterNode
+ #
+ # source://prism//prism/node.rb#10541
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10526
+ 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#10554
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10564
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol?
+ #
+ # source://prism//prism/node.rb#10504
+ 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
+ # 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//prism/node.rb#10590
+ 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#10600
+ def type; end
+ end
+end
+
+# Represents using a lambda literal (not the lambda method call).
+#
+# ->(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
+ #
+ # @return [LambdaNode] a new instance of LambdaNode
+ #
+ # source://prism//prism/node.rb#10632
+ def initialize(locals, locals_body_index, operator_loc, opening_loc, closing_loc, parameters, body, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10644
+ 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
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10654
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LambdaNode
+ #
+ # source://prism//prism/node.rb#10667
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10649
+ 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#10684
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10704
+ 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
+ #
+ # source://prism//prism/node.rb#10694
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#10620
+ def opening_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#10689
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#10617
+ 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
+ # 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//prism/node.rb#10740
+ 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#10750
+ 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
+
+ # Returns the value of attribute options.
+ #
+ # source://prism//prism/lex_compat.rb#597
+ def options; end
+
+ # source://prism//prism/lex_compat.rb#604
+ def result; end
+
+ # Returns the value of attribute source.
+ #
+ # source://prism//prism/lex_compat.rb#597
+ def source; end
+end
+
+# Ripper doesn't include the rest of the token in the event, so we need to
+# trim it down to just the content on the first line when comparing.
+class Prism::LexCompat::EndContentToken < ::Prism::LexCompat::Token
+ # source://prism//prism/lex_compat.rb#211
+ def ==(other); end
+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.
+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
+
+# 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
+ #
+ # source://prism//prism/lex_compat.rb#298
+ def initialize(split); end
+
+ # source://prism//prism/lex_compat.rb#303
+ def <<(token); 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 comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#10801
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10796
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableAndWriteNode
+ #
+ # source://prism//prism/node.rb#10806
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10791
+ 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#10821
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#10773
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10831
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#10770
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#10761
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#10826
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#10764
+ 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//prism/node.rb#10856
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#10767
+ 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#10866
+ def type; end
+ end
+end
+
+# Represents assigning to a local variable using an operator that isn't `=`.
+#
+# 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
+ #
+ # @return [LocalVariableOperatorWriteNode] a new instance of LocalVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#10895
+ def initialize(name_loc, operator_loc, value, name, operator, depth, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#10906
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10911
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#10921
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#10916
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableOperatorWriteNode
+ #
+ # source://prism//prism/node.rb#10926
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#10911
+ 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#10942
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#10892
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#10947
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#10886
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#10877
+ def name_loc; end
+
+ # attr_reader operator: Symbol
+ #
+ # source://prism//prism/node.rb#10889
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#10880
+ 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//prism/node.rb#10973
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#10883
+ 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#10983
+ def type; end
+ end
+end
+
+# Represents the use of the `||=` operator for assignment to a local variable.
+#
+# target ||= value
+# ^^^^^^^^^^^^^^^^
+class Prism::LocalVariableOrWriteNode < ::Prism::Node
+ # def initialize: (name_loc: Location, operator_loc: Location, value: Node, name: Symbol, depth: Integer, location: Location) -> void
+ #
+ # @return [LocalVariableOrWriteNode] a new instance of LocalVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#11009
+ def initialize(name_loc, operator_loc, value, name, depth, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11019
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11024
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11034
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11029
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableOrWriteNode
+ #
+ # source://prism//prism/node.rb#11039
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11024
+ 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#11054
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#11006
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11064
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#11003
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#10994
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#11059
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#10997
+ 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//prism/node.rb#11089
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#11000
+ 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#11099
+ 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.
+#
+# foo
+# ^^^
+class Prism::LocalVariableReadNode < ::Prism::Node
+ # def initialize: (name: Symbol, depth: Integer, location: Location) -> void
+ #
+ # @return [LocalVariableReadNode] a new instance of LocalVariableReadNode
+ #
+ # source://prism//prism/node.rb#11118
+ def initialize(name, depth, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11125
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11130
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11140
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11135
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableReadNode
+ #
+ # source://prism//prism/node.rb#11145
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11130
+ 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#11157
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#11115
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11162
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#11112
+ 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
+ # 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//prism/node.rb#11183
+ 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#11193
+ def type; end
+ end
+end
+
+# Represents writing to a local variable in a context that doesn't have an explicit value.
+#
+# foo, bar = baz
+# ^^^ ^^^
+class Prism::LocalVariableTargetNode < ::Prism::Node
+ # def initialize: (name: Symbol, depth: Integer, location: Location) -> void
+ #
+ # @return [LocalVariableTargetNode] a new instance of LocalVariableTargetNode
+ #
+ # source://prism//prism/node.rb#11210
+ def initialize(name, depth, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11217
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11222
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11232
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11227
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableTargetNode
+ #
+ # source://prism//prism/node.rb#11237
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11222
+ 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#11249
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#11207
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11254
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#11204
+ 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
+ # 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//prism/node.rb#11275
+ 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#11285
+ def type; end
+ end
+end
+
+# Represents writing to a local variable.
+#
+# 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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11321
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11326
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11336
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11331
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> LocalVariableWriteNode
+ #
+ # source://prism//prism/node.rb#11341
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11326
+ 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#11356
+ def deconstruct_keys(keys); end
+
+ # attr_reader depth: Integer
+ #
+ # source://prism//prism/node.rb#11299
+ def depth; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11366
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#11296
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#11302
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#11361
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#11308
+ 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//prism/node.rb#11391
+ 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.
+ # 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#11401
+ 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.
+ #
+ # 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.
+ #
+ # source://prism//prism/parse_result.rb#147
+ def end_character_offset; end
+
+ # The column number in bytes where this location ends from the start of the
+ # line.
+ #
+ # source://prism//prism/parse_result.rb#181
+ def end_column; end
+
+ # The line number where this location ends.
+ #
+ # source://prism//prism/parse_result.rb#163
+ def end_line; end
+
+ # The byte offset from the beginning of the source where this location ends.
+ #
+ # source://prism//prism/parse_result.rb#141
+ def end_offset; end
+
+ # Returns a string representation of this location.
+ #
+ # source://prism//prism/parse_result.rb#125
+ def inspect; end
+
+ # Returns a new location that stretches from this location to the given
+ # other location. Raises an error if this location is not before the other
+ # location or if they don't share the same source.
+ #
+ # source://prism//prism/parse_result.rb#211
+ def join(other); end
+
+ # The length of this location in bytes.
+ #
+ # source://prism//prism/parse_result.rb#101
+ def length; end
+
+ # Implement the pretty print interface for Location.
+ #
+ # source://prism//prism/parse_result.rb#197
+ def pretty_print(q); end
+
+ # The source code that this location represents.
+ #
+ # source://prism//prism/parse_result.rb#130
+ def slice; end
+
+ # The column number in characters where this location ends from the start of
+ # the line.
+ #
+ # source://prism//prism/parse_result.rb#175
+ def start_character_column; end
+
+ # The character offset from the beginning of the source where this location
+ # starts.
+ #
+ # 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.
+ #
+ # source://prism//prism/parse_result.rb#169
+ def start_column; end
+
+ # The line number where this location starts.
+ #
+ # source://prism//prism/parse_result.rb#152
+ def start_line; end
+
+ # The content of the line where this location starts before this location.
+ #
+ # 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.
+ #
+ # source://prism//prism/parse_result.rb#98
+ def start_offset; end
+
+ protected
+
+ # Returns the value of attribute source.
+ #
+ # source://prism//prism/parse_result.rb#94
+ def source; end
+
+ class << self
+ # Returns a null location that does not correspond to a source and points to
+ # the beginning of the file. Useful for when you want a location object but
+ # do not care where it points.
+ #
+ # source://prism//prism/parse_result.rb#221
+ def null; 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
+#
+# 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
+
+# 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
+# ^^^^^^
+class Prism::MatchLastLineNode < ::Prism::Node
+ include ::Prism::RegularExpressionOptions
+
+ # def initialize: (flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location) -> void
+ #
+ # @return [MatchLastLineNode] a new instance of MatchLastLineNode
+ #
+ # source://prism//prism/node.rb#11429
+ def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11439
+ 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
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11449
+ 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
+ #
+ # source://prism//prism/node.rb#11459
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11444
+ 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#11474
+ def deconstruct_keys(keys); end
+
+ # def euc_jp?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#11499
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # @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
+
+ # def ignore_case?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#11479
+ def ignore_case?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11549
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def multi_line?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#11489
+ def multi_line?; end
+
+ # def once?: () -> 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
+
+ # 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//prism/node.rb#11574
+ 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
+ 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#11584
+ def type; end
+ end
+end
+
+# Represents the use of the modifier `in` operator.
+#
+# foo in bar
+# ^^^^^^^^^^
+class Prism::MatchPredicateNode < ::Prism::Node
+ # def initialize: (value: Node, pattern: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [MatchPredicateNode] a new instance of MatchPredicateNode
+ #
+ # source://prism//prism/node.rb#11604
+ def initialize(value, pattern, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11612
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11617
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11627
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11622
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MatchPredicateNode
+ #
+ # source://prism//prism/node.rb#11632
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11617
+ 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#11645
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11655
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#11650
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#11601
+ def operator_loc; end
+
+ # attr_reader pattern: Node
+ #
+ # source://prism//prism/node.rb#11598
+ def pattern; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # 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//prism/node.rb#11679
+ 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.
+ # 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#11689
+ def type; end
+ end
+end
+
+# Represents the use of the `=>` operator.
+#
+# 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//prism/node.rb#11709
+ def initialize(value, pattern, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11717
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11722
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11732
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11727
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MatchRequiredNode
+ #
+ # source://prism//prism/node.rb#11737
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11722
+ 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#11750
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11760
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#11755
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#11706
+ def operator_loc; end
+
+ # attr_reader pattern: Node
+ #
+ # source://prism//prism/node.rb#11703
+ def pattern; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # 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//prism/node.rb#11784
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # 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
+
+# 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
+ #
+ # source://prism//prism/node.rb#11812
+ def initialize(call, targets, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11819
+ def accept(visitor); end
+
+ # attr_reader call: CallNode
+ #
+ # source://prism//prism/node.rb#11806
+ def call; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11824
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11834
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11829
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MatchWriteNode
+ #
+ # source://prism//prism/node.rb#11839
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11824
+ 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#11851
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11856
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader targets: Array[Node]
+ #
+ # source://prism//prism/node.rb#11809
+ def targets; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # 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//prism/node.rb#11878
+ 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#11888
+ 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
+ #
+ # @return [MissingNode] a new instance of MissingNode
+ #
+ # source://prism//prism/node.rb#11897
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#11902
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11907
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#11917
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#11912
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MissingNode
+ #
+ # source://prism//prism/node.rb#11922
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#11907
+ 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#11932
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#11937
+ 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//prism/node.rb#11956
+ 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#11966
+ def type; end
+ end
+end
+
+# Represents a module declaration involving the `module` keyword.
+#
+# 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
+ #
+ # @return [ModuleNode] a new instance of ModuleNode
+ #
+ # source://prism//prism/node.rb#11995
+ def initialize(locals, module_keyword_loc, constant_path, body, end_keyword_loc, name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12006
+ 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
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12024
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12016
+ def compact_child_nodes; end
+
+ # attr_reader constant_path: Node
+ #
+ # source://prism//prism/node.rb#11983
+ def constant_path; end
+
+ # def copy: (**params) -> ModuleNode
+ #
+ # source://prism//prism/node.rb#12029
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12011
+ 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#12045
+ 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
+ #
+ # source://prism//prism/node.rb#11989
+ def end_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12060
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#11977
+ def locals; end
+
+ # def module_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#12050
+ def module_keyword; end
+
+ # attr_reader module_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#11980
+ def module_keyword_loc; end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#11992
+ 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
+ # 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//prism/node.rb#12091
+ 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#12101
+ def type; end
+ end
+end
+
+# Represents a multi-target expression.
+#
+# 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
+ #
+ # @return [MultiTargetNode] a new instance of MultiTargetNode
+ #
+ # source://prism//prism/node.rb#12127
+ def initialize(lefts, rest, rights, lparen_loc, rparen_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12137
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12142
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12156
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12147
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MultiTargetNode
+ #
+ # source://prism//prism/node.rb#12161
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12142
+ 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#12176
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12191
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader lefts: Array[Node]
+ #
+ # source://prism//prism/node.rb#12112
+ def lefts; end
+
+ # def lparen: () -> String?
+ #
+ # source://prism//prism/node.rb#12181
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#12121
+ def lparen_loc; end
+
+ # attr_reader rest: Node?
+ #
+ # source://prism//prism/node.rb#12115
+ def rest; end
+
+ # attr_reader rights: Array[Node]
+ #
+ # source://prism//prism/node.rb#12118
+ def rights; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#12186
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#12124
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#12220
+ 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#12230
+ def type; end
+ end
+end
+
+# Represents a write to a multi-target expression.
+#
+# 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
+ #
+ # @return [MultiWriteNode] a new instance of MultiWriteNode
+ #
+ # source://prism//prism/node.rb#12262
+ def initialize(lefts, rest, rights, lparen_loc, rparen_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12274
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12279
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12294
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12284
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> MultiWriteNode
+ #
+ # source://prism//prism/node.rb#12299
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12279
+ 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#12316
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12336
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader lefts: Array[Node]
+ #
+ # source://prism//prism/node.rb#12241
+ def lefts; end
+
+ # def lparen: () -> String?
+ #
+ # source://prism//prism/node.rb#12321
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#12250
+ def lparen_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#12331
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#12256
+ def operator_loc; end
+
+ # attr_reader rest: Node?
+ #
+ # source://prism//prism/node.rb#12244
+ def rest; end
+
+ # attr_reader rights: Array[Node]
+ #
+ # source://prism//prism/node.rb#12247
+ def rights; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#12326
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#12253
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#12368
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#12259
+ 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#12378
+ 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
+ #
+ # source://prism//prism/mutation_compiler.rb#19
+ def visit_alias_method_node(node); end
+
+ # Copy a AlternationPatternNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#24
+ def visit_alternation_pattern_node(node); end
+
+ # Copy a AndNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#29
+ def visit_and_node(node); end
+
+ # Copy a ArgumentsNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#34
+ def visit_arguments_node(node); end
+
+ # Copy a ArrayNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#39
+ def visit_array_node(node); end
+
+ # Copy a ArrayPatternNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#44
+ def visit_array_pattern_node(node); end
+
+ # Copy a AssocNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#49
+ def visit_assoc_node(node); end
+
+ # Copy a AssocSplatNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#54
+ def visit_assoc_splat_node(node); end
+
+ # Copy a BackReferenceReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#59
+ def visit_back_reference_read_node(node); end
+
+ # Copy a BeginNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#64
+ def visit_begin_node(node); end
+
+ # Copy a BlockArgumentNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#69
+ def visit_block_argument_node(node); end
+
+ # Copy a BlockLocalVariableNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#74
+ def visit_block_local_variable_node(node); end
+
+ # Copy a BlockNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#79
+ def visit_block_node(node); end
+
+ # Copy a BlockParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#84
+ def visit_block_parameter_node(node); end
+
+ # Copy a BlockParametersNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#89
+ def visit_block_parameters_node(node); end
+
+ # Copy a BreakNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#94
+ def visit_break_node(node); end
+
+ # Copy a CallAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#99
+ def visit_call_and_write_node(node); end
+
+ # Copy a CallNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#104
+ def visit_call_node(node); end
+
+ # Copy a CallOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#109
+ def visit_call_operator_write_node(node); end
+
+ # Copy a CallOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#114
+ def visit_call_or_write_node(node); end
+
+ # Copy a CallTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#119
+ def visit_call_target_node(node); end
+
+ # Copy a CapturePatternNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#124
+ def visit_capture_pattern_node(node); end
+
+ # Copy a CaseMatchNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#129
+ def visit_case_match_node(node); end
+
+ # Copy a CaseNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#134
+ def visit_case_node(node); 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
+
+ # Copy a ClassVariableOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#149
+ def visit_class_variable_operator_write_node(node); end
+
+ # Copy a ClassVariableOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#154
+ def visit_class_variable_or_write_node(node); end
+
+ # Copy a ClassVariableReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#159
+ def visit_class_variable_read_node(node); end
+
+ # Copy a ClassVariableTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#164
+ def visit_class_variable_target_node(node); end
+
+ # Copy a ClassVariableWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#169
+ def visit_class_variable_write_node(node); end
+
+ # Copy a ConstantAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#174
+ def visit_constant_and_write_node(node); end
+
+ # Copy a ConstantOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#179
+ def visit_constant_operator_write_node(node); end
+
+ # Copy a ConstantOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#184
+ def visit_constant_or_write_node(node); end
+
+ # Copy a ConstantPathAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#189
+ def visit_constant_path_and_write_node(node); end
+
+ # Copy a ConstantPathNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#194
+ def visit_constant_path_node(node); end
+
+ # Copy a ConstantPathOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#199
+ def visit_constant_path_operator_write_node(node); end
+
+ # Copy a ConstantPathOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#204
+ def visit_constant_path_or_write_node(node); end
+
+ # Copy a ConstantPathTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#209
+ def visit_constant_path_target_node(node); end
+
+ # Copy a ConstantPathWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#214
+ def visit_constant_path_write_node(node); end
+
+ # Copy a ConstantReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#219
+ def visit_constant_read_node(node); end
+
+ # Copy a ConstantTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#224
+ def visit_constant_target_node(node); end
+
+ # Copy a ConstantWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#229
+ def visit_constant_write_node(node); end
+
+ # Copy a DefNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#234
+ def visit_def_node(node); end
+
+ # Copy a DefinedNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#239
+ def visit_defined_node(node); end
+
+ # Copy a ElseNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#244
+ def visit_else_node(node); end
+
+ # Copy a EmbeddedStatementsNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#249
+ def visit_embedded_statements_node(node); end
+
+ # Copy a EmbeddedVariableNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#254
+ def visit_embedded_variable_node(node); end
+
+ # Copy a EnsureNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#259
+ def visit_ensure_node(node); end
+
+ # Copy a FalseNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#264
+ def visit_false_node(node); end
+
+ # Copy a FindPatternNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#269
+ def visit_find_pattern_node(node); end
+
+ # Copy a FlipFlopNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#274
+ def visit_flip_flop_node(node); end
+
+ # Copy a FloatNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#279
+ def visit_float_node(node); end
+
+ # Copy a ForNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#284
+ def visit_for_node(node); end
+
+ # Copy a ForwardingArgumentsNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#289
+ def visit_forwarding_arguments_node(node); end
+
+ # Copy a ForwardingParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#294
+ def visit_forwarding_parameter_node(node); end
+
+ # Copy a ForwardingSuperNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#299
+ def visit_forwarding_super_node(node); end
+
+ # Copy a GlobalVariableAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#304
+ def visit_global_variable_and_write_node(node); end
+
+ # Copy a GlobalVariableOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#309
+ def visit_global_variable_operator_write_node(node); end
+
+ # Copy a GlobalVariableOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#314
+ def visit_global_variable_or_write_node(node); end
+
+ # Copy a GlobalVariableReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#319
+ def visit_global_variable_read_node(node); end
+
+ # Copy a GlobalVariableTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#324
+ def visit_global_variable_target_node(node); end
+
+ # Copy a GlobalVariableWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#329
+ def visit_global_variable_write_node(node); end
+
+ # Copy a HashNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#334
+ def visit_hash_node(node); end
+
+ # Copy a HashPatternNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#339
+ def visit_hash_pattern_node(node); end
+
+ # Copy a IfNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#344
+ def visit_if_node(node); end
+
+ # Copy a ImaginaryNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#349
+ def visit_imaginary_node(node); end
+
+ # Copy a ImplicitNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#354
+ def visit_implicit_node(node); end
+
+ # Copy a ImplicitRestNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#359
+ def visit_implicit_rest_node(node); end
+
+ # Copy a InNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#364
+ def visit_in_node(node); end
+
+ # Copy a IndexAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#369
+ def visit_index_and_write_node(node); end
+
+ # Copy a IndexOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#374
+ def visit_index_operator_write_node(node); end
+
+ # Copy a IndexOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#379
+ def visit_index_or_write_node(node); end
+
+ # Copy a IndexTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#384
+ def visit_index_target_node(node); end
+
+ # Copy a InstanceVariableAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#389
+ def visit_instance_variable_and_write_node(node); end
+
+ # Copy a InstanceVariableOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#394
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Copy a InstanceVariableOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#399
+ def visit_instance_variable_or_write_node(node); end
+
+ # Copy a InstanceVariableReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#404
+ def visit_instance_variable_read_node(node); end
+
+ # Copy a InstanceVariableTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#409
+ def visit_instance_variable_target_node(node); end
+
+ # Copy a InstanceVariableWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#414
+ def visit_instance_variable_write_node(node); end
+
+ # Copy a IntegerNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#419
+ def visit_integer_node(node); end
+
+ # Copy a InterpolatedMatchLastLineNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#424
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Copy a InterpolatedRegularExpressionNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#429
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Copy a InterpolatedStringNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#434
+ def visit_interpolated_string_node(node); end
+
+ # Copy a InterpolatedSymbolNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#439
+ def visit_interpolated_symbol_node(node); end
+
+ # Copy a InterpolatedXStringNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#444
+ def visit_interpolated_x_string_node(node); end
+
+ # Copy a KeywordHashNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#449
+ def visit_keyword_hash_node(node); end
+
+ # Copy a KeywordRestParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#454
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Copy a LambdaNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#459
+ def visit_lambda_node(node); end
+
+ # Copy a LocalVariableAndWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#464
+ def visit_local_variable_and_write_node(node); end
+
+ # Copy a LocalVariableOperatorWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#469
+ def visit_local_variable_operator_write_node(node); end
+
+ # Copy a LocalVariableOrWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#474
+ def visit_local_variable_or_write_node(node); end
+
+ # Copy a LocalVariableReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#479
+ def visit_local_variable_read_node(node); end
+
+ # Copy a LocalVariableTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#484
+ def visit_local_variable_target_node(node); end
+
+ # Copy a LocalVariableWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#489
+ def visit_local_variable_write_node(node); end
+
+ # Copy a MatchLastLineNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#494
+ def visit_match_last_line_node(node); end
+
+ # Copy a MatchPredicateNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#499
+ def visit_match_predicate_node(node); end
+
+ # Copy a MatchRequiredNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#504
+ def visit_match_required_node(node); end
+
+ # Copy a MatchWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#509
+ def visit_match_write_node(node); end
+
+ # Copy a MissingNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#514
+ def visit_missing_node(node); end
+
+ # Copy a ModuleNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#519
+ def visit_module_node(node); end
+
+ # Copy a MultiTargetNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#524
+ def visit_multi_target_node(node); end
+
+ # Copy a MultiWriteNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#529
+ def visit_multi_write_node(node); end
+
+ # Copy a NextNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#534
+ def visit_next_node(node); end
+
+ # Copy a NilNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#539
+ def visit_nil_node(node); end
+
+ # Copy a NoKeywordsParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#544
+ def visit_no_keywords_parameter_node(node); end
+
+ # Copy a NumberedParametersNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#549
+ def visit_numbered_parameters_node(node); end
+
+ # Copy a NumberedReferenceReadNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#554
+ def visit_numbered_reference_read_node(node); end
+
+ # Copy a OptionalKeywordParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#559
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Copy a OptionalParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#564
+ def visit_optional_parameter_node(node); end
+
+ # Copy a OrNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#569
+ def visit_or_node(node); end
+
+ # Copy a ParametersNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#574
+ def visit_parameters_node(node); end
+
+ # Copy a ParenthesesNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#579
+ def visit_parentheses_node(node); end
+
+ # Copy a PinnedExpressionNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#584
+ def visit_pinned_expression_node(node); end
+
+ # Copy a PinnedVariableNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#589
+ def visit_pinned_variable_node(node); end
+
+ # Copy a PostExecutionNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#594
+ def visit_post_execution_node(node); end
+
+ # Copy a PreExecutionNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#599
+ def visit_pre_execution_node(node); end
+
+ # Copy a ProgramNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#604
+ def visit_program_node(node); end
+
+ # Copy a RangeNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#609
+ def visit_range_node(node); end
+
+ # Copy a RationalNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#614
+ def visit_rational_node(node); end
+
+ # Copy a RedoNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#619
+ def visit_redo_node(node); end
+
+ # Copy a RegularExpressionNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#624
+ def visit_regular_expression_node(node); end
+
+ # Copy a RequiredKeywordParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#629
+ def visit_required_keyword_parameter_node(node); end
+
+ # Copy a RequiredParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#634
+ def visit_required_parameter_node(node); end
+
+ # Copy a RescueModifierNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#639
+ def visit_rescue_modifier_node(node); end
+
+ # Copy a RescueNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#644
+ def visit_rescue_node(node); end
+
+ # Copy a RestParameterNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#649
+ def visit_rest_parameter_node(node); end
+
+ # Copy a RetryNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#654
+ def visit_retry_node(node); end
+
+ # Copy a ReturnNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#659
+ def visit_return_node(node); end
+
+ # Copy a SelfNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#664
+ def visit_self_node(node); end
+
+ # Copy a SingletonClassNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#669
+ def visit_singleton_class_node(node); end
+
+ # Copy a SourceEncodingNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#674
+ def visit_source_encoding_node(node); end
+
+ # Copy a SourceFileNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#679
+ def visit_source_file_node(node); end
+
+ # Copy a SourceLineNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#684
+ def visit_source_line_node(node); end
+
+ # Copy a SplatNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#689
+ def visit_splat_node(node); end
+
+ # Copy a StatementsNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#694
+ def visit_statements_node(node); end
+
+ # Copy a StringNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#699
+ def visit_string_node(node); end
+
+ # Copy a SuperNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#704
+ def visit_super_node(node); end
+
+ # Copy a SymbolNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#709
+ def visit_symbol_node(node); end
+
+ # Copy a TrueNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#714
+ def visit_true_node(node); end
+
+ # Copy a UndefNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#719
+ def visit_undef_node(node); end
+
+ # Copy a UnlessNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#724
+ def visit_unless_node(node); end
+
+ # Copy a UntilNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#729
+ def visit_until_node(node); end
+
+ # Copy a WhenNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#734
+ def visit_when_node(node); end
+
+ # Copy a WhileNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#739
+ def visit_while_node(node); end
+
+ # Copy a XStringNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#744
+ def visit_x_string_node(node); end
+
+ # Copy a YieldNode node
+ #
+ # source://prism//prism/mutation_compiler.rb#749
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `next` keyword.
+#
+# next 1
+# ^^^^^^
+class Prism::NextNode < ::Prism::Node
+ # def initialize: (arguments: ArgumentsNode?, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [NextNode] a new instance of NextNode
+ #
+ # source://prism//prism/node.rb#12395
+ def initialize(arguments, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12402
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#12389
+ def arguments; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12407
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12419
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12412
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> NextNode
+ #
+ # source://prism//prism/node.rb#12424
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12407
+ 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#12436
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12446
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#12441
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#12392
+ def keyword_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#12472
+ 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#12482
+ def type; end
+ end
+end
+
+# Represents the use of the `nil` keyword.
+#
+# nil
+# ^^^
+class Prism::NilNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [NilNode] a new instance of NilNode
+ #
+ # source://prism//prism/node.rb#12493
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12498
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12503
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12513
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12508
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> NilNode
+ #
+ # source://prism//prism/node.rb#12518
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12503
+ 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#12528
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12533
+ 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//prism/node.rb#12552
+ 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#12562
+ def type; end
+ end
+end
+
+# Represents the use of `**nil` inside method arguments.
+#
+# def a(**nil)
+# ^^^^^
+# end
+class Prism::NoKeywordsParameterNode < ::Prism::Node
+ # def initialize: (operator_loc: Location, keyword_loc: Location, location: Location) -> void
+ #
+ # @return [NoKeywordsParameterNode] a new instance of NoKeywordsParameterNode
+ #
+ # source://prism//prism/node.rb#12580
+ def initialize(operator_loc, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12587
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12592
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12602
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12597
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> NoKeywordsParameterNode
+ #
+ # source://prism//prism/node.rb#12607
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12592
+ 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#12619
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12634
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#12629
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#12577
+ def keyword_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#12624
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#12574
+ 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//prism/node.rb#12655
+ 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#12665
+ 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.
+ #
+ # source://prism//prism/node.rb#14
+ def location; end
+
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16
+ def newline?; end
+
+ # Similar to inspect, but respects the current level of indentation given by
+ # the pretty print object.
+ #
+ # source://prism//prism/node.rb#35
+ def pretty_print(q); end
+
+ # source://prism//prism/node.rb#20
+ def set_newline_flag(newline_marked); end
+
+ # Slice the location of the node from the source.
+ #
+ # source://prism//prism/node.rb#29
+ def slice; end
+
+ # Convert this node into a graphviz dot graph string.
+ #
+ # source://prism//prism/node.rb#43
+ def to_dot; end
+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
+ #
+ # source://prism//prism/node_inspector.rb#9
+ def initialize(prefix = T.unsafe(nil)); end
+
+ # Appends a line to the output with the current prefix.
+ #
+ # source://prism//prism/node_inspector.rb#15
+ def <<(line); end
+
+ # Returns a new inspector that can be used to inspect a child node.
+ #
+ # source://prism//prism/node_inspector.rb#59
+ def child_inspector(append); end
+
+ # Generates a string that represents a child node.
+ #
+ # source://prism//prism/node_inspector.rb#54
+ def child_node(node, append); end
+
+ # This generates a string that is used as the header of the inspect output
+ # for any given node.
+ #
+ # source://prism//prism/node_inspector.rb#21
+ def header(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.
+ #
+ # source://prism//prism/node_inspector.rb#31
+ def list(prefix, nodes); end
+
+ # Generates a string that represents a location field on a 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
+
+ # Returns the output as a string.
+ #
+ # source://prism//prism/node_inspector.rb#64
+ def to_str; end
+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
+ #
+ # source://prism//prism/node.rb#12680
+ def initialize(maximum, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12686
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12691
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12701
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12696
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> NumberedParametersNode
+ #
+ # source://prism//prism/node.rb#12706
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12691
+ 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#12717
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12722
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader maximum: Integer
+ #
+ # source://prism//prism/node.rb#12677
+ def maximum; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//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
+
+# 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
+ #
+ # source://prism//prism/node.rb#12766
+ def initialize(number, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12772
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12777
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12787
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12782
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> NumberedReferenceReadNode
+ #
+ # source://prism//prism/node.rb#12792
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12777
+ 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#12803
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12808
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader number: Integer
+ #
+ # source://prism//prism/node.rb#12763
+ def number; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//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
+
+# 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
+ #
+ # source://prism//prism/node.rb#12859
+ def initialize(name, name_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12867
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12872
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12882
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12877
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> OptionalKeywordParameterNode
+ #
+ # source://prism//prism/node.rb#12887
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12872
+ 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#12900
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#12905
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#12850
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#12853
+ def name_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//prism/node.rb#12928
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#12856
+ 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#12938
+ def type; end
+ end
+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
+ #
+ # @return [OptionalParameterNode] a new instance of OptionalParameterNode
+ #
+ # source://prism//prism/node.rb#12962
+ def initialize(name, name_loc, operator_loc, value, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#12971
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12976
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#12986
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#12981
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> OptionalParameterNode
+ #
+ # source://prism//prism/node.rb#12991
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#12976
+ 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#13005
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13015
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#12950
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#12953
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#13010
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#12956
+ 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//prism/node.rb#13039
+ def type; end
+
+ # attr_reader value: Node
+ #
+ # source://prism//prism/node.rb#12959
+ 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#13049
+ def type; end
+ end
+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
+ #
+ # @return [OrNode] a new instance of OrNode
+ #
+ # source://prism//prism/node.rb#13069
+ def initialize(left, right, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13077
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13082
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#13092
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13087
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> OrNode
+ #
+ # source://prism//prism/node.rb#13097
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13082
+ 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#13110
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13120
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node
+ #
+ # source://prism//prism/node.rb#13060
+ def left; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#13115
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#13066
+ def operator_loc; end
+
+ # attr_reader right: Node
+ #
+ # source://prism//prism/node.rb#13063
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13144
+ 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#13154
+ def type; end
+ end
+end
+
+# A parser for the pack template language.
+module Prism::Pack
+ class << self
+ def parse(_arg0, _arg1, _arg2); end
+ end
+end
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::AGNOSTIC_ENDIAN = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::BACK = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::BER = T.let(T.unsafe(nil), Symbol)
+
+# 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
+ #
+ # source://prism//prism/pack.rb#88
+ def initialize(version, variant, source, type, signed, endian, size, length_type, length); end
+
+ # Provide a human-readable description of the directive.
+ #
+ # source://prism//prism/pack.rb#130
+ def describe; end
+
+ # The type of endianness of the directive.
+ #
+ # source://prism//prism/pack.rb#76
+ def endian; end
+
+ # The length of this directive (used for integers).
+ #
+ # source://prism//prism/pack.rb#85
+ def length; end
+
+ # The length type of this directive (used for integers).
+ #
+ # source://prism//prism/pack.rb#82
+ def length_type; end
+
+ # The type of signedness of the directive.
+ #
+ # source://prism//prism/pack.rb#73
+ def signed; end
+
+ # The size of the directive.
+ #
+ # source://prism//prism/pack.rb#79
+ def size; end
+
+ # A byteslice of the source string that this directive represents.
+ #
+ # source://prism//prism/pack.rb#67
+ def source; end
+
+ # The type of the directive.
+ #
+ # source://prism//prism/pack.rb#70
+ def type; end
+
+ # A symbol representing whether or not we are packing or unpacking.
+ #
+ # source://prism//prism/pack.rb#64
+ def variant; end
+
+ # A symbol representing the version of Ruby.
+ #
+ # 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)
+
+# 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
+ #
+ # source://prism//prism/pack.rb#203
+ def initialize(directives, encoding); end
+
+ # Provide a human-readable description of the format.
+ #
+ # source://prism//prism/pack.rb#209
+ def describe; end
+
+ # A list of the directives in the template.
+ #
+ # source://prism//prism/pack.rb#197
+ def directives; end
+
+ # The encoding of the template.
+ #
+ # 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//prism/pack.rb#55
+Prism::Pack::STRING_LSB = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_MIME = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_MSB = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_NULL_PADDED = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_NULL_TERMINATED = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_POINTER = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_SPACE_PADDED = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::STRING_UU = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::UNSIGNED = T.let(T.unsafe(nil), Symbol)
+
+# source://prism//prism/pack.rb#55
+Prism::Pack::UTF8 = T.let(T.unsafe(nil), Symbol)
+
+# 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
+ #
+ # @return [ParametersNode] a new instance of ParametersNode
+ #
+ # source://prism//prism/node.rb#13187
+ def initialize(requireds, optionals, rest, posts, keywords, keyword_rest, block, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13199
+ def accept(visitor); end
+
+ # attr_reader block: BlockParameterNode?
+ #
+ # source://prism//prism/node.rb#13184
+ def block; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13204
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#13222
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13209
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ParametersNode
+ #
+ # source://prism//prism/node.rb#13227
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13204
+ 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#13244
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13249
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader keyword_rest: Node?
+ #
+ # source://prism//prism/node.rb#13181
+ def keyword_rest; end
+
+ # attr_reader keywords: Array[Node]
+ #
+ # source://prism//prism/node.rb#13178
+ def keywords; end
+
+ # attr_reader optionals: Array[Node]
+ #
+ # source://prism//prism/node.rb#13169
+ def optionals; end
+
+ # attr_reader posts: Array[Node]
+ #
+ # source://prism//prism/node.rb#13175
+ def posts; end
+
+ # attr_reader requireds: Array[Node]
+ #
+ # source://prism//prism/node.rb#13166
+ def requireds; end
+
+ # attr_reader rest: Node?
+ #
+ # source://prism//prism/node.rb#13172
+ def rest; end
+
+ # Mirrors the Method#parameters method.
+ #
+ # source://prism//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
+ # 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//prism/node.rb#13290
+ 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#13300
+ def type; end
+ end
+end
+
+# Represents a parenthesized expression
+#
+# (10 + 34)
+# ^^^^^^^^^
+class Prism::ParenthesesNode < ::Prism::Node
+ # def initialize: (body: Node?, opening_loc: Location, closing_loc: Location, location: Location) -> void
+ #
+ # @return [ParenthesesNode] a new instance of ParenthesesNode
+ #
+ # source://prism//prism/node.rb#13320
+ def initialize(body, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13328
+ 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
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13342
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ParenthesesNode
+ #
+ # source://prism//prism/node.rb#13354
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13337
+ 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#13367
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13382
+ 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
+ # 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//prism/node.rb#13409
+ 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#13419
+ 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.
+ #
+ # source://prism//prism/parse_result.rb#322
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of this error.
+ #
+ # source://prism//prism/parse_result.rb#327
+ def inspect; end
+
+ # A Location object representing the location of this error in the source.
+ #
+ # source://prism//prism/parse_result.rb#313
+ def location; end
+
+ # The message associated with this error.
+ #
+ # source://prism//prism/parse_result.rb#310
+ def message; end
+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
+ #
+ # source://prism//prism/parse_result.rb#387
+ def initialize(value, comments, magic_comments, data_loc, errors, warnings, source); end
+
+ # Attach the list of comments to their respective locations in the tree.
+ #
+ # source://prism//prism/parse_result/comments.rb#173
+ def attach_comments!; end
+
+ # The list of comments that were encountered during parsing.
+ #
+ # source://prism//prism/parse_result.rb#367
+ def comments; 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.
+ #
+ # source://prism//prism/parse_result.rb#375
+ def data_loc; end
+
+ # Implement the hash pattern matching interface for ParseResult.
+ #
+ # source://prism//prism/parse_result.rb#398
+ def deconstruct_keys(keys); end
+
+ # The list of errors that were generated during parsing.
+ #
+ # source://prism//prism/parse_result.rb#378
+ def errors; end
+
+ # Returns true if there were errors during parsing and false if there were
+ # not.
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/parse_result.rb#410
+ def failure?; end
+
+ # The list of magic comments that were encountered during parsing.
+ #
+ # source://prism//prism/parse_result.rb#370
+ def magic_comments; end
+
+ # Walk the tree and mark nodes that are on a new line.
+ #
+ # source://prism//prism/parse_result/newlines.rb#60
+ def mark_newlines!; end
+
+ # A Source instance that represents the source code that was parsed.
+ #
+ # source://prism//prism/parse_result.rb#384
+ def source; end
+
+ # Returns true if there were no errors during parsing and false if there
+ # were.
+ #
+ # @return [Boolean]
+ #
+ # 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.
+ #
+ # source://prism//prism/parse_result.rb#364
+ def value; end
+
+ # The list of warnings that were generated during parsing.
+ #
+ # source://prism//prism/parse_result.rb#381
+ def warnings; end
+end
+
+# When we've parsed the source, we have both the syntax tree and the list of
+# comments that we found in the source. This class is responsible for
+# walking the tree and finding the nearest location to attach each comment.
+#
+# It does this by first finding the nearest locations to each comment.
+# Locations can either come from nodes directly or from location fields on
+# nodes. For example, a `ClassNode` has an overall location encompassing the
+# entire class, but it also has a location for the `class` keyword.
+#
+# Once the nearest locations are found, it determines which one to attach
+# to. If it's a trailing comment (a comment on the same line as other source
+# code), it will favor attaching to the nearest location that occurs before
+# the comment. Otherwise it will favor attaching to the nearest location
+# that is after the comment.
+class Prism::ParseResult::Comments
+ # Create a new Comments object that will attach comments to the given
+ # parse result.
+ #
+ # @return [Comments] a new instance of Comments
+ #
+ # source://prism//prism/parse_result/comments.rb#78
+ def initialize(parse_result); end
+
+ # Attach the comments to their respective locations in the tree by
+ # mutating the parse result.
+ #
+ # source://prism//prism/parse_result/comments.rb#84
+ def attach!; end
+
+ # The parse result that we are attaching comments to.
+ #
+ # source://prism//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/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
+ #
+ # source://prism//prism/parse_result/comments.rb#52
+ def initialize(location); end
+
+ # source://prism//prism/parse_result/comments.rb#68
+ def <<(comment); end
+
+ # @return [Boolean]
+ #
+ # source://prism//prism/parse_result/comments.rb#64
+ def encloses?(comment); end
+
+ # source://prism//prism/parse_result/comments.rb#60
+ def end_offset; end
+
+ # source://prism//prism/parse_result/comments.rb#50
+ 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
+ #
+ # source://prism//prism/parse_result/comments.rb#25
+ def initialize(node); end
+
+ # source://prism//prism/parse_result/comments.rb#42
+ def <<(comment); end
+
+ # @return [Boolean]
+ #
+ # source://prism//prism/parse_result/comments.rb#37
+ def encloses?(comment); end
+
+ # source://prism//prism/parse_result/comments.rb#33
+ def end_offset; end
+
+ # source://prism//prism/parse_result/comments.rb#23
+ def node; end
+
+ # source://prism//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.
+class Prism::ParseResult::Newlines < ::Prism::Visitor
+ # Create a new Newlines visitor with the given newline offsets.
+ #
+ # @return [Newlines] a new instance of Newlines
+ #
+ # source://prism//prism/parse_result/newlines.rb#22
+ def initialize(newline_marked); end
+
+ # Permit block/lambda nodes to mark newlines within themselves.
+ #
+ # source://prism//prism/parse_result/newlines.rb#27
+ def visit_block_node(node); end
+
+ # Mark if/unless nodes as newlines.
+ #
+ # source://prism//prism/parse_result/newlines.rb#41
+ def visit_if_node(node); end
+
+ # Permit block/lambda nodes to mark newlines within themselves.
+ #
+ # source://prism//prism/parse_result/newlines.rb#27
+ def visit_lambda_node(node); end
+
+ # Permit statements lists to mark newlines within themselves.
+ #
+ # source://prism//prism/parse_result/newlines.rb#49
+ def visit_statements_node(node); end
+
+ # Mark if/unless nodes as newlines.
+ #
+ # source://prism//prism/parse_result/newlines.rb#41
+ def visit_unless_node(node); end
+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
+ #
+ # source://prism//prism/parse_result.rb#341
+ def initialize(message, location); end
+
+ # Implement the hash pattern matching interface for ParseWarning.
+ #
+ # source://prism//prism/parse_result.rb#347
+ def deconstruct_keys(keys); end
+
+ # Returns a string representation of this warning.
+ #
+ # source://prism//prism/parse_result.rb#352
+ def inspect; end
+
+ # A Location object representing the location of this warning in the source.
+ #
+ # source://prism//prism/parse_result.rb#338
+ def location; end
+
+ # The message associated with this warning.
+ #
+ # source://prism//prism/parse_result.rb#335
+ 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.
+class Prism::Pattern
+ # Create a new pattern with the given query. The query should be a string
+ # containing a Ruby pattern matching expression.
+ #
+ # @return [Pattern] a new instance of Pattern
+ #
+ # source://prism//prism/pattern.rb#63
+ def initialize(query); end
+
+ # Compile the query into a callable object that can be used to match against
+ # nodes.
+ #
+ # source://prism//prism/pattern.rb#70
+ def compile; end
+
+ # The query that this pattern was initialized with.
+ #
+ # source://prism//prism/pattern.rb#59
+ def query; end
+
+ # Scan the given node and all of its children for nodes that match the
+ # pattern. If a block is given, it will be called with each node that
+ # matches the pattern. If no block is given, an enumerator will be returned
+ # that will yield each node that matches the pattern.
+ #
+ # source://prism//prism/pattern.rb#79
+ def scan(root); end
+
+ private
+
+ # Shortcut for combining two procs into one that returns true if both return
+ # true.
+ #
+ # source://prism//prism/pattern.rb#95
+ def combine_and(left, right); end
+
+ # Shortcut for combining two procs into one that returns true if either
+ # returns true.
+ #
+ # source://prism//prism/pattern.rb#101
+ def combine_or(left, right); end
+
+ # in foo | bar
+ #
+ # source://prism//prism/pattern.rb#136
+ def compile_alternation_pattern_node(node); end
+
+ # in [foo, bar, baz]
+ #
+ # source://prism//prism/pattern.rb#111
+ def compile_array_pattern_node(node); end
+
+ # in Prism::ConstantReadNode
+ #
+ # source://prism//prism/pattern.rb#141
+ def compile_constant_path_node(node); end
+
+ # in ConstantReadNode
+ # in String
+ #
+ # source://prism//prism/pattern.rb#153
+ def compile_constant_read_node(node); 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/
+ #
+ # source://prism//prism/pattern.rb#201
+ def compile_regular_expression_node(node); end
+
+ # in ""
+ # in "foo"
+ #
+ # source://prism//prism/pattern.rb#209
+ def compile_string_node(node); end
+
+ # in :+
+ # in :foo
+ #
+ # source://prism//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.
+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
+end
+
+# Represents the use of the `^` operator for pinning an expression in a
+# pattern matching expression.
+#
+# foo in ^(bar)
+# ^^^^^^
+class Prism::PinnedExpressionNode < ::Prism::Node
+ # def initialize: (expression: Node, operator_loc: Location, lparen_loc: Location, rparen_loc: Location, location: Location) -> void
+ #
+ # @return [PinnedExpressionNode] a new instance of PinnedExpressionNode
+ #
+ # source://prism//prism/node.rb#13443
+ def initialize(expression, operator_loc, lparen_loc, rparen_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13452
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13457
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#13467
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13462
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> PinnedExpressionNode
+ #
+ # source://prism//prism/node.rb#13472
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13457
+ 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#13486
+ def deconstruct_keys(keys); end
+
+ # attr_reader expression: Node
+ #
+ # source://prism//prism/node.rb#13431
+ def expression; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13506
+ 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
+ #
+ # source://prism//prism/node.rb#13491
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#13434
+ def operator_loc; end
+
+ # def rparen: () -> String
+ #
+ # source://prism//prism/node.rb#13501
+ def rparen; end
+
+ # attr_reader rparen_loc: Location
+ #
+ # source://prism//prism/node.rb#13440
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13530
+ 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#13540
+ def type; end
+ end
+end
+
+# Represents the use of the `^` operator for pinning a variable in a pattern
+# matching expression.
+#
+# foo in ^bar
+# ^^^^
+class Prism::PinnedVariableNode < ::Prism::Node
+ # def initialize: (variable: Node, operator_loc: Location, location: Location) -> void
+ #
+ # @return [PinnedVariableNode] a new instance of PinnedVariableNode
+ #
+ # source://prism//prism/node.rb#13558
+ def initialize(variable, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13565
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13570
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#13580
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13575
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> PinnedVariableNode
+ #
+ # source://prism//prism/node.rb#13585
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13570
+ 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#13597
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13607
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#13602
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#13555
+ 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//prism/node.rb#13629
+ def type; end
+
+ # attr_reader variable: Node
+ #
+ # source://prism//prism/node.rb#13552
+ def variable; end
+
+ class << self
+ # Similar to #type, this method returns a symbol that you can use for
+ # splitting on the type of the node without having to do a long === chain.
+ # Note that like #type, it will still be slower than using == for a single
+ # class, but should be faster in a case statement or an array comparison.
+ #
+ # def self.type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13639
+ def type; end
+ end
+end
+
+# Represents the use of the `END` keyword.
+#
+# END { foo }
+# ^^^^^^^^^^^
+class Prism::PostExecutionNode < ::Prism::Node
+ # def initialize: (statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location) -> void
+ #
+ # @return [PostExecutionNode] a new instance of PostExecutionNode
+ #
+ # source://prism//prism/node.rb#13662
+ def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13671
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13676
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13681
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> PostExecutionNode
+ #
+ # source://prism//prism/node.rb#13693
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13676
+ 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#13707
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13727
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#13712
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#13653
+ def keyword_loc; end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#13717
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#13656
+ def opening_loc; end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#13650
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13755
+ 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#13765
+ def type; end
+ end
+end
+
+# Represents the use of the `BEGIN` keyword.
+#
+# BEGIN { foo }
+# ^^^^^^^^^^^^^
+class Prism::PreExecutionNode < ::Prism::Node
+ # def initialize: (statements: StatementsNode?, keyword_loc: Location, opening_loc: Location, closing_loc: Location, location: Location) -> void
+ #
+ # @return [PreExecutionNode] a new instance of PreExecutionNode
+ #
+ # source://prism//prism/node.rb#13788
+ def initialize(statements, keyword_loc, opening_loc, closing_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13797
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13802
+ 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
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13807
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> PreExecutionNode
+ #
+ # source://prism//prism/node.rb#13819
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13802
+ 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#13833
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13853
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#13838
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#13779
+ def keyword_loc; end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#13843
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#13782
+ def opening_loc; end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#13776
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13881
+ 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#13891
+ 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
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#13912
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13917
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#13927
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#13922
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ProgramNode
+ #
+ # source://prism//prism/node.rb#13932
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#13917
+ 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#13944
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#13949
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#13899
+ def locals; end
+
+ # attr_reader statements: StatementsNode
+ #
+ # source://prism//prism/node.rb#13902
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#13971
+ 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
+end
+
+# Flags for range and flip-flop nodes.
+module Prism::RangeFlags; end
+
+# ... operator
+#
+# source://prism//prism/node.rb#17339
+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/
+# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
+class Prism::RangeNode < ::Prism::Node
+ # def initialize: (flags: Integer, left: Node?, right: Node?, operator_loc: Location, location: Location) -> void
+ #
+ # @return [RangeNode] a new instance of RangeNode
+ #
+ # source://prism//prism/node.rb#14007
+ def initialize(flags, left, right, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14016
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14021
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14034
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14026
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RangeNode
+ #
+ # source://prism//prism/node.rb#14039
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14021
+ 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#14053
+ def deconstruct_keys(keys); end
+
+ # def exclude_end?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14058
+ def exclude_end?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14068
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader left: Node?
+ #
+ # source://prism//prism/node.rb#13998
+ def left; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#14063
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#14004
+ def operator_loc; end
+
+ # attr_reader right: Node?
+ #
+ # source://prism//prism/node.rb#14001
+ def right; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#14102
+ 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.
+ # 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#14112
+ def type; end
+ end
+end
+
+# Represents a rational number literal.
+#
+# 1.0r
+# ^^^^
+class Prism::RationalNode < ::Prism::Node
+ # def initialize: (numeric: Node, location: Location) -> void
+ #
+ # @return [RationalNode] a new instance of RationalNode
+ #
+ # source://prism//prism/node.rb#14126
+ def initialize(numeric, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14132
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14137
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14147
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14142
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RationalNode
+ #
+ # source://prism//prism/node.rb#14152
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14137
+ 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#14163
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14168
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader numeric: Node
+ #
+ # source://prism//prism/node.rb#14123
+ 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
+ # 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//prism/node.rb#14189
+ 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.
+ # 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#14199
+ def type; end
+ end
+end
+
+# Represents the use of the `redo` keyword.
+#
+# redo
+# ^^^^
+class Prism::RedoNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [RedoNode] a new instance of RedoNode
+ #
+ # source://prism//prism/node.rb#14210
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14215
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14220
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14230
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14225
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RedoNode
+ #
+ # source://prism//prism/node.rb#14235
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # 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]
+ #
+ # source://prism//prism/node.rb#14245
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14250
+ 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//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
+
+ # def initialize: (flags: Integer, opening_loc: Location, content_loc: Location, closing_loc: Location, unescaped: String, location: Location) -> void
+ #
+ # @return [RegularExpressionNode] a new instance of RegularExpressionNode
+ #
+ # source://prism//prism/node.rb#14305
+ def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14315
+ def accept(visitor); end
+
+ # def ascii_8bit?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14380
+ def ascii_8bit?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14320
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#14420
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#14299
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14330
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14325
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # source://prism//prism/node.rb#14415
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # source://prism//prism/node.rb#14296
+ def content_loc; end
+
+ # def copy: (**params) -> RegularExpressionNode
+ #
+ # source://prism//prism/node.rb#14335
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14320
+ 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#14350
+ def deconstruct_keys(keys); end
+
+ # def euc_jp?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14375
+ def euc_jp?; end
+
+ # def extended?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14360
+ def extended?; end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14400
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14405
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14395
+ def forced_utf8_encoding?; end
+
+ # def ignore_case?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14355
+ def ignore_case?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14425
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def multi_line?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14365
+ def multi_line?; end
+
+ # def once?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14370
+ def once?; end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#14410
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#14293
+ def opening_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # 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//prism/node.rb#14450
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # source://prism//prism/node.rb#14302
+ def unescaped; end
+
+ # def utf_8?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14390
+ def utf_8?; end
+
+ # def windows_31j?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#14385
+ def windows_31j?; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # 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
+
+module Prism::RegularExpressionOptions
+ # Returns a numeric value that represents the flags that were used to create
+ # the regular expression.
+ #
+ # source://prism//prism/node_ext.rb#9
+ def options; end
+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
+ #
+ # source://prism//prism/node.rb#14478
+ def initialize(name, name_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14485
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14490
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14500
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14495
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RequiredKeywordParameterNode
+ #
+ # source://prism//prism/node.rb#14505
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14490
+ 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#14517
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14522
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#14472
+ def name; end
+
+ # attr_reader name_loc: Location
+ #
+ # source://prism//prism/node.rb#14475
+ def name_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//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
+end
+
+# Represents a required parameter to a method, block, or lambda definition.
+#
+# def a(b)
+# ^
+# end
+class Prism::RequiredParameterNode < ::Prism::Node
+ # def initialize: (name: Symbol, location: Location) -> void
+ #
+ # @return [RequiredParameterNode] a new instance of RequiredParameterNode
+ #
+ # source://prism//prism/node.rb#14568
+ def initialize(name, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14574
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14579
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14589
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14584
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RequiredParameterNode
+ #
+ # source://prism//prism/node.rb#14594
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14579
+ 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#14605
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14610
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol
+ #
+ # source://prism//prism/node.rb#14565
+ 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
+ # 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//prism/node.rb#14630
+ 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#14640
+ def type; end
+ end
+end
+
+# Represents an expression modified with a rescue.
+#
+# foo rescue nil
+# ^^^^^^^^^^^^^^
+class Prism::RescueModifierNode < ::Prism::Node
+ # def initialize: (expression: Node, keyword_loc: Location, rescue_expression: Node, location: Location) -> void
+ #
+ # @return [RescueModifierNode] a new instance of RescueModifierNode
+ #
+ # source://prism//prism/node.rb#14660
+ def initialize(expression, keyword_loc, rescue_expression, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14668
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14677
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14687
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14682
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RescueModifierNode
+ #
+ # source://prism//prism/node.rb#14692
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14677
+ 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#14705
+ def deconstruct_keys(keys); end
+
+ # attr_reader expression: Node
+ #
+ # source://prism//prism/node.rb#14651
+ def expression; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14715
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#14710
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#14654
+ def keyword_loc; end
+
+ # attr_reader rescue_expression: Node
+ #
+ # source://prism//prism/node.rb#14657
+ def rescue_expression; end
+
+ # source://prism//prism/node.rb#14672
+ def set_newline_flag(newline_marked); end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#14739
+ 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#14749
+ def type; end
+ end
+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.
+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
+ #
+ # @return [RescueNode] a new instance of RescueNode
+ #
+ # source://prism//prism/node.rb#14784
+ def initialize(keyword_loc, exceptions, operator_loc, reference, statements, consequent, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14795
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14800
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14815
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14805
+ def compact_child_nodes; end
+
+ # attr_reader consequent: RescueNode?
+ #
+ # source://prism//prism/node.rb#14781
+ def consequent; end
+
+ # def copy: (**params) -> RescueNode
+ #
+ # source://prism//prism/node.rb#14820
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14800
+ 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#14836
+ def deconstruct_keys(keys); end
+
+ # attr_reader exceptions: Array[Node]
+ #
+ # source://prism//prism/node.rb#14769
+ def exceptions; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14851
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#14841
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#14766
+ def keyword_loc; end
+
+ # def operator: () -> String?
+ #
+ # source://prism//prism/node.rb#14846
+ def operator; end
+
+ # attr_reader operator_loc: Location?
+ #
+ # source://prism//prism/node.rb#14772
+ def operator_loc; end
+
+ # attr_reader reference: Node?
+ #
+ # source://prism//prism/node.rb#14775
+ def reference; end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#14778
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#14891
+ 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#14901
+ def type; end
+ end
+end
+
+# Represents a rest parameter to a method, block, or lambda definition.
+#
+# def a(*b)
+# ^^
+# end
+class Prism::RestParameterNode < ::Prism::Node
+ # def initialize: (name: Symbol?, name_loc: Location?, operator_loc: Location, location: Location) -> void
+ #
+ # @return [RestParameterNode] a new instance of RestParameterNode
+ #
+ # source://prism//prism/node.rb#14922
+ def initialize(name, name_loc, operator_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#14930
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14935
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#14945
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#14940
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RestParameterNode
+ #
+ # source://prism//prism/node.rb#14950
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#14935
+ 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#14963
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#14973
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader name: Symbol?
+ #
+ # source://prism//prism/node.rb#14913
+ def name; end
+
+ # attr_reader name_loc: Location?
+ #
+ # source://prism//prism/node.rb#14916
+ def name_loc; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#14968
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#14919
+ 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//prism/node.rb#14999
+ 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#15009
+ def type; end
+ end
+end
+
+# Represents the use of the `retry` keyword.
+#
+# retry
+# ^^^^^
+class Prism::RetryNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [RetryNode] a new instance of RetryNode
+ #
+ # source://prism//prism/node.rb#15020
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15025
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15030
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15040
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15035
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> RetryNode
+ #
+ # source://prism//prism/node.rb#15045
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15030
+ 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#15055
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15060
+ 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//prism/node.rb#15079
+ 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#15089
+ def type; end
+ end
+end
+
+# Represents the use of the `return` keyword.
+#
+# return 1
+# ^^^^^^^^
+class Prism::ReturnNode < ::Prism::Node
+ # def initialize: (keyword_loc: Location, arguments: ArgumentsNode?, location: Location) -> void
+ #
+ # @return [ReturnNode] a new instance of ReturnNode
+ #
+ # source://prism//prism/node.rb#15106
+ def initialize(keyword_loc, arguments, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15113
+ 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
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15130
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15123
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> ReturnNode
+ #
+ # source://prism//prism/node.rb#15135
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15118
+ 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#15147
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15157
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#15152
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#15100
+ def keyword_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#15183
+ 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#15193
+ 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.
+#
+# 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.
+class Prism::RipperCompat < ::Prism::Visitor
+ # Create a new RipperCompat object with the given source.
+ #
+ # @return [RipperCompat] a new instance of RipperCompat
+ #
+ # source://prism//prism/ripper_compat.rb#74
+ def initialize(source); end
+
+ # The current column number of the parser.
+ #
+ # source://prism//prism/ripper_compat.rb#71
+ def column; end
+
+ # True if the parser encountered an error during parsing.
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/ripper_compat.rb#86
+ def error?; end
+
+ # The current line number of the parser.
+ #
+ # source://prism//prism/ripper_compat.rb#68
+ def lineno; end
+
+ # Parse the source and return the result.
+ #
+ # source://prism//prism/ripper_compat.rb#91
+ def parse; end
+
+ # The source that is being parsed.
+ #
+ # source://prism//prism/ripper_compat.rb#65
+ def source; end
+
+ # Visit a CallNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#110
+ def visit_call_node(node); end
+
+ # Visit a FloatNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#123
+ def visit_float_node(node); end
+
+ # Visit a ImaginaryNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#129
+ def visit_imaginary_node(node); end
+
+ # Visit an IntegerNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#135
+ def visit_integer_node(node); end
+
+ # Visit a ProgramNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#155
+ def visit_program_node(node); end
+
+ # Visit a RationalNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#141
+ def visit_rational_node(node); end
+
+ # Visit a StatementsNode node.
+ #
+ # source://prism//prism/ripper_compat.rb#147
+ def visit_statements_node(node); end
+
+ private
+
+ # source://prism//prism/ripper_compat.rb#192
+ def _dispatch0; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def _dispatch1(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def _dispatch2(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def _dispatch3(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def _dispatch4(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#197
+ def _dispatch5(_, _, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#198
+ def _dispatch7(_, _, _, _, _, _, _); 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//prism/ripper_compat.rb#182
+ def bounds(location); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_BEGIN(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_CHAR(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_END(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on___end__(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_alias(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_alias_error(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_aref(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_aref_field(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_arg_ambiguous(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_arg_paren(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_args_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_args_add_block(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_args_add_star(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_args_forward; end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_args_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_array(_); end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def on_aryptn(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_assign(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_assign_error(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_assoc_new(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_assoc_splat(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_assoclist_from_args(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_backref(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_backtick(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_bare_assoc_hash(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_begin(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_binary(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_block_var(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_blockarg(_); end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def on_bodystmt(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_brace_block(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_break(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_call(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_case(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_class(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_class_name_error(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_comma(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_command(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def on_command_call(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_comment(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_const(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_const_path_field(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_const_path_ref(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_const_ref(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_cvar(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_def(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_defined(_); end
+
+ # source://prism//prism/ripper_compat.rb#197
+ def on_defs(_, _, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_do_block(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_dot2(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_dot3(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_dyna_symbol(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_else(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_elsif(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embdoc(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embdoc_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embdoc_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embexpr_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embexpr_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_embvar(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_ensure(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_excessed_comma; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_fcall(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_field(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_float(_); end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def on_fndptn(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_for(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_gvar(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_hash(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_heredoc_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_heredoc_dedent(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_heredoc_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_hshptn(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_ident(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_if(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_if_mod(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_ifop(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_ignored_nl(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_ignored_sp(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_imaginary(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_in(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_int(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_ivar(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_kw(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_kwrest_param(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_label(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_label_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_lambda(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_lbrace(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_lbracket(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_lparen(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_magic_comment(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_massign(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_method_add_arg(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_method_add_block(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_mlhs_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_mlhs_add_post(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_mlhs_add_star(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_mlhs_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_mlhs_paren(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_module(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_mrhs_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_mrhs_add_star(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_mrhs_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_mrhs_new_from_args(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_next(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_nl(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_nokw_param(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_op(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_opassign(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_operator_ambiguous(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_param_error(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#198
+ def on_params(_, _, _, _, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_paren(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_parse_error(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_period(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_program(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_qsymbols_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_qsymbols_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_qsymbols_new; end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_qwords_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_qwords_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_qwords_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_rational(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_rbrace(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_rbracket(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_redo; end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_regexp_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_regexp_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_regexp_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_regexp_literal(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_regexp_new; end
+
+ # source://prism//prism/ripper_compat.rb#196
+ def on_rescue(_, _, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_rescue_mod(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_rest_param(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_retry; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_return(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_return0; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_rparen(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_sclass(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_semicolon(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_sp(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_stmts_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_stmts_new; end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_string_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_string_concat(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_string_content; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_string_dvar(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_string_embexpr(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_string_literal(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_super(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_symbeg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_symbol(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_symbol_literal(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_symbols_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_symbols_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_symbols_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_tlambda(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_tlambeg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_top_const_field(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_top_const_ref(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_tstring_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_tstring_content(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_tstring_end(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_unary(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_undef(_); end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_unless(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_unless_mod(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_until(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_until_mod(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_var_alias(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_var_field(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_var_ref(_); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_vcall(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_void_stmt; end
+
+ # source://prism//prism/ripper_compat.rb#195
+ def on_when(_, _, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_while(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_while_mod(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_word_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_word_new; end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_words_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_words_beg(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_words_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_words_sep(_); end
+
+ # source://prism//prism/ripper_compat.rb#194
+ def on_xstring_add(_, _); end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_xstring_literal(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_xstring_new; end
+
+ # source://prism//prism/ripper_compat.rb#193
+ def on_yield(_); end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_yield0; end
+
+ # source://prism//prism/ripper_compat.rb#192
+ def on_zsuper; end
+
+ # Lazily initialize the parse result.
+ #
+ # source://prism//prism/ripper_compat.rb#188
+ def result; 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
+
+ # 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
+
+# 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//prism/ripper_compat.rb#27
+ def on_BEGIN(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_CHAR(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_END(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on___end__(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_alias(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_alias_error(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_aref(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_aref_field(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_arg_ambiguous(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_arg_paren(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_args_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_args_add_block(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_args_add_star(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_args_forward(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_args_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_array(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_aryptn(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_assign(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_assign_error(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_assoc_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_assoc_splat(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_assoclist_from_args(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_backref(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_backtick(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_bare_assoc_hash(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_begin(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_binary(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_block_var(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_blockarg(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_bodystmt(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_brace_block(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_break(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_call(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_case(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_class(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_class_name_error(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_comma(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_command(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_command_call(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_comment(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_const(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_const_path_field(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_const_path_ref(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_const_ref(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_cvar(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_def(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_defined(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_defs(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_do_block(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_dot2(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_dot3(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_dyna_symbol(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_else(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_elsif(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embdoc(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embdoc_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embdoc_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embexpr_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embexpr_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_embvar(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_ensure(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_excessed_comma(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_fcall(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_field(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_float(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_fndptn(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_for(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_gvar(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_hash(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_heredoc_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_heredoc_dedent(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_heredoc_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_hshptn(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_ident(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_if(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_if_mod(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_ifop(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_ignored_nl(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_ignored_sp(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_imaginary(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_in(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_int(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_ivar(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_kw(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_kwrest_param(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_label(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_label_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_lambda(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_lbrace(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_lbracket(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_lparen(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_magic_comment(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_massign(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_method_add_arg(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_method_add_block(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mlhs_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mlhs_add_post(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mlhs_add_star(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mlhs_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mlhs_paren(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_module(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mrhs_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mrhs_add_star(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mrhs_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_mrhs_new_from_args(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_next(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_nl(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_nokw_param(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_op(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_opassign(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_operator_ambiguous(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_param_error(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_params(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_paren(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_parse_error(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_period(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_program(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_qsymbols_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_qsymbols_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_qsymbols_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_qwords_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_qwords_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_qwords_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_rational(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_rbrace(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_rbracket(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_redo(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_regexp_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_regexp_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_regexp_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_regexp_literal(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_regexp_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_rescue(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_rescue_mod(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_rest_param(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_retry(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_return(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_return0(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_rparen(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_sclass(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_semicolon(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_sp(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_stmts_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_stmts_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_concat(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_content(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_dvar(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_embexpr(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_string_literal(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_super(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_symbeg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_symbol(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_symbol_literal(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_symbols_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_symbols_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_symbols_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_tlambda(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_tlambeg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_top_const_field(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_top_const_ref(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_tstring_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_tstring_content(value); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_tstring_end(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_unary(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_undef(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_unless(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_unless_mod(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_until(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_until_mod(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_var_alias(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_var_field(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_var_ref(*args); end
+
+ # source://prism//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//prism/ripper_compat.rb#27
+ def on_when(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_while(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_while_mod(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_word_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_word_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_words_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_words_beg(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_words_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#33
+ def on_words_sep(value); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_xstring_add(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_xstring_literal(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_xstring_new(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_yield(*args); end
+
+ # source://prism//prism/ripper_compat.rb#27
+ def on_yield0(*args); end
+
+ # source://prism//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.
+class Prism::RipperCompat::SexpBuilderPP < ::Prism::RipperCompat::SexpBuilder
+ private
+
+ # source://prism//prism/ripper_compat.rb#45
+ def _dispatch_event_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def _dispatch_event_push(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_args_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_args_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_mlhs_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_mlhs_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_mrhs_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_mrhs_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_qsymbols_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_qsymbols_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_qwords_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_qwords_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_regexp_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_regexp_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_stmts_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_stmts_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_string_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_symbols_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_symbols_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_word_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_word_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_words_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_words_new; end
+
+ # source://prism//prism/ripper_compat.rb#49
+ def on_xstring_add(list, item); end
+
+ # source://prism//prism/ripper_compat.rb#45
+ def on_xstring_new; end
+end
+
+# Represents the `self` keyword.
+#
+# self
+# ^^^^
+class Prism::SelfNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [SelfNode] a new instance of SelfNode
+ #
+ # source://prism//prism/node.rb#15204
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15209
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15214
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15224
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15219
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SelfNode
+ #
+ # source://prism//prism/node.rb#15229
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15214
+ 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#15239
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15244
+ 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//prism/node.rb#15263
+ 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#15273
+ 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
+ #
+ # source://prism//prism/serialize.rb#58
+ def initialize(source, serialized); end
+
+ # Returns the value of attribute constant_pool.
+ #
+ # source://prism//prism/serialize.rb#55
+ def constant_pool; end
+
+ # Returns the value of attribute constant_pool_offset.
+ #
+ # source://prism//prism/serialize.rb#55
+ def constant_pool_offset; end
+
+ # Returns the value of attribute encoding.
+ #
+ # source://prism//prism/serialize.rb#54
+ def encoding; end
+
+ # Returns the value of attribute input.
+ #
+ # source://prism//prism/serialize.rb#54
+ def input; end
+
+ # Returns the value of attribute io.
+ #
+ # 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//prism/serialize.rb#88
+ def load_start_line; end
+
+ # source://prism//prism/serialize.rb#111
+ def load_tokens; end
+
+ # source://prism//prism/serialize.rb#124
+ def load_tokens_result; end
+
+ # Returns the value of attribute serialized.
+ #
+ # source://prism//prism/serialize.rb#54
+ def serialized; end
+
+ # Returns the value of attribute source.
+ #
+ # source://prism//prism/serialize.rb#55
+ def source; end
+
+ # Returns the value of attribute start_line.
+ #
+ # 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//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
+
+ # source://prism//prism/serialize.rb#232
+ def load_required_constant; end
+
+ # source://prism//prism/serialize.rb#176
+ def load_serialized_length; end
+
+ # source://prism//prism/serialize.rb#191
+ def load_string; end
+
+ # source://prism//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//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)
+
+# 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)
+
+# 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
+ #
+ # @return [SingletonClassNode] a new instance of SingletonClassNode
+ #
+ # 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
+ #
+ # source://prism//prism/node.rb#15313
+ def accept(visitor); end
+
+ # attr_reader body: Node?
+ #
+ # source://prism//prism/node.rb#15296
+ def body; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15318
+ def child_nodes; end
+
+ # def class_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#15357
+ def class_keyword; end
+
+ # attr_reader class_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#15287
+ def class_keyword_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15331
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15323
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SingletonClassNode
+ #
+ # source://prism//prism/node.rb#15336
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15318
+ 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#15352
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String
+ #
+ # source://prism//prism/node.rb#15367
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#15299
+ def end_keyword_loc; end
+
+ # attr_reader expression: Node
+ #
+ # source://prism//prism/node.rb#15293
+ def expression; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15372
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # attr_reader locals: Array[Symbol]
+ #
+ # source://prism//prism/node.rb#15284
+ def locals; end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#15362
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#15290
+ 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//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
+
+# 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
+ #
+ # source://prism//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//prism/parse_result.rb#55
+ def character_column(byte_offset); end
+
+ # Return the character offset for the given byte offset.
+ #
+ # source://prism//prism/parse_result.rb#50
+ def character_offset(byte_offset); end
+
+ # Return the column number for the given byte offset.
+ #
+ # source://prism//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//prism/parse_result.rb#34
+ def line(byte_offset); end
+
+ # Return the byte offset of the start of the line corresponding to the given
+ # byte offset.
+ #
+ # source://prism//prism/parse_result.rb#40
+ def line_start(byte_offset); end
+
+ # The list of newline byte offsets in the source code.
+ #
+ # source://prism//prism/parse_result.rb#15
+ def offsets; 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
+
+ # The source code that this source object represents.
+ #
+ # source://prism//prism/parse_result.rb#9
+ def source; end
+
+ # The line number where this source starts.
+ #
+ # source://prism//prism/parse_result.rb#12
+ def start_line; end
+
+ # The line number where this source starts.
+ #
+ # source://prism//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//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//prism/parse_result.rb#63
+ def find_line(byte_offset); end
+end
+
+# Represents the use of the `__ENCODING__` keyword.
+#
+# __ENCODING__
+# ^^^^^^^^^^^^
+class Prism::SourceEncodingNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [SourceEncodingNode] a new instance of SourceEncodingNode
+ #
+ # source://prism//prism/node.rb#15424
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15429
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15434
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15444
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15439
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SourceEncodingNode
+ #
+ # source://prism//prism/node.rb#15449
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15434
+ 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#15459
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15464
+ 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//prism/node.rb#15483
+ 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#15493
+ def type; end
+ end
+end
+
+# Represents the use of the `__FILE__` keyword.
+#
+# __FILE__
+# ^^^^^^^^
+class Prism::SourceFileNode < ::Prism::Node
+ # def initialize: (filepath: String, location: Location) -> void
+ #
+ # @return [SourceFileNode] a new instance of SourceFileNode
+ #
+ # source://prism//prism/node.rb#15507
+ def initialize(filepath, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15513
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15518
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15528
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15523
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SourceFileNode
+ #
+ # source://prism//prism/node.rb#15533
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15518
+ 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#15544
+ def deconstruct_keys(keys); end
+
+ # attr_reader filepath: String
+ #
+ # source://prism//prism/node.rb#15504
+ def filepath; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15549
+ 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//prism/node.rb#15569
+ 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#15579
+ def type; end
+ end
+end
+
+# Represents the use of the `__LINE__` keyword.
+#
+# __LINE__
+# ^^^^^^^^
+class Prism::SourceLineNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [SourceLineNode] a new instance of SourceLineNode
+ #
+ # source://prism//prism/node.rb#15590
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15595
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15600
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15610
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15605
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SourceLineNode
+ #
+ # source://prism//prism/node.rb#15615
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15600
+ 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#15625
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # 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.
+ #
+ # 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//prism/node.rb#15649
+ 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#15659
+ def type; end
+ end
+end
+
+# Represents the use of the splat operator.
+#
+# [*a]
+# ^^
+class Prism::SplatNode < ::Prism::Node
+ # def initialize: (operator_loc: Location, expression: Node?, location: Location) -> void
+ #
+ # @return [SplatNode] a new instance of SplatNode
+ #
+ # source://prism//prism/node.rb#15676
+ def initialize(operator_loc, expression, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15683
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15688
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15700
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15693
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SplatNode
+ #
+ # source://prism//prism/node.rb#15705
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15688
+ 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#15717
+ def deconstruct_keys(keys); end
+
+ # attr_reader expression: Node?
+ #
+ # source://prism//prism/node.rb#15673
+ def expression; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15727
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def operator: () -> String
+ #
+ # source://prism//prism/node.rb#15722
+ def operator; end
+
+ # attr_reader operator_loc: Location
+ #
+ # source://prism//prism/node.rb#15670
+ 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//prism/node.rb#15753
+ 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#15763
+ def type; end
+ end
+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
+ #
+ # @return [StatementsNode] a new instance of StatementsNode
+ #
+ # source://prism//prism/node.rb#15777
+ def initialize(body, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15783
+ def accept(visitor); end
+
+ # attr_reader body: Array[Node]
+ #
+ # source://prism//prism/node.rb#15774
+ def body; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15788
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15798
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15793
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> StatementsNode
+ #
+ # source://prism//prism/node.rb#15803
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15788
+ 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#15814
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15819
+ 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//prism/node.rb#15839
+ 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#15849
+ def type; end
+ end
+end
+
+# Flags for string nodes.
+module Prism::StringFlags; 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)
+
+# 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)
+
+# frozen by virtue of a `frozen_string_literal` comment
+#
+# source://prism//prism/node.rb#17387
+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"
+# ^^^^ ^^^^
+class Prism::StringNode < ::Prism::Node
+ include ::Prism::HeredocQuery
+
+ # def initialize: (flags: Integer, opening_loc: Location?, content_loc: Location, closing_loc: Location?, unescaped: String, location: Location) -> void
+ #
+ # @return [StringNode] a new instance of StringNode
+ #
+ # source://prism//prism/node.rb#15882
+ def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#15892
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15897
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#15957
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#15876
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#15907
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#15902
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # source://prism//prism/node.rb#15952
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # source://prism//prism/node.rb#15873
+ def content_loc; end
+
+ # def copy: (**params) -> StringNode
+ #
+ # source://prism//prism/node.rb#15912
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#15897
+ 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#15927
+ def deconstruct_keys(keys); end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#15937
+ def forced_binary_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#15932
+ def forced_utf8_encoding?; end
+
+ # def frozen?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#15942
+ def frozen?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#15962
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#15947
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#15870
+ def opening_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # 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//prism/node.rb#15987
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # source://prism//prism/node.rb#15879
+ def unescaped; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # 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
+
+# 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
+ #
+ # @return [SuperNode] a new instance of SuperNode
+ #
+ # source://prism//prism/node.rb#16026
+ def initialize(keyword_loc, lparen_loc, arguments, rparen_loc, block, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16036
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#16017
+ def arguments; end
+
+ # attr_reader block: Node?
+ #
+ # source://prism//prism/node.rb#16023
+ def block; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16041
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16054
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16046
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SuperNode
+ #
+ # source://prism//prism/node.rb#16059
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16041
+ 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#16074
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16094
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16079
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16011
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # source://prism//prism/node.rb#16084
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#16014
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#16089
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#16020
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#16128
+ 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#16138
+ def type; end
+ end
+end
+
+# Flags for symbol nodes.
+module Prism::SymbolFlags; 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)
+
+# 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)
+
+# 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)
+
+# 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
+ #
+ # @return [SymbolNode] a new instance of SymbolNode
+ #
+ # source://prism//prism/node.rb#16167
+ def initialize(flags, opening_loc, value_loc, closing_loc, unescaped, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16177
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16182
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#16242
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#16161
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16192
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16187
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> SymbolNode
+ #
+ # source://prism//prism/node.rb#16197
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16182
+ 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#16212
+ def deconstruct_keys(keys); end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16222
+ def forced_binary_encoding?; end
+
+ # def forced_us_ascii_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16227
+ def forced_us_ascii_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16217
+ def forced_utf8_encoding?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16247
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String?
+ #
+ # source://prism//prism/node.rb#16232
+ def opening; end
+
+ # attr_reader opening_loc: Location?
+ #
+ # source://prism//prism/node.rb#16155
+ def opening_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # 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//prism/node.rb#16272
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # source://prism//prism/node.rb#16164
+ def unescaped; end
+
+ # def value: () -> String?
+ #
+ # source://prism//prism/node.rb#16237
+ def value; end
+
+ # attr_reader value_loc: Location?
+ #
+ # source://prism//prism/node.rb#16158
+ def value_loc; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#16152
+ 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#16282
+ def type; end
+ 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.
+ #
+ # @return [Token] a new instance of Token
+ #
+ # source://prism//prism/parse_result.rb#427
+ def initialize(type, value, location); end
+
+ # Returns true if the given other token is equal to this token.
+ #
+ # source://prism//prism/parse_result.rb#454
+ def ==(other); end
+
+ # Implement the hash pattern matching interface for Token.
+ #
+ # source://prism//prism/parse_result.rb#434
+ def deconstruct_keys(keys); end
+
+ # A Location object representing the location of this token in the source.
+ #
+ # source://prism//prism/parse_result.rb#424
+ def location; end
+
+ # Implement the pretty print interface for Token.
+ #
+ # source://prism//prism/parse_result.rb#439
+ def pretty_print(q); end
+
+ # The type of token that this token is.
+ #
+ # source://prism//prism/parse_result.rb#418
+ def type; end
+
+ # A byteslice of the source that this token represents.
+ #
+ # source://prism//prism/parse_result.rb#421
+ def value; end
+end
+
+# Represents the use of the literal `true` keyword.
+#
+# true
+# ^^^^
+class Prism::TrueNode < ::Prism::Node
+ # def initialize: (location: Location) -> void
+ #
+ # @return [TrueNode] a new instance of TrueNode
+ #
+ # source://prism//prism/node.rb#16293
+ def initialize(location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16298
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16303
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16313
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16308
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> TrueNode
+ #
+ # source://prism//prism/node.rb#16318
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16303
+ 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#16328
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16333
+ 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//prism/node.rb#16352
+ 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#16362
+ def type; end
+ end
+end
+
+# Represents the use of the `undef` keyword.
+#
+# undef :foo, :bar, :baz
+# ^^^^^^^^^^^^^^^^^^^^^^
+class Prism::UndefNode < ::Prism::Node
+ # def initialize: (names: Array[Node], keyword_loc: Location, location: Location) -> void
+ #
+ # @return [UndefNode] a new instance of UndefNode
+ #
+ # source://prism//prism/node.rb#16379
+ def initialize(names, keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16386
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16391
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16401
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16396
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> UndefNode
+ #
+ # source://prism//prism/node.rb#16406
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16391
+ 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#16418
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16428
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16423
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16376
+ def keyword_loc; end
+
+ # attr_reader names: Array[Node]
+ #
+ # source://prism//prism/node.rb#16373
+ def names; 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//prism/node.rb#16449
+ 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#16459
+ def type; end
+ end
+end
+
+# Represents the use of the `unless` keyword, either in the block form or the modifier form.
+#
+# bar unless foo
+# ^^^^^^^^^^^^^^
+#
+# unless foo then bar end
+# ^^^^^^^^^^^^^^^^^^^^^^^
+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
+ #
+ # @return [UnlessNode] a new instance of UnlessNode
+ #
+ # source://prism//prism/node.rb#16491
+ def initialize(keyword_loc, predicate, then_keyword_loc, statements, consequent, end_keyword_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16502
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16511
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16525
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16516
+ def compact_child_nodes; end
+
+ # attr_reader consequent: ElseNode?
+ #
+ # source://prism//prism/node.rb#16485
+ def consequent; end
+
+ # def copy: (**params) -> UnlessNode
+ #
+ # source://prism//prism/node.rb#16530
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16511
+ 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#16546
+ def deconstruct_keys(keys); end
+
+ # def end_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#16561
+ def end_keyword; end
+
+ # attr_reader end_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#16488
+ def end_keyword_loc; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16566
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16551
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16473
+ def keyword_loc; end
+
+ # attr_reader predicate: Node
+ #
+ # source://prism//prism/node.rb#16476
+ def predicate; end
+
+ # source://prism//prism/node.rb#16506
+ def set_newline_flag(newline_marked); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#16482
+ def statements; end
+
+ # def then_keyword: () -> String?
+ #
+ # source://prism//prism/node.rb#16556
+ def then_keyword; end
+
+ # attr_reader then_keyword_loc: Location?
+ #
+ # source://prism//prism/node.rb#16479
+ def then_keyword_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # 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//prism/node.rb#16602
+ 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#16612
+ def type; end
+ end
+end
+
+# Represents the use of the `until` keyword, either in the block form or the modifier form.
+#
+# bar until foo
+# ^^^^^^^^^^^^^
+#
+# until foo do bar end
+# ^^^^^^^^^^^^^^^^^^^^
+class Prism::UntilNode < ::Prism::Node
+ # def initialize: (flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location) -> void
+ #
+ # @return [UntilNode] a new instance of UntilNode
+ #
+ # source://prism//prism/node.rb#16641
+ def initialize(flags, keyword_loc, closing_loc, predicate, statements, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16651
+ def accept(visitor); end
+
+ # def begin_modifier?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16698
+ def begin_modifier?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16660
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#16708
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#16632
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16673
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16665
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> UntilNode
+ #
+ # source://prism//prism/node.rb#16678
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16660
+ 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#16693
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16713
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16703
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16629
+ def keyword_loc; end
+
+ # attr_reader predicate: Node
+ #
+ # source://prism//prism/node.rb#16635
+ def predicate; end
+
+ # source://prism//prism/node.rb#16655
+ def set_newline_flag(newline_marked); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#16638
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#16744
+ def type; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#16626
+ 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#16754
+ def type; end
+ end
+end
+
+# 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
+# subset of the tree, while still walking the whole tree.
+#
+# For example, to find all of the method calls that call the `foo` method, you
+# could write:
+#
+# class FooCalls < Prism::Visitor
+# def visit_call_node(node)
+# if node.name == "foo"
+# # Do something with the node
+# end
+#
+# # Call super so that the visitor continues walking the tree
+# super
+# end
+# end
+class Prism::Visitor < ::Prism::BasicVisitor
+ # Visit a AliasGlobalVariableNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_alias_global_variable_node(node); end
+
+ # Visit a AliasMethodNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_alias_method_node(node); end
+
+ # Visit a AlternationPatternNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_alternation_pattern_node(node); end
+
+ # Visit a AndNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_and_node(node); end
+
+ # Visit a ArgumentsNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_arguments_node(node); end
+
+ # Visit a ArrayNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_array_node(node); end
+
+ # Visit a ArrayPatternNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_array_pattern_node(node); end
+
+ # Visit a AssocNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_assoc_node(node); end
+
+ # Visit a AssocSplatNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_assoc_splat_node(node); end
+
+ # Visit a BackReferenceReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_back_reference_read_node(node); end
+
+ # Visit a BeginNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_begin_node(node); end
+
+ # Visit a BlockArgumentNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_block_argument_node(node); end
+
+ # Visit a BlockLocalVariableNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_block_local_variable_node(node); end
+
+ # Visit a BlockNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_block_node(node); end
+
+ # Visit a BlockParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_block_parameter_node(node); end
+
+ # Visit a BlockParametersNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_block_parameters_node(node); end
+
+ # Visit a BreakNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_break_node(node); end
+
+ # Visit a CallAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_call_and_write_node(node); end
+
+ # Visit a CallNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_call_node(node); end
+
+ # Visit a CallOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_call_operator_write_node(node); end
+
+ # Visit a CallOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_call_or_write_node(node); end
+
+ # Visit a CallTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_call_target_node(node); end
+
+ # Visit a CapturePatternNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_capture_pattern_node(node); end
+
+ # Visit a CaseMatchNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_case_match_node(node); end
+
+ # Visit a CaseNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_case_node(node); end
+
+ # Visit a ClassNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_node(node); end
+
+ # Visit a ClassVariableAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_and_write_node(node); end
+
+ # Visit a ClassVariableOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_operator_write_node(node); end
+
+ # Visit a ClassVariableOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_or_write_node(node); end
+
+ # Visit a ClassVariableReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_read_node(node); end
+
+ # Visit a ClassVariableTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_target_node(node); end
+
+ # Visit a ClassVariableWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_class_variable_write_node(node); end
+
+ # Visit a ConstantAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_and_write_node(node); end
+
+ # Visit a ConstantOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_operator_write_node(node); end
+
+ # Visit a ConstantOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_or_write_node(node); end
+
+ # Visit a ConstantPathAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_and_write_node(node); end
+
+ # Visit a ConstantPathNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_node(node); end
+
+ # Visit a ConstantPathOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_operator_write_node(node); end
+
+ # Visit a ConstantPathOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_or_write_node(node); end
+
+ # Visit a ConstantPathTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_target_node(node); end
+
+ # Visit a ConstantPathWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_path_write_node(node); end
+
+ # Visit a ConstantReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_read_node(node); end
+
+ # Visit a ConstantTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_target_node(node); end
+
+ # Visit a ConstantWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_constant_write_node(node); end
+
+ # Visit a DefNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_def_node(node); end
+
+ # Visit a DefinedNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_defined_node(node); end
+
+ # Visit a ElseNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_else_node(node); end
+
+ # Visit a EmbeddedStatementsNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_embedded_statements_node(node); end
+
+ # Visit a EmbeddedVariableNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_embedded_variable_node(node); end
+
+ # Visit a EnsureNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_ensure_node(node); end
+
+ # Visit a FalseNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_false_node(node); end
+
+ # Visit a FindPatternNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_find_pattern_node(node); end
+
+ # Visit a FlipFlopNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_flip_flop_node(node); end
+
+ # Visit a FloatNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_float_node(node); end
+
+ # Visit a ForNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_for_node(node); end
+
+ # Visit a ForwardingArgumentsNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_forwarding_arguments_node(node); end
+
+ # Visit a ForwardingParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_forwarding_parameter_node(node); end
+
+ # Visit a ForwardingSuperNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_forwarding_super_node(node); end
+
+ # Visit a GlobalVariableAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_and_write_node(node); end
+
+ # Visit a GlobalVariableOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_operator_write_node(node); end
+
+ # Visit a GlobalVariableOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_or_write_node(node); end
+
+ # Visit a GlobalVariableReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_read_node(node); end
+
+ # Visit a GlobalVariableTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_target_node(node); end
+
+ # Visit a GlobalVariableWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_global_variable_write_node(node); end
+
+ # Visit a HashNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_hash_node(node); end
+
+ # Visit a HashPatternNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_hash_pattern_node(node); end
+
+ # Visit a IfNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_if_node(node); end
+
+ # Visit a ImaginaryNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_imaginary_node(node); end
+
+ # Visit a ImplicitNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_implicit_node(node); end
+
+ # Visit a ImplicitRestNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_implicit_rest_node(node); end
+
+ # Visit a InNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_in_node(node); end
+
+ # Visit a IndexAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_index_and_write_node(node); end
+
+ # Visit a IndexOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_index_operator_write_node(node); end
+
+ # Visit a IndexOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_index_or_write_node(node); end
+
+ # Visit a IndexTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_index_target_node(node); end
+
+ # Visit a InstanceVariableAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_and_write_node(node); end
+
+ # Visit a InstanceVariableOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_operator_write_node(node); end
+
+ # Visit a InstanceVariableOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_or_write_node(node); end
+
+ # Visit a InstanceVariableReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_read_node(node); end
+
+ # Visit a InstanceVariableTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_target_node(node); end
+
+ # Visit a InstanceVariableWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_instance_variable_write_node(node); end
+
+ # Visit a IntegerNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_integer_node(node); end
+
+ # Visit a InterpolatedMatchLastLineNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_interpolated_match_last_line_node(node); end
+
+ # Visit a InterpolatedRegularExpressionNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_interpolated_regular_expression_node(node); end
+
+ # Visit a InterpolatedStringNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_interpolated_string_node(node); end
+
+ # Visit a InterpolatedSymbolNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_interpolated_symbol_node(node); end
+
+ # Visit a InterpolatedXStringNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_interpolated_x_string_node(node); end
+
+ # Visit a KeywordHashNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_keyword_hash_node(node); end
+
+ # Visit a KeywordRestParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_keyword_rest_parameter_node(node); end
+
+ # Visit a LambdaNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_lambda_node(node); end
+
+ # Visit a LocalVariableAndWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_and_write_node(node); end
+
+ # Visit a LocalVariableOperatorWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_operator_write_node(node); end
+
+ # Visit a LocalVariableOrWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_or_write_node(node); end
+
+ # Visit a LocalVariableReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_read_node(node); end
+
+ # Visit a LocalVariableTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_target_node(node); end
+
+ # Visit a LocalVariableWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_local_variable_write_node(node); end
+
+ # Visit a MatchLastLineNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_match_last_line_node(node); end
+
+ # Visit a MatchPredicateNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_match_predicate_node(node); end
+
+ # Visit a MatchRequiredNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_match_required_node(node); end
+
+ # Visit a MatchWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_match_write_node(node); end
+
+ # Visit a MissingNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_missing_node(node); end
+
+ # Visit a ModuleNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_module_node(node); end
+
+ # Visit a MultiTargetNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_multi_target_node(node); end
+
+ # Visit a MultiWriteNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_multi_write_node(node); end
+
+ # Visit a NextNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_next_node(node); end
+
+ # Visit a NilNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_nil_node(node); end
+
+ # Visit a NoKeywordsParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_no_keywords_parameter_node(node); end
+
+ # Visit a NumberedParametersNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_numbered_parameters_node(node); end
+
+ # Visit a NumberedReferenceReadNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_numbered_reference_read_node(node); end
+
+ # Visit a OptionalKeywordParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_optional_keyword_parameter_node(node); end
+
+ # Visit a OptionalParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_optional_parameter_node(node); end
+
+ # Visit a OrNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_or_node(node); end
+
+ # Visit a ParametersNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_parameters_node(node); end
+
+ # Visit a ParenthesesNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_parentheses_node(node); end
+
+ # Visit a PinnedExpressionNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_pinned_expression_node(node); end
+
+ # Visit a PinnedVariableNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_pinned_variable_node(node); end
+
+ # Visit a PostExecutionNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_post_execution_node(node); end
+
+ # Visit a PreExecutionNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_pre_execution_node(node); end
+
+ # Visit a ProgramNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_program_node(node); end
+
+ # Visit a RangeNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_range_node(node); end
+
+ # Visit a RationalNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_rational_node(node); end
+
+ # Visit a RedoNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_redo_node(node); end
+
+ # Visit a RegularExpressionNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_regular_expression_node(node); end
+
+ # Visit a RequiredKeywordParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_required_keyword_parameter_node(node); end
+
+ # Visit a RequiredParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_required_parameter_node(node); end
+
+ # Visit a RescueModifierNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_rescue_modifier_node(node); end
+
+ # Visit a RescueNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_rescue_node(node); end
+
+ # Visit a RestParameterNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_rest_parameter_node(node); end
+
+ # Visit a RetryNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_retry_node(node); end
+
+ # Visit a ReturnNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_return_node(node); end
+
+ # Visit a SelfNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_self_node(node); end
+
+ # Visit a SingletonClassNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_singleton_class_node(node); end
+
+ # Visit a SourceEncodingNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_source_encoding_node(node); end
+
+ # Visit a SourceFileNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_source_file_node(node); end
+
+ # Visit a SourceLineNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_source_line_node(node); end
+
+ # Visit a SplatNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_splat_node(node); end
+
+ # Visit a StatementsNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_statements_node(node); end
+
+ # Visit a StringNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_string_node(node); end
+
+ # Visit a SuperNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_super_node(node); end
+
+ # Visit a SymbolNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_symbol_node(node); end
+
+ # Visit a TrueNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_true_node(node); end
+
+ # Visit a UndefNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_undef_node(node); end
+
+ # Visit a UnlessNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_unless_node(node); end
+
+ # Visit a UntilNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_until_node(node); end
+
+ # Visit a WhenNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_when_node(node); end
+
+ # Visit a WhileNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_while_node(node); end
+
+ # Visit a XStringNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_x_string_node(node); end
+
+ # Visit a YieldNode node
+ #
+ # source://prism//prism/visitor.rb#26
+ def visit_yield_node(node); end
+end
+
+# Represents the use of the `when` keyword within a case statement.
+#
+# case true
+# when true
+# ^^^^^^^^^
+# end
+class Prism::WhenNode < ::Prism::Node
+ # def initialize: (keyword_loc: Location, conditions: Array[Node], statements: StatementsNode?, location: Location) -> void
+ #
+ # @return [WhenNode] a new instance of WhenNode
+ #
+ # source://prism//prism/node.rb#16776
+ def initialize(keyword_loc, conditions, statements, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16784
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16789
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16802
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16794
+ def compact_child_nodes; end
+
+ # attr_reader conditions: Array[Node]
+ #
+ # source://prism//prism/node.rb#16770
+ def conditions; end
+
+ # def copy: (**params) -> WhenNode
+ #
+ # source://prism//prism/node.rb#16807
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16789
+ 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#16820
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16830
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16825
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16767
+ def keyword_loc; end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#16773
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#16857
+ 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#16867
+ def type; end
+ end
+end
+
+# Represents the use of the `while` keyword, either in the block form or the modifier form.
+#
+# bar while foo
+# ^^^^^^^^^^^^^
+#
+# while foo do bar end
+# ^^^^^^^^^^^^^^^^^^^^
+class Prism::WhileNode < ::Prism::Node
+ # def initialize: (flags: Integer, keyword_loc: Location, closing_loc: Location?, predicate: Node, statements: StatementsNode?, location: Location) -> void
+ #
+ # @return [WhileNode] a new instance of WhileNode
+ #
+ # source://prism//prism/node.rb#16896
+ def initialize(flags, keyword_loc, closing_loc, predicate, statements, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#16906
+ def accept(visitor); end
+
+ # def begin_modifier?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#16953
+ def begin_modifier?; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16915
+ def child_nodes; end
+
+ # def closing: () -> String?
+ #
+ # source://prism//prism/node.rb#16963
+ def closing; end
+
+ # attr_reader closing_loc: Location?
+ #
+ # source://prism//prism/node.rb#16887
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#16928
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#16920
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> WhileNode
+ #
+ # source://prism//prism/node.rb#16933
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#16915
+ 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#16948
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#16968
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#16958
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#16884
+ def keyword_loc; end
+
+ # attr_reader predicate: Node
+ #
+ # source://prism//prism/node.rb#16890
+ def predicate; end
+
+ # source://prism//prism/node.rb#16910
+ def set_newline_flag(newline_marked); end
+
+ # attr_reader statements: StatementsNode?
+ #
+ # source://prism//prism/node.rb#16893
+ def statements; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#16999
+ def type; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#16881
+ 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#17009
+ def type; end
+ end
+end
+
+# Represents an xstring literal with no interpolation.
+#
+# `foo`
+# ^^^^^
+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
+ #
+ # @return [XStringNode] a new instance of XStringNode
+ #
+ # source://prism//prism/node.rb#17035
+ def initialize(flags, opening_loc, content_loc, closing_loc, unescaped, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#17045
+ def accept(visitor); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#17050
+ def child_nodes; end
+
+ # def closing: () -> String
+ #
+ # source://prism//prism/node.rb#17105
+ def closing; end
+
+ # attr_reader closing_loc: Location
+ #
+ # source://prism//prism/node.rb#17029
+ def closing_loc; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#17060
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#17055
+ def compact_child_nodes; end
+
+ # def content: () -> String
+ #
+ # source://prism//prism/node.rb#17100
+ def content; end
+
+ # attr_reader content_loc: Location
+ #
+ # source://prism//prism/node.rb#17026
+ def content_loc; end
+
+ # def copy: (**params) -> XStringNode
+ #
+ # source://prism//prism/node.rb#17065
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#17050
+ 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#17080
+ def deconstruct_keys(keys); end
+
+ # def forced_binary_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#17090
+ def forced_binary_encoding?; end
+
+ # def forced_utf8_encoding?: () -> bool
+ #
+ # @return [Boolean]
+ #
+ # source://prism//prism/node.rb#17085
+ def forced_utf8_encoding?; end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#17110
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def opening: () -> String
+ #
+ # source://prism//prism/node.rb#17095
+ def opening; end
+
+ # attr_reader opening_loc: Location
+ #
+ # source://prism//prism/node.rb#17023
+ def opening_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # 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//prism/node.rb#17135
+ def type; end
+
+ # attr_reader unescaped: String
+ #
+ # source://prism//prism/node.rb#17032
+ def unescaped; end
+
+ private
+
+ # Returns the value of attribute flags.
+ #
+ # source://prism//prism/node.rb#17020
+ 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#17145
+ def type; end
+ end
+end
+
+# Represents the use of the `yield` keyword.
+#
+# yield 1
+# ^^^^^^^
+class Prism::YieldNode < ::Prism::Node
+ # def initialize: (keyword_loc: Location, lparen_loc: Location?, arguments: ArgumentsNode?, rparen_loc: Location?, location: Location) -> void
+ #
+ # @return [YieldNode] a new instance of YieldNode
+ #
+ # source://prism//prism/node.rb#17168
+ def initialize(keyword_loc, lparen_loc, arguments, rparen_loc, location); end
+
+ # def accept: (visitor: Visitor) -> void
+ #
+ # source://prism//prism/node.rb#17177
+ def accept(visitor); end
+
+ # attr_reader arguments: ArgumentsNode?
+ #
+ # source://prism//prism/node.rb#17162
+ def arguments; end
+
+ # def child_nodes: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#17182
+ def child_nodes; end
+
+ # def comment_targets: () -> Array[Node | Location]
+ #
+ # source://prism//prism/node.rb#17194
+ def comment_targets; end
+
+ # def compact_child_nodes: () -> Array[Node]
+ #
+ # source://prism//prism/node.rb#17187
+ def compact_child_nodes; end
+
+ # def copy: (**params) -> YieldNode
+ #
+ # source://prism//prism/node.rb#17199
+ def copy(**params); end
+
+ # def child_nodes: () -> Array[nil | Node]
+ # def deconstruct: () -> Array[nil | Node]
+ #
+ # source://prism//prism/node.rb#17182
+ 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#17213
+ def deconstruct_keys(keys); end
+
+ # def inspect(inspector: NodeInspector) -> String
+ #
+ # source://prism//prism/node.rb#17233
+ def inspect(inspector = T.unsafe(nil)); end
+
+ # def keyword: () -> String
+ #
+ # source://prism//prism/node.rb#17218
+ def keyword; end
+
+ # attr_reader keyword_loc: Location
+ #
+ # source://prism//prism/node.rb#17156
+ def keyword_loc; end
+
+ # def lparen: () -> String?
+ #
+ # source://prism//prism/node.rb#17223
+ def lparen; end
+
+ # attr_reader lparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#17159
+ def lparen_loc; end
+
+ # def rparen: () -> String?
+ #
+ # source://prism//prism/node.rb#17228
+ def rparen; end
+
+ # attr_reader rparen_loc: Location?
+ #
+ # source://prism//prism/node.rb#17165
+ def rparen_loc; end
+
+ # Sometimes you want to check an instance of a node against a list of
+ # classes to see what kind of behavior to perform. Usually this is done by
+ # calling `[cls1, cls2].include?(node.class)` or putting the node into a
+ # case statement and doing `case node; when cls1; when cls2; end`. Both of
+ # these approaches are relatively slow because of the constant lookups,
+ # method calls, and/or array allocations.
+ #
+ # Instead, you can call #type, which will return to you a symbol that you
+ # can use for comparison. This is faster than the other approaches because
+ # it uses a single integer comparison, but also because if you're on CRuby
+ # you can take advantage of the fact that case statements with all symbol
+ # keys will use a jump table.
+ #
+ # def type: () -> Symbol
+ #
+ # source://prism//prism/node.rb#17261
+ 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#17271
+ def type; end
+ end
+end
diff --git a/sorbet/rbi/gems/psych@5.1.2.rbi b/sorbet/rbi/gems/psych@5.1.2.rbi
new file mode 100644
index 0000000..b3dda12
--- /dev/null
+++ b/sorbet/rbi/gems/psych@5.1.2.rbi
@@ -0,0 +1,1731 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `psych` gem.
+# Please instead update this file by running `bin/tapioca gem psych`.
+
+class Object < ::BasicObject
+ include ::Kernel
+ include ::PP::ObjectMixin
+
+ # call-seq: to_yaml(options = {})
+ #
+ # Convert an object to YAML. See Psych.dump for more information on the
+ # available +options+.
+ #
+ # source://psych//psych/core_ext.rb#12
+ def to_yaml(options = T.unsafe(nil)); end
+
+ class << self
+ # source://psych//psych/core_ext.rb#3
+ def yaml_tag(url); end
+ end
+end
+
+# = Overview
+#
+# Psych is a YAML parser and emitter.
+# Psych leverages libyaml [Home page: https://pyyaml.org/wiki/LibYAML]
+# or [git repo: https://github.com/yaml/libyaml] for its YAML parsing
+# and emitting capabilities. In addition to wrapping libyaml, Psych also
+# knows how to serialize and de-serialize most Ruby objects to and from
+# the YAML format.
+#
+# = I NEED TO PARSE OR EMIT YAML RIGHT NOW!
+#
+# # Parse some YAML
+# Psych.load("--- foo") # => "foo"
+#
+# # Emit some YAML
+# Psych.dump("foo") # => "--- foo\n...\n"
+# { :a => 'b'}.to_yaml # => "---\n:a: b\n"
+#
+# Got more time on your hands? Keep on reading!
+#
+# == YAML Parsing
+#
+# Psych provides a range of interfaces for parsing a YAML document ranging from
+# low level to high level, depending on your parsing needs. At the lowest
+# level, is an event based parser. Mid level is access to the raw YAML AST,
+# and at the highest level is the ability to unmarshal YAML to Ruby objects.
+#
+# == YAML Emitting
+#
+# Psych provides a range of interfaces ranging from low to high level for
+# producing YAML documents. Very similar to the YAML parsing interfaces, Psych
+# provides at the lowest level, an event based system, mid-level is building
+# a YAML AST, and the highest level is converting a Ruby object straight to
+# a YAML document.
+#
+# == High-level API
+#
+# === Parsing
+#
+# The high level YAML parser provided by Psych simply takes YAML as input and
+# returns a Ruby data structure. For information on using the high level parser
+# see Psych.load
+#
+# ==== Reading from a string
+#
+# Psych.safe_load("--- a") # => 'a'
+# Psych.safe_load("---\n - a\n - b") # => ['a', 'b']
+# # From a trusted string:
+# Psych.load("--- !ruby/range\nbegin: 0\nend: 42\nexcl: false\n") # => 0..42
+#
+# ==== Reading from a file
+#
+# Psych.safe_load_file("data.yml", permitted_classes: [Date])
+# Psych.load_file("trusted_database.yml")
+#
+# ==== Exception handling
+#
+# begin
+# # The second argument changes only the exception contents
+# Psych.parse("--- `", "file.txt")
+# rescue Psych::SyntaxError => ex
+# ex.file # => 'file.txt'
+# ex.message # => "(file.txt): found character that cannot start any token"
+# end
+#
+# === Emitting
+#
+# The high level emitter has the easiest interface. Psych simply takes a Ruby
+# data structure and converts it to a YAML document. See Psych.dump for more
+# information on dumping a Ruby data structure.
+#
+# ==== Writing to a string
+#
+# # Dump an array, get back a YAML string
+# Psych.dump(['a', 'b']) # => "---\n- a\n- b\n"
+#
+# # Dump an array to an IO object
+# Psych.dump(['a', 'b'], StringIO.new) # => #
+#
+# # Dump an array with indentation set
+# Psych.dump(['a', ['b']], :indentation => 3) # => "---\n- a\n- - b\n"
+#
+# # Dump an array to an IO with indentation set
+# Psych.dump(['a', ['b']], StringIO.new, :indentation => 3)
+#
+# ==== Writing to a file
+#
+# Currently there is no direct API for dumping Ruby structure to file:
+#
+# File.open('database.yml', 'w') do |file|
+# file.write(Psych.dump(['a', 'b']))
+# end
+#
+# == Mid-level API
+#
+# === Parsing
+#
+# Psych provides access to an AST produced from parsing a YAML document. This
+# tree is built using the Psych::Parser and Psych::TreeBuilder. The AST can
+# be examined and manipulated freely. Please see Psych::parse_stream,
+# Psych::Nodes, and Psych::Nodes::Node for more information on dealing with
+# YAML syntax trees.
+#
+# ==== Reading from a string
+#
+# # Returns Psych::Nodes::Stream
+# Psych.parse_stream("---\n - a\n - b")
+#
+# # Returns Psych::Nodes::Document
+# Psych.parse("---\n - a\n - b")
+#
+# ==== Reading from a file
+#
+# # Returns Psych::Nodes::Stream
+# Psych.parse_stream(File.read('database.yml'))
+#
+# # Returns Psych::Nodes::Document
+# Psych.parse_file('database.yml')
+#
+# ==== Exception handling
+#
+# begin
+# # The second argument changes only the exception contents
+# Psych.parse("--- `", "file.txt")
+# rescue Psych::SyntaxError => ex
+# ex.file # => 'file.txt'
+# ex.message # => "(file.txt): found character that cannot start any token"
+# end
+#
+# === Emitting
+#
+# At the mid level is building an AST. This AST is exactly the same as the AST
+# used when parsing a YAML document. Users can build an AST by hand and the
+# AST knows how to emit itself as a YAML document. See Psych::Nodes,
+# Psych::Nodes::Node, and Psych::TreeBuilder for more information on building
+# a YAML AST.
+#
+# ==== Writing to a string
+#
+# # We need Psych::Nodes::Stream (not Psych::Nodes::Document)
+# stream = Psych.parse_stream("---\n - a\n - b")
+#
+# stream.to_yaml # => "---\n- a\n- b\n"
+#
+# ==== Writing to a file
+#
+# # We need Psych::Nodes::Stream (not Psych::Nodes::Document)
+# stream = Psych.parse_stream(File.read('database.yml'))
+#
+# File.open('database.yml', 'w') do |file|
+# file.write(stream.to_yaml)
+# end
+#
+# == Low-level API
+#
+# === Parsing
+#
+# The lowest level parser should be used when the YAML input is already known,
+# and the developer does not want to pay the price of building an AST or
+# automatic detection and conversion to Ruby objects. See Psych::Parser for
+# more information on using the event based parser.
+#
+# ==== Reading to Psych::Nodes::Stream structure
+#
+# parser = Psych::Parser.new(TreeBuilder.new) # => #
+# parser = Psych.parser # it's an alias for the above
+#
+# parser.parse("---\n - a\n - b") # => #
+# parser.handler # => #
+# parser.handler.root # => #
+#
+# ==== Receiving an events stream
+#
+# recorder = Psych::Handlers::Recorder.new
+# parser = Psych::Parser.new(recorder)
+#
+# parser.parse("---\n - a\n - b")
+# recorder.events # => [list of [event, args] lists]
+# # event is one of: Psych::Handler::EVENTS
+# # args are the arguments passed to the event
+#
+# === Emitting
+#
+# The lowest level emitter is an event based system. Events are sent to a
+# Psych::Emitter object. That object knows how to convert the events to a YAML
+# document. This interface should be used when document format is known in
+# advance or speed is a concern. See Psych::Emitter for more information.
+#
+# ==== Writing to a Ruby structure
+#
+# Psych.parser.parse("--- a") # => #
+#
+# parser.handler.first # => #
+# parser.handler.first.to_ruby # => ["a"]
+#
+# parser.handler.root.first # => #
+# parser.handler.root.first.to_ruby # => "a"
+#
+# # You can instantiate an Emitter manually
+# Psych::Visitors::ToRuby.new.accept(parser.handler.root.first)
+# # => "a"
+module Psych
+ class << self
+ # source://psych//psych.rb#682
+ def add_builtin_type(type_tag, &block); end
+
+ # :stopdoc:
+ #
+ # source://psych//psych.rb#676
+ def add_domain_type(domain, type_tag, &block); end
+
+ # source://psych//psych.rb#692
+ def add_tag(tag, klass); end
+
+ # source://psych//psych.rb#708
+ def config; end
+
+ # source://psych//psych.rb#720
+ def domain_types; end
+
+ # source://psych//psych.rb#732
+ def domain_types=(value); end
+
+ # call-seq:
+ # Psych.dump(o) -> string of yaml
+ # Psych.dump(o, options) -> string of yaml
+ # Psych.dump(o, io) -> io object passed in
+ # Psych.dump(o, io, options) -> io object passed in
+ #
+ # Dump Ruby object +o+ to a YAML string. Optional +options+ may be passed in
+ # to control the output format. If an IO object is passed in, the YAML will
+ # be dumped to that IO object.
+ #
+ # Currently supported options are:
+ #
+ # [:indentation] Number of space characters used to indent.
+ # Acceptable value should be in 0..9 range,
+ # otherwise option is ignored.
+ #
+ # Default: 2.
+ # [:line_width] Max character to wrap line at.
+ #
+ # Default: 0 (meaning "wrap at 81").
+ # [:canonical] Write "canonical" YAML form (very verbose, yet
+ # strictly formal).
+ #
+ # Default: false.
+ # [:header] Write %YAML [version] at the beginning of document.
+ #
+ # Default: false.
+ #
+ # Example:
+ #
+ # # Dump an array, get back a YAML string
+ # Psych.dump(['a', 'b']) # => "---\n- a\n- b\n"
+ #
+ # # Dump an array to an IO object
+ # Psych.dump(['a', 'b'], StringIO.new) # => #
+ #
+ # # Dump an array with indentation set
+ # Psych.dump(['a', ['b']], indentation: 3) # => "---\n- a\n- - b\n"
+ #
+ # # Dump an array to an IO with indentation set
+ # Psych.dump(['a', ['b']], StringIO.new, indentation: 3)
+ #
+ # source://psych//psych.rb#505
+ def dump(o, io = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # Dump a list of objects as separate documents to a document stream.
+ #
+ # Example:
+ #
+ # Psych.dump_stream("foo\n ", {}) # => "--- ! \"foo\\n \"\n--- {}\n"
+ #
+ # source://psych//psych.rb#595
+ def dump_stream(*objects); end
+
+ # source://psych//psych.rb#716
+ def dump_tags; end
+
+ # source://psych//psych.rb#728
+ def dump_tags=(value); end
+
+ # Load +yaml+ in to a Ruby data structure. If multiple documents are
+ # provided, the object contained in the first document will be returned.
+ # +filename+ will be used in the exception message if any exception
+ # is raised while parsing. If +yaml+ is empty, it returns
+ # the specified +fallback+ return value, which defaults to +false+.
+ #
+ # Raises a Psych::SyntaxError when a YAML syntax error is detected.
+ #
+ # Example:
+ #
+ # Psych.load("--- a") # => 'a'
+ # Psych.load("---\n - a\n - b") # => ['a', 'b']
+ #
+ # begin
+ # Psych.load("--- `", filename: "file.txt")
+ # rescue Psych::SyntaxError => ex
+ # ex.file # => 'file.txt'
+ # ex.message # => "(file.txt): found character that cannot start any token"
+ # end
+ #
+ # When the optional +symbolize_names+ keyword argument is set to a
+ # true value, returns symbols for keys in Hash objects (default: strings).
+ #
+ # Psych.load("---\n foo: bar") # => {"foo"=>"bar"}
+ # Psych.load("---\n foo: bar", symbolize_names: true) # => {:foo=>"bar"}
+ #
+ # Raises a TypeError when `yaml` parameter is NilClass. This method is
+ # similar to `safe_load` except that `Symbol` objects are allowed by default.
+ #
+ # source://psych//psych.rb#368
+ def load(yaml, permitted_classes: T.unsafe(nil), permitted_symbols: T.unsafe(nil), aliases: T.unsafe(nil), filename: T.unsafe(nil), fallback: T.unsafe(nil), symbolize_names: T.unsafe(nil), freeze: T.unsafe(nil), strict_integer: T.unsafe(nil)); end
+
+ # Loads the document contained in +filename+. Returns the yaml contained in
+ # +filename+ as a Ruby object, or if the file is empty, it returns
+ # the specified +fallback+ return value, which defaults to +false+.
+ # See load for options.
+ #
+ # source://psych//psych.rb#669
+ def load_file(filename, **kwargs); end
+
+ # Load multiple documents given in +yaml+. Returns the parsed documents
+ # as a list. If a block is given, each document will be converted to Ruby
+ # and passed to the block during parsing
+ #
+ # Example:
+ #
+ # Psych.load_stream("--- foo\n...\n--- bar\n...") # => ['foo', 'bar']
+ #
+ # list = []
+ # Psych.load_stream("--- foo\n...\n--- bar\n...") do |ruby|
+ # list << ruby
+ # end
+ # list # => ['foo', 'bar']
+ #
+ # source://psych//psych.rb#626
+ def load_stream(yaml, filename: T.unsafe(nil), fallback: T.unsafe(nil), **kwargs); end
+
+ # source://psych//psych.rb#712
+ def load_tags; end
+
+ # source://psych//psych.rb#724
+ def load_tags=(value); end
+
+ # Parse a YAML string in +yaml+. Returns the Psych::Nodes::Document.
+ # +filename+ is used in the exception message if a Psych::SyntaxError is
+ # raised.
+ #
+ # Raises a Psych::SyntaxError when a YAML syntax error is detected.
+ #
+ # Example:
+ #
+ # Psych.parse("---\n - a\n - b") # => #
+ #
+ # begin
+ # Psych.parse("--- `", filename: "file.txt")
+ # rescue Psych::SyntaxError => ex
+ # ex.file # => 'file.txt'
+ # ex.message # => "(file.txt): found character that cannot start any token"
+ # end
+ #
+ # See Psych::Nodes for more information about YAML AST.
+ #
+ # source://psych//psych.rb#398
+ def parse(yaml, filename: T.unsafe(nil)); end
+
+ # Parse a file at +filename+. Returns the Psych::Nodes::Document.
+ #
+ # Raises a Psych::SyntaxError when a YAML syntax error is detected.
+ #
+ # source://psych//psych.rb#410
+ def parse_file(filename, fallback: T.unsafe(nil)); end
+
+ # Parse a YAML string in +yaml+. Returns the Psych::Nodes::Stream.
+ # This method can handle multiple YAML documents contained in +yaml+.
+ # +filename+ is used in the exception message if a Psych::SyntaxError is
+ # raised.
+ #
+ # If a block is given, a Psych::Nodes::Document node will be yielded to the
+ # block as it's being parsed.
+ #
+ # Raises a Psych::SyntaxError when a YAML syntax error is detected.
+ #
+ # Example:
+ #
+ # Psych.parse_stream("---\n - a\n - b") # => #
+ #
+ # Psych.parse_stream("--- a\n--- b") do |node|
+ # node # => #
+ # end
+ #
+ # begin
+ # Psych.parse_stream("--- `", filename: "file.txt")
+ # rescue Psych::SyntaxError => ex
+ # ex.file # => 'file.txt'
+ # ex.message # => "(file.txt): found character that cannot start any token"
+ # end
+ #
+ # Raises a TypeError when NilClass is passed.
+ #
+ # See Psych::Nodes for more information about YAML AST.
+ #
+ # source://psych//psych.rb#452
+ def parse_stream(yaml, filename: T.unsafe(nil), &block); end
+
+ # Returns a default parser
+ #
+ # source://psych//psych.rb#419
+ def parser; end
+
+ # source://psych//psych.rb#688
+ def remove_type(type_tag); end
+
+ # call-seq:
+ # Psych.safe_dump(o) -> string of yaml
+ # Psych.safe_dump(o, options) -> string of yaml
+ # Psych.safe_dump(o, io) -> io object passed in
+ # Psych.safe_dump(o, io, options) -> io object passed in
+ #
+ # Safely dump Ruby object +o+ to a YAML string. Optional +options+ may be passed in
+ # to control the output format. If an IO object is passed in, the YAML will
+ # be dumped to that IO object. By default, only the following
+ # classes are allowed to be serialized:
+ #
+ # * TrueClass
+ # * FalseClass
+ # * NilClass
+ # * Integer
+ # * Float
+ # * String
+ # * Array
+ # * Hash
+ #
+ # Arbitrary classes can be allowed by adding those classes to the +permitted_classes+
+ # keyword argument. They are additive. For example, to allow Date serialization:
+ #
+ # Psych.safe_dump(yaml, permitted_classes: [Date])
+ #
+ # Now the Date class can be dumped in addition to the classes listed above.
+ #
+ # A Psych::DisallowedClass exception will be raised if the object contains a
+ # class that isn't in the +permitted_classes+ list.
+ #
+ # Currently supported options are:
+ #
+ # [:indentation] Number of space characters used to indent.
+ # Acceptable value should be in 0..9 range,
+ # otherwise option is ignored.
+ #
+ # Default: 2.
+ # [:line_width] Max character to wrap line at.
+ #
+ # Default: 0 (meaning "wrap at 81").
+ # [:canonical] Write "canonical" YAML form (very verbose, yet
+ # strictly formal).
+ #
+ # Default: false.
+ # [:header] Write %YAML [version] at the beginning of document.
+ #
+ # Default: false.
+ #
+ # Example:
+ #
+ # # Dump an array, get back a YAML string
+ # Psych.safe_dump(['a', 'b']) # => "---\n- a\n- b\n"
+ #
+ # # Dump an array to an IO object
+ # Psych.safe_dump(['a', 'b'], StringIO.new) # => #
+ #
+ # # Dump an array with indentation set
+ # Psych.safe_dump(['a', ['b']], indentation: 3) # => "---\n- a\n- - b\n"
+ #
+ # # Dump an array to an IO with indentation set
+ # Psych.safe_dump(['a', ['b']], StringIO.new, indentation: 3)
+ #
+ # source://psych//psych.rb#578
+ def safe_dump(o, io = T.unsafe(nil), options = T.unsafe(nil)); end
+
+ # Safely load the yaml string in +yaml+. By default, only the following
+ # classes are allowed to be deserialized:
+ #
+ # * TrueClass
+ # * FalseClass
+ # * NilClass
+ # * Integer
+ # * Float
+ # * String
+ # * Array
+ # * Hash
+ #
+ # Recursive data structures are not allowed by default. Arbitrary classes
+ # can be allowed by adding those classes to the +permitted_classes+ keyword argument. They are
+ # additive. For example, to allow Date deserialization:
+ #
+ # Psych.safe_load(yaml, permitted_classes: [Date])
+ #
+ # Now the Date class can be loaded in addition to the classes listed above.
+ #
+ # Aliases can be explicitly allowed by changing the +aliases+ keyword argument.
+ # For example:
+ #
+ # x = []
+ # x << x
+ # yaml = Psych.dump x
+ # Psych.safe_load yaml # => raises an exception
+ # Psych.safe_load yaml, aliases: true # => loads the aliases
+ #
+ # A Psych::DisallowedClass exception will be raised if the yaml contains a
+ # class that isn't in the +permitted_classes+ list.
+ #
+ # A Psych::AliasesNotEnabled exception will be raised if the yaml contains aliases
+ # but the +aliases+ keyword argument is set to false.
+ #
+ # +filename+ will be used in the exception message if any exception is raised
+ # while parsing.
+ #
+ # When the optional +symbolize_names+ keyword argument is set to a
+ # true value, returns symbols for keys in Hash objects (default: strings).
+ #
+ # Psych.safe_load("---\n foo: bar") # => {"foo"=>"bar"}
+ # Psych.safe_load("---\n foo: bar", symbolize_names: true) # => {:foo=>"bar"}
+ #
+ # source://psych//psych.rb#322
+ def safe_load(yaml, permitted_classes: T.unsafe(nil), permitted_symbols: T.unsafe(nil), aliases: T.unsafe(nil), filename: T.unsafe(nil), fallback: T.unsafe(nil), symbolize_names: T.unsafe(nil), freeze: T.unsafe(nil), strict_integer: T.unsafe(nil)); end
+
+ # Safely loads the document contained in +filename+. Returns the yaml contained in
+ # +filename+ as a Ruby object, or if the file is empty, it returns
+ # the specified +fallback+ return value, which defaults to +false+.
+ # See safe_load for options.
+ #
+ # source://psych//psych.rb#658
+ def safe_load_file(filename, **kwargs); end
+
+ # Dump Ruby +object+ to a JSON string.
+ #
+ # source://psych//psych.rb#605
+ def to_json(object); end
+
+ # Load +yaml+ in to a Ruby data structure. If multiple documents are
+ # provided, the object contained in the first document will be returned.
+ # +filename+ will be used in the exception message if any exception
+ # is raised while parsing. If +yaml+ is empty, it returns
+ # the specified +fallback+ return value, which defaults to +false+.
+ #
+ # Raises a Psych::SyntaxError when a YAML syntax error is detected.
+ #
+ # Example:
+ #
+ # Psych.unsafe_load("--- a") # => 'a'
+ # Psych.unsafe_load("---\n - a\n - b") # => ['a', 'b']
+ #
+ # begin
+ # Psych.unsafe_load("--- `", filename: "file.txt")
+ # rescue Psych::SyntaxError => ex
+ # ex.file # => 'file.txt'
+ # ex.message # => "(file.txt): found character that cannot start any token"
+ # end
+ #
+ # When the optional +symbolize_names+ keyword argument is set to a
+ # true value, returns symbols for keys in Hash objects (default: strings).
+ #
+ # Psych.unsafe_load("---\n foo: bar") # => {"foo"=>"bar"}
+ # Psych.unsafe_load("---\n foo: bar", symbolize_names: true) # => {:foo=>"bar"}
+ #
+ # Raises a TypeError when `yaml` parameter is NilClass
+ #
+ # NOTE: This method *should not* be used to parse untrusted documents, such as
+ # YAML documents that are supplied via user input. Instead, please use the
+ # load method or the safe_load method.
+ #
+ # source://psych//psych.rb#271
+ def unsafe_load(yaml, filename: T.unsafe(nil), fallback: T.unsafe(nil), symbolize_names: T.unsafe(nil), freeze: T.unsafe(nil), strict_integer: T.unsafe(nil)); end
+
+ # Load the document contained in +filename+. Returns the yaml contained in
+ # +filename+ as a Ruby object, or if the file is empty, it returns
+ # the specified +fallback+ return value, which defaults to +false+.
+ #
+ # NOTE: This method *should not* be used to parse untrusted documents, such as
+ # YAML documents that are supplied via user input. Instead, please use the
+ # safe_load_file method.
+ #
+ # source://psych//psych.rb#647
+ def unsafe_load_file(filename, **kwargs); end
+ end
+end
+
+# Subclasses `BadAlias` for backwards compatibility
+class Psych::AliasesNotEnabled < ::Psych::BadAlias
+ # @return [AliasesNotEnabled] a new instance of AliasesNotEnabled
+ #
+ # source://psych//psych/exception.rb#11
+ def initialize; end
+end
+
+# Subclasses `BadAlias` for backwards compatibility
+class Psych::AnchorNotDefined < ::Psych::BadAlias
+ # @return [AnchorNotDefined] a new instance of AnchorNotDefined
+ #
+ # source://psych//psych/exception.rb#18
+ def initialize(anchor_name); end
+end
+
+class Psych::ClassLoader
+ # @return [ClassLoader] a new instance of ClassLoader
+ #
+ # source://psych//psych/class_loader.rb#21
+ def initialize; end
+
+ # source://psych//psych/class_loader.rb#39
+ def big_decimal; end
+
+ # source://psych//psych/class_loader.rb#39
+ def complex; end
+
+ # source://psych//psych/class_loader.rb#39
+ def date; end
+
+ # source://psych//psych/class_loader.rb#39
+ def date_time; end
+
+ # source://psych//psych/class_loader.rb#39
+ def exception; end
+
+ # source://psych//psych/class_loader.rb#25
+ def load(klassname); end
+
+ # source://psych//psych/class_loader.rb#39
+ def object; end
+
+ # source://psych//psych/class_loader.rb#39
+ def psych_omap; end
+
+ # source://psych//psych/class_loader.rb#39
+ def psych_set; end
+
+ # source://psych//psych/class_loader.rb#39
+ def range; end
+
+ # source://psych//psych/class_loader.rb#39
+ def rational; end
+
+ # source://psych//psych/class_loader.rb#39
+ def regexp; end
+
+ # source://psych//psych/class_loader.rb#39
+ def struct; end
+
+ # source://psych//psych/class_loader.rb#39
+ def symbol; end
+
+ # source://psych//psych/class_loader.rb#31
+ def symbolize(sym); end
+
+ private
+
+ # source://psych//psych/class_loader.rb#47
+ def find(klassname); end
+
+ # source://psych//psych/class_loader.rb#51
+ def resolve(klassname); end
+end
+
+class Psych::ClassLoader::Restricted < ::Psych::ClassLoader
+ # @return [Restricted] a new instance of Restricted
+ #
+ # source://psych//psych/class_loader.rb#77
+ def initialize(classes, symbols); end
+
+ # source://psych//psych/class_loader.rb#83
+ def symbolize(sym); end
+
+ private
+
+ # source://psych//psych/class_loader.rb#95
+ def find(klassname); end
+end
+
+# If an object defines +encode_with+, then an instance of Psych::Coder will
+# be passed to the method when the object is being serialized. The Coder
+# automatically assumes a Psych::Nodes::Mapping is being emitted. Other
+# objects like Sequence and Scalar may be emitted if +seq=+ or +scalar=+ are
+# called, respectively.
+class Psych::Coder
+ # @return [Coder] a new instance of Coder
+ #
+ # source://psych//psych/coder.rb#13
+ def initialize(tag); end
+
+ # source://psych//psych/coder.rb#84
+ def [](k); end
+
+ # source://psych//psych/coder.rb#78
+ def []=(k, v); end
+
+ # source://psych//psych/coder.rb#78
+ def add(k, v); end
+
+ # Returns the value of attribute implicit.
+ #
+ # source://psych//psych/coder.rb#10
+ def implicit; end
+
+ # Sets the attribute implicit
+ #
+ # @param value the value to set the attribute implicit to.
+ #
+ # source://psych//psych/coder.rb#10
+ def implicit=(_arg0); end
+
+ # Emit a map. The coder will be yielded to the block.
+ #
+ # @yield [_self]
+ # @yieldparam _self [Psych::Coder] the object that the method was called on
+ #
+ # source://psych//psych/coder.rb#34
+ def map(tag = T.unsafe(nil), style = T.unsafe(nil)); end
+
+ # Emit a map with +value+
+ #
+ # source://psych//psych/coder.rb#73
+ def map=(map); end
+
+ # Returns the value of attribute object.
+ #
+ # source://psych//psych/coder.rb#10
+ def object; end
+
+ # Sets the attribute object
+ #
+ # @param value the value to set the attribute object to.
+ #
+ # source://psych//psych/coder.rb#10
+ def object=(_arg0); end
+
+ # Emit a sequence with +map+ and +tag+
+ #
+ # source://psych//psych/coder.rb#54
+ def represent_map(tag, map); end
+
+ # Emit an arbitrary object +obj+ and +tag+
+ #
+ # source://psych//psych/coder.rb#60
+ def represent_object(tag, obj); end
+
+ # Emit a scalar with +value+ and +tag+
+ #
+ # source://psych//psych/coder.rb#42
+ def represent_scalar(tag, value); end
+
+ # Emit a sequence with +list+ and +tag+
+ #
+ # source://psych//psych/coder.rb#48
+ def represent_seq(tag, list); end
+
+ # source://psych//psych/coder.rb#24
+ def scalar(*args); end
+
+ # Emit a scalar with +value+
+ #
+ # source://psych//psych/coder.rb#67
+ def scalar=(value); end
+
+ # Returns the value of attribute seq.
+ #
+ # source://psych//psych/coder.rb#11
+ def seq; end
+
+ # Emit a sequence of +list+
+ #
+ # source://psych//psych/coder.rb#90
+ def seq=(list); end
+
+ # Returns the value of attribute style.
+ #
+ # source://psych//psych/coder.rb#10
+ def style; end
+
+ # Sets the attribute style
+ #
+ # @param value the value to set the attribute style to.
+ #
+ # source://psych//psych/coder.rb#10
+ def style=(_arg0); end
+
+ # Returns the value of attribute tag.
+ #
+ # source://psych//psych/coder.rb#10
+ def tag; end
+
+ # Sets the attribute tag
+ #
+ # @param value the value to set the attribute tag to.
+ #
+ # source://psych//psych/coder.rb#10
+ def tag=(_arg0); end
+
+ # Returns the value of attribute type.
+ #
+ # source://psych//psych/coder.rb#11
+ def type; end
+end
+
+class Psych::DisallowedClass < ::Psych::Exception
+ # @return [DisallowedClass] a new instance of DisallowedClass
+ #
+ # source://psych//psych/exception.rb#24
+ def initialize(action, klass_name); end
+end
+
+# Psych::Handler is an abstract base class that defines the events used
+# when dealing with Psych::Parser. Clients who want to use Psych::Parser
+# should implement a class that inherits from Psych::Handler and define
+# events that they can handle.
+#
+# Psych::Handler defines all events that Psych::Parser can possibly send to
+# event handlers.
+#
+# See Psych::Parser for more details
+class Psych::Handler
+ # Called when an alias is found to +anchor+. +anchor+ will be the name
+ # of the anchor found.
+ #
+ # === Example
+ #
+ # Here we have an example of an array that references itself in YAML:
+ #
+ # --- &ponies
+ # - first element
+ # - *ponies
+ #
+ # &ponies is the anchor, *ponies is the alias. In this case, alias is
+ # called with "ponies".
+ #
+ # source://psych//psych/handler.rb#110
+ def alias(anchor); end
+
+ # Called when an empty event happens. (Which, as far as I can tell, is
+ # never).
+ #
+ # source://psych//psych/handler.rb#236
+ def empty; end
+
+ # Called with the document ends. +implicit+ is a boolean value indicating
+ # whether or not the document has an implicit ending.
+ #
+ # === Example
+ #
+ # Given the following YAML:
+ #
+ # ---
+ # hello world
+ #
+ # +implicit+ will be true. Given this YAML:
+ #
+ # ---
+ # hello world
+ # ...
+ #
+ # +implicit+ will be false.
+ #
+ # source://psych//psych/handler.rb#93
+ def end_document(implicit); end
+
+ # Called when a map ends
+ #
+ # source://psych//psych/handler.rb#230
+ def end_mapping; end
+
+ # Called when a sequence ends.
+ #
+ # source://psych//psych/handler.rb#191
+ def end_sequence; end
+
+ # Called when the YAML stream ends
+ #
+ # source://psych//psych/handler.rb#241
+ def end_stream; end
+
+ # Called before each event with line/column information.
+ #
+ # source://psych//psych/handler.rb#246
+ def event_location(start_line, start_column, end_line, end_column); end
+
+ # Called when a scalar +value+ is found. The scalar may have an
+ # +anchor+, a +tag+, be implicitly +plain+ or implicitly +quoted+
+ #
+ # +value+ is the string value of the scalar
+ # +anchor+ is an associated anchor or nil
+ # +tag+ is an associated tag or nil
+ # +plain+ is a boolean value
+ # +quoted+ is a boolean value
+ # +style+ is an integer indicating the string style
+ #
+ # See the constants in Psych::Nodes::Scalar for the possible values of
+ # +style+
+ #
+ # === Example
+ #
+ # Here is a YAML document that exercises most of the possible ways this
+ # method can be called:
+ #
+ # ---
+ # - !str "foo"
+ # - &anchor fun
+ # - many
+ # lines
+ # - |
+ # many
+ # newlines
+ #
+ # The above YAML document contains a list with four strings. Here are
+ # the parameters sent to this method in the same order:
+ #
+ # # value anchor tag plain quoted style
+ # ["foo", nil, "!str", false, false, 3 ]
+ # ["fun", "anchor", nil, true, false, 1 ]
+ # ["many lines", nil, nil, true, false, 1 ]
+ # ["many\nnewlines\n", nil, nil, false, true, 4 ]
+ #
+ # source://psych//psych/handler.rb#150
+ def scalar(value, anchor, tag, plain, quoted, style); end
+
+ # Called when the document starts with the declared +version+,
+ # +tag_directives+, if the document is +implicit+.
+ #
+ # +version+ will be an array of integers indicating the YAML version being
+ # dealt with, +tag_directives+ is a list of tuples indicating the prefix
+ # and suffix of each tag, and +implicit+ is a boolean indicating whether
+ # the document is started implicitly.
+ #
+ # === Example
+ #
+ # Given the following YAML:
+ #
+ # %YAML 1.1
+ # %TAG ! tag:tenderlovemaking.com,2009:
+ # --- !squee
+ #
+ # The parameters for start_document must be this:
+ #
+ # version # => [1, 1]
+ # tag_directives # => [["!", "tag:tenderlovemaking.com,2009:"]]
+ # implicit # => false
+ #
+ # source://psych//psych/handler.rb#72
+ def start_document(version, tag_directives, implicit); end
+
+ # Called when a map starts.
+ #
+ # +anchor+ is the anchor associated with the map or +nil+.
+ # +tag+ is the tag associated with the map or +nil+.
+ # +implicit+ is a boolean indicating whether or not the map was implicitly
+ # started.
+ # +style+ is an integer indicating the mapping style.
+ #
+ # See the constants in Psych::Nodes::Mapping for the possible values of
+ # +style+.
+ #
+ # === Example
+ #
+ # Here is a YAML document that exercises most of the possible ways this
+ # method can be called:
+ #
+ # ---
+ # k: !!map { hello: world }
+ # v: &pewpew
+ # hello: world
+ #
+ # The above YAML document consists of three maps, an outer map that contains
+ # two inner maps. Below is a matrix of the parameters sent in order to
+ # represent these three maps:
+ #
+ # # anchor tag implicit style
+ # [nil, nil, true, 1 ]
+ # [nil, "tag:yaml.org,2002:map", false, 2 ]
+ # ["pewpew", nil, true, 1 ]
+ #
+ # source://psych//psych/handler.rb#225
+ def start_mapping(anchor, tag, implicit, style); end
+
+ # Called when a sequence is started.
+ #
+ # +anchor+ is the anchor associated with the sequence or nil.
+ # +tag+ is the tag associated with the sequence or nil.
+ # +implicit+ a boolean indicating whether or not the sequence was implicitly
+ # started.
+ # +style+ is an integer indicating the list style.
+ #
+ # See the constants in Psych::Nodes::Sequence for the possible values of
+ # +style+.
+ #
+ # === Example
+ #
+ # Here is a YAML document that exercises most of the possible ways this
+ # method can be called:
+ #
+ # ---
+ # - !!seq [
+ # a
+ # ]
+ # - &pewpew
+ # - b
+ #
+ # The above YAML document consists of three lists, an outer list that
+ # contains two inner lists. Here is a matrix of the parameters sent
+ # to represent these lists:
+ #
+ # # anchor tag implicit style
+ # [nil, nil, true, 1 ]
+ # [nil, "tag:yaml.org,2002:seq", false, 2 ]
+ # ["pewpew", nil, true, 1 ]
+ #
+ # source://psych//psych/handler.rb#186
+ def start_sequence(anchor, tag, implicit, style); end
+
+ # Called with +encoding+ when the YAML stream starts. This method is
+ # called once per stream. A stream may contain multiple documents.
+ #
+ # See the constants in Psych::Parser for the possible values of +encoding+.
+ #
+ # source://psych//psych/handler.rb#47
+ def start_stream(encoding); end
+
+ # Is this handler a streaming handler?
+ #
+ # @return [Boolean]
+ #
+ # source://psych//psych/handler.rb#251
+ def streaming?; end
+end
+
+# Configuration options for dumping YAML.
+class Psych::Handler::DumperOptions
+ # @return [DumperOptions] a new instance of DumperOptions
+ #
+ # source://psych//psych/handler.rb#19
+ def initialize; end
+
+ # Returns the value of attribute canonical.
+ #
+ # source://psych//psych/handler.rb#17
+ def canonical; end
+
+ # Sets the attribute canonical
+ #
+ # @param value the value to set the attribute canonical to.
+ #
+ # source://psych//psych/handler.rb#17
+ def canonical=(_arg0); end
+
+ # Returns the value of attribute indentation.
+ #
+ # source://psych//psych/handler.rb#17
+ def indentation; end
+
+ # Sets the attribute indentation
+ #
+ # @param value the value to set the attribute indentation to.
+ #
+ # source://psych//psych/handler.rb#17
+ def indentation=(_arg0); end
+
+ # Returns the value of attribute line_width.
+ #
+ # source://psych//psych/handler.rb#17
+ def line_width; end
+
+ # Sets the attribute line_width
+ #
+ # @param value the value to set the attribute line_width to.
+ #
+ # source://psych//psych/handler.rb#17
+ def line_width=(_arg0); end
+end
+
+class Psych::JSON::Stream < ::Psych::Visitors::JSONTree
+ include ::Psych::Streaming
+ extend ::Psych::Streaming::ClassMethods
+end
+
+# YAML event parser class. This class parses a YAML document and calls
+# events on the handler that is passed to the constructor. The events can
+# be used for things such as constructing a YAML AST or deserializing YAML
+# documents. It can even be fed back to Psych::Emitter to emit the same
+# document that was parsed.
+#
+# See Psych::Handler for documentation on the events that Psych::Parser emits.
+#
+# Here is an example that prints out ever scalar found in a YAML document:
+#
+# # Handler for detecting scalar values
+# class ScalarHandler < Psych::Handler
+# def scalar value, anchor, tag, plain, quoted, style
+# puts value
+# end
+# end
+#
+# parser = Psych::Parser.new(ScalarHandler.new)
+# parser.parse(yaml_document)
+#
+# Here is an example that feeds the parser back in to Psych::Emitter. The
+# YAML document is read from STDIN and written back out to STDERR:
+#
+# parser = Psych::Parser.new(Psych::Emitter.new($stderr))
+# parser.parse($stdin)
+#
+# Psych uses Psych::Parser in combination with Psych::TreeBuilder to
+# construct an AST of the parsed YAML document.
+class Psych::Parser
+ # Creates a new Psych::Parser instance with +handler+. YAML events will
+ # be called on +handler+. See Psych::Parser for more details.
+ #
+ # @return [Parser] a new instance of Parser
+ #
+ # source://psych//psych/parser.rb#47
+ def initialize(handler = T.unsafe(nil)); end
+
+ # Set the encoding for this parser to +encoding+
+ #
+ # source://psych//psych/parser.rb#41
+ def external_encoding=(_arg0); end
+
+ # The handler on which events will be called
+ #
+ # source://psych//psych/parser.rb#38
+ def handler; end
+
+ # The handler on which events will be called
+ #
+ # source://psych//psych/parser.rb#38
+ def handler=(_arg0); end
+
+ # call-seq:
+ # parser.parse(yaml)
+ #
+ # Parse the YAML document contained in +yaml+. Events will be called on
+ # the handler set on the parser instance.
+ #
+ # See Psych::Parser and Psych::Parser#handler
+ #
+ # source://psych//psych/parser.rb#61
+ def parse(yaml, path = T.unsafe(nil)); end
+end
+
+# Scan scalars for built in types
+class Psych::ScalarScanner
+ # Create a new scanner
+ #
+ # @return [ScalarScanner] a new instance of ScalarScanner
+ #
+ # source://psych//psych/scalar_scanner.rb#30
+ def initialize(class_loader, strict_integer: T.unsafe(nil)); end
+
+ # Returns the value of attribute class_loader.
+ #
+ # source://psych//psych/scalar_scanner.rb#27
+ def class_loader; end
+
+ # Parse and return an int from +string+
+ #
+ # source://psych//psych/scalar_scanner.rb#109
+ def parse_int(string); end
+
+ # Parse and return a Time from +string+
+ #
+ # source://psych//psych/scalar_scanner.rb#115
+ def parse_time(string); end
+
+ # Tokenize +string+ returning the Ruby object
+ #
+ # source://psych//psych/scalar_scanner.rb#37
+ def tokenize(string); end
+end
+
+# Same as above, but allows commas.
+# Not to YML spec, but kept for backwards compatibility
+#
+# source://psych//psych/scalar_scanner.rb#22
+Psych::ScalarScanner::INTEGER_LEGACY = T.let(T.unsafe(nil), Regexp)
+
+# Taken from http://yaml.org/type/int.html
+#
+# source://psych//psych/scalar_scanner.rb#15
+Psych::ScalarScanner::INTEGER_STRICT = T.let(T.unsafe(nil), Regexp)
+
+# Psych::Stream is a streaming YAML emitter. It will not buffer your YAML,
+# but send it straight to an IO.
+#
+# Here is an example use:
+#
+# stream = Psych::Stream.new($stdout)
+# stream.start
+# stream.push({:foo => 'bar'})
+# stream.finish
+#
+# YAML will be immediately emitted to $stdout with no buffering.
+#
+# Psych::Stream#start will take a block and ensure that Psych::Stream#finish
+# is called, so you can do this form:
+#
+# stream = Psych::Stream.new($stdout)
+# stream.start do |em|
+# em.push(:foo => 'bar')
+# end
+class Psych::Stream < ::Psych::Visitors::YAMLTree
+ include ::Psych::Streaming
+ extend ::Psych::Streaming::ClassMethods
+end
+
+class Psych::Stream::Emitter < ::Psych::Emitter
+ # source://psych//psych/stream.rb#26
+ def end_document(implicit_end = T.unsafe(nil)); end
+
+ # @return [Boolean]
+ #
+ # source://psych//psych/stream.rb#30
+ def streaming?; end
+end
+
+module Psych::Streaming
+ # Start streaming using +encoding+
+ #
+ # source://psych//psych/streaming.rb#18
+ def start(encoding = T.unsafe(nil)); end
+
+ private
+
+ # source://psych//psych/streaming.rb#25
+ def register(target, obj); end
+end
+
+module Psych::Streaming::ClassMethods
+ # Create a new streaming emitter. Emitter will print to +io+. See
+ # Psych::Stream for an example.
+ #
+ # source://psych//psych/streaming.rb#8
+ def new(io); end
+end
+
+class Psych::SyntaxError < ::Psych::Exception
+ # @return [SyntaxError] a new instance of SyntaxError
+ #
+ # source://psych//psych/syntax_error.rb#8
+ def initialize(file, line, col, offset, problem, context); end
+
+ # Returns the value of attribute column.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def column; end
+
+ # Returns the value of attribute context.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def context; end
+
+ # Returns the value of attribute file.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def file; end
+
+ # Returns the value of attribute line.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def line; end
+
+ # Returns the value of attribute offset.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def offset; end
+
+ # Returns the value of attribute problem.
+ #
+ # source://psych//psych/syntax_error.rb#6
+ def problem; end
+end
+
+# This class works in conjunction with Psych::Parser to build an in-memory
+# parse tree that represents a YAML document.
+#
+# == Example
+#
+# parser = Psych::Parser.new Psych::TreeBuilder.new
+# parser.parse('--- foo')
+# tree = parser.handler.root
+#
+# See Psych::Handler for documentation on the event methods used in this
+# class.
+class Psych::TreeBuilder < ::Psych::Handler
+ # Create a new TreeBuilder instance
+ #
+ # @return [TreeBuilder] a new instance of TreeBuilder
+ #
+ # source://psych//psych/tree_builder.rb#22
+ def initialize; end
+
+ # source://psych//psych/tree_builder.rb#103
+ def alias(anchor); end
+
+ # Handles end_document events with +version+, +tag_directives+,
+ # and +implicit+ styling.
+ #
+ # See Psych::Handler#start_document
+ #
+ # source://psych//psych/tree_builder.rb#77
+ def end_document(implicit_end = T.unsafe(nil)); end
+
+ # source://psych//psych/tree_builder.rb#52
+ def end_mapping; end
+
+ # source://psych//psych/tree_builder.rb#52
+ def end_sequence; end
+
+ # source://psych//psych/tree_builder.rb#90
+ def end_stream; end
+
+ # source://psych//psych/tree_builder.rb#33
+ def event_location(start_line, start_column, end_line, end_column); end
+
+ # Returns the root node for the built tree
+ #
+ # source://psych//psych/tree_builder.rb#19
+ def root; end
+
+ # source://psych//psych/tree_builder.rb#96
+ def scalar(value, anchor, tag, plain, quoted, style); end
+
+ # Handles start_document events with +version+, +tag_directives+,
+ # and +implicit+ styling.
+ #
+ # See Psych::Handler#start_document
+ #
+ # source://psych//psych/tree_builder.rb#65
+ def start_document(version, tag_directives, implicit); end
+
+ # source://psych//psych/tree_builder.rb#45
+ def start_mapping(anchor, tag, implicit, style); end
+
+ # source://psych//psych/tree_builder.rb#45
+ def start_sequence(anchor, tag, implicit, style); end
+
+ # source://psych//psych/tree_builder.rb#84
+ def start_stream(encoding); end
+
+ private
+
+ # source://psych//psych/tree_builder.rb#116
+ def pop; end
+
+ # source://psych//psych/tree_builder.rb#111
+ def push(value); end
+
+ # source://psych//psych/tree_builder.rb#132
+ def set_end_location(node); end
+
+ # source://psych//psych/tree_builder.rb#122
+ def set_location(node); end
+
+ # source://psych//psych/tree_builder.rb#127
+ def set_start_location(node); end
+end
+
+# The version of Psych you are using
+#
+# source://psych//psych/versions.rb#5
+Psych::VERSION = T.let(T.unsafe(nil), String)
+
+class Psych::Visitors::DepthFirst < ::Psych::Visitors::Visitor
+ # @return [DepthFirst] a new instance of DepthFirst
+ #
+ # source://psych//psych/visitors/depth_first.rb#5
+ def initialize(block); end
+
+ private
+
+ # source://psych//psych/visitors/depth_first.rb#11
+ def nary(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#20
+ def terminal(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#20
+ def visit_Psych_Nodes_Alias(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#11
+ def visit_Psych_Nodes_Document(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#11
+ def visit_Psych_Nodes_Mapping(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#20
+ def visit_Psych_Nodes_Scalar(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#11
+ def visit_Psych_Nodes_Sequence(o); end
+
+ # source://psych//psych/visitors/depth_first.rb#11
+ def visit_Psych_Nodes_Stream(o); end
+end
+
+class Psych::Visitors::RestrictedYAMLTree < ::Psych::Visitors::YAMLTree
+ # @return [RestrictedYAMLTree] a new instance of RestrictedYAMLTree
+ #
+ # source://psych//psych/visitors/yaml_tree.rb#552
+ def initialize(emitter, ss, options); end
+
+ # source://psych//psych/visitors/yaml_tree.rb#565
+ def accept(target); end
+
+ # source://psych//psych/visitors/yaml_tree.rb#577
+ def visit_Symbol(sym); end
+end
+
+# source://psych//psych/visitors/yaml_tree.rb#541
+Psych::Visitors::RestrictedYAMLTree::DEFAULT_PERMITTED_CLASSES = T.let(T.unsafe(nil), Hash)
+
+# This class walks a YAML AST, converting each node to Ruby
+class Psych::Visitors::ToRuby < ::Psych::Visitors::Visitor
+ # @return [ToRuby] a new instance of ToRuby
+ #
+ # source://psych//psych/visitors/to_ruby.rb#23
+ def initialize(ss, class_loader, symbolize_names: T.unsafe(nil), freeze: T.unsafe(nil)); end
+
+ # source://psych//psych/visitors/to_ruby.rb#34
+ def accept(target); end
+
+ # Returns the value of attribute class_loader.
+ #
+ # source://psych//psych/visitors/to_ruby.rb#21
+ def class_loader; end
+
+ # source://psych//psych/visitors/to_ruby.rb#327
+ def visit_Psych_Nodes_Alias(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#319
+ def visit_Psych_Nodes_Document(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#165
+ def visit_Psych_Nodes_Mapping(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#129
+ def visit_Psych_Nodes_Scalar(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#133
+ def visit_Psych_Nodes_Sequence(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#323
+ def visit_Psych_Nodes_Stream(o); end
+
+ private
+
+ # source://psych//psych/visitors/to_ruby.rb#395
+ def deduplicate(key); end
+
+ # source://psych//psych/visitors/to_ruby.rb#51
+ def deserialize(o); end
+
+ # source://psych//psych/visitors/to_ruby.rb#412
+ def init_with(o, h, node); end
+
+ # source://psych//psych/visitors/to_ruby.rb#404
+ def merge_key(hash, key, val); end
+
+ # source://psych//psych/visitors/to_ruby.rb#333
+ def register(node, object); end
+
+ # source://psych//psych/visitors/to_ruby.rb#338
+ def register_empty(object); end
+
+ # Convert +klassname+ to a Class
+ #
+ # source://psych//psych/visitors/to_ruby.rb#425
+ def resolve_class(klassname); end
+
+ # source://psych//psych/visitors/to_ruby.rb#407
+ def revive(klass, node); end
+
+ # source://psych//psych/visitors/to_ruby.rb#344
+ def revive_hash(hash, o, tagged = T.unsafe(nil)); end
+
+ class << self
+ # source://psych//psych/visitors/to_ruby.rb#15
+ def create(symbolize_names: T.unsafe(nil), freeze: T.unsafe(nil), strict_integer: T.unsafe(nil)); end
+ end
+end
+
+class Psych::Visitors::Visitor
+ # source://psych//psych/visitors/visitor.rb#5
+ def accept(target); end
+
+ private
+
+ # source://psych//psych/visitors/visitor.rb#19
+ def dispatch; end
+
+ # source://psych//psych/visitors/visitor.rb#29
+ def visit(target); end
+
+ class << self
+ # @api private
+ #
+ # source://psych//psych/visitors/visitor.rb#12
+ def dispatch_cache; end
+ end
+end
+
+# YAMLTree builds a YAML ast given a Ruby object. For example:
+#
+# builder = Psych::Visitors::YAMLTree.new
+# builder << { :foo => 'bar' }
+# builder.tree # => # ['a', 'b', 'c']
#
- # source://rake//lib/rake/file_utils.rb#128
+ # source://rake//lib/rake/file_utils.rb#126
def split_all(path); end
private
@@ -75,14 +75,14 @@ module FileUtils
# source://rake//lib/rake/file_utils.rb#61
def create_shell_runner(cmd); end
- # source://rake//lib/rake/file_utils.rb#86
+ # source://rake//lib/rake/file_utils.rb#84
def set_verbose_option(options); end
- # source://rake//lib/rake/file_utils.rb#73
+ # source://rake//lib/rake/file_utils.rb#71
def sh_show_command(cmd); end
end
-# source://rake//lib/rake/file_utils.rb#108
+# source://rake//lib/rake/file_utils.rb#106
FileUtils::LN_SUPPORTED = T.let(T.unsafe(nil), Array)
# Path to the currently running Ruby program
@@ -195,13 +195,13 @@ class Rake::Application
# Add a file to the list of files to be imported.
#
- # source://rake//lib/rake/application.rb#777
+ # source://rake//lib/rake/application.rb#801
def add_import(fn); end
# Add a loader to handle imported files ending in the extension
# +ext+.
#
- # source://rake//lib/rake/application.rb#139
+ # source://rake//lib/rake/application.rb#161
def add_loader(ext, loader); end
# Collect the list of tasks on the command line. If no tasks are
@@ -213,13 +213,13 @@ class Rake::Application
# recognised command-line options, which OptionParser.parse will
# have taken care of already.
#
- # source://rake//lib/rake/application.rb#758
+ # source://rake//lib/rake/application.rb#782
def collect_command_line_tasks(args); end
# Default task name ("default").
# (May be overridden by subclasses)
#
- # source://rake//lib/rake/application.rb#772
+ # source://rake//lib/rake/application.rb#796
def default_task_name; end
# Warn about deprecated usage.
@@ -227,75 +227,75 @@ class Rake::Application
# Example:
# Rake.application.deprecate("import", "Rake.import", caller.first)
#
- # source://rake//lib/rake/application.rb#258
+ # source://rake//lib/rake/application.rb#282
def deprecate(old_usage, new_usage, call_site); end
- # source://rake//lib/rake/application.rb#222
+ # source://rake//lib/rake/application.rb#244
def display_cause_details(ex); end
# Display the error message that caused the exception.
#
- # source://rake//lib/rake/application.rb#206
+ # source://rake//lib/rake/application.rb#228
def display_error_message(ex); end
- # source://rake//lib/rake/application.rb#245
+ # source://rake//lib/rake/application.rb#269
def display_exception_backtrace(ex); end
- # source://rake//lib/rake/application.rb#214
+ # source://rake//lib/rake/application.rb#236
def display_exception_details(ex); end
- # source://rake//lib/rake/application.rb#229
+ # source://rake//lib/rake/application.rb#251
def display_exception_details_seen; end
- # source://rake//lib/rake/application.rb#237
+ # source://rake//lib/rake/application.rb#259
def display_exception_message_details(ex); end
# Display the tasks and prerequisites
#
- # source://rake//lib/rake/application.rb#381
+ # source://rake//lib/rake/application.rb#405
def display_prerequisites; end
# Display the tasks and comments.
#
- # source://rake//lib/rake/application.rb#298
+ # source://rake//lib/rake/application.rb#322
def display_tasks_and_comments; end
# Calculate the dynamic width of the
#
- # source://rake//lib/rake/application.rb#349
+ # source://rake//lib/rake/application.rb#373
def dynamic_width; end
- # source://rake//lib/rake/application.rb#353
+ # source://rake//lib/rake/application.rb#377
def dynamic_width_stty; end
- # source://rake//lib/rake/application.rb#357
+ # source://rake//lib/rake/application.rb#381
def dynamic_width_tput; end
# Exit the program because of an unhandled exception.
# (may be overridden by subclasses)
#
- # source://rake//lib/rake/application.rb#201
+ # source://rake//lib/rake/application.rb#223
def exit_because_of_exception(ex); end
- # source://rake//lib/rake/application.rb#678
+ # source://rake//lib/rake/application.rb#702
def find_rakefile_location; end
# Read and handle the command line options. Returns the command line
# arguments that we didn't understand, which should (in theory) be just
# task names and env vars.
#
- # source://rake//lib/rake/application.rb#644
+ # source://rake//lib/rake/application.rb#668
def handle_options(argv); end
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#233
+ # source://rake//lib/rake/application.rb#255
def has_cause?(ex); end
# True if one of the files in RAKEFILES is in the current directory.
# If a match is found, it is copied into @rakefile.
#
- # source://rake//lib/rake/application.rb#274
+ # source://rake//lib/rake/application.rb#298
def have_rakefile; end
# Initialize the command line parameters and app name.
@@ -305,17 +305,17 @@ class Rake::Application
# Invokes a task with arguments that are extracted from +task_string+
#
- # source://rake//lib/rake/application.rb#157
+ # source://rake//lib/rake/application.rb#179
def invoke_task(task_string); end
# Load the pending list of imported files.
#
- # source://rake//lib/rake/application.rb#782
+ # source://rake//lib/rake/application.rb#806
def load_imports; end
# Find the rakefile and then load it and any pending imports.
#
- # source://rake//lib/rake/application.rb#102
+ # source://rake//lib/rake/application.rb#124
def load_rakefile; end
# The name of the application (typically 'rake')
@@ -325,7 +325,7 @@ class Rake::Application
# Application options from the command line
#
- # source://rake//lib/rake/application.rb#145
+ # source://rake//lib/rake/application.rb#167
def options; end
# The original directory where rake was invoked.
@@ -333,16 +333,16 @@ class Rake::Application
# source://rake//lib/rake/application.rb#27
def original_dir; end
- # source://rake//lib/rake/application.rb#163
+ # source://rake//lib/rake/application.rb#185
def parse_task_string(string); end
- # source://rake//lib/rake/application.rb#690
+ # source://rake//lib/rake/application.rb#714
def print_rakefile_directory(location); end
# Similar to the regular Ruby +require+ command, but will check
# for *.rake files in addition to *.rb files.
#
- # source://rake//lib/rake/application.rb#664
+ # source://rake//lib/rake/application.rb#688
def rake_require(file_name, paths = T.unsafe(nil), loaded = T.unsafe(nil)); end
# Name of the actual rakefile used.
@@ -350,10 +350,10 @@ class Rake::Application
# source://rake//lib/rake/application.rb#30
def rakefile; end
- # source://rake//lib/rake/application.rb#798
+ # source://rake//lib/rake/application.rb#822
def rakefile_location(backtrace = T.unsafe(nil)); end
- # source://rake//lib/rake/application.rb#695
+ # source://rake//lib/rake/application.rb#719
def raw_load_rakefile; end
# Run the Rake application. The run method performs the following
@@ -372,26 +372,26 @@ class Rake::Application
# Run the given block with the thread startup and shutdown.
#
- # source://rake//lib/rake/application.rb#122
+ # source://rake//lib/rake/application.rb#144
def run_with_threads; end
- # source://rake//lib/rake/application.rb#807
+ # source://rake//lib/rake/application.rb#831
def set_default_options; end
# Provide standard exception handling for the given block.
#
- # source://rake//lib/rake/application.rb#185
+ # source://rake//lib/rake/application.rb#207
def standard_exception_handling; end
# A list of all the standard options used in rake, suitable for
# passing to OptionParser.
#
- # source://rake//lib/rake/application.rb#402
+ # source://rake//lib/rake/application.rb#426
def standard_rake_options; end
# The directory path containing the system wide rakefiles.
#
- # source://rake//lib/rake/application.rb#727
+ # source://rake//lib/rake/application.rb#751
def system_dir; end
# Number of columns on the terminal
@@ -404,17 +404,17 @@ class Rake::Application
# source://rake//lib/rake/application.rb#33
def terminal_columns=(_arg0); end
- # source://rake//lib/rake/application.rb#337
+ # source://rake//lib/rake/application.rb#361
def terminal_width; end
# Return the thread pool used for multithreaded processing.
#
- # source://rake//lib/rake/application.rb#150
+ # source://rake//lib/rake/application.rb#172
def thread_pool; end
# Run the top level tasks of a Rake application.
#
- # source://rake//lib/rake/application.rb#109
+ # source://rake//lib/rake/application.rb#131
def top_level; end
# List of the top level task names (task names from the command line).
@@ -422,10 +422,10 @@ class Rake::Application
# source://rake//lib/rake/application.rb#36
def top_level_tasks; end
- # source://rake//lib/rake/application.rb#388
+ # source://rake//lib/rake/application.rb#412
def trace(*strings); end
- # source://rake//lib/rake/application.rb#370
+ # source://rake//lib/rake/application.rb#394
def truncate(string, width); end
# We will truncate output if we are outputting to a TTY or if we've been
@@ -433,7 +433,7 @@ class Rake::Application
#
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#293
+ # source://rake//lib/rake/application.rb#317
def truncate_output?; end
# Override the detected TTY output state (mostly for testing)
@@ -445,41 +445,44 @@ class Rake::Application
#
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#287
+ # source://rake//lib/rake/application.rb#311
def tty_output?; end
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#361
+ # source://rake//lib/rake/application.rb#385
def unix?; end
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#366
+ # source://rake//lib/rake/application.rb#390
def windows?; end
private
- # source://rake//lib/rake/application.rb#721
+ # source://rake//lib/rake/application.rb#745
def glob(path, &block); end
# Does the exception have a task invocation chain?
#
# @return [Boolean]
#
- # source://rake//lib/rake/application.rb#267
+ # source://rake//lib/rake/application.rb#291
def has_chain?(exception); end
- # source://rake//lib/rake/application.rb#620
+ # source://rake//lib/rake/application.rb#102
+ def load_debug_at_stop_feature; end
+
+ # source://rake//lib/rake/application.rb#644
def select_tasks_to_show(options, show_tasks, value); end
- # source://rake//lib/rake/application.rb#627
+ # source://rake//lib/rake/application.rb#651
def select_trace_output(options, trace_option, value); end
- # source://rake//lib/rake/application.rb#393
+ # source://rake//lib/rake/application.rb#417
def sort_options(options); end
- # source://rake//lib/rake/application.rb#744
+ # source://rake//lib/rake/application.rb#768
def standard_system_dir; end
end
@@ -591,7 +594,7 @@ module Rake::DSL
#
# Example:
# desc "Run the Unit Tests"
- # task test: [:build]
+ # task test: [:build] do
# # ... run tests
# end
#
@@ -745,7 +748,7 @@ module Rake::DSL
# source://rake//lib/rake/file_utils_ext.rb#34
def rmtree(*args, **options, &block); end
- # source://rake//lib/rake/file_utils.rb#100
+ # source://rake//lib/rake/file_utils.rb#98
def ruby(*args, **options, &block); end
# Declare a rule for auto-tasks.
@@ -758,7 +761,7 @@ module Rake::DSL
# source://rake//lib/rake/dsl_definition.rb#151
def rule(*args, &block); end
- # source://rake//lib/rake/file_utils.rb#112
+ # source://rake//lib/rake/file_utils.rb#110
def safe_ln(*args, **options); end
# source://rake//lib/rake/file_utils_ext.rb#34
@@ -767,7 +770,7 @@ module Rake::DSL
# source://rake//lib/rake/file_utils.rb#43
def sh(*cmd, &block); end
- # source://rake//lib/rake/file_utils.rb#128
+ # source://rake//lib/rake/file_utils.rb#126
def split_all(path); end
# source://rake//lib/rake/file_utils_ext.rb#34
@@ -1580,7 +1583,7 @@ class Rake::FileTask < ::Rake::Task
# Time stamp for file task.
#
- # source://rake//lib/rake/file_task.rb#21
+ # source://rake//lib/rake/file_task.rb#25
def timestamp; end
private
@@ -1589,14 +1592,14 @@ class Rake::FileTask < ::Rake::Task
#
# @return [Boolean]
#
- # source://rake//lib/rake/file_task.rb#32
+ # source://rake//lib/rake/file_task.rb#36
def out_of_date?(stamp); end
class << self
# Apply the scope to the task name according to the rules for this kind
# of task. File based tasks ignore the scope when creating the name.
#
- # source://rake//lib/rake/file_task.rb#49
+ # source://rake//lib/rake/file_task.rb#53
def scope_name(scope, task_name); end
end
end
@@ -2854,14 +2857,14 @@ class Rake::ThreadHistoryDisplay
def threads; end
end
-# source://rake//lib/rake/thread_pool.rb#7
+# source://rake//lib/rake/thread_pool.rb#8
class Rake::ThreadPool
# Creates a ThreadPool object. The +thread_count+ parameter is the size
# of the pool.
#
# @return [ThreadPool] a new instance of ThreadPool
#
- # source://rake//lib/rake/thread_pool.rb#11
+ # source://rake//lib/rake/thread_pool.rb#12
def initialize(thread_count); end
# Creates a future executed by the +ThreadPool+.
diff --git a/sorbet/rbi/gems/rbi@0.0.16.rbi b/sorbet/rbi/gems/rbi@0.1.6.rbi
similarity index 72%
rename from sorbet/rbi/gems/rbi@0.0.16.rbi
rename to sorbet/rbi/gems/rbi@0.1.6.rbi
index 96f9bcc..5a4efdf 100644
--- a/sorbet/rbi/gems/rbi@0.0.16.rbi
+++ b/sorbet/rbi/gems/rbi@0.1.6.rbi
@@ -4,55 +4,28 @@
# This is an autogenerated file for types exported from the `rbi` gem.
# Please instead update this file by running `bin/tapioca gem rbi`.
-# source://rbi//lib/rbi.rb#7
+# source://rbi//lib/rbi/loc.rb#4
module RBI; end
-# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
-#
-# source://rbi//lib/rbi/parser.rb#129
-class RBI::ASTVisitor
- abstract!
-
- # @abstract
- #
- # source://rbi//lib/rbi/parser.rb#141
- sig { abstract.params(node: T.nilable(::AST::Node)).void }
- def visit(node); end
-
- # source://rbi//lib/rbi/parser.rb#136
- sig { params(nodes: T::Array[::AST::Node]).void }
- def visit_all(nodes); end
-
- private
-
- # source://rbi//lib/rbi/parser.rb#151
- sig { params(node: ::AST::Node).returns(::String) }
- def parse_expr(node); end
-
- # source://rbi//lib/rbi/parser.rb#146
- sig { params(node: ::AST::Node).returns(::String) }
- def parse_name(node); end
-end
-
-# source://rbi//lib/rbi/model.rb#960
+# source://rbi//lib/rbi/model.rb#968
class RBI::Arg < ::RBI::Node
- # source://rbi//lib/rbi/model.rb#972
+ # source://rbi//lib/rbi/model.rb#980
sig { params(value: ::String, loc: T.nilable(::RBI::Loc)).void }
def initialize(value, loc: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#978
+ # source://rbi//lib/rbi/model.rb#986
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#611
+ # source://rbi//lib/rbi/printer.rb#613
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#983
+ # source://rbi//lib/rbi/model.rb#991
sig { returns(::String) }
def to_s; end
- # source://rbi//lib/rbi/model.rb#964
+ # source://rbi//lib/rbi/model.rb#972
sig { returns(::String) }
def value; end
end
@@ -61,13 +34,13 @@ end
#
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#341
+# source://rbi//lib/rbi/model.rb#349
class RBI::Attr < ::RBI::NodeWithComments
include ::RBI::Indexable
abstract!
- # source://rbi//lib/rbi/model.rb#366
+ # source://rbi//lib/rbi/model.rb#374
sig do
params(
name: ::Symbol,
@@ -80,58 +53,53 @@ class RBI::Attr < ::RBI::NodeWithComments
end
def initialize(name, names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#346
+ # source://rbi//lib/rbi/printer.rb#348
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#406
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#412
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
# @abstract
#
- # source://rbi//lib/rbi/model.rb#374
+ # source://rbi//lib/rbi/model.rb#382
sig { abstract.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/index.rb#109
+ # source://rbi//lib/rbi/index.rb#113
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#413
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#420
sig { override.params(other: ::RBI::Node).void }
def merge_with(other); end
- # source://rbi//lib/rbi/model.rb#348
+ # source://rbi//lib/rbi/model.rb#356
sig { returns(T::Array[::Symbol]) }
def names; end
- # @return [Array]
- #
- # source://rbi//lib/rbi/model.rb#348
- def names=(_arg0); end
-
- # source://rbi//lib/rbi/printer.rb#373
+ # source://rbi//lib/rbi/printer.rb#375
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/model.rb#354
+ # source://rbi//lib/rbi/model.rb#362
sig { returns(T::Array[::RBI::Sig]) }
def sigs; end
- # source://rbi//lib/rbi/model.rb#351
+ # source://rbi//lib/rbi/model.rb#359
sig { returns(::RBI::Visibility) }
def visibility; end
# @return [Visibility]
#
- # source://rbi//lib/rbi/model.rb#351
+ # source://rbi//lib/rbi/model.rb#359
def visibility=(_arg0); end
end
-# source://rbi//lib/rbi/model.rb#377
+# source://rbi//lib/rbi/model.rb#385
class RBI::AttrAccessor < ::RBI::Attr
- # source://rbi//lib/rbi/model.rb#391
+ # source://rbi//lib/rbi/model.rb#399
sig do
params(
name: ::Symbol,
@@ -145,22 +113,22 @@ class RBI::AttrAccessor < ::RBI::Attr
end
def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#444
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#452
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#397
+ # source://rbi//lib/rbi/model.rb#405
sig { override.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/model.rb#403
+ # source://rbi//lib/rbi/model.rb#411
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#409
+# source://rbi//lib/rbi/model.rb#417
class RBI::AttrReader < ::RBI::Attr
- # source://rbi//lib/rbi/model.rb#423
+ # source://rbi//lib/rbi/model.rb#431
sig do
params(
name: ::Symbol,
@@ -174,22 +142,22 @@ class RBI::AttrReader < ::RBI::Attr
end
def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#426
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#434
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#429
+ # source://rbi//lib/rbi/model.rb#437
sig { override.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/model.rb#435
+ # source://rbi//lib/rbi/model.rb#443
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#441
+# source://rbi//lib/rbi/model.rb#449
class RBI::AttrWriter < ::RBI::Attr
- # source://rbi//lib/rbi/model.rb#455
+ # source://rbi//lib/rbi/model.rb#463
sig do
params(
name: ::Symbol,
@@ -203,35 +171,35 @@ class RBI::AttrWriter < ::RBI::Attr
end
def initialize(name, *names, visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#435
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#443
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#461
+ # source://rbi//lib/rbi/model.rb#469
sig { override.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/model.rb#467
+ # source://rbi//lib/rbi/model.rb#475
sig { override.returns(::String) }
def to_s; end
end
# An arbitrary blank line that can be added both in trees and comments
#
-# source://rbi//lib/rbi/model.rb#70
+# source://rbi//lib/rbi/model.rb#74
class RBI::BlankLine < ::RBI::Comment
- # source://rbi//lib/rbi/model.rb#74
+ # source://rbi//lib/rbi/model.rb#78
sig { params(loc: T.nilable(::RBI::Loc)).void }
def initialize(loc: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#215
+ # source://rbi//lib/rbi/printer.rb#217
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
end
-# source://rbi//lib/rbi/model.rb#733
+# source://rbi//lib/rbi/model.rb#741
class RBI::BlockParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#744
+ # source://rbi//lib/rbi/model.rb#752
sig do
params(
name: ::String,
@@ -242,26 +210,26 @@ class RBI::BlockParam < ::RBI::Param
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#755
+ # source://rbi//lib/rbi/model.rb#763
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#541
+ # source://rbi//lib/rbi/printer.rb#543
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#546
+ # source://rbi//lib/rbi/printer.rb#548
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#750
+ # source://rbi//lib/rbi/model.rb#758
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#213
+# source://rbi//lib/rbi/model.rb#218
class RBI::Class < ::RBI::Scope
- # source://rbi//lib/rbi/model.rb#231
+ # source://rbi//lib/rbi/model.rb#236
sig do
params(
name: ::String,
@@ -273,58 +241,58 @@ class RBI::Class < ::RBI::Scope
end
def initialize(name, superclass_name: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#370
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#376
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#239
+ # source://rbi//lib/rbi/model.rb#244
sig { override.returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/model.rb#217
+ # source://rbi//lib/rbi/model.rb#222
sig { returns(::String) }
def name; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#217
+ # source://rbi//lib/rbi/model.rb#222
def name=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#282
+ # source://rbi//lib/rbi/printer.rb#284
sig { override.params(v: ::RBI::Printer).void }
def print_header(v); end
- # source://rbi//lib/rbi/model.rb#220
+ # source://rbi//lib/rbi/model.rb#225
sig { returns(T.nilable(::String)) }
def superclass_name; end
# @return [String, nil]
#
- # source://rbi//lib/rbi/model.rb#220
+ # source://rbi//lib/rbi/model.rb#225
def superclass_name=(_arg0); end
end
-# source://rbi//lib/rbi/model.rb#50
+# source://rbi//lib/rbi/model.rb#53
class RBI::Comment < ::RBI::Node
- # source://rbi//lib/rbi/model.rb#57
+ # source://rbi//lib/rbi/model.rb#60
sig { params(text: ::String, loc: T.nilable(::RBI::Loc)).void }
def initialize(text, loc: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#63
+ # source://rbi//lib/rbi/model.rb#66
sig { params(other: ::Object).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#195
+ # source://rbi//lib/rbi/printer.rb#197
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#54
+ # source://rbi//lib/rbi/model.rb#57
sig { returns(::String) }
def text; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#54
+ # source://rbi//lib/rbi/model.rb#57
def text=(_arg0); end
end
@@ -343,33 +311,33 @@ end
# end
# ~~~
#
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#578
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#589
class RBI::ConflictTree < ::RBI::Tree
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#585
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#596
sig { params(left_name: ::String, right_name: ::String).void }
def initialize(left_name: T.unsafe(nil), right_name: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#596
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#607
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#582
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#593
sig { returns(::RBI::Tree) }
def left; end
# @return [Tree]
#
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#582
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#593
def right; end
end
# Consts
#
-# source://rbi//lib/rbi/model.rb#305
+# source://rbi//lib/rbi/model.rb#312
class RBI::Const < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#320
+ # source://rbi//lib/rbi/model.rb#327
sig do
params(
name: ::String,
@@ -381,70 +349,41 @@ class RBI::Const < ::RBI::NodeWithComments
end
def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/printer.rb#333
+ # source://rbi//lib/rbi/printer.rb#335
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#397
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#403
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#328
+ # source://rbi//lib/rbi/model.rb#335
sig { returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/index.rb#99
+ # source://rbi//lib/rbi/index.rb#103
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#309
+ # source://rbi//lib/rbi/model.rb#316
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/model.rb#334
+ # source://rbi//lib/rbi/model.rb#342
sig { override.returns(::String) }
def to_s; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#309
+ # source://rbi//lib/rbi/model.rb#316
def value; end
end
-# source://rbi//lib/rbi/parser.rb#600
-class RBI::ConstBuilder < ::RBI::ASTVisitor
- # source://rbi//lib/rbi/parser.rb#615
- sig { void }
- def initialize; end
-
- # source://rbi//lib/rbi/parser.rb#612
- sig { returns(T::Array[::String]) }
- def names; end
-
- # @return [Array]
- #
- # source://rbi//lib/rbi/parser.rb#612
- def names=(_arg0); end
-
- # source://rbi//lib/rbi/parser.rb#621
- sig { override.params(node: T.nilable(::AST::Node)).void }
- def visit(node); end
-
- class << self
- # source://rbi//lib/rbi/parser.rb#604
- sig { params(node: T.nilable(::AST::Node)).returns(T.nilable(::String)) }
- def visit(node); end
- end
-end
-
-# source://rbi//lib/rbi.rb#8
-class RBI::Error < ::StandardError; end
-
-# source://rbi//lib/rbi/model.rb#808
+# source://rbi//lib/rbi/model.rb#816
class RBI::Extend < ::RBI::Mixin
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#820
+ # source://rbi//lib/rbi/model.rb#828
sig do
params(
name: ::String,
@@ -456,22 +395,22 @@ class RBI::Extend < ::RBI::Mixin
end
def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#492
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#502
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/index.rb#139
+ # source://rbi//lib/rbi/index.rb#143
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#826
+ # source://rbi//lib/rbi/model.rb#834
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#133
+# source://rbi//lib/rbi/model.rb#137
class RBI::File
- # source://rbi//lib/rbi/model.rb#152
+ # source://rbi//lib/rbi/model.rb#156
sig do
params(
strictness: T.nilable(::String),
@@ -481,28 +420,28 @@ class RBI::File
end
def initialize(strictness: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#160
+ # source://rbi//lib/rbi/model.rb#164
sig { params(node: ::RBI::Node).void }
def <<(node); end
- # source://rbi//lib/rbi/printer.rb#104
+ # source://rbi//lib/rbi/printer.rb#105
sig { params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#143
+ # source://rbi//lib/rbi/model.rb#147
sig { returns(T::Array[::RBI::Comment]) }
def comments; end
# @return [Array]
#
- # source://rbi//lib/rbi/model.rb#143
+ # source://rbi//lib/rbi/model.rb#147
def comments=(_arg0); end
- # source://rbi//lib/rbi/model.rb#165
+ # source://rbi//lib/rbi/model.rb#169
sig { returns(T::Boolean) }
def empty?; end
- # source://rbi//lib/rbi/printer.rb#128
+ # source://rbi//lib/rbi/printer.rb#129
sig do
params(
out: T.any(::IO, ::StringIO),
@@ -513,32 +452,32 @@ class RBI::File
end
def print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#137
+ # source://rbi//lib/rbi/model.rb#141
sig { returns(::RBI::Tree) }
def root; end
# @return [Tree]
#
- # source://rbi//lib/rbi/model.rb#137
+ # source://rbi//lib/rbi/model.rb#141
def root=(_arg0); end
- # source://rbi//lib/rbi/model.rb#140
+ # source://rbi//lib/rbi/model.rb#144
sig { returns(T.nilable(::String)) }
def strictness; end
# @return [String, nil]
#
- # source://rbi//lib/rbi/model.rb#140
+ # source://rbi//lib/rbi/model.rb#144
def strictness=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#134
+ # source://rbi//lib/rbi/printer.rb#135
sig { params(indent: ::Integer, print_locs: T::Boolean, max_line_length: T.nilable(::Integer)).returns(::String) }
def string(indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
end
# source://rbi//lib/rbi/formatter.rb#5
class RBI::Formatter
- # source://rbi//lib/rbi/formatter.rb#24
+ # source://rbi//lib/rbi/formatter.rb#36
sig do
params(
add_sig_templates: T::Boolean,
@@ -551,79 +490,46 @@ class RBI::Formatter
end
def initialize(add_sig_templates: T.unsafe(nil), group_nodes: T.unsafe(nil), max_line_length: T.unsafe(nil), nest_singleton_methods: T.unsafe(nil), nest_non_public_methods: T.unsafe(nil), sort_nodes: T.unsafe(nil)); end
- # source://rbi//lib/rbi/formatter.rb#9
- sig { returns(T::Boolean) }
- def add_sig_templates; end
-
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def add_sig_templates=(_arg0); end
+ # source://rbi//lib/rbi/formatter.rb#15
+ sig { params(add_sig_templates: T::Boolean).returns(T::Boolean) }
+ def add_sig_templates=(add_sig_templates); end
- # source://rbi//lib/rbi/formatter.rb#53
+ # source://rbi//lib/rbi/formatter.rb#59
sig { params(file: ::RBI::File).void }
def format_file(file); end
- # source://rbi//lib/rbi/formatter.rb#58
+ # source://rbi//lib/rbi/formatter.rb#64
sig { params(tree: ::RBI::Tree).void }
def format_tree(tree); end
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def group_nodes; end
-
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def group_nodes=(_arg0); end
+ # source://rbi//lib/rbi/formatter.rb#18
+ sig { params(group_nodes: T::Boolean).returns(T::Boolean) }
+ def group_nodes=(group_nodes); end
- # source://rbi//lib/rbi/formatter.rb#12
+ # source://rbi//lib/rbi/formatter.rb#24
sig { returns(T.nilable(::Integer)) }
def max_line_length; end
# @return [Integer, nil]
#
- # source://rbi//lib/rbi/formatter.rb#12
+ # source://rbi//lib/rbi/formatter.rb#24
def max_line_length=(_arg0); end
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def nest_non_public_methods; end
-
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def nest_non_public_methods=(_arg0); end
-
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def nest_singleton_methods; end
+ # source://rbi//lib/rbi/formatter.rb#21
+ sig { params(nest_non_public_methods: T::Boolean).returns(T::Boolean) }
+ def nest_non_public_methods=(nest_non_public_methods); end
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def nest_singleton_methods=(_arg0); end
+ # source://rbi//lib/rbi/formatter.rb#12
+ sig { params(nest_singleton_methods: T::Boolean).returns(T::Boolean) }
+ def nest_singleton_methods=(nest_singleton_methods); end
- # source://rbi//lib/rbi/formatter.rb#41
+ # source://rbi//lib/rbi/formatter.rb#53
sig { params(file: ::RBI::File).returns(::String) }
def print_file(file); end
- # source://rbi//lib/rbi/formatter.rb#47
- sig { params(tree: ::RBI::Tree).returns(::String) }
- def print_tree(tree); end
-
- # @return [Boolean]
- #
# source://rbi//lib/rbi/formatter.rb#9
- def sort_nodes; end
-
- # @return [Boolean]
- #
- # source://rbi//lib/rbi/formatter.rb#9
- def sort_nodes=(_arg0); end
+ sig { params(sort_nodes: T::Boolean).returns(T::Boolean) }
+ def sort_nodes=(sort_nodes); end
end
# source://rbi//lib/rbi/rewriters/group_nodes.rb#88
@@ -632,7 +538,7 @@ class RBI::Group < ::RBI::Tree
sig { params(kind: ::RBI::Group::Kind).void }
def initialize(kind); end
- # source://rbi//lib/rbi/printer.rb#836
+ # source://rbi//lib/rbi/printer.rb#838
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
@@ -662,11 +568,11 @@ end
# Sorbet's misc.
#
-# source://rbi//lib/rbi/model.rb#1285
+# source://rbi//lib/rbi/model.rb#1294
class RBI::Helper < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1299
+ # source://rbi//lib/rbi/model.rb#1308
sig do
params(
name: ::String,
@@ -677,32 +583,32 @@ class RBI::Helper < ::RBI::NodeWithComments
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/printer.rb#823
+ # source://rbi//lib/rbi/printer.rb#825
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#510
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#520
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/index.rb#169
+ # source://rbi//lib/rbi/index.rb#173
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#1289
+ # source://rbi//lib/rbi/model.rb#1298
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/model.rb#1306
+ # source://rbi//lib/rbi/model.rb#1315
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#785
+# source://rbi//lib/rbi/model.rb#793
class RBI::Include < ::RBI::Mixin
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#797
+ # source://rbi//lib/rbi/model.rb#805
sig do
params(
name: ::String,
@@ -714,49 +620,49 @@ class RBI::Include < ::RBI::Mixin
end
def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#483
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#493
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/index.rb#129
+ # source://rbi//lib/rbi/index.rb#133
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#803
+ # source://rbi//lib/rbi/model.rb#811
sig { override.returns(::String) }
def to_s; end
end
# source://rbi//lib/rbi/index.rb#5
class RBI::Index < ::RBI::Visitor
- # source://rbi//lib/rbi/index.rb#17
+ # source://rbi//lib/rbi/index.rb#21
sig { void }
def initialize; end
- # source://rbi//lib/rbi/index.rb#28
+ # source://rbi//lib/rbi/index.rb#32
sig { params(id: ::String).returns(T::Array[::RBI::Node]) }
def [](id); end
- # source://rbi//lib/rbi/index.rb#33
+ # source://rbi//lib/rbi/index.rb#37
sig { params(nodes: ::RBI::Node).void }
def index(*nodes); end
- # source://rbi//lib/rbi/index.rb#23
+ # source://rbi//lib/rbi/index.rb#27
sig { returns(T::Array[::String]) }
def keys; end
- # source://rbi//lib/rbi/index.rb#38
+ # source://rbi//lib/rbi/index.rb#42
sig { override.params(node: T.nilable(::RBI::Node)).void }
def visit(node); end
private
- # source://rbi//lib/rbi/index.rb#55
+ # source://rbi//lib/rbi/index.rb#59
sig { params(node: T.all(::RBI::Indexable, ::RBI::Node)).void }
def index_node(node); end
class << self
- # source://rbi//lib/rbi/index.rb#10
+ # source://rbi//lib/rbi/index.rb#13
sig { params(node: ::RBI::Node).returns(::RBI::Index) }
def index(*node); end
end
@@ -766,7 +672,7 @@ end
#
# @abstract Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/index.rb#70
+# source://rbi//lib/rbi/index.rb#74
module RBI::Indexable
interface!
@@ -777,37 +683,37 @@ module RBI::Indexable
#
# @abstract
#
- # source://rbi//lib/rbi/index.rb#81
+ # source://rbi//lib/rbi/index.rb#85
sig { abstract.returns(T::Array[::String]) }
def index_ids; end
end
-# source://rbi//lib/rbi/model.rb#988
+# source://rbi//lib/rbi/model.rb#996
class RBI::KwArg < ::RBI::Arg
- # source://rbi//lib/rbi/model.rb#1001
+ # source://rbi//lib/rbi/model.rb#1009
sig { params(keyword: ::String, value: ::String, loc: T.nilable(::RBI::Loc)).void }
def initialize(keyword, value, loc: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#1007
+ # source://rbi//lib/rbi/model.rb#1015
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#620
+ # source://rbi//lib/rbi/printer.rb#622
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#992
+ # source://rbi//lib/rbi/model.rb#1000
sig { returns(::String) }
def keyword; end
- # source://rbi//lib/rbi/model.rb#1012
+ # source://rbi//lib/rbi/model.rb#1020
sig { returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#674
+# source://rbi//lib/rbi/model.rb#682
class RBI::KwOptParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#689
+ # source://rbi//lib/rbi/model.rb#697
sig do
params(
name: ::String,
@@ -819,30 +725,30 @@ class RBI::KwOptParam < ::RBI::Param
end
def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#701
+ # source://rbi//lib/rbi/model.rb#709
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#511
+ # source://rbi//lib/rbi/printer.rb#513
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#516
+ # source://rbi//lib/rbi/printer.rb#518
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#696
+ # source://rbi//lib/rbi/model.rb#704
sig { override.returns(::String) }
def to_s; end
- # source://rbi//lib/rbi/model.rb#678
+ # source://rbi//lib/rbi/model.rb#686
sig { returns(::String) }
def value; end
end
-# source://rbi//lib/rbi/model.rb#647
+# source://rbi//lib/rbi/model.rb#655
class RBI::KwParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#658
+ # source://rbi//lib/rbi/model.rb#666
sig do
params(
name: ::String,
@@ -853,26 +759,26 @@ class RBI::KwParam < ::RBI::Param
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#669
+ # source://rbi//lib/rbi/model.rb#677
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#496
+ # source://rbi//lib/rbi/printer.rb#498
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#501
+ # source://rbi//lib/rbi/printer.rb#503
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#664
+ # source://rbi//lib/rbi/model.rb#672
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#706
+# source://rbi//lib/rbi/model.rb#714
class RBI::KwRestParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#717
+ # source://rbi//lib/rbi/model.rb#725
sig do
params(
name: ::String,
@@ -883,26 +789,26 @@ class RBI::KwRestParam < ::RBI::Param
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#728
+ # source://rbi//lib/rbi/model.rb#736
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#526
+ # source://rbi//lib/rbi/printer.rb#528
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#531
+ # source://rbi//lib/rbi/printer.rb#533
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#723
+ # source://rbi//lib/rbi/model.rb#731
sig { override.returns(::String) }
def to_s; end
end
# source://rbi//lib/rbi/loc.rb#5
class RBI::Loc
- # source://rbi//lib/rbi/loc.rb#23
+ # source://rbi//lib/rbi/loc.rb#38
sig do
params(
file: T.nilable(::String),
@@ -916,47 +822,47 @@ class RBI::Loc
# @return [Integer, nil]
#
- # source://rbi//lib/rbi/loc.rb#12
+ # source://rbi//lib/rbi/loc.rb#27
def begin_column; end
- # source://rbi//lib/rbi/loc.rb#12
+ # source://rbi//lib/rbi/loc.rb#27
sig { returns(T.nilable(::Integer)) }
def begin_line; end
# @return [Integer, nil]
#
- # source://rbi//lib/rbi/loc.rb#12
+ # source://rbi//lib/rbi/loc.rb#27
def end_column; end
# @return [Integer, nil]
#
- # source://rbi//lib/rbi/loc.rb#12
+ # source://rbi//lib/rbi/loc.rb#27
def end_line; end
- # source://rbi//lib/rbi/loc.rb#9
+ # source://rbi//lib/rbi/loc.rb#24
sig { returns(T.nilable(::String)) }
def file; end
- # source://rbi//lib/rbi/loc.rb#37
+ # source://rbi//lib/rbi/loc.rb#56
sig { returns(T.nilable(::String)) }
def source; end
- # source://rbi//lib/rbi/loc.rb#32
+ # source://rbi//lib/rbi/loc.rb#47
sig { returns(::String) }
def to_s; end
class << self
- # source://rbi//lib/rbi/parser.rb#707
- sig { params(file: ::String, ast_loc: T.any(::Parser::Source::Map, ::Parser::Source::Range)).returns(::RBI::Loc) }
- def from_ast_loc(file, ast_loc); end
+ # source://rbi//lib/rbi/loc.rb#12
+ sig { params(file: ::String, prism_location: ::Prism::Location).returns(::RBI::Loc) }
+ def from_prism(file, prism_location); end
end
end
# A tree that _might_ contain conflicts
#
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#324
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#330
class RBI::MergeTree < ::RBI::Tree
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#338
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#344
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -967,18 +873,18 @@ class RBI::MergeTree < ::RBI::Tree
end
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), conflicts: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#328
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#334
sig { returns(T::Array[::RBI::Rewriters::Merge::Conflict]) }
def conflicts; end
end
# Methods and args
#
-# source://rbi//lib/rbi/model.rb#475
+# source://rbi//lib/rbi/model.rb#483
class RBI::Method < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#505
+ # source://rbi//lib/rbi/model.rb#513
sig do
params(
name: ::String,
@@ -993,88 +899,88 @@ class RBI::Method < ::RBI::NodeWithComments
end
def initialize(name, params: T.unsafe(nil), is_singleton: T.unsafe(nil), visibility: T.unsafe(nil), sigs: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#525
+ # source://rbi//lib/rbi/model.rb#533
sig { params(param: ::RBI::Param).void }
def <<(param); end
- # source://rbi//lib/rbi/printer.rb#382
+ # source://rbi//lib/rbi/printer.rb#384
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#453
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#461
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#530
+ # source://rbi//lib/rbi/model.rb#538
sig { returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/index.rb#119
+ # source://rbi//lib/rbi/index.rb#123
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/printer.rb#435
+ # source://rbi//lib/rbi/printer.rb#437
sig { returns(T::Boolean) }
def inline_params?; end
- # source://rbi//lib/rbi/model.rb#485
+ # source://rbi//lib/rbi/model.rb#493
sig { returns(T::Boolean) }
def is_singleton; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#485
+ # source://rbi//lib/rbi/model.rb#493
def is_singleton=(_arg0); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#461
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#470
sig { override.params(other: ::RBI::Node).void }
def merge_with(other); end
- # source://rbi//lib/rbi/model.rb#479
+ # source://rbi//lib/rbi/model.rb#487
sig { returns(::String) }
def name; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#479
+ # source://rbi//lib/rbi/model.rb#487
def name=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#430
+ # source://rbi//lib/rbi/printer.rb#432
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/model.rb#482
+ # source://rbi//lib/rbi/model.rb#490
sig { returns(T::Array[::RBI::Param]) }
def params; end
- # source://rbi//lib/rbi/model.rb#491
+ # source://rbi//lib/rbi/model.rb#499
sig { returns(T::Array[::RBI::Sig]) }
def sigs; end
# @return [Array]
#
- # source://rbi//lib/rbi/model.rb#491
+ # source://rbi//lib/rbi/model.rb#499
def sigs=(_arg0); end
- # source://rbi//lib/rbi/model.rb#539
+ # source://rbi//lib/rbi/model.rb#547
sig { override.returns(::String) }
def to_s; end
- # source://rbi//lib/rbi/model.rb#488
+ # source://rbi//lib/rbi/model.rb#496
sig { returns(::RBI::Visibility) }
def visibility; end
# @return [Visibility]
#
- # source://rbi//lib/rbi/model.rb#488
+ # source://rbi//lib/rbi/model.rb#496
def visibility=(_arg0); end
end
-# source://rbi//lib/rbi/model.rb#1345
+# source://rbi//lib/rbi/model.rb#1355
class RBI::MixesInClassMethods < ::RBI::Mixin
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1357
+ # source://rbi//lib/rbi/model.rb#1367
sig do
params(
name: ::String,
@@ -1086,15 +992,15 @@ class RBI::MixesInClassMethods < ::RBI::Mixin
end
def initialize(name, *names, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#501
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#511
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/index.rb#149
+ # source://rbi//lib/rbi/index.rb#153
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#1363
+ # source://rbi//lib/rbi/model.rb#1373
sig { override.returns(::String) }
def to_s; end
end
@@ -1103,11 +1009,11 @@ end
#
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#762
+# source://rbi//lib/rbi/model.rb#770
class RBI::Mixin < ::RBI::NodeWithComments
abstract!
- # source://rbi//lib/rbi/model.rb#779
+ # source://rbi//lib/rbi/model.rb#787
sig do
params(
name: ::String,
@@ -1118,27 +1024,22 @@ class RBI::Mixin < ::RBI::NodeWithComments
end
def initialize(name, names, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#556
+ # source://rbi//lib/rbi/printer.rb#558
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#474
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#484
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#769
+ # source://rbi//lib/rbi/model.rb#777
sig { returns(T::Array[::String]) }
def names; end
-
- # @return [Array]
- #
- # source://rbi//lib/rbi/model.rb#769
- def names=(_arg0); end
end
-# source://rbi//lib/rbi/model.rb#186
+# source://rbi//lib/rbi/model.rb#190
class RBI::Module < ::RBI::Scope
- # source://rbi//lib/rbi/model.rb#200
+ # source://rbi//lib/rbi/model.rb#204
sig do
params(
name: ::String,
@@ -1149,24 +1050,24 @@ class RBI::Module < ::RBI::Scope
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#379
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#385
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#207
+ # source://rbi//lib/rbi/model.rb#211
sig { override.returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/model.rb#190
+ # source://rbi//lib/rbi/model.rb#194
sig { returns(::String) }
def name; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#190
+ # source://rbi//lib/rbi/model.rb#194
def name=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#268
+ # source://rbi//lib/rbi/printer.rb#270
sig { override.params(v: ::RBI::Printer).void }
def print_header(v); end
end
@@ -1183,13 +1084,13 @@ class RBI::Node
# @abstract
#
- # source://rbi//lib/rbi/printer.rb#145
+ # source://rbi//lib/rbi/printer.rb#146
sig { abstract.params(v: ::RBI::Printer).void }
def accept_printer(v); end
# Can `self` and `_other` be merged into a single definition?
#
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#283
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#287
sig { params(_other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(_other); end
@@ -1212,19 +1113,19 @@ class RBI::Node
# Merge `self` and `other` into a single definition
#
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#289
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#293
sig { params(other: ::RBI::Node).void }
def merge_with(other); end
- # source://rbi//lib/rbi/printer.rb#177
+ # source://rbi//lib/rbi/printer.rb#179
sig { returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#292
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#296
sig { returns(T.nilable(::RBI::ConflictTree)) }
def parent_conflict_tree; end
- # source://rbi//lib/rbi/model.rb#43
+ # source://rbi//lib/rbi/model.rb#46
sig { returns(T.nilable(::RBI::Scope)) }
def parent_scope; end
@@ -1237,7 +1138,7 @@ class RBI::Node
# source://rbi//lib/rbi/model.rb#12
def parent_tree=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#155
+ # source://rbi//lib/rbi/printer.rb#156
sig do
params(
out: T.any(::IO, ::StringIO),
@@ -1248,54 +1149,54 @@ class RBI::Node
end
def print(out: T.unsafe(nil), indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#168
+ # source://rbi//lib/rbi/printer.rb#169
sig { params(v: ::RBI::Printer).void }
def print_blank_line_before(v); end
- # source://rbi//lib/rbi/model.rb#32
+ # source://rbi//lib/rbi/model.rb#33
sig { params(node: ::RBI::Node).void }
def replace(node); end
- # source://rbi//lib/rbi/printer.rb#161
+ # source://rbi//lib/rbi/printer.rb#162
sig { params(indent: ::Integer, print_locs: T::Boolean, max_line_length: T.nilable(::Integer)).returns(::String) }
def string(indent: T.unsafe(nil), print_locs: T.unsafe(nil), max_line_length: T.unsafe(nil)); end
end
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#79
+# source://rbi//lib/rbi/model.rb#83
class RBI::NodeWithComments < ::RBI::Node
abstract!
- # source://rbi//lib/rbi/model.rb#89
+ # source://rbi//lib/rbi/model.rb#93
sig { params(loc: T.nilable(::RBI::Loc), comments: T::Array[::RBI::Comment]).void }
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#95
+ # source://rbi//lib/rbi/model.rb#99
sig { returns(T::Array[::String]) }
def annotations; end
- # source://rbi//lib/rbi/model.rb#86
+ # source://rbi//lib/rbi/model.rb#90
sig { returns(T::Array[::RBI::Comment]) }
def comments; end
# @return [Array]
#
- # source://rbi//lib/rbi/model.rb#86
+ # source://rbi//lib/rbi/model.rb#90
def comments=(_arg0); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#306
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#311
sig { override.params(other: ::RBI::Node).void }
def merge_with(other); end
- # source://rbi//lib/rbi/printer.rb#186
+ # source://rbi//lib/rbi/printer.rb#188
sig { override.returns(T::Boolean) }
def oneline?; end
end
-# source://rbi//lib/rbi/model.rb#593
+# source://rbi//lib/rbi/model.rb#601
class RBI::OptParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#608
+ # source://rbi//lib/rbi/model.rb#616
sig do
params(
name: ::String,
@@ -1307,50 +1208,50 @@ class RBI::OptParam < ::RBI::Param
end
def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#615
+ # source://rbi//lib/rbi/model.rb#623
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#466
+ # source://rbi//lib/rbi/printer.rb#468
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#471
+ # source://rbi//lib/rbi/printer.rb#473
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#597
+ # source://rbi//lib/rbi/model.rb#605
sig { returns(::String) }
def value; end
end
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#544
+# source://rbi//lib/rbi/model.rb#552
class RBI::Param < ::RBI::NodeWithComments
abstract!
- # source://rbi//lib/rbi/model.rb#560
+ # source://rbi//lib/rbi/model.rb#568
sig { params(name: ::String, loc: T.nilable(::RBI::Loc), comments: T::Array[::RBI::Comment]).void }
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#444
+ # source://rbi//lib/rbi/printer.rb#446
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#457
+ # source://rbi//lib/rbi/printer.rb#459
sig { returns(T::Array[::String]) }
def comments_lines; end
- # source://rbi//lib/rbi/model.rb#551
+ # source://rbi//lib/rbi/model.rb#559
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/printer.rb#449
+ # source://rbi//lib/rbi/printer.rb#451
sig { params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#566
+ # source://rbi//lib/rbi/model.rb#574
sig { override.returns(::String) }
def to_s; end
end
@@ -1368,43 +1269,204 @@ end
# source://rbi//lib/rbi/parser.rb#53
class RBI::Parser
- # source://rbi//lib/rbi/parser.rb#64
- sig { void }
- def initialize; end
-
- # source://rbi//lib/rbi/parser.rb#97
+ # source://rbi//lib/rbi/parser.rb#88
sig { params(path: ::String).returns(::RBI::Tree) }
def parse_file(path); end
- # source://rbi//lib/rbi/parser.rb#86
+ # source://rbi//lib/rbi/parser.rb#83
sig { params(string: ::String).returns(::RBI::Tree) }
def parse_string(string); end
private
- # source://rbi//lib/rbi/parser.rb#104
- sig { params(content: ::String, file: ::String).returns(::RBI::Tree) }
- def parse(content, file:); end
+ # source://rbi//lib/rbi/parser.rb#95
+ sig { params(source: ::String, file: ::String).returns(::RBI::Tree) }
+ def parse(source, file:); end
class << self
- # source://rbi//lib/rbi/parser.rb#75
+ # source://rbi//lib/rbi/parser.rb#65
sig { params(path: ::String).returns(::RBI::Tree) }
def parse_file(path); end
- # source://rbi//lib/rbi/parser.rb#80
+ # source://rbi//lib/rbi/parser.rb#70
sig { params(paths: T::Array[::String]).returns(T::Array[::RBI::Tree]) }
def parse_files(paths); end
- # source://rbi//lib/rbi/parser.rb#70
+ # source://rbi//lib/rbi/parser.rb#60
sig { params(string: ::String).returns(::RBI::Tree) }
def parse_string(string); end
- # source://rbi//lib/rbi/parser.rb#91
+ # source://rbi//lib/rbi/parser.rb#76
sig { params(strings: T::Array[::String]).returns(T::Array[::RBI::Tree]) }
def parse_strings(strings); end
end
end
+# source://rbi//lib/rbi/parser.rb#791
+class RBI::Parser::SigBuilder < ::RBI::Parser::Visitor
+ # source://rbi//lib/rbi/parser.rb#798
+ sig { params(content: ::String, file: ::String).void }
+ def initialize(content, file:); end
+
+ # source://rbi//lib/rbi/parser.rb#795
+ sig { returns(::RBI::Sig) }
+ def current; end
+
+ # source://rbi//lib/rbi/parser.rb#850
+ sig { override.params(node: ::Prism::AssocNode).void }
+ def visit_assoc_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#805
+ sig { override.params(node: ::Prism::CallNode).void }
+ def visit_call_node(node); end
+end
+
+# source://rbi//lib/rbi/parser.rb#153
+class RBI::Parser::TreeBuilder < ::RBI::Parser::Visitor
+ # source://rbi//lib/rbi/parser.rb#163
+ sig { params(source: ::String, comments: T::Array[::Prism::Comment], file: ::String).void }
+ def initialize(source, comments:, file:); end
+
+ # source://rbi//lib/rbi/parser.rb#160
+ sig { returns(T.nilable(::Prism::Node)) }
+ def last_node; end
+
+ # source://rbi//lib/rbi/parser.rb#157
+ sig { returns(::RBI::Tree) }
+ def tree; end
+
+ # source://rbi//lib/rbi/parser.rb#299
+ sig { params(node: ::Prism::CallNode).void }
+ def visit_call_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#176
+ sig { override.params(node: ::Prism::ClassNode).void }
+ def visit_class_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#208
+ sig { params(node: T.any(::Prism::ConstantPathWriteNode, ::Prism::ConstantWriteNode)).void }
+ def visit_constant_assign(node); end
+
+ # source://rbi//lib/rbi/parser.rb#201
+ sig { override.params(node: ::Prism::ConstantPathWriteNode).void }
+ def visit_constant_path_write_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#194
+ sig { override.params(node: ::Prism::ConstantWriteNode).void }
+ def visit_constant_write_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#241
+ sig { override.params(node: ::Prism::DefNode).void }
+ def visit_def_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#255
+ sig { override.params(node: ::Prism::ModuleNode).void }
+ def visit_module_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#272
+ sig { override.params(node: ::Prism::ProgramNode).void }
+ def visit_program_node(node); end
+
+ # source://rbi//lib/rbi/parser.rb#283
+ sig { override.params(node: ::Prism::SingletonClassNode).void }
+ def visit_singleton_class_node(node); end
+
+ private
+
+ # Collect all the remaining comments within a node
+ #
+ # source://rbi//lib/rbi/parser.rb#467
+ sig { params(node: ::Prism::Node).void }
+ def collect_dangling_comments(node); end
+
+ # Collect all the remaining comments after visiting the tree
+ #
+ # source://rbi//lib/rbi/parser.rb#485
+ sig { void }
+ def collect_orphan_comments; end
+
+ # source://rbi//lib/rbi/parser.rb#508
+ sig { returns(::RBI::Tree) }
+ def current_scope; end
+
+ # source://rbi//lib/rbi/parser.rb#513
+ sig { returns(T::Array[::RBI::Sig]) }
+ def current_sigs; end
+
+ # source://rbi//lib/rbi/parser.rb#520
+ sig { returns(T::Array[::RBI::Comment]) }
+ def current_sigs_comments; end
+
+ # source://rbi//lib/rbi/parser.rb#527
+ sig { params(node: ::Prism::Node).returns(T::Array[::RBI::Comment]) }
+ def node_comments(node); end
+
+ # source://rbi//lib/rbi/parser.rb#545
+ sig { params(node: ::Prism::Comment).returns(::RBI::Comment) }
+ def parse_comment(node); end
+
+ # source://rbi//lib/rbi/parser.rb#574
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Array[::RBI::Param]) }
+ def parse_params(node); end
+
+ # source://rbi//lib/rbi/parser.rb#550
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Array[::RBI::Arg]) }
+ def parse_send_args(node); end
+
+ # source://rbi//lib/rbi/parser.rb#648
+ sig { params(node: ::Prism::CallNode).returns(::RBI::Sig) }
+ def parse_sig(node); end
+
+ # source://rbi//lib/rbi/parser.rb#658
+ sig do
+ params(
+ node: T.any(::Prism::ConstantPathWriteNode, ::Prism::ConstantWriteNode)
+ ).returns(T.nilable(::RBI::Struct))
+ end
+ def parse_struct(node); end
+
+ # source://rbi//lib/rbi/parser.rb#708
+ sig { params(send: ::Prism::CallNode).void }
+ def parse_tstruct_field(send); end
+
+ # source://rbi//lib/rbi/parser.rb#745
+ sig { params(name: ::String, node: ::Prism::Node).returns(::RBI::Visibility) }
+ def parse_visibility(name, node); end
+
+ # source://rbi//lib/rbi/parser.rb#759
+ sig { void }
+ def separate_header_comments; end
+
+ # source://rbi//lib/rbi/parser.rb#769
+ sig { void }
+ def set_root_tree_loc; end
+
+ # source://rbi//lib/rbi/parser.rb#783
+ sig { params(node: T.nilable(::Prism::Node)).returns(T::Boolean) }
+ def type_variable_definition?(node); end
+end
+
+# source://rbi//lib/rbi/parser.rb#122
+class RBI::Parser::Visitor < ::Prism::Visitor
+ # source://rbi//lib/rbi/parser.rb#126
+ sig { params(source: ::String, file: ::String).void }
+ def initialize(source, file:); end
+
+ private
+
+ # source://rbi//lib/rbi/parser.rb#136
+ sig { params(node: ::Prism::Node).returns(::RBI::Loc) }
+ def node_loc(node); end
+
+ # source://rbi//lib/rbi/parser.rb#141
+ sig { params(node: T.nilable(::Prism::Node)).returns(T.nilable(::String)) }
+ def node_string(node); end
+
+ # source://rbi//lib/rbi/parser.rb#148
+ sig { params(node: ::Prism::Node).returns(::String) }
+ def node_string!(node); end
+end
+
# source://rbi//lib/rbi/printer.rb#5
class RBI::Printer < ::RBI::Visitor
# source://rbi//lib/rbi/printer.rb#28
@@ -1487,7 +1549,7 @@ class RBI::Printer < ::RBI::Visitor
sig { override.params(node: T.nilable(::RBI::Node)).void }
def visit(node); end
- # source://rbi//lib/rbi/printer.rb#89
+ # source://rbi//lib/rbi/printer.rb#90
sig { override.params(nodes: T::Array[::RBI::Node]).void }
def visit_all(nodes); end
@@ -1496,9 +1558,9 @@ class RBI::Printer < ::RBI::Visitor
def visit_file(file); end
end
-# source://rbi//lib/rbi/model.rb#901
+# source://rbi//lib/rbi/model.rb#909
class RBI::Private < ::RBI::Visibility
- # source://rbi//lib/rbi/model.rb#911
+ # source://rbi//lib/rbi/model.rb#919
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -1509,9 +1571,9 @@ class RBI::Private < ::RBI::Visibility
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
end
-# source://rbi//lib/rbi/model.rb#885
+# source://rbi//lib/rbi/model.rb#893
class RBI::Protected < ::RBI::Visibility
- # source://rbi//lib/rbi/model.rb#895
+ # source://rbi//lib/rbi/model.rb#903
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -1522,9 +1584,9 @@ class RBI::Protected < ::RBI::Visibility
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
end
-# source://rbi//lib/rbi/model.rb#869
+# source://rbi//lib/rbi/model.rb#877
class RBI::Public < ::RBI::Visibility
- # source://rbi//lib/rbi/model.rb#879
+ # source://rbi//lib/rbi/model.rb#887
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -1535,9 +1597,9 @@ class RBI::Public < ::RBI::Visibility
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
end
-# source://rbi//lib/rbi/model.rb#571
+# source://rbi//lib/rbi/model.rb#579
class RBI::ReqParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#582
+ # source://rbi//lib/rbi/model.rb#590
sig do
params(
name: ::String,
@@ -1548,39 +1610,39 @@ class RBI::ReqParam < ::RBI::Param
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#588
+ # source://rbi//lib/rbi/model.rb#596
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
end
-# source://rbi//lib/rbi/model.rb#1368
+# source://rbi//lib/rbi/model.rb#1378
class RBI::RequiresAncestor < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1381
+ # source://rbi//lib/rbi/model.rb#1391
sig { params(name: ::String, loc: T.nilable(::RBI::Loc), comments: T::Array[::RBI::Comment]).void }
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#868
+ # source://rbi//lib/rbi/printer.rb#870
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/index.rb#159
+ # source://rbi//lib/rbi/index.rb#163
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#1372
+ # source://rbi//lib/rbi/model.rb#1382
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/model.rb#1387
+ # source://rbi//lib/rbi/model.rb#1397
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#620
+# source://rbi//lib/rbi/model.rb#628
class RBI::RestParam < ::RBI::Param
- # source://rbi//lib/rbi/model.rb#631
+ # source://rbi//lib/rbi/model.rb#639
sig do
params(
name: ::String,
@@ -1591,19 +1653,19 @@ class RBI::RestParam < ::RBI::Param
end
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#642
+ # source://rbi//lib/rbi/model.rb#650
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#481
+ # source://rbi//lib/rbi/printer.rb#483
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#486
+ # source://rbi//lib/rbi/printer.rb#488
sig { override.params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
- # source://rbi//lib/rbi/model.rb#637
+ # source://rbi//lib/rbi/model.rb#645
sig { override.returns(::String) }
def to_s; end
end
@@ -1652,7 +1714,7 @@ class RBI::Rewriters::Annotate < ::RBI::Visitor
sig { params(node: ::RBI::NodeWithComments).void }
def annotate_node(node); end
- # source://rbi//lib/rbi/rewriters/annotate.rb#37
+ # source://rbi//lib/rbi/rewriters/annotate.rb#38
sig { params(node: ::RBI::Node).returns(T::Boolean) }
def root?(node); end
end
@@ -1717,20 +1779,20 @@ end
#
# source://rbi//lib/rbi/rewriters/merge_trees.rb#39
class RBI::Rewriters::Merge
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#66
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#70
sig { params(left_name: ::String, right_name: ::String, keep: ::RBI::Rewriters::Merge::Keep).void }
def initialize(left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#75
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#79
sig { params(tree: ::RBI::Tree).void }
def merge(tree); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#63
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#67
sig { returns(::RBI::MergeTree) }
def tree; end
class << self
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#51
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#54
sig do
params(
left: ::RBI::Tree,
@@ -1746,19 +1808,19 @@ end
# Used for logging / error displaying purpose
#
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#82
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#86
class RBI::Rewriters::Merge::Conflict < ::T::Struct
const :left, ::RBI::Node
const :right, ::RBI::Node
const :left_name, ::String
const :right_name, ::String
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#91
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#95
sig { returns(::String) }
def to_s; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1794,19 +1856,19 @@ end
# end
# ~~~
#
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#241
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#245
class RBI::Rewriters::Merge::ConflictTreeMerger < ::RBI::Visitor
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#243
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#247
sig { override.params(node: T.nilable(::RBI::Node)).void }
def visit(node); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#248
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#252
sig { override.params(nodes: T::Array[::RBI::Node]).void }
def visit_all(nodes); end
private
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#269
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#273
sig { params(left: ::RBI::Tree, right: ::RBI::Tree).void }
def merge_conflict_trees(left, right); end
end
@@ -1820,9 +1882,9 @@ class RBI::Rewriters::Merge::Keep < ::T::Enum
end
end
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#96
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#100
class RBI::Rewriters::Merge::TreeMerger < ::RBI::Visitor
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#103
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#107
sig do
params(
output: ::RBI::Tree,
@@ -1833,33 +1895,33 @@ class RBI::Rewriters::Merge::TreeMerger < ::RBI::Visitor
end
def initialize(output, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#100
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#104
sig { returns(T::Array[::RBI::Rewriters::Merge::Conflict]) }
def conflicts; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#115
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#119
sig { override.params(node: T.nilable(::RBI::Node)).void }
def visit(node); end
private
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#164
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#168
sig { returns(::RBI::Tree) }
def current_scope; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#181
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#185
sig { params(left: ::RBI::Scope, right: ::RBI::Scope).void }
def make_conflict_scope(left, right); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#188
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#192
sig { params(left: ::RBI::Node, right: ::RBI::Node).void }
def make_conflict_tree(left, right); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#169
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#173
sig { params(node: ::RBI::Node).returns(T.nilable(::RBI::Node)) }
def previous_definition(node); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#200
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#204
sig { params(left: ::RBI::Scope, right: ::RBI::Scope).returns(::RBI::Scope) }
def replace_scope_header(left, right); end
end
@@ -1923,38 +1985,38 @@ end
#
# source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#48
class RBI::Rewriters::RemoveKnownDefinitions < ::RBI::Visitor
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#67
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#55
sig { params(index: ::RBI::Index).void }
def initialize(index); end
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#64
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#52
sig { returns(T::Array[::RBI::Rewriters::RemoveKnownDefinitions::Operation]) }
def operations; end
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#79
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#83
sig { override.params(node: T.nilable(::RBI::Node)).void }
def visit(node); end
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#74
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#78
sig { params(nodes: T::Array[::RBI::Node]).void }
def visit_all(nodes); end
private
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#107
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#111
sig { params(node: ::RBI::Node, previous: ::RBI::Node).returns(T::Boolean) }
def can_delete_node?(node, previous); end
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#125
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#129
sig { params(node: ::RBI::Node, previous: ::RBI::Node).void }
def delete_node(node, previous); end
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#98
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#102
sig { params(node: ::RBI::Indexable).returns(T.nilable(::RBI::Node)) }
def previous_definition_for(node); end
class << self
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#57
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#70
sig do
params(
tree: ::RBI::Tree,
@@ -1965,17 +2027,17 @@ class RBI::Rewriters::RemoveKnownDefinitions < ::RBI::Visitor
end
end
-# source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#130
+# source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#134
class RBI::Rewriters::RemoveKnownDefinitions::Operation < ::T::Struct
const :deleted_node, ::RBI::Node
const :duplicate_of, ::RBI::Node
- # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#137
+ # source://rbi//lib/rbi/rewriters/remove_known_definitions.rb#141
sig { returns(::String) }
def to_s; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1988,19 +2050,19 @@ class RBI::Rewriters::SortNodes < ::RBI::Visitor
private
- # source://rbi//lib/rbi/rewriters/sort_nodes.rb#61
+ # source://rbi//lib/rbi/rewriters/sort_nodes.rb#73
sig { params(kind: ::RBI::Group::Kind).returns(::Integer) }
def group_rank(kind); end
- # source://rbi//lib/rbi/rewriters/sort_nodes.rb#82
+ # source://rbi//lib/rbi/rewriters/sort_nodes.rb#94
sig { params(node: ::RBI::Node).returns(T.nilable(::String)) }
def node_name(node); end
- # source://rbi//lib/rbi/rewriters/sort_nodes.rb#33
+ # source://rbi//lib/rbi/rewriters/sort_nodes.rb#45
sig { params(node: ::RBI::Node).returns(::Integer) }
def node_rank(node); end
- # source://rbi//lib/rbi/rewriters/sort_nodes.rb#94
+ # source://rbi//lib/rbi/rewriters/sort_nodes.rb#106
sig { params(node: ::RBI::Node).void }
def sort_node_names!(node); end
end
@@ -2009,43 +2071,43 @@ end
#
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#172
+# source://rbi//lib/rbi/model.rb#176
class RBI::Scope < ::RBI::Tree
include ::RBI::Indexable
abstract!
- # source://rbi//lib/rbi/printer.rb#240
+ # source://rbi//lib/rbi/printer.rb#242
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
# Duplicate `self` scope without its body
#
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#350
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#356
sig { returns(T.self_type) }
def dup_empty; end
# @abstract
#
- # source://rbi//lib/rbi/model.rb#178
+ # source://rbi//lib/rbi/model.rb#182
sig { abstract.returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/index.rb#89
+ # source://rbi//lib/rbi/index.rb#93
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/printer.rb#254
+ # source://rbi//lib/rbi/printer.rb#256
sig { params(v: ::RBI::Printer).void }
def print_body(v); end
# @abstract
#
- # source://rbi//lib/rbi/printer.rb#251
+ # source://rbi//lib/rbi/printer.rb#253
sig { abstract.params(v: ::RBI::Printer).void }
def print_header(v); end
- # source://rbi//lib/rbi/model.rb#181
+ # source://rbi//lib/rbi/model.rb#185
sig { override.returns(::String) }
def to_s; end
end
@@ -2063,37 +2125,37 @@ end
# end
# ~~~
#
-# source://rbi//lib/rbi/rewriters/merge_trees.rb#617
+# source://rbi//lib/rbi/rewriters/merge_trees.rb#628
class RBI::ScopeConflict < ::RBI::Tree
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#631
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#642
sig { params(left: ::RBI::Scope, right: ::RBI::Scope, left_name: ::String, right_name: ::String).void }
def initialize(left:, right:, left_name: T.unsafe(nil), right_name: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#640
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#651
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#621
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#632
sig { returns(::RBI::Scope) }
def left; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#656
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#667
sig { override.returns(T::Boolean) }
def oneline?; end
# @return [Scope]
#
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#621
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#632
def right; end
end
# Sends
#
-# source://rbi//lib/rbi/model.rb#919
+# source://rbi//lib/rbi/model.rb#927
class RBI::Send < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#937
+ # source://rbi//lib/rbi/model.rb#945
sig do
params(
method: ::String,
@@ -2105,44 +2167,44 @@ class RBI::Send < ::RBI::NodeWithComments
end
def initialize(method, args = T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#945
+ # source://rbi//lib/rbi/model.rb#953
sig { params(arg: ::RBI::Arg).void }
def <<(arg); end
- # source://rbi//lib/rbi/model.rb#950
+ # source://rbi//lib/rbi/model.rb#958
sig { params(other: T.nilable(::Object)).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#590
+ # source://rbi//lib/rbi/printer.rb#592
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#926
+ # source://rbi//lib/rbi/model.rb#934
sig { returns(T::Array[::RBI::Arg]) }
def args; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#519
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#529
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/index.rb#179
+ # source://rbi//lib/rbi/index.rb#193
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#923
+ # source://rbi//lib/rbi/model.rb#931
sig { returns(::String) }
def method; end
- # source://rbi//lib/rbi/model.rb#955
+ # source://rbi//lib/rbi/model.rb#963
sig { returns(::String) }
def to_s; end
end
# Sorbet's sigs
#
-# source://rbi//lib/rbi/model.rb#1019
+# source://rbi//lib/rbi/model.rb#1027
class RBI::Sig < ::RBI::Node
- # source://rbi//lib/rbi/model.rb#1051
+ # source://rbi//lib/rbi/model.rb#1059
sig do
params(
params: T::Array[::RBI::SigParam],
@@ -2159,139 +2221,109 @@ class RBI::Sig < ::RBI::Node
end
def initialize(params: T.unsafe(nil), return_type: T.unsafe(nil), is_abstract: T.unsafe(nil), is_override: T.unsafe(nil), is_overridable: T.unsafe(nil), is_final: T.unsafe(nil), type_params: T.unsafe(nil), checked: T.unsafe(nil), loc: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#1076
+ # source://rbi//lib/rbi/model.rb#1084
sig { params(param: ::RBI::SigParam).void }
def <<(param); end
- # source://rbi//lib/rbi/model.rb#1081
+ # source://rbi//lib/rbi/model.rb#1089
sig { params(other: ::Object).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#631
+ # source://rbi//lib/rbi/printer.rb#633
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#1035
+ # source://rbi//lib/rbi/model.rb#1043
sig { returns(T.nilable(::Symbol)) }
def checked; end
# @return [Symbol, nil]
#
- # source://rbi//lib/rbi/model.rb#1035
+ # source://rbi//lib/rbi/model.rb#1043
def checked=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#654
+ # source://rbi//lib/rbi/printer.rb#656
sig { returns(T::Boolean) }
def inline_params?; end
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
sig { returns(T::Boolean) }
def is_abstract; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_abstract=(_arg0); end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_final; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_final=(_arg0); end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_overridable; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_overridable=(_arg0); end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_override; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#1029
+ # source://rbi//lib/rbi/model.rb#1037
def is_override=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#649
+ # source://rbi//lib/rbi/printer.rb#651
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/model.rb#1023
+ # source://rbi//lib/rbi/model.rb#1031
sig { returns(T::Array[::RBI::SigParam]) }
def params; end
- # source://rbi//lib/rbi/model.rb#1026
+ # source://rbi//lib/rbi/model.rb#1034
sig { returns(T.nilable(::String)) }
def return_type; end
# @return [String, nil]
#
- # source://rbi//lib/rbi/model.rb#1026
+ # source://rbi//lib/rbi/model.rb#1034
def return_type=(_arg0); end
- # source://rbi//lib/rbi/model.rb#1032
+ # source://rbi//lib/rbi/model.rb#1040
sig { returns(T::Array[::String]) }
def type_params; end
private
- # source://rbi//lib/rbi/printer.rb#696
+ # source://rbi//lib/rbi/printer.rb#698
sig { params(v: ::RBI::Printer).void }
def print_as_block(v); end
- # source://rbi//lib/rbi/printer.rb#672
+ # source://rbi//lib/rbi/printer.rb#674
sig { params(v: ::RBI::Printer).void }
def print_as_line(v); end
- # source://rbi//lib/rbi/printer.rb#661
+ # source://rbi//lib/rbi/printer.rb#663
sig { returns(T::Array[::String]) }
def sig_modifiers; end
end
-# source://rbi//lib/rbi/parser.rb#635
-class RBI::SigBuilder < ::RBI::ASTVisitor
- # source://rbi//lib/rbi/parser.rb#649
- sig { void }
- def initialize; end
-
- # source://rbi//lib/rbi/parser.rb#646
- sig { returns(::RBI::Sig) }
- def current; end
-
- # @return [Sig]
- #
- # source://rbi//lib/rbi/parser.rb#646
- def current=(_arg0); end
-
- # source://rbi//lib/rbi/parser.rb#655
- sig { override.params(node: T.nilable(::AST::Node)).void }
- def visit(node); end
-
- # source://rbi//lib/rbi/parser.rb#664
- sig { params(node: ::AST::Node).void }
- def visit_send(node); end
-
- class << self
- # source://rbi//lib/rbi/parser.rb#639
- sig { params(node: ::AST::Node).returns(::RBI::Sig) }
- def build(node); end
- end
-end
-
-# source://rbi//lib/rbi/model.rb#1089
+# source://rbi//lib/rbi/model.rb#1098
class RBI::SigParam < ::RBI::NodeWithComments
- # source://rbi//lib/rbi/model.rb#1104
+ # source://rbi//lib/rbi/model.rb#1113
sig do
params(
name: ::String,
@@ -2303,35 +2335,35 @@ class RBI::SigParam < ::RBI::NodeWithComments
end
def initialize(name, type, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#1112
+ # source://rbi//lib/rbi/model.rb#1121
sig { params(other: ::Object).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#749
+ # source://rbi//lib/rbi/printer.rb#751
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#762
+ # source://rbi//lib/rbi/printer.rb#764
sig { returns(T::Array[::String]) }
def comments_lines; end
- # source://rbi//lib/rbi/model.rb#1093
+ # source://rbi//lib/rbi/model.rb#1102
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/printer.rb#754
+ # source://rbi//lib/rbi/printer.rb#756
sig { params(v: ::RBI::Printer, last: T::Boolean).void }
def print_comment_leading_space(v, last:); end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#1093
+ # source://rbi//lib/rbi/model.rb#1102
def type; end
end
-# source://rbi//lib/rbi/model.rb#245
+# source://rbi//lib/rbi/model.rb#251
class RBI::SingletonClass < ::RBI::Scope
- # source://rbi//lib/rbi/model.rb#255
+ # source://rbi//lib/rbi/model.rb#261
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -2341,18 +2373,18 @@ class RBI::SingletonClass < ::RBI::Scope
end
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#261
+ # source://rbi//lib/rbi/model.rb#267
sig { override.returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/printer.rb#319
+ # source://rbi//lib/rbi/printer.rb#321
sig { override.params(v: ::RBI::Printer).void }
def print_header(v); end
end
-# source://rbi//lib/rbi/model.rb#266
+# source://rbi//lib/rbi/model.rb#272
class RBI::Struct < ::RBI::Scope
- # source://rbi//lib/rbi/model.rb#288
+ # source://rbi//lib/rbi/model.rb#294
sig do
params(
name: ::String,
@@ -2365,51 +2397,51 @@ class RBI::Struct < ::RBI::Scope
end
def initialize(name, members: T.unsafe(nil), keyword_init: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#388
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#394
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#297
+ # source://rbi//lib/rbi/model.rb#303
sig { override.returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/model.rb#276
+ # source://rbi//lib/rbi/model.rb#282
sig { returns(T::Boolean) }
def keyword_init; end
# @return [Boolean]
#
- # source://rbi//lib/rbi/model.rb#276
+ # source://rbi//lib/rbi/model.rb#282
def keyword_init=(_arg0); end
- # source://rbi//lib/rbi/model.rb#273
+ # source://rbi//lib/rbi/model.rb#279
sig { returns(T::Array[::Symbol]) }
def members; end
# @return [Array]
#
- # source://rbi//lib/rbi/model.rb#273
+ # source://rbi//lib/rbi/model.rb#279
def members=(_arg0); end
- # source://rbi//lib/rbi/model.rb#270
+ # source://rbi//lib/rbi/model.rb#276
sig { returns(::String) }
def name; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#270
+ # source://rbi//lib/rbi/model.rb#276
def name=(_arg0); end
- # source://rbi//lib/rbi/printer.rb#298
+ # source://rbi//lib/rbi/printer.rb#300
sig { override.params(v: ::RBI::Printer).void }
def print_header(v); end
end
# Sorbet's T::Enum
#
-# source://rbi//lib/rbi/model.rb#1230
+# source://rbi//lib/rbi/model.rb#1239
class RBI::TEnum < ::RBI::Class
- # source://rbi//lib/rbi/model.rb#1241
+ # source://rbi//lib/rbi/model.rb#1250
sig do
params(
name: ::String,
@@ -2421,11 +2453,11 @@ class RBI::TEnum < ::RBI::Class
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
end
-# source://rbi//lib/rbi/model.rb#1247
+# source://rbi//lib/rbi/model.rb#1256
class RBI::TEnumBlock < ::RBI::NodeWithComments
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1261
+ # source://rbi//lib/rbi/model.rb#1270
sig do
params(
names: T::Array[::String],
@@ -2436,40 +2468,40 @@ class RBI::TEnumBlock < ::RBI::NodeWithComments
end
def initialize(names = T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#1273
+ # source://rbi//lib/rbi/model.rb#1282
sig { params(name: ::String).void }
def <<(name); end
- # source://rbi//lib/rbi/printer.rb#793
+ # source://rbi//lib/rbi/printer.rb#795
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#1268
+ # source://rbi//lib/rbi/model.rb#1277
sig { returns(T::Boolean) }
def empty?; end
- # source://rbi//lib/rbi/index.rb#209
+ # source://rbi//lib/rbi/index.rb#223
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#546
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#556
sig { override.params(other: ::RBI::Node).void }
def merge_with(other); end
- # source://rbi//lib/rbi/model.rb#1251
+ # source://rbi//lib/rbi/model.rb#1260
sig { returns(T::Array[::String]) }
def names; end
- # source://rbi//lib/rbi/model.rb#1278
+ # source://rbi//lib/rbi/model.rb#1287
sig { override.returns(::String) }
def to_s; end
end
# Sorbet's T::Struct
#
-# source://rbi//lib/rbi/model.rb#1119
+# source://rbi//lib/rbi/model.rb#1128
class RBI::TStruct < ::RBI::Class
- # source://rbi//lib/rbi/model.rb#1130
+ # source://rbi//lib/rbi/model.rb#1139
sig do
params(
name: ::String,
@@ -2481,11 +2513,11 @@ class RBI::TStruct < ::RBI::Class
def initialize(name, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
end
-# source://rbi//lib/rbi/model.rb#1168
+# source://rbi//lib/rbi/model.rb#1177
class RBI::TStructConst < ::RBI::TStructField
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1181
+ # source://rbi//lib/rbi/model.rb#1190
sig do
params(
name: ::String,
@@ -2498,30 +2530,30 @@ class RBI::TStructConst < ::RBI::TStructField
end
def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#537
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#547
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#1187
+ # source://rbi//lib/rbi/model.rb#1196
sig { override.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/index.rb#189
+ # source://rbi//lib/rbi/index.rb#203
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#1193
+ # source://rbi//lib/rbi/model.rb#1202
sig { override.returns(::String) }
def to_s; end
end
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#1136
+# source://rbi//lib/rbi/model.rb#1145
class RBI::TStructField < ::RBI::NodeWithComments
abstract!
- # source://rbi//lib/rbi/model.rb#1157
+ # source://rbi//lib/rbi/model.rb#1166
sig do
params(
name: ::String,
@@ -2533,54 +2565,54 @@ class RBI::TStructField < ::RBI::NodeWithComments
end
def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/printer.rb#771
+ # source://rbi//lib/rbi/printer.rb#773
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#528
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#538
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#1146
+ # source://rbi//lib/rbi/model.rb#1155
sig { returns(T.nilable(::String)) }
def default; end
# @return [String, nil]
#
- # source://rbi//lib/rbi/model.rb#1146
+ # source://rbi//lib/rbi/model.rb#1155
def default=(_arg0); end
# @abstract
#
- # source://rbi//lib/rbi/model.rb#1165
+ # source://rbi//lib/rbi/model.rb#1174
sig { abstract.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/model.rb#1143
+ # source://rbi//lib/rbi/model.rb#1152
sig { returns(::String) }
def name; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#1143
+ # source://rbi//lib/rbi/model.rb#1152
def name=(_arg0); end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#1143
+ # source://rbi//lib/rbi/model.rb#1152
def type; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#1143
+ # source://rbi//lib/rbi/model.rb#1152
def type=(_arg0); end
end
-# source://rbi//lib/rbi/model.rb#1198
+# source://rbi//lib/rbi/model.rb#1207
class RBI::TStructProp < ::RBI::TStructField
include ::RBI::Indexable
- # source://rbi//lib/rbi/model.rb#1211
+ # source://rbi//lib/rbi/model.rb#1220
sig do
params(
name: ::String,
@@ -2593,26 +2625,26 @@ class RBI::TStructProp < ::RBI::TStructField
end
def initialize(name, type, default: T.unsafe(nil), loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#559
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#570
sig { override.params(other: ::RBI::Node).returns(T::Boolean) }
def compatible_with?(other); end
- # source://rbi//lib/rbi/model.rb#1217
+ # source://rbi//lib/rbi/model.rb#1226
sig { override.returns(T::Array[::String]) }
def fully_qualified_names; end
- # source://rbi//lib/rbi/index.rb#199
+ # source://rbi//lib/rbi/index.rb#213
sig { override.returns(T::Array[::String]) }
def index_ids; end
- # source://rbi//lib/rbi/model.rb#1223
+ # source://rbi//lib/rbi/model.rb#1232
sig { override.returns(::String) }
def to_s; end
end
-# source://rbi//lib/rbi/model.rb#102
+# source://rbi//lib/rbi/model.rb#106
class RBI::Tree < ::RBI::NodeWithComments
- # source://rbi//lib/rbi/model.rb#115
+ # source://rbi//lib/rbi/model.rb#119
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -2622,11 +2654,11 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/model.rb#122
+ # source://rbi//lib/rbi/model.rb#126
sig { params(node: ::RBI::Node).void }
def <<(node); end
- # source://rbi//lib/rbi/printer.rb#224
+ # source://rbi//lib/rbi/printer.rb#226
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
@@ -2634,11 +2666,11 @@ class RBI::Tree < ::RBI::NodeWithComments
sig { params(with_todo_comment: T::Boolean).void }
def add_sig_templates!(with_todo_comment: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/annotate.rb#48
+ # source://rbi//lib/rbi/rewriters/annotate.rb#49
sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void }
def annotate!(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#38
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#38
sig do
params(
name: ::String,
@@ -2648,19 +2680,19 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def create_class(name, superclass_name: T.unsafe(nil), &block); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#45
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#45
sig { params(name: ::String, value: ::String).void }
def create_constant(name, value:); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#55
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#55
sig { params(name: ::String).void }
def create_extend(name); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#50
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#50
sig { params(name: ::String).void }
def create_include(name); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#89
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#89
sig do
params(
name: ::String,
@@ -2673,19 +2705,19 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def create_method(name, parameters: T.unsafe(nil), return_type: T.unsafe(nil), class_method: T.unsafe(nil), visibility: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#60
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#60
sig { params(name: ::String).void }
def create_mixes_in_class_methods(name); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#25
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#25
sig { params(name: ::String, block: T.nilable(T.proc.params(scope: ::RBI::Scope).void)).returns(::RBI::Scope) }
def create_module(name, &block); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#9
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#9
sig { params(constant: ::Module, block: T.nilable(T.proc.params(scope: ::RBI::Scope).void)).returns(::RBI::Scope) }
def create_path(constant, &block); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#74
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#74
sig do
params(
name: ::String,
@@ -2698,11 +2730,11 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def create_type_variable(name, type:, variance: T.unsafe(nil), fixed: T.unsafe(nil), upper: T.unsafe(nil), lower: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/deannotate.rb#40
+ # source://rbi//lib/rbi/rewriters/deannotate.rb#41
sig { params(annotation: ::String).void }
def deannotate!(annotation); end
- # source://rbi//lib/rbi/model.rb#128
+ # source://rbi//lib/rbi/model.rb#132
sig { returns(T::Boolean) }
def empty?; end
@@ -2710,11 +2742,11 @@ class RBI::Tree < ::RBI::NodeWithComments
sig { void }
def group_nodes!; end
- # source://rbi//lib/rbi/index.rb#64
+ # source://rbi//lib/rbi/index.rb#68
sig { returns(::RBI::Index) }
def index; end
- # source://rbi//lib/rbi/rewriters/merge_trees.rb#318
+ # source://rbi//lib/rbi/rewriters/merge_trees.rb#324
sig do
params(
other: ::RBI::Tree,
@@ -2725,155 +2757,42 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def merge(other, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
- # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#45
+ # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#46
sig { void }
def nest_non_public_methods!; end
- # source://rbi//lib/rbi/rewriters/nest_singleton_methods.rb#35
+ # source://rbi//lib/rbi/rewriters/nest_singleton_methods.rb#36
sig { void }
def nest_singleton_methods!; end
- # source://rbi//lib/rbi/model.rb#106
+ # source://rbi//lib/rbi/model.rb#110
sig { returns(T::Array[::RBI::Node]) }
def nodes; end
- # source://rbi//lib/rbi/printer.rb#231
+ # source://rbi//lib/rbi/printer.rb#233
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/rewriters/sort_nodes.rb#107
+ # source://rbi//lib/rbi/rewriters/sort_nodes.rb#119
sig { void }
def sort_nodes!; end
private
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#116
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#116
sig { params(node: ::RBI::Node).returns(::RBI::Node) }
def create_node(node); end
- # source://tapioca/0.11.7/lib/tapioca/rbi_ext/model.rb#111
+ # source://tapioca/0.11.17/lib/tapioca/rbi_ext/model.rb#111
sig { returns(T::Hash[::String, ::RBI::Node]) }
def nodes_cache; end
end
-# source://rbi//lib/rbi/parser.rb#156
-class RBI::TreeBuilder < ::RBI::ASTVisitor
- # source://rbi//lib/rbi/parser.rb#172
- sig do
- params(
- file: ::String,
- comments: T::Array[::Parser::Source::Comment],
- nodes_comments_assoc: T::Hash[::Parser::Source::Map, T::Array[::Parser::Source::Comment]]
- ).void
- end
- def initialize(file:, comments: T.unsafe(nil), nodes_comments_assoc: T.unsafe(nil)); end
-
- # source://rbi//lib/rbi/parser.rb#163
- sig { returns(T.nilable(::AST::Node)) }
- def last_node; end
-
- # source://rbi//lib/rbi/parser.rb#187
- sig { void }
- def post_process; end
-
- # source://rbi//lib/rbi/parser.rb#160
- sig { returns(::RBI::Tree) }
- def tree; end
-
- # source://rbi//lib/rbi/parser.rb#193
- sig { override.params(node: T.nilable(::Object)).void }
- def visit(node); end
-
- private
-
- # source://rbi//lib/rbi/parser.rb#546
- sig { void }
- def assoc_dangling_comments; end
-
- # source://rbi//lib/rbi/parser.rb#527
- sig { returns(::RBI::Tree) }
- def current_scope; end
-
- # source://rbi//lib/rbi/parser.rb#532
- sig { returns(T::Array[::RBI::Sig]) }
- def current_sigs; end
-
- # source://rbi//lib/rbi/parser.rb#539
- sig { returns(T::Array[::RBI::Comment]) }
- def current_sigs_comments; end
-
- # source://rbi//lib/rbi/parser.rb#516
- sig { params(node: ::AST::Node).returns(T::Array[::RBI::Comment]) }
- def node_comments(node); end
-
- # source://rbi//lib/rbi/parser.rb#511
- sig { params(node: ::AST::Node).returns(::RBI::Loc) }
- def node_loc(node); end
-
- # source://rbi//lib/rbi/parser.rb#402
- sig { params(node: ::AST::Node).returns(T.nilable(::RBI::Node)) }
- def parse_block(node); end
-
- # source://rbi//lib/rbi/parser.rb#249
- sig { params(node: ::AST::Node).returns(::RBI::Node) }
- def parse_const_assign(node); end
-
- # source://rbi//lib/rbi/parser.rb#263
- sig { params(node: ::AST::Node).returns(::RBI::Method) }
- def parse_def(node); end
-
- # source://rbi//lib/rbi/parser.rb#486
- sig { params(node: ::AST::Node).returns(::RBI::TEnumBlock) }
- def parse_enum(node); end
-
- # source://rbi//lib/rbi/parser.rb#290
- sig { params(node: ::AST::Node).returns(::RBI::Param) }
- def parse_param(node); end
-
- # source://rbi//lib/rbi/parser.rb#503
- sig { params(node: ::AST::Node).returns(::RBI::RequiresAncestor) }
- def parse_requires_ancestor(node); end
-
- # source://rbi//lib/rbi/parser.rb#229
- sig { params(node: ::AST::Node).returns(::RBI::Scope) }
- def parse_scope(node); end
-
- # source://rbi//lib/rbi/parser.rb#318
- sig { params(node: ::AST::Node).returns(T.nilable(::RBI::Node)) }
- def parse_send(node); end
-
- # source://rbi//lib/rbi/parser.rb#385
- sig { params(node: ::AST::Node).returns(T::Array[::RBI::Arg]) }
- def parse_send_args(node); end
-
- # source://rbi//lib/rbi/parser.rb#479
- sig { params(node: ::AST::Node).returns(::RBI::Sig) }
- def parse_sig(node); end
-
- # source://rbi//lib/rbi/parser.rb#424
- sig { params(node: ::AST::Node).returns(::RBI::Struct) }
- def parse_struct(node); end
-
- # source://rbi//lib/rbi/parser.rb#463
- sig { params(node: ::AST::Node).returns([::String, ::String, T.nilable(::String)]) }
- def parse_tstruct_prop(node); end
-
- # source://rbi//lib/rbi/parser.rb#564
- sig { void }
- def separate_header_comments; end
-
- # source://rbi//lib/rbi/parser.rb#586
- sig { void }
- def set_root_tree_loc; end
-
- # source://rbi//lib/rbi/parser.rb#418
- sig { params(node: ::AST::Node).returns(T::Boolean) }
- def struct_definition?(node); end
-end
-
-# source://rbi//lib/rbi/model.rb#1311
+# source://rbi//lib/rbi/model.rb#1320
class RBI::TypeMember < ::RBI::NodeWithComments
- # source://rbi//lib/rbi/model.rb#1326
+ include ::RBI::Indexable
+
+ # source://rbi//lib/rbi/model.rb#1335
sig do
params(
name: ::String,
@@ -2885,25 +2804,29 @@ class RBI::TypeMember < ::RBI::NodeWithComments
end
def initialize(name, value, loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi//lib/rbi/printer.rb#810
+ # source://rbi//lib/rbi/printer.rb#812
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#1334
+ # source://rbi//lib/rbi/model.rb#1343
sig { returns(::String) }
def fully_qualified_name; end
- # source://rbi//lib/rbi/model.rb#1315
+ # source://rbi//lib/rbi/index.rb#183
+ sig { override.returns(T::Array[::String]) }
+ def index_ids; end
+
+ # source://rbi//lib/rbi/model.rb#1324
sig { returns(::String) }
def name; end
- # source://rbi//lib/rbi/model.rb#1340
+ # source://rbi//lib/rbi/model.rb#1350
sig { override.returns(::String) }
def to_s; end
# @return [String]
#
- # source://rbi//lib/rbi/model.rb#1315
+ # source://rbi//lib/rbi/model.rb#1324
def value; end
end
@@ -2929,54 +2852,54 @@ RBI::VERSION = T.let(T.unsafe(nil), String)
#
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://rbi//lib/rbi/model.rb#833
+# source://rbi//lib/rbi/model.rb#841
class RBI::Visibility < ::RBI::NodeWithComments
abstract!
- # source://rbi//lib/rbi/model.rb#843
+ # source://rbi//lib/rbi/model.rb#851
sig { params(visibility: ::Symbol, loc: T.nilable(::RBI::Loc), comments: T::Array[::RBI::Comment]).void }
def initialize(visibility, loc: T.unsafe(nil), comments: T.unsafe(nil)); end
- # source://rbi//lib/rbi/model.rb#849
+ # source://rbi//lib/rbi/model.rb#857
sig { params(other: ::RBI::Visibility).returns(T::Boolean) }
def ==(other); end
- # source://rbi//lib/rbi/printer.rb#577
+ # source://rbi//lib/rbi/printer.rb#579
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/model.rb#864
+ # source://rbi//lib/rbi/model.rb#872
sig { returns(T::Boolean) }
def private?; end
- # source://rbi//lib/rbi/model.rb#859
+ # source://rbi//lib/rbi/model.rb#867
sig { returns(T::Boolean) }
def protected?; end
- # source://rbi//lib/rbi/model.rb#854
+ # source://rbi//lib/rbi/model.rb#862
sig { returns(T::Boolean) }
def public?; end
- # source://rbi//lib/rbi/model.rb#840
+ # source://rbi//lib/rbi/model.rb#848
sig { returns(::Symbol) }
def visibility; end
end
-# source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#51
+# source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#52
class RBI::VisibilityGroup < ::RBI::Tree
- # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#58
+ # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#59
sig { params(visibility: ::RBI::Visibility).void }
def initialize(visibility); end
- # source://rbi//lib/rbi/printer.rb#846
+ # source://rbi//lib/rbi/printer.rb#848
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi//lib/rbi/printer.rb#859
+ # source://rbi//lib/rbi/printer.rb#861
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#55
+ # source://rbi//lib/rbi/rewriters/nest_non_public_methods.rb#56
sig { returns(::RBI::Visibility) }
def visibility; end
end
diff --git a/sorbet/rbi/gems/regexp_parser@2.8.2.rbi b/sorbet/rbi/gems/regexp_parser@2.9.0.rbi
similarity index 96%
rename from sorbet/rbi/gems/regexp_parser@2.8.2.rbi
rename to sorbet/rbi/gems/regexp_parser@2.9.0.rbi
index 80a6a1f..34ad4f2 100644
--- a/sorbet/rbi/gems/regexp_parser@2.8.2.rbi
+++ b/sorbet/rbi/gems/regexp_parser@2.9.0.rbi
@@ -94,6 +94,9 @@ end
class Regexp::Expression::Anchor::NonWordBoundary < ::Regexp::Expression::Anchor::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/human_name.rb#17
def human_name; end
+
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#13
+ def negative?; end
end
# source://regexp_parser//lib/regexp_parser/expression/classes/anchor.rb#13
@@ -127,12 +130,18 @@ end
class Regexp::Expression::Assertion::NegativeLookahead < ::Regexp::Expression::Assertion::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/human_name.rb#21
def human_name; end
+
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#14
+ def negative?; end
end
# source://regexp_parser//lib/regexp_parser/expression/classes/group.rb#71
class Regexp::Expression::Assertion::NegativeLookbehind < ::Regexp::Expression::Assertion::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/human_name.rb#22
def human_name; end
+
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#15
+ def negative?; end
end
# alias for symmetry between token symbol and Expression class name
@@ -574,10 +583,10 @@ end
class Regexp::Expression::CharacterSet < ::Regexp::Expression::Subexpression
# @return [CharacterSet] a new instance of CharacterSet
#
- # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#9
+ # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#6
def initialize(token, options = T.unsafe(nil)); end
- # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#19
+ # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#16
def close; end
# Returns the value of attribute closed.
@@ -600,14 +609,9 @@ class Regexp::Expression::CharacterSet < ::Regexp::Expression::Subexpression
# source://regexp_parser//lib/regexp_parser/expression/methods/match_length.rb#98
def match_length; end
- # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#15
+ # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#12
def negate; end
- # Returns the value of attribute negative.
- #
- # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#3
- def negated?; end
-
# Returns the value of attribute negative.
#
# source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#3
@@ -620,9 +624,7 @@ class Regexp::Expression::CharacterSet < ::Regexp::Expression::Subexpression
# source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#3
def negative=(_arg0); end
- # Returns the value of attribute negative.
- #
- # source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#3
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#16
def negative?; end
# source://regexp_parser//lib/regexp_parser/expression/methods/parts.rb#15
@@ -686,6 +688,9 @@ end
class Regexp::Expression::CharacterType::Base < ::Regexp::Expression::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/match_length.rb#98
def match_length; end
+
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#17
+ def negative?; end
end
# source://regexp_parser//lib/regexp_parser/expression/classes/character_type.rb#6
@@ -1151,10 +1156,10 @@ end
# source://regexp_parser//lib/regexp_parser/expression/methods/match_length.rb#85
Regexp::Expression::MatchLength = Regexp::MatchLength
-# source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#14
+# source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#10
Regexp::Expression::Nonposixclass = Regexp::Expression::PosixClass
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#121
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#118
Regexp::Expression::Nonproperty = Regexp::Expression::UnicodeProperty
# source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#2
@@ -1162,23 +1167,21 @@ class Regexp::Expression::PosixClass < ::Regexp::Expression::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/match_length.rb#98
def match_length; end
- # source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#7
+ # source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#3
def name; end
- # @return [Boolean]
- #
- # source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#3
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#18
def negative?; end
end
# alias for symmetry between token symbol and Expression class name
#
-# source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#13
+# source://regexp_parser//lib/regexp_parser/expression/classes/posix_class.rb#9
Regexp::Expression::Posixclass = Regexp::Expression::PosixClass
# alias for symmetry between token symbol and Expression class name
#
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#120
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#117
Regexp::Expression::Property = Regexp::Expression::UnicodeProperty
# TODO: in v3.0.0, maybe put Shared back into Base, and inherit from Base and
@@ -1370,7 +1373,7 @@ end
# alias for symmetry between token symbol and Expression class name
#
-# source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#25
+# source://regexp_parser//lib/regexp_parser/expression/classes/character_set.rb#22
Regexp::Expression::Set = Regexp::Expression::CharacterSet
# source://regexp_parser//lib/regexp_parser/expression/shared.rb#2
@@ -1453,6 +1456,18 @@ module Regexp::Expression::Shared
# source://regexp_parser//lib/regexp_parser/expression/methods/tests.rb#36
def is?(test_token, test_type = T.unsafe(nil)); end
+ # not an alias so as to respect overrides of #negative?
+ #
+ # @return [Boolean]
+ #
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#8
+ def negated?; end
+
+ # @return [Boolean]
+ #
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#3
+ def negative?; end
+
# source://regexp_parser//lib/regexp_parser/expression/shared.rb#100
def nesting_level=(lvl); end
@@ -1794,22 +1809,22 @@ end
# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#2
module Regexp::Expression::UnicodeProperty; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#112
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#108
class Regexp::Expression::UnicodeProperty::Age < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#17
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#13
class Regexp::Expression::UnicodeProperty::Alnum < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#18
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#14
class Regexp::Expression::UnicodeProperty::Alpha < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#35
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#31
class Regexp::Expression::UnicodeProperty::Any < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#19
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#15
class Regexp::Expression::UnicodeProperty::Ascii < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#36
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#32
class Regexp::Expression::UnicodeProperty::Assigned < ::Regexp::Expression::UnicodeProperty::Base; end
# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#3
@@ -1817,226 +1832,227 @@ class Regexp::Expression::UnicodeProperty::Base < ::Regexp::Expression::Base
# source://regexp_parser//lib/regexp_parser/expression/methods/match_length.rb#98
def match_length; end
- # source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#8
+ # source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#4
def name; end
- # @return [Boolean]
- #
- # source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#4
+ # source://regexp_parser//lib/regexp_parser/expression/methods/negative.rb#19
def negative?; end
- # source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#12
+ # source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#8
def shortcut; end
end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#20
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#16
class Regexp::Expression::UnicodeProperty::Blank < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#116
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#109
class Regexp::Expression::UnicodeProperty::Block < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#21
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#17
class Regexp::Expression::UnicodeProperty::Cntrl < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#101
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#97
module Regexp::Expression::UnicodeProperty::Codepoint; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#104
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#100
class Regexp::Expression::UnicodeProperty::Codepoint::Any < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#102
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#98
class Regexp::Expression::UnicodeProperty::Codepoint::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#105
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#101
class Regexp::Expression::UnicodeProperty::Codepoint::Control < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#106
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#102
class Regexp::Expression::UnicodeProperty::Codepoint::Format < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#108
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#104
class Regexp::Expression::UnicodeProperty::Codepoint::PrivateUse < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#107
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#103
class Regexp::Expression::UnicodeProperty::Codepoint::Surrogate < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#109
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#105
class Regexp::Expression::UnicodeProperty::Codepoint::Unassigned < ::Regexp::Expression::UnicodeProperty::Codepoint::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#113
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#110
class Regexp::Expression::UnicodeProperty::Derived < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#22
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#18
class Regexp::Expression::UnicodeProperty::Digit < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#114
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#111
class Regexp::Expression::UnicodeProperty::Emoji < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#23
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#112
+class Regexp::Expression::UnicodeProperty::Enumerated < ::Regexp::Expression::UnicodeProperty::Base; end
+
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#19
class Regexp::Expression::UnicodeProperty::Graph < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#38
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#34
module Regexp::Expression::UnicodeProperty::Letter; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#41
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#37
class Regexp::Expression::UnicodeProperty::Letter::Any < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#39
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#35
class Regexp::Expression::UnicodeProperty::Letter::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#42
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#38
class Regexp::Expression::UnicodeProperty::Letter::Cased < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#44
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#40
class Regexp::Expression::UnicodeProperty::Letter::Lowercase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#46
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#42
class Regexp::Expression::UnicodeProperty::Letter::Modifier < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#47
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#43
class Regexp::Expression::UnicodeProperty::Letter::Other < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#45
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#41
class Regexp::Expression::UnicodeProperty::Letter::Titlecase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#43
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#39
class Regexp::Expression::UnicodeProperty::Letter::Uppercase < ::Regexp::Expression::UnicodeProperty::Letter::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#24
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#20
class Regexp::Expression::UnicodeProperty::Lower < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#50
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#46
module Regexp::Expression::UnicodeProperty::Mark; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#53
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#49
class Regexp::Expression::UnicodeProperty::Mark::Any < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#51
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#47
class Regexp::Expression::UnicodeProperty::Mark::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#54
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#50
class Regexp::Expression::UnicodeProperty::Mark::Combining < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#57
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#53
class Regexp::Expression::UnicodeProperty::Mark::Enclosing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#55
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#51
class Regexp::Expression::UnicodeProperty::Mark::Nonspacing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#56
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#52
class Regexp::Expression::UnicodeProperty::Mark::Spacing < ::Regexp::Expression::UnicodeProperty::Mark::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#33
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#29
class Regexp::Expression::UnicodeProperty::Newline < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#60
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#56
module Regexp::Expression::UnicodeProperty::Number; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#63
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#59
class Regexp::Expression::UnicodeProperty::Number::Any < ::Regexp::Expression::UnicodeProperty::Number::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#61
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#57
class Regexp::Expression::UnicodeProperty::Number::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#64
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#60
class Regexp::Expression::UnicodeProperty::Number::Decimal < ::Regexp::Expression::UnicodeProperty::Number::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#65
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#61
class Regexp::Expression::UnicodeProperty::Number::Letter < ::Regexp::Expression::UnicodeProperty::Number::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#66
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#62
class Regexp::Expression::UnicodeProperty::Number::Other < ::Regexp::Expression::UnicodeProperty::Number::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#25
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#21
class Regexp::Expression::UnicodeProperty::Print < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#26
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#22
class Regexp::Expression::UnicodeProperty::Punct < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#69
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#65
module Regexp::Expression::UnicodeProperty::Punctuation; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#72
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#68
class Regexp::Expression::UnicodeProperty::Punctuation::Any < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#70
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#66
class Regexp::Expression::UnicodeProperty::Punctuation::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#76
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#72
class Regexp::Expression::UnicodeProperty::Punctuation::Close < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#73
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#69
class Regexp::Expression::UnicodeProperty::Punctuation::Connector < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#74
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#70
class Regexp::Expression::UnicodeProperty::Punctuation::Dash < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#78
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#74
class Regexp::Expression::UnicodeProperty::Punctuation::Final < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#77
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#73
class Regexp::Expression::UnicodeProperty::Punctuation::Initial < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#75
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#71
class Regexp::Expression::UnicodeProperty::Punctuation::Open < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#79
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#75
class Regexp::Expression::UnicodeProperty::Punctuation::Other < ::Regexp::Expression::UnicodeProperty::Punctuation::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#115
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#113
class Regexp::Expression::UnicodeProperty::Script < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#82
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#78
module Regexp::Expression::UnicodeProperty::Separator; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#85
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#81
class Regexp::Expression::UnicodeProperty::Separator::Any < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#83
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#79
class Regexp::Expression::UnicodeProperty::Separator::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#87
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#83
class Regexp::Expression::UnicodeProperty::Separator::Line < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#88
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#84
class Regexp::Expression::UnicodeProperty::Separator::Paragraph < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#86
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#82
class Regexp::Expression::UnicodeProperty::Separator::Space < ::Regexp::Expression::UnicodeProperty::Separator::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#27
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#23
class Regexp::Expression::UnicodeProperty::Space < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#91
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#87
module Regexp::Expression::UnicodeProperty::Symbol; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#94
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#90
class Regexp::Expression::UnicodeProperty::Symbol::Any < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#92
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#88
class Regexp::Expression::UnicodeProperty::Symbol::Base < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#96
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#92
class Regexp::Expression::UnicodeProperty::Symbol::Currency < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#95
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#91
class Regexp::Expression::UnicodeProperty::Symbol::Math < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#97
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#93
class Regexp::Expression::UnicodeProperty::Symbol::Modifier < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#98
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#94
class Regexp::Expression::UnicodeProperty::Symbol::Other < ::Regexp::Expression::UnicodeProperty::Symbol::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#28
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#24
class Regexp::Expression::UnicodeProperty::Upper < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#29
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#25
class Regexp::Expression::UnicodeProperty::Word < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#31
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#27
class Regexp::Expression::UnicodeProperty::XPosixPunct < ::Regexp::Expression::UnicodeProperty::Base; end
-# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#30
+# source://regexp_parser//lib/regexp_parser/expression/classes/unicode_property.rb#26
class Regexp::Expression::UnicodeProperty::Xdigit < ::Regexp::Expression::UnicodeProperty::Base; end
# source://regexp_parser//lib/regexp_parser/expression/classes/free_space.rb#11
@@ -2343,7 +2359,7 @@ class Regexp::Parser
private
- # source://regexp_parser//lib/regexp_parser/parser.rb#573
+ # source://regexp_parser//lib/regexp_parser/parser.rb#574
def active_opts; end
# source://regexp_parser//lib/regexp_parser/parser.rb#99
@@ -2356,7 +2372,7 @@ class Regexp::Parser
# an instance of Backreference::Number, its #referenced_expression is set to
# the instance of Group::Capture that it refers to via its number.
#
- # source://regexp_parser//lib/regexp_parser/parser.rb#580
+ # source://regexp_parser//lib/regexp_parser/parser.rb#581
def assign_referenced_expressions; end
# source://regexp_parser//lib/regexp_parser/parser.rb#227
@@ -2377,13 +2393,13 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#56
def captured_group_counts=(_arg0); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#569
+ # source://regexp_parser//lib/regexp_parser/parser.rb#570
def close_completed_character_set_range; end
# source://regexp_parser//lib/regexp_parser/parser.rb#210
def close_group; end
- # source://regexp_parser//lib/regexp_parser/parser.rb#537
+ # source://regexp_parser//lib/regexp_parser/parser.rb#538
def close_set; end
# source://regexp_parser//lib/regexp_parser/parser.rb#269
@@ -2421,10 +2437,10 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#114
def group(token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#508
+ # source://regexp_parser//lib/regexp_parser/parser.rb#509
def increase_group_level(exp); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#548
+ # source://regexp_parser//lib/regexp_parser/parser.rb#549
def intersection(token); end
# source://regexp_parser//lib/regexp_parser/parser.rb#360
@@ -2436,7 +2452,7 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#368
def meta(token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#533
+ # source://regexp_parser//lib/regexp_parser/parser.rb#534
def negate_set; end
# source://regexp_parser//lib/regexp_parser/parser.rb#299
@@ -2472,7 +2488,7 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#165
def open_group(token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#526
+ # source://regexp_parser//lib/regexp_parser/parser.rb#527
def open_set(token); end
# source://regexp_parser//lib/regexp_parser/parser.rb#130
@@ -2499,10 +2515,10 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#397
def property(token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#478
+ # source://regexp_parser//lib/regexp_parser/parser.rb#479
def quantifier(token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#541
+ # source://regexp_parser//lib/regexp_parser/parser.rb#542
def range(token); end
# Returns the value of attribute root.
@@ -2520,7 +2536,7 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#379
def sequence_operation(klass, token); end
- # source://regexp_parser//lib/regexp_parser/parser.rb#514
+ # source://regexp_parser//lib/regexp_parser/parser.rb#515
def set(token); end
# Returns the value of attribute switching_options.
@@ -2538,7 +2554,7 @@ class Regexp::Parser
# source://regexp_parser//lib/regexp_parser/parser.rb#198
def total_captured_group_count; end
- # source://regexp_parser//lib/regexp_parser/parser.rb#552
+ # source://regexp_parser//lib/regexp_parser/parser.rb#553
def type(token); end
class << self
@@ -2590,17 +2606,17 @@ Regexp::Parser::VERSION = T.let(T.unsafe(nil), String)
class Regexp::Scanner
# Emits an array with the details of the scanned pattern
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2405
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2406
def emit(type, token, text); end
# only public for #||= to work on ruby <= 2.5
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2430
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2431
def literal_run; end
# only public for #||= to work on ruby <= 2.5
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2430
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2431
def literal_run=(_arg0); end
# @raise [PrematureEndError]
@@ -2613,168 +2629,168 @@ class Regexp::Scanner
# Appends one or more characters to the literal buffer, to be emitted later
# by a call to emit_literal.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2467
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2468
def append_literal(data, ts, te); end
# Returns the value of attribute block.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def block; end
# Sets the attribute block
#
# @param value the value to set the attribute block to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def block=(_arg0); end
# Returns the value of attribute char_pos.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def char_pos; end
# Sets the attribute char_pos
#
# @param value the value to set the attribute char_pos to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def char_pos=(_arg0); end
# Returns the value of attribute collect_tokens.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def collect_tokens; end
# Sets the attribute collect_tokens
#
# @param value the value to set the attribute collect_tokens to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def collect_tokens=(_arg0); end
# Returns the value of attribute conditional_stack.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def conditional_stack; end
# Sets the attribute conditional_stack
#
# @param value the value to set the attribute conditional_stack to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def conditional_stack=(_arg0); end
# Copy from ts to te from data as text
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2461
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2462
def copy(data, ts, te); end
# Emits the literal run collected by calls to the append_literal method.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2472
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2473
def emit_literal; end
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2507
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2508
def emit_meta_control_sequence(data, ts, te, token); end
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2478
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2479
def emit_options(text); end
# Returns the value of attribute free_spacing.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def free_spacing; end
# Sets the attribute free_spacing
#
# @param value the value to set the attribute free_spacing to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def free_spacing=(_arg0); end
# @return [Boolean]
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2440
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2441
def free_spacing?(input_object, options); end
# Returns the value of attribute group_depth.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def group_depth; end
# Sets the attribute group_depth
#
# @param value the value to set the attribute group_depth to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def group_depth=(_arg0); end
# @return [Boolean]
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2452
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2453
def in_group?; end
# @return [Boolean]
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2456
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2457
def in_set?; end
# Returns the value of attribute prev_token.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def prev_token; end
# Sets the attribute prev_token
#
# @param value the value to set the attribute prev_token to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def prev_token=(_arg0); end
# Returns the value of attribute set_depth.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def set_depth; end
# Sets the attribute set_depth
#
# @param value the value to set the attribute set_depth to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def set_depth=(_arg0); end
# Returns the value of attribute spacing_stack.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def spacing_stack; end
# Sets the attribute spacing_stack
#
# @param value the value to set the attribute spacing_stack to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def spacing_stack=(_arg0); end
# Returns the value of attribute tokens.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def tokens; end
# Sets the attribute tokens
#
# @param value the value to set the attribute tokens to.
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2434
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2435
def tokens=(_arg0); end
class << self
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2391
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2392
def long_prop_map; end
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2395
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2396
def parse_prop_map(name); end
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2399
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2400
def posix_classes; end
# Scans the given regular expression text, or Regexp object and collects the
@@ -2789,7 +2805,7 @@ class Regexp::Scanner
# lazy-load property maps when first needed
#
- # source://regexp_parser//lib/regexp_parser/scanner.rb#2387
+ # source://regexp_parser//lib/regexp_parser/scanner.rb#2388
def short_prop_map; end
end
end
@@ -3355,7 +3371,7 @@ Regexp::Syntax::Token::PosixClass::Type = T.let(T.unsafe(nil), Symbol)
# alias for symmetry between token symbol and Token module name
#
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#731
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#749
Regexp::Syntax::Token::Property = Regexp::Syntax::Token::UnicodeProperty
# source://regexp_parser//lib/regexp_parser/syntax/token/quantifier.rb#3
@@ -3452,7 +3468,7 @@ Regexp::Syntax::Token::UnicodeProperty::Age_V3_1_0 = T.let(T.unsafe(nil), Array)
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#62
Regexp::Syntax::Token::UnicodeProperty::Age_V3_2_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#721
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#739
Regexp::Syntax::Token::UnicodeProperty::All = T.let(T.unsafe(nil), Array)
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#13
@@ -3503,7 +3519,7 @@ Regexp::Syntax::Token::UnicodeProperty::Derived_V2_4_0 = T.let(T.unsafe(nil), Ar
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#129
Regexp::Syntax::Token::UnicodeProperty::Derived_V2_5_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#706
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#724
Regexp::Syntax::Token::UnicodeProperty::Emoji = T.let(T.unsafe(nil), Array)
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#694
@@ -3512,7 +3528,13 @@ Regexp::Syntax::Token::UnicodeProperty::Emoji_V2_5_0 = T.let(T.unsafe(nil), Arra
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#702
Regexp::Syntax::Token::UnicodeProperty::Emoji_V2_6_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#724
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#722
+Regexp::Syntax::Token::UnicodeProperty::Enumerated = T.let(T.unsafe(nil), Array)
+
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#706
+Regexp::Syntax::Token::UnicodeProperty::Enumerated_V2_4_0 = T.let(T.unsafe(nil), Array)
+
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#742
Regexp::Syntax::Token::UnicodeProperty::NonType = T.let(T.unsafe(nil), Symbol)
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#11
@@ -3554,7 +3576,7 @@ Regexp::Syntax::Token::UnicodeProperty::Script_V3_1_0 = T.let(T.unsafe(nil), Arr
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#322
Regexp::Syntax::Token::UnicodeProperty::Script_V3_2_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#723
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#741
Regexp::Syntax::Token::UnicodeProperty::Type = T.let(T.unsafe(nil), Symbol)
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#692
@@ -3590,40 +3612,40 @@ Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V3_1_0 = T.let(T.unsafe(nil
# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#670
Regexp::Syntax::Token::UnicodeProperty::UnicodeBlock_V3_2_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#708
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#726
Regexp::Syntax::Token::UnicodeProperty::V1_9_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#709
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#727
Regexp::Syntax::Token::UnicodeProperty::V1_9_3 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#710
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#728
Regexp::Syntax::Token::UnicodeProperty::V2_0_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#711
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#729
Regexp::Syntax::Token::UnicodeProperty::V2_2_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#712
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#730
Regexp::Syntax::Token::UnicodeProperty::V2_3_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#713
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#731
Regexp::Syntax::Token::UnicodeProperty::V2_4_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#714
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#732
Regexp::Syntax::Token::UnicodeProperty::V2_5_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#715
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#733
Regexp::Syntax::Token::UnicodeProperty::V2_6_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#716
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#734
Regexp::Syntax::Token::UnicodeProperty::V2_6_2 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#717
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#735
Regexp::Syntax::Token::UnicodeProperty::V2_6_3 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#718
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#736
Regexp::Syntax::Token::UnicodeProperty::V3_1_0 = T.let(T.unsafe(nil), Array)
-# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#719
+# source://regexp_parser//lib/regexp_parser/syntax/token/unicode_property.rb#737
Regexp::Syntax::Token::UnicodeProperty::V3_2_0 = T.let(T.unsafe(nil), Array)
# source://regexp_parser//lib/regexp_parser/syntax/version_lookup.rb#12
diff --git a/sorbet/rbi/gems/reline@0.3.5.rbi b/sorbet/rbi/gems/reline@0.4.2.rbi
similarity index 100%
rename from sorbet/rbi/gems/reline@0.3.5.rbi
rename to sorbet/rbi/gems/reline@0.4.2.rbi
diff --git a/sorbet/rbi/gems/rubocop-ast@1.29.0.rbi b/sorbet/rbi/gems/rubocop-ast@1.30.0.rbi
similarity index 99%
rename from sorbet/rbi/gems/rubocop-ast@1.29.0.rbi
rename to sorbet/rbi/gems/rubocop-ast@1.30.0.rbi
index 5f2de83..4c53b6b 100644
--- a/sorbet/rbi/gems/rubocop-ast@1.29.0.rbi
+++ b/sorbet/rbi/gems/rubocop-ast@1.30.0.rbi
@@ -275,7 +275,7 @@ class RuboCop::AST::BlockNode < ::RuboCop::AST::Node
#
# @return [Array]
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#42
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#60
def argument_list; end
# The arguments of this block.
@@ -285,63 +285,81 @@ class RuboCop::AST::BlockNode < ::RuboCop::AST::Node
#
# @return [Array]
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#30
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#48
def arguments; end
# Checks whether this block takes any arguments.
#
# @return [Boolean] whether this `block` node takes any arguments
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#67
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#85
def arguments?; end
# The body of this block.
#
# @return [Node, nil] the body of the `block` node or `nil`
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#53
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#71
def body; end
# Checks whether the `block` literal is delimited by curly braces.
#
# @return [Boolean] whether the `block` literal is enclosed in braces
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#74
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#92
def braces?; end
# The closing delimiter for this `block` literal.
#
# @return [String] the closing delimiter for the `block` literal
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#102
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#120
def closing_delimiter; end
# The delimiters for this `block` literal.
#
# @return [Array] the delimiters for the `block` literal
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#88
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#106
def delimiters; end
+ # A shorthand for getting the first argument of this block.
+ # Equivalent to `arguments.first`.
+ #
+ # @return [Node, nil] the first argument of this block,
+ # or `nil` if there are no arguments
+ #
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#29
+ def first_argument; end
+
# Checks whether the `block` literal is delimited by `do`-`end` keywords.
#
# @return [Boolean] whether the `block` literal is enclosed in `do`-`end`
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#81
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#99
def keywords?; end
# Checks whether this `block` literal belongs to a lambda.
#
# @return [Boolean] whether the `block` literal belongs to a lambda
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#125
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#143
def lambda?; end
+ # A shorthand for getting the last argument of this block.
+ # Equivalent to `arguments.last`.
+ #
+ # @return [Node, nil] the last argument of this block,
+ # or `nil` if there are no arguments
+ #
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#38
+ def last_argument; end
+
# The name of the dispatched method as a symbol.
#
# @return [Symbol] the name of the dispatched method
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#60
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#78
def method_name; end
# Checks whether this is a multiline block. This is overridden here
@@ -349,14 +367,14 @@ class RuboCop::AST::BlockNode < ::RuboCop::AST::Node
#
# @return [Boolean] whether the `block` literal is on a several lines
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#118
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#136
def multiline?; end
# The opening delimiter for this `block` literal.
#
# @return [String] the opening delimiter for the `block` literal
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#95
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#113
def opening_delimiter; end
# The `send` node associated with this block.
@@ -371,21 +389,21 @@ class RuboCop::AST::BlockNode < ::RuboCop::AST::Node
#
# @return [Boolean] whether the `block` literal is on a single line
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#110
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#128
def single_line?; end
# Checks whether this node body is a void context.
#
# @return [Boolean] whether the `block` node body is a void context
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#132
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#150
def void_context?; end
private
# Numbered arguments of this `numblock`.
#
- # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#139
+ # source://rubocop-ast//lib/rubocop/ast/node/block_node.rb#157
def numbered_arguments; end
end
@@ -1716,7 +1734,7 @@ class RuboCop::AST::IfNode < ::RuboCop::AST::Node
# source://rubocop-ast//lib/rubocop/ast/node/if_node.rb#80
def modifier_form?; end
- # Chacks whether the `if` node has nested `if` nodes in any of its
+ # Checks whether the `if` node has nested `if` nodes in any of its
# branches.
#
# @note This performs a shallow search.
@@ -4823,116 +4841,116 @@ class RuboCop::AST::NodePattern::Parser < ::Racc::Parser
# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.rb#19
def initialize(builder = T.unsafe(nil)); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#333
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#335
def _reduce_10(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#337
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#339
def _reduce_11(val, _values); end
# reduce 12 omitted
#
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#343
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#345
def _reduce_13(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#347
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#349
def _reduce_14(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#351
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#353
def _reduce_15(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#355
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#357
def _reduce_16(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#359
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#361
def _reduce_17(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#363
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#365
def _reduce_18(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#367
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#369
def _reduce_19(val, _values); end
# reduce 1 omitted
#
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#301
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#303
def _reduce_2(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#371
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#373
def _reduce_20(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#375
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#377
def _reduce_21(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#379
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#381
def _reduce_22(val, _values); end
# reduce 24 omitted
#
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#387
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#389
def _reduce_25(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#393
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#395
def _reduce_26(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#305
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#307
def _reduce_3(val, _values); end
# reduce 32 omitted
#
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#413
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#415
def _reduce_33(val, _values); end
# reduce 36 omitted
#
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#423
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#425
def _reduce_37(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#427
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#429
def _reduce_38(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#431
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#433
def _reduce_39(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#309
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#311
def _reduce_4(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#435
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#437
def _reduce_40(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#439
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#441
def _reduce_41(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#443
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#445
def _reduce_42(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#447
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#449
def _reduce_43(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#451
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#453
def _reduce_44(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#455
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#457
def _reduce_45(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#459
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#461
def _reduce_46(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#313
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#315
def _reduce_5(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#317
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#319
def _reduce_6(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#321
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#323
def _reduce_7(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#325
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#327
def _reduce_8(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#329
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#331
def _reduce_9(val, _values); end
- # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#463
+ # source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#465
def _reduce_none(val, _values); end
# source://forwardable/1.3.3/forwardable.rb#231
@@ -4992,10 +5010,10 @@ RuboCop::AST::NodePattern::Parser::Lexer = RuboCop::AST::NodePattern::Lexer
# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#227
RuboCop::AST::NodePattern::Parser::Racc_arg = T.let(T.unsafe(nil), Array)
-# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#293
+# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#295
RuboCop::AST::NodePattern::Parser::Racc_debug_parser = T.let(T.unsafe(nil), FalseClass)
-# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#243
+# source://rubocop-ast//lib/rubocop/ast/node_pattern/parser.racc.rb#244
RuboCop::AST::NodePattern::Parser::Racc_token_to_s_table = T.let(T.unsafe(nil), Array)
# Overrides Parser to use `WithMeta` variants and provide additional methods
@@ -5173,6 +5191,9 @@ RuboCop::AST::NodePattern::Sets::SET_FILE_DIR = T.let(T.unsafe(nil), Set)
# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10
RuboCop::AST::NodePattern::Sets::SET_FILE_FILETEST = T.let(T.unsafe(nil), Set)
+# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10
+RuboCop::AST::NodePattern::Sets::SET_FILE_TEMPFILE = T.let(T.unsafe(nil), Set)
+
# source://rubocop-ast//lib/rubocop/ast/node_pattern/sets.rb#10
RuboCop::AST::NodePattern::Sets::SET_FILE_TEMPFILE_STRINGIO = T.let(T.unsafe(nil), Set)
diff --git a/sorbet/rbi/gems/rubocop-performance@1.19.1.rbi b/sorbet/rbi/gems/rubocop-performance@1.20.2.rbi
similarity index 100%
rename from sorbet/rbi/gems/rubocop-performance@1.19.1.rbi
rename to sorbet/rbi/gems/rubocop-performance@1.20.2.rbi
diff --git a/sorbet/rbi/gems/rubocop-sorbet@0.7.4.rbi b/sorbet/rbi/gems/rubocop-sorbet@0.7.6.rbi
similarity index 100%
rename from sorbet/rbi/gems/rubocop-sorbet@0.7.4.rbi
rename to sorbet/rbi/gems/rubocop-sorbet@0.7.6.rbi
diff --git a/sorbet/rbi/gems/rubocop@1.56.4.rbi b/sorbet/rbi/gems/rubocop@1.59.0.rbi
similarity index 97%
rename from sorbet/rbi/gems/rubocop@1.56.4.rbi
rename to sorbet/rbi/gems/rubocop@1.59.0.rbi
index 3cf29fa..49a39e5 100644
--- a/sorbet/rbi/gems/rubocop@1.56.4.rbi
+++ b/sorbet/rbi/gems/rubocop@1.59.0.rbi
@@ -166,77 +166,77 @@ end
class RuboCop::CLI::Command::AutoGenerateConfig < ::RuboCop::CLI::Command::Base
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#21
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#22
def run; end
private
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#97
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#98
def add_formatter; end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#105
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#106
def add_inheritance_from_auto_generated_file(config_file); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#101
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#102
def execute_runner; end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#126
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#127
def existing_configuration(config_file); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#59
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#60
def line_length_cop(config); end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#47
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#48
def line_length_enabled?(config); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#55
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#56
def max_line_length(config); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#30
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#31
def maybe_run_line_length_cop; end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#148
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#153
def options_config_in_root?; end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#63
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#64
def options_has_only_flag?; end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#139
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#144
def relative_path_to_todo_from_options_config; end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#90
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#91
def reset_config_and_auto_gen_file; end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#81
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#82
def run_all_cops(line_length_contents); end
# Do an initial run with only Layout/LineLength so that cops that
@@ -245,23 +245,23 @@ class RuboCop::CLI::Command::AutoGenerateConfig < ::RuboCop::CLI::Command::Base
#
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#70
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#71
def run_line_length_cop; end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#51
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#52
def same_max_line_length?(config1, config2); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#42
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#43
def skip_line_length_cop(reason); end
# @api private
#
- # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#132
+ # source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#133
def write_config_file(file_name, file_string, rubocop_yml_contents); end
end
@@ -272,29 +272,34 @@ RuboCop::CLI::Command::AutoGenerateConfig::AUTO_GENERATED_FILE = T.let(T.unsafe(
# @api private
#
-# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#14
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#15
RuboCop::CLI::Command::AutoGenerateConfig::PHASE_1 = T.let(T.unsafe(nil), String)
# @api private
#
-# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#18
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#19
RuboCop::CLI::Command::AutoGenerateConfig::PHASE_1_DISABLED = T.let(T.unsafe(nil), String)
# @api private
#
-# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#17
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#18
RuboCop::CLI::Command::AutoGenerateConfig::PHASE_1_OVERRIDDEN = T.let(T.unsafe(nil), String)
# @api private
#
-# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#19
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#20
RuboCop::CLI::Command::AutoGenerateConfig::PHASE_1_SKIPPED = T.let(T.unsafe(nil), String)
# @api private
#
-# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#15
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#16
RuboCop::CLI::Command::AutoGenerateConfig::PHASE_2 = T.let(T.unsafe(nil), String)
+# @api private
+#
+# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#13
+RuboCop::CLI::Command::AutoGenerateConfig::PLACEHOLDER = T.let(T.unsafe(nil), String)
+
# @api private
#
# source://rubocop//lib/rubocop/cli/command/auto_generate_config.rb#12
@@ -744,7 +749,7 @@ class RuboCop::CommentConfig
# @return [CommentConfig] a new instance of CommentConfig
#
- # source://standard/1.31.2/lib/standard/rubocop/ext.rb#20
+ # source://standard/1.33.0/lib/standard/rubocop/ext.rb#20
def initialize(processed_source); end
# @return [Boolean]
@@ -1648,23 +1653,23 @@ class RuboCop::ConfigObsoletion
# @api private
# @return [ConfigObsoletion] a new instance of ConfigObsoletion
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#33
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#35
def initialize(config); end
# @api private
# @raise [ValidationError]
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#39
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#41
def reject_obsolete!; end
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#19
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#21
def rules; end
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#19
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#21
def warnings; end
private
@@ -1673,7 +1678,7 @@ class RuboCop::ConfigObsoletion
#
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#69
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#72
def load_cop_rules(rules); end
# Parameter rules may apply to multiple cops and multiple parameters
@@ -1682,7 +1687,7 @@ class RuboCop::ConfigObsoletion
#
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#82
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#85
def load_parameter_rules(rules); end
# Default rules for obsoletions are in config/obsoletion.yml
@@ -1690,28 +1695,28 @@ class RuboCop::ConfigObsoletion
#
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#50
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#52
def load_rules; end
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#95
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#98
def obsoletions; end
class << self
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#22
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#24
def files; end
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#22
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#24
def files=(_arg0); end
# @api private
#
- # source://rubocop//lib/rubocop/config_obsoletion.rb#24
+ # source://rubocop//lib/rubocop/config_obsoletion.rb#26
def legacy_cop_names; end
end
end
@@ -1864,6 +1869,11 @@ class RuboCop::ConfigObsoletion::ExtractedCop < ::RuboCop::ConfigObsoletion::Cop
def feature_loaded?; end
end
+# @api private
+#
+# source://rubocop//lib/rubocop/config_obsoletion.rb#18
+RuboCop::ConfigObsoletion::LOAD_RULES_CACHE = T.let(T.unsafe(nil), Hash)
+
# @api private
#
# source://rubocop//lib/rubocop/config_obsoletion.rb#14
@@ -4992,7 +5002,7 @@ class RuboCop::Cop::Corrector < ::Parser::Source::TreeRewriter
# Legacy
#
- # source://parser/3.2.2.4/lib/parser/source/tree_rewriter.rb#252
+ # source://parser/3.3.0.4/lib/parser/source/tree_rewriter.rb#252
def rewrite; end
# Swaps sources at the given ranges.
@@ -6526,61 +6536,61 @@ module RuboCop::Cop::HashShorthandSyntax
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#122
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#125
def brackets?(method_dispatch_node); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#152
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#155
def breakdown_value_types_of_hash(hash_node); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#99
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#102
def def_node_that_require_parentheses(node); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#176
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#179
def each_omittable_value_pair(hash_value_type_breakdown, &block); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#172
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#175
def each_omitted_value_pair(hash_value_type_breakdown, &block); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#77
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#80
def enforced_shorthand_syntax; end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#114
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#117
def find_ancestor_method_dispatch_node(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#164
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#167
def hash_with_mixed_shorthand_syntax?(hash_value_type_breakdown); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#168
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#171
def hash_with_values_that_cant_be_omitted?(hash_value_type_breakdown); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#71
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#74
def ignore_hash_shorthand_syntax?(pair_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#66
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#69
def ignore_mixed_hash_shorthand_syntax?(hash_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#137
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#140
def last_expression?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#145
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#148
def method_dispatch_as_argument?(method_dispatch_node); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#180
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#183
def mixed_shorthand_syntax_check(hash_value_type_breakdown); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#196
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#199
def no_mixed_shorthand_syntax_check(hash_value_type_breakdown); end
# source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#49
@@ -6588,22 +6598,22 @@ module RuboCop::Cop::HashShorthandSyntax
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#81
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#84
def require_hash_value?(hash_key_source, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#90
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#93
def require_hash_value_for_around_hash_literal?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#126
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#129
def use_element_of_hash_literal_as_receiver?(ancestor, parent); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#131
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#134
def use_modifier_form_without_parenthesized_method_call?(ancestor); end
end
@@ -6616,12 +6626,12 @@ RuboCop::Cop::HashShorthandSyntax::DO_NOT_MIX_MSG_PREFIX = T.let(T.unsafe(nil),
# source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#11
RuboCop::Cop::HashShorthandSyntax::DO_NOT_MIX_OMIT_VALUE_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#206
+# source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#209
class RuboCop::Cop::HashShorthandSyntax::DefNode < ::Struct
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#215
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#218
def first_argument; end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#219
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#222
def last_argument; end
# Returns the value of attribute node
@@ -6635,7 +6645,7 @@ class RuboCop::Cop::HashShorthandSyntax::DefNode < ::Struct
# @return [Object] the newly set value
def node=(_); end
- # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#207
+ # source://rubocop//lib/rubocop/cop/mixin/hash_shorthand_syntax.rb#210
def selector; end
class << self
@@ -10121,13 +10131,13 @@ class RuboCop::Cop::Layout::EndAlignment < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#161
def alignment_node(node); end
- # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#172
+ # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#178
def alignment_node_for_variable_style(node); end
# source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#142
def asgn_variable_align_with(outer_node, inner_node); end
- # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#190
+ # source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#196
def assignment_or_operator_method(node); end
# source://rubocop//lib/rubocop/cop/layout/end_alignment.rb#116
@@ -10242,13 +10252,13 @@ class RuboCop::Cop::Layout::ExtraSpacing < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#176
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#170
def align_column(asgn_token); end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#153
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#147
def align_equal_sign(corrector, token, align_to); end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#143
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#137
def align_equal_signs(range, corrector); end
# source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#52
@@ -10256,46 +10266,46 @@ class RuboCop::Cop::Layout::ExtraSpacing < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#109
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#103
def aligned_tok?(token); end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#165
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#159
def all_relevant_assignment_lines(line_number); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#185
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#179
def allow_for_trailing_comments?; end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#78
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#72
def check_assignment(token); end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#87
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#81
def check_other(token1, token2, ast); end
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#68
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#62
def check_tokens(ast, token1, token2); end
# @yield [range_between(start_pos, end_pos)]
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#97
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#91
def extra_space_range(token1, token2); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#139
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#133
def force_equal_sign_alignment?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#117
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#111
def ignored_range?(ast, start_pos); end
# Returns an array of ranges that should not be reported. It's the
# extra spaces between the keys and values in a multiline hash,
# since those are handled by the Layout/HashAlignment cop.
#
- # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#124
+ # source://rubocop//lib/rubocop/cop/layout/extra_spacing.rb#118
def ignored_ranges(ast); end
end
@@ -10548,7 +10558,7 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin
# # element are on separate lines is indented one step (two spaces) more
# # than the position inside the opening parenthesis.
#
-# #bad
+# # bad
# array = [
# :value
# ]
@@ -10556,7 +10566,7 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin
# :no_difference
# ])
#
-# #good
+# # good
# array = [
# :value
# ]
@@ -10569,7 +10579,7 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin
# # separate lines is indented the same as an array literal which is not
# # defined inside a method call.
#
-# #bad
+# # bad
# # consistent
# array = [
# :value
@@ -10578,7 +10588,7 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin
# :its_like_this
# ])
#
-# #good
+# # good
# array = [
# :value
# ]
@@ -10589,13 +10599,13 @@ RuboCop::Cop::Layout::FirstArgumentIndentation::MSG = T.let(T.unsafe(nil), Strin
# # The `align_brackets` style enforces that the opening and closing
# # brackets are indented to the same position.
#
-# #bad
+# # bad
# # align_brackets
# and_now_for_something = [
# :completely_different
# ]
#
-# #good
+# # good
# # align_brackets
# and_now_for_something = [
# :completely_different
@@ -11644,7 +11654,7 @@ RuboCop::Cop::Layout::HeredocArgumentClosingParenthesis::MSG = T.let(T.unsafe(ni
#
# Note: When ``Layout/LineLength``'s `AllowHeredoc` is false (not default),
# this cop does not add any offenses for long here documents to
-# avoid `Layout/LineLength`'s offenses.
+# avoid ``Layout/LineLength``'s offenses.
#
# @example
# # bad
@@ -13584,10 +13594,13 @@ class RuboCop::Cop::Layout::MultilineMethodCallIndentation < ::RuboCop::Cop::Bas
# source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#101
def extra_indentation(given_style, parent); end
- # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#222
+ # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#226
+ def find_multiline_block_chain_node(node); end
+
+ # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#237
def first_call_has_a_dot(node); end
- # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#213
+ # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#217
def get_dot_right_above(node); end
# source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#113
@@ -13601,12 +13614,12 @@ class RuboCop::Cop::Layout::MultilineMethodCallIndentation < ::RuboCop::Cop::Bas
# @yield [operation_rhs.first_argument]
#
- # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#232
+ # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#247
def operation_rhs(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#242
+ # source://rubocop//lib/rubocop/cop/layout/multiline_method_call_indentation.rb#257
def operator_rhs?(node, receiver); end
# a
@@ -14065,6 +14078,9 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base
include ::RuboCop::Cop::CheckAssignment
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#55
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#51
def on_lvasgn(node); end
@@ -14073,61 +14089,61 @@ class RuboCop::Cop::Layout::RedundantLineBreak < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#72
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#73
def check_assignment(node, _rhs); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#120
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#121
def comment_within?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#90
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#91
def configured_to_not_be_inspected?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#114
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#115
def convertible_block?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#68
+ # 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#142
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#143
def max_line_length; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#85
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#86
def offense?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#97
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#98
def other_cop_takes_precedence?(node); end
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#78
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#79
def register_offense(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#104
def single_line_block_chain_enabled?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#107
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#108
def suitable_as_single_line?(node); end
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#133
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#134
def to_single_line(source); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#128
+ # source://rubocop//lib/rubocop/cop/layout/redundant_line_break.rb#129
def too_long?(node); end
end
@@ -14262,21 +14278,29 @@ class RuboCop::Cop::Layout::SingleLineBlockChain < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#28
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#32
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#32
def on_send(node); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#51
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#56
def call_method_after_block?(node, dot_range, closing_block_delimiter_line_num); end
- # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#35
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#40
def offending_range(node); end
- # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#57
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#62
def selector_range(node); end
+
+ class << self
+ # source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#28
+ def autocorrect_incompatible_with; end
+ end
end
# source://rubocop//lib/rubocop/cop/layout/single_line_block_chain.rb#26
@@ -14883,149 +14907,166 @@ RuboCop::Cop::Layout::SpaceAroundMethodCallOperator::SPACES_REGEXP = T.let(T.uns
#
# # good
# a ** b
+# @example EnforcedStyleForRationalLiterals: no_space (default)
+# # bad
+# 1 / 48r
+#
+# # good
+# 1/48r
+# @example EnforcedStyleForRationalLiterals: space
+# # bad
+# 1/48r
+#
+# # good
+# 1 / 48r
#
-# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#53
+# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#67
class RuboCop::Cop::Layout::SpaceAroundOperators < ::RuboCop::Cop::Base
include ::RuboCop::Cop::PrecedingFollowingAlignment
include ::RuboCop::Cop::RangeHelp
include ::RuboCop::Cop::RationalLiteral
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#119
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#133
def on_and(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_and_asgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_assignment(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#119
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#133
def on_binary(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#111
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#125
def on_casgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#119
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#133
def on_class(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_cvasgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_gvasgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#78
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#92
def on_if(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_ivasgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_lvasgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_masgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#135
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#149
def on_match_pattern(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#127
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#141
def on_op_asgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#119
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#133
def on_or(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#103
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#117
def on_or_asgn(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#70
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#84
def on_pair(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#85
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#99
def on_resbody(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#66
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#80
def on_sclass(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#93
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#107
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#127
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#141
def on_special_asgn(node); end
private
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#238
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#256
def align_hash_cop_config; end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#181
- def autocorrect(corrector, range); end
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#195
+ def autocorrect(corrector, range, right_operand); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#165
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#179
def check_operator(type, operator, right_operand); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#191
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#209
def enclose_operator_with_space(corrector, range); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#218
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#236
def excess_leading_space?(type, operator, with_space); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#233
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#251
def excess_trailing_space?(right_operand, with_space); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#250
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#274
def force_equal_sign_alignment?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#242
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#260
def hash_table_style?; end
# @yield [msg]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#176
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#190
def offense(type, operator, with_space, right_operand); end
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#204
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#222
def offense_message(type, operator, with_space, right_operand); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#161
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#175
def operator_with_regular_syntax?(send_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#155
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#169
def regular_operator?(send_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#254
- def should_not_have_surrounding_space?(operator); end
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#278
+ def should_not_have_surrounding_space?(operator, right_operand); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#246
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#264
def space_around_exponent_operator?; end
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#268
+ def space_around_slash_operator?(right_operand); end
+
class << self
- # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#62
+ # source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#76
def autocorrect_incompatible_with; end
end
end
-# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#60
+# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#74
RuboCop::Cop::Layout::SpaceAroundOperators::EXCESSIVE_SPACE = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#59
+# source://rubocop//lib/rubocop/cop/layout/space_around_operators.rb#73
RuboCop::Cop::Layout::SpaceAroundOperators::IRREGULAR_METHODS = T.let(T.unsafe(nil), Array)
# Checks that block braces have or don't have a space before the opening
@@ -16800,22 +16841,22 @@ RuboCop::Cop::Lint::AmbiguousRegexpLiteral::MSG = T.let(T.unsafe(nil), String)
#
# @example
# # bad
-# if some_var = true
+# if some_var = value
# do_something
# end
#
# # good
-# if some_var == true
+# if some_var == value
# do_something
# end
# @example AllowSafeAssignment: true (default)
# # good
-# if (some_var = true)
+# if (some_var = value)
# do_something
# end
# @example AllowSafeAssignment: false
# # bad
-# if (some_var = true)
+# if (some_var = value)
# do_something
# end
#
@@ -16824,7 +16865,7 @@ class RuboCop::Cop::Lint::AssignmentInCondition < ::RuboCop::Cop::Base
include ::RuboCop::Cop::SafeAssignment
extend ::RuboCop::Cop::AutoCorrector
- # source://standard/1.31.2/lib/standard/rubocop/ext.rb#4
+ # source://standard/1.33.0/lib/standard/rubocop/ext.rb#4
def message(_); end
# source://rubocop//lib/rubocop/cop/lint/assignment_in_condition.rb#55
@@ -16897,10 +16938,10 @@ RuboCop::Cop::Lint::BigDecimalNew::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array
# Checks for places where binary operator has identical operands.
#
# It covers arithmetic operators: `-`, `/`, `%`;
-# comparison operators: `==`, `===`, `=~`, `>`, `>=`, `<`, `<=`;
+# comparison operators: `==`, `===`, `=~`, `>`, `>=`, `<`, ``<=``;
# bitwise operators: `|`, `^`, `&`;
# boolean operators: `&&`, `||`
-# and "spaceship" operator - `<=>`.
+# and "spaceship" operator - ``<=>``.
#
# Simple arithmetic operations are allowed by this cop: `+`, `*`, `**`, `<<` and `>>`.
# Although these can be rewritten in a different way, it should not be necessary to
@@ -17123,7 +17164,7 @@ end
# source://rubocop//lib/rubocop/cop/lint/constant_definition_in_block.rb#67
RuboCop::Cop::Lint::ConstantDefinitionInBlock::MSG = T.let(T.unsafe(nil), String)
-# Checks for overwriting an exception with an exception result by use `rescue =>`.
+# Checks for overwriting an exception with an exception result by use ``rescue =>``.
#
# You intended to write as `rescue StandardError`.
# However, you have written `rescue => StandardError`.
@@ -17303,31 +17344,39 @@ RuboCop::Cop::Lint::ConstantResolution::MSG = T.let(T.unsafe(nil), String)
#
# source://rubocop//lib/rubocop/cop/lint/debugger.rb#67
class RuboCop::Cop::Lint::Debugger < ::RuboCop::Cop::Base
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#70
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#71
def on_send(node); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#95
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#117
+ def assumed_argument?(node); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#96
def assumed_usage_context?(node); end
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#102
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#106
def chained_method_name(send_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#89
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#90
def debugger_method?(send_node); end
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#82
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#83
def debugger_methods; end
- # source://rubocop//lib/rubocop/cop/lint/debugger.rb#78
+ # source://rubocop//lib/rubocop/cop/lint/debugger.rb#79
def message(node); end
end
+# source://rubocop//lib/rubocop/cop/lint/debugger.rb#69
+RuboCop::Cop::Lint::Debugger::BLOCK_TYPES = T.let(T.unsafe(nil), Array)
+
# source://rubocop//lib/rubocop/cop/lint/debugger.rb#68
RuboCop::Cop::Lint::Debugger::MSG = T.let(T.unsafe(nil), String)
@@ -18327,7 +18376,7 @@ RuboCop::Cop::Lint::ElseLayout::MSG = T.let(T.unsafe(nil), String)
# Checks for blocks without a body.
# Such empty blocks are typically an oversight or we should provide a comment
-# be clearer what we're aiming for.
+# to clarify what we're aiming for.
#
# Empty lambdas and procs are ignored by default.
#
@@ -19032,13 +19081,9 @@ RuboCop::Cop::Lint::FlipFlop::MSG = T.let(T.unsafe(nil), String)
# floating-point value representation to be exactly the same, which is very unlikely
# if you perform any arithmetic operations involving precision loss.
#
-# @example
-# # bad
-# x == 0.1
-# x != 0.1
-#
-# # good - using BigDecimal
-# x.to_d == 0.1.to_d
+# # good - comparing against zero
+# x == 0.0
+# x != 0.0
#
# # good
# (x - 0.1).abs < Float::EPSILON
@@ -19050,38 +19095,51 @@ RuboCop::Cop::Lint::FlipFlop::MSG = T.let(T.unsafe(nil), String)
# # Or some other epsilon based type of comparison:
# # https://www.embeddeduse.com/2019/08/26/qt-compare-two-floats/
#
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#31
+# @example
+# # bad
+# x == 0.1
+# x != 0.1
+#
+# # good - using BigDecimal
+# x.to_d == 0.1.to_d
+#
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#35
class RuboCop::Cop::Lint::FloatComparison < ::RuboCop::Cop::Base
- # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#40
+ # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#44
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#79
+ # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#89
def check_numeric_returning_method(node); end
- # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#63
+ # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#73
def check_send(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#47
+ # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#53
def float?(node); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#68
+ def literal_zero?(node); end
end
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#34
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#38
RuboCop::Cop::Lint::FloatComparison::EQUALITY_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#36
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#40
RuboCop::Cop::Lint::FloatComparison::FLOAT_INSTANCE_METHODS = T.let(T.unsafe(nil), Set)
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#35
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#39
RuboCop::Cop::Lint::FloatComparison::FLOAT_RETURNING_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#32
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#36
RuboCop::Cop::Lint::FloatComparison::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#38
+# source://rubocop//lib/rubocop/cop/lint/float_comparison.rb#42
RuboCop::Cop::Lint::FloatComparison::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Identifies Float literals which are, like, really really really
@@ -19275,6 +19333,9 @@ class RuboCop::Cop::Lint::HashCompareByIdentity < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/lint/hash_compare_by_identity.rb#37
def id_as_hash_key?(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/lint/hash_compare_by_identity.rb#41
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/lint/hash_compare_by_identity.rb#41
def on_send(node); end
end
@@ -19721,6 +19782,43 @@ end
# source://rubocop//lib/rubocop/cop/lint/interpolation_check.rb#28
RuboCop::Cop::Lint::InterpolationCheck::MSG = T.let(T.unsafe(nil), String)
+# Emulates the following Ruby warning in Ruby 3.3.
+#
+# [source,ruby]
+# ----
+# $ ruby -e '0.times { it }'
+# -e:1: warning: `it` calls without arguments will refer to the first block param in Ruby 3.4;
+# use it() or self.it
+# ----
+#
+# `it` calls without arguments will refer to the first block param in Ruby 3.4.
+# So use `it()` or `self.it` to ensure compatibility.
+#
+# @example
+#
+# # bad
+# do_something { it }
+#
+# # good
+# do_something { it() }
+# do_something { self.it }
+#
+# source://rubocop//lib/rubocop/cop/lint/it_without_arguments_in_block.rb#27
+class RuboCop::Cop::Lint::ItWithoutArgumentsInBlock < ::RuboCop::Cop::Base
+ include ::RuboCop::AST::NodePattern::Macros
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/it_without_arguments_in_block.rb#48
+ def deprecated_it_method?(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/it_without_arguments_in_block.rb#33
+ def on_block(node); end
+end
+
+# source://rubocop//lib/rubocop/cop/lint/it_without_arguments_in_block.rb#30
+RuboCop::Cop::Lint::ItWithoutArgumentsInBlock::MSG = T.let(T.unsafe(nil), String)
+
# Checks uses of lambda without a literal block.
# It emulates the following warning in Ruby 3.0:
#
@@ -19855,6 +19953,70 @@ end
# source://rubocop//lib/rubocop/cop/lint/literal_as_condition.rb#38
RuboCop::Cop::Lint::LiteralAsCondition::MSG = T.let(T.unsafe(nil), String)
+# Checks for literal assignments in the conditions of `if`, `while`, and `until`.
+# It emulates the following Ruby warning:
+#
+# [source,console]
+# ----
+# $ ruby -we 'if x = true; end'
+# -e:1: warning: found `= literal' in conditional, should be ==
+# ----
+#
+# As a lint cop, it cannot be determined if `==` is appropriate as intended,
+# therefore this cop does not provide autocorrection.
+#
+# @example
+#
+# # bad
+# if x = 42
+# do_something
+# end
+#
+# # good
+# if x == 42
+# do_something
+# end
+#
+# # good
+# if x = y
+# do_something
+# end
+#
+# source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#35
+class RuboCop::Cop::Lint::LiteralAssignmentInCondition < ::RuboCop::Cop::Base
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#39
+ def on_if(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#39
+ def on_until(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#39
+ def on_while(node); end
+
+ private
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#62
+ def forbidden_literal?(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#72
+ def offense_range(asgn_node, rhs); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#68
+ def parallel_assignment_with_splat_operator?(node); end
+
+ # @yield [node]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#56
+ def traverse_node(node, &block); end
+end
+
+# source://rubocop//lib/rubocop/cop/lint/literal_assignment_in_condition.rb#36
+RuboCop::Cop::Lint::LiteralAssignmentInCondition::MSG = T.let(T.unsafe(nil), String)
+
# Checks for interpolated literals.
#
# @example
@@ -20542,22 +20704,16 @@ class RuboCop::Cop::Lint::NextWithoutAccumulator < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#28
def on_block(node); end
- # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#51
+ # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#42
def on_block_body_of_reduce(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#38
+ # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#28
def on_numblock(node); end
- # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#56
- def on_numblock_body_of_reduce(param0 = T.unsafe(nil)); end
-
private
- # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#60
+ # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#49
def parent_block_node(node); end
-
- # source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#64
- def parent_numblock_node(node); end
end
# source://rubocop//lib/rubocop/cop/lint/next_without_accumulator.rb#26
@@ -20649,92 +20805,91 @@ RuboCop::Cop::Lint::NoReturnInBeginEndBlocks::MSG = T.let(T.unsafe(nil), String)
#
# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#44
class RuboCop::Cop::Lint::NonAtomicFileOperation < ::RuboCop::Cop::Base
- include ::RuboCop::Cop::Alignment
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#77
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#76
def explicit_not_force?(param0); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#72
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#71
def force?(param0); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#81
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#80
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#67
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#66
def receiver_and_method_name(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#62
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#61
def send_exist_node(param0); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#98
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#97
def allowable_use_with_if?(if_node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#122
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#121
def autocorrect(corrector, node, range); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#133
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#132
def autocorrect_replace_method(corrector, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#152
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#151
def force_method?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#160
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#159
def force_method_name?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#156
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#155
def force_option?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#92
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#91
def if_node_child?(node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#113
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#112
def message_change_force_method(node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#117
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#116
def message_remove_file_exist_check(node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#102
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#101
def register_offense(node, exist_node); end
- # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#140
+ # source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#139
def replacement_method(node); end
end
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#51
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#50
RuboCop::Cop::Lint::NonAtomicFileOperation::MAKE_FORCE_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#52
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#51
RuboCop::Cop::Lint::NonAtomicFileOperation::MAKE_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#50
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#49
RuboCop::Cop::Lint::NonAtomicFileOperation::MSG_CHANGE_FORCE_METHOD = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#48
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#47
RuboCop::Cop::Lint::NonAtomicFileOperation::MSG_REMOVE_FILE_EXIST_CHECK = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#55
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#54
RuboCop::Cop::Lint::NonAtomicFileOperation::RECURSIVE_REMOVE_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#53
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#52
RuboCop::Cop::Lint::NonAtomicFileOperation::REMOVE_FORCE_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#54
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#53
RuboCop::Cop::Lint::NonAtomicFileOperation::REMOVE_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#56
+# source://rubocop//lib/rubocop/cop/lint/non_atomic_file_operation.rb#55
RuboCop::Cop::Lint::NonAtomicFileOperation::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# `Dir[...]` and `Dir.glob(...)` do not make any guarantees about
@@ -20791,10 +20946,10 @@ RuboCop::Cop::Lint::NonAtomicFileOperation::RESTRICT_ON_SEND = T.let(T.unsafe(ni
class RuboCop::Cop::Lint::NonDeterministicRequireOrder < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#174
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#172
def loop_variable(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#157
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#155
def method_require?(param0 = T.unsafe(nil)); end
# source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#65
@@ -20806,19 +20961,19 @@ class RuboCop::Cop::Lint::NonDeterministicRequireOrder < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#77
def on_numblock(node); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#147
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#145
def unsorted_dir_block?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#152
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#150
def unsorted_dir_each?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#168
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#166
def unsorted_dir_each_pass?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#162
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#160
def unsorted_dir_glob_pass?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#179
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#177
def var_is_required?(param0, param1); end
private
@@ -20838,12 +20993,12 @@ class RuboCop::Cop::Lint::NonDeterministicRequireOrder < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#138
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#136
def unsorted_dir_loop?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#142
+ # source://rubocop//lib/rubocop/cop/lint/non_deterministic_require_order.rb#140
def unsorted_dir_pass?(node); end
end
@@ -20918,7 +21073,7 @@ RuboCop::Cop::Lint::NonLocalExitFromIterator::MSG = T.let(T.unsafe(nil), String)
#
# Conversion with `Integer`, `Float`, etc. will raise an `ArgumentError`
# if given input that is not numeric (eg. an empty string), whereas
-# `to_i`, etc. will try to convert regardless of input (`''.to_i => 0`).
+# `to_i`, etc. will try to convert regardless of input (``''.to_i => 0``).
# As such, this cop is disabled by default because it's not necessarily
# always correct to raise if a value is not numeric.
#
@@ -20976,7 +21131,10 @@ class RuboCop::Cop::Lint::NumberConversion < ::RuboCop::Cop::Base
include ::RuboCop::Cop::AllowedPattern
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#103
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#107
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#107
def on_send(node); end
# source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#93
@@ -20989,43 +21147,43 @@ class RuboCop::Cop::Lint::NumberConversion < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#160
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#165
def allow_receiver?(receiver); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#172
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#177
def allowed_method_name?(name); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#182
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#187
def conversion_method?(method_name); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#146
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#151
def correct_method(node, receiver); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#150
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#155
def correct_sym_method(to_method); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#129
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#134
def handle_as_symbol(node); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#110
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#115
def handle_conversion_method(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#190
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#195
def ignored_class?(name); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#186
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#191
def ignored_classes; end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#155
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#160
def remove_parentheses(corrector, node); end
- # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#176
+ # source://rubocop//lib/rubocop/cop/lint/number_conversion.rb#181
def top_receiver(node); end
end
@@ -21873,48 +22031,52 @@ RuboCop::Cop::Lint::RedundantRegexpQuantifiers::MSG_REDUNDANT_QUANTIFIER = T.let
# # good
# require 'unloaded_feature'
#
-# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#34
+# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#38
class RuboCop::Cop::Lint::RedundantRequireStatement < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#57
+ # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#61
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#53
+ # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#57
def pp_const?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#47
+ # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#51
def redundant_require_statement?(param0 = T.unsafe(nil)); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#87
+ # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#91
def need_to_require_pp?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#76
+ # source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#80
def redundant_feature?(feature_name); end
end
-# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#38
+# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#42
RuboCop::Cop::Lint::RedundantRequireStatement::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#41
+# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#45
RuboCop::Cop::Lint::RedundantRequireStatement::PRETTY_PRINT_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#39
+# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#43
RuboCop::Cop::Lint::RedundantRequireStatement::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#40
+# source://rubocop//lib/rubocop/cop/lint/redundant_require_statement.rb#44
RuboCop::Cop::Lint::RedundantRequireStatement::RUBY_22_LOADED_FEATURES = T.let(T.unsafe(nil), Array)
# Checks for redundant safe navigation calls.
-# `instance_of?`, `kind_of?`, `is_a?`, `eql?`, `respond_to?`, and `equal?` methods
-# are checked by default. These are customizable with `AllowedMethods` option.
+# Use cases where a constant, named in camel case for classes and modules is `nil` are rare,
+# and an offense is not detected when the receiver is a snake case constant.
+#
+# For all receivers, the `instance_of?`, `kind_of?`, `is_a?`, `eql?`, `respond_to?`,
+# and `equal?` methods are checked by default.
+# These are customizable with `AllowedMethods` option.
#
# The `AllowedMethods` option specifies nil-safe methods,
# in other words, it is a method that is allowed to skip safe navigation.
@@ -21926,6 +22088,9 @@ RuboCop::Cop::Lint::RedundantRequireStatement::RUBY_22_LOADED_FEATURES = T.let(T
#
# @example
# # bad
+# CamelCaseConst&.do_something
+#
+# # bad
# do_something if attrs&.respond_to?(:[])
#
# # good
@@ -21937,12 +22102,31 @@ RuboCop::Cop::Lint::RedundantRequireStatement::RUBY_22_LOADED_FEATURES = T.let(T
# end
#
# # good
+# CamelCaseConst.do_something
+#
+# # good
# while node.is_a?(BeginNode)
# node = node.parent
# end
#
# # good - without `&.` this will always return `true`
# foo&.respond_to?(:to_a)
+#
+# # bad - for `nil`s conversion methods return default values for the type
+# foo&.to_h || {}
+# foo&.to_h { |k, v| [k, v] } || {}
+# foo&.to_a || []
+# foo&.to_i || 0
+# foo&.to_f || 0.0
+# foo&.to_s || ''
+#
+# # good
+# foo.to_h
+# foo.to_h { |k, v| [k, v] }
+# foo.to_a
+# foo.to_i
+# foo.to_f
+# foo.to_s
# @example AllowedMethods: [nil_safe_method]
# # bad
# do_something if attrs&.nil_safe_method(:[])
@@ -21951,37 +22135,49 @@ RuboCop::Cop::Lint::RedundantRequireStatement::RUBY_22_LOADED_FEATURES = T.let(T
# do_something if attrs.nil_safe_method(:[])
# do_something if attrs&.not_nil_safe_method(:[])
#
-# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#51
+# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#77
class RuboCop::Cop::Lint::RedundantSafeNavigation < ::RuboCop::Cop::Base
include ::RuboCop::Cop::AllowedMethods
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#65
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#95
+ def conversion_with_default?(param0 = T.unsafe(nil)); end
+
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#107
def on_csend(node); end
- # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#61
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#117
+ def on_or(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#90
def respond_to_nil_specific_method?(param0 = T.unsafe(nil)); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#75
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#134
def check?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#85
+ # source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#144
def condition?(parent, node); end
end
-# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#56
+# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#82
RuboCop::Cop::Lint::RedundantSafeNavigation::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#58
+# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#83
+RuboCop::Cop::Lint::RedundantSafeNavigation::MSG_LITERAL = T.let(T.unsafe(nil), String)
+
+# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#85
RuboCop::Cop::Lint::RedundantSafeNavigation::NIL_SPECIFIC_METHODS = T.let(T.unsafe(nil), Set)
+# source://rubocop//lib/rubocop/cop/lint/redundant_safe_navigation.rb#87
+RuboCop::Cop::Lint::RedundantSafeNavigation::SNAKE_CASE = T.let(T.unsafe(nil), Regexp)
+
# Checks for unneeded usages of splat expansion
#
# @example
@@ -22651,24 +22847,24 @@ class RuboCop::Cop::Lint::SafeNavigationChain < ::RuboCop::Cop::Base
# @param send_node [RuboCop::AST::SendNode]
# @return [String]
#
- # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#63
+ # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#62
def add_safe_navigation_operator(offense_range:, send_node:); end
# @param corrector [RuboCop::Cop::Corrector]
# @param offense_range [Parser::Source::Range]
# @param send_node [RuboCop::AST::SendNode]
#
- # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#82
+ # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#81
def autocorrect(corrector, offense_range:, send_node:); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#91
+ # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#90
def brackets?(send_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#95
+ # source://rubocop//lib/rubocop/cop/lint/safe_navigation_chain.rb#94
def require_parentheses?(send_node); end
end
@@ -22822,55 +23018,74 @@ RuboCop::Cop::Lint::ScriptPermission::SHEBANG = T.let(T.unsafe(nil), String)
# foo = foo
# foo, bar = foo, bar
# Foo = Foo
+# hash['foo'] = hash['foo']
+# obj.attr = obj.attr
#
# # good
# foo = bar
# foo, bar = bar, foo
# Foo = Bar
+# hash['foo'] = hash['bar']
+# obj.attr = obj.attr2
#
-# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#19
+# # good (method calls possibly can return different results)
+# hash[foo] = hash[foo]
+#
+# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#26
class RuboCop::Cop::Lint::SelfAssignment < ::RuboCop::Cop::Base
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#53
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#69
def on_and_asgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#41
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#57
def on_casgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#29
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#36
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#45
def on_cvasgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#29
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#45
def on_gvasgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#29
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#45
def on_ivasgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#29
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#45
def on_lvasgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#49
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#65
def on_masgn(node); end
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#53
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#69
def on_or_asgn(node); end
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#36
+ def on_send(node); end
+
private
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#103
+ def handle_attribute_assignment(node); end
+
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#92
+ def handle_key_assignment(node); end
+
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#61
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#77
def multiple_self_assignment?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#71
+ # source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#87
def rhs_matches_lhs?(rhs, lhs); end
end
-# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#22
+# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#29
RuboCop::Cop::Lint::SelfAssignment::ASSIGNMENT_TYPE_TO_RHS_TYPE = T.let(T.unsafe(nil), Hash)
-# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#20
+# source://rubocop//lib/rubocop/cop/lint/self_assignment.rb#27
RuboCop::Cop::Lint::SelfAssignment::MSG = T.let(T.unsafe(nil), String)
# Checks for `send`, `public_send`, and `__send__` methods
@@ -23394,6 +23609,7 @@ RuboCop::Cop::Lint::SuppressedException::MSG = T.let(T.unsafe(nil), String)
# 'underscored_string'.to_sym
# :'underscored_symbol'
# 'hyphenated-string'.to_sym
+# "string_#{interpolation}".to_sym
#
# # good
# :string
@@ -23401,6 +23617,7 @@ RuboCop::Cop::Lint::SuppressedException::MSG = T.let(T.unsafe(nil), String)
# :underscored_string
# :underscored_symbol
# :'hyphenated-string'
+# :"string_#{interpolation}"
# @example EnforcedStyle: strict (default)
#
# # bad
@@ -23436,60 +23653,60 @@ RuboCop::Cop::Lint::SuppressedException::MSG = T.let(T.unsafe(nil), String)
# b: 2
# }
#
-# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#66
+# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#68
class RuboCop::Cop::Lint::SymbolConversion < ::RuboCop::Cop::Base
include ::RuboCop::Cop::ConfigurableEnforcedStyle
include ::RuboCop::Cop::SymbolHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#100
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#105
def on_hash(node); end
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#76
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#78
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#83
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#88
def on_sym(node); end
private
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#142
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#147
def correct_hash_key(node); end
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#161
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#166
def correct_inconsistent_hash_keys(keys); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#134
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#139
def in_alias?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#138
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#143
def in_percent_literal_array?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#121
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#126
def properly_quoted?(source, value); end
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#117
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#122
def register_offense(node, correction:, message: T.unsafe(nil)); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#130
+ # source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#135
def requires_quotes?(sym_node); end
end
-# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#71
+# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#73
RuboCop::Cop::Lint::SymbolConversion::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#72
+# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#74
RuboCop::Cop::Lint::SymbolConversion::MSG_CONSISTENCY = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#74
+# source://rubocop//lib/rubocop/cop/lint/symbol_conversion.rb#76
RuboCop::Cop::Lint::SymbolConversion::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Repacks Parser's diagnostics/errors
@@ -25193,7 +25410,7 @@ class RuboCop::Cop::Lint::UselessSetterCall::MethodVariableTracker
end
# Checks for uses of `Integer#times` that will never yield
-# (when the integer <= 0) or that will only ever yield once
+# (when the integer ``<= 0``) or that will only ever yield once
# (`1.times`).
#
# @example
@@ -25261,6 +25478,16 @@ RuboCop::Cop::Lint::UselessTimes::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Checks for operators, variables, literals, lambda, proc and nonmutating
# methods used in void context.
#
+# `each` blocks are allowed to prevent false positives.
+# For example, the expression inside the `each` block below.
+# It's not void, especially when the receiver is an `Enumerator`:
+#
+# [source,ruby]
+# ----
+# enumerator = [1, 2, 3].filter
+# enumerator.each { |item| item >= 2 } #=> [2, 3]
+# ----
+#
# @example CheckForMethodsWithNoSideEffects: false (default)
# # bad
# def some_method
@@ -25295,101 +25522,109 @@ RuboCop::Cop::Lint::UselessTimes::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# do_something(some_array)
# end
#
-# source://rubocop//lib/rubocop/cop/lint/void.rb#43
+# source://rubocop//lib/rubocop/cop/lint/void.rb#53
class RuboCop::Cop::Lint::Void < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/lint/void.rb#80
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#92
def on_begin(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#71
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#82
def on_block(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#80
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#92
def on_kwbegin(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#71
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#82
def on_numblock(node); end
private
- # source://rubocop//lib/rubocop/cop/lint/void.rb#194
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#212
def autocorrect_nonmutating_send(corrector, node, suggestion); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#190
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#208
def autocorrect_void_expression(corrector, node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#178
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#196
def autocorrect_void_op(corrector, node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#87
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#99
def check_begin(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#93
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#108
def check_expression(expr); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#128
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#146
def check_literal(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#152
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#170
def check_nonmutating(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#136
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#154
def check_self(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#113
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#128
def check_var(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#144
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#162
def check_void_expression(node); end
- # source://rubocop//lib/rubocop/cop/lint/void.rb#104
- def check_void_op(node); end
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#118
+ def check_void_op(node, &block); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/lint/void.rb#170
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#221
+ def entirely_literal?(node); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/lint/void.rb#188
def in_void_context?(node); end
end
-# source://rubocop//lib/rubocop/cop/lint/void.rb#55
+# source://rubocop//lib/rubocop/cop/lint/void.rb#66
RuboCop::Cop::Lint::Void::BINARY_OPERATORS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#52
+# source://rubocop//lib/rubocop/cop/lint/void.rb#60
+RuboCop::Cop::Lint::Void::CONST_MSG = T.let(T.unsafe(nil), String)
+
+# source://rubocop//lib/rubocop/cop/lint/void.rb#63
RuboCop::Cop::Lint::Void::EXPRESSION_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#50
+# source://rubocop//lib/rubocop/cop/lint/void.rb#61
RuboCop::Cop::Lint::Void::LIT_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#66
+# source://rubocop//lib/rubocop/cop/lint/void.rb#77
RuboCop::Cop::Lint::Void::METHODS_REPLACEABLE_BY_EACH = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#68
+# source://rubocop//lib/rubocop/cop/lint/void.rb#79
RuboCop::Cop::Lint::Void::NONMUTATING_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#59
+# source://rubocop//lib/rubocop/cop/lint/void.rb#70
RuboCop::Cop::Lint::Void::NONMUTATING_METHODS_WITH_BANG_VERSION = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#53
+# source://rubocop//lib/rubocop/cop/lint/void.rb#64
RuboCop::Cop::Lint::Void::NONMUTATING_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#57
+# source://rubocop//lib/rubocop/cop/lint/void.rb#68
RuboCop::Cop::Lint::Void::OPERATORS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#48
+# source://rubocop//lib/rubocop/cop/lint/void.rb#58
RuboCop::Cop::Lint::Void::OP_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#51
+# source://rubocop//lib/rubocop/cop/lint/void.rb#62
RuboCop::Cop::Lint::Void::SELF_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#56
+# source://rubocop//lib/rubocop/cop/lint/void.rb#67
RuboCop::Cop::Lint::Void::UNARY_OPERATORS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#49
+# source://rubocop//lib/rubocop/cop/lint/void.rb#59
RuboCop::Cop::Lint::Void::VAR_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/lint/void.rb#58
+# source://rubocop//lib/rubocop/cop/lint/void.rb#69
RuboCop::Cop::Lint::Void::VOID_CONTEXT_TYPES = T.let(T.unsafe(nil), Array)
# Common functionality for obtaining source ranges from regexp matches
@@ -25601,9 +25836,9 @@ module RuboCop::Cop::Metrics; end
#
# Interpreting ABC size:
#
-# * <= 17 satisfactory
-# * 18..30 unsatisfactory
-# * > 30 dangerous
+# * ``<= 17`` satisfactory
+# * `18..30` unsatisfactory
+# * `>` 30 dangerous
#
# You can have repeated "attributes" calls count as a single "branch".
# For this purpose, attributes are any method with no argument; no attempt
@@ -25652,13 +25887,12 @@ RuboCop::Cop::Metrics::AbcSize::MSG = T.let(T.unsafe(nil), String)
# Available are: 'array', 'hash', 'heredoc', and 'method_call'. Each construct
# will be counted as one line regardless of its actual size.
#
+# NOTE: This cop does not apply for `Struct` definitions.
#
# NOTE: The `ExcludedMethods` configuration is deprecated and only kept
# for backwards compatibility. Please use `AllowedMethods` and `AllowedPatterns`
# instead. By default, there are no methods to allowed.
#
-# NOTE: This cop does not apply for `Struct` definitions.
-#
# @example CountAsOne: ['array', 'heredoc', 'method_call']
#
# something do
@@ -25784,18 +26018,18 @@ RuboCop::Cop::Metrics::BlockNesting::NESTING_BLOCKS = T.let(T.unsafe(nil), Array
class RuboCop::Cop::Metrics::ClassLength < ::RuboCop::Cop::Base
include ::RuboCop::Cop::CodeLength
- # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#47
+ # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#52
def on_casgn(node); end
# source://rubocop//lib/rubocop/cop/metrics/class_length.rb#42
def on_class(node); end
- # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#42
+ # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#46
def on_sclass(node); end
private
- # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#65
+ # source://rubocop//lib/rubocop/cop/metrics/class_length.rb#70
def message(length, max_length); end
end
@@ -27337,7 +27571,7 @@ class RuboCop::Cop::Naming::ConstantName < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/naming/constant_name.rb#27
def class_or_struct_return_method?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#69
+ # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#68
def literal_receiver?(param0 = T.unsafe(nil)); end
# source://rubocop//lib/rubocop/cop/naming/constant_name.rb#33
@@ -27352,7 +27586,7 @@ class RuboCop::Cop::Naming::ConstantName < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#74
+ # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#73
def allowed_conditional_expression_on_rhs?(node); end
# @return [Boolean]
@@ -27362,7 +27596,7 @@ class RuboCop::Cop::Naming::ConstantName < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#78
+ # source://rubocop//lib/rubocop/cop/naming/constant_name.rb#77
def contains_constant?(node); end
end
@@ -30675,22 +30909,26 @@ RuboCop::Cop::Style::AndOr::MSG = T.let(T.unsafe(nil), String)
#
# This cop also identifies places where `use_args(*args)`/`use_kwargs(**kwargs)` can be
# replaced by `use_args(*)`/`use_kwargs(**)`; if desired, this functionality can be disabled
-# by setting UseAnonymousForwarding: false.
+# by setting `UseAnonymousForwarding: false`.
#
-# @example
-# # bad
-# def foo(*args, &block)
-# bar(*args, &block)
-# end
+# And this cop has `RedundantRestArgumentNames`, `RedundantKeywordRestArgumentNames`,
+# and `RedundantBlockArgumentNames` options. This configuration is a list of redundant names
+# that are sufficient for anonymizing meaningless naming.
+#
+# Meaningless names that are commonly used can be anonymized by default:
+# e.g., `*args`, `**options`, `&block`, and so on.
+#
+# Names not on this list are likely to be meaningful and are allowed by default.
#
+# @example RedundantBlockArgumentNames: ['blk', 'block', 'proc'] (default)
# # bad
-# def foo(*args, **kwargs, &block)
-# bar(*args, **kwargs, &block)
+# def foo(&block)
+# bar(&block)
# end
#
# # good
-# def foo(...)
-# bar(...)
+# def foo(&)
+# bar(&)
# end
# @example UseAnonymousForwarding: true (default, only relevant for Ruby >= 3.2)
# # bad
@@ -30730,191 +30968,237 @@ RuboCop::Cop::Style::AndOr::MSG = T.let(T.unsafe(nil), String)
# def foo(**kwargs)
# bar(**kwargs)
# end
+# @example RedundantRestArgumentNames: ['args', 'arguments'] (default)
+# # bad
+# def foo(*args)
+# bar(*args)
+# end
#
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#75
+# # good
+# def foo(*)
+# bar(*)
+# end
+# @example RedundantKeywordRestArgumentNames: ['kwargs', 'options', 'opts'] (default)
+# # bad
+# def foo(**kwargs)
+# bar(**kwargs)
+# end
+#
+# # good
+# def foo(**)
+# bar(**)
+# end
+# @example
+# # bad
+# def foo(*args, &block)
+# bar(*args, &block)
+# end
+#
+# # bad
+# def foo(*args, **kwargs, &block)
+# bar(*args, **kwargs, &block)
+# end
+#
+# # good
+# def foo(...)
+# bar(...)
+# end
+#
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#116
class RuboCop::Cop::Style::ArgumentsForwarding < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
extend ::RuboCop::Cop::TargetRubyVersion
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#89
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#134
def on_def(node); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#89
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#134
def on_defs(node); end
private
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#122
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#174
def add_forward_all_offenses(node, send_classifications, forwardable_args); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#233
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#295
def add_parens_if_missing(node, corrector); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#131
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#183
def add_post_ruby_32_offenses(def_node, send_classifications, forwardable_args); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#225
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#287
def allow_only_rest_arguments?; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#217
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#279
def arguments_range(node, first_node); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#174
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#226
def classification_and_forwards(def_node, send_node, referenced_lvars, forwardable_args); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#159
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#211
def classify_send_nodes(def_node, send_nodes, referenced_lvars, forwardable_args); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#114
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#158
def extract_forwardable_args(args); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#149
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#201
def non_splat_or_block_pass_lvar_references(body); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#118
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#170
def only_forwards_all?(send_classifications); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#207
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#162
+ def redundant_forwardable_named_args(restarg, kwrestarg, blockarg); end
+
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#243
+ def redundant_named_arg(arg, config_name, keyword); end
+
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#269
def register_forward_all_offense(def_or_send, send_or_arguments, rest_or_splat); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#191
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#253
def register_forward_args_offense(def_arguments_or_send, rest_arg_or_splat); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#199
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#261
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#229
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#291
def use_anonymous_forwarding?; end
+
+ class << self
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#130
+ def autocorrect_incompatible_with; end
+ end
end
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#83
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#124
RuboCop::Cop::Style::ArgumentsForwarding::ADDITIONAL_ARG_TYPES = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#86
+# 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#82
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#123
RuboCop::Cop::Style::ArgumentsForwarding::FORWARDING_LVAR_TYPES = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#85
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#126
RuboCop::Cop::Style::ArgumentsForwarding::FORWARDING_MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#87
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#128
RuboCop::Cop::Style::ArgumentsForwarding::KWARGS_MSG = T.let(T.unsafe(nil), String)
# Classifies send nodes for possible rest/kwrest/all (including block) forwarding.
#
-# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#240
+# source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#302
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#252
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#314
def initialize(def_node, send_node, referenced_lvars, forwardable_args, **config); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#280
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#342
def classification; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#247
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#309
def extract_forwarded_kwrest_arg(param0 = T.unsafe(nil), param1); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#274
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#336
def forwarded_block_arg; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#250
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#312
def forwarded_block_arg?(param0 = T.unsafe(nil), param1); end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#268
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#330
def forwarded_kwrest_arg; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#262
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#324
def forwarded_rest_arg; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#244
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#306
def forwarded_rest_arg?(param0 = T.unsafe(nil), param1); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#348
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#410
def additional_kwargs?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#344
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#406
def additional_kwargs_or_forwarded_kwargs?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#358
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#420
def allow_offense_for_no_block?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#329
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#391
def any_arg_referenced?; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#313
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#375
def arguments; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#292
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#354
def can_forward_all?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#352
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#414
def forward_additional_kwargs?; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#309
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#371
def forwarded_rest_and_kwrest_args; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#362
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#424
def no_additional_args?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#337
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#399
def no_post_splat_args?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#305
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#367
def offensive_block_forwarding?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#325
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#387
def referenced_block_arg?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#321
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#383
def referenced_kwrest_arg?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#317
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#379
def referenced_rest_arg?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#301
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#363
def ruby_32_missing_rest_or_kwest?; end
- # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#333
+ # source://rubocop//lib/rubocop/cop/style/arguments_forwarding.rb#395
def target_ruby_version; end
end
@@ -30956,6 +31240,46 @@ RuboCop::Cop::Style::ArrayCoercion::CHECK_MSG = T.let(T.unsafe(nil), String)
# source://rubocop//lib/rubocop/cop/style/array_coercion.rb#44
RuboCop::Cop::Style::ArrayCoercion::SPLAT_MSG = T.let(T.unsafe(nil), String)
+# Identifies usages of `arr[0]` and `arr[-1]` and suggests to change
+# them to use `arr.first` and `arr.last` instead.
+#
+# The cop is disabled by default due to safety concerns.
+#
+# @example
+# # bad
+# arr[0]
+# arr[-1]
+#
+# # good
+# arr.first
+# arr.last
+# arr[0] = 2
+# arr[0][-2]
+#
+# source://rubocop//lib/rubocop/cop/style/array_first_last.rb#28
+class RuboCop::Cop::Style::ArrayFirstLast < ::RuboCop::Cop::Base
+ extend ::RuboCop::Cop::AutoCorrector
+
+ # source://rubocop//lib/rubocop/cop/style/array_first_last.rb#35
+ def on_send(node); end
+
+ private
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/array_first_last.rb#58
+ def brace_method?(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/array_first_last.rb#53
+ def innermost_braces_node(node); end
+end
+
+# source://rubocop//lib/rubocop/cop/style/array_first_last.rb#31
+RuboCop::Cop::Style::ArrayFirstLast::MSG = T.let(T.unsafe(nil), String)
+
+# source://rubocop//lib/rubocop/cop/style/array_first_last.rb#32
+RuboCop::Cop::Style::ArrayFirstLast::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
+
# In Ruby 3.1, `Array#intersect?` has been added.
#
# This cop identifies places where `(array1 & array2).any?`
@@ -31158,28 +31482,36 @@ RuboCop::Cop::Style::Attr::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# # ...
# end
#
-# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#19
+# # bad
+# f = Tempfile.open('temp')
+#
+# # good
+# Tempfile.open('temp') do |f|
+# # ...
+# end
+#
+# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#27
class RuboCop::Cop::Style::AutoResourceCleanup < ::RuboCop::Cop::Base
- # source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#26
+ # source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#32
+ def file_open_method?(param0 = T.unsafe(nil)); end
+
+ # source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#36
def on_send(node); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#41
+ # source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#46
def cleanup?(node); end
end
-# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#20
+# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#28
RuboCop::Cop::Style::AutoResourceCleanup::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#24
+# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#29
RuboCop::Cop::Style::AutoResourceCleanup::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/auto_resource_cleanup.rb#22
-RuboCop::Cop::Style::AutoResourceCleanup::TARGET_METHODS = T.let(T.unsafe(nil), Hash)
-
# Checks if usage of %() or %Q() matches configuration.
#
# @example EnforcedStyle: bare_percent (default)
@@ -32157,9 +32489,12 @@ class RuboCop::Cop::Style::ClassCheck < ::RuboCop::Cop::Base
include ::RuboCop::Cop::ConfigurableEnforcedStyle
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/class_check.rb#44
+ # source://rubocop//lib/rubocop/cop/style/class_check.rb#45
def message(node); end
+ # source://rubocop//lib/rubocop/cop/style/class_check.rb#33
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/class_check.rb#33
def on_send(node); end
end
@@ -32208,53 +32543,53 @@ RuboCop::Cop::Style::ClassCheck::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# self.class.eq(other.class) && name.eq(other.name)
# end
#
-# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#47
+# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#52
class RuboCop::Cop::Style::ClassEqualityComparison < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
include ::RuboCop::Cop::AllowedMethods
include ::RuboCop::Cop::AllowedPattern
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#59
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#64
def class_comparison_candidate?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#65
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#70
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#87
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#92
def class_name(class_node, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#107
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#112
def class_name_method?(method_name); end
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#123
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#128
def offense_range(receiver_node, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#111
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#116
def require_cbase?(class_node); end
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#119
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#124
def trim_string_quotes(class_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#115
+ # source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#120
def unable_to_determine_type?(class_node); end
end
-# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#56
+# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#61
RuboCop::Cop::Style::ClassEqualityComparison::CLASS_NAME_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#53
+# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#58
RuboCop::Cop::Style::ClassEqualityComparison::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#55
+# source://rubocop//lib/rubocop/cop/style/class_equality_comparison.rb#60
RuboCop::Cop::Style::ClassEqualityComparison::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Checks for uses of the class/module name instead of
@@ -32487,6 +32822,9 @@ class RuboCop::Cop::Style::CollectionCompact < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
extend ::RuboCop::Cop::TargetRubyVersion
+ # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#82
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/collection_compact.rb#82
def on_send(node); end
@@ -32501,18 +32839,18 @@ class RuboCop::Cop::Style::CollectionCompact < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#119
+ # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#120
def good_method_name(node); end
- # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#97
+ # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#98
def offense_range(node); end
- # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#127
+ # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#128
def range(begin_pos_node, end_pos_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#113
+ # source://rubocop//lib/rubocop/cop/style/collection_compact.rb#114
def to_enum_method?(node); end
end
@@ -32705,40 +33043,42 @@ RuboCop::Cop::Style::ColonMethodDefinition::MSG = T.let(T.unsafe(nil), String)
#
# source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#59
class RuboCop::Cop::Style::CombinableLoops < ::RuboCop::Cop::Base
- include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#66
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#64
def on_block(node); end
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#79
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#77
def on_for(node); end
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#66
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#64
def on_numblock(node); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#90
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#88
def collection_looping_method?(node); end
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#107
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#105
def combine_with_left_sibling(corrector, node); end
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#112
+ def correct_end_of_block(corrector, node); end
+
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#95
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#93
def same_collection_looping_block?(node, sibling); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#103
+ # source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#101
def same_collection_looping_for?(node, sibling); end
end
-# source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#64
+# source://rubocop//lib/rubocop/cop/style/combinable_loops.rb#62
RuboCop::Cop::Style::CombinableLoops::MSG = T.let(T.unsafe(nil), String)
# Enforces using `` or %x around command literals.
@@ -33142,20 +33482,23 @@ RuboCop::Cop::Style::ComparableClamp::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Ar
class RuboCop::Cop::Style::ConcatArrayLiterals < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#34
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#34
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#69
+ # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#70
def offense_range(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#86
+ # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#87
def percent_literals_includes_only_basic_literals?(node); end
- # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#73
+ # source://rubocop//lib/rubocop/cop/style/concat_array_literals.rb#74
def preferred_method(node); end
end
@@ -33745,6 +34088,9 @@ class RuboCop::Cop::Style::DateTime < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/date_time.rb#61
def historic_date?(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/style/date_time.rb#70
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/date_time.rb#70
def on_send(node); end
@@ -33753,12 +34099,12 @@ class RuboCop::Cop::Style::DateTime < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/style/date_time.rb#85
+ # source://rubocop//lib/rubocop/cop/style/date_time.rb#86
def autocorrect(corrector, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/date_time.rb#81
+ # source://rubocop//lib/rubocop/cop/style/date_time.rb#82
def disallow_coercion?; end
end
@@ -35508,6 +35854,9 @@ class RuboCop::Cop::Style::ExactRegexpMatch < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#32
def exact_regexp_match(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#40
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#40
def on_send(node); end
@@ -35515,10 +35864,10 @@ class RuboCop::Cop::Style::ExactRegexpMatch < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#55
+ # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#56
def exact_match_pattern?(parsed_regexp); end
- # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#62
+ # source://rubocop//lib/rubocop/cop/style/exact_regexp_match.rb#63
def new_method(node); end
end
@@ -36259,13 +36608,25 @@ RuboCop::Cop::Style::For::PREFER_EACH = T.let(T.unsafe(nil), String)
RuboCop::Cop::Style::For::PREFER_FOR = T.let(T.unsafe(nil), String)
# Enforces the use of a single string formatting utility.
-# Valid options include Kernel#format, Kernel#sprintf and String#%.
+# Valid options include `Kernel#format`, `Kernel#sprintf`, and `String#%`.
#
-# The detection of String#% cannot be implemented in a reliable
+# The detection of `String#%` cannot be implemented in a reliable
# manner for all cases, so only two scenarios are considered -
# if the first argument is a string literal and if the second
# argument is an array literal.
#
+# Autocorrection will be applied when using argument is a literal or known built-in conversion
+# methods such as `to_d`, `to_f`, `to_h`, `to_i`, `to_r`, `to_s`, and `to_sym` on variables,
+# provided that their return value is not an array. For example, when using `to_s`,
+# `'%s' % [1, 2, 3].to_s` can be autocorrected without any incompatibility:
+#
+# [source,ruby]
+# ----
+# '%s' % [1, 2, 3] #=> '1'
+# format('%s', [1, 2, 3]) #=> '[1, 2, 3]'
+# '%s' % [1, 2, 3].to_s #=> '[1, 2, 3]'
+# ----
+#
# @example EnforcedStyle: format (default)
# # bad
# puts sprintf('%10s', 'hoge')
@@ -36288,45 +36649,55 @@ RuboCop::Cop::Style::For::PREFER_FOR = T.let(T.unsafe(nil), String)
# # good
# puts '%10s' % 'hoge'
#
-# source://rubocop//lib/rubocop/cop/style/format_string.rb#38
+# source://rubocop//lib/rubocop/cop/style/format_string.rb#50
class RuboCop::Cop::Style::FormatString < ::RuboCop::Cop::Base
include ::RuboCop::Cop::ConfigurableEnforcedStyle
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#46
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#61
def formatter(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#59
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#74
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#55
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#70
def variable_argument?(param0 = T.unsafe(nil)); end
private
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#81
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#102
def autocorrect(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#97
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#118
def autocorrect_from_percent(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#111
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#132
def autocorrect_to_percent(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#124
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#88
+ def autocorrectable?(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#145
def format_single_parameter(arg); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#73
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#94
def message(detected_style); end
- # source://rubocop//lib/rubocop/cop/style/format_string.rb#77
+ # source://rubocop//lib/rubocop/cop/style/format_string.rb#98
def method_name(style_name); end
end
-# source://rubocop//lib/rubocop/cop/style/format_string.rb#42
+# Known conversion methods whose return value is not an array.
+#
+# source://rubocop//lib/rubocop/cop/style/format_string.rb#58
+RuboCop::Cop::Style::FormatString::AUTOCORRECTABLE_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://rubocop//lib/rubocop/cop/style/format_string.rb#54
RuboCop::Cop::Style::FormatString::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/format_string.rb#43
+# source://rubocop//lib/rubocop/cop/style/format_string.rb#55
RuboCop::Cop::Style::FormatString::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Use a consistent style for named format string tokens.
@@ -36759,6 +37130,25 @@ RuboCop::Cop::Style::GlobalVars::MSG = T.let(T.unsafe(nil), String)
# # good
# foo || raise('exception') if something
# ok
+#
+# # bad
+# define_method(:test) do
+# if something
+# work
+# end
+# end
+#
+# # good
+# define_method(:test) do
+# return unless something
+#
+# work
+# end
+#
+# # also good
+# define_method(:test) do
+# work if something
+# end
# @example AllowConsecutiveConditionals: false (default)
# # bad
# def test
@@ -36795,7 +37185,7 @@ RuboCop::Cop::Style::GlobalVars::MSG = T.let(T.unsafe(nil), String)
# end
# end
#
-# source://rubocop//lib/rubocop/cop/style/guard_clause.rb#95
+# source://rubocop//lib/rubocop/cop/style/guard_clause.rb#114
class RuboCop::Cop::Style::GuardClause < ::RuboCop::Cop::Base
include ::RuboCop::Cop::Alignment
include ::RuboCop::Cop::LineLengthHelp
@@ -36804,83 +37194,89 @@ class RuboCop::Cop::Style::GuardClause < ::RuboCop::Cop::Base
include ::RuboCop::Cop::StatementModifier
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#104
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#132
+ def on_block(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#123
def on_def(node); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#104
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#123
def on_defs(node); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#113
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#139
def on_if(node); end
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#132
+ def on_numblock(node); end
+
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#249
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#275
def accepted_form?(node, ending: T.unsafe(nil)); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#257
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#283
def accepted_if?(node, ending); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#271
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#297
def allowed_consecutive_conditionals?; end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#239
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#265
def and_or_guard_clause?(guard_clause); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#184
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#210
def autocorrect(corrector, node, condition, replacement, guard); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#210
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#236
def autocorrect_heredoc_argument(corrector, node, heredoc_branch, leave_branch, guard); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#133
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#159
def check_ending_body(body); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#144
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#170
def check_ending_if(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#154
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#180
def consecutive_conditionals?(parent, node); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#231
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#257
def guard_clause_source(guard_clause); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#206
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#232
def heredoc?(argument); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#222
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#248
def range_of_branch_to_remove(node, guard); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#162
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#188
def register_offense(node, scope_exiting_keyword, conditional_keyword, guard = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#267
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#293
def remove_whole_lines(corrector, range); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#244
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#270
def too_long_for_single_line?(node, example); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#253
+ # source://rubocop//lib/rubocop/cop/style/guard_clause.rb#279
def trivial?(node); end
end
-# source://rubocop//lib/rubocop/cop/style/guard_clause.rb#101
+# source://rubocop//lib/rubocop/cop/style/guard_clause.rb#120
RuboCop::Cop::Style::GuardClause::MSG = T.let(T.unsafe(nil), String)
# Checks for presence or absence of braces around hash literal as a last
@@ -37040,72 +37436,103 @@ RuboCop::Cop::Style::HashConversion::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Arr
# @example
# # bad
# hash.keys.each { |k| p k }
-# hash.values.each { |v| p v }
+# hash.each { |k, unused_value| p k }
#
# # good
# hash.each_key { |k| p k }
+#
+# # bad
+# hash.values.each { |v| p v }
+# hash.each { |unused_key, v| p v }
+#
+# # good
# hash.each_value { |v| p v }
# @example AllowedReceivers: ['execute']
# # good
# execute(sql).keys.each { |v| p v }
# execute(sql).values.each { |v| p v }
#
-# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#30
+# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#36
class RuboCop::Cop::Style::HashEachMethods < ::RuboCop::Cop::Base
include ::RuboCop::Cop::AllowedReceivers
include ::RuboCop::Cop::Lint::UnusedArgument
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#38
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#50
+ def each_arguments(param0 = T.unsafe(nil)); end
+
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#45
def kv_each(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#43
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#55
def kv_each_with_block_pass(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#47
+ # 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#55
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#85
def on_block_pass(node); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#47
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#60
def on_numblock(node); end
private
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#86
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#159
def check_argument(variable); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#110
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#183
def correct_args(node, corrector); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#96
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#169
def correct_implicit(node, corrector, method_name); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#101
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#174
def correct_key_value_each(node, corrector); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#82
- def format_message(method_name); end
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#155
+ def format_message(method_name, current); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#93
+ def handleable?(node); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#117
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#190
def kv_range(outer_node); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#63
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#122
+ def message(prefer, method_name, unused_code); end
+
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#128
+ def register_each_args_offense(node, message, prefer, unused_range); end
+
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#99
def register_kv_offense(target, method); end
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#72
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#135
def register_kv_with_block_pass_offense(node, target, method); end
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#146
+ def root_receiver(node); end
+
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#92
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#110
+ def unused_block_arg_exist?(node, block_arg); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#165
def used?(arg); end
end
-# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#35
+# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#41
RuboCop::Cop::Style::HashEachMethods::MSG = T.let(T.unsafe(nil), String)
+# source://rubocop//lib/rubocop/cop/style/hash_each_methods.rb#42
+RuboCop::Cop::Style::HashEachMethods::UNUSED_BLOCK_ARG_MSG = T.let(T.unsafe(nil), String)
+
# Checks for usages of `Hash#reject`, `Hash#select`, and `Hash#filter` methods
# that can be replaced with `Hash#except` method.
#
@@ -37141,6 +37568,9 @@ class RuboCop::Cop::Style::HashExcept < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/hash_except.rb#44
def bad_method_with_poro?(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#75
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/hash_except.rb#75
def on_send(node); end
@@ -37148,42 +37578,42 @@ class RuboCop::Cop::Style::HashExcept < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#93
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#94
def bad_method?(block); end
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#165
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#166
def decorate_source(value); end
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#173
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#174
def except_key(node); end
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#152
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#153
def except_key_source(key); end
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#146
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#147
def extract_body_if_negated(body); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#127
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#128
def included?(negated, body); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#131
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#132
def not_included?(negated, body); end
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#182
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#183
def offense_range(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#135
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#136
def safe_to_register_offense?(block, except_key); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/hash_except.rb#111
+ # source://rubocop//lib/rubocop/cop/style/hash_except.rb#112
def semantically_except_method?(send, block); end
end
@@ -37617,40 +38047,43 @@ class RuboCop::Cop::Style::IdenticalConditionalBranches < ::RuboCop::Cop::Base
private
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#181
+ 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#168
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#190
def check_expressions(node, expressions, insert_position); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#156
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#170
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#208
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#230
def expand_elses(branch); end
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#223
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#245
def head(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#192
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#214
def last_child_of_parent?(node); end
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#202
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#224
def message(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#198
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#220
def single_child_branch?(branch_node); end
- # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#219
+ # source://rubocop//lib/rubocop/cop/style/identical_conditional_branches.rb#241
def tail(node); end
end
@@ -38347,10 +38780,13 @@ class RuboCop::Cop::Style::InverseMethods < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#61
def inverse_candidate?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#91
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#92
def on_block(node); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#91
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#78
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#92
def on_numblock(node); end
# source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#78
@@ -38360,39 +38796,39 @@ class RuboCop::Cop::Style::InverseMethods < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#176
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#177
def camel_case_constant?(node); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#120
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#121
def correct_inverse_block(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#111
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#112
def correct_inverse_method(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#127
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#128
def correct_inverse_selector(block, corrector); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#180
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#181
def dot_range(loc); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#163
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#164
def end_parentheses(node, method_call); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#149
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#150
def inverse_blocks; end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#144
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#145
def inverse_methods; end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#190
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#191
def message(method, inverse); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#153
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#154
def negated?(node); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#157
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#158
def not_to_receiver(node, method_call); end
# When comparing classes, `!(Integer < Numeric)` is not the same as
@@ -38400,10 +38836,10 @@ class RuboCop::Cop::Style::InverseMethods < ::RuboCop::Cop::Base
#
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#171
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#172
def possible_class_hierarchy_check?(lhs, rhs, method); end
- # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#184
+ # source://rubocop//lib/rubocop/cop/style/inverse_methods.rb#185
def remove_end_parenthesis(corrector, node, method, method_call); end
class << self
@@ -39095,32 +39531,35 @@ class RuboCop::Cop::Style::MapCompactWithConditionalBlock < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#46
def map_and_compact?(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#72
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#72
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#125
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#126
def range(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#91
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#92
def returns_block_argument?(block_argument_node, return_value_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#95
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#96
def truthy_branch?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#115
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#116
def truthy_branch_for_guard?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#105
+ # source://rubocop//lib/rubocop/cop/style/map_compact_with_conditional_block.rb#106
def truthy_branch_for_if?(node); end
end
@@ -39156,13 +39595,21 @@ class RuboCop::Cop::Style::MapToHash < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#41
def map_to_h?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#48
+ # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#52
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#52
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#62
+ # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#67
def autocorrect(corrector, to_h, map); end
+
+ class << self
+ # source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#48
+ def autocorrect_incompatible_with; end
+ end
end
# source://rubocop//lib/rubocop/cop/style/map_to_hash.rb#37
@@ -39449,12 +39896,12 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#165
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#166
def allowed_chained_call_with_parentheses?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#161
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#162
def allowed_multiline_call_with_parentheses?(node); end
# @return [Boolean]
@@ -39464,17 +39911,17 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#174
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#175
def ambiguous_literal?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#203
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#204
def assigned_before?(node, target); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#211
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#212
def assignment_in_condition?(node); end
# source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#31
@@ -39482,57 +39929,57 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#142
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#143
def call_as_argument_or_chain?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#99
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#100
def call_in_literals?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#110
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#111
def call_in_logical_operators?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#148
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#149
def call_in_match_pattern?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#119
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#120
def call_in_optional_arguments?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#123
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#124
def call_in_single_line_inheritance?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#127
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#128
def call_with_ambiguous_arguments?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#138
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#139
def call_with_braced_block?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#221
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#222
def forwards_anonymous_rest_arguments?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#190
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#191
def hash_literal?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#154
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#155
def hash_literal_in_arguments?(node); end
# @return [Boolean]
@@ -39542,7 +39989,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#207
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#208
def inside_string_interpolation?(node); end
# Require hash value omission be enclosed in parentheses to prevent the following issue:
@@ -39560,7 +40007,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#186
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#187
def logical_operator?(node); end
# source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#40
@@ -39576,7 +40023,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#194
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#195
def regexp_slash_literal?(node); end
# @return [Boolean]
@@ -39586,7 +40033,7 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#178
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#179
def splat?(node); end
# @return [Boolean]
@@ -39601,12 +40048,12 @@ module RuboCop::Cop::Style::MethodCallWithArgsParentheses::OmitParentheses
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#182
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#183
def ternary_if?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#198
+ # source://rubocop//lib/rubocop/cop/style/method_call_with_args_parentheses/omit_parentheses.rb#199
def unary_literal?(node); end
end
@@ -39652,6 +40099,9 @@ RuboCop::Cop::Style::MethodCallWithArgsParentheses::RequireParentheses::REQUIRE_
# This cop can be customized allowed methods with `AllowedMethods`.
# By default, there are no methods to allowed.
#
+# NOTE: This cop allows the use of `it()` without arguments in blocks,
+# as in `0.times { it() }`, following `Lint/ItWithoutArgumentsInBlock` cop.
+#
# @example
# # bad
# object.some_method()
@@ -39665,55 +40115,66 @@ RuboCop::Cop::Style::MethodCallWithArgsParentheses::RequireParentheses::REQUIRE_
# # good
# object.foo()
#
-# source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#26
+# source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#29
class RuboCop::Cop::Style::MethodCallWithoutArgsParentheses < ::RuboCop::Cop::Base
include ::RuboCop::Cop::AllowedMethods
include ::RuboCop::Cop::AllowedPattern
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#33
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#37
def on_send(node); end
private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#60
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#66
def allowed_method_name?(name); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#74
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#94
def any_assignment?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#56
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#62
def default_argument?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#52
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#58
def ineligible_node?(node); end
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#97
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#117
def offense_range(node); end
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#45
+ # Respects `Lint/ItWithoutArgumentsInBlock` cop and the following Ruby 3.3's warning:
+ #
+ # $ ruby -e '0.times { begin; it; end }'
+ # -e:1: warning: `it` calls without arguments will refer to the first block param in
+ # Ruby 3.4; use it() or self.it
+ #
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#86
+ def parenthesized_it_method_in_block?(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#51
def register_offense(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#64
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#70
def same_name_assignment?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#90
+ # source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#110
def variable_in_mass_assignment?(variable_name, node); end
end
-# source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#31
+# source://rubocop//lib/rubocop/cop/style/method_call_without_args_parentheses.rb#34
RuboCop::Cop::Style::MethodCallWithoutArgsParentheses::MSG = T.let(T.unsafe(nil), String)
# Checks for methods called on a do...end block. The point of
@@ -40152,12 +40613,12 @@ RuboCop::Cop::Style::MissingElse::MSG_NIL = T.let(T.unsafe(nil), String)
# defining `respond_to_missing?`.
#
# @example
-# #bad
+# # bad
# def method_missing(name, *args)
# # ...
# end
#
-# #good
+# # good
# def respond_to_missing?(name, include_private)
# # ...
# end
@@ -41587,16 +42048,13 @@ class RuboCop::Cop::Style::NestedTernaryOperator < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#48
+ # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#40
def autocorrect(corrector, if_node); end
- # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#41
- def if_node(node); end
-
- # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#55
+ # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#47
def remove_parentheses(source); end
- # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#61
+ # source://rubocop//lib/rubocop/cop/style/nested_ternary_operator.rb#53
def replace_loc_and_whitespace(corrector, range, replacement); end
end
@@ -42584,8 +43042,8 @@ end
RuboCop::Cop::Style::OpenStructUse::MSG = T.let(T.unsafe(nil), String)
# Checks for redundant dot before operator method call.
-# The target operator methods are `|`, `^`, `&`, `<=>`, `==`, `===`, `=~`, `>`, `>=`, `<`,
-# `<=`, `<<`, `>>`, `+`, `-`, `*`, `/`, `%`, `**`, `~`, `!`, `!=`, and `!~`.
+# The target operator methods are `|`, `^`, `&`, ``<=>``, `==`, `===`, `=~`, `>`, `>=`, `<`,
+# ``<=``, `<<`, `>>`, `+`, `-`, `*`, `/`, `%`, `**`, `~`, `!`, `!=`, and `!~`.
#
# @example
#
@@ -43701,20 +44159,23 @@ class RuboCop::Cop::Style::RedundantArgument < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#64
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#64
def on_send(node); end
private
- # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#93
+ # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#94
def argument_range(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#86
+ # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#87
def redundant_arg_for_method(method_name); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#79
+ # source://rubocop//lib/rubocop/cop/style/redundant_argument.rb#80
def redundant_argument?(node); end
end
@@ -43928,50 +44389,53 @@ class RuboCop::Cop::Style::RedundantBegin < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#169
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#177
def begin_block_has_multiline_statements?(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#161
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#169
def condition_range(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#173
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#181
def contain_rescue_or_ensure?(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#154
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#162
def correct_modifier_form_after_multiline_begin_block(corrector, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#165
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#173
def empty_begin?(node); end
# source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#110
def register_offense(node); end
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#139
+ def remove_begin(corrector, offense_range, node); end
+
# source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#127
def replace_begin_with_statement(corrector, offense_range, node); end
# Restore comments that occur between "begin" and "first_child".
# These comments will be moved to above the assignment line.
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#141
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#149
def restore_removed_comments(corrector, offense_range, node, first_child); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#148
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#156
def use_modifier_form_after_multiline_begin_block?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#186
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#194
def valid_begin_assignment?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#179
+ # source://rubocop//lib/rubocop/cop/style/redundant_begin.rb#187
def valid_context_using_only_begin?(node); end
end
@@ -44332,23 +44796,63 @@ RuboCop::Cop::Style::RedundantCurrentDirectoryInPath::MSG = T.let(T.unsafe(nil),
# # good
# do_something(foo: bar, baz: qux)
#
-# source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#16
+# # bad
+# do_something(**{foo: bar, baz: qux}.merge(options))
+#
+# # good
+# do_something(foo: bar, baz: qux, **options)
+#
+# source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#22
class RuboCop::Cop::Style::RedundantDoubleSplatHashBraces < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#21
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#29
def on_hash(node); end
private
- # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#39
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#45
+ def allowed_double_splat_receiver?(kwsplat); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#55
+ def autocorrect(corrector, node, kwsplat); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#89
+ def autocorrect_merge_methods(corrector, merge_methods, kwsplat); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#85
def closing_brace(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#35
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#111
+ def convert_to_new_arguments(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#107
+ def extract_send_methods(kwsplat); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#123
+ def mergeable?(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#81
def opening_brace(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#100
+ def range_of_merge_methods(merge_methods); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#66
+ def root_receiver(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#75
+ def select_merge_method_nodes(kwsplat); end
end
-# source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#19
+# source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#26
+RuboCop::Cop::Style::RedundantDoubleSplatHashBraces::MERGE_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://rubocop//lib/rubocop/cop/style/redundant_double_splat_hash_braces.rb#25
RuboCop::Cop::Style::RedundantDoubleSplatHashBraces::MSG = T.let(T.unsafe(nil), String)
# Checks for redundant `each`.
@@ -44411,48 +44915,64 @@ RuboCop::Cop::Style::RedundantEach::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Arra
# Checks for RuntimeError as the argument of raise/fail.
#
-# It checks for code like this:
-#
# @example
-# # Bad
+# # bad
# raise RuntimeError, 'message'
-#
-# # Bad
# raise RuntimeError.new('message')
#
-# # Good
+# # good
# raise 'message'
#
-# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#19
+# # bad - message is not a string
+# raise RuntimeError, Object.new
+# raise RuntimeError.new(Object.new)
+#
+# # good
+# raise Object.new.to_s
+#
+# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#23
class RuboCop::Cop::Style::RedundantException < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#59
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#79
def compact?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#54
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#74
def exploded?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#45
+ # Switch `raise RuntimeError, 'message'` to `raise 'message'`, and
+ # `raise RuntimeError.new('message')` to `raise 'message'`.
+ #
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#33
+ def on_send(node); end
+
+ private
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#57
def fix_compact(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#33
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#39
def fix_exploded(node); end
- # Switch `raise RuntimeError, 'message'` to `raise 'message'`, and
- # `raise RuntimeError.new('message')` to `raise 'message'`.
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#65
+ def replaced_compact(message); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#47
+ def replaced_exploded(node, command, message); end
+
+ # @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#29
- def on_send(node); end
+ # source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#53
+ def string_message?(message); end
end
-# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#22
+# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#26
RuboCop::Cop::Style::RedundantException::MSG_1 = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#23
+# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#27
RuboCop::Cop::Style::RedundantException::MSG_2 = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#25
+# source://rubocop//lib/rubocop/cop/style/redundant_exception.rb#29
RuboCop::Cop::Style::RedundantException::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Identifies places where `fetch(key) { value }` can be replaced by `fetch(key, value)`.
@@ -44605,6 +45125,9 @@ RuboCop::Cop::Style::RedundantFileExtensionInRequire::RESTRICT_ON_SEND = T.let(T
# @example AllCops:ActiveSupportExtensionsEnabled: false (default)
# # good
# arr.select { |x| x > 1 }.many?
+#
+# # good
+# arr.select { |x| x > 1 }.present?
# @example AllCops:ActiveSupportExtensionsEnabled: true
# # bad
# arr.select { |x| x > 1 }.many?
@@ -44612,38 +45135,47 @@ RuboCop::Cop::Style::RedundantFileExtensionInRequire::RESTRICT_ON_SEND = T.let(T
# # good
# arr.many? { |x| x > 1 }
#
-# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#38
+# # bad
+# arr.select { |x| x > 1 }.present?
+#
+# # good
+# arr.any? { |x| x > 1 }
+#
+# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#53
class RuboCop::Cop::Style::RedundantFilterChain < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#65
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#81
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#81
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#47
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#62
def select_predicate?(param0 = T.unsafe(nil)); end
private
- # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#91
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#108
def offense_range(select_node, predicate_node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#95
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#112
def predicate_range(predicate_node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#77
+ # source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#94
def register_offense(select_node, predicate_node); end
end
-# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#41
+# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#56
RuboCop::Cop::Style::RedundantFilterChain::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#43
+# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#58
RuboCop::Cop::Style::RedundantFilterChain::RAILS_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#56
+# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#71
RuboCop::Cop::Style::RedundantFilterChain::REPLACEMENT_METHODS = T.let(T.unsafe(nil), Hash)
-# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#44
+# source://rubocop//lib/rubocop/cop/style/redundant_filter_chain.rb#59
RuboCop::Cop::Style::RedundantFilterChain::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Check for uses of `Object#freeze` on immutable objects.
@@ -45013,12 +45545,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#166
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#168
def argument_is_method?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#134
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#136
def argument_newline?(node); end
# @return [Boolean]
@@ -45026,12 +45558,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#100
def ends_with_backslash_without_comment?(source_line); end
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#146
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#148
def find_node_for_line(line); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#122
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#124
def inside_string_literal?(range, token); end
# @return [Boolean]
@@ -45041,7 +45573,7 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#173
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#175
def method_call_with_arguments?(node); end
# A method call without parentheses such as the following cannot remove `\`:
@@ -45051,12 +45583,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base
#
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#130
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#132
def method_with_argument?(current_token, next_token); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#114
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#116
def redundant_line_continuation?(range); end
# @return [Boolean]
@@ -45066,12 +45598,12 @@ class RuboCop::Cop::Style::RedundantLineContinuation < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#152
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#154
def same_line?(node, line); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#177
+ # source://rubocop//lib/rubocop/cop/style/redundant_line_continuation.rb#179
def start_with_arithmetic_operator?(source_line); end
# @return [Boolean]
@@ -45104,37 +45636,34 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
include ::RuboCop::Cop::Parentheses
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#33
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#32
def allowed_pin_operator?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#36
+ # 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#222
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#253
def first_send_argument?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#227
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#258
def first_super_argument?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#232
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#263
def first_yield_argument?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#140
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#166
def interpolation?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#27
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#26
def method_node_and_args(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#38
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#37
def on_begin(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#24
- def range_end?(param0 = T.unsafe(nil)); end
-
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#30
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#29
def rescue?(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#21
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#23
def square_brackets?(param0 = T.unsafe(nil)); end
private
@@ -45146,7 +45675,7 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#61
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#60
def allowed_expression?(node); end
# @return [Boolean]
@@ -45166,21 +45695,21 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#236
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#267
def call_chain_starts_with_int?(begin_node, send_node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#127
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#129
def check(begin_node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#142
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#168
def check_send(begin_node, node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#151
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#177
def check_unary(begin_node, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#175
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#201
def disallowed_literal?(begin_node, node); end
# @return [Boolean]
@@ -45188,6 +45717,9 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#107
def empty_parentheses?(node); end
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#140
+ def find_offense_message(begin_node, node); end
+
# @return [Boolean]
#
# source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#112
@@ -45195,22 +45727,22 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#217
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#242
def first_argument?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#54
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#53
def ignore_syntax?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#171
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#197
def keyword_ancestor?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#190
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#216
def keyword_with_redundant_parentheses?(node); end
# @return [Boolean]
@@ -45220,35 +45752,33 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#203
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#229
def method_call_with_redundant_parentheses?(node); end
- # @return [Boolean]
- #
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#119
- def method_chain_begins_with_hash_literal?(node); end
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#121
+ def method_chain_begins_with_hash_literal(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#161
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#187
def offense(node, msg); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#213
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#238
def only_begin_arg?(args); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#46
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#45
def parens_allowed?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#179
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#205
def raised_to_power_negative_numeric?(begin_node, node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#167
+ # source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#193
def suspect_unary?(node); end
# @return [Boolean]
@@ -45257,6 +45787,9 @@ class RuboCop::Cop::Style::RedundantParentheses < ::RuboCop::Cop::Base
def ternary_parentheses_required?; end
end
+# source://rubocop//lib/rubocop/cop/style/redundant_parentheses.rb#20
+RuboCop::Cop::Style::RedundantParentheses::ALLOWED_NODE_TYPES = T.let(T.unsafe(nil), Array)
+
# Checks for usage of the %q/%Q syntax when '' or "" would do.
#
# @example
@@ -45737,7 +46270,8 @@ RuboCop::Cop::Style::RedundantReturn::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Ar
# protected scope, you cannot send private messages this way.
#
# Note we allow uses of `self` with operators because it would be awkward
-# otherwise.
+# otherwise. Also allows the use of `self.it` without arguments in blocks,
+# as in `0.times { self.it }`, following `Lint/ItWithoutArgumentsInBlock` cop.
#
# @example
#
@@ -45762,114 +46296,125 @@ RuboCop::Cop::Style::RedundantReturn::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Ar
# end
# end
#
-# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#44
+# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#45
class RuboCop::Cop::Style::RedundantSelf < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
# @return [RedundantSelf] a new instance of RedundantSelf
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#59
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#60
def initialize(config = T.unsafe(nil), options = T.unsafe(nil)); end
# Assignment of self.x
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#67
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#68
def on_and_asgn(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#85
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#86
def on_args(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#119
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#120
def on_block(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#89
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#90
def on_blockarg(node); end
# Using self.x to distinguish from local variable x
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#80
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#81
def on_def(node); end
# Using self.x to distinguish from local variable x
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#80
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#81
def on_defs(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#125
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#126
def on_if(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#103
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#104
def on_in_pattern(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#98
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#99
def on_lvasgn(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#93
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#94
def on_masgn(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#119
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#120
def on_numblock(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#73
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#74
def on_op_asgn(node); end
# Assignment of self.x
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#67
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#68
def on_or_asgn(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#107
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#108
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#125
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#126
def on_until(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#125
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#126
def on_while(node); end
private
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#181
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#196
def add_lhs_to_local_variables_scopes(rhs, lhs); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#189
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#204
def add_masgn_lhs_variables(rhs, lhs); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#195
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#210
def add_match_var_scopes(in_pattern_node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#143
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#144
def add_scope(node, local_variables = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#175
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#190
def allow_self(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#149
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#150
def allowed_send_node?(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#166
+ # Respects `Lint/ItWithoutArgumentsInBlock` cop and the following Ruby 3.3's warning:
+ #
+ # $ ruby -e '0.times { begin; it; end }'
+ # -e:1: warning: `it` calls without arguments will refer to the first block param in
+ # Ruby 3.4; use it() or self.it
+ #
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#165
+ def it_method_in_block?(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#181
def on_argument(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#158
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#173
def regular_method_call?(node); end
class << self
- # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#55
+ # source://rubocop//lib/rubocop/cop/style/redundant_self.rb#56
def autocorrect_incompatible_with; end
end
end
-# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#48
+# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#49
RuboCop::Cop::Style::RedundantSelf::KERNEL_METHODS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#49
+# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#50
RuboCop::Cop::Style::RedundantSelf::KEYWORDS = T.let(T.unsafe(nil), Array)
-# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#47
+# source://rubocop//lib/rubocop/cop/style/redundant_self.rb#48
RuboCop::Cop::Style::RedundantSelf::MSG = T.let(T.unsafe(nil), String)
# Checks for places where redundant assignments are made for in place
@@ -46053,6 +46598,9 @@ class RuboCop::Cop::Style::RedundantSort < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#104
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#104
def on_send(node); end
@@ -46064,45 +46612,45 @@ class RuboCop::Cop::Style::RedundantSort < ::RuboCop::Cop::Base
# This gets the start of the accessor whether it has a dot
# (e.g. `.first`) or doesn't (e.g. `[0]`)
#
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#192
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#193
def accessor_start(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#182
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#183
def arg_node(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#186
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#187
def arg_value(node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#147
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#148
def autocorrect(corrector, node, sort_node, sorter, accessor); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#165
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#166
def base(accessor, arg); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#114
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#115
def find_redundant_sort(*nodes); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#135
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#136
def message(node, sorter, accessor); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#131
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#132
def offense_range(sort_node, node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#124
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#125
def register_offense(node, sort_node, sorter, accessor); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#156
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#157
def replace_with_logical_operator(corrector, node); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#173
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#174
def suffix(sorter); end
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#161
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#162
def suggestion(sorter, accessor, arg); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#200
+ # source://rubocop//lib/rubocop/cop/style/redundant_sort.rb#201
def with_logical_operator?(node); end
end
@@ -47064,6 +47612,9 @@ RuboCop::Cop::Style::SafeNavigation::MSG = T.let(T.unsafe(nil), String)
class RuboCop::Cop::Style::Sample < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#41
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/sample.rb#41
def on_send(node); end
@@ -47072,36 +47623,36 @@ class RuboCop::Cop::Style::Sample < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/style/sample.rb#123
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#124
def correction(shuffle_arg, method, method_args); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#139
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#140
def extract_source(args); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#117
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#118
def message(shuffle_arg, method, method_args, range); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/sample.rb#58
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#59
def offensive?(method, method_args); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#95
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#96
def range_size(range_node); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#130
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#131
def sample_arg(method, method_args); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#69
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#70
def sample_size(method_args); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#78
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#79
def sample_size_for_one_arg(arg); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#88
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#89
def sample_size_for_two_args(first, second); end
- # source://rubocop//lib/rubocop/cop/style/sample.rb#111
+ # source://rubocop//lib/rubocop/cop/style/sample.rb#112
def source_range(shuffle_node, node); end
end
@@ -47158,6 +47709,9 @@ class RuboCop::Cop::Style::SelectByRegexp < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#74
def env_const?(param0 = T.unsafe(nil)); end
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#88
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#88
def on_send(node); end
@@ -47166,31 +47720,31 @@ class RuboCop::Cop::Style::SelectByRegexp < ::RuboCop::Cop::Base
private
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#132
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#133
def extract_send_node(block_node); end
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#145
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#146
def find_regexp(node, block); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#156
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#157
def match_predicate_without_receiver?(node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#141
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#142
def opposite?(regexp_method_send_node); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#106
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#107
def receiver_allowed?(node); end
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#120
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#121
def register_offense(node, block_node, regexp, replacement); end
- # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#112
+ # source://rubocop//lib/rubocop/cop/style/select_by_regexp.rb#113
def replacement(regexp_method_send_node, node); end
end
@@ -47310,40 +47864,45 @@ class RuboCop::Cop::Style::Semicolon < ::RuboCop::Cop::Base
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#102
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#106
def exist_semicolon_after_left_curly_brace?(tokens); end
# @return [Boolean]
#
# source://rubocop//lib/rubocop/cop/style/semicolon.rb#110
+ def exist_semicolon_after_left_lambda_curly_brace?(tokens); end
+
+ # @return [Boolean]
+ #
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#118
def exist_semicolon_after_left_string_interpolation_brace?(tokens); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#98
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#102
def exist_semicolon_before_right_curly_brace?(tokens); end
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#106
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#114
def exist_semicolon_before_right_string_interpolation_brace?(tokens); end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#134
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#142
def expressions_per_line(exprs); end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#148
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#156
def find_range_node(token_before_semicolon); end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#140
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#148
def find_semicolon_positions(line); end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#154
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#162
def range_nodes; end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#114
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#122
def register_semicolon(line, column, after_expression, token_before_semicolon = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/semicolon.rb#83
+ # source://rubocop//lib/rubocop/cop/style/semicolon.rb#84
def semicolon_position(tokens); end
# source://rubocop//lib/rubocop/cop/style/semicolon.rb#79
@@ -47541,8 +48100,11 @@ RuboCop::Cop::Style::SignalException::RAISE_MSG = T.let(T.unsafe(nil), String)
# source://rubocop//lib/rubocop/cop/style/signal_exception.rb#114
RuboCop::Cop::Style::SignalException::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
-# Sometimes using dig method ends up with just a single
-# argument. In such cases, dig should be replaced with [].
+# Sometimes using `dig` method ends up with just a single
+# argument. In such cases, dig should be replaced with `[]`.
+#
+# Since replacing `hash&.dig(:key)` with `hash[:key]` could potentially lead to error,
+# calls to the `dig` method using safe navigation will be ignored.
#
# @example
# # bad
@@ -47561,21 +48123,24 @@ RuboCop::Cop::Style::SignalException::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Ar
# keys = %i[key1 key2]
# { key1: { key2: 'value' } }.dig(*keys)
#
-# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#31
+# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#34
class RuboCop::Cop::Style::SingleArgumentDig < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
- # source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#42
+ # source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#46
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#38
+ # source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#42
def single_argument_dig?(param0 = T.unsafe(nil)); end
end
-# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#34
+# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#39
+RuboCop::Cop::Style::SingleArgumentDig::IGNORED_ARGUMENT_TYPES = T.let(T.unsafe(nil), Array)
+
+# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#37
RuboCop::Cop::Style::SingleArgumentDig::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#35
+# source://rubocop//lib/rubocop/cop/style/single_argument_dig.rb#38
RuboCop::Cop::Style::SingleArgumentDig::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Checks whether the block parameters of a single-line
@@ -47650,6 +48215,50 @@ end
# source://rubocop//lib/rubocop/cop/style/single_line_block_params.rb#34
RuboCop::Cop::Style::SingleLineBlockParams::MSG = T.let(T.unsafe(nil), String)
+# Checks for single-line `do`...`end` block.
+#
+# In practice a single line `do`...`end` is autocorrected when `EnforcedStyle: semantic`
+# in `Style/BlockDelimiters`. The autocorrection maintains the `do` ... `end` syntax to
+# preserve semantics and does not change it to `{`...`}` block.
+#
+# @example
+#
+# # bad
+# foo do |arg| bar(arg) end
+#
+# # good
+# foo do |arg|
+# bar(arg)
+# end
+#
+# # bad
+# ->(arg) do bar(arg) end
+#
+# # good
+# ->(arg) { bar(arg) }
+#
+# source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#28
+class RuboCop::Cop::Style::SingleLineDoEndBlock < ::RuboCop::Cop::Base
+ extend ::RuboCop::Cop::AutoCorrector
+
+ # source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#34
+ def on_block(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#34
+ def on_numblock(node); end
+
+ private
+
+ # source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#55
+ def do_line(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#63
+ def x(corrector, node); end
+end
+
+# source://rubocop//lib/rubocop/cop/style/single_line_do_end_block.rb#31
+RuboCop::Cop::Style::SingleLineDoEndBlock::MSG = T.let(T.unsafe(nil), String)
+
# Checks for single-line method definitions that contain a body.
# It will accept single-line methods with no body.
#
@@ -48256,6 +48865,9 @@ class RuboCop::Cop::Style::StringChars < ::RuboCop::Cop::Base
include ::RuboCop::Cop::RangeHelp
extend ::RuboCop::Cop::AutoCorrector
+ # source://rubocop//lib/rubocop/cop/style/string_chars.rb#29
+ def on_csend(node); end
+
# source://rubocop//lib/rubocop/cop/style/string_chars.rb#29
def on_send(node); end
end
@@ -48603,7 +49215,10 @@ class RuboCop::Cop::Style::Strip < ::RuboCop::Cop::Base
# source://rubocop//lib/rubocop/cop/style/strip.rb#24
def lstrip_rstrip(param0 = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/cop/style/strip.rb#29
+ # source://rubocop//lib/rubocop/cop/style/strip.rb#31
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/strip.rb#31
def on_send(node); end
end
@@ -48653,6 +49268,29 @@ end
# source://rubocop//lib/rubocop/cop/style/struct_inheritance.rb#30
RuboCop::Cop::Style::StructInheritance::MSG = T.let(T.unsafe(nil), String)
+# Enforces the presence of parentheses in `super` containing arguments.
+#
+# `super` is a keyword and is provided as a distinct cop from those designed for method call.
+#
+# @example
+#
+# # bad
+# super name, age
+#
+# # good
+# super(name, age)
+#
+# source://rubocop//lib/rubocop/cop/style/super_with_args_parentheses.rb#18
+class RuboCop::Cop::Style::SuperWithArgsParentheses < ::RuboCop::Cop::Base
+ extend ::RuboCop::Cop::AutoCorrector
+
+ # source://rubocop//lib/rubocop/cop/style/super_with_args_parentheses.rb#23
+ def on_super(node); end
+end
+
+# source://rubocop//lib/rubocop/cop/style/super_with_args_parentheses.rb#21
+RuboCop::Cop::Style::SuperWithArgsParentheses::MSG = T.let(T.unsafe(nil), String)
+
# Enforces the use of shorthand-style swapping of 2 variables.
#
# @example
@@ -50162,22 +50800,25 @@ class RuboCop::Cop::Style::UnpackFirst < ::RuboCop::Cop::Base
extend ::RuboCop::Cop::AutoCorrector
extend ::RuboCop::Cop::TargetRubyVersion
- # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#38
+ # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#37
+ def on_csend(node); end
+
+ # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#37
def on_send(node); end
- # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#31
+ # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#30
def unpack_and_first_element?(param0 = T.unsafe(nil)); end
private
- # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#54
+ # source://rubocop//lib/rubocop/cop/style/unpack_first.rb#53
def first_element_range(node, unpack_call); end
end
# source://rubocop//lib/rubocop/cop/style/unpack_first.rb#26
RuboCop::Cop::Style::UnpackFirst::MSG = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/cop/style/unpack_first.rb#28
+# source://rubocop//lib/rubocop/cop/style/unpack_first.rb#27
RuboCop::Cop::Style::UnpackFirst::RESTRICT_ON_SEND = T.let(T.unsafe(nil), Array)
# Checks for variable interpolation (like "#@ivar").
@@ -53845,37 +54486,37 @@ RuboCop::Formatter::GitHubActionsFormatter::ESCAPE_MAP = T.let(T.unsafe(nil), Ha
# This formatter saves the output as an html file.
#
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#11
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#9
class RuboCop::Formatter::HTMLFormatter < ::RuboCop::Formatter::BaseFormatter
# @return [HTMLFormatter] a new instance of HTMLFormatter
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#30
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#28
def initialize(output, options = T.unsafe(nil)); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#40
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#38
def file_finished(file, offenses); end
# Returns the value of attribute files.
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#28
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#26
def files; end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#45
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#43
def finished(inspected_files); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#51
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#49
def render_html; end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#36
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#34
def started(target_files); end
# Returns the value of attribute summary.
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#28
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#26
def summary; end
end
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#15
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#13
class RuboCop::Formatter::HTMLFormatter::Color < ::Struct
# Returns the value of attribute alpha
#
@@ -53899,7 +54540,7 @@ class RuboCop::Formatter::HTMLFormatter::Color < ::Struct
# @return [Object] the newly set value
def blue=(_); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#20
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#18
def fade_out(amount); end
# Returns the value of attribute green
@@ -53924,7 +54565,7 @@ class RuboCop::Formatter::HTMLFormatter::Color < ::Struct
# @return [Object] the newly set value
def red=(_); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#16
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#14
def to_s; end
class << self
@@ -53936,68 +54577,68 @@ class RuboCop::Formatter::HTMLFormatter::Color < ::Struct
end
end
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#12
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#10
RuboCop::Formatter::HTMLFormatter::ELLIPSES = T.let(T.unsafe(nil), String)
# This class provides helper methods used in the ERB template.
#
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#62
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#60
class RuboCop::Formatter::HTMLFormatter::ERBContext
include ::RuboCop::PathUtil
include ::RuboCop::Formatter::TextUtil
# @return [ERBContext] a new instance of ERBContext
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#78
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#76
def initialize(files, summary); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#125
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#123
def base64_encoded_logo_image; end
# Make Kernel#binding public.
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#85
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#83
def binding; end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#90
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#88
def decorated_message(offense); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#121
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#119
def escape(string); end
# Returns the value of attribute files.
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#76
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#74
def files; end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#101
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#99
def highlight_source_tag(offense); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#94
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#92
def highlighted_source_line(offense); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#117
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#115
def possible_ellipses(location); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#112
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#110
def source_after_highlight(offense); end
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#107
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#105
def source_before_highlight(offense); end
# Returns the value of attribute summary.
#
- # source://rubocop//lib/rubocop/formatter/html_formatter.rb#76
+ # source://rubocop//lib/rubocop/formatter/html_formatter.rb#74
def summary; end
end
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#74
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#72
RuboCop::Formatter::HTMLFormatter::ERBContext::LOGO_IMAGE_PATH = T.let(T.unsafe(nil), String)
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#66
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#64
RuboCop::Formatter::HTMLFormatter::ERBContext::SEVERITY_COLORS = T.let(T.unsafe(nil), Hash)
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#26
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#24
class RuboCop::Formatter::HTMLFormatter::FileOffenses < ::Struct
# Returns the value of attribute offenses
#
@@ -54030,7 +54671,7 @@ class RuboCop::Formatter::HTMLFormatter::FileOffenses < ::Struct
end
end
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#25
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#23
class RuboCop::Formatter::HTMLFormatter::Summary < ::Struct
# Returns the value of attribute inspected_files
#
@@ -54074,7 +54715,7 @@ class RuboCop::Formatter::HTMLFormatter::Summary < ::Struct
end
end
-# source://rubocop//lib/rubocop/formatter/html_formatter.rb#13
+# source://rubocop//lib/rubocop/formatter/html_formatter.rb#11
RuboCop::Formatter::HTMLFormatter::TEMPLATE_PATH = T.let(T.unsafe(nil), String)
# This formatter formats the report data in JSON format.
@@ -55598,39 +56239,39 @@ RuboCop::RemoteConfig::CACHE_LIFETIME = T.let(T.unsafe(nil), Integer)
#
# @api private
#
-# source://rubocop//lib/rubocop/result_cache.rb#12
+# source://rubocop//lib/rubocop/result_cache.rb#11
class RuboCop::ResultCache
# @api private
# @return [ResultCache] a new instance of ResultCache
#
- # source://rubocop//lib/rubocop/result_cache.rb#88
+ # source://rubocop//lib/rubocop/result_cache.rb#87
def initialize(file, team, options, config_store, cache_root = T.unsafe(nil)); end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#101
+ # source://rubocop//lib/rubocop/result_cache.rb#100
def debug?; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#109
+ # source://rubocop//lib/rubocop/result_cache.rb#108
def load; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#86
+ # source://rubocop//lib/rubocop/result_cache.rb#85
def path; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#114
+ # source://rubocop//lib/rubocop/result_cache.rb#113
def save(offenses); end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#105
+ # source://rubocop//lib/rubocop/result_cache.rb#104
def valid?; end
private
@@ -55638,7 +56279,7 @@ class RuboCop::ResultCache
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#147
+ # source://rubocop//lib/rubocop/result_cache.rb#146
def any_symlink?(path); end
# We combine team and options into a single "context" checksum to avoid
@@ -55648,17 +56289,17 @@ class RuboCop::ResultCache
#
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#237
+ # source://rubocop//lib/rubocop/result_cache.rb#236
def context_checksum(team, options); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#190
+ # source://rubocop//lib/rubocop/result_cache.rb#189
def digest(path); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#158
+ # source://rubocop//lib/rubocop/result_cache.rb#157
def file_checksum(file, config_store); end
# Return a hash of the options given at invocation, minus the ones that have
@@ -55667,25 +56308,25 @@ class RuboCop::ResultCache
#
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#221
+ # source://rubocop//lib/rubocop/result_cache.rb#220
def relevant_options_digest(options); end
# The checksum of the RuboCop program running the inspection.
#
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#175
+ # source://rubocop//lib/rubocop/result_cache.rb#174
def rubocop_checksum; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#201
+ # source://rubocop//lib/rubocop/result_cache.rb#200
def rubocop_extra_features; end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#143
+ # source://rubocop//lib/rubocop/result_cache.rb#142
def symlink_protection_triggered?(path); end
# The external dependency checksums are cached per RuboCop team so that
@@ -55693,19 +56334,19 @@ class RuboCop::ResultCache
#
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#228
+ # source://rubocop//lib/rubocop/result_cache.rb#227
def team_checksum(team); end
class << self
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#82
+ # source://rubocop//lib/rubocop/result_cache.rb#81
def allow_symlinks_in_cache_location?(config_store); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#76
+ # source://rubocop//lib/rubocop/result_cache.rb#75
def cache_root(config_store); end
# Remove old files so that the cache doesn't grow too big. When the
@@ -55717,67 +56358,67 @@ class RuboCop::ResultCache
#
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#29
+ # source://rubocop//lib/rubocop/result_cache.rb#28
def cleanup(config_store, verbose, cache_root = T.unsafe(nil)); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#171
+ # source://rubocop//lib/rubocop/result_cache.rb#170
def inhibit_cleanup; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#171
+ # source://rubocop//lib/rubocop/result_cache.rb#170
def inhibit_cleanup=(_arg0); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#43
+ # source://rubocop//lib/rubocop/result_cache.rb#42
def rubocop_required_features; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#43
+ # source://rubocop//lib/rubocop/result_cache.rb#42
def rubocop_required_features=(_arg0); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#171
+ # source://rubocop//lib/rubocop/result_cache.rb#170
def source_checksum; end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#171
+ # source://rubocop//lib/rubocop/result_cache.rb#170
def source_checksum=(_arg0); end
private
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#66
+ # source://rubocop//lib/rubocop/result_cache.rb#65
def remove_files(files, dirs, remove_count); end
# @api private
#
- # source://rubocop//lib/rubocop/result_cache.rb#53
+ # source://rubocop//lib/rubocop/result_cache.rb#52
def remove_oldest_files(files, dirs, cache_root, verbose); end
# @api private
# @return [Boolean]
#
- # source://rubocop//lib/rubocop/result_cache.rb#49
+ # source://rubocop//lib/rubocop/result_cache.rb#48
def requires_file_removal?(file_count, config_store); end
end
end
# @api private
#
-# source://rubocop//lib/rubocop/result_cache.rb#17
+# source://rubocop//lib/rubocop/result_cache.rb#16
RuboCop::ResultCache::DL_EXTENSIONS = T.let(T.unsafe(nil), Array)
# @api private
#
-# source://rubocop//lib/rubocop/result_cache.rb#13
+# source://rubocop//lib/rubocop/result_cache.rb#12
RuboCop::ResultCache::NON_CHANGING = T.let(T.unsafe(nil), Array)
# This class handles the processing of files, which includes dealing with
diff --git a/sorbet/rbi/gems/spoom@1.2.2.rbi b/sorbet/rbi/gems/spoom@1.2.4.rbi
similarity index 73%
rename from sorbet/rbi/gems/spoom@1.2.2.rbi
rename to sorbet/rbi/gems/spoom@1.2.4.rbi
index 72a3c7b..ad1c2db 100644
--- a/sorbet/rbi/gems/spoom@1.2.2.rbi
+++ b/sorbet/rbi/gems/spoom@1.2.4.rbi
@@ -221,22 +221,22 @@ class Spoom::Cli::Main < ::Thor
# source://spoom//lib/spoom/cli.rb#61
def __print_version; end
- # source://thor/1.2.2/lib/thor.rb#239
+ # source://thor/1.3.0/lib/thor.rb#334
def bump(*args); end
- # source://thor/1.2.2/lib/thor.rb#239
+ # source://thor/1.3.0/lib/thor.rb#334
def config(*args); end
- # source://thor/1.2.2/lib/thor.rb#239
+ # source://thor/1.3.0/lib/thor.rb#334
def coverage(*args); end
# source://spoom//lib/spoom/cli.rb#43
def files; end
- # source://thor/1.2.2/lib/thor.rb#239
+ # source://thor/1.3.0/lib/thor.rb#334
def lsp(*args); end
- # source://thor/1.2.2/lib/thor.rb#239
+ # source://thor/1.3.0/lib/thor.rb#334
def tc(*args); end
class << self
@@ -958,7 +958,7 @@ class Spoom::Coverage::D3::ColorPalette < ::T::Struct
prop :strong, ::String
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1298,7 +1298,7 @@ class Spoom::Coverage::Snapshot < ::T::Struct
sig { params(obj: T::Hash[::String, T.untyped]).returns(::Spoom::Coverage::Snapshot) }
def from_obj(obj); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1353,16 +1353,44 @@ end
# source://spoom//lib/spoom/deadcode/erb.rb#27
module Spoom::Deadcode
class << self
- # source://spoom//lib/spoom/deadcode.rb#49
- sig { params(index: ::Spoom::Deadcode::Index, erb: ::String, file: ::String).void }
- def index_erb(index, erb, file:); end
+ # source://spoom//lib/spoom/deadcode.rb#51
+ sig do
+ params(
+ index: ::Spoom::Deadcode::Index,
+ erb: ::String,
+ file: ::String,
+ plugins: T::Array[::Spoom::Deadcode::Plugins::Base]
+ ).void
+ end
+ def index_erb(index, erb, file:, plugins: T.unsafe(nil)); end
+
+ # source://spoom//lib/spoom/deadcode.rb#40
+ sig do
+ params(
+ index: ::Spoom::Deadcode::Index,
+ ruby: ::String,
+ file: ::String,
+ plugins: T::Array[::Spoom::Deadcode::Plugins::Base]
+ ).void
+ end
+ def index_ruby(index, ruby, file:, plugins: T.unsafe(nil)); end
+
+ # source://spoom//lib/spoom/deadcode/plugins.rb#74
+ sig { params(context: ::Spoom::Context).returns(T::Array[::Spoom::Deadcode::Plugins::Base]) }
+ def load_custom_plugins(context); end
- # source://spoom//lib/spoom/deadcode.rb#38
- sig { params(index: ::Spoom::Deadcode::Index, ruby: ::String, file: ::String).void }
- def index_ruby(index, ruby, file:); end
+ # source://spoom//lib/spoom/deadcode/plugins.rb#60
+ sig { params(context: ::Spoom::Context).returns(T::Array[::Spoom::Deadcode::Plugins::Base]) }
+ def plugins_from_gemfile_lock(context); end
end
end
+# source://spoom//lib/spoom/deadcode/plugins.rb#25
+Spoom::Deadcode::DEFAULT_CUSTOM_PLUGINS_PATH = T.let(T.unsafe(nil), String)
+
+# source://spoom//lib/spoom/deadcode/plugins.rb#27
+Spoom::Deadcode::DEFAULT_PLUGINS = T.let(T.unsafe(nil), Set)
+
# A definition is a class, module, method, constant, etc. being defined in the code
#
# source://spoom//lib/spoom/deadcode/definition.rb#7
@@ -1422,7 +1450,7 @@ class Spoom::Deadcode::Definition < ::T::Struct
def module?; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1459,19 +1487,19 @@ class Spoom::Deadcode::ERB < ::Erubi::Engine
private
# source://spoom//lib/spoom/deadcode/erb.rb#83
- sig { params(code: T.untyped).void }
+ sig { override.params(code: T.untyped).void }
def add_code(code); end
# source://spoom//lib/spoom/deadcode/erb.rb#66
- sig { params(indicator: T.untyped, code: T.untyped).void }
+ sig { override.params(indicator: T.untyped, code: T.untyped).void }
def add_expression(indicator, code); end
# source://spoom//lib/spoom/deadcode/erb.rb#89
- sig { params(_: T.untyped).void }
+ sig { override.params(_: T.untyped).void }
def add_postamble(_); end
# source://spoom//lib/spoom/deadcode/erb.rb#48
- sig { params(text: T.untyped).void }
+ sig { override.params(text: T.untyped).void }
def add_text(text); end
# source://spoom//lib/spoom/deadcode/erb.rb#95
@@ -1484,11 +1512,11 @@ Spoom::Deadcode::ERB::BLOCK_EXPR = T.let(T.unsafe(nil), Regexp)
# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
#
-# source://spoom//lib/spoom/deadcode.rb#18
+# source://spoom//lib/spoom/deadcode.rb#20
class Spoom::Deadcode::Error < ::Spoom::Error
abstract!
- # source://spoom//lib/spoom/deadcode.rb#25
+ # source://spoom//lib/spoom/deadcode.rb#27
sig { params(message: ::String, parent: ::Exception).void }
def initialize(message, parent:); end
end
@@ -1543,8 +1571,55 @@ end
# source://spoom//lib/spoom/deadcode/indexer.rb#6
class Spoom::Deadcode::Indexer < ::SyntaxTree::Visitor
# source://spoom//lib/spoom/deadcode/indexer.rb#16
- sig { params(path: ::String, source: ::String, index: ::Spoom::Deadcode::Index).void }
- def initialize(path, source, index); end
+ sig do
+ params(
+ path: ::String,
+ source: ::String,
+ index: ::Spoom::Deadcode::Index,
+ plugins: T::Array[::Spoom::Deadcode::Plugins::Base]
+ ).void
+ end
+ def initialize(path, source, index, plugins: T.unsafe(nil)); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#459
+ sig do
+ params(
+ node: T.nilable(T.any(::SyntaxTree::ArgParen, ::SyntaxTree::Args, ::SyntaxTree::ArgsForward))
+ ).returns(T::Array[::SyntaxTree::Node])
+ end
+ def call_args(node); end
+
+ # Context
+ #
+ # source://spoom//lib/spoom/deadcode/indexer.rb#367
+ sig { returns(::SyntaxTree::Node) }
+ def current_node; end
+
+ # Definition indexing
+ #
+ # source://spoom//lib/spoom/deadcode/indexer.rb#281
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_attr_reader(name, full_name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#293
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_attr_writer(name, full_name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#305
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_class(name, full_name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#317
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_constant(name, full_name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#329
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_method(name, full_name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#341
+ sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
+ def define_module(name, full_name, node); end
# @return [String]
#
@@ -1555,165 +1630,161 @@ class Spoom::Deadcode::Indexer < ::SyntaxTree::Visitor
sig { returns(::Spoom::Deadcode::Index) }
def index; end
+ # source://spoom//lib/spoom/deadcode/indexer.rb#426
+ sig { returns(T.nilable(::String)) }
+ def last_sig; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#386
+ sig { returns(T.nilable(::SyntaxTree::BlockNode)) }
+ def nesting_block; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#391
+ sig { returns(T.nilable(::SyntaxTree::MethodAddBlock)) }
+ def nesting_block_call; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#396
+ sig { returns(T.nilable(::String)) }
+ def nesting_block_call_name; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#381
+ sig { returns(T.nilable(::SyntaxTree::ClassDeclaration)) }
+ def nesting_class; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#410
+ sig { returns(T.nilable(::String)) }
+ def nesting_class_name; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#418
+ sig { returns(T.nilable(::String)) }
+ def nesting_class_superclass_name; end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#372
+ sig { type_parameters(:N).params(type: T::Class[T.type_parameter(:N)]).returns(T.nilable(T.type_parameter(:N))) }
+ def nesting_node(type); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#445
+ sig { params(node: ::SyntaxTree::Node).returns(::Spoom::Deadcode::Location) }
+ def node_location(node); end
+
+ # Node utils
+ #
+ # source://spoom//lib/spoom/deadcode/indexer.rb#435
+ sig { params(node: T.any(::Symbol, ::SyntaxTree::Node)).returns(::String) }
+ def node_string(node); end
+
# source://spoom//lib/spoom/deadcode/indexer.rb#10
sig { returns(::String) }
def path; end
+ # Reference indexing
+ #
+ # source://spoom//lib/spoom/deadcode/indexer.rb#355
+ sig { params(name: ::String, node: ::SyntaxTree::Node).void }
+ def reference_constant(name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#360
+ sig { params(name: ::String, node: ::SyntaxTree::Node).void }
+ def reference_method(name, node); end
+
+ # source://spoom//lib/spoom/deadcode/indexer.rb#450
+ sig { params(node: ::SyntaxTree::Node).returns(::String) }
+ def symbol_string(node); end
+
# Visit
#
- # source://spoom//lib/spoom/deadcode/indexer.rb#34
+ # source://spoom//lib/spoom/deadcode/indexer.rb#35
sig { override.params(node: T.nilable(::SyntaxTree::Node)).void }
def visit(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#44
+ # source://spoom//lib/spoom/deadcode/indexer.rb#45
sig { override.params(node: ::SyntaxTree::AliasNode).void }
def visit_alias(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#49
+ # source://spoom//lib/spoom/deadcode/indexer.rb#50
sig { override.params(node: ::SyntaxTree::ARef).void }
def visit_aref(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#56
+ # source://spoom//lib/spoom/deadcode/indexer.rb#57
sig { override.params(node: ::SyntaxTree::ARefField).void }
def visit_aref_field(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#63
+ # source://spoom//lib/spoom/deadcode/indexer.rb#64
sig { override.params(node: ::SyntaxTree::ArgBlock).void }
def visit_arg_block(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#77
+ # source://spoom//lib/spoom/deadcode/indexer.rb#78
sig { override.params(node: ::SyntaxTree::Binary).void }
def visit_binary(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#93
+ # source://spoom//lib/spoom/deadcode/indexer.rb#94
sig { override.params(node: ::SyntaxTree::CallNode).void }
def visit_call(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#105
+ # source://spoom//lib/spoom/deadcode/indexer.rb#106
sig { override.params(node: ::SyntaxTree::ClassDeclaration).void }
def visit_class(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#118
+ # source://spoom//lib/spoom/deadcode/indexer.rb#119
sig { override.params(node: ::SyntaxTree::Command).void }
def visit_command(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#130
+ # source://spoom//lib/spoom/deadcode/indexer.rb#131
sig { override.params(node: ::SyntaxTree::CommandCall).void }
def visit_command_call(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#143
+ # source://spoom//lib/spoom/deadcode/indexer.rb#144
sig { override.params(node: ::SyntaxTree::Const).void }
def visit_const(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#148
+ # source://spoom//lib/spoom/deadcode/indexer.rb#149
sig { override.params(node: ::SyntaxTree::ConstPathField).void }
def visit_const_path_field(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#158
+ # source://spoom//lib/spoom/deadcode/indexer.rb#159
sig { override.params(node: ::SyntaxTree::DefNode).void }
def visit_def(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#166
+ # source://spoom//lib/spoom/deadcode/indexer.rb#167
sig { override.params(node: ::SyntaxTree::Field).void }
def visit_field(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#182
+ # source://spoom//lib/spoom/deadcode/indexer.rb#183
sig { override.params(node: ::SyntaxTree::ModuleDeclaration).void }
def visit_module(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#194
+ # source://spoom//lib/spoom/deadcode/indexer.rb#195
sig { override.params(node: ::SyntaxTree::OpAssign).void }
def visit_opassign(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#203
+ # source://spoom//lib/spoom/deadcode/indexer.rb#204
sig { params(send: ::Spoom::Deadcode::Send).void }
def visit_send(send); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#238
+ # source://spoom//lib/spoom/deadcode/indexer.rb#243
sig { override.params(node: ::SyntaxTree::SymbolLiteral).void }
def visit_symbol_literal(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#247
+ # source://spoom//lib/spoom/deadcode/indexer.rb#252
sig { override.params(node: ::SyntaxTree::TopConstField).void }
def visit_top_const_field(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#252
+ # source://spoom//lib/spoom/deadcode/indexer.rb#257
sig { override.params(node: ::SyntaxTree::VarField).void }
def visit_var_field(node); end
- # source://spoom//lib/spoom/deadcode/indexer.rb#269
+ # source://spoom//lib/spoom/deadcode/indexer.rb#274
sig { override.params(node: ::SyntaxTree::VCall).void }
def visit_vcall(node); end
-
- private
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#382
- sig do
- params(
- node: T.nilable(T.any(::SyntaxTree::ArgParen, ::SyntaxTree::Args, ::SyntaxTree::ArgsForward))
- ).returns(T::Array[::SyntaxTree::Node])
- end
- def call_args(node); end
-
- # Definition indexing
- #
- # source://spoom//lib/spoom/deadcode/indexer.rb#278
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_attr_reader(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#289
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_attr_writer(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#300
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_class(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#311
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_constant(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#322
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_method(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#333
- sig { params(name: ::String, full_name: ::String, node: ::SyntaxTree::Node).void }
- def define_module(name, full_name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#368
- sig { params(node: ::SyntaxTree::Node).returns(::Spoom::Deadcode::Location) }
- def node_location(node); end
-
- # Node utils
- #
- # source://spoom//lib/spoom/deadcode/indexer.rb#358
- sig { params(node: T.any(::Symbol, ::SyntaxTree::Node)).returns(::String) }
- def node_string(node); end
-
- # Reference indexing
- #
- # source://spoom//lib/spoom/deadcode/indexer.rb#346
- sig { params(name: ::String, node: ::SyntaxTree::Node).void }
- def reference_constant(name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#351
- sig { params(name: ::String, node: ::SyntaxTree::Node).void }
- def reference_method(name, node); end
-
- # source://spoom//lib/spoom/deadcode/indexer.rb#373
- sig { params(node: ::SyntaxTree::Node).returns(::String) }
- def symbol_string(node); end
end
-# source://spoom//lib/spoom/deadcode.rb#32
+# source://spoom//lib/spoom/deadcode.rb#34
class Spoom::Deadcode::IndexerError < ::Spoom::Deadcode::Error; end
# source://spoom//lib/spoom/deadcode/location.rb#6
class Spoom::Deadcode::Location
include ::Comparable
- # source://spoom//lib/spoom/deadcode/location.rb#37
+ # source://spoom//lib/spoom/deadcode/location.rb#54
sig do
params(
file: ::String,
@@ -1725,39 +1796,49 @@ class Spoom::Deadcode::Location
end
def initialize(file, start_line, start_column, end_line, end_column); end
- # source://spoom//lib/spoom/deadcode/location.rb#46
+ # source://spoom//lib/spoom/deadcode/location.rb#74
sig { override.params(other: ::BasicObject).returns(T.nilable(::Integer)) }
def <=>(other); end
# @return [Integer]
#
- # source://spoom//lib/spoom/deadcode/location.rb#26
+ # source://spoom//lib/spoom/deadcode/location.rb#43
def end_column; end
# @return [Integer]
#
- # source://spoom//lib/spoom/deadcode/location.rb#26
+ # source://spoom//lib/spoom/deadcode/location.rb#43
def end_line; end
- # source://spoom//lib/spoom/deadcode/location.rb#23
+ # source://spoom//lib/spoom/deadcode/location.rb#40
sig { returns(::String) }
def file; end
+ # source://spoom//lib/spoom/deadcode/location.rb#63
+ sig { params(other: ::Spoom::Deadcode::Location).returns(T::Boolean) }
+ def include?(other); end
+
# @return [Integer]
#
- # source://spoom//lib/spoom/deadcode/location.rb#26
+ # source://spoom//lib/spoom/deadcode/location.rb#43
def start_column; end
- # source://spoom//lib/spoom/deadcode/location.rb#26
+ # source://spoom//lib/spoom/deadcode/location.rb#43
sig { returns(::Integer) }
def start_line; end
- # source://spoom//lib/spoom/deadcode/location.rb#53
+ # source://spoom//lib/spoom/deadcode/location.rb#81
sig { returns(::String) }
def to_s; end
class << self
+ # @raise [LocationError]
+ #
# source://spoom//lib/spoom/deadcode/location.rb#17
+ sig { params(location_string: ::String).returns(::Spoom::Deadcode::Location) }
+ def from_string(location_string); end
+
+ # source://spoom//lib/spoom/deadcode/location.rb#34
sig { params(file: ::String, location: ::SyntaxTree::Location).returns(::Spoom::Deadcode::Location) }
def from_syntax_tree(file, location); end
end
@@ -1766,9 +1847,483 @@ end
# source://spoom//lib/spoom/deadcode/location.rb#11
class Spoom::Deadcode::Location::LocationError < ::Spoom::Error; end
-# source://spoom//lib/spoom/deadcode.rb#31
+# source://spoom//lib/spoom/deadcode/plugins.rb#35
+Spoom::Deadcode::PLUGINS_FOR_GEM = T.let(T.unsafe(nil), Hash)
+
+# source://spoom//lib/spoom/deadcode.rb#33
class Spoom::Deadcode::ParserError < ::Spoom::Deadcode::Error; end
+# source://spoom//lib/spoom/deadcode/plugins/base.rb#8
+module Spoom::Deadcode::Plugins; end
+
+# source://spoom//lib/spoom/deadcode/plugins/action_mailer.rb#7
+class Spoom::Deadcode::Plugins::ActionMailer < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/action_mailer.rb#11
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/actionpack.rb#7
+class Spoom::Deadcode::Plugins::ActionPack < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/actionpack.rb#31
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/actionpack.rb#36
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/actionpack.rb#10
+Spoom::Deadcode::Plugins::ActionPack::CALLBACKS = T.let(T.unsafe(nil), Array)
+
+# source://spoom//lib/spoom/deadcode/plugins/active_job.rb#7
+class Spoom::Deadcode::Plugins::ActiveJob < ::Spoom::Deadcode::Plugins::Base; end
+
+# source://spoom//lib/spoom/deadcode/plugins/active_model.rb#7
+class Spoom::Deadcode::Plugins::ActiveModel < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/active_model.rb#14
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/active_record.rb#7
+class Spoom::Deadcode::Plugins::ActiveRecord < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/active_record.rb#74
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/active_record.rb#64
+Spoom::Deadcode::Plugins::ActiveRecord::ARRAY_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://spoom//lib/spoom/deadcode/plugins/active_record.rb#20
+Spoom::Deadcode::Plugins::ActiveRecord::CALLBACKS = T.let(T.unsafe(nil), Array)
+
+# source://spoom//lib/spoom/deadcode/plugins/active_record.rb#49
+Spoom::Deadcode::Plugins::ActiveRecord::CRUD_METHODS = T.let(T.unsafe(nil), Array)
+
+# source://spoom//lib/spoom/deadcode/plugins/active_support.rb#7
+class Spoom::Deadcode::Plugins::ActiveSupport < ::Spoom::Deadcode::Plugins::Base; end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://spoom//lib/spoom/deadcode/plugins/base.rb#9
+class Spoom::Deadcode::Plugins::Base
+ abstract!
+
+ # Do not override this method, use `on_define_accessor` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#150
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def internal_on_define_accessor(indexer, definition); end
+
+ # Do not override this method, use `on_define_class` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#174
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def internal_on_define_class(indexer, definition); end
+
+ # Do not override this method, use `on_define_constant` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#204
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def internal_on_define_constant(indexer, definition); end
+
+ # Do not override this method, use `on_define_method` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#232
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def internal_on_define_method(indexer, definition); end
+
+ # Do not override this method, use `on_define_module` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#258
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def internal_on_define_module(indexer, definition); end
+
+ # Do not override this method, use `on_send` instead.
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#284
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def internal_on_send(indexer, send); end
+
+ # Called when an accessor is defined.
+ #
+ # Will be called when the indexer processes a `attr_reader`, `attr_writer` or `attr_accessor` node.
+ # Note that when this method is called, the definition for the node has already been added to the index.
+ # It is still possible to ignore it from the plugin:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_define_accessor(indexer, definition)
+ # definition.ignored! if definition.name == "foo"
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#144
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_accessor(indexer, definition); end
+
+ # Called when a class is defined.
+ #
+ # Will be called when the indexer processes a `class` node.
+ # Note that when this method is called, the definition for the node has already been added to the index.
+ # It is still possible to ignore it from the plugin:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_define_class(indexer, definition)
+ # definition.ignored! if definition.name == "Foo"
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#168
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_class(indexer, definition); end
+
+ # Called when a constant is defined.
+ #
+ # Will be called when the indexer processes a `CONST =` node.
+ # Note that when this method is called, the definition for the node has already been added to the index.
+ # It is still possible to ignore it from the plugin:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_define_constant(indexer, definition)
+ # definition.ignored! if definition.name == "FOO"
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#198
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_constant(indexer, definition); end
+
+ # Called when a method is defined.
+ #
+ # Will be called when the indexer processes a `def` or `defs` node.
+ # Note that when this method is called, the definition for the node has already been added to the index.
+ # It is still possible to ignore it from the plugin:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_define_method(indexer, definition)
+ # super # So the `ignore_method_names` DSL is still applied
+ #
+ # definition.ignored! if definition.name == "foo"
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#226
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+
+ # Called when a module is defined.
+ #
+ # Will be called when the indexer processes a `module` node.
+ # Note that when this method is called, the definition for the node has already been added to the index.
+ # It is still possible to ignore it from the plugin:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_define_module(indexer, definition)
+ # definition.ignored! if definition.name == "Foo"
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#252
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_module(indexer, definition); end
+
+ # Called when a send is being processed
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # def on_send(indexer, send)
+ # return unless send.name == "dsl_method"
+ # return if send.args.empty?
+ #
+ # method_name = indexer.node_string(send.args.first).delete_prefix(":")
+ # indexer.reference_method(method_name, send.node)
+ # end
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#278
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+
+ private
+
+ # Plugin utils
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#339
+ sig { params(name: ::String).returns(::String) }
+ def camelize(name); end
+
+ # DSL support
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#293
+ sig { params(name: T.nilable(::String)).returns(T::Boolean) }
+ def ignored_class_name?(name); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#307
+ sig { params(name: ::String).returns(T::Boolean) }
+ def ignored_constant_name?(name); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#312
+ sig { params(name: ::String).returns(T::Boolean) }
+ def ignored_method_name?(name); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#317
+ sig { params(name: ::String).returns(T::Boolean) }
+ def ignored_module_name?(name); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#322
+ sig { params(name: ::String, names_variable: ::Symbol, patterns_variable: ::Symbol).returns(T::Boolean) }
+ def ignored_name?(name, names_variable, patterns_variable); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#300
+ sig { params(superclass_name: T.nilable(::String)).returns(T::Boolean) }
+ def ignored_subclass?(superclass_name); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#327
+ sig { params(const: ::Symbol).returns(T::Set[::String]) }
+ def names(const); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#332
+ sig { params(const: ::Symbol).returns(T::Array[::Regexp]) }
+ def patterns(const); end
+
+ class << self
+ # Mark classes directly subclassing a class matching `names` as ignored.
+ #
+ # Names can be either strings or regexps:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # ignore_classes_inheriting_from(
+ # "Foo",
+ # "Bar",
+ # /Baz.*/,
+ # )
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#52
+ sig { params(names: T.any(::Regexp, ::String)).void }
+ def ignore_classes_inheriting_from(*names); end
+
+ # Mark classes matching `names` as ignored.
+ #
+ # Names can be either strings or regexps:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # ignore_class_names(
+ # "Foo",
+ # "Bar",
+ # /Baz.*/,
+ # )
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#34
+ sig { params(names: T.any(::Regexp, ::String)).void }
+ def ignore_classes_named(*names); end
+
+ # Mark constants matching `names` as ignored.
+ #
+ # Names can be either strings or regexps:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # ignore_class_names(
+ # "FOO",
+ # "BAR",
+ # /BAZ.*/,
+ # )
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#70
+ sig { params(names: T.any(::Regexp, ::String)).void }
+ def ignore_constants_named(*names); end
+
+ # Mark methods matching `names` as ignored.
+ #
+ # Names can be either strings or regexps:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # ignore_method_names(
+ # "foo",
+ # "bar",
+ # /baz.*/,
+ # )
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#88
+ sig { params(names: T.any(::Regexp, ::String)).void }
+ def ignore_methods_named(*names); end
+
+ # Mark modules matching `names` as ignored.
+ #
+ # Names can be either strings or regexps:
+ #
+ # ~~~rb
+ # class MyPlugin < Spoom::Deadcode::Plugins::Base
+ # ignore_class_names(
+ # "Foo",
+ # "Bar",
+ # /Baz.*/,
+ # )
+ # end
+ # ~~~
+ #
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#106
+ sig { params(names: T.any(::Regexp, ::String)).void }
+ def ignore_modules_named(*names); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/base.rb#113
+ sig do
+ params(
+ names: T::Array[T.any(::Regexp, ::String)],
+ names_variable: ::Symbol,
+ patterns_variable: ::Symbol
+ ).void
+ end
+ def save_names_and_patterns(names, names_variable, patterns_variable); end
+ end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/graphql.rb#7
+class Spoom::Deadcode::Plugins::GraphQL < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/graphql.rb#28
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/minitest.rb#7
+class Spoom::Deadcode::Plugins::Minitest < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/minitest.rb#22
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/namespaces.rb#7
+class Spoom::Deadcode::Plugins::Namespaces < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/namespaces.rb#11
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_class(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/namespaces.rb#16
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_module(indexer, definition); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/namespaces.rb#23
+ sig { params(indexer: ::Spoom::Deadcode::Indexer).returns(T::Boolean) }
+ def used_as_namespace?(indexer); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/rspec.rb#7
+class Spoom::Deadcode::Plugins::RSpec < ::Spoom::Deadcode::Plugins::Base; end
+
+# source://spoom//lib/spoom/deadcode/plugins/rails.rb#7
+class Spoom::Deadcode::Plugins::Rails < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/rails.rb#13
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_class(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/rails.rb#18
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_module(indexer, definition); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/rails.rb#25
+ sig { params(indexer: ::Spoom::Deadcode::Indexer).returns(T::Boolean) }
+ def file_is_helper?(indexer); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/rake.rb#7
+class Spoom::Deadcode::Plugins::Rake < ::Spoom::Deadcode::Plugins::Base; end
+
+# source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#7
+class Spoom::Deadcode::Plugins::Rubocop < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#18
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_constant(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#23
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#30
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).returns(T::Boolean) }
+ def rubocop_constant?(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#35
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).returns(T::Boolean) }
+ def rubocop_method?(indexer, definition); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/rubocop.rb#10
+Spoom::Deadcode::Plugins::Rubocop::RUBOCOP_CONSTANTS = T.let(T.unsafe(nil), Set)
+
+# source://spoom//lib/spoom/deadcode/plugins/ruby.rb#7
+class Spoom::Deadcode::Plugins::Ruby < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/ruby.rb#24
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send).void }
+ def on_send(indexer, send); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/ruby.rb#50
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, send: ::Spoom::Deadcode::Send, node: ::SyntaxTree::Node).void }
+ def reference_symbol_as_constant(indexer, send, node); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/sorbet.rb#7
+class Spoom::Deadcode::Plugins::Sorbet < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/sorbet.rb#11
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_constant(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/sorbet.rb#16
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/plugins/sorbet.rb#40
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).returns(T::Boolean) }
+ def sorbet_enum_constant?(indexer, definition); end
+
+ # source://spoom//lib/spoom/deadcode/plugins/sorbet.rb#23
+ sig { params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).returns(T::Boolean) }
+ def sorbet_type_member?(indexer, definition); end
+end
+
+# source://spoom//lib/spoom/deadcode/plugins/thor.rb#7
+class Spoom::Deadcode::Plugins::Thor < ::Spoom::Deadcode::Plugins::Base
+ # source://spoom//lib/spoom/deadcode/plugins/thor.rb#13
+ sig { override.params(indexer: ::Spoom::Deadcode::Indexer, definition: ::Spoom::Deadcode::Definition).void }
+ def on_define_method(indexer, definition); end
+end
+
# A reference is a call to a method or a constant
#
# source://spoom//lib/spoom/deadcode/reference.rb#7
@@ -1788,7 +2343,7 @@ class Spoom::Deadcode::Reference < ::T::Struct
def method?; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1801,6 +2356,217 @@ class Spoom::Deadcode::Reference::Kind < ::T::Enum
end
end
+# source://spoom//lib/spoom/deadcode/remover.rb#6
+class Spoom::Deadcode::Remover
+ # source://spoom//lib/spoom/deadcode/remover.rb#12
+ sig { params(context: ::Spoom::Context).void }
+ def initialize(context); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#17
+ sig { params(kind: ::Spoom::Deadcode::Definition::Kind, location: ::Spoom::Deadcode::Location).void }
+ def remove_location(kind, location); end
+end
+
+# source://spoom//lib/spoom/deadcode/remover.rb#9
+class Spoom::Deadcode::Remover::Error < ::Spoom::Error; end
+
+# source://spoom//lib/spoom/deadcode/remover.rb#348
+class Spoom::Deadcode::Remover::NodeContext
+ # source://spoom//lib/spoom/deadcode/remover.rb#358
+ sig { params(source: ::String, node: ::SyntaxTree::Node, nesting: T::Array[::SyntaxTree::Node]).void }
+ def initialize(source, node, nesting); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#467
+ sig { returns(T::Array[::SyntaxTree::Node]) }
+ def attached_comments_and_sigs; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#480
+ sig { returns(T.nilable(::SyntaxTree::MethodAddBlock)) }
+ def attached_sig; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#460
+ sig { params(comment: ::SyntaxTree::Node, node: ::SyntaxTree::Node).returns(T::Boolean) }
+ def comment_for_node?(comment, node); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#355
+ sig { returns(T::Array[::SyntaxTree::Node]) }
+ def nesting; end
+
+ # @return [Array]
+ #
+ # source://spoom//lib/spoom/deadcode/remover.rb#355
+ def nesting=(_arg0); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#407
+ sig { returns(T.nilable(::SyntaxTree::Node)) }
+ def next_node; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#397
+ sig { returns(T::Array[::SyntaxTree::Node]) }
+ def next_nodes; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#352
+ sig { returns(::SyntaxTree::Node) }
+ def node; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#495
+ sig { params(node: T.any(::Symbol, ::SyntaxTree::Node)).returns(::String) }
+ def node_string(node); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#373
+ sig { returns(::Spoom::Deadcode::Remover::NodeContext) }
+ def parent_context; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#365
+ sig { returns(::SyntaxTree::Node) }
+ def parent_node; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#392
+ sig { returns(T.nilable(::SyntaxTree::Node)) }
+ def previous_node; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#382
+ sig { returns(T::Array[::SyntaxTree::Node]) }
+ def previous_nodes; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#412
+ sig { returns(T.nilable(::Spoom::Deadcode::Remover::NodeContext)) }
+ def sclass_context; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#451
+ sig { params(node: T.nilable(::SyntaxTree::Node)).returns(T::Boolean) }
+ def sorbet_extend_sig?(node); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#438
+ sig { params(node: T.nilable(::SyntaxTree::Node)).returns(T::Boolean) }
+ def sorbet_signature?(node); end
+end
+
+# source://spoom//lib/spoom/deadcode/remover.rb#505
+class Spoom::Deadcode::Remover::NodeFinder < ::SyntaxTree::Visitor
+ # source://spoom//lib/spoom/deadcode/remover.rb#554
+ sig { params(location: ::Spoom::Deadcode::Location).void }
+ def initialize(location); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#548
+ sig { returns(T.nilable(::SyntaxTree::Node)) }
+ def node; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#551
+ sig { returns(T::Array[::SyntaxTree::Node]) }
+ def nodes_nesting; end
+
+ # @return [Array]
+ #
+ # source://spoom//lib/spoom/deadcode/remover.rb#551
+ def nodes_nesting=(_arg0); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#562
+ sig { override.params(node: T.nilable(::SyntaxTree::Node)).void }
+ def visit(node); end
+
+ private
+
+ # TODO: remove once SyntaxTree location are fixed
+ #
+ # source://spoom//lib/spoom/deadcode/remover.rb#601
+ sig { params(node: ::SyntaxTree::Node, nodes: T::Array[::SyntaxTree::Node]).returns(::Spoom::Deadcode::Location) }
+ def location_from_children(node, nodes); end
+
+ # TODO: remove once SyntaxTree location are fixed
+ #
+ # source://spoom//lib/spoom/deadcode/remover.rb#586
+ sig { params(node: ::SyntaxTree::Node).returns(::Spoom::Deadcode::Location) }
+ def location_from_node(node); end
+
+ class << self
+ # source://spoom//lib/spoom/deadcode/remover.rb#512
+ sig do
+ params(
+ source: ::String,
+ location: ::Spoom::Deadcode::Location,
+ kind: ::Spoom::Deadcode::Definition::Kind
+ ).returns(::Spoom::Deadcode::Remover::NodeContext)
+ end
+ def find(source, location, kind); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#531
+ sig { params(node: ::SyntaxTree::Node, kind: ::Spoom::Deadcode::Definition::Kind).returns(T::Boolean) }
+ def node_match_kind?(node, kind); end
+ end
+end
+
+# source://spoom//lib/spoom/deadcode/remover.rb#29
+class Spoom::Deadcode::Remover::NodeRemover
+ # source://spoom//lib/spoom/deadcode/remover.rb#36
+ sig do
+ params(
+ source: ::String,
+ kind: ::Spoom::Deadcode::Definition::Kind,
+ location: ::Spoom::Deadcode::Location
+ ).void
+ end
+ def initialize(source, kind, location); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#46
+ sig { void }
+ def apply_edit; end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#33
+ sig { returns(::String) }
+ def new_source; end
+
+ private
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#142
+ sig { params(context: ::Spoom::Deadcode::Remover::NodeContext).void }
+ def delete_attr_accessor(context); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#290
+ sig { params(start_char: ::Integer, end_char: ::Integer).void }
+ def delete_chars(start_char, end_char); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#69
+ sig { params(context: ::Spoom::Deadcode::Remover::NodeContext).void }
+ def delete_constant_assignment(context); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#300
+ sig { params(line_number: ::Integer, start_column: ::Integer, end_column: ::Integer).void }
+ def delete_line_part(line_number, start_column, end_column); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#283
+ sig { params(start_line: ::Integer, end_line: ::Integer).void }
+ def delete_lines(start_line, end_line); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#250
+ sig { params(context: ::Spoom::Deadcode::Remover::NodeContext).void }
+ def delete_node_and_comments_and_sigs(context); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#207
+ sig do
+ params(
+ node: ::SyntaxTree::Node,
+ send_context: ::Spoom::Deadcode::Remover::NodeContext,
+ was_removed: T::Boolean
+ ).void
+ end
+ def insert_accessor(node, send_context, was_removed:); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#295
+ sig { params(start_char: ::Integer, end_char: ::Integer, replacement: ::String).void }
+ def replace_chars(start_char, end_char, replacement); end
+
+ # source://spoom//lib/spoom/deadcode/remover.rb#315
+ sig do
+ params(
+ node: ::SyntaxTree::MethodAddBlock,
+ name: ::String,
+ kind: ::Spoom::Deadcode::Definition::Kind
+ ).returns(::String)
+ end
+ def transform_sig(node, name:, kind:); end
+end
+
# An abstraction to simplify handling of SyntaxTree::CallNode, SyntaxTree::Command, SyntaxTree::CommandCall and
# SyntaxTree::VCall nodes.
#
@@ -1812,8 +2578,22 @@ class Spoom::Deadcode::Send < ::T::Struct
const :args, T::Array[::SyntaxTree::Node], default: T.unsafe(nil)
const :block, T.nilable(::SyntaxTree::Node), default: T.unsafe(nil)
+ # source://spoom//lib/spoom/deadcode/send.rb#22
+ sig do
+ type_parameters(:T)
+ .params(
+ arg_type: T::Class[T.type_parameter(:T)],
+ block: T.proc.params(arg: T.type_parameter(:T)).void
+ ).void
+ end
+ def each_arg(arg_type, &block); end
+
+ # source://spoom//lib/spoom/deadcode/send.rb#29
+ sig { params(block: T.proc.params(key: ::SyntaxTree::Node, value: T.nilable(::SyntaxTree::Node)).void).void }
+ def each_arg_assoc(&block); end
+
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1833,7 +2613,7 @@ class Spoom::ExecResult < ::T::Struct
def to_s; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2041,7 +2821,7 @@ class Spoom::FileTree::Node < ::T::Struct
def path; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2107,7 +2887,7 @@ class Spoom::Git::Commit < ::T::Struct
def timestamp; end
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
# Parse a line formated as `%h %at` into a `Commit`
@@ -2219,7 +2999,7 @@ class Spoom::LSP::Diagnostic < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Diagnostic) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2252,7 +3032,7 @@ class Spoom::LSP::DocumentSymbol < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::DocumentSymbol) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2310,7 +3090,7 @@ class Spoom::LSP::Hover < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Hover) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2335,7 +3115,7 @@ class Spoom::LSP::Location < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Location) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2398,7 +3178,7 @@ class Spoom::LSP::Position < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Position) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2436,7 +3216,7 @@ class Spoom::LSP::Range < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::Range) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2502,7 +3282,7 @@ class Spoom::LSP::SignatureHelp < ::T::Struct
sig { params(json: T::Hash[T.untyped, T.untyped]).returns(::Spoom::LSP::SignatureHelp) }
def from_json(json); end
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -2624,7 +3404,7 @@ Spoom::SPOOM_PATH = T.let(T.unsafe(nil), String)
# source://spoom//lib/spoom/sorbet/config.rb#5
module Spoom::Sorbet; end
-# source://spoom//lib/spoom/sorbet.rb#38
+# source://spoom//lib/spoom/sorbet.rb#39
Spoom::Sorbet::BIN_PATH = T.let(T.unsafe(nil), String)
# source://spoom//lib/spoom/sorbet.rb#36
@@ -2867,7 +3647,10 @@ Spoom::Sorbet::Errors::Parser::HEADER = T.let(T.unsafe(nil), Array)
# source://spoom//lib/spoom/sorbet.rb#37
Spoom::Sorbet::GEM_PATH = T.let(T.unsafe(nil), String)
-# source://spoom//lib/spoom/sorbet.rb#40
+# source://spoom//lib/spoom/sorbet.rb#38
+Spoom::Sorbet::GEM_VERSION = T.let(T.unsafe(nil), String)
+
+# source://spoom//lib/spoom/sorbet.rb#41
Spoom::Sorbet::KILLED_CODE = T.let(T.unsafe(nil), Integer)
# source://spoom//lib/spoom/sorbet/metrics.rb#8
@@ -2890,7 +3673,7 @@ end
# source://spoom//lib/spoom/sorbet/metrics.rb#9
Spoom::Sorbet::MetricsParser::DEFAULT_PREFIX = T.let(T.unsafe(nil), String)
-# source://spoom//lib/spoom/sorbet.rb#41
+# source://spoom//lib/spoom/sorbet.rb#42
Spoom::Sorbet::SEGFAULT_CODE = T.let(T.unsafe(nil), Integer)
# source://spoom//lib/spoom/sorbet/sigils.rb#9
diff --git a/sorbet/rbi/gems/standard-performance@1.2.1.rbi b/sorbet/rbi/gems/standard-performance@1.3.1.rbi
similarity index 100%
rename from sorbet/rbi/gems/standard-performance@1.2.1.rbi
rename to sorbet/rbi/gems/standard-performance@1.3.1.rbi
diff --git a/sorbet/rbi/gems/standard@1.31.2.rbi b/sorbet/rbi/gems/standard@1.33.0.rbi
similarity index 88%
rename from sorbet/rbi/gems/standard@1.31.2.rbi
rename to sorbet/rbi/gems/standard@1.33.0.rbi
index 23d1c10..ad076de 100644
--- a/sorbet/rbi/gems/standard@1.31.2.rbi
+++ b/sorbet/rbi/gems/standard@1.33.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.56.4/lib/rubocop/comment_config.rb#63
+ # source://rubocop/1.59.0/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.56.4/lib/rubocop/comment_config.rb#51
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#51
def cop_disabled_line_ranges; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#39
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#39
def cop_enabled_at_line?(cop, line_number); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#47
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#47
def cop_opted_in?(cop); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#55
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#55
def extra_enabled_comments; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#30
+ # source://rubocop/1.59.0/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.56.4/lib/rubocop/comment_config.rb#96
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#96
def analyze; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#124
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#124
def analyze_cop(analysis, directive); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#144
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#144
def analyze_disabled(analysis, directive); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#155
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#155
def analyze_rest(analysis, directive); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#135
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#135
def analyze_single_line(analysis, directive); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#164
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#164
def cop_line_ranges(analysis); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#170
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#170
def each_directive; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#69
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#69
def extra_enabled_comments_with_names(extras:, names:); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#190
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#190
def handle_enable_all(directive, names, extras); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#204
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#204
def handle_switch(directive, names, extras); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#115
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#115
def inject_disabled_cops_directives(analyses); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#183
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#183
def non_comment_token_line_numbers; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#34
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#34
def old_initialize(processed_source); end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#83
+ # source://rubocop/1.59.0/lib/rubocop/comment_config.rb#83
def opt_in_cops; end
- # source://rubocop/1.56.4/lib/rubocop/comment_config.rb#179
+ # source://rubocop/1.59.0/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.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#55
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55
def on_if(node); end
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#55
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55
def on_until(node); end
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#55
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#55
def on_while(node); end
private
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#82
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#82
def allowed_construct?(asgn_node); end
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#86
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#86
def conditional_assignment?(asgn_node); end
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#90
+ # source://rubocop/1.59.0/lib/rubocop/cop/lint/assignment_in_condition.rb#90
def skip_children?(asgn_node); end
- # source://rubocop/1.56.4/lib/rubocop/cop/lint/assignment_in_condition.rb#96
+ # source://rubocop/1.59.0/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.56.4/lib/rubocop/directive_comment.rb#30
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#30
def initialize(comment, cop_registry = T.unsafe(nil)); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#80
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#80
def all_cops?; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#28
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28
def comment; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#85
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#85
def cop_names; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#28
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28
def cop_registry; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#28
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28
def cops; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#91
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#91
def department_names; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#105
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#105
def directive_count; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#60
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#60
def disabled?; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#75
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#75
def disabled_all?; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#65
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#65
def enabled?; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#70
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#70
def enabled_all?; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#96
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#96
def in_directive_department?(cop); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#110
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#110
def line_number; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#42
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#42
def match?(cop_names); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#55
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#55
def match_captures; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#28
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#28
def mode; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#101
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#101
def overridden_by_department?(cop); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#46
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#46
def range; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#37
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#37
def single_line?; end
private
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#130
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#130
def all_cop_names; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#134
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#134
def cop_names_for_department(department); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#126
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#126
def department?(name); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#140
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#140
def exclude_redundant_directive_cop(cops); end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#120
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#120
def parsed_cop_names; end
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#116
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#116
def splitted_cops_string; end
class << self
- # source://rubocop/1.56.4/lib/rubocop/directive_comment.rb#24
+ # source://rubocop/1.59.0/lib/rubocop/directive_comment.rb#24
def before_comment(line); end
end
end
diff --git a/sorbet/rbi/gems/stringio@3.1.0.rbi b/sorbet/rbi/gems/stringio@3.1.0.rbi
new file mode 100644
index 0000000..01a26ea
--- /dev/null
+++ b/sorbet/rbi/gems/stringio@3.1.0.rbi
@@ -0,0 +1,8 @@
+# typed: true
+
+# DO NOT EDIT MANUALLY
+# This is an autogenerated file for types exported from the `stringio` gem.
+# Please instead update this file by running `bin/tapioca gem stringio`.
+
+# THIS IS AN EMPTY RBI FILE.
+# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/syntax_tree@6.1.1.rbi b/sorbet/rbi/gems/syntax_tree@6.2.0.rbi
similarity index 86%
rename from sorbet/rbi/gems/syntax_tree@6.1.1.rbi
rename to sorbet/rbi/gems/syntax_tree@6.2.0.rbi
index d8f68fe..597be4c 100644
--- a/sorbet/rbi/gems/syntax_tree@6.1.1.rbi
+++ b/sorbet/rbi/gems/syntax_tree@6.2.0.rbi
@@ -14,72 +14,72 @@ module SyntaxTree
class << self
# Parses the given source and returns the formatted source.
#
- # source://syntax_tree//lib/syntax_tree.rb#59
+ # source://syntax_tree//lib/syntax_tree.rb#60
def format(source, maxwidth = T.unsafe(nil), base_indentation = T.unsafe(nil), options: T.unsafe(nil)); end
# Parses the given file and returns the formatted source.
#
- # source://syntax_tree//lib/syntax_tree.rb#75
+ # source://syntax_tree//lib/syntax_tree.rb#76
def format_file(filepath, maxwidth = T.unsafe(nil), base_indentation = T.unsafe(nil), options: T.unsafe(nil)); end
# Accepts a node in the tree and returns the formatted source.
#
- # source://syntax_tree//lib/syntax_tree.rb#85
+ # source://syntax_tree//lib/syntax_tree.rb#86
def format_node(source, node, maxwidth = T.unsafe(nil), base_indentation = T.unsafe(nil), options: T.unsafe(nil)); end
# Indexes the given source code to return a list of all class, module, and
# method definitions. Used to quickly provide indexing capability for IDEs or
# documentation generation.
#
- # source://syntax_tree//lib/syntax_tree.rb#102
+ # source://syntax_tree//lib/syntax_tree.rb#103
def index(source); end
# Indexes the given file to return a list of all class, module, and method
# definitions. Used to quickly provide indexing capability for IDEs or
# documentation generation.
#
- # source://syntax_tree//lib/syntax_tree.rb#109
+ # source://syntax_tree//lib/syntax_tree.rb#110
def index_file(filepath); end
# A convenience method for creating a new mutation visitor.
#
# @yield [visitor]
#
- # source://syntax_tree//lib/syntax_tree.rb#114
+ # source://syntax_tree//lib/syntax_tree.rb#115
def mutation; end
# Parses the given source and returns the syntax tree.
#
- # source://syntax_tree//lib/syntax_tree.rb#121
+ # source://syntax_tree//lib/syntax_tree.rb#122
def parse(source); end
# Parses the given file and returns the syntax tree.
#
- # source://syntax_tree//lib/syntax_tree.rb#128
+ # source://syntax_tree//lib/syntax_tree.rb#129
def parse_file(filepath); end
# Returns the source from the given filepath taking into account any potential
# magic encoding comments.
#
- # source://syntax_tree//lib/syntax_tree.rb#134
+ # source://syntax_tree//lib/syntax_tree.rb#135
def read(filepath); end
# This is a hook provided so that plugins can register themselves as the
# handler for a particular file type.
#
- # source://syntax_tree//lib/syntax_tree.rb#149
+ # source://syntax_tree//lib/syntax_tree.rb#150
def register_handler(extension, handler); end
# Searches through the given source using the given pattern and yields each
# node in the tree that matches the pattern to the given block.
#
- # source://syntax_tree//lib/syntax_tree.rb#155
+ # source://syntax_tree//lib/syntax_tree.rb#156
def search(source, query, &block); end
# Searches through the given file using the given pattern and yields each
# node in the tree that matches the pattern to the given block.
#
- # source://syntax_tree//lib/syntax_tree.rb#164
+ # source://syntax_tree//lib/syntax_tree.rb#165
def search_file(filepath, query, &block); end
end
end
@@ -716,7 +716,7 @@ class SyntaxTree::AryPtn < ::SyntaxTree::Node
# source://syntax_tree//lib/syntax_tree/node.rb#1318
def comments; end
- # [nil | VarRef] the optional constant wrapper
+ # [nil | VarRef | ConstPathRef] the optional constant wrapper
#
# source://syntax_tree//lib/syntax_tree/node.rb#1303
def constant; end
@@ -1415,60 +1415,60 @@ end
#
# method { |value| }
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4309
+# source://syntax_tree//lib/syntax_tree/node.rb#4312
class SyntaxTree::BlockNode < ::SyntaxTree::Node
# @return [BlockNode] a new instance of BlockNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4344
+ # source://syntax_tree//lib/syntax_tree/node.rb#4347
def initialize(opening:, block_var:, bodystmt:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4417
+ # source://syntax_tree//lib/syntax_tree/node.rb#4420
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4352
+ # source://syntax_tree//lib/syntax_tree/node.rb#4355
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4426
+ # source://syntax_tree//lib/syntax_tree/node.rb#4429
def arity; end
# [nil | BlockVar] the optional variable declaration within this block
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4336
+ # source://syntax_tree//lib/syntax_tree/node.rb#4339
def block_var; end
# [BodyStmt | Statements] the expressions to be executed within this block
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4339
+ # source://syntax_tree//lib/syntax_tree/node.rb#4342
def bodystmt; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4356
+ # source://syntax_tree//lib/syntax_tree/node.rb#4359
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4342
+ # source://syntax_tree//lib/syntax_tree/node.rb#4345
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4360
+ # source://syntax_tree//lib/syntax_tree/node.rb#4363
def copy(opening: T.unsafe(nil), block_var: T.unsafe(nil), bodystmt: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4356
+ # source://syntax_tree//lib/syntax_tree/node.rb#4359
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4375
+ # source://syntax_tree//lib/syntax_tree/node.rb#4378
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4385
+ # source://syntax_tree//lib/syntax_tree/node.rb#4388
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4422
+ # source://syntax_tree//lib/syntax_tree/node.rb#4425
def keywords?; end
# [LBrace | Kw] the left brace or the do keyword that opens this block
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4333
+ # source://syntax_tree//lib/syntax_tree/node.rb#4336
def opening; end
private
@@ -1478,7 +1478,7 @@ class SyntaxTree::BlockNode < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4468
+ # source://syntax_tree//lib/syntax_tree/node.rb#4471
def forced_brace_bounds?(q); end
# If we're a sibling of a control-flow keyword, then we're going to have to
@@ -1486,13 +1486,13 @@ class SyntaxTree::BlockNode < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4457
+ # source://syntax_tree//lib/syntax_tree/node.rb#4460
def forced_do_end_bounds?(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4484
+ # source://syntax_tree//lib/syntax_tree/node.rb#4487
def format_break(q, break_opening, break_closing); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4504
+ # source://syntax_tree//lib/syntax_tree/node.rb#4507
def format_flat(q, flat_opening, flat_closing); end
# If this is nested anywhere inside certain nodes, then we can't change
@@ -1500,33 +1500,33 @@ class SyntaxTree::BlockNode < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4439
+ # source://syntax_tree//lib/syntax_tree/node.rb#4442
def unchangeable_bounds?(q); end
end
# Formats the opening brace or keyword of a block.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4311
+# source://syntax_tree//lib/syntax_tree/node.rb#4314
class SyntaxTree::BlockNode::BlockOpenFormatter
# @return [BlockOpenFormatter] a new instance of BlockOpenFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4318
+ # source://syntax_tree//lib/syntax_tree/node.rb#4321
def initialize(text, node); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4323
+ # source://syntax_tree//lib/syntax_tree/node.rb#4326
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4327
+ # source://syntax_tree//lib/syntax_tree/node.rb#4330
def format(q); end
# [LBrace | Keyword] the node that is being represented
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4316
+ # source://syntax_tree//lib/syntax_tree/node.rb#4319
def node; end
# [String] the actual output that should be printed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4313
+ # source://syntax_tree//lib/syntax_tree/node.rb#4316
def text; end
end
@@ -1772,42 +1772,42 @@ end
#
# @@variable
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4043
+# source://syntax_tree//lib/syntax_tree/node.rb#4046
class SyntaxTree::CVar < ::SyntaxTree::Node
# @return [CVar] a new instance of CVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4050
+ # source://syntax_tree//lib/syntax_tree/node.rb#4053
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4085
+ # source://syntax_tree//lib/syntax_tree/node.rb#4088
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4056
+ # source://syntax_tree//lib/syntax_tree/node.rb#4059
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4060
+ # source://syntax_tree//lib/syntax_tree/node.rb#4063
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4048
+ # source://syntax_tree//lib/syntax_tree/node.rb#4051
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4064
+ # source://syntax_tree//lib/syntax_tree/node.rb#4067
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4060
+ # source://syntax_tree//lib/syntax_tree/node.rb#4063
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4077
+ # source://syntax_tree//lib/syntax_tree/node.rb#4080
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4081
+ # source://syntax_tree//lib/syntax_tree/node.rb#4084
def format(q); end
# [String] the name of the class variable
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4045
+ # source://syntax_tree//lib/syntax_tree/node.rb#4048
def value; end
end
@@ -1852,16 +1852,16 @@ class SyntaxTree::CallChainFormatter
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2895
+ # source://syntax_tree//lib/syntax_tree/node.rb#2898
def attach_directly?(node); end
- # source://syntax_tree//lib/syntax_tree/node.rb#2905
+ # source://syntax_tree//lib/syntax_tree/node.rb#2908
def format_child(q, child, skip_comments: T.unsafe(nil), skip_operator: T.unsafe(nil), skip_attached: T.unsafe(nil)); end
class << self
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2876
+ # source://syntax_tree//lib/syntax_tree/node.rb#2879
def chained?(node); end
end
end
@@ -1870,69 +1870,69 @@ end
#
# receiver.message
#
-# source://syntax_tree//lib/syntax_tree/node.rb#2943
+# source://syntax_tree//lib/syntax_tree/node.rb#2946
class SyntaxTree::CallNode < ::SyntaxTree::Node
# @return [CallNode] a new instance of CallNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2959
+ # source://syntax_tree//lib/syntax_tree/node.rb#2962
def initialize(receiver:, operator:, message:, arguments:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3054
+ # source://syntax_tree//lib/syntax_tree/node.rb#3057
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#2968
+ # source://syntax_tree//lib/syntax_tree/node.rb#2971
def accept(visitor); end
# [nil | ArgParen | Args] the arguments to the method call
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2954
+ # source://syntax_tree//lib/syntax_tree/node.rb#2957
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3100
+ # source://syntax_tree//lib/syntax_tree/node.rb#3103
def arity; end
- # source://syntax_tree//lib/syntax_tree/node.rb#2972
+ # source://syntax_tree//lib/syntax_tree/node.rb#2975
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2957
+ # source://syntax_tree//lib/syntax_tree/node.rb#2960
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#2981
+ # source://syntax_tree//lib/syntax_tree/node.rb#2984
def copy(receiver: T.unsafe(nil), operator: T.unsafe(nil), message: T.unsafe(nil), arguments: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#2972
+ # source://syntax_tree//lib/syntax_tree/node.rb#2975
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3003
+ # source://syntax_tree//lib/syntax_tree/node.rb#3006
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3014
+ # source://syntax_tree//lib/syntax_tree/node.rb#3017
def format(q); end
# Print out the arguments to this call. If there are no arguments, then do
# nothing.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3062
+ # source://syntax_tree//lib/syntax_tree/node.rb#3065
def format_arguments(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3072
+ # source://syntax_tree//lib/syntax_tree/node.rb#3075
def format_contents(q); end
# [:call | Backtick | Const | Ident | Op] the message being sent
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2951
+ # source://syntax_tree//lib/syntax_tree/node.rb#2954
def message; end
# [nil | :"::" | Op | Period] the operator being used to send the message
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2948
+ # source://syntax_tree//lib/syntax_tree/node.rb#2951
def operator; end
# [nil | Node] the receiver of the method call
#
- # source://syntax_tree//lib/syntax_tree/node.rb#2945
+ # source://syntax_tree//lib/syntax_tree/node.rb#2948
def receiver; end
end
@@ -1969,52 +1969,52 @@ end
# "number"
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3116
+# source://syntax_tree//lib/syntax_tree/node.rb#3119
class SyntaxTree::Case < ::SyntaxTree::Node
# @return [Case] a new instance of Case
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3129
+ # source://syntax_tree//lib/syntax_tree/node.rb#3132
def initialize(keyword:, value:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3187
+ # source://syntax_tree//lib/syntax_tree/node.rb#3190
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3137
+ # source://syntax_tree//lib/syntax_tree/node.rb#3140
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3141
+ # source://syntax_tree//lib/syntax_tree/node.rb#3144
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3127
+ # source://syntax_tree//lib/syntax_tree/node.rb#3130
def comments; end
# [In | When] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3124
+ # source://syntax_tree//lib/syntax_tree/node.rb#3127
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3145
+ # source://syntax_tree//lib/syntax_tree/node.rb#3148
def copy(keyword: T.unsafe(nil), value: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3141
+ # source://syntax_tree//lib/syntax_tree/node.rb#3144
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3160
+ # source://syntax_tree//lib/syntax_tree/node.rb#3163
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3170
+ # source://syntax_tree//lib/syntax_tree/node.rb#3173
def format(q); end
# [Kw] the keyword that opens this expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3118
+ # source://syntax_tree//lib/syntax_tree/node.rb#3121
def keyword; end
# [nil | Node] optional value being switched on
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3121
+ # source://syntax_tree//lib/syntax_tree/node.rb#3124
def value; end
end
@@ -2050,91 +2050,91 @@ end
# class Child < method
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3312
+# source://syntax_tree//lib/syntax_tree/node.rb#3315
class SyntaxTree::ClassDeclaration < ::SyntaxTree::Node
# @return [ClassDeclaration] a new instance of ClassDeclaration
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3326
+ # source://syntax_tree//lib/syntax_tree/node.rb#3329
def initialize(constant:, superclass:, bodystmt:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3389
+ # source://syntax_tree//lib/syntax_tree/node.rb#3392
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3334
+ # source://syntax_tree//lib/syntax_tree/node.rb#3337
def accept(visitor); end
# [BodyStmt] the expressions to execute within the context of the class
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3321
+ # source://syntax_tree//lib/syntax_tree/node.rb#3324
def bodystmt; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3338
+ # source://syntax_tree//lib/syntax_tree/node.rb#3341
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3324
+ # source://syntax_tree//lib/syntax_tree/node.rb#3327
def comments; end
# [ConstPathRef | ConstRef | TopConstRef] the name of the class being
# defined
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3315
+ # source://syntax_tree//lib/syntax_tree/node.rb#3318
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3342
+ # source://syntax_tree//lib/syntax_tree/node.rb#3345
def copy(constant: T.unsafe(nil), superclass: T.unsafe(nil), bodystmt: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3338
+ # source://syntax_tree//lib/syntax_tree/node.rb#3341
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3357
+ # source://syntax_tree//lib/syntax_tree/node.rb#3360
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3367
+ # source://syntax_tree//lib/syntax_tree/node.rb#3370
def format(q); end
# [nil | Node] the optional superclass declaration
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3318
+ # source://syntax_tree//lib/syntax_tree/node.rb#3321
def superclass; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#3396
+ # source://syntax_tree//lib/syntax_tree/node.rb#3399
def format_declaration(q); end
end
# Comma represents the use of the , operator.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3410
+# source://syntax_tree//lib/syntax_tree/node.rb#3413
class SyntaxTree::Comma < ::SyntaxTree::Node
# @return [Comma] a new instance of Comma
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3414
+ # source://syntax_tree//lib/syntax_tree/node.rb#3417
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3437
+ # source://syntax_tree//lib/syntax_tree/node.rb#3440
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3419
+ # source://syntax_tree//lib/syntax_tree/node.rb#3422
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3423
+ # source://syntax_tree//lib/syntax_tree/node.rb#3426
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3427
+ # source://syntax_tree//lib/syntax_tree/node.rb#3430
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3423
+ # source://syntax_tree//lib/syntax_tree/node.rb#3426
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3433
+ # source://syntax_tree//lib/syntax_tree/node.rb#3436
def deconstruct_keys(_keys); end
# [String] the comma in the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3412
+ # source://syntax_tree//lib/syntax_tree/node.rb#3415
def value; end
end
@@ -2144,60 +2144,60 @@ end
#
# method argument
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3448
+# source://syntax_tree//lib/syntax_tree/node.rb#3451
class SyntaxTree::Command < ::SyntaxTree::Node
# @return [Command] a new instance of Command
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3461
+ # source://syntax_tree//lib/syntax_tree/node.rb#3464
def initialize(message:, arguments:, block:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3511
+ # source://syntax_tree//lib/syntax_tree/node.rb#3514
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3469
+ # source://syntax_tree//lib/syntax_tree/node.rb#3472
def accept(visitor); end
# [Args] the arguments being sent with the message
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3453
+ # source://syntax_tree//lib/syntax_tree/node.rb#3456
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3516
+ # source://syntax_tree//lib/syntax_tree/node.rb#3519
def arity; end
# [nil | BlockNode] the optional block being passed to the method
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3456
+ # source://syntax_tree//lib/syntax_tree/node.rb#3459
def block; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3473
+ # source://syntax_tree//lib/syntax_tree/node.rb#3476
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3459
+ # source://syntax_tree//lib/syntax_tree/node.rb#3462
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3477
+ # source://syntax_tree//lib/syntax_tree/node.rb#3480
def copy(message: T.unsafe(nil), arguments: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3473
+ # source://syntax_tree//lib/syntax_tree/node.rb#3476
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3492
+ # source://syntax_tree//lib/syntax_tree/node.rb#3495
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3502
+ # source://syntax_tree//lib/syntax_tree/node.rb#3505
def format(q); end
# [Const | Ident] the message being sent to the implicit receiver
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3450
+ # source://syntax_tree//lib/syntax_tree/node.rb#3453
def message; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#3522
+ # source://syntax_tree//lib/syntax_tree/node.rb#3525
def align(q, node, &block); end
end
@@ -2206,70 +2206,70 @@ end
#
# object.method argument
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3560
+# source://syntax_tree//lib/syntax_tree/node.rb#3563
class SyntaxTree::CommandCall < ::SyntaxTree::Node
# @return [CommandCall] a new instance of CommandCall
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3579
+ # source://syntax_tree//lib/syntax_tree/node.rb#3582
def initialize(receiver:, operator:, message:, arguments:, block:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3683
+ # source://syntax_tree//lib/syntax_tree/node.rb#3686
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3596
+ # source://syntax_tree//lib/syntax_tree/node.rb#3599
def accept(visitor); end
# [nil | Args | ArgParen] the arguments going along with the message
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3571
+ # source://syntax_tree//lib/syntax_tree/node.rb#3574
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3689
+ # source://syntax_tree//lib/syntax_tree/node.rb#3692
def arity; end
# [nil | BlockNode] the block associated with this method call
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3574
+ # source://syntax_tree//lib/syntax_tree/node.rb#3577
def block; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3600
+ # source://syntax_tree//lib/syntax_tree/node.rb#3603
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3577
+ # source://syntax_tree//lib/syntax_tree/node.rb#3580
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3604
+ # source://syntax_tree//lib/syntax_tree/node.rb#3607
def copy(receiver: T.unsafe(nil), operator: T.unsafe(nil), message: T.unsafe(nil), arguments: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3600
+ # source://syntax_tree//lib/syntax_tree/node.rb#3603
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3628
+ # source://syntax_tree//lib/syntax_tree/node.rb#3631
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3640
+ # source://syntax_tree//lib/syntax_tree/node.rb#3643
def format(q); end
# [:call | Const | Ident | Op] the message being send
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3568
+ # source://syntax_tree//lib/syntax_tree/node.rb#3571
def message; end
# [nil | :"::" | Op | Period] the operator used to send the message
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3565
+ # source://syntax_tree//lib/syntax_tree/node.rb#3568
def operator; end
# [nil | Node] the receiver of the message
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3562
+ # source://syntax_tree//lib/syntax_tree/node.rb#3565
def receiver; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#3695
+ # source://syntax_tree//lib/syntax_tree/node.rb#3698
def argument_alignment(q, doc); end
end
@@ -2277,112 +2277,112 @@ end
#
# # comment
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3722
+# source://syntax_tree//lib/syntax_tree/node.rb#3725
class SyntaxTree::Comment < ::SyntaxTree::Node
# @return [Comment] a new instance of Comment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3731
+ # source://syntax_tree//lib/syntax_tree/node.rb#3734
def initialize(value:, inline:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3790
+ # source://syntax_tree//lib/syntax_tree/node.rb#3793
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3764
+ # source://syntax_tree//lib/syntax_tree/node.rb#3767
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3768
+ # source://syntax_tree//lib/syntax_tree/node.rb#3771
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3760
+ # source://syntax_tree//lib/syntax_tree/node.rb#3763
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3772
+ # source://syntax_tree//lib/syntax_tree/node.rb#3775
def copy(value: T.unsafe(nil), inline: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3768
+ # source://syntax_tree//lib/syntax_tree/node.rb#3771
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3782
+ # source://syntax_tree//lib/syntax_tree/node.rb#3785
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3786
+ # source://syntax_tree//lib/syntax_tree/node.rb#3789
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3756
+ # source://syntax_tree//lib/syntax_tree/node.rb#3759
def ignore?; end
# [boolean] whether or not there is code on the same line as this comment.
# If there is, then inline will be true.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3728
+ # source://syntax_tree//lib/syntax_tree/node.rb#3731
def inline; end
# [boolean] whether or not there is code on the same line as this comment.
# If there is, then inline will be true.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3728
+ # source://syntax_tree//lib/syntax_tree/node.rb#3731
def inline?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3740
+ # source://syntax_tree//lib/syntax_tree/node.rb#3743
def leading!; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3744
+ # source://syntax_tree//lib/syntax_tree/node.rb#3747
def leading?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3748
+ # source://syntax_tree//lib/syntax_tree/node.rb#3751
def trailing!; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3752
+ # source://syntax_tree//lib/syntax_tree/node.rb#3755
def trailing?; end
# [String] the contents of the comment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3724
+ # source://syntax_tree//lib/syntax_tree/node.rb#3727
def value; end
end
# Formats an If or Unless node.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6314
+# source://syntax_tree//lib/syntax_tree/node.rb#6317
class SyntaxTree::ConditionalFormatter
# @return [ConditionalFormatter] a new instance of ConditionalFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6321
+ # source://syntax_tree//lib/syntax_tree/node.rb#6324
def initialize(keyword, node); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6326
+ # source://syntax_tree//lib/syntax_tree/node.rb#6329
def format(q); end
# [String] the keyword associated with this conditional
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6316
+ # source://syntax_tree//lib/syntax_tree/node.rb#6319
def keyword; end
# [If | Unless] the node that is being formatted
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6319
+ # source://syntax_tree//lib/syntax_tree/node.rb#6322
def node; end
private
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6450
+ # source://syntax_tree//lib/syntax_tree/node.rb#6453
def contains_conditional?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6385
+ # source://syntax_tree//lib/syntax_tree/node.rb#6388
def format_break(q, force:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6377
+ # source://syntax_tree//lib/syntax_tree/node.rb#6380
def format_flat(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6405
+ # source://syntax_tree//lib/syntax_tree/node.rb#6408
def format_ternary(q); end
end
@@ -2400,42 +2400,42 @@ end
#
# :Constant
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3809
+# source://syntax_tree//lib/syntax_tree/node.rb#3812
class SyntaxTree::Const < ::SyntaxTree::Node
# @return [Const] a new instance of Const
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3816
+ # source://syntax_tree//lib/syntax_tree/node.rb#3819
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3851
+ # source://syntax_tree//lib/syntax_tree/node.rb#3854
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3822
+ # source://syntax_tree//lib/syntax_tree/node.rb#3825
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3826
+ # source://syntax_tree//lib/syntax_tree/node.rb#3829
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3814
+ # source://syntax_tree//lib/syntax_tree/node.rb#3817
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3830
+ # source://syntax_tree//lib/syntax_tree/node.rb#3833
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3826
+ # source://syntax_tree//lib/syntax_tree/node.rb#3829
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3843
+ # source://syntax_tree//lib/syntax_tree/node.rb#3846
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3847
+ # source://syntax_tree//lib/syntax_tree/node.rb#3850
def format(q); end
# [String] the name of the constant
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3811
+ # source://syntax_tree//lib/syntax_tree/node.rb#3814
def value; end
end
@@ -2445,47 +2445,47 @@ end
#
# object::Const = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3862
+# source://syntax_tree//lib/syntax_tree/node.rb#3865
class SyntaxTree::ConstPathField < ::SyntaxTree::Node
# @return [ConstPathField] a new instance of ConstPathField
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3872
+ # source://syntax_tree//lib/syntax_tree/node.rb#3875
def initialize(parent:, constant:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3916
+ # source://syntax_tree//lib/syntax_tree/node.rb#3919
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3879
+ # source://syntax_tree//lib/syntax_tree/node.rb#3882
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3883
+ # source://syntax_tree//lib/syntax_tree/node.rb#3886
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3870
+ # source://syntax_tree//lib/syntax_tree/node.rb#3873
def comments; end
# [Const] the constant itself
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3867
+ # source://syntax_tree//lib/syntax_tree/node.rb#3870
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3887
+ # source://syntax_tree//lib/syntax_tree/node.rb#3890
def copy(parent: T.unsafe(nil), constant: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3883
+ # source://syntax_tree//lib/syntax_tree/node.rb#3886
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3901
+ # source://syntax_tree//lib/syntax_tree/node.rb#3904
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3910
+ # source://syntax_tree//lib/syntax_tree/node.rb#3913
def format(q); end
# [Node] the source of the constant
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3864
+ # source://syntax_tree//lib/syntax_tree/node.rb#3867
def parent; end
end
@@ -2493,47 +2493,47 @@ end
#
# object::Const
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3926
+# source://syntax_tree//lib/syntax_tree/node.rb#3929
class SyntaxTree::ConstPathRef < ::SyntaxTree::Node
# @return [ConstPathRef] a new instance of ConstPathRef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3936
+ # source://syntax_tree//lib/syntax_tree/node.rb#3939
def initialize(parent:, constant:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3980
+ # source://syntax_tree//lib/syntax_tree/node.rb#3983
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3943
+ # source://syntax_tree//lib/syntax_tree/node.rb#3946
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3947
+ # source://syntax_tree//lib/syntax_tree/node.rb#3950
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3934
+ # source://syntax_tree//lib/syntax_tree/node.rb#3937
def comments; end
# [Const] the constant itself
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3931
+ # source://syntax_tree//lib/syntax_tree/node.rb#3934
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3951
+ # source://syntax_tree//lib/syntax_tree/node.rb#3954
def copy(parent: T.unsafe(nil), constant: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3947
+ # source://syntax_tree//lib/syntax_tree/node.rb#3950
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3965
+ # source://syntax_tree//lib/syntax_tree/node.rb#3968
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3974
+ # source://syntax_tree//lib/syntax_tree/node.rb#3977
def format(q); end
# [Node] the source of the constant
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3928
+ # source://syntax_tree//lib/syntax_tree/node.rb#3931
def parent; end
end
@@ -2543,42 +2543,42 @@ end
# class Container
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3992
+# source://syntax_tree//lib/syntax_tree/node.rb#3995
class SyntaxTree::ConstRef < ::SyntaxTree::Node
# @return [ConstRef] a new instance of ConstRef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3999
+ # source://syntax_tree//lib/syntax_tree/node.rb#4002
def initialize(constant:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4034
+ # source://syntax_tree//lib/syntax_tree/node.rb#4037
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4005
+ # source://syntax_tree//lib/syntax_tree/node.rb#4008
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4009
+ # source://syntax_tree//lib/syntax_tree/node.rb#4012
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3997
+ # source://syntax_tree//lib/syntax_tree/node.rb#4000
def comments; end
# [Const] the constant itself
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3994
+ # source://syntax_tree//lib/syntax_tree/node.rb#3997
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4013
+ # source://syntax_tree//lib/syntax_tree/node.rb#4016
def copy(constant: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4009
+ # source://syntax_tree//lib/syntax_tree/node.rb#4012
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4026
+ # source://syntax_tree//lib/syntax_tree/node.rb#4029
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4030
+ # source://syntax_tree//lib/syntax_tree/node.rb#4033
def format(q); end
end
@@ -2587,10 +2587,10 @@ end
# statements inside the conditional) then we can't use the modifier form
# and we must use the block form.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6229
+# source://syntax_tree//lib/syntax_tree/node.rb#6232
module SyntaxTree::ContainsAssignment
class << self
- # source://syntax_tree//lib/syntax_tree/node.rb#6230
+ # source://syntax_tree//lib/syntax_tree/node.rb#6233
def call(parent); end
end
end
@@ -2598,20 +2598,20 @@ end
# The default indentation level for formatting. We allow changing this so
# that Syntax Tree can format arbitrary parts of a document.
#
-# source://syntax_tree//lib/syntax_tree.rb#56
+# source://syntax_tree//lib/syntax_tree.rb#57
SyntaxTree::DEFAULT_INDENTATION = T.let(T.unsafe(nil), Integer)
# This is the default print width when formatting. It can be overridden in the
# CLI by passing the --print-width option or here in the API by passing the
# optional second argument to ::format.
#
-# source://syntax_tree//lib/syntax_tree.rb#48
+# source://syntax_tree//lib/syntax_tree.rb#49
SyntaxTree::DEFAULT_PRINT_WIDTH = T.let(T.unsafe(nil), Integer)
# This is the default ruby version that we're going to target for formatting.
# It shouldn't really be changed except in very niche circumstances.
#
-# source://syntax_tree//lib/syntax_tree.rb#52
+# source://syntax_tree//lib/syntax_tree.rb#53
SyntaxTree::DEFAULT_RUBY_VERSION = T.let(T.unsafe(nil), SyntaxTree::Formatter::SemanticVersion)
# This module provides shortcuts for creating AST nodes.
@@ -3369,47 +3369,273 @@ module SyntaxTree::DSL
def ZSuper; end
end
+# Provides the ability to index source files into a database, then query for
+# the nodes.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#6
+module SyntaxTree::Database; end
+
+# Query for the attributes of a node, optionally also filtering by type.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#99
+class SyntaxTree::Database::AttrQuery
+ # @return [AttrQuery] a new instance of AttrQuery
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#102
+ def initialize(type, attrs); end
+
+ # Returns the value of attribute attrs.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#100
+ def attrs; end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#107
+ def each(database, &block); end
+
+ # Returns the value of attribute type.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#100
+ def type; end
+end
+
+# source://syntax_tree//lib/syntax_tree/database.rb#276
+class SyntaxTree::Database::Connection
+ # @return [Connection] a new instance of Connection
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#279
+ def initialize(raw_connection); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#283
+ def execute(query, binds = T.unsafe(nil)); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#287
+ def index_file(filepath); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#292
+ def last_insert_row_id; end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#296
+ def prepare; end
+
+ # Returns the value of attribute raw_connection.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#277
+ def raw_connection; end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#326
+ def search(query); end
+end
+
+# source://syntax_tree//lib/syntax_tree/database.rb#7
+class SyntaxTree::Database::IndexingVisitor < ::SyntaxTree::FieldVisitor
+ # @return [IndexingVisitor] a new instance of IndexingVisitor
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#10
+ def initialize(database, filepath); end
+
+ # Returns the value of attribute database.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#8
+ def database; end
+
+ # Returns the value of attribute filepath.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#8
+ def filepath; end
+
+ # Returns the value of attribute node_id.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#8
+ def node_id; end
+
+ private
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#18
+ def comments(node); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#21
+ def field(name, value); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#31
+ def list(name, values); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#41
+ def node(node, _name); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#67
+ def pairs(name, values); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#64
+ def text(name, value); end
+end
+
+# Query for the results of either query.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#136
+class SyntaxTree::Database::OrQuery
+ # @return [OrQuery] a new instance of OrQuery
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#139
+ def initialize(left, right); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#144
+ def each(database, &block); end
+
+ # Returns the value of attribute left.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#137
+ def left; end
+
+ # Returns the value of attribute right.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#137
+ def right; end
+end
+
+# A pattern matching expression that will be compiled into a query.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#166
+class SyntaxTree::Database::Pattern
+ # @return [Pattern] a new instance of Pattern
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#172
+ def initialize(query); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#176
+ def compile; end
+
+ # Returns the value of attribute query.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#170
+ def query; end
+
+ private
+
+ # Shortcut for combining two queries into one that returns the results of
+ # if either query matches.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#195
+ def combine_or(left, right); end
+
+ # in foo | bar
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#200
+ def compile_binary(node); end
+
+ # in Ident
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#207
+ def compile_const(node); end
+
+ # in SyntaxTree::Ident
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#219
+ def compile_const_path_ref(node); end
+
+ # @raise [CompilationError]
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#189
+ def compile_error(node); end
+
+ # in Ident[value: String]
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#234
+ def compile_hshptn(node); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#258
+ def compile_node(node); end
+
+ # in Foo
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#248
+ def compile_var_ref(node); end
+end
+
+# source://syntax_tree//lib/syntax_tree/database.rb#167
+class SyntaxTree::Database::Pattern::CompilationError < ::StandardError; end
+
+# A lazy query result.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#151
+class SyntaxTree::Database::QueryResult
+ # @return [QueryResult] a new instance of QueryResult
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#154
+ def initialize(database, query); end
+
+ # Returns the value of attribute database.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#152
+ def database; end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#159
+ def each(&block); end
+
+ # Returns the value of attribute query.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#152
+ def query; end
+end
+
+# Query for a specific type of node.
+#
+# source://syntax_tree//lib/syntax_tree/database.rb#85
+class SyntaxTree::Database::TypeQuery
+ # @return [TypeQuery] a new instance of TypeQuery
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#88
+ def initialize(type); end
+
+ # source://syntax_tree//lib/syntax_tree/database.rb#92
+ def each(database, &block); end
+
+ # Returns the value of attribute type.
+ #
+ # source://syntax_tree//lib/syntax_tree/database.rb#86
+ def type; end
+end
+
# Def represents defining a regular method on the current self object.
#
# def method(param) result end
# def object.method(param) result end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4095
+# source://syntax_tree//lib/syntax_tree/node.rb#4098
class SyntaxTree::DefNode < ::SyntaxTree::Node
# @return [DefNode] a new instance of DefNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4114
+ # source://syntax_tree//lib/syntax_tree/node.rb#4117
def initialize(target:, operator:, name:, params:, bodystmt:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4214
+ # source://syntax_tree//lib/syntax_tree/node.rb#4217
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4124
+ # source://syntax_tree//lib/syntax_tree/node.rb#4127
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4227
+ # source://syntax_tree//lib/syntax_tree/node.rb#4230
def arity; end
# [BodyStmt | Node] the expressions to be executed by the method
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4109
+ # source://syntax_tree//lib/syntax_tree/node.rb#4112
def bodystmt; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4128
+ # source://syntax_tree//lib/syntax_tree/node.rb#4131
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4112
+ # source://syntax_tree//lib/syntax_tree/node.rb#4115
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4132
+ # source://syntax_tree//lib/syntax_tree/node.rb#4135
def copy(target: T.unsafe(nil), operator: T.unsafe(nil), name: T.unsafe(nil), params: T.unsafe(nil), bodystmt: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4128
+ # source://syntax_tree//lib/syntax_tree/node.rb#4131
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4156
+ # source://syntax_tree//lib/syntax_tree/node.rb#4159
def deconstruct_keys(_keys); end
# Returns true if the method was found in the source in the "endless" form,
@@ -3418,30 +3644,30 @@ class SyntaxTree::DefNode < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4223
+ # source://syntax_tree//lib/syntax_tree/node.rb#4226
def endless?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4168
+ # source://syntax_tree//lib/syntax_tree/node.rb#4171
def format(q); end
# [Backtick | Const | Ident | Kw | Op] the name of the method
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4103
+ # source://syntax_tree//lib/syntax_tree/node.rb#4106
def name; end
# [nil | Op | Period] the operator being used to declare the method
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4100
+ # source://syntax_tree//lib/syntax_tree/node.rb#4103
def operator; end
# [nil | Params | Paren] the parameter declaration for the method
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4106
+ # source://syntax_tree//lib/syntax_tree/node.rb#4109
def params; end
# [nil | Node] the target where the method is being defined
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4097
+ # source://syntax_tree//lib/syntax_tree/node.rb#4100
def target; end
end
@@ -3450,42 +3676,42 @@ end
#
# defined?(variable)
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4246
+# source://syntax_tree//lib/syntax_tree/node.rb#4249
class SyntaxTree::Defined < ::SyntaxTree::Node
# @return [Defined] a new instance of Defined
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4253
+ # source://syntax_tree//lib/syntax_tree/node.rb#4256
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4296
+ # source://syntax_tree//lib/syntax_tree/node.rb#4299
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4259
+ # source://syntax_tree//lib/syntax_tree/node.rb#4262
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4263
+ # source://syntax_tree//lib/syntax_tree/node.rb#4266
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4251
+ # source://syntax_tree//lib/syntax_tree/node.rb#4254
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4267
+ # source://syntax_tree//lib/syntax_tree/node.rb#4270
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4263
+ # source://syntax_tree//lib/syntax_tree/node.rb#4266
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4280
+ # source://syntax_tree//lib/syntax_tree/node.rb#4283
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4284
+ # source://syntax_tree//lib/syntax_tree/node.rb#4287
def format(q); end
# [Node] the value being sent to the keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4248
+ # source://syntax_tree//lib/syntax_tree/node.rb#4251
def value; end
end
@@ -3498,48 +3724,48 @@ end
#
# { "#{key}": value }
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4660
+# source://syntax_tree//lib/syntax_tree/node.rb#4663
class SyntaxTree::DynaSymbol < ::SyntaxTree::Node
# @return [DynaSymbol] a new instance of DynaSymbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4671
+ # source://syntax_tree//lib/syntax_tree/node.rb#4674
def initialize(parts:, quote:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4733
+ # source://syntax_tree//lib/syntax_tree/node.rb#4736
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4678
+ # source://syntax_tree//lib/syntax_tree/node.rb#4681
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4682
+ # source://syntax_tree//lib/syntax_tree/node.rb#4685
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4669
+ # source://syntax_tree//lib/syntax_tree/node.rb#4672
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4686
+ # source://syntax_tree//lib/syntax_tree/node.rb#4689
def copy(parts: T.unsafe(nil), quote: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4682
+ # source://syntax_tree//lib/syntax_tree/node.rb#4685
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4700
+ # source://syntax_tree//lib/syntax_tree/node.rb#4703
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4704
+ # source://syntax_tree//lib/syntax_tree/node.rb#4707
def format(q); end
# [Array[ StringDVar | StringEmbExpr | TStringContent ]] the parts of the
# dynamic symbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4663
+ # source://syntax_tree//lib/syntax_tree/node.rb#4666
def parts; end
# [nil | String] the quote used to delimit the dynamic symbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4666
+ # source://syntax_tree//lib/syntax_tree/node.rb#4669
def quote; end
private
@@ -3548,7 +3774,7 @@ class SyntaxTree::DynaSymbol < ::SyntaxTree::Node
# lot of rules because it could be in many different contexts with many
# different kinds of escaping.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4743
+ # source://syntax_tree//lib/syntax_tree/node.rb#4746
def quotes(q); end
end
@@ -3612,47 +3838,47 @@ end
# else
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4789
+# source://syntax_tree//lib/syntax_tree/node.rb#4792
class SyntaxTree::Else < ::SyntaxTree::Node
# @return [Else] a new instance of Else
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4799
+ # source://syntax_tree//lib/syntax_tree/node.rb#4802
def initialize(keyword:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4850
+ # source://syntax_tree//lib/syntax_tree/node.rb#4853
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4806
+ # source://syntax_tree//lib/syntax_tree/node.rb#4809
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4810
+ # source://syntax_tree//lib/syntax_tree/node.rb#4813
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4797
+ # source://syntax_tree//lib/syntax_tree/node.rb#4800
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4814
+ # source://syntax_tree//lib/syntax_tree/node.rb#4817
def copy(keyword: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4810
+ # source://syntax_tree//lib/syntax_tree/node.rb#4813
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4828
+ # source://syntax_tree//lib/syntax_tree/node.rb#4831
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4837
+ # source://syntax_tree//lib/syntax_tree/node.rb#4840
def format(q); end
# [Kw] the else keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4791
+ # source://syntax_tree//lib/syntax_tree/node.rb#4794
def keyword; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4794
+ # source://syntax_tree//lib/syntax_tree/node.rb#4797
def statements; end
end
@@ -3662,52 +3888,52 @@ end
# elsif other_variable
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4862
+# source://syntax_tree//lib/syntax_tree/node.rb#4865
class SyntaxTree::Elsif < ::SyntaxTree::Node
# @return [Elsif] a new instance of Elsif
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4875
+ # source://syntax_tree//lib/syntax_tree/node.rb#4878
def initialize(predicate:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4939
+ # source://syntax_tree//lib/syntax_tree/node.rb#4942
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4883
+ # source://syntax_tree//lib/syntax_tree/node.rb#4886
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4887
+ # source://syntax_tree//lib/syntax_tree/node.rb#4890
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4873
+ # source://syntax_tree//lib/syntax_tree/node.rb#4876
def comments; end
# [nil | Elsif | Else] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4870
+ # source://syntax_tree//lib/syntax_tree/node.rb#4873
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4891
+ # source://syntax_tree//lib/syntax_tree/node.rb#4894
def copy(predicate: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4887
+ # source://syntax_tree//lib/syntax_tree/node.rb#4890
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4906
+ # source://syntax_tree//lib/syntax_tree/node.rb#4909
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4916
+ # source://syntax_tree//lib/syntax_tree/node.rb#4919
def format(q); end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4864
+ # source://syntax_tree//lib/syntax_tree/node.rb#4867
def predicate; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4867
+ # source://syntax_tree//lib/syntax_tree/node.rb#4870
def statements; end
end
@@ -3718,66 +3944,66 @@ end
# second line
# =end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4952
+# source://syntax_tree//lib/syntax_tree/node.rb#4955
class SyntaxTree::EmbDoc < ::SyntaxTree::Node
# @return [EmbDoc] a new instance of EmbDoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4956
+ # source://syntax_tree//lib/syntax_tree/node.rb#4959
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5024
+ # source://syntax_tree//lib/syntax_tree/node.rb#5027
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4992
+ # source://syntax_tree//lib/syntax_tree/node.rb#4995
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4996
+ # source://syntax_tree//lib/syntax_tree/node.rb#4999
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4988
+ # source://syntax_tree//lib/syntax_tree/node.rb#4991
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5000
+ # source://syntax_tree//lib/syntax_tree/node.rb#5003
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4996
+ # source://syntax_tree//lib/syntax_tree/node.rb#4999
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5009
+ # source://syntax_tree//lib/syntax_tree/node.rb#5012
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5013
+ # source://syntax_tree//lib/syntax_tree/node.rb#5016
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4984
+ # source://syntax_tree//lib/syntax_tree/node.rb#4987
def ignore?; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4980
+ # source://syntax_tree//lib/syntax_tree/node.rb#4983
def inline?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4964
+ # source://syntax_tree//lib/syntax_tree/node.rb#4967
def leading!; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4968
+ # source://syntax_tree//lib/syntax_tree/node.rb#4971
def leading?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4972
+ # source://syntax_tree//lib/syntax_tree/node.rb#4975
def trailing!; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4976
+ # source://syntax_tree//lib/syntax_tree/node.rb#4979
def trailing?; end
# [String] the contents of the comment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4954
+ # source://syntax_tree//lib/syntax_tree/node.rb#4957
def value; end
end
@@ -3787,34 +4013,34 @@ end
#
# "Hello, #{person}!"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5035
+# source://syntax_tree//lib/syntax_tree/node.rb#5038
class SyntaxTree::EmbExprBeg < ::SyntaxTree::Node
# @return [EmbExprBeg] a new instance of EmbExprBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5039
+ # source://syntax_tree//lib/syntax_tree/node.rb#5042
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5065
+ # source://syntax_tree//lib/syntax_tree/node.rb#5068
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5044
+ # source://syntax_tree//lib/syntax_tree/node.rb#5047
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5048
+ # source://syntax_tree//lib/syntax_tree/node.rb#5051
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5052
+ # source://syntax_tree//lib/syntax_tree/node.rb#5055
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5048
+ # source://syntax_tree//lib/syntax_tree/node.rb#5051
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5061
+ # source://syntax_tree//lib/syntax_tree/node.rb#5064
def deconstruct_keys(_keys); end
# [String] the #{ used in the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5037
+ # source://syntax_tree//lib/syntax_tree/node.rb#5040
def value; end
end
@@ -3824,34 +4050,34 @@ end
#
# "Hello, #{person}!"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5076
+# source://syntax_tree//lib/syntax_tree/node.rb#5079
class SyntaxTree::EmbExprEnd < ::SyntaxTree::Node
# @return [EmbExprEnd] a new instance of EmbExprEnd
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5080
+ # source://syntax_tree//lib/syntax_tree/node.rb#5083
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5106
+ # source://syntax_tree//lib/syntax_tree/node.rb#5109
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5085
+ # source://syntax_tree//lib/syntax_tree/node.rb#5088
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5089
+ # source://syntax_tree//lib/syntax_tree/node.rb#5092
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5093
+ # source://syntax_tree//lib/syntax_tree/node.rb#5096
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5089
+ # source://syntax_tree//lib/syntax_tree/node.rb#5092
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5102
+ # source://syntax_tree//lib/syntax_tree/node.rb#5105
def deconstruct_keys(_keys); end
# [String] the } used in the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5078
+ # source://syntax_tree//lib/syntax_tree/node.rb#5081
def value; end
end
@@ -3863,34 +4089,34 @@ end
#
# In the example above, an EmbVar node represents the # because it forces
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5119
+# source://syntax_tree//lib/syntax_tree/node.rb#5122
class SyntaxTree::EmbVar < ::SyntaxTree::Node
# @return [EmbVar] a new instance of EmbVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5123
+ # source://syntax_tree//lib/syntax_tree/node.rb#5126
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5149
+ # source://syntax_tree//lib/syntax_tree/node.rb#5152
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5128
+ # source://syntax_tree//lib/syntax_tree/node.rb#5131
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5132
+ # source://syntax_tree//lib/syntax_tree/node.rb#5135
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5136
+ # source://syntax_tree//lib/syntax_tree/node.rb#5139
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5132
+ # source://syntax_tree//lib/syntax_tree/node.rb#5135
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5145
+ # source://syntax_tree//lib/syntax_tree/node.rb#5148
def deconstruct_keys(_keys); end
# [String] the # used in the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5121
+ # source://syntax_tree//lib/syntax_tree/node.rb#5124
def value; end
end
@@ -3949,47 +4175,47 @@ end
# ensure
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5161
+# source://syntax_tree//lib/syntax_tree/node.rb#5164
class SyntaxTree::Ensure < ::SyntaxTree::Node
# @return [Ensure] a new instance of Ensure
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5171
+ # source://syntax_tree//lib/syntax_tree/node.rb#5174
def initialize(keyword:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5220
+ # source://syntax_tree//lib/syntax_tree/node.rb#5223
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5178
+ # source://syntax_tree//lib/syntax_tree/node.rb#5181
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5182
+ # source://syntax_tree//lib/syntax_tree/node.rb#5185
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5169
+ # source://syntax_tree//lib/syntax_tree/node.rb#5172
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5186
+ # source://syntax_tree//lib/syntax_tree/node.rb#5189
def copy(keyword: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5182
+ # source://syntax_tree//lib/syntax_tree/node.rb#5185
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5200
+ # source://syntax_tree//lib/syntax_tree/node.rb#5203
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5209
+ # source://syntax_tree//lib/syntax_tree/node.rb#5212
def format(q); end
# [Kw] the ensure keyword that began this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5163
+ # source://syntax_tree//lib/syntax_tree/node.rb#5166
def keyword; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5166
+ # source://syntax_tree//lib/syntax_tree/node.rb#5169
def statements; end
end
@@ -4004,42 +4230,42 @@ end
# position typically represents a rest-type parameter, but in this case is
# used to indicate that a trailing comma was used.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5236
+# source://syntax_tree//lib/syntax_tree/node.rb#5239
class SyntaxTree::ExcessedComma < ::SyntaxTree::Node
# @return [ExcessedComma] a new instance of ExcessedComma
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5243
+ # source://syntax_tree//lib/syntax_tree/node.rb#5246
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5278
+ # source://syntax_tree//lib/syntax_tree/node.rb#5281
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5249
+ # source://syntax_tree//lib/syntax_tree/node.rb#5252
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5253
+ # source://syntax_tree//lib/syntax_tree/node.rb#5256
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5241
+ # source://syntax_tree//lib/syntax_tree/node.rb#5244
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5257
+ # source://syntax_tree//lib/syntax_tree/node.rb#5260
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5253
+ # source://syntax_tree//lib/syntax_tree/node.rb#5256
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5270
+ # source://syntax_tree//lib/syntax_tree/node.rb#5273
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5274
+ # source://syntax_tree//lib/syntax_tree/node.rb#5277
def format(q); end
# [String] the comma
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5238
+ # source://syntax_tree//lib/syntax_tree/node.rb#5241
def value; end
end
@@ -4048,52 +4274,52 @@ end
#
# object.variable = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5288
+# source://syntax_tree//lib/syntax_tree/node.rb#5291
class SyntaxTree::Field < ::SyntaxTree::Node
# @return [Field] a new instance of Field
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5301
+ # source://syntax_tree//lib/syntax_tree/node.rb#5304
def initialize(parent:, operator:, name:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5351
+ # source://syntax_tree//lib/syntax_tree/node.rb#5354
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5309
+ # source://syntax_tree//lib/syntax_tree/node.rb#5312
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5313
+ # source://syntax_tree//lib/syntax_tree/node.rb#5316
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5299
+ # source://syntax_tree//lib/syntax_tree/node.rb#5302
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5318
+ # source://syntax_tree//lib/syntax_tree/node.rb#5321
def copy(parent: T.unsafe(nil), operator: T.unsafe(nil), name: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5313
+ # source://syntax_tree//lib/syntax_tree/node.rb#5316
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5333
+ # source://syntax_tree//lib/syntax_tree/node.rb#5336
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5343
+ # source://syntax_tree//lib/syntax_tree/node.rb#5346
def format(q); end
# [Const | Ident] the name of the field being assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5296
+ # source://syntax_tree//lib/syntax_tree/node.rb#5299
def name; end
# [:"::" | Op | Period] the operator being used for the assignment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5293
+ # source://syntax_tree//lib/syntax_tree/node.rb#5296
def operator; end
# [Node] the parent object that owns the field being assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5290
+ # source://syntax_tree//lib/syntax_tree/node.rb#5293
def parent; end
end
@@ -4605,42 +4831,42 @@ end
#
# 1.0
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5361
+# source://syntax_tree//lib/syntax_tree/node.rb#5364
class SyntaxTree::FloatLiteral < ::SyntaxTree::Node
# @return [FloatLiteral] a new instance of FloatLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5368
+ # source://syntax_tree//lib/syntax_tree/node.rb#5371
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5403
+ # source://syntax_tree//lib/syntax_tree/node.rb#5406
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5374
+ # source://syntax_tree//lib/syntax_tree/node.rb#5377
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5378
+ # source://syntax_tree//lib/syntax_tree/node.rb#5381
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5366
+ # source://syntax_tree//lib/syntax_tree/node.rb#5369
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5382
+ # source://syntax_tree//lib/syntax_tree/node.rb#5385
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5378
+ # source://syntax_tree//lib/syntax_tree/node.rb#5381
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5395
+ # source://syntax_tree//lib/syntax_tree/node.rb#5398
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5399
+ # source://syntax_tree//lib/syntax_tree/node.rb#5402
def format(q); end
# [String] the value of the floating point number literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5363
+ # source://syntax_tree//lib/syntax_tree/node.rb#5366
def value; end
end
@@ -4687,58 +4913,58 @@ end
# in [*, 7, *]
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5415
+# source://syntax_tree//lib/syntax_tree/node.rb#5418
class SyntaxTree::FndPtn < ::SyntaxTree::Node
# @return [FndPtn] a new instance of FndPtn
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5432
+ # source://syntax_tree//lib/syntax_tree/node.rb#5435
def initialize(constant:, left:, values:, right:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5501
+ # source://syntax_tree//lib/syntax_tree/node.rb#5504
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5441
+ # source://syntax_tree//lib/syntax_tree/node.rb#5444
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5445
+ # source://syntax_tree//lib/syntax_tree/node.rb#5448
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5430
+ # source://syntax_tree//lib/syntax_tree/node.rb#5433
def comments; end
- # [nil | Node] the optional constant wrapper
+ # [nil | VarRef | ConstPathRef] the optional constant wrapper
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5417
+ # source://syntax_tree//lib/syntax_tree/node.rb#5420
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5449
+ # source://syntax_tree//lib/syntax_tree/node.rb#5452
def copy(constant: T.unsafe(nil), left: T.unsafe(nil), values: T.unsafe(nil), right: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5445
+ # source://syntax_tree//lib/syntax_tree/node.rb#5448
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5465
+ # source://syntax_tree//lib/syntax_tree/node.rb#5468
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5476
+ # source://syntax_tree//lib/syntax_tree/node.rb#5479
def format(q); end
# [VarField] the splat on the left-hand side
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5420
+ # source://syntax_tree//lib/syntax_tree/node.rb#5423
def left; end
# [VarField] the splat on the right-hand side
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5427
+ # source://syntax_tree//lib/syntax_tree/node.rb#5430
def right; end
# [Array[ Node ]] the list of positional expressions in the pattern that
# are being matched
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5424
+ # source://syntax_tree//lib/syntax_tree/node.rb#5427
def values; end
end
@@ -4747,53 +4973,53 @@ end
# for value in list do
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5513
+# source://syntax_tree//lib/syntax_tree/node.rb#5516
class SyntaxTree::For < ::SyntaxTree::Node
# @return [For] a new instance of For
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5527
+ # source://syntax_tree//lib/syntax_tree/node.rb#5530
def initialize(index:, collection:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5587
+ # source://syntax_tree//lib/syntax_tree/node.rb#5590
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5535
+ # source://syntax_tree//lib/syntax_tree/node.rb#5538
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5539
+ # source://syntax_tree//lib/syntax_tree/node.rb#5542
def child_nodes; end
# [Node] the object being enumerated in the loop
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5519
+ # source://syntax_tree//lib/syntax_tree/node.rb#5522
def collection; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5525
+ # source://syntax_tree//lib/syntax_tree/node.rb#5528
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5543
+ # source://syntax_tree//lib/syntax_tree/node.rb#5546
def copy(index: T.unsafe(nil), collection: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5539
+ # source://syntax_tree//lib/syntax_tree/node.rb#5542
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5558
+ # source://syntax_tree//lib/syntax_tree/node.rb#5561
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5568
+ # source://syntax_tree//lib/syntax_tree/node.rb#5571
def format(q); end
# [MLHS | VarField] the variable declaration being used to
# pull values out of the object being enumerated
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5516
+ # source://syntax_tree//lib/syntax_tree/node.rb#5519
def index; end
# [Statements] the statements to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5522
+ # source://syntax_tree//lib/syntax_tree/node.rb#5525
def statements; end
end
@@ -4950,49 +5176,49 @@ end
#
# $variable
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5597
+# source://syntax_tree//lib/syntax_tree/node.rb#5600
class SyntaxTree::GVar < ::SyntaxTree::Node
# @return [GVar] a new instance of GVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5604
+ # source://syntax_tree//lib/syntax_tree/node.rb#5607
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5639
+ # source://syntax_tree//lib/syntax_tree/node.rb#5642
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5610
+ # source://syntax_tree//lib/syntax_tree/node.rb#5613
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5614
+ # source://syntax_tree//lib/syntax_tree/node.rb#5617
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5602
+ # source://syntax_tree//lib/syntax_tree/node.rb#5605
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5618
+ # source://syntax_tree//lib/syntax_tree/node.rb#5621
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5614
+ # source://syntax_tree//lib/syntax_tree/node.rb#5617
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5631
+ # source://syntax_tree//lib/syntax_tree/node.rb#5634
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5635
+ # source://syntax_tree//lib/syntax_tree/node.rb#5638
def format(q); end
# [String] the name of the global variable
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5599
+ # source://syntax_tree//lib/syntax_tree/node.rb#5602
def value; end
end
# This holds references to objects that respond to both #parse and #format
# so that we can use them in the CLI.
#
-# source://syntax_tree//lib/syntax_tree.rb#42
+# source://syntax_tree//lib/syntax_tree.rb#43
SyntaxTree::HANDLERS = T.let(T.unsafe(nil), Hash)
# This module is responsible for formatting the assocs contained within a
@@ -5040,50 +5266,50 @@ end
#
# { key => value }
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5648
+# source://syntax_tree//lib/syntax_tree/node.rb#5651
class SyntaxTree::HashLiteral < ::SyntaxTree::Node
# @return [HashLiteral] a new instance of HashLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5684
+ # source://syntax_tree//lib/syntax_tree/node.rb#5687
def initialize(lbrace:, assocs:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5725
+ # source://syntax_tree//lib/syntax_tree/node.rb#5728
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5691
+ # source://syntax_tree//lib/syntax_tree/node.rb#5694
def accept(visitor); end
# [Array[ Assoc | AssocSplat ]] the optional contents of the hash
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5679
+ # source://syntax_tree//lib/syntax_tree/node.rb#5682
def assocs; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5695
+ # source://syntax_tree//lib/syntax_tree/node.rb#5698
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5682
+ # source://syntax_tree//lib/syntax_tree/node.rb#5685
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5699
+ # source://syntax_tree//lib/syntax_tree/node.rb#5702
def copy(lbrace: T.unsafe(nil), assocs: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5695
+ # source://syntax_tree//lib/syntax_tree/node.rb#5698
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5713
+ # source://syntax_tree//lib/syntax_tree/node.rb#5716
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5717
+ # source://syntax_tree//lib/syntax_tree/node.rb#5720
def format(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5730
+ # source://syntax_tree//lib/syntax_tree/node.rb#5733
def format_key(q, key); end
# [LBrace] the left brace that opens this hash
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5676
+ # source://syntax_tree//lib/syntax_tree/node.rb#5679
def lbrace; end
private
@@ -5093,10 +5319,10 @@ class SyntaxTree::HashLiteral < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5738
+ # source://syntax_tree//lib/syntax_tree/node.rb#5741
def empty_with_comments?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5742
+ # source://syntax_tree//lib/syntax_tree/node.rb#5745
def format_contents(q); end
end
@@ -5104,19 +5330,19 @@ end
# but _does_ contain comments. In this case we do some special formatting to
# make sure the comments gets indented properly.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5652
+# source://syntax_tree//lib/syntax_tree/node.rb#5655
class SyntaxTree::HashLiteral::EmptyWithCommentsFormatter
# @return [EmptyWithCommentsFormatter] a new instance of EmptyWithCommentsFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5656
+ # source://syntax_tree//lib/syntax_tree/node.rb#5659
def initialize(lbrace); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5660
+ # source://syntax_tree//lib/syntax_tree/node.rb#5663
def format(q); end
# [LBrace] the opening brace
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5654
+ # source://syntax_tree//lib/syntax_tree/node.rb#5657
def lbrace; end
end
@@ -5126,65 +5352,65 @@ end
# contents
# DOC
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5771
+# source://syntax_tree//lib/syntax_tree/node.rb#5774
class SyntaxTree::Heredoc < ::SyntaxTree::Node
# @return [Heredoc] a new instance of Heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5788
+ # source://syntax_tree//lib/syntax_tree/node.rb#5791
def initialize(beginning:, location:, ending: T.unsafe(nil), dedent: T.unsafe(nil), parts: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5870
+ # source://syntax_tree//lib/syntax_tree/node.rb#5873
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5797
+ # source://syntax_tree//lib/syntax_tree/node.rb#5800
def accept(visitor); end
# [HeredocBeg] the opening of the heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5773
+ # source://syntax_tree//lib/syntax_tree/node.rb#5776
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5801
+ # source://syntax_tree//lib/syntax_tree/node.rb#5804
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5786
+ # source://syntax_tree//lib/syntax_tree/node.rb#5789
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5805
+ # source://syntax_tree//lib/syntax_tree/node.rb#5808
def copy(beginning: T.unsafe(nil), location: T.unsafe(nil), ending: T.unsafe(nil), parts: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5801
+ # source://syntax_tree//lib/syntax_tree/node.rb#5804
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5820
+ # source://syntax_tree//lib/syntax_tree/node.rb#5823
def deconstruct_keys(_keys); end
# [Integer] how far to dedent the heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5779
+ # source://syntax_tree//lib/syntax_tree/node.rb#5782
def dedent; end
# [HeredocEnd] the ending of the heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5776
+ # source://syntax_tree//lib/syntax_tree/node.rb#5779
def ending; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5835
+ # source://syntax_tree//lib/syntax_tree/node.rb#5838
def format(q); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# heredoc string literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5783
+ # source://syntax_tree//lib/syntax_tree/node.rb#5786
def parts; end
end
# This is a very specific behavior where you want to force a newline, but
# don't want to force the break parent.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5832
+# source://syntax_tree//lib/syntax_tree/node.rb#5835
SyntaxTree::Heredoc::SEPARATOR = T.let(T.unsafe(nil), PrettierPrint::Breakable)
# HeredocBeg represents the beginning declaration of a heredoc.
@@ -5195,42 +5421,42 @@ SyntaxTree::Heredoc::SEPARATOR = T.let(T.unsafe(nil), PrettierPrint::Breakable)
#
# In the example above the HeredocBeg node represents <<~DOC.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5883
+# source://syntax_tree//lib/syntax_tree/node.rb#5886
class SyntaxTree::HeredocBeg < ::SyntaxTree::Node
# @return [HeredocBeg] a new instance of HeredocBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5890
+ # source://syntax_tree//lib/syntax_tree/node.rb#5893
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5925
+ # source://syntax_tree//lib/syntax_tree/node.rb#5928
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5896
+ # source://syntax_tree//lib/syntax_tree/node.rb#5899
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5900
+ # source://syntax_tree//lib/syntax_tree/node.rb#5903
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5888
+ # source://syntax_tree//lib/syntax_tree/node.rb#5891
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5904
+ # source://syntax_tree//lib/syntax_tree/node.rb#5907
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5900
+ # source://syntax_tree//lib/syntax_tree/node.rb#5903
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5917
+ # source://syntax_tree//lib/syntax_tree/node.rb#5920
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5921
+ # source://syntax_tree//lib/syntax_tree/node.rb#5924
def format(q); end
# [String] the opening declaration of the heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5885
+ # source://syntax_tree//lib/syntax_tree/node.rb#5888
def value; end
end
@@ -5242,42 +5468,42 @@ end
#
# In the example above the HeredocEnd node represents the closing DOC.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5937
+# source://syntax_tree//lib/syntax_tree/node.rb#5940
class SyntaxTree::HeredocEnd < ::SyntaxTree::Node
# @return [HeredocEnd] a new instance of HeredocEnd
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5944
+ # source://syntax_tree//lib/syntax_tree/node.rb#5947
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5979
+ # source://syntax_tree//lib/syntax_tree/node.rb#5982
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5950
+ # source://syntax_tree//lib/syntax_tree/node.rb#5953
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5954
+ # source://syntax_tree//lib/syntax_tree/node.rb#5957
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5942
+ # source://syntax_tree//lib/syntax_tree/node.rb#5945
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5958
+ # source://syntax_tree//lib/syntax_tree/node.rb#5961
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5954
+ # source://syntax_tree//lib/syntax_tree/node.rb#5957
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#5971
+ # source://syntax_tree//lib/syntax_tree/node.rb#5974
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#5975
+ # source://syntax_tree//lib/syntax_tree/node.rb#5978
def format(q); end
# [String] the closing declaration of the heredoc
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5939
+ # source://syntax_tree//lib/syntax_tree/node.rb#5942
def value; end
end
@@ -5288,105 +5514,105 @@ end
# in { key: }
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5991
+# source://syntax_tree//lib/syntax_tree/node.rb#5994
class SyntaxTree::HshPtn < ::SyntaxTree::Node
# @return [HshPtn] a new instance of HshPtn
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6051
+ # source://syntax_tree//lib/syntax_tree/node.rb#6054
def initialize(constant:, keywords:, keyword_rest:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6144
+ # source://syntax_tree//lib/syntax_tree/node.rb#6147
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6059
+ # source://syntax_tree//lib/syntax_tree/node.rb#6062
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6063
+ # source://syntax_tree//lib/syntax_tree/node.rb#6066
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6049
+ # source://syntax_tree//lib/syntax_tree/node.rb#6052
def comments; end
- # [nil | Node] the optional constant wrapper
+ # [nil | VarRef | ConstPathRef] the optional constant wrapper
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6039
+ # source://syntax_tree//lib/syntax_tree/node.rb#6042
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6067
+ # source://syntax_tree//lib/syntax_tree/node.rb#6070
def copy(constant: T.unsafe(nil), keywords: T.unsafe(nil), keyword_rest: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6063
+ # source://syntax_tree//lib/syntax_tree/node.rb#6066
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6082
+ # source://syntax_tree//lib/syntax_tree/node.rb#6085
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6092
+ # source://syntax_tree//lib/syntax_tree/node.rb#6095
def format(q); end
# [nil | VarField] an optional parameter to gather up all remaining keywords
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6046
+ # source://syntax_tree//lib/syntax_tree/node.rb#6049
def keyword_rest; end
# [Array[ [DynaSymbol | Label, nil | Node] ]] the set of tuples
# representing the keywords that should be matched against in the pattern
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6043
+ # source://syntax_tree//lib/syntax_tree/node.rb#6046
def keywords; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#6155
+ # source://syntax_tree//lib/syntax_tree/node.rb#6158
def format_contents(q, parts, nested); end
end
# Formats a key-value pair in a hash pattern. The value is optional.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#5993
+# source://syntax_tree//lib/syntax_tree/node.rb#5996
class SyntaxTree::HshPtn::KeywordFormatter
# @return [KeywordFormatter] a new instance of KeywordFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6000
+ # source://syntax_tree//lib/syntax_tree/node.rb#6003
def initialize(key, value); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6005
+ # source://syntax_tree//lib/syntax_tree/node.rb#6008
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6009
+ # source://syntax_tree//lib/syntax_tree/node.rb#6012
def format(q); end
# [Label] the keyword being used
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5995
+ # source://syntax_tree//lib/syntax_tree/node.rb#5998
def key; end
# [Node] the optional value for the keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#5998
+ # source://syntax_tree//lib/syntax_tree/node.rb#6001
def value; end
end
# Formats the optional double-splat from the pattern.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6020
+# source://syntax_tree//lib/syntax_tree/node.rb#6023
class SyntaxTree::HshPtn::KeywordRestFormatter
# @return [KeywordRestFormatter] a new instance of KeywordRestFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6024
+ # source://syntax_tree//lib/syntax_tree/node.rb#6027
def initialize(keyword_rest); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6028
+ # source://syntax_tree//lib/syntax_tree/node.rb#6031
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6032
+ # source://syntax_tree//lib/syntax_tree/node.rb#6035
def format(q); end
# [VarField] the parameter that matches the remaining keywords
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6022
+ # source://syntax_tree//lib/syntax_tree/node.rb#6025
def keyword_rest; end
end
@@ -5394,42 +5620,42 @@ end
#
# @variable
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6875
+# source://syntax_tree//lib/syntax_tree/node.rb#6878
class SyntaxTree::IVar < ::SyntaxTree::Node
# @return [IVar] a new instance of IVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6882
+ # source://syntax_tree//lib/syntax_tree/node.rb#6885
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6917
+ # source://syntax_tree//lib/syntax_tree/node.rb#6920
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6888
+ # source://syntax_tree//lib/syntax_tree/node.rb#6891
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6892
+ # source://syntax_tree//lib/syntax_tree/node.rb#6895
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6880
+ # source://syntax_tree//lib/syntax_tree/node.rb#6883
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6896
+ # source://syntax_tree//lib/syntax_tree/node.rb#6899
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6892
+ # source://syntax_tree//lib/syntax_tree/node.rb#6895
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6909
+ # source://syntax_tree//lib/syntax_tree/node.rb#6912
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6913
+ # source://syntax_tree//lib/syntax_tree/node.rb#6916
def format(q); end
# [String] the name of the instance variable
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6877
+ # source://syntax_tree//lib/syntax_tree/node.rb#6880
def value; end
end
@@ -5438,42 +5664,42 @@ end
#
# value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6178
+# source://syntax_tree//lib/syntax_tree/node.rb#6181
class SyntaxTree::Ident < ::SyntaxTree::Node
# @return [Ident] a new instance of Ident
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6185
+ # source://syntax_tree//lib/syntax_tree/node.rb#6188
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6220
+ # source://syntax_tree//lib/syntax_tree/node.rb#6223
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6191
+ # source://syntax_tree//lib/syntax_tree/node.rb#6194
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6195
+ # source://syntax_tree//lib/syntax_tree/node.rb#6198
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6183
+ # source://syntax_tree//lib/syntax_tree/node.rb#6186
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6199
+ # source://syntax_tree//lib/syntax_tree/node.rb#6202
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6195
+ # source://syntax_tree//lib/syntax_tree/node.rb#6198
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6212
+ # source://syntax_tree//lib/syntax_tree/node.rb#6215
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6216
+ # source://syntax_tree//lib/syntax_tree/node.rb#6219
def format(q); end
# [String] the value of the identifier
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6180
+ # source://syntax_tree//lib/syntax_tree/node.rb#6183
def value; end
end
@@ -5482,59 +5708,59 @@ end
# if predicate
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6468
+# source://syntax_tree//lib/syntax_tree/node.rb#6471
class SyntaxTree::IfNode < ::SyntaxTree::Node
# @return [IfNode] a new instance of IfNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6481
+ # source://syntax_tree//lib/syntax_tree/node.rb#6484
def initialize(predicate:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6526
+ # source://syntax_tree//lib/syntax_tree/node.rb#6529
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6489
+ # source://syntax_tree//lib/syntax_tree/node.rb#6492
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6493
+ # source://syntax_tree//lib/syntax_tree/node.rb#6496
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6479
+ # source://syntax_tree//lib/syntax_tree/node.rb#6482
def comments; end
# [nil | Elsif | Else] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6476
+ # source://syntax_tree//lib/syntax_tree/node.rb#6479
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6497
+ # source://syntax_tree//lib/syntax_tree/node.rb#6500
def copy(predicate: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6493
+ # source://syntax_tree//lib/syntax_tree/node.rb#6496
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6512
+ # source://syntax_tree//lib/syntax_tree/node.rb#6515
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6522
+ # source://syntax_tree//lib/syntax_tree/node.rb#6525
def format(q); end
# Checks if the node was originally found in the modifier form.
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6532
+ # source://syntax_tree//lib/syntax_tree/node.rb#6535
def modifier?; end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6470
+ # source://syntax_tree//lib/syntax_tree/node.rb#6473
def predicate; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6473
+ # source://syntax_tree//lib/syntax_tree/node.rb#6476
def statements; end
end
@@ -5542,60 +5768,60 @@ end
#
# predicate ? truthy : falsy
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6541
+# source://syntax_tree//lib/syntax_tree/node.rb#6544
class SyntaxTree::IfOp < ::SyntaxTree::Node
# @return [IfOp] a new instance of IfOp
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6554
+ # source://syntax_tree//lib/syntax_tree/node.rb#6557
def initialize(predicate:, truthy:, falsy:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6628
+ # source://syntax_tree//lib/syntax_tree/node.rb#6631
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6562
+ # source://syntax_tree//lib/syntax_tree/node.rb#6565
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6566
+ # source://syntax_tree//lib/syntax_tree/node.rb#6569
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6552
+ # source://syntax_tree//lib/syntax_tree/node.rb#6555
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6570
+ # source://syntax_tree//lib/syntax_tree/node.rb#6573
def copy(predicate: T.unsafe(nil), truthy: T.unsafe(nil), falsy: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6566
+ # source://syntax_tree//lib/syntax_tree/node.rb#6569
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6585
+ # source://syntax_tree//lib/syntax_tree/node.rb#6588
def deconstruct_keys(_keys); end
# [Node] the expression to be executed if the predicate is falsy
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6549
+ # source://syntax_tree//lib/syntax_tree/node.rb#6552
def falsy; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6595
+ # source://syntax_tree//lib/syntax_tree/node.rb#6598
def format(q); end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6543
+ # source://syntax_tree//lib/syntax_tree/node.rb#6546
def predicate; end
# [Node] the expression to be executed if the predicate is truthy
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6546
+ # source://syntax_tree//lib/syntax_tree/node.rb#6549
def truthy; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#6635
+ # source://syntax_tree//lib/syntax_tree/node.rb#6638
def format_break(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6658
+ # source://syntax_tree//lib/syntax_tree/node.rb#6661
def format_flat(q); end
end
@@ -5603,42 +5829,42 @@ end
#
# 1i
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6677
+# source://syntax_tree//lib/syntax_tree/node.rb#6680
class SyntaxTree::Imaginary < ::SyntaxTree::Node
# @return [Imaginary] a new instance of Imaginary
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6684
+ # source://syntax_tree//lib/syntax_tree/node.rb#6687
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6719
+ # source://syntax_tree//lib/syntax_tree/node.rb#6722
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6690
+ # source://syntax_tree//lib/syntax_tree/node.rb#6693
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6694
+ # source://syntax_tree//lib/syntax_tree/node.rb#6697
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6682
+ # source://syntax_tree//lib/syntax_tree/node.rb#6685
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6698
+ # source://syntax_tree//lib/syntax_tree/node.rb#6701
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6694
+ # source://syntax_tree//lib/syntax_tree/node.rb#6697
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6711
+ # source://syntax_tree//lib/syntax_tree/node.rb#6714
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6715
+ # source://syntax_tree//lib/syntax_tree/node.rb#6718
def format(q); end
# [String] the value of the imaginary number literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6679
+ # source://syntax_tree//lib/syntax_tree/node.rb#6682
def value; end
end
@@ -5649,52 +5875,52 @@ end
# in pattern
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6731
+# source://syntax_tree//lib/syntax_tree/node.rb#6734
class SyntaxTree::In < ::SyntaxTree::Node
# @return [In] a new instance of In
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6744
+ # source://syntax_tree//lib/syntax_tree/node.rb#6747
def initialize(pattern:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6809
+ # source://syntax_tree//lib/syntax_tree/node.rb#6812
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6752
+ # source://syntax_tree//lib/syntax_tree/node.rb#6755
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6756
+ # source://syntax_tree//lib/syntax_tree/node.rb#6759
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6742
+ # source://syntax_tree//lib/syntax_tree/node.rb#6745
def comments; end
# [nil | In | Else] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6739
+ # source://syntax_tree//lib/syntax_tree/node.rb#6742
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6760
+ # source://syntax_tree//lib/syntax_tree/node.rb#6763
def copy(pattern: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6756
+ # source://syntax_tree//lib/syntax_tree/node.rb#6759
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6775
+ # source://syntax_tree//lib/syntax_tree/node.rb#6778
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6785
+ # source://syntax_tree//lib/syntax_tree/node.rb#6788
def format(q); end
# [Node] the pattern to check against
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6733
+ # source://syntax_tree//lib/syntax_tree/node.rb#6736
def pattern; end
# [Statements] the expressions to execute if the pattern matched
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6736
+ # source://syntax_tree//lib/syntax_tree/node.rb#6739
def statements; end
end
@@ -6159,42 +6385,42 @@ end
#
# 1
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6819
+# source://syntax_tree//lib/syntax_tree/node.rb#6822
class SyntaxTree::Int < ::SyntaxTree::Node
# @return [Int] a new instance of Int
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6826
+ # source://syntax_tree//lib/syntax_tree/node.rb#6829
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6866
+ # source://syntax_tree//lib/syntax_tree/node.rb#6869
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6832
+ # source://syntax_tree//lib/syntax_tree/node.rb#6835
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6836
+ # source://syntax_tree//lib/syntax_tree/node.rb#6839
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6824
+ # source://syntax_tree//lib/syntax_tree/node.rb#6827
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6840
+ # source://syntax_tree//lib/syntax_tree/node.rb#6843
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6836
+ # source://syntax_tree//lib/syntax_tree/node.rb#6839
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6850
+ # source://syntax_tree//lib/syntax_tree/node.rb#6853
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6854
+ # source://syntax_tree//lib/syntax_tree/node.rb#6857
def format(q); end
# [String] the value of the integer
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6821
+ # source://syntax_tree//lib/syntax_tree/node.rb#6824
def value; end
end
@@ -6251,47 +6477,47 @@ end
#
# then the contents of the symbol node will contain a Kw node.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6935
+# source://syntax_tree//lib/syntax_tree/node.rb#6938
class SyntaxTree::Kw < ::SyntaxTree::Node
# @return [Kw] a new instance of Kw
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6945
+ # source://syntax_tree//lib/syntax_tree/node.rb#6948
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6978
+ # source://syntax_tree//lib/syntax_tree/node.rb#6981
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6952
+ # source://syntax_tree//lib/syntax_tree/node.rb#6955
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6956
+ # source://syntax_tree//lib/syntax_tree/node.rb#6959
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6943
+ # source://syntax_tree//lib/syntax_tree/node.rb#6946
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6960
+ # source://syntax_tree//lib/syntax_tree/node.rb#6963
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6956
+ # source://syntax_tree//lib/syntax_tree/node.rb#6959
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#6970
+ # source://syntax_tree//lib/syntax_tree/node.rb#6973
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#6974
+ # source://syntax_tree//lib/syntax_tree/node.rb#6977
def format(q); end
# [Symbol] the symbol version of the value
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6940
+ # source://syntax_tree//lib/syntax_tree/node.rb#6943
def name; end
# [String] the value of the keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6937
+ # source://syntax_tree//lib/syntax_tree/node.rb#6940
def value; end
end
@@ -6300,83 +6526,83 @@ end
#
# def method(**kwargs) end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6988
+# source://syntax_tree//lib/syntax_tree/node.rb#6991
class SyntaxTree::KwRestParam < ::SyntaxTree::Node
# @return [KwRestParam] a new instance of KwRestParam
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6995
+ # source://syntax_tree//lib/syntax_tree/node.rb#6998
def initialize(name:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7031
+ # source://syntax_tree//lib/syntax_tree/node.rb#7034
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7001
+ # source://syntax_tree//lib/syntax_tree/node.rb#7004
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7005
+ # source://syntax_tree//lib/syntax_tree/node.rb#7008
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6993
+ # source://syntax_tree//lib/syntax_tree/node.rb#6996
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7009
+ # source://syntax_tree//lib/syntax_tree/node.rb#7012
def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7005
+ # source://syntax_tree//lib/syntax_tree/node.rb#7008
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7022
+ # source://syntax_tree//lib/syntax_tree/node.rb#7025
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7026
+ # source://syntax_tree//lib/syntax_tree/node.rb#7029
def format(q); end
# [nil | Ident] the name of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6990
+ # source://syntax_tree//lib/syntax_tree/node.rb#6993
def name; end
end
# LBrace represents the use of a left brace, i.e., {.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7332
+# source://syntax_tree//lib/syntax_tree/node.rb#7316
class SyntaxTree::LBrace < ::SyntaxTree::Node
# @return [LBrace] a new instance of LBrace
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7339
+ # source://syntax_tree//lib/syntax_tree/node.rb#7323
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7374
+ # source://syntax_tree//lib/syntax_tree/node.rb#7358
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7345
+ # source://syntax_tree//lib/syntax_tree/node.rb#7329
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7349
+ # source://syntax_tree//lib/syntax_tree/node.rb#7333
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7337
+ # source://syntax_tree//lib/syntax_tree/node.rb#7321
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7353
+ # source://syntax_tree//lib/syntax_tree/node.rb#7337
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7349
+ # source://syntax_tree//lib/syntax_tree/node.rb#7333
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7366
+ # source://syntax_tree//lib/syntax_tree/node.rb#7350
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7370
+ # source://syntax_tree//lib/syntax_tree/node.rb#7354
def format(q); end
# [String] the left brace
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7334
+ # source://syntax_tree//lib/syntax_tree/node.rb#7318
def value; end
class << self
@@ -6386,49 +6612,49 @@ class SyntaxTree::LBrace < ::SyntaxTree::Node
# easier to create LBrace nodes without any specific value, this method
# provides a default node.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7383
+ # source://syntax_tree//lib/syntax_tree/node.rb#7367
def default; end
end
end
# LBracket represents the use of a left bracket, i.e., [.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7389
+# source://syntax_tree//lib/syntax_tree/node.rb#7373
class SyntaxTree::LBracket < ::SyntaxTree::Node
# @return [LBracket] a new instance of LBracket
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7396
+ # source://syntax_tree//lib/syntax_tree/node.rb#7380
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7431
+ # source://syntax_tree//lib/syntax_tree/node.rb#7415
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7402
+ # source://syntax_tree//lib/syntax_tree/node.rb#7386
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7406
+ # source://syntax_tree//lib/syntax_tree/node.rb#7390
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7394
+ # source://syntax_tree//lib/syntax_tree/node.rb#7378
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7410
+ # source://syntax_tree//lib/syntax_tree/node.rb#7394
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7406
+ # source://syntax_tree//lib/syntax_tree/node.rb#7390
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7423
+ # source://syntax_tree//lib/syntax_tree/node.rb#7407
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7427
+ # source://syntax_tree//lib/syntax_tree/node.rb#7411
def format(q); end
# [String] the left bracket
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7391
+ # source://syntax_tree//lib/syntax_tree/node.rb#7375
def value; end
class << self
@@ -6438,49 +6664,49 @@ class SyntaxTree::LBracket < ::SyntaxTree::Node
# easier to create LBracket nodes without any specific value, this method
# provides a default node.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7440
+ # source://syntax_tree//lib/syntax_tree/node.rb#7424
def default; end
end
end
# LParen represents the use of a left parenthesis, i.e., (.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7446
+# source://syntax_tree//lib/syntax_tree/node.rb#7430
class SyntaxTree::LParen < ::SyntaxTree::Node
# @return [LParen] a new instance of LParen
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7453
+ # source://syntax_tree//lib/syntax_tree/node.rb#7437
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7488
+ # source://syntax_tree//lib/syntax_tree/node.rb#7472
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7459
+ # source://syntax_tree//lib/syntax_tree/node.rb#7443
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7463
+ # source://syntax_tree//lib/syntax_tree/node.rb#7447
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7451
+ # source://syntax_tree//lib/syntax_tree/node.rb#7435
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7467
+ # source://syntax_tree//lib/syntax_tree/node.rb#7451
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7463
+ # source://syntax_tree//lib/syntax_tree/node.rb#7447
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7480
+ # source://syntax_tree//lib/syntax_tree/node.rb#7464
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7484
+ # source://syntax_tree//lib/syntax_tree/node.rb#7468
def format(q); end
# [String] the left parenthesis
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7448
+ # source://syntax_tree//lib/syntax_tree/node.rb#7432
def value; end
class << self
@@ -6490,7 +6716,7 @@ class SyntaxTree::LParen < ::SyntaxTree::Node
# easier to create LParen nodes without any specific value, this method
# provides a default node.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7497
+ # source://syntax_tree//lib/syntax_tree/node.rb#7481
def default; end
end
end
@@ -6509,42 +6735,42 @@ end
#
# In this case "key:" would be the body of the label.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7049
+# source://syntax_tree//lib/syntax_tree/node.rb#7052
class SyntaxTree::Label < ::SyntaxTree::Node
# @return [Label] a new instance of Label
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7056
+ # source://syntax_tree//lib/syntax_tree/node.rb#7059
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7091
+ # source://syntax_tree//lib/syntax_tree/node.rb#7094
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7062
+ # source://syntax_tree//lib/syntax_tree/node.rb#7065
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7066
+ # source://syntax_tree//lib/syntax_tree/node.rb#7069
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7054
+ # source://syntax_tree//lib/syntax_tree/node.rb#7057
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7070
+ # source://syntax_tree//lib/syntax_tree/node.rb#7073
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7066
+ # source://syntax_tree//lib/syntax_tree/node.rb#7069
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7083
+ # source://syntax_tree//lib/syntax_tree/node.rb#7086
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7087
+ # source://syntax_tree//lib/syntax_tree/node.rb#7090
def format(q); end
# [String] the value of the label
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7051
+ # source://syntax_tree//lib/syntax_tree/node.rb#7054
def value; end
end
@@ -6556,34 +6782,34 @@ end
# hash key. This node is important for determining the type of quote being
# used by the label.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7103
+# source://syntax_tree//lib/syntax_tree/node.rb#7106
class SyntaxTree::LabelEnd < ::SyntaxTree::Node
# @return [LabelEnd] a new instance of LabelEnd
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7107
+ # source://syntax_tree//lib/syntax_tree/node.rb#7110
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7133
+ # source://syntax_tree//lib/syntax_tree/node.rb#7136
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7112
+ # source://syntax_tree//lib/syntax_tree/node.rb#7115
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7116
+ # source://syntax_tree//lib/syntax_tree/node.rb#7119
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7120
+ # source://syntax_tree//lib/syntax_tree/node.rb#7123
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7116
+ # source://syntax_tree//lib/syntax_tree/node.rb#7119
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7129
+ # source://syntax_tree//lib/syntax_tree/node.rb#7132
def deconstruct_keys(_keys); end
# [String] the end of the label
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7105
+ # source://syntax_tree//lib/syntax_tree/node.rb#7108
def value; end
end
@@ -6591,47 +6817,47 @@ end
#
# ->(value) { value * 2 }
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7142
+# source://syntax_tree//lib/syntax_tree/node.rb#7145
class SyntaxTree::Lambda < ::SyntaxTree::Node
# @return [Lambda] a new instance of Lambda
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7152
+ # source://syntax_tree//lib/syntax_tree/node.rb#7155
def initialize(params:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7255
+ # source://syntax_tree//lib/syntax_tree/node.rb#7239
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7159
+ # source://syntax_tree//lib/syntax_tree/node.rb#7162
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7163
+ # source://syntax_tree//lib/syntax_tree/node.rb#7166
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7150
+ # source://syntax_tree//lib/syntax_tree/node.rb#7153
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7167
+ # source://syntax_tree//lib/syntax_tree/node.rb#7170
def copy(params: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7163
+ # source://syntax_tree//lib/syntax_tree/node.rb#7166
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7181
+ # source://syntax_tree//lib/syntax_tree/node.rb#7184
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7190
+ # source://syntax_tree//lib/syntax_tree/node.rb#7193
def format(q); end
# [LambdaVar | Paren] the parameter declaration for this lambda
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7144
+ # source://syntax_tree//lib/syntax_tree/node.rb#7147
def params; end
# [BodyStmt | Statements] the expressions to be executed in this lambda
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7147
+ # source://syntax_tree//lib/syntax_tree/node.rb#7150
def statements; end
end
@@ -6643,52 +6869,52 @@ end
# -> (positional, optional = value, keyword:, █ local) do
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7269
+# source://syntax_tree//lib/syntax_tree/node.rb#7253
class SyntaxTree::LambdaVar < ::SyntaxTree::Node
# @return [LambdaVar] a new instance of LambdaVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7279
+ # source://syntax_tree//lib/syntax_tree/node.rb#7263
def initialize(params:, locals:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7325
+ # source://syntax_tree//lib/syntax_tree/node.rb#7309
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7286
+ # source://syntax_tree//lib/syntax_tree/node.rb#7270
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7290
+ # source://syntax_tree//lib/syntax_tree/node.rb#7274
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7277
+ # source://syntax_tree//lib/syntax_tree/node.rb#7261
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7294
+ # source://syntax_tree//lib/syntax_tree/node.rb#7278
def copy(params: T.unsafe(nil), locals: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7290
+ # source://syntax_tree//lib/syntax_tree/node.rb#7274
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7308
+ # source://syntax_tree//lib/syntax_tree/node.rb#7292
def deconstruct_keys(_keys); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7312
+ # source://syntax_tree//lib/syntax_tree/node.rb#7296
def empty?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7316
+ # source://syntax_tree//lib/syntax_tree/node.rb#7300
def format(q); end
# [Array[ Ident ]] the list of block-local variable declarations
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7274
+ # source://syntax_tree//lib/syntax_tree/node.rb#7258
def locals; end
# [Params] the parameters being declared with the block
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7271
+ # source://syntax_tree//lib/syntax_tree/node.rb#7255
def params; end
end
@@ -6935,29 +7161,29 @@ end
# Formats an Until or While node.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11394
+# source://syntax_tree//lib/syntax_tree/node.rb#11378
class SyntaxTree::LoopFormatter
# @return [LoopFormatter] a new instance of LoopFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11401
+ # source://syntax_tree//lib/syntax_tree/node.rb#11385
def initialize(keyword, node); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11406
+ # source://syntax_tree//lib/syntax_tree/node.rb#11390
def format(q); end
# [String] the name of the keyword used for this loop
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11396
+ # source://syntax_tree//lib/syntax_tree/node.rb#11380
def keyword; end
# [Until | While] the node that is being formatted
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11399
+ # source://syntax_tree//lib/syntax_tree/node.rb#11383
def node; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#11453
+ # source://syntax_tree//lib/syntax_tree/node.rb#11437
def format_break(q); end
end
@@ -6975,47 +7201,47 @@ end
#
# first, = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7516
+# source://syntax_tree//lib/syntax_tree/node.rb#7500
class SyntaxTree::MAssign < ::SyntaxTree::Node
# @return [MAssign] a new instance of MAssign
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7526
+ # source://syntax_tree//lib/syntax_tree/node.rb#7510
def initialize(target:, value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7570
+ # source://syntax_tree//lib/syntax_tree/node.rb#7554
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7533
+ # source://syntax_tree//lib/syntax_tree/node.rb#7517
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7537
+ # source://syntax_tree//lib/syntax_tree/node.rb#7521
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7524
+ # source://syntax_tree//lib/syntax_tree/node.rb#7508
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7541
+ # source://syntax_tree//lib/syntax_tree/node.rb#7525
def copy(target: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7537
+ # source://syntax_tree//lib/syntax_tree/node.rb#7521
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7555
+ # source://syntax_tree//lib/syntax_tree/node.rb#7539
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7559
+ # source://syntax_tree//lib/syntax_tree/node.rb#7543
def format(q); end
# [MLHS | MLHSParen] the target of the multiple assignment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7518
+ # source://syntax_tree//lib/syntax_tree/node.rb#7502
def target; end
# [Node] the value being assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7521
+ # source://syntax_tree//lib/syntax_tree/node.rb#7505
def value; end
end
@@ -7024,51 +7250,51 @@ end
#
# first, second, third = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7654
+# source://syntax_tree//lib/syntax_tree/node.rb#7638
class SyntaxTree::MLHS < ::SyntaxTree::Node
# @return [MLHS] a new instance of MLHS
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7671
+ # source://syntax_tree//lib/syntax_tree/node.rb#7655
def initialize(parts:, location:, comma: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7709
+ # source://syntax_tree//lib/syntax_tree/node.rb#7693
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7678
+ # source://syntax_tree//lib/syntax_tree/node.rb#7662
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7682
+ # source://syntax_tree//lib/syntax_tree/node.rb#7666
def child_nodes; end
# [boolean] whether or not there is a trailing comma at the end of this
# list, which impacts destructuring. It's an attr_accessor so that while
# the syntax tree is being built it can be set by its parent node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7666
+ # source://syntax_tree//lib/syntax_tree/node.rb#7650
def comma; end
# [boolean] whether or not there is a trailing comma at the end of this
# list, which impacts destructuring. It's an attr_accessor so that while
# the syntax tree is being built it can be set by its parent node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7666
+ # source://syntax_tree//lib/syntax_tree/node.rb#7650
def comma=(_arg0); end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7669
+ # source://syntax_tree//lib/syntax_tree/node.rb#7653
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7686
+ # source://syntax_tree//lib/syntax_tree/node.rb#7670
def copy(parts: T.unsafe(nil), location: T.unsafe(nil), comma: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7682
+ # source://syntax_tree//lib/syntax_tree/node.rb#7666
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7700
+ # source://syntax_tree//lib/syntax_tree/node.rb#7684
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7704
+ # source://syntax_tree//lib/syntax_tree/node.rb#7688
def format(q); end
# [
@@ -7078,7 +7304,7 @@ class SyntaxTree::MLHS < ::SyntaxTree::Node
# ]
# ] the parts of the left-hand side of a multiple assignment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7661
+ # source://syntax_tree//lib/syntax_tree/node.rb#7645
def parts; end
end
@@ -7087,56 +7313,56 @@ end
#
# (left, right) = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7720
+# source://syntax_tree//lib/syntax_tree/node.rb#7704
class SyntaxTree::MLHSParen < ::SyntaxTree::Node
# @return [MLHSParen] a new instance of MLHSParen
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7732
+ # source://syntax_tree//lib/syntax_tree/node.rb#7716
def initialize(contents:, location:, comma: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7785
+ # source://syntax_tree//lib/syntax_tree/node.rb#7769
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7739
+ # source://syntax_tree//lib/syntax_tree/node.rb#7723
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7743
+ # source://syntax_tree//lib/syntax_tree/node.rb#7727
def child_nodes; end
# [boolean] whether or not there is a trailing comma at the end of this
# list, which impacts destructuring. It's an attr_accessor so that while
# the syntax tree is being built it can be set by its parent node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7727
+ # source://syntax_tree//lib/syntax_tree/node.rb#7711
def comma; end
# [boolean] whether or not there is a trailing comma at the end of this
# list, which impacts destructuring. It's an attr_accessor so that while
# the syntax tree is being built it can be set by its parent node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7727
+ # source://syntax_tree//lib/syntax_tree/node.rb#7711
def comma=(_arg0); end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7730
+ # source://syntax_tree//lib/syntax_tree/node.rb#7714
def comments; end
# [MLHS | MLHSParen] the contents inside of the parentheses
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7722
+ # source://syntax_tree//lib/syntax_tree/node.rb#7706
def contents; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7747
+ # source://syntax_tree//lib/syntax_tree/node.rb#7731
def copy(contents: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7743
+ # source://syntax_tree//lib/syntax_tree/node.rb#7727
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7760
+ # source://syntax_tree//lib/syntax_tree/node.rb#7744
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7764
+ # source://syntax_tree//lib/syntax_tree/node.rb#7748
def format(q); end
end
@@ -7145,42 +7371,42 @@ end
#
# values = first, second, third
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7885
+# source://syntax_tree//lib/syntax_tree/node.rb#7869
class SyntaxTree::MRHS < ::SyntaxTree::Node
# @return [MRHS] a new instance of MRHS
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7892
+ # source://syntax_tree//lib/syntax_tree/node.rb#7876
def initialize(parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7927
+ # source://syntax_tree//lib/syntax_tree/node.rb#7911
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7898
+ # source://syntax_tree//lib/syntax_tree/node.rb#7882
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7902
+ # source://syntax_tree//lib/syntax_tree/node.rb#7886
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7890
+ # source://syntax_tree//lib/syntax_tree/node.rb#7874
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7906
+ # source://syntax_tree//lib/syntax_tree/node.rb#7890
def copy(parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7902
+ # source://syntax_tree//lib/syntax_tree/node.rb#7886
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7919
+ # source://syntax_tree//lib/syntax_tree/node.rb#7903
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7923
+ # source://syntax_tree//lib/syntax_tree/node.rb#7907
def format(q); end
# [Array[Node]] the parts that are being assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7887
+ # source://syntax_tree//lib/syntax_tree/node.rb#7871
def parts; end
end
@@ -7437,50 +7663,50 @@ end
#
# method {}
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7579
+# source://syntax_tree//lib/syntax_tree/node.rb#7563
class SyntaxTree::MethodAddBlock < ::SyntaxTree::Node
# @return [MethodAddBlock] a new instance of MethodAddBlock
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7589
+ # source://syntax_tree//lib/syntax_tree/node.rb#7573
def initialize(call:, block:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7638
+ # source://syntax_tree//lib/syntax_tree/node.rb#7622
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7596
+ # source://syntax_tree//lib/syntax_tree/node.rb#7580
def accept(visitor); end
# [BlockNode] the block being sent with the method call
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7584
+ # source://syntax_tree//lib/syntax_tree/node.rb#7568
def block; end
# [ARef | CallNode | Command | CommandCall | Super | ZSuper] the method call
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7581
+ # source://syntax_tree//lib/syntax_tree/node.rb#7565
def call; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7600
+ # source://syntax_tree//lib/syntax_tree/node.rb#7584
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7587
+ # source://syntax_tree//lib/syntax_tree/node.rb#7571
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7604
+ # source://syntax_tree//lib/syntax_tree/node.rb#7588
def copy(call: T.unsafe(nil), block: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7600
+ # source://syntax_tree//lib/syntax_tree/node.rb#7584
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7618
+ # source://syntax_tree//lib/syntax_tree/node.rb#7602
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7622
+ # source://syntax_tree//lib/syntax_tree/node.rb#7606
def format(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7643
+ # source://syntax_tree//lib/syntax_tree/node.rb#7627
def format_contents(q); end
end
@@ -7489,52 +7715,52 @@ end
# module Namespace
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7795
+# source://syntax_tree//lib/syntax_tree/node.rb#7779
class SyntaxTree::ModuleDeclaration < ::SyntaxTree::Node
# @return [ModuleDeclaration] a new instance of ModuleDeclaration
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7805
+ # source://syntax_tree//lib/syntax_tree/node.rb#7789
def initialize(constant:, bodystmt:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7865
+ # source://syntax_tree//lib/syntax_tree/node.rb#7849
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7812
+ # source://syntax_tree//lib/syntax_tree/node.rb#7796
def accept(visitor); end
# [BodyStmt] the expressions to be executed in the context of the module
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7800
+ # source://syntax_tree//lib/syntax_tree/node.rb#7784
def bodystmt; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7816
+ # source://syntax_tree//lib/syntax_tree/node.rb#7800
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7803
+ # source://syntax_tree//lib/syntax_tree/node.rb#7787
def comments; end
# [ConstPathRef | ConstRef | TopConstRef] the name of the module
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7797
+ # source://syntax_tree//lib/syntax_tree/node.rb#7781
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7820
+ # source://syntax_tree//lib/syntax_tree/node.rb#7804
def copy(constant: T.unsafe(nil), bodystmt: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7816
+ # source://syntax_tree//lib/syntax_tree/node.rb#7800
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7834
+ # source://syntax_tree//lib/syntax_tree/node.rb#7818
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7843
+ # source://syntax_tree//lib/syntax_tree/node.rb#7827
def format(q); end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#7872
+ # source://syntax_tree//lib/syntax_tree/node.rb#7856
def format_declaration(q); end
end
@@ -8037,42 +8263,42 @@ end
#
# next(value)
#
-# source://syntax_tree//lib/syntax_tree/node.rb#7949
+# source://syntax_tree//lib/syntax_tree/node.rb#7933
class SyntaxTree::Next < ::SyntaxTree::Node
# @return [Next] a new instance of Next
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7956
+ # source://syntax_tree//lib/syntax_tree/node.rb#7940
def initialize(arguments:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7991
+ # source://syntax_tree//lib/syntax_tree/node.rb#7975
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7962
+ # source://syntax_tree//lib/syntax_tree/node.rb#7946
def accept(visitor); end
# [Args] the arguments passed to the next keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7951
+ # source://syntax_tree//lib/syntax_tree/node.rb#7935
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7966
+ # source://syntax_tree//lib/syntax_tree/node.rb#7950
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#7954
+ # source://syntax_tree//lib/syntax_tree/node.rb#7938
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7970
+ # source://syntax_tree//lib/syntax_tree/node.rb#7954
def copy(arguments: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7966
+ # source://syntax_tree//lib/syntax_tree/node.rb#7950
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#7983
+ # source://syntax_tree//lib/syntax_tree/node.rb#7967
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#7987
+ # source://syntax_tree//lib/syntax_tree/node.rb#7971
def format(q); end
end
@@ -8135,52 +8361,52 @@ end
#
# not value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11093
+# source://syntax_tree//lib/syntax_tree/node.rb#11077
class SyntaxTree::Not < ::SyntaxTree::Node
# @return [Not] a new instance of Not
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11104
+ # source://syntax_tree//lib/syntax_tree/node.rb#11088
def initialize(statement:, parentheses:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11166
+ # source://syntax_tree//lib/syntax_tree/node.rb#11150
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11111
+ # source://syntax_tree//lib/syntax_tree/node.rb#11095
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11115
+ # source://syntax_tree//lib/syntax_tree/node.rb#11099
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11102
+ # source://syntax_tree//lib/syntax_tree/node.rb#11086
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11119
+ # source://syntax_tree//lib/syntax_tree/node.rb#11103
def copy(statement: T.unsafe(nil), parentheses: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11115
+ # source://syntax_tree//lib/syntax_tree/node.rb#11099
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11133
+ # source://syntax_tree//lib/syntax_tree/node.rb#11117
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11142
+ # source://syntax_tree//lib/syntax_tree/node.rb#11126
def format(q); end
# [boolean] whether or not parentheses were used
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11098
+ # source://syntax_tree//lib/syntax_tree/node.rb#11082
def parentheses; end
# [boolean] whether or not parentheses were used
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11098
+ # source://syntax_tree//lib/syntax_tree/node.rb#11082
def parentheses?; end
# [nil | Node] the statement on which to operate
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11095
+ # source://syntax_tree//lib/syntax_tree/node.rb#11079
def statement; end
end
@@ -8190,47 +8416,47 @@ end
#
# In the example above, the Op node represents the + operator.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8001
+# source://syntax_tree//lib/syntax_tree/node.rb#7985
class SyntaxTree::Op < ::SyntaxTree::Node
# @return [Op] a new instance of Op
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8011
+ # source://syntax_tree//lib/syntax_tree/node.rb#7995
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8044
+ # source://syntax_tree//lib/syntax_tree/node.rb#8028
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8018
+ # source://syntax_tree//lib/syntax_tree/node.rb#8002
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8022
+ # source://syntax_tree//lib/syntax_tree/node.rb#8006
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8009
+ # source://syntax_tree//lib/syntax_tree/node.rb#7993
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8026
+ # source://syntax_tree//lib/syntax_tree/node.rb#8010
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8022
+ # source://syntax_tree//lib/syntax_tree/node.rb#8006
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8036
+ # source://syntax_tree//lib/syntax_tree/node.rb#8020
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8040
+ # source://syntax_tree//lib/syntax_tree/node.rb#8024
def format(q); end
# [Symbol] the symbol version of the value
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8006
+ # source://syntax_tree//lib/syntax_tree/node.rb#7990
def name; end
# [String] the operator
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8003
+ # source://syntax_tree//lib/syntax_tree/node.rb#7987
def value; end
end
@@ -8239,84 +8465,84 @@ end
#
# variable += value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8054
+# source://syntax_tree//lib/syntax_tree/node.rb#8038
class SyntaxTree::OpAssign < ::SyntaxTree::Node
# @return [OpAssign] a new instance of OpAssign
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8068
+ # source://syntax_tree//lib/syntax_tree/node.rb#8052
def initialize(target:, operator:, value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8127
+ # source://syntax_tree//lib/syntax_tree/node.rb#8111
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8076
+ # source://syntax_tree//lib/syntax_tree/node.rb#8060
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8080
+ # source://syntax_tree//lib/syntax_tree/node.rb#8064
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8066
+ # source://syntax_tree//lib/syntax_tree/node.rb#8050
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8084
+ # source://syntax_tree//lib/syntax_tree/node.rb#8068
def copy(target: T.unsafe(nil), operator: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8080
+ # source://syntax_tree//lib/syntax_tree/node.rb#8064
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8099
+ # source://syntax_tree//lib/syntax_tree/node.rb#8083
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8109
+ # source://syntax_tree//lib/syntax_tree/node.rb#8093
def format(q); end
# [Op] the operator being used for the assignment
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8060
+ # source://syntax_tree//lib/syntax_tree/node.rb#8044
def operator; end
# [ARefField | ConstPathField | Field | TopConstField | VarField] the target
# to assign the result of the expression to
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8057
+ # source://syntax_tree//lib/syntax_tree/node.rb#8041
def target; end
# [Node] the expression to be assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8063
+ # source://syntax_tree//lib/syntax_tree/node.rb#8047
def value; end
private
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8134
+ # source://syntax_tree//lib/syntax_tree/node.rb#8118
def skip_indent?; end
end
# The list of nodes that represent patterns inside of pattern matching so that
# when a pattern is being printed it knows if it's nested.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6171
+# source://syntax_tree//lib/syntax_tree/node.rb#6174
SyntaxTree::PATTERNS = T.let(T.unsafe(nil), Array)
# Params represents defining parameters on a method or lambda.
#
# def method(param) end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8212
+# source://syntax_tree//lib/syntax_tree/node.rb#8196
class SyntaxTree::Params < ::SyntaxTree::Node
# @return [Params] a new instance of Params
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8314
+ # source://syntax_tree//lib/syntax_tree/node.rb#8298
def initialize(location:, requireds: T.unsafe(nil), optionals: T.unsafe(nil), rest: T.unsafe(nil), posts: T.unsafe(nil), keywords: T.unsafe(nil), keyword_rest: T.unsafe(nil), block: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8444
+ # source://syntax_tree//lib/syntax_tree/node.rb#8428
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8344
+ # source://syntax_tree//lib/syntax_tree/node.rb#8328
def accept(visitor); end
# Returns a range representing the possible number of arguments accepted
@@ -8328,29 +8554,29 @@ class SyntaxTree::Params < ::SyntaxTree::Node
#
# has arity 2..4.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8467
+ # source://syntax_tree//lib/syntax_tree/node.rb#8451
def arity; end
# [nil | BlockArg] the optional block parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8309
+ # source://syntax_tree//lib/syntax_tree/node.rb#8293
def block; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8348
+ # source://syntax_tree//lib/syntax_tree/node.rb#8332
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8312
+ # source://syntax_tree//lib/syntax_tree/node.rb#8296
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8362
+ # source://syntax_tree//lib/syntax_tree/node.rb#8346
def copy(location: T.unsafe(nil), requireds: T.unsafe(nil), optionals: T.unsafe(nil), rest: T.unsafe(nil), posts: T.unsafe(nil), keywords: T.unsafe(nil), keyword_rest: T.unsafe(nil), block: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8348
+ # source://syntax_tree//lib/syntax_tree/node.rb#8332
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8390
+ # source://syntax_tree//lib/syntax_tree/node.rb#8374
def deconstruct_keys(_keys); end
# Params nodes are the most complicated in the tree. Occasionally you want
@@ -8360,126 +8586,126 @@ class SyntaxTree::Params < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8339
+ # source://syntax_tree//lib/syntax_tree/node.rb#8323
def empty?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8404
+ # source://syntax_tree//lib/syntax_tree/node.rb#8388
def format(q); end
# [nil | :nil | ArgsForward | KwRestParam] the optional keyword rest
# parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8306
+ # source://syntax_tree//lib/syntax_tree/node.rb#8290
def keyword_rest; end
# [Array[ [ Label, nil | Node ] ]] any keyword parameters and their
# optional default values
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8302
+ # source://syntax_tree//lib/syntax_tree/node.rb#8286
def keywords; end
# [Array[ [ Ident, Node ] ]] any optional parameters and their default
# values
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8290
+ # source://syntax_tree//lib/syntax_tree/node.rb#8274
def optionals; end
- # [Array[ Ident ]] any positional parameters that exist after a rest
- # parameter
+ # [Array[ Ident | MLHSParen ]] any positional parameters that exist after a
+ # rest parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8298
+ # source://syntax_tree//lib/syntax_tree/node.rb#8282
def posts; end
# [Array[ Ident | MLHSParen ]] any required parameters
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8286
+ # source://syntax_tree//lib/syntax_tree/node.rb#8270
def requireds; end
# [nil | ArgsForward | ExcessedComma | RestParam] the optional rest
# parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8294
+ # source://syntax_tree//lib/syntax_tree/node.rb#8278
def rest; end
private
- # source://syntax_tree//lib/syntax_tree/node.rb#8483
+ # source://syntax_tree//lib/syntax_tree/node.rb#8467
def format_contents(q, parts); end
end
# Formats the keyword position of the parameters. This includes the label,
# as well as an optional default value.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8240
+# source://syntax_tree//lib/syntax_tree/node.rb#8224
class SyntaxTree::Params::KeywordFormatter
# @return [KeywordFormatter] a new instance of KeywordFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8247
+ # source://syntax_tree//lib/syntax_tree/node.rb#8231
def initialize(name, value); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8252
+ # source://syntax_tree//lib/syntax_tree/node.rb#8236
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8256
+ # source://syntax_tree//lib/syntax_tree/node.rb#8240
def format(q); end
# [Ident] the name of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8242
+ # source://syntax_tree//lib/syntax_tree/node.rb#8226
def name; end
# [nil | Node] the value of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8245
+ # source://syntax_tree//lib/syntax_tree/node.rb#8229
def value; end
end
# Formats the keyword_rest position of the parameters. This can be the **nil
# syntax, the ... syntax, or the ** syntax.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8268
+# source://syntax_tree//lib/syntax_tree/node.rb#8252
class SyntaxTree::Params::KeywordRestFormatter
# @return [KeywordRestFormatter] a new instance of KeywordRestFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8272
+ # source://syntax_tree//lib/syntax_tree/node.rb#8256
def initialize(value); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8276
+ # source://syntax_tree//lib/syntax_tree/node.rb#8260
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8280
+ # source://syntax_tree//lib/syntax_tree/node.rb#8264
def format(q); end
# [:nil | ArgsForward | KwRestParam] the value of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8270
+ # source://syntax_tree//lib/syntax_tree/node.rb#8254
def value; end
end
# Formats the optional position of the parameters. This includes the label,
# as well as the default value.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8215
+# source://syntax_tree//lib/syntax_tree/node.rb#8199
class SyntaxTree::Params::OptionalFormatter
# @return [OptionalFormatter] a new instance of OptionalFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8222
+ # source://syntax_tree//lib/syntax_tree/node.rb#8206
def initialize(name, value); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8227
+ # source://syntax_tree//lib/syntax_tree/node.rb#8211
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8231
+ # source://syntax_tree//lib/syntax_tree/node.rb#8215
def format(q); end
# [Ident] the name of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8217
+ # source://syntax_tree//lib/syntax_tree/node.rb#8201
def name; end
# [Node] the value of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8220
+ # source://syntax_tree//lib/syntax_tree/node.rb#8204
def value; end
end
@@ -8489,47 +8715,47 @@ end
#
# (1 + 2)
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8495
+# source://syntax_tree//lib/syntax_tree/node.rb#8479
class SyntaxTree::Paren < ::SyntaxTree::Node
# @return [Paren] a new instance of Paren
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8505
+ # source://syntax_tree//lib/syntax_tree/node.rb#8489
def initialize(lparen:, contents:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8561
+ # source://syntax_tree//lib/syntax_tree/node.rb#8545
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8512
+ # source://syntax_tree//lib/syntax_tree/node.rb#8496
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8516
+ # source://syntax_tree//lib/syntax_tree/node.rb#8500
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8503
+ # source://syntax_tree//lib/syntax_tree/node.rb#8487
def comments; end
# [nil | Node] the expression inside the parentheses
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8500
+ # source://syntax_tree//lib/syntax_tree/node.rb#8484
def contents; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8520
+ # source://syntax_tree//lib/syntax_tree/node.rb#8504
def copy(lparen: T.unsafe(nil), contents: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8516
+ # source://syntax_tree//lib/syntax_tree/node.rb#8500
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8534
+ # source://syntax_tree//lib/syntax_tree/node.rb#8518
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8543
+ # source://syntax_tree//lib/syntax_tree/node.rb#8527
def format(q); end
# [LParen] the left parenthesis that opened this statement
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8497
+ # source://syntax_tree//lib/syntax_tree/node.rb#8481
def lparen; end
end
@@ -8565,18 +8791,18 @@ end
# This approach maintains the nice conciseness of the inline version, while
# keeping the correct semantic meaning.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8171
+# source://syntax_tree//lib/syntax_tree/node.rb#8155
module SyntaxTree::Parentheses
class << self
- # source://syntax_tree//lib/syntax_tree/node.rb#8191
+ # source://syntax_tree//lib/syntax_tree/node.rb#8175
def break(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8183
+ # source://syntax_tree//lib/syntax_tree/node.rb#8167
def flat(q); end
end
end
-# source://syntax_tree//lib/syntax_tree/node.rb#8172
+# source://syntax_tree//lib/syntax_tree/node.rb#8156
SyntaxTree::Parentheses::NODES = T.let(T.unsafe(nil), Array)
# Parser is a subclass of the Ripper library that subscribes to the stream of
@@ -10339,42 +10565,42 @@ end
# Period represents the use of the +.+ operator. It is usually found in method
# calls.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8569
+# source://syntax_tree//lib/syntax_tree/node.rb#8553
class SyntaxTree::Period < ::SyntaxTree::Node
# @return [Period] a new instance of Period
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8576
+ # source://syntax_tree//lib/syntax_tree/node.rb#8560
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8611
+ # source://syntax_tree//lib/syntax_tree/node.rb#8595
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8582
+ # source://syntax_tree//lib/syntax_tree/node.rb#8566
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8586
+ # source://syntax_tree//lib/syntax_tree/node.rb#8570
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8574
+ # source://syntax_tree//lib/syntax_tree/node.rb#8558
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8590
+ # source://syntax_tree//lib/syntax_tree/node.rb#8574
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8586
+ # source://syntax_tree//lib/syntax_tree/node.rb#8570
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8603
+ # source://syntax_tree//lib/syntax_tree/node.rb#8587
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8607
+ # source://syntax_tree//lib/syntax_tree/node.rb#8591
def format(q); end
# [String] the period
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8571
+ # source://syntax_tree//lib/syntax_tree/node.rb#8555
def value; end
end
@@ -10433,42 +10659,42 @@ end
# This can be a plain local variable like the example above. It can also be a
# a class variable, a global variable, or an instance variable.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11677
+# source://syntax_tree//lib/syntax_tree/node.rb#11661
class SyntaxTree::PinnedVarRef < ::SyntaxTree::Node
# @return [PinnedVarRef] a new instance of PinnedVarRef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11684
+ # source://syntax_tree//lib/syntax_tree/node.rb#11668
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11722
+ # source://syntax_tree//lib/syntax_tree/node.rb#11706
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11690
+ # source://syntax_tree//lib/syntax_tree/node.rb#11674
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11694
+ # source://syntax_tree//lib/syntax_tree/node.rb#11678
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11682
+ # source://syntax_tree//lib/syntax_tree/node.rb#11666
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11698
+ # source://syntax_tree//lib/syntax_tree/node.rb#11682
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11694
+ # source://syntax_tree//lib/syntax_tree/node.rb#11678
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11711
+ # source://syntax_tree//lib/syntax_tree/node.rb#11695
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11715
+ # source://syntax_tree//lib/syntax_tree/node.rb#11699
def format(q); end
# [Const | CVar | GVar | Ident | IVar] the value of this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11679
+ # source://syntax_tree//lib/syntax_tree/node.rb#11663
def value; end
end
@@ -10521,42 +10747,42 @@ end
# Program represents the overall syntax tree.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8617
+# source://syntax_tree//lib/syntax_tree/node.rb#8601
class SyntaxTree::Program < ::SyntaxTree::Node
# @return [Program] a new instance of Program
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8624
+ # source://syntax_tree//lib/syntax_tree/node.rb#8608
def initialize(statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8664
+ # source://syntax_tree//lib/syntax_tree/node.rb#8648
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8630
+ # source://syntax_tree//lib/syntax_tree/node.rb#8614
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8634
+ # source://syntax_tree//lib/syntax_tree/node.rb#8618
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8622
+ # source://syntax_tree//lib/syntax_tree/node.rb#8606
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8638
+ # source://syntax_tree//lib/syntax_tree/node.rb#8622
def copy(statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8634
+ # source://syntax_tree//lib/syntax_tree/node.rb#8618
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8651
+ # source://syntax_tree//lib/syntax_tree/node.rb#8635
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8655
+ # source://syntax_tree//lib/syntax_tree/node.rb#8639
def format(q); end
# [Statements] the top-level expressions of the program
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8619
+ # source://syntax_tree//lib/syntax_tree/node.rb#8603
def statements; end
end
@@ -10564,47 +10790,47 @@ end
#
# %i[one two three]
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8673
+# source://syntax_tree//lib/syntax_tree/node.rb#8657
class SyntaxTree::QSymbols < ::SyntaxTree::Node
# @return [QSymbols] a new instance of QSymbols
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8683
+ # source://syntax_tree//lib/syntax_tree/node.rb#8667
def initialize(beginning:, elements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8743
+ # source://syntax_tree//lib/syntax_tree/node.rb#8727
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8690
+ # source://syntax_tree//lib/syntax_tree/node.rb#8674
def accept(visitor); end
# [QSymbolsBeg] the token that opens this array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8675
+ # source://syntax_tree//lib/syntax_tree/node.rb#8659
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8694
+ # source://syntax_tree//lib/syntax_tree/node.rb#8678
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8681
+ # source://syntax_tree//lib/syntax_tree/node.rb#8665
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8698
+ # source://syntax_tree//lib/syntax_tree/node.rb#8682
def copy(beginning: T.unsafe(nil), elements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8694
+ # source://syntax_tree//lib/syntax_tree/node.rb#8678
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8712
+ # source://syntax_tree//lib/syntax_tree/node.rb#8696
def deconstruct_keys(_keys); end
# [Array[ TStringContent ]] the elements of the array
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8678
+ # source://syntax_tree//lib/syntax_tree/node.rb#8662
def elements; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8721
+ # source://syntax_tree//lib/syntax_tree/node.rb#8705
def format(q); end
end
@@ -10616,34 +10842,34 @@ end
# these kinds of arrays can start with a lot of different delimiter types
# (e.g., %i| or %i<).
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8756
+# source://syntax_tree//lib/syntax_tree/node.rb#8740
class SyntaxTree::QSymbolsBeg < ::SyntaxTree::Node
# @return [QSymbolsBeg] a new instance of QSymbolsBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8760
+ # source://syntax_tree//lib/syntax_tree/node.rb#8744
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8786
+ # source://syntax_tree//lib/syntax_tree/node.rb#8770
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8765
+ # source://syntax_tree//lib/syntax_tree/node.rb#8749
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8769
+ # source://syntax_tree//lib/syntax_tree/node.rb#8753
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8773
+ # source://syntax_tree//lib/syntax_tree/node.rb#8757
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8769
+ # source://syntax_tree//lib/syntax_tree/node.rb#8753
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8782
+ # source://syntax_tree//lib/syntax_tree/node.rb#8766
def deconstruct_keys(_keys); end
# [String] the beginning of the array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8758
+ # source://syntax_tree//lib/syntax_tree/node.rb#8742
def value; end
end
@@ -10651,47 +10877,47 @@ end
#
# %w[one two three]
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8795
+# source://syntax_tree//lib/syntax_tree/node.rb#8779
class SyntaxTree::QWords < ::SyntaxTree::Node
# @return [QWords] a new instance of QWords
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8805
+ # source://syntax_tree//lib/syntax_tree/node.rb#8789
def initialize(beginning:, elements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8861
+ # source://syntax_tree//lib/syntax_tree/node.rb#8845
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8812
+ # source://syntax_tree//lib/syntax_tree/node.rb#8796
def accept(visitor); end
# [QWordsBeg] the token that opens this array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8797
+ # source://syntax_tree//lib/syntax_tree/node.rb#8781
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8816
+ # source://syntax_tree//lib/syntax_tree/node.rb#8800
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8803
+ # source://syntax_tree//lib/syntax_tree/node.rb#8787
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8820
+ # source://syntax_tree//lib/syntax_tree/node.rb#8804
def copy(beginning: T.unsafe(nil), elements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8816
+ # source://syntax_tree//lib/syntax_tree/node.rb#8800
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8830
+ # source://syntax_tree//lib/syntax_tree/node.rb#8814
def deconstruct_keys(_keys); end
# [Array[ TStringContent ]] the elements of the array
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8800
+ # source://syntax_tree//lib/syntax_tree/node.rb#8784
def elements; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8839
+ # source://syntax_tree//lib/syntax_tree/node.rb#8823
def format(q); end
end
@@ -10703,41 +10929,41 @@ end
# kinds of arrays can start with a lot of different delimiter types (e.g.,
# %w| or %w<).
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8874
+# source://syntax_tree//lib/syntax_tree/node.rb#8858
class SyntaxTree::QWordsBeg < ::SyntaxTree::Node
# @return [QWordsBeg] a new instance of QWordsBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8878
+ # source://syntax_tree//lib/syntax_tree/node.rb#8862
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8904
+ # source://syntax_tree//lib/syntax_tree/node.rb#8888
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8883
+ # source://syntax_tree//lib/syntax_tree/node.rb#8867
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8887
+ # source://syntax_tree//lib/syntax_tree/node.rb#8871
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8891
+ # source://syntax_tree//lib/syntax_tree/node.rb#8875
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8887
+ # source://syntax_tree//lib/syntax_tree/node.rb#8871
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8900
+ # source://syntax_tree//lib/syntax_tree/node.rb#8884
def deconstruct_keys(_keys); end
# [String] the beginning of the array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8876
+ # source://syntax_tree//lib/syntax_tree/node.rb#8860
def value; end
end
# Responsible for providing information about quotes to be used for strings
# and dynamic symbols.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4612
+# source://syntax_tree//lib/syntax_tree/node.rb#4615
module SyntaxTree::Quotes
class << self
# If there is some part of this string that matches an escape sequence or
@@ -10748,25 +10974,25 @@ module SyntaxTree::Quotes
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4621
+ # source://syntax_tree//lib/syntax_tree/node.rb#4624
def locked?(node, quote); end
# Find the matching closing quote for the given opening quote.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4628
+ # source://syntax_tree//lib/syntax_tree/node.rb#4631
def matching(quote); end
# Escape and unescape single and double quotes as needed to be able to
# enclose +content+ with +enclosing+.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4634
+ # source://syntax_tree//lib/syntax_tree/node.rb#4637
def normalize(content, enclosing); end
end
end
# The matching pairs of quotes that can be used with % literals.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4614
+# source://syntax_tree//lib/syntax_tree/node.rb#4617
SyntaxTree::Quotes::PAIRS = T.let(T.unsafe(nil), Hash)
# RAssign represents a single-line pattern match.
@@ -10774,152 +11000,152 @@ SyntaxTree::Quotes::PAIRS = T.let(T.unsafe(nil), Hash)
# value in pattern
# value => pattern
#
-# source://syntax_tree//lib/syntax_tree/node.rb#3198
+# source://syntax_tree//lib/syntax_tree/node.rb#3201
class SyntaxTree::RAssign < ::SyntaxTree::Node
# @return [RAssign] a new instance of RAssign
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3212
+ # source://syntax_tree//lib/syntax_tree/node.rb#3215
def initialize(value:, operator:, pattern:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3274
+ # source://syntax_tree//lib/syntax_tree/node.rb#3277
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3220
+ # source://syntax_tree//lib/syntax_tree/node.rb#3223
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3224
+ # source://syntax_tree//lib/syntax_tree/node.rb#3227
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3210
+ # source://syntax_tree//lib/syntax_tree/node.rb#3213
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3228
+ # source://syntax_tree//lib/syntax_tree/node.rb#3231
def copy(value: T.unsafe(nil), operator: T.unsafe(nil), pattern: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3224
+ # source://syntax_tree//lib/syntax_tree/node.rb#3227
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#3243
+ # source://syntax_tree//lib/syntax_tree/node.rb#3246
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#3253
+ # source://syntax_tree//lib/syntax_tree/node.rb#3256
def format(q); end
# [Kw | Op] the operator being used to match against the pattern, which is
# either => or in
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3204
+ # source://syntax_tree//lib/syntax_tree/node.rb#3207
def operator; end
# [Node] the pattern on the right-hand side of the expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3207
+ # source://syntax_tree//lib/syntax_tree/node.rb#3210
def pattern; end
# [Node] the left-hand expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#3200
+ # source://syntax_tree//lib/syntax_tree/node.rb#3203
def value; end
end
# RBrace represents the use of a right brace, i.e., +++.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8961
+# source://syntax_tree//lib/syntax_tree/node.rb#8945
class SyntaxTree::RBrace < ::SyntaxTree::Node
# @return [RBrace] a new instance of RBrace
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8965
+ # source://syntax_tree//lib/syntax_tree/node.rb#8949
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8991
+ # source://syntax_tree//lib/syntax_tree/node.rb#8975
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8970
+ # source://syntax_tree//lib/syntax_tree/node.rb#8954
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8974
+ # source://syntax_tree//lib/syntax_tree/node.rb#8958
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8978
+ # source://syntax_tree//lib/syntax_tree/node.rb#8962
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8974
+ # source://syntax_tree//lib/syntax_tree/node.rb#8958
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8987
+ # source://syntax_tree//lib/syntax_tree/node.rb#8971
def deconstruct_keys(_keys); end
# [String] the right brace
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8963
+ # source://syntax_tree//lib/syntax_tree/node.rb#8947
def value; end
end
# RBracket represents the use of a right bracket, i.e., +]+.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8997
+# source://syntax_tree//lib/syntax_tree/node.rb#8981
class SyntaxTree::RBracket < ::SyntaxTree::Node
# @return [RBracket] a new instance of RBracket
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9001
+ # source://syntax_tree//lib/syntax_tree/node.rb#8985
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9027
+ # source://syntax_tree//lib/syntax_tree/node.rb#9011
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9006
+ # source://syntax_tree//lib/syntax_tree/node.rb#8990
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9010
+ # source://syntax_tree//lib/syntax_tree/node.rb#8994
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9014
+ # source://syntax_tree//lib/syntax_tree/node.rb#8998
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9010
+ # source://syntax_tree//lib/syntax_tree/node.rb#8994
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9023
+ # source://syntax_tree//lib/syntax_tree/node.rb#9007
def deconstruct_keys(_keys); end
# [String] the right bracket
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8999
+ # source://syntax_tree//lib/syntax_tree/node.rb#8983
def value; end
end
# RParen represents the use of a right parenthesis, i.e., +)+.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9767
+# source://syntax_tree//lib/syntax_tree/node.rb#9751
class SyntaxTree::RParen < ::SyntaxTree::Node
# @return [RParen] a new instance of RParen
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9771
+ # source://syntax_tree//lib/syntax_tree/node.rb#9755
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9797
+ # source://syntax_tree//lib/syntax_tree/node.rb#9781
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9776
+ # source://syntax_tree//lib/syntax_tree/node.rb#9760
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9780
+ # source://syntax_tree//lib/syntax_tree/node.rb#9764
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9784
+ # source://syntax_tree//lib/syntax_tree/node.rb#9768
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9780
+ # source://syntax_tree//lib/syntax_tree/node.rb#9764
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9793
+ # source://syntax_tree//lib/syntax_tree/node.rb#9777
def deconstruct_keys(_keys); end
# [String] the parenthesis
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9769
+ # source://syntax_tree//lib/syntax_tree/node.rb#9753
def value; end
end
@@ -10935,52 +11161,52 @@ end
#
# One of the sides of the expression may be nil, but not both.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#4537
+# source://syntax_tree//lib/syntax_tree/node.rb#4540
class SyntaxTree::RangeNode < ::SyntaxTree::Node
# @return [RangeNode] a new instance of RangeNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4550
+ # source://syntax_tree//lib/syntax_tree/node.rb#4553
def initialize(left:, operator:, right:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4604
+ # source://syntax_tree//lib/syntax_tree/node.rb#4607
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4558
+ # source://syntax_tree//lib/syntax_tree/node.rb#4561
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4562
+ # source://syntax_tree//lib/syntax_tree/node.rb#4565
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4548
+ # source://syntax_tree//lib/syntax_tree/node.rb#4551
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4566
+ # source://syntax_tree//lib/syntax_tree/node.rb#4569
def copy(left: T.unsafe(nil), operator: T.unsafe(nil), right: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4562
+ # source://syntax_tree//lib/syntax_tree/node.rb#4565
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#4581
+ # source://syntax_tree//lib/syntax_tree/node.rb#4584
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#4591
+ # source://syntax_tree//lib/syntax_tree/node.rb#4594
def format(q); end
# [nil | Node] the left side of the expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4539
+ # source://syntax_tree//lib/syntax_tree/node.rb#4542
def left; end
# [Op] the operator used for this range
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4542
+ # source://syntax_tree//lib/syntax_tree/node.rb#4545
def operator; end
# [nil | Node] the right side of the expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#4545
+ # source://syntax_tree//lib/syntax_tree/node.rb#4548
def right; end
end
@@ -10988,42 +11214,42 @@ end
#
# 1r
#
-# source://syntax_tree//lib/syntax_tree/node.rb#8913
+# source://syntax_tree//lib/syntax_tree/node.rb#8897
class SyntaxTree::RationalLiteral < ::SyntaxTree::Node
# @return [RationalLiteral] a new instance of RationalLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8920
+ # source://syntax_tree//lib/syntax_tree/node.rb#8904
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8955
+ # source://syntax_tree//lib/syntax_tree/node.rb#8939
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8926
+ # source://syntax_tree//lib/syntax_tree/node.rb#8910
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8930
+ # source://syntax_tree//lib/syntax_tree/node.rb#8914
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8918
+ # source://syntax_tree//lib/syntax_tree/node.rb#8902
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8934
+ # source://syntax_tree//lib/syntax_tree/node.rb#8918
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8930
+ # source://syntax_tree//lib/syntax_tree/node.rb#8914
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#8947
+ # source://syntax_tree//lib/syntax_tree/node.rb#8931
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#8951
+ # source://syntax_tree//lib/syntax_tree/node.rb#8935
def format(q); end
# [String] the rational number literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#8915
+ # source://syntax_tree//lib/syntax_tree/node.rb#8899
def value; end
end
@@ -11031,37 +11257,37 @@ end
#
# redo
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9036
+# source://syntax_tree//lib/syntax_tree/node.rb#9020
class SyntaxTree::Redo < ::SyntaxTree::Node
# @return [Redo] a new instance of Redo
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9040
+ # source://syntax_tree//lib/syntax_tree/node.rb#9024
def initialize(location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9070
+ # source://syntax_tree//lib/syntax_tree/node.rb#9054
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9045
+ # source://syntax_tree//lib/syntax_tree/node.rb#9029
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9049
+ # source://syntax_tree//lib/syntax_tree/node.rb#9033
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9038
+ # source://syntax_tree//lib/syntax_tree/node.rb#9022
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9053
+ # source://syntax_tree//lib/syntax_tree/node.rb#9037
def copy(location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9049
+ # source://syntax_tree//lib/syntax_tree/node.rb#9033
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9062
+ # source://syntax_tree//lib/syntax_tree/node.rb#9046
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9066
+ # source://syntax_tree//lib/syntax_tree/node.rb#9050
def format(q); end
end
@@ -11074,34 +11300,34 @@ end
#
# %r{.+}
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9132
+# source://syntax_tree//lib/syntax_tree/node.rb#9116
class SyntaxTree::RegexpBeg < ::SyntaxTree::Node
# @return [RegexpBeg] a new instance of RegexpBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9136
+ # source://syntax_tree//lib/syntax_tree/node.rb#9120
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9162
+ # source://syntax_tree//lib/syntax_tree/node.rb#9146
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9141
+ # source://syntax_tree//lib/syntax_tree/node.rb#9125
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9145
+ # source://syntax_tree//lib/syntax_tree/node.rb#9129
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9149
+ # source://syntax_tree//lib/syntax_tree/node.rb#9133
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9145
+ # source://syntax_tree//lib/syntax_tree/node.rb#9129
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9158
+ # source://syntax_tree//lib/syntax_tree/node.rb#9142
def deconstruct_keys(_keys); end
# [String] the beginning of the regular expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9134
+ # source://syntax_tree//lib/syntax_tree/node.rb#9118
def value; end
end
@@ -11112,40 +11338,40 @@ end
# In the example above, a RegexpContent node represents everything contained
# within the forward slashes.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9081
+# source://syntax_tree//lib/syntax_tree/node.rb#9065
class SyntaxTree::RegexpContent < ::SyntaxTree::Node
# @return [RegexpContent] a new instance of RegexpContent
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9089
+ # source://syntax_tree//lib/syntax_tree/node.rb#9073
def initialize(beginning:, parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9117
+ # source://syntax_tree//lib/syntax_tree/node.rb#9101
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9095
+ # source://syntax_tree//lib/syntax_tree/node.rb#9079
def accept(visitor); end
# [String] the opening of the regular expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9083
+ # source://syntax_tree//lib/syntax_tree/node.rb#9067
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9099
+ # source://syntax_tree//lib/syntax_tree/node.rb#9083
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9103
+ # source://syntax_tree//lib/syntax_tree/node.rb#9087
def copy(beginning: T.unsafe(nil), parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9099
+ # source://syntax_tree//lib/syntax_tree/node.rb#9083
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9113
+ # source://syntax_tree//lib/syntax_tree/node.rb#9097
def deconstruct_keys(_keys); end
# [Array[ StringDVar | StringEmbExpr | TStringContent ]] the parts of the
# regular expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9087
+ # source://syntax_tree//lib/syntax_tree/node.rb#9071
def parts; end
end
@@ -11159,34 +11385,34 @@ end
#
# %r{.+}m
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9177
+# source://syntax_tree//lib/syntax_tree/node.rb#9161
class SyntaxTree::RegexpEnd < ::SyntaxTree::Node
# @return [RegexpEnd] a new instance of RegexpEnd
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9181
+ # source://syntax_tree//lib/syntax_tree/node.rb#9165
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9207
+ # source://syntax_tree//lib/syntax_tree/node.rb#9191
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9186
+ # source://syntax_tree//lib/syntax_tree/node.rb#9170
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9190
+ # source://syntax_tree//lib/syntax_tree/node.rb#9174
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9194
+ # source://syntax_tree//lib/syntax_tree/node.rb#9178
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9190
+ # source://syntax_tree//lib/syntax_tree/node.rb#9174
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9203
+ # source://syntax_tree//lib/syntax_tree/node.rb#9187
def deconstruct_keys(_keys); end
# [String] the end of the regular expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9179
+ # source://syntax_tree//lib/syntax_tree/node.rb#9163
def value; end
end
@@ -11194,56 +11420,56 @@ end
#
# /.+/
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9216
+# source://syntax_tree//lib/syntax_tree/node.rb#9200
class SyntaxTree::RegexpLiteral < ::SyntaxTree::Node
# @return [RegexpLiteral] a new instance of RegexpLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9230
+ # source://syntax_tree//lib/syntax_tree/node.rb#9214
def initialize(beginning:, ending:, parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9312
+ # source://syntax_tree//lib/syntax_tree/node.rb#9296
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9238
+ # source://syntax_tree//lib/syntax_tree/node.rb#9222
def accept(visitor); end
# [String] the beginning of the regular expression literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9218
+ # source://syntax_tree//lib/syntax_tree/node.rb#9202
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9242
+ # source://syntax_tree//lib/syntax_tree/node.rb#9226
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9228
+ # source://syntax_tree//lib/syntax_tree/node.rb#9212
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9246
+ # source://syntax_tree//lib/syntax_tree/node.rb#9230
def copy(beginning: T.unsafe(nil), ending: T.unsafe(nil), parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9242
+ # source://syntax_tree//lib/syntax_tree/node.rb#9226
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9261
+ # source://syntax_tree//lib/syntax_tree/node.rb#9245
def deconstruct_keys(_keys); end
# [String] the ending of the regular expression literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9221
+ # source://syntax_tree//lib/syntax_tree/node.rb#9205
def ending; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9272
+ # source://syntax_tree//lib/syntax_tree/node.rb#9256
def format(q); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9318
+ # source://syntax_tree//lib/syntax_tree/node.rb#9302
def options; end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# regular expression literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9225
+ # source://syntax_tree//lib/syntax_tree/node.rb#9209
def parts; end
private
@@ -11255,12 +11481,12 @@ class SyntaxTree::RegexpLiteral < ::SyntaxTree::Node
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9334
+ # source://syntax_tree//lib/syntax_tree/node.rb#9318
def ambiguous?(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9324
+ # source://syntax_tree//lib/syntax_tree/node.rb#9308
def include?(pattern); end
end
@@ -11270,60 +11496,60 @@ end
# rescue
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9424
+# source://syntax_tree//lib/syntax_tree/node.rb#9408
class SyntaxTree::Rescue < ::SyntaxTree::Node
# @return [Rescue] a new instance of Rescue
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9440
+ # source://syntax_tree//lib/syntax_tree/node.rb#9424
def initialize(keyword:, exception:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9536
+ # source://syntax_tree//lib/syntax_tree/node.rb#9520
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9471
+ # source://syntax_tree//lib/syntax_tree/node.rb#9455
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9449
+ # source://syntax_tree//lib/syntax_tree/node.rb#9433
def bind_end(end_char, end_column); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9475
+ # source://syntax_tree//lib/syntax_tree/node.rb#9459
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9438
+ # source://syntax_tree//lib/syntax_tree/node.rb#9422
def comments; end
# [nil | Rescue] the optional next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9435
+ # source://syntax_tree//lib/syntax_tree/node.rb#9419
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9479
+ # source://syntax_tree//lib/syntax_tree/node.rb#9463
def copy(keyword: T.unsafe(nil), exception: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9475
+ # source://syntax_tree//lib/syntax_tree/node.rb#9459
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9501
+ # source://syntax_tree//lib/syntax_tree/node.rb#9485
def deconstruct_keys(_keys); end
# [nil | RescueEx] the exceptions being rescued
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9429
+ # source://syntax_tree//lib/syntax_tree/node.rb#9413
def exception; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9512
+ # source://syntax_tree//lib/syntax_tree/node.rb#9496
def format(q); end
# [Kw] the rescue keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9426
+ # source://syntax_tree//lib/syntax_tree/node.rb#9410
def keyword; end
# [Statements] the expressions to evaluate when an error is rescued
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9432
+ # source://syntax_tree//lib/syntax_tree/node.rb#9416
def statements; end
end
@@ -11333,48 +11559,48 @@ end
# rescue Exception => exception
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9349
+# source://syntax_tree//lib/syntax_tree/node.rb#9333
class SyntaxTree::RescueEx < ::SyntaxTree::Node
# @return [RescueEx] a new instance of RescueEx
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9360
+ # source://syntax_tree//lib/syntax_tree/node.rb#9344
def initialize(exceptions:, variable:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9412
+ # source://syntax_tree//lib/syntax_tree/node.rb#9396
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9367
+ # source://syntax_tree//lib/syntax_tree/node.rb#9351
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9371
+ # source://syntax_tree//lib/syntax_tree/node.rb#9355
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9358
+ # source://syntax_tree//lib/syntax_tree/node.rb#9342
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9375
+ # source://syntax_tree//lib/syntax_tree/node.rb#9359
def copy(exceptions: T.unsafe(nil), variable: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9371
+ # source://syntax_tree//lib/syntax_tree/node.rb#9355
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9389
+ # source://syntax_tree//lib/syntax_tree/node.rb#9373
def deconstruct_keys(_keys); end
# [nil | Node] the list of exceptions being rescued
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9351
+ # source://syntax_tree//lib/syntax_tree/node.rb#9335
def exceptions; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9398
+ # source://syntax_tree//lib/syntax_tree/node.rb#9382
def format(q); end
# [nil | Field | VarField] the expression being used to capture the raised
# exception
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9355
+ # source://syntax_tree//lib/syntax_tree/node.rb#9339
def variable; end
end
@@ -11382,47 +11608,47 @@ end
#
# expression rescue value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9547
+# source://syntax_tree//lib/syntax_tree/node.rb#9531
class SyntaxTree::RescueMod < ::SyntaxTree::Node
# @return [RescueMod] a new instance of RescueMod
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9557
+ # source://syntax_tree//lib/syntax_tree/node.rb#9541
def initialize(statement:, value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9613
+ # source://syntax_tree//lib/syntax_tree/node.rb#9597
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9564
+ # source://syntax_tree//lib/syntax_tree/node.rb#9548
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9568
+ # source://syntax_tree//lib/syntax_tree/node.rb#9552
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9555
+ # source://syntax_tree//lib/syntax_tree/node.rb#9539
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9572
+ # source://syntax_tree//lib/syntax_tree/node.rb#9556
def copy(statement: T.unsafe(nil), value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9568
+ # source://syntax_tree//lib/syntax_tree/node.rb#9552
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9586
+ # source://syntax_tree//lib/syntax_tree/node.rb#9570
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9595
+ # source://syntax_tree//lib/syntax_tree/node.rb#9579
def format(q); end
# [Node] the expression to execute
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9549
+ # source://syntax_tree//lib/syntax_tree/node.rb#9533
def statement; end
# [Node] the value to use if the executed expression raises an error
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9552
+ # source://syntax_tree//lib/syntax_tree/node.rb#9536
def value; end
end
@@ -11431,42 +11657,42 @@ end
#
# def method(*rest) end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9624
+# source://syntax_tree//lib/syntax_tree/node.rb#9608
class SyntaxTree::RestParam < ::SyntaxTree::Node
# @return [RestParam] a new instance of RestParam
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9631
+ # source://syntax_tree//lib/syntax_tree/node.rb#9615
def initialize(name:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9667
+ # source://syntax_tree//lib/syntax_tree/node.rb#9651
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9637
+ # source://syntax_tree//lib/syntax_tree/node.rb#9621
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9641
+ # source://syntax_tree//lib/syntax_tree/node.rb#9625
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9629
+ # source://syntax_tree//lib/syntax_tree/node.rb#9613
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9645
+ # source://syntax_tree//lib/syntax_tree/node.rb#9629
def copy(name: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9641
+ # source://syntax_tree//lib/syntax_tree/node.rb#9625
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9658
+ # source://syntax_tree//lib/syntax_tree/node.rb#9642
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9662
+ # source://syntax_tree//lib/syntax_tree/node.rb#9646
def format(q); end
# [nil | Ident] the name of the parameter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9626
+ # source://syntax_tree//lib/syntax_tree/node.rb#9610
def name; end
end
@@ -11474,37 +11700,37 @@ end
#
# retry
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9676
+# source://syntax_tree//lib/syntax_tree/node.rb#9660
class SyntaxTree::Retry < ::SyntaxTree::Node
# @return [Retry] a new instance of Retry
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9680
+ # source://syntax_tree//lib/syntax_tree/node.rb#9664
def initialize(location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9710
+ # source://syntax_tree//lib/syntax_tree/node.rb#9694
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9685
+ # source://syntax_tree//lib/syntax_tree/node.rb#9669
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9689
+ # source://syntax_tree//lib/syntax_tree/node.rb#9673
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9678
+ # source://syntax_tree//lib/syntax_tree/node.rb#9662
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9693
+ # source://syntax_tree//lib/syntax_tree/node.rb#9677
def copy(location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9689
+ # source://syntax_tree//lib/syntax_tree/node.rb#9673
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9702
+ # source://syntax_tree//lib/syntax_tree/node.rb#9686
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9706
+ # source://syntax_tree//lib/syntax_tree/node.rb#9690
def format(q); end
end
@@ -11512,42 +11738,42 @@ end
#
# return value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9719
+# source://syntax_tree//lib/syntax_tree/node.rb#9703
class SyntaxTree::ReturnNode < ::SyntaxTree::Node
# @return [ReturnNode] a new instance of ReturnNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9726
+ # source://syntax_tree//lib/syntax_tree/node.rb#9710
def initialize(arguments:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9761
+ # source://syntax_tree//lib/syntax_tree/node.rb#9745
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9732
+ # source://syntax_tree//lib/syntax_tree/node.rb#9716
def accept(visitor); end
# [nil | Args] the arguments being passed to the keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9721
+ # source://syntax_tree//lib/syntax_tree/node.rb#9705
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9736
+ # source://syntax_tree//lib/syntax_tree/node.rb#9720
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9724
+ # source://syntax_tree//lib/syntax_tree/node.rb#9708
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9740
+ # source://syntax_tree//lib/syntax_tree/node.rb#9724
def copy(arguments: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9736
+ # source://syntax_tree//lib/syntax_tree/node.rb#9720
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9753
+ # source://syntax_tree//lib/syntax_tree/node.rb#9737
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9757
+ # source://syntax_tree//lib/syntax_tree/node.rb#9741
def format(q); end
end
@@ -11558,47 +11784,47 @@ end
# class << self
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9809
+# source://syntax_tree//lib/syntax_tree/node.rb#9793
class SyntaxTree::SClass < ::SyntaxTree::Node
# @return [SClass] a new instance of SClass
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9819
+ # source://syntax_tree//lib/syntax_tree/node.rb#9803
def initialize(target:, bodystmt:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9870
+ # source://syntax_tree//lib/syntax_tree/node.rb#9854
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9826
+ # source://syntax_tree//lib/syntax_tree/node.rb#9810
def accept(visitor); end
# [BodyStmt] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9814
+ # source://syntax_tree//lib/syntax_tree/node.rb#9798
def bodystmt; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9830
+ # source://syntax_tree//lib/syntax_tree/node.rb#9814
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9817
+ # source://syntax_tree//lib/syntax_tree/node.rb#9801
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9834
+ # source://syntax_tree//lib/syntax_tree/node.rb#9818
def copy(target: T.unsafe(nil), bodystmt: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9830
+ # source://syntax_tree//lib/syntax_tree/node.rb#9814
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9848
+ # source://syntax_tree//lib/syntax_tree/node.rb#9832
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9857
+ # source://syntax_tree//lib/syntax_tree/node.rb#9841
def format(q); end
# [Node] the target of the singleton class to enter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9811
+ # source://syntax_tree//lib/syntax_tree/node.rb#9795
def target; end
end
@@ -11629,53 +11855,53 @@ end
# propagate that onto void_stmt nodes inside the stmts in order to make sure
# all comments get printed appropriately.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#9883
+# source://syntax_tree//lib/syntax_tree/node.rb#9867
class SyntaxTree::Statements < ::SyntaxTree::Node
# @return [Statements] a new instance of Statements
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9890
+ # source://syntax_tree//lib/syntax_tree/node.rb#9874
def initialize(body:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10016
+ # source://syntax_tree//lib/syntax_tree/node.rb#10000
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9943
+ # source://syntax_tree//lib/syntax_tree/node.rb#9927
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9896
+ # source://syntax_tree//lib/syntax_tree/node.rb#9880
def bind(parser, start_char, start_column, end_char, end_column); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9925
+ # source://syntax_tree//lib/syntax_tree/node.rb#9909
def bind_end(end_char, end_column); end
# [Array[ Node ]] the list of expressions contained within this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9885
+ # source://syntax_tree//lib/syntax_tree/node.rb#9869
def body; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9947
+ # source://syntax_tree//lib/syntax_tree/node.rb#9931
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9888
+ # source://syntax_tree//lib/syntax_tree/node.rb#9872
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9951
+ # source://syntax_tree//lib/syntax_tree/node.rb#9935
def copy(body: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#9947
+ # source://syntax_tree//lib/syntax_tree/node.rb#9931
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9964
+ # source://syntax_tree//lib/syntax_tree/node.rb#9948
def deconstruct_keys(_keys); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#9937
+ # source://syntax_tree//lib/syntax_tree/node.rb#9921
def empty?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#9968
+ # source://syntax_tree//lib/syntax_tree/node.rb#9952
def format(q); end
private
@@ -11684,7 +11910,7 @@ class SyntaxTree::Statements < ::SyntaxTree::Node
# found while this statements list was being parsed and add them into the
# body.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10025
+ # source://syntax_tree//lib/syntax_tree/node.rb#10009
def attach_comments(parser, start_char, end_char); end
end
@@ -11694,48 +11920,48 @@ end
# "first" \
# "second"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10140
+# source://syntax_tree//lib/syntax_tree/node.rb#10124
class SyntaxTree::StringConcat < ::SyntaxTree::Node
# @return [StringConcat] a new instance of StringConcat
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10151
+ # source://syntax_tree//lib/syntax_tree/node.rb#10135
def initialize(left:, right:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10195
+ # source://syntax_tree//lib/syntax_tree/node.rb#10179
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10158
+ # source://syntax_tree//lib/syntax_tree/node.rb#10142
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10162
+ # source://syntax_tree//lib/syntax_tree/node.rb#10146
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10149
+ # source://syntax_tree//lib/syntax_tree/node.rb#10133
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10166
+ # source://syntax_tree//lib/syntax_tree/node.rb#10150
def copy(left: T.unsafe(nil), right: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10162
+ # source://syntax_tree//lib/syntax_tree/node.rb#10146
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10180
+ # source://syntax_tree//lib/syntax_tree/node.rb#10164
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10184
+ # source://syntax_tree//lib/syntax_tree/node.rb#10168
def format(q); end
# [Heredoc | StringConcat | StringLiteral] the left side of the
# concatenation
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10143
+ # source://syntax_tree//lib/syntax_tree/node.rb#10127
def left; end
# [StringLiteral] the right side of the concatenation
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10146
+ # source://syntax_tree//lib/syntax_tree/node.rb#10130
def right; end
end
@@ -11743,43 +11969,43 @@ end
#
# "string"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10067
+# source://syntax_tree//lib/syntax_tree/node.rb#10051
class SyntaxTree::StringContent < ::SyntaxTree::Node
# @return [StringContent] a new instance of StringContent
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10075
+ # source://syntax_tree//lib/syntax_tree/node.rb#10059
def initialize(parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10102
+ # source://syntax_tree//lib/syntax_tree/node.rb#10086
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10081
+ # source://syntax_tree//lib/syntax_tree/node.rb#10065
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10085
+ # source://syntax_tree//lib/syntax_tree/node.rb#10069
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10073
+ # source://syntax_tree//lib/syntax_tree/node.rb#10057
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10089
+ # source://syntax_tree//lib/syntax_tree/node.rb#10073
def copy(parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10085
+ # source://syntax_tree//lib/syntax_tree/node.rb#10069
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10098
+ # source://syntax_tree//lib/syntax_tree/node.rb#10082
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10106
+ # source://syntax_tree//lib/syntax_tree/node.rb#10090
def format(q); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10070
+ # source://syntax_tree//lib/syntax_tree/node.rb#10054
def parts; end
end
@@ -11789,42 +12015,42 @@ end
#
# "#@variable"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10206
+# source://syntax_tree//lib/syntax_tree/node.rb#10190
class SyntaxTree::StringDVar < ::SyntaxTree::Node
# @return [StringDVar] a new instance of StringDVar
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10213
+ # source://syntax_tree//lib/syntax_tree/node.rb#10197
def initialize(variable:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10250
+ # source://syntax_tree//lib/syntax_tree/node.rb#10234
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10219
+ # source://syntax_tree//lib/syntax_tree/node.rb#10203
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10223
+ # source://syntax_tree//lib/syntax_tree/node.rb#10207
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10211
+ # source://syntax_tree//lib/syntax_tree/node.rb#10195
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10227
+ # source://syntax_tree//lib/syntax_tree/node.rb#10211
def copy(variable: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10223
+ # source://syntax_tree//lib/syntax_tree/node.rb#10207
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10240
+ # source://syntax_tree//lib/syntax_tree/node.rb#10224
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10244
+ # source://syntax_tree//lib/syntax_tree/node.rb#10228
def format(q); end
# [Backref | VarRef] the variable being interpolated
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10208
+ # source://syntax_tree//lib/syntax_tree/node.rb#10192
def variable; end
end
@@ -11834,42 +12060,42 @@ end
#
# "string #{expression}"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10261
+# source://syntax_tree//lib/syntax_tree/node.rb#10245
class SyntaxTree::StringEmbExpr < ::SyntaxTree::Node
# @return [StringEmbExpr] a new instance of StringEmbExpr
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10268
+ # source://syntax_tree//lib/syntax_tree/node.rb#10252
def initialize(statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10325
+ # source://syntax_tree//lib/syntax_tree/node.rb#10309
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10274
+ # source://syntax_tree//lib/syntax_tree/node.rb#10258
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10278
+ # source://syntax_tree//lib/syntax_tree/node.rb#10262
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10266
+ # source://syntax_tree//lib/syntax_tree/node.rb#10250
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10282
+ # source://syntax_tree//lib/syntax_tree/node.rb#10266
def copy(statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10278
+ # source://syntax_tree//lib/syntax_tree/node.rb#10262
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10295
+ # source://syntax_tree//lib/syntax_tree/node.rb#10279
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10299
+ # source://syntax_tree//lib/syntax_tree/node.rb#10283
def format(q); end
# [Statements] the expressions to be interpolated
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10263
+ # source://syntax_tree//lib/syntax_tree/node.rb#10247
def statements; end
end
@@ -11877,48 +12103,48 @@ end
#
# "string"
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10334
+# source://syntax_tree//lib/syntax_tree/node.rb#10318
class SyntaxTree::StringLiteral < ::SyntaxTree::Node
# @return [StringLiteral] a new instance of StringLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10345
+ # source://syntax_tree//lib/syntax_tree/node.rb#10329
def initialize(parts:, quote:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10419
+ # source://syntax_tree//lib/syntax_tree/node.rb#10403
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10352
+ # source://syntax_tree//lib/syntax_tree/node.rb#10336
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10356
+ # source://syntax_tree//lib/syntax_tree/node.rb#10340
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10343
+ # source://syntax_tree//lib/syntax_tree/node.rb#10327
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10360
+ # source://syntax_tree//lib/syntax_tree/node.rb#10344
def copy(parts: T.unsafe(nil), quote: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10356
+ # source://syntax_tree//lib/syntax_tree/node.rb#10340
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10374
+ # source://syntax_tree//lib/syntax_tree/node.rb#10358
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10378
+ # source://syntax_tree//lib/syntax_tree/node.rb#10362
def format(q); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# string literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10337
+ # source://syntax_tree//lib/syntax_tree/node.rb#10321
def parts; end
# [nil | String] which quote was used by the string literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10340
+ # source://syntax_tree//lib/syntax_tree/node.rb#10324
def quote; end
end
@@ -11927,42 +12153,42 @@ end
#
# super(value)
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10430
+# source://syntax_tree//lib/syntax_tree/node.rb#10414
class SyntaxTree::Super < ::SyntaxTree::Node
# @return [Super] a new instance of Super
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10437
+ # source://syntax_tree//lib/syntax_tree/node.rb#10421
def initialize(arguments:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10481
+ # source://syntax_tree//lib/syntax_tree/node.rb#10465
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10443
+ # source://syntax_tree//lib/syntax_tree/node.rb#10427
def accept(visitor); end
# [ArgParen | Args] the arguments to the keyword
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10432
+ # source://syntax_tree//lib/syntax_tree/node.rb#10416
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10447
+ # source://syntax_tree//lib/syntax_tree/node.rb#10431
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10435
+ # source://syntax_tree//lib/syntax_tree/node.rb#10419
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10451
+ # source://syntax_tree//lib/syntax_tree/node.rb#10435
def copy(arguments: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10447
+ # source://syntax_tree//lib/syntax_tree/node.rb#10431
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10464
+ # source://syntax_tree//lib/syntax_tree/node.rb#10448
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10468
+ # source://syntax_tree//lib/syntax_tree/node.rb#10452
def format(q); end
end
@@ -11983,34 +12209,34 @@ end
# contain ":'" or ":\"". In the case of %s symbols, it will contain the start
# of the symbol including the %s and the delimiter.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10502
+# source://syntax_tree//lib/syntax_tree/node.rb#10486
class SyntaxTree::SymBeg < ::SyntaxTree::Node
# @return [SymBeg] a new instance of SymBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10506
+ # source://syntax_tree//lib/syntax_tree/node.rb#10490
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10532
+ # source://syntax_tree//lib/syntax_tree/node.rb#10516
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10511
+ # source://syntax_tree//lib/syntax_tree/node.rb#10495
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10515
+ # source://syntax_tree//lib/syntax_tree/node.rb#10499
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10519
+ # source://syntax_tree//lib/syntax_tree/node.rb#10503
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10515
+ # source://syntax_tree//lib/syntax_tree/node.rb#10499
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10528
+ # source://syntax_tree//lib/syntax_tree/node.rb#10512
def deconstruct_keys(_keys); end
# [String] the beginning of the symbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10504
+ # source://syntax_tree//lib/syntax_tree/node.rb#10488
def value; end
end
@@ -12019,35 +12245,35 @@ end
#
# :symbol
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10542
+# source://syntax_tree//lib/syntax_tree/node.rb#10526
class SyntaxTree::SymbolContent < ::SyntaxTree::Node
# @return [SymbolContent] a new instance of SymbolContent
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10547
+ # source://syntax_tree//lib/syntax_tree/node.rb#10531
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10573
+ # source://syntax_tree//lib/syntax_tree/node.rb#10557
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10552
+ # source://syntax_tree//lib/syntax_tree/node.rb#10536
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10556
+ # source://syntax_tree//lib/syntax_tree/node.rb#10540
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10560
+ # source://syntax_tree//lib/syntax_tree/node.rb#10544
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10556
+ # source://syntax_tree//lib/syntax_tree/node.rb#10540
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10569
+ # source://syntax_tree//lib/syntax_tree/node.rb#10553
def deconstruct_keys(_keys); end
# [Backtick | Const | CVar | GVar | Ident | IVar | Kw | Op] the value of the
# symbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10545
+ # source://syntax_tree//lib/syntax_tree/node.rb#10529
def value; end
end
@@ -12056,43 +12282,43 @@ end
#
# :symbol
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10583
+# source://syntax_tree//lib/syntax_tree/node.rb#10567
class SyntaxTree::SymbolLiteral < ::SyntaxTree::Node
# @return [SymbolLiteral] a new instance of SymbolLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10591
+ # source://syntax_tree//lib/syntax_tree/node.rb#10575
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10628
+ # source://syntax_tree//lib/syntax_tree/node.rb#10612
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10597
+ # source://syntax_tree//lib/syntax_tree/node.rb#10581
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10601
+ # source://syntax_tree//lib/syntax_tree/node.rb#10585
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10589
+ # source://syntax_tree//lib/syntax_tree/node.rb#10573
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10605
+ # source://syntax_tree//lib/syntax_tree/node.rb#10589
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10601
+ # source://syntax_tree//lib/syntax_tree/node.rb#10585
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10618
+ # source://syntax_tree//lib/syntax_tree/node.rb#10602
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10622
+ # source://syntax_tree//lib/syntax_tree/node.rb#10606
def format(q); end
# [Backtick | Const | CVar | GVar | Ident | IVar | Kw | Op | TStringContent]
# the value of the symbol
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10586
+ # source://syntax_tree//lib/syntax_tree/node.rb#10570
def value; end
end
@@ -12100,47 +12326,47 @@ end
#
# %I[one two three]
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10637
+# source://syntax_tree//lib/syntax_tree/node.rb#10621
class SyntaxTree::Symbols < ::SyntaxTree::Node
# @return [Symbols] a new instance of Symbols
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10647
+ # source://syntax_tree//lib/syntax_tree/node.rb#10631
def initialize(beginning:, elements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10703
+ # source://syntax_tree//lib/syntax_tree/node.rb#10687
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10654
+ # source://syntax_tree//lib/syntax_tree/node.rb#10638
def accept(visitor); end
# [SymbolsBeg] the token that opens this array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10639
+ # source://syntax_tree//lib/syntax_tree/node.rb#10623
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10658
+ # source://syntax_tree//lib/syntax_tree/node.rb#10642
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10645
+ # source://syntax_tree//lib/syntax_tree/node.rb#10629
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10662
+ # source://syntax_tree//lib/syntax_tree/node.rb#10646
def copy(beginning: T.unsafe(nil), elements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10658
+ # source://syntax_tree//lib/syntax_tree/node.rb#10642
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10672
+ # source://syntax_tree//lib/syntax_tree/node.rb#10656
def deconstruct_keys(_keys); end
# [Array[ Word ]] the words in the symbol array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10642
+ # source://syntax_tree//lib/syntax_tree/node.rb#10626
def elements; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10681
+ # source://syntax_tree//lib/syntax_tree/node.rb#10665
def format(q); end
end
@@ -12153,34 +12379,34 @@ end
# kinds of arrays can start with a lot of different delimiter types
# (e.g., %I| or %I<).
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10717
+# source://syntax_tree//lib/syntax_tree/node.rb#10701
class SyntaxTree::SymbolsBeg < ::SyntaxTree::Node
# @return [SymbolsBeg] a new instance of SymbolsBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10721
+ # source://syntax_tree//lib/syntax_tree/node.rb#10705
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10747
+ # source://syntax_tree//lib/syntax_tree/node.rb#10731
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10726
+ # source://syntax_tree//lib/syntax_tree/node.rb#10710
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10730
+ # source://syntax_tree//lib/syntax_tree/node.rb#10714
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10734
+ # source://syntax_tree//lib/syntax_tree/node.rb#10718
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10730
+ # source://syntax_tree//lib/syntax_tree/node.rb#10714
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10743
+ # source://syntax_tree//lib/syntax_tree/node.rb#10727
def deconstruct_keys(_keys); end
# [String] the beginning of the symbol literal array
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10719
+ # source://syntax_tree//lib/syntax_tree/node.rb#10703
def value; end
end
@@ -12191,34 +12417,34 @@ end
#
# In the example above the TLamBeg represents the +{+ operator.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10798
+# source://syntax_tree//lib/syntax_tree/node.rb#10782
class SyntaxTree::TLamBeg < ::SyntaxTree::Node
# @return [TLamBeg] a new instance of TLamBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10802
+ # source://syntax_tree//lib/syntax_tree/node.rb#10786
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10828
+ # source://syntax_tree//lib/syntax_tree/node.rb#10812
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10807
+ # source://syntax_tree//lib/syntax_tree/node.rb#10791
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10811
+ # source://syntax_tree//lib/syntax_tree/node.rb#10795
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10815
+ # source://syntax_tree//lib/syntax_tree/node.rb#10799
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10811
+ # source://syntax_tree//lib/syntax_tree/node.rb#10795
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10824
+ # source://syntax_tree//lib/syntax_tree/node.rb#10808
def deconstruct_keys(_keys); end
# [String] the beginning of the body of the lambda literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10800
+ # source://syntax_tree//lib/syntax_tree/node.rb#10784
def value; end
end
@@ -12228,34 +12454,34 @@ end
#
# In the example above the TLambda represents the +->+ operator.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10757
+# source://syntax_tree//lib/syntax_tree/node.rb#10741
class SyntaxTree::TLambda < ::SyntaxTree::Node
# @return [TLambda] a new instance of TLambda
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10761
+ # source://syntax_tree//lib/syntax_tree/node.rb#10745
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10787
+ # source://syntax_tree//lib/syntax_tree/node.rb#10771
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10766
+ # source://syntax_tree//lib/syntax_tree/node.rb#10750
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10770
+ # source://syntax_tree//lib/syntax_tree/node.rb#10754
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10774
+ # source://syntax_tree//lib/syntax_tree/node.rb#10758
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10770
+ # source://syntax_tree//lib/syntax_tree/node.rb#10754
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10783
+ # source://syntax_tree//lib/syntax_tree/node.rb#10767
def deconstruct_keys(_keys); end
# [String] the beginning of the lambda literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10759
+ # source://syntax_tree//lib/syntax_tree/node.rb#10743
def value; end
end
@@ -12269,34 +12495,34 @@ end
#
# %q{string}
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10950
+# source://syntax_tree//lib/syntax_tree/node.rb#10934
class SyntaxTree::TStringBeg < ::SyntaxTree::Node
# @return [TStringBeg] a new instance of TStringBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10954
+ # source://syntax_tree//lib/syntax_tree/node.rb#10938
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10980
+ # source://syntax_tree//lib/syntax_tree/node.rb#10964
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10959
+ # source://syntax_tree//lib/syntax_tree/node.rb#10943
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10963
+ # source://syntax_tree//lib/syntax_tree/node.rb#10947
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10967
+ # source://syntax_tree//lib/syntax_tree/node.rb#10951
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10963
+ # source://syntax_tree//lib/syntax_tree/node.rb#10947
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10976
+ # source://syntax_tree//lib/syntax_tree/node.rb#10960
def deconstruct_keys(_keys); end
# [String] the beginning of the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10952
+ # source://syntax_tree//lib/syntax_tree/node.rb#10936
def value; end
end
@@ -12309,47 +12535,47 @@ end
# In the example above, TStringContent represents the +string+ token contained
# within the string.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10993
+# source://syntax_tree//lib/syntax_tree/node.rb#10977
class SyntaxTree::TStringContent < ::SyntaxTree::Node
# @return [TStringContent] a new instance of TStringContent
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11000
+ # source://syntax_tree//lib/syntax_tree/node.rb#10984
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11039
+ # source://syntax_tree//lib/syntax_tree/node.rb#11023
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11010
+ # source://syntax_tree//lib/syntax_tree/node.rb#10994
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11014
+ # source://syntax_tree//lib/syntax_tree/node.rb#10998
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10998
+ # source://syntax_tree//lib/syntax_tree/node.rb#10982
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11018
+ # source://syntax_tree//lib/syntax_tree/node.rb#11002
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11014
+ # source://syntax_tree//lib/syntax_tree/node.rb#10998
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11031
+ # source://syntax_tree//lib/syntax_tree/node.rb#11015
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11035
+ # source://syntax_tree//lib/syntax_tree/node.rb#11019
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11006
+ # source://syntax_tree//lib/syntax_tree/node.rb#10990
def match?(pattern); end
# [String] the content of the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10995
+ # source://syntax_tree//lib/syntax_tree/node.rb#10979
def value; end
end
@@ -12363,34 +12589,34 @@ end
#
# %q{string}
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11054
+# source://syntax_tree//lib/syntax_tree/node.rb#11038
class SyntaxTree::TStringEnd < ::SyntaxTree::Node
# @return [TStringEnd] a new instance of TStringEnd
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11058
+ # source://syntax_tree//lib/syntax_tree/node.rb#11042
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11084
+ # source://syntax_tree//lib/syntax_tree/node.rb#11068
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11063
+ # source://syntax_tree//lib/syntax_tree/node.rb#11047
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11067
+ # source://syntax_tree//lib/syntax_tree/node.rb#11051
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11071
+ # source://syntax_tree//lib/syntax_tree/node.rb#11055
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11067
+ # source://syntax_tree//lib/syntax_tree/node.rb#11051
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11080
+ # source://syntax_tree//lib/syntax_tree/node.rb#11064
def deconstruct_keys(_keys); end
# [String] the end of the string
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11056
+ # source://syntax_tree//lib/syntax_tree/node.rb#11040
def value; end
end
@@ -12400,10 +12626,10 @@ end
# statement, and that statement must not be on the denied list of potential
# statements.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#6251
+# source://syntax_tree//lib/syntax_tree/node.rb#6254
module SyntaxTree::Ternaryable
class << self
- # source://syntax_tree//lib/syntax_tree/node.rb#6253
+ # source://syntax_tree//lib/syntax_tree/node.rb#6256
def call(q, node); end
private
@@ -12414,7 +12640,7 @@ module SyntaxTree::Ternaryable
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#6291
+ # source://syntax_tree//lib/syntax_tree/node.rb#6294
def ternaryable?(statement); end
end
end
@@ -12425,42 +12651,42 @@ end
#
# ::Constant = value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10839
+# source://syntax_tree//lib/syntax_tree/node.rb#10823
class SyntaxTree::TopConstField < ::SyntaxTree::Node
# @return [TopConstField] a new instance of TopConstField
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10846
+ # source://syntax_tree//lib/syntax_tree/node.rb#10830
def initialize(constant:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10882
+ # source://syntax_tree//lib/syntax_tree/node.rb#10866
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10852
+ # source://syntax_tree//lib/syntax_tree/node.rb#10836
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10856
+ # source://syntax_tree//lib/syntax_tree/node.rb#10840
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10844
+ # source://syntax_tree//lib/syntax_tree/node.rb#10828
def comments; end
# [Const] the constant being assigned
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10841
+ # source://syntax_tree//lib/syntax_tree/node.rb#10825
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10860
+ # source://syntax_tree//lib/syntax_tree/node.rb#10844
def copy(constant: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10856
+ # source://syntax_tree//lib/syntax_tree/node.rb#10840
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10873
+ # source://syntax_tree//lib/syntax_tree/node.rb#10857
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10877
+ # source://syntax_tree//lib/syntax_tree/node.rb#10861
def format(q); end
end
@@ -12469,42 +12695,42 @@ end
#
# ::Constant
#
-# source://syntax_tree//lib/syntax_tree/node.rb#10892
+# source://syntax_tree//lib/syntax_tree/node.rb#10876
class SyntaxTree::TopConstRef < ::SyntaxTree::Node
# @return [TopConstRef] a new instance of TopConstRef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10899
+ # source://syntax_tree//lib/syntax_tree/node.rb#10883
def initialize(constant:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10935
+ # source://syntax_tree//lib/syntax_tree/node.rb#10919
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10905
+ # source://syntax_tree//lib/syntax_tree/node.rb#10889
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10909
+ # source://syntax_tree//lib/syntax_tree/node.rb#10893
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10897
+ # source://syntax_tree//lib/syntax_tree/node.rb#10881
def comments; end
# [Const] the constant being referenced
#
- # source://syntax_tree//lib/syntax_tree/node.rb#10894
+ # source://syntax_tree//lib/syntax_tree/node.rb#10878
def constant; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10913
+ # source://syntax_tree//lib/syntax_tree/node.rb#10897
def copy(constant: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10909
+ # source://syntax_tree//lib/syntax_tree/node.rb#10893
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#10926
+ # source://syntax_tree//lib/syntax_tree/node.rb#10910
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#10930
+ # source://syntax_tree//lib/syntax_tree/node.rb#10914
def format(q); end
end
@@ -12535,47 +12761,47 @@ end
#
# !value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11177
+# source://syntax_tree//lib/syntax_tree/node.rb#11161
class SyntaxTree::Unary < ::SyntaxTree::Node
# @return [Unary] a new instance of Unary
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11187
+ # source://syntax_tree//lib/syntax_tree/node.rb#11171
def initialize(operator:, statement:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11230
+ # source://syntax_tree//lib/syntax_tree/node.rb#11214
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11194
+ # source://syntax_tree//lib/syntax_tree/node.rb#11178
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11198
+ # source://syntax_tree//lib/syntax_tree/node.rb#11182
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11185
+ # source://syntax_tree//lib/syntax_tree/node.rb#11169
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11202
+ # source://syntax_tree//lib/syntax_tree/node.rb#11186
def copy(operator: T.unsafe(nil), statement: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11198
+ # source://syntax_tree//lib/syntax_tree/node.rb#11182
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11216
+ # source://syntax_tree//lib/syntax_tree/node.rb#11200
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11225
+ # source://syntax_tree//lib/syntax_tree/node.rb#11209
def format(q); end
# [String] the operator being used
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11179
+ # source://syntax_tree//lib/syntax_tree/node.rb#11163
def operator; end
# [Node] the statement on which to operate
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11182
+ # source://syntax_tree//lib/syntax_tree/node.rb#11166
def statement; end
end
@@ -12583,42 +12809,42 @@ end
#
# undef method
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11240
+# source://syntax_tree//lib/syntax_tree/node.rb#11224
class SyntaxTree::Undef < ::SyntaxTree::Node
# @return [Undef] a new instance of Undef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11271
+ # source://syntax_tree//lib/syntax_tree/node.rb#11255
def initialize(symbols:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11314
+ # source://syntax_tree//lib/syntax_tree/node.rb#11298
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11277
+ # source://syntax_tree//lib/syntax_tree/node.rb#11261
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11281
+ # source://syntax_tree//lib/syntax_tree/node.rb#11265
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11269
+ # source://syntax_tree//lib/syntax_tree/node.rb#11253
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11285
+ # source://syntax_tree//lib/syntax_tree/node.rb#11269
def copy(symbols: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11281
+ # source://syntax_tree//lib/syntax_tree/node.rb#11265
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11298
+ # source://syntax_tree//lib/syntax_tree/node.rb#11282
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11302
+ # source://syntax_tree//lib/syntax_tree/node.rb#11286
def format(q); end
# [Array[ DynaSymbol | SymbolLiteral ]] the symbols to undefine
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11266
+ # source://syntax_tree//lib/syntax_tree/node.rb#11250
def symbols; end
end
@@ -12626,22 +12852,22 @@ end
# or SymbolLiteral objects. For SymbolLiteral objects we descend directly
# into the value in order to have it come out as bare words.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11244
+# source://syntax_tree//lib/syntax_tree/node.rb#11228
class SyntaxTree::Undef::UndefArgumentFormatter
# @return [UndefArgumentFormatter] a new instance of UndefArgumentFormatter
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11248
+ # source://syntax_tree//lib/syntax_tree/node.rb#11232
def initialize(node); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11252
+ # source://syntax_tree//lib/syntax_tree/node.rb#11236
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11260
+ # source://syntax_tree//lib/syntax_tree/node.rb#11244
def format(q); end
# [DynaSymbol | SymbolLiteral] the symbol to undefine
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11246
+ # source://syntax_tree//lib/syntax_tree/node.rb#11230
def node; end
end
@@ -12650,59 +12876,59 @@ end
# unless predicate
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11324
+# source://syntax_tree//lib/syntax_tree/node.rb#11308
class SyntaxTree::UnlessNode < ::SyntaxTree::Node
# @return [UnlessNode] a new instance of UnlessNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11337
+ # source://syntax_tree//lib/syntax_tree/node.rb#11321
def initialize(predicate:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11382
+ # source://syntax_tree//lib/syntax_tree/node.rb#11366
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11345
+ # source://syntax_tree//lib/syntax_tree/node.rb#11329
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11349
+ # source://syntax_tree//lib/syntax_tree/node.rb#11333
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11335
+ # source://syntax_tree//lib/syntax_tree/node.rb#11319
def comments; end
# [nil | Elsif | Else] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11332
+ # source://syntax_tree//lib/syntax_tree/node.rb#11316
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11353
+ # source://syntax_tree//lib/syntax_tree/node.rb#11337
def copy(predicate: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11349
+ # source://syntax_tree//lib/syntax_tree/node.rb#11333
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11368
+ # source://syntax_tree//lib/syntax_tree/node.rb#11352
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11378
+ # source://syntax_tree//lib/syntax_tree/node.rb#11362
def format(q); end
# Checks if the node was originally found in the modifier form.
#
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11388
+ # source://syntax_tree//lib/syntax_tree/node.rb#11372
def modifier?; end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11326
+ # source://syntax_tree//lib/syntax_tree/node.rb#11310
def predicate; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11329
+ # source://syntax_tree//lib/syntax_tree/node.rb#11313
def statements; end
end
@@ -12711,52 +12937,52 @@ end
# until predicate
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11470
+# source://syntax_tree//lib/syntax_tree/node.rb#11454
class SyntaxTree::UntilNode < ::SyntaxTree::Node
# @return [UntilNode] a new instance of UntilNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11480
+ # source://syntax_tree//lib/syntax_tree/node.rb#11464
def initialize(predicate:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11522
+ # source://syntax_tree//lib/syntax_tree/node.rb#11506
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11487
+ # source://syntax_tree//lib/syntax_tree/node.rb#11471
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11491
+ # source://syntax_tree//lib/syntax_tree/node.rb#11475
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11478
+ # source://syntax_tree//lib/syntax_tree/node.rb#11462
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11495
+ # source://syntax_tree//lib/syntax_tree/node.rb#11479
def copy(predicate: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11491
+ # source://syntax_tree//lib/syntax_tree/node.rb#11475
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11509
+ # source://syntax_tree//lib/syntax_tree/node.rb#11493
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11518
+ # source://syntax_tree//lib/syntax_tree/node.rb#11502
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11527
+ # source://syntax_tree//lib/syntax_tree/node.rb#11511
def modifier?; end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11472
+ # source://syntax_tree//lib/syntax_tree/node.rb#11456
def predicate; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11475
+ # source://syntax_tree//lib/syntax_tree/node.rb#11459
def statements; end
end
@@ -12765,50 +12991,50 @@ end
#
# variable
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11732
+# source://syntax_tree//lib/syntax_tree/node.rb#11716
class SyntaxTree::VCall < ::SyntaxTree::Node
# @return [VCall] a new instance of VCall
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11739
+ # source://syntax_tree//lib/syntax_tree/node.rb#11723
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11774
+ # source://syntax_tree//lib/syntax_tree/node.rb#11758
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11745
+ # source://syntax_tree//lib/syntax_tree/node.rb#11729
def accept(visitor); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11778
+ # source://syntax_tree//lib/syntax_tree/node.rb#11762
def access_control?; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11782
+ # source://syntax_tree//lib/syntax_tree/node.rb#11766
def arity; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11749
+ # source://syntax_tree//lib/syntax_tree/node.rb#11733
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11737
+ # source://syntax_tree//lib/syntax_tree/node.rb#11721
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11753
+ # source://syntax_tree//lib/syntax_tree/node.rb#11737
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11749
+ # source://syntax_tree//lib/syntax_tree/node.rb#11733
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11766
+ # source://syntax_tree//lib/syntax_tree/node.rb#11750
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11770
+ # source://syntax_tree//lib/syntax_tree/node.rb#11754
def format(q); end
# [Ident] the value of this expression
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11734
+ # source://syntax_tree//lib/syntax_tree/node.rb#11718
def value; end
end
@@ -12822,42 +13048,42 @@ SyntaxTree::VERSION = T.let(T.unsafe(nil), String)
#
# In the example above, the VarField node represents the +variable+ token.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11538
+# source://syntax_tree//lib/syntax_tree/node.rb#11522
class SyntaxTree::VarField < ::SyntaxTree::Node
# @return [VarField] a new instance of VarField
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11545
+ # source://syntax_tree//lib/syntax_tree/node.rb#11529
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11584
+ # source://syntax_tree//lib/syntax_tree/node.rb#11568
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11551
+ # source://syntax_tree//lib/syntax_tree/node.rb#11535
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11555
+ # source://syntax_tree//lib/syntax_tree/node.rb#11539
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11543
+ # source://syntax_tree//lib/syntax_tree/node.rb#11527
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11559
+ # source://syntax_tree//lib/syntax_tree/node.rb#11543
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11555
+ # source://syntax_tree//lib/syntax_tree/node.rb#11539
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11572
+ # source://syntax_tree//lib/syntax_tree/node.rb#11556
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11576
+ # source://syntax_tree//lib/syntax_tree/node.rb#11560
def format(q); end
# [nil | :nil | Const | CVar | GVar | Ident | IVar] the target of this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11540
+ # source://syntax_tree//lib/syntax_tree/node.rb#11524
def value; end
end
@@ -12870,37 +13096,37 @@ end
# keyword (like +self+, +nil+, +true+, or +false+), or a numbered block
# variable.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11597
+# source://syntax_tree//lib/syntax_tree/node.rb#11581
class SyntaxTree::VarRef < ::SyntaxTree::Node
# @return [VarRef] a new instance of VarRef
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11604
+ # source://syntax_tree//lib/syntax_tree/node.rb#11588
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11639
+ # source://syntax_tree//lib/syntax_tree/node.rb#11623
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11610
+ # source://syntax_tree//lib/syntax_tree/node.rb#11594
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11614
+ # source://syntax_tree//lib/syntax_tree/node.rb#11598
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11602
+ # source://syntax_tree//lib/syntax_tree/node.rb#11586
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11618
+ # source://syntax_tree//lib/syntax_tree/node.rb#11602
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11614
+ # source://syntax_tree//lib/syntax_tree/node.rb#11598
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11631
+ # source://syntax_tree//lib/syntax_tree/node.rb#11615
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11635
+ # source://syntax_tree//lib/syntax_tree/node.rb#11619
def format(q); end
# Oh man I hate this so much. Basically, ripper doesn't provide enough
@@ -12911,12 +13137,12 @@ class SyntaxTree::VarRef < ::SyntaxTree::Node
# To be clear, this method should just not exist. It's not good. It's a
# place of shame. But it's necessary for now, so I'm keeping it.
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11650
+ # source://syntax_tree//lib/syntax_tree/node.rb#11634
def pin(parent, pin); end
# [Const | CVar | GVar | Ident | IVar | Kw] the value of this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11599
+ # source://syntax_tree//lib/syntax_tree/node.rb#11583
def value; end
end
@@ -13681,37 +13907,37 @@ end
#
# ;;
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11791
+# source://syntax_tree//lib/syntax_tree/node.rb#11775
class SyntaxTree::VoidStmt < ::SyntaxTree::Node
# @return [VoidStmt] a new instance of VoidStmt
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11795
+ # source://syntax_tree//lib/syntax_tree/node.rb#11779
def initialize(location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11824
+ # source://syntax_tree//lib/syntax_tree/node.rb#11808
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11800
+ # source://syntax_tree//lib/syntax_tree/node.rb#11784
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11804
+ # source://syntax_tree//lib/syntax_tree/node.rb#11788
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11793
+ # source://syntax_tree//lib/syntax_tree/node.rb#11777
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11808
+ # source://syntax_tree//lib/syntax_tree/node.rb#11792
def copy(location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11804
+ # source://syntax_tree//lib/syntax_tree/node.rb#11788
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11817
+ # source://syntax_tree//lib/syntax_tree/node.rb#11801
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11821
+ # source://syntax_tree//lib/syntax_tree/node.rb#11805
def format(q); end
end
@@ -13721,68 +13947,68 @@ end
# when predicate
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11835
+# source://syntax_tree//lib/syntax_tree/node.rb#11819
class SyntaxTree::When < ::SyntaxTree::Node
# @return [When] a new instance of When
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11848
+ # source://syntax_tree//lib/syntax_tree/node.rb#11832
def initialize(arguments:, statements:, consequent:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11940
+ # source://syntax_tree//lib/syntax_tree/node.rb#11924
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11856
+ # source://syntax_tree//lib/syntax_tree/node.rb#11840
def accept(visitor); end
# [Args] the arguments to the when clause
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11837
+ # source://syntax_tree//lib/syntax_tree/node.rb#11821
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11860
+ # source://syntax_tree//lib/syntax_tree/node.rb#11844
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11846
+ # source://syntax_tree//lib/syntax_tree/node.rb#11830
def comments; end
# [nil | Else | When] the next clause in the chain
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11843
+ # source://syntax_tree//lib/syntax_tree/node.rb#11827
def consequent; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11864
+ # source://syntax_tree//lib/syntax_tree/node.rb#11848
def copy(arguments: T.unsafe(nil), statements: T.unsafe(nil), consequent: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11860
+ # source://syntax_tree//lib/syntax_tree/node.rb#11844
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11879
+ # source://syntax_tree//lib/syntax_tree/node.rb#11863
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11905
+ # source://syntax_tree//lib/syntax_tree/node.rb#11889
def format(q); end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11840
+ # source://syntax_tree//lib/syntax_tree/node.rb#11824
def statements; end
end
# We're going to keep a single instance of this separator around so we don't
# have to allocate a new one every time we format a when clause.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11903
+# source://syntax_tree//lib/syntax_tree/node.rb#11887
SyntaxTree::When::SEPARATOR = T.let(T.unsafe(nil), SyntaxTree::When::Separator)
# We have a special separator here for when clauses which causes them to
# fill as much of the line as possible as opposed to everything breaking
# into its own line as soon as you hit the print limit.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11892
+# source://syntax_tree//lib/syntax_tree/node.rb#11876
class SyntaxTree::When::Separator
- # source://syntax_tree//lib/syntax_tree/node.rb#11893
+ # source://syntax_tree//lib/syntax_tree/node.rb#11877
def call(q); end
end
@@ -13791,52 +14017,52 @@ end
# while predicate
# end
#
-# source://syntax_tree//lib/syntax_tree/node.rb#11951
+# source://syntax_tree//lib/syntax_tree/node.rb#11935
class SyntaxTree::WhileNode < ::SyntaxTree::Node
# @return [WhileNode] a new instance of WhileNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11961
+ # source://syntax_tree//lib/syntax_tree/node.rb#11945
def initialize(predicate:, statements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12003
+ # source://syntax_tree//lib/syntax_tree/node.rb#11987
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11968
+ # source://syntax_tree//lib/syntax_tree/node.rb#11952
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11972
+ # source://syntax_tree//lib/syntax_tree/node.rb#11956
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11959
+ # source://syntax_tree//lib/syntax_tree/node.rb#11943
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11976
+ # source://syntax_tree//lib/syntax_tree/node.rb#11960
def copy(predicate: T.unsafe(nil), statements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11972
+ # source://syntax_tree//lib/syntax_tree/node.rb#11956
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#11990
+ # source://syntax_tree//lib/syntax_tree/node.rb#11974
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#11999
+ # source://syntax_tree//lib/syntax_tree/node.rb#11983
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12008
+ # source://syntax_tree//lib/syntax_tree/node.rb#11992
def modifier?; end
# [Node] the expression to be checked
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11953
+ # source://syntax_tree//lib/syntax_tree/node.rb#11937
def predicate; end
# [Statements] the expressions to be executed
#
- # source://syntax_tree//lib/syntax_tree/node.rb#11956
+ # source://syntax_tree//lib/syntax_tree/node.rb#11940
def statements; end
end
@@ -13875,13 +14101,13 @@ module SyntaxTree::WithScope
# Visit for capturing local variables defined in regex named capture groups
#
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#239
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#236
def visit_binary(node); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#192
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#189
def visit_block_var(node); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#185
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#182
def visit_blockarg(node); end
# Visits for nodes that create new scopes, such as classes, modules
@@ -13893,10 +14119,10 @@ module SyntaxTree::WithScope
# source://syntax_tree//lib/syntax_tree/with_scope.rb#147
def visit_def(node); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#178
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#175
def visit_kwrest_param(node); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#192
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#189
def visit_lambda_var(node); end
# When we find a method invocation with a block, only the code that happens
@@ -13917,36 +14143,36 @@ module SyntaxTree::WithScope
# Visit for keeping track of local variable definitions
#
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#210
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#207
def visit_pinned_var_ref(node); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#171
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#168
def visit_rest_param(node); end
# Visit for keeping track of local variable definitions
#
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#202
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#199
def visit_var_field(node); end
# Visits for keeping track of variable and argument usages
#
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#218
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#215
def visit_var_ref(node); end
# When using regex named capture groups, vcalls might actually be a variable
#
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#230
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#227
def visit_vcall(node); end
private
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#288
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#285
def add_argument_definitions(list); end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#302
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#299
def next_scope_id; end
- # source://syntax_tree//lib/syntax_tree/with_scope.rb#306
+ # source://syntax_tree//lib/syntax_tree/with_scope.rb#303
def with_scope(parent_scope = T.unsafe(nil)); end
end
@@ -14044,48 +14270,48 @@ end
# In the example above, there would be two Word nodes within a parent Words
# node.
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12020
+# source://syntax_tree//lib/syntax_tree/node.rb#12004
class SyntaxTree::Word < ::SyntaxTree::Node
# @return [Word] a new instance of Word
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12028
+ # source://syntax_tree//lib/syntax_tree/node.rb#12012
def initialize(parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12067
+ # source://syntax_tree//lib/syntax_tree/node.rb#12051
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12038
+ # source://syntax_tree//lib/syntax_tree/node.rb#12022
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12042
+ # source://syntax_tree//lib/syntax_tree/node.rb#12026
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12026
+ # source://syntax_tree//lib/syntax_tree/node.rb#12010
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12046
+ # source://syntax_tree//lib/syntax_tree/node.rb#12030
def copy(parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12042
+ # source://syntax_tree//lib/syntax_tree/node.rb#12026
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12059
+ # source://syntax_tree//lib/syntax_tree/node.rb#12043
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12063
+ # source://syntax_tree//lib/syntax_tree/node.rb#12047
def format(q); end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12034
+ # source://syntax_tree//lib/syntax_tree/node.rb#12018
def match?(pattern); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# word
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12023
+ # source://syntax_tree//lib/syntax_tree/node.rb#12007
def parts; end
end
@@ -14093,47 +14319,47 @@ end
#
# %W[one two three]
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12076
+# source://syntax_tree//lib/syntax_tree/node.rb#12060
class SyntaxTree::Words < ::SyntaxTree::Node
# @return [Words] a new instance of Words
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12086
+ # source://syntax_tree//lib/syntax_tree/node.rb#12070
def initialize(beginning:, elements:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12142
+ # source://syntax_tree//lib/syntax_tree/node.rb#12126
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12093
+ # source://syntax_tree//lib/syntax_tree/node.rb#12077
def accept(visitor); end
# [WordsBeg] the token that opens this array literal
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12078
+ # source://syntax_tree//lib/syntax_tree/node.rb#12062
def beginning; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12097
+ # source://syntax_tree//lib/syntax_tree/node.rb#12081
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12084
+ # source://syntax_tree//lib/syntax_tree/node.rb#12068
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12101
+ # source://syntax_tree//lib/syntax_tree/node.rb#12085
def copy(beginning: T.unsafe(nil), elements: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12097
+ # source://syntax_tree//lib/syntax_tree/node.rb#12081
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12111
+ # source://syntax_tree//lib/syntax_tree/node.rb#12095
def deconstruct_keys(_keys); end
# [Array[ Word ]] the elements of this array
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12081
+ # source://syntax_tree//lib/syntax_tree/node.rb#12065
def elements; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12120
+ # source://syntax_tree//lib/syntax_tree/node.rb#12104
def format(q); end
end
@@ -14146,34 +14372,34 @@ end
# Note that these kinds of arrays can start with a lot of different delimiter
# types (e.g., %W| or %W<).
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12156
+# source://syntax_tree//lib/syntax_tree/node.rb#12140
class SyntaxTree::WordsBeg < ::SyntaxTree::Node
# @return [WordsBeg] a new instance of WordsBeg
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12160
+ # source://syntax_tree//lib/syntax_tree/node.rb#12144
def initialize(value:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12186
+ # source://syntax_tree//lib/syntax_tree/node.rb#12170
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12165
+ # source://syntax_tree//lib/syntax_tree/node.rb#12149
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12169
+ # source://syntax_tree//lib/syntax_tree/node.rb#12153
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12173
+ # source://syntax_tree//lib/syntax_tree/node.rb#12157
def copy(value: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12169
+ # source://syntax_tree//lib/syntax_tree/node.rb#12153
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12182
+ # source://syntax_tree//lib/syntax_tree/node.rb#12166
def deconstruct_keys(_keys); end
# [String] the start of the word literal array
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12158
+ # source://syntax_tree//lib/syntax_tree/node.rb#12142
def value; end
end
@@ -14181,35 +14407,35 @@ end
#
# `ls`
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12195
+# source://syntax_tree//lib/syntax_tree/node.rb#12179
class SyntaxTree::XString < ::SyntaxTree::Node
# @return [XString] a new instance of XString
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12200
+ # source://syntax_tree//lib/syntax_tree/node.rb#12184
def initialize(parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12226
+ # source://syntax_tree//lib/syntax_tree/node.rb#12210
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12205
+ # source://syntax_tree//lib/syntax_tree/node.rb#12189
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12209
+ # source://syntax_tree//lib/syntax_tree/node.rb#12193
def child_nodes; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12213
+ # source://syntax_tree//lib/syntax_tree/node.rb#12197
def copy(parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12209
+ # source://syntax_tree//lib/syntax_tree/node.rb#12193
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12222
+ # source://syntax_tree//lib/syntax_tree/node.rb#12206
def deconstruct_keys(_keys); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# xstring
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12198
+ # source://syntax_tree//lib/syntax_tree/node.rb#12182
def parts; end
end
@@ -14217,43 +14443,43 @@ end
#
# `ls`
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12235
+# source://syntax_tree//lib/syntax_tree/node.rb#12219
class SyntaxTree::XStringLiteral < ::SyntaxTree::Node
# @return [XStringLiteral] a new instance of XStringLiteral
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12243
+ # source://syntax_tree//lib/syntax_tree/node.rb#12227
def initialize(parts:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12280
+ # source://syntax_tree//lib/syntax_tree/node.rb#12264
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12249
+ # source://syntax_tree//lib/syntax_tree/node.rb#12233
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12253
+ # source://syntax_tree//lib/syntax_tree/node.rb#12237
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12241
+ # source://syntax_tree//lib/syntax_tree/node.rb#12225
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12257
+ # source://syntax_tree//lib/syntax_tree/node.rb#12241
def copy(parts: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12253
+ # source://syntax_tree//lib/syntax_tree/node.rb#12237
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12270
+ # source://syntax_tree//lib/syntax_tree/node.rb#12254
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12274
+ # source://syntax_tree//lib/syntax_tree/node.rb#12258
def format(q); end
# [Array[ StringEmbExpr | StringDVar | TStringContent ]] the parts of the
# xstring
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12238
+ # source://syntax_tree//lib/syntax_tree/node.rb#12222
def parts; end
end
@@ -14264,7 +14490,7 @@ module SyntaxTree::YARV
class << self
# A convenience method for creating a CallData object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#82
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#88
def calldata(method, argc = T.unsafe(nil), flags = T.unsafe(nil), kw_arg = T.unsafe(nil)); end
# Compile the given source into a YARV instruction sequence.
@@ -14372,54 +14598,54 @@ end
class SyntaxTree::YARV::Assembler
# @return [Assembler] a new instance of Assembler
#
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#67
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#66
def initialize(lines); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#71
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#70
def assemble; end
# Returns the value of attribute lines.
#
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#65
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#64
def lines; end
private
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#89
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#88
def assemble_iseq(iseq, lines); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#409
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#408
def find_local(iseq, operands); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#418
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#417
def parse(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#450
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#449
def parse_calldata(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#445
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#444
def parse_nested(lines); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#433
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#432
def parse_number(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#425
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#424
def parse_options(value, options); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#437
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#436
def parse_string(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#441
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#440
def parse_symbol(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#429
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#428
def parse_type(value, type); end
class << self
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#79
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#78
def assemble(source); end
- # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#83
+ # source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#82
def assemble_file(filepath); end
end
end
@@ -14427,7 +14653,7 @@ end
# source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#28
SyntaxTree::YARV::Assembler::CALLDATA_FLAGS = T.let(T.unsafe(nil), Hash)
-# source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#44
+# source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#43
SyntaxTree::YARV::Assembler::DEFINED_TYPES = T.let(T.unsafe(nil), Array)
# source://syntax_tree//lib/syntax_tree/yarv/assembler.rb#6
@@ -14721,83 +14947,80 @@ end
class SyntaxTree::YARV::CallData
# @return [CallData] a new instance of CallData
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#24
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#31
def initialize(method, argc = T.unsafe(nil), flags = T.unsafe(nil), kw_arg = T.unsafe(nil)); end
# Returns the value of attribute argc.
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#22
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#29
def argc; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#36
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#43
def flag?(mask); end
# Returns the value of attribute flags.
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#22
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#29
def flags; end
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#46
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#53
def inspect; end
# Returns the value of attribute kw_arg.
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#22
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#29
def kw_arg; end
# Returns the value of attribute method.
#
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#22
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#29
def method; end
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#40
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#47
def to_h; end
class << self
- # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#71
+ # source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#77
def from(serialized); end
end
end
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#9
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_ARGS_BLOCKARG = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#12
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_ARGS_SIMPLE = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#8
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_ARGS_SPLAT = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#13
-SyntaxTree::YARV::CallData::CALL_BLOCKISEQ = T.let(T.unsafe(nil), Integer)
-
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#10
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_FCALL = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#14
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_KWARG = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#15
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_KW_SPLAT = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#20
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_KW_SPLAT_MUT = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#19
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_OPT_SEND = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#17
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_SUPER = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#16
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_TAILCALL = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#11
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_VCALL = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#18
+# source://syntax_tree//lib/syntax_tree/yarv/calldata.rb#27
SyntaxTree::YARV::CallData::CALL_ZSUPER = T.let(T.unsafe(nil), Integer)
# ### Summary
@@ -17769,10 +17992,10 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#168
def initialize(name, file, line, type, parent_iseq = T.unsafe(nil), options = T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#636
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#652
def adjuststack(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#640
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#656
def anytostring; end
# Returns the value of attribute argument_options.
@@ -17792,34 +18015,34 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#142
def argument_size=(_arg0); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#456
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#472
def block_child_iseq(line); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#644
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#660
def branchif(label); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#648
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#664
def branchnil(label); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#652
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#668
def branchunless(label); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#549
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#565
def catch_break(iseq, begin_label, end_label, exit_label, restore_sp); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#559
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#575
def catch_ensure(iseq, begin_label, end_label, exit_label, restore_sp); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#569
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#585
def catch_next(begin_label, end_label, exit_label, restore_sp); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#579
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#595
def catch_redo(begin_label, end_label, exit_label, restore_sp); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#589
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#605
def catch_rescue(iseq, begin_label, end_label, exit_label, restore_sp); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#599
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#615
def catch_retry(begin_label, end_label, exit_label, restore_sp); end
# The catch table for this instruction sequence.
@@ -17827,21 +18050,21 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#146
def catch_table; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#656
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#672
def checkkeyword(keyword_bits_index, keyword_index); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#660
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#676
def checkmatch(type); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#664
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#680
def checktype(type); end
# Child instruction sequence methods
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#452
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#468
def child_iseq(name, line, type); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#462
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#478
def class_child_iseq(name, line); end
# This method converts our linked list of instructions into a final array
@@ -17850,49 +18073,49 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#305
def compile!; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#668
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#684
def concatarray; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#672
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#688
def concatstrings(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#676
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#692
def defineclass(name, class_iseq, flags); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#680
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#696
def defined(type, name, message); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#684
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#700
def definedivar(name, cache, message); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#693
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#709
def definemethod(name, method_iseq); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#697
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#713
def definesmethod(name, method_iseq); end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#292
def disasm; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#701
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#717
def dup; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#705
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#721
def duparray(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#709
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#725
def duphash(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#713
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#729
def dupn(number); end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#232
def eval; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#632
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#648
def event(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#717
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#733
def expandarray(length, flags); end
# The source location of the instruction sequence.
@@ -17900,28 +18123,28 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#132
def file; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#721
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#737
def getblockparam(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#725
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#741
def getblockparamproxy(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#729
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#745
def getclassvariable(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#737
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#753
def getconstant(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#741
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#757
def getglobal(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#745
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#761
def getinstancevariable(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#753
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#769
def getlocal(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#772
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#788
def getspecial(key, type); end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#207
@@ -17944,24 +18167,24 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#299
def inspect; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#776
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#792
def intern; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#780
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#796
def invokeblock(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#784
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#800
def invokesuper(calldata, block_iseq); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#788
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#804
def jump(label); end
# Instruction push methods
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#613
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#629
def label; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#792
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#808
def leave; end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#219
@@ -17982,10 +18205,10 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#199
def local_variable(name, level = T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#466
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#482
def method_child_iseq(name, line); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#470
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#486
def module_child_iseq(name, line); end
# The name of the instruction sequence.
@@ -17993,43 +18216,43 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#129
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#796
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#812
def newarray(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#800
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#816
def newarraykwsplat(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#804
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#820
def newhash(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#808
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#824
def newrange(exclude_end); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#812
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#828
def nop; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#816
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#832
def objtostring(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#820
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#836
def once(iseq, cache); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#824
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#840
def opt_aref_with(object, calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#828
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#844
def opt_aset_with(object, calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#832
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#848
def opt_case_dispatch(case_dispatch_hash, else_label); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#836
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#852
def opt_getconstant_path(names); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#872
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#888
def opt_getinlinecache(label, cache); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#876
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#892
def opt_setinlinecache(cache); end
# These are various compilation options provided.
@@ -18042,61 +18265,61 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#138
def parent_iseq; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#880
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#896
def pop; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#617
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#633
def push(value); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#884
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#900
def putnil; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#888
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#904
def putobject(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#906
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#922
def putself; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#910
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#926
def putspecialobject(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#914
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#930
def putstring(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#918
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#934
def send(calldata, block_iseq = T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#922
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#938
def setblockparam(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#926
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#942
def setclassvariable(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#934
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#950
def setconstant(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#938
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#954
def setglobal(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#942
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#958
def setinstancevariable(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#950
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#966
def setlocal(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#969
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#985
def setn(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#973
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#989
def setspecial(key); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#474
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#490
def singleton_class_child_iseq(line); end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#341
def specialize_instructions!; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#977
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#993
def splatarray(flag); end
# An object that will track the current size of the stack and the
@@ -18110,10 +18333,10 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#159
def storage_index; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#981
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#997
def swap; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#985
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#1001
def throw(type); end
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#236
@@ -18128,10 +18351,10 @@ class SyntaxTree::YARV::InstructionSequence
# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#288
def to_son; end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#989
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#1005
def topn(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#993
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#1009
def toregexp(options, length); end
# The type of the instruction sequence.
@@ -18143,7 +18366,7 @@ class SyntaxTree::YARV::InstructionSequence
# This method will create a new instruction sequence from a serialized
# RubyVM::InstructionSequence object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#999
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#1015
def from(source, options = T.unsafe(nil), parent_iseq = T.unsafe(nil)); end
# This provides a handle to the rb_iseq_load function, which allows you
@@ -18155,74 +18378,74 @@ class SyntaxTree::YARV::InstructionSequence
end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#494
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#510
class SyntaxTree::YARV::InstructionSequence::CatchBreak < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#495
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#511
def to_a; end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#507
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#523
class SyntaxTree::YARV::InstructionSequence::CatchEnsure < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#508
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#524
def to_a; end
end
# Catch table methods
#
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#482
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#498
class SyntaxTree::YARV::InstructionSequence::CatchEntry
# @return [CatchEntry] a new instance of CatchEntry
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#485
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#501
def initialize(iseq, begin_label, end_label, exit_label, restore_sp); end
# Returns the value of attribute begin_label.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#483
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#499
def begin_label; end
# Returns the value of attribute end_label.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#483
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#499
def end_label; end
# Returns the value of attribute exit_label.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#483
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#499
def exit_label; end
# Returns the value of attribute iseq.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#483
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#499
def iseq; end
# Returns the value of attribute restore_sp.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#483
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#499
def restore_sp; end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#519
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#535
class SyntaxTree::YARV::InstructionSequence::CatchNext < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#520
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#536
def to_a; end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#525
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#541
class SyntaxTree::YARV::InstructionSequence::CatchRedo < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#526
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#542
def to_a; end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#531
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#547
class SyntaxTree::YARV::InstructionSequence::CatchRescue < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#532
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#548
def to_a; end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#543
+# source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#559
class SyntaxTree::YARV::InstructionSequence::CatchRetry < ::SyntaxTree::YARV::InstructionSequence::CatchEntry
- # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#544
+ # source://syntax_tree//lib/syntax_tree/yarv/instruction_sequence.rb#560
def to_a; end
end
@@ -18705,6 +18928,104 @@ class SyntaxTree::YARV::Legacy::OptGetInlineCache < ::SyntaxTree::YARV::Instruct
def to_a(_iseq); end
end
+# ### Summary
+#
+# `opt_newarray_max` is a specialization that occurs when the `max` method
+# is called on an array literal. It pops the values of the array off the
+# stack and pushes on the result.
+#
+# ### Usage
+#
+# ~~~ruby
+# [a, b, c].max
+# ~~~
+#
+# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#139
+class SyntaxTree::YARV::Legacy::OptNewArrayMax < ::SyntaxTree::YARV::Instruction
+ # @return [OptNewArrayMax] a new instance of OptNewArrayMax
+ #
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#142
+ def initialize(number); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#158
+ def ==(other); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#174
+ def call(vm); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#154
+ def deconstruct_keys(_keys); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#146
+ def disasm(fmt); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#162
+ def length; end
+
+ # Returns the value of attribute number.
+ #
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#140
+ def number; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#166
+ def pops; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#170
+ def pushes; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#150
+ def to_a(_iseq); end
+end
+
+# ### Summary
+#
+# `opt_newarray_min` is a specialization that occurs when the `min` method
+# is called on an array literal. It pops the values of the array off the
+# stack and pushes on the result.
+#
+# ### Usage
+#
+# ~~~ruby
+# [a, b, c].min
+# ~~~
+#
+# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#191
+class SyntaxTree::YARV::Legacy::OptNewArrayMin < ::SyntaxTree::YARV::Instruction
+ # @return [OptNewArrayMin] a new instance of OptNewArrayMin
+ #
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#194
+ def initialize(number); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#210
+ def ==(other); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#226
+ def call(vm); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#206
+ def deconstruct_keys(_keys); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#198
+ def disasm(fmt); end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#214
+ def length; end
+
+ # Returns the value of attribute number.
+ #
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#192
+ def number; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#218
+ def pops; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#222
+ def pushes; end
+
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#202
+ def to_a(_iseq); end
+end
+
# ### Summary
#
# `opt_setinlinecache` sets an inline cache for a constant lookup. It pops
@@ -18720,40 +19041,40 @@ end
# Constant
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#142
+# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#246
class SyntaxTree::YARV::Legacy::OptSetInlineCache < ::SyntaxTree::YARV::Instruction
# @return [OptSetInlineCache] a new instance of OptSetInlineCache
#
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#145
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#249
def initialize(cache); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#161
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#265
def ==(other); end
# Returns the value of attribute cache.
#
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#143
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#247
def cache; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#177
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#281
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#157
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#261
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#149
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#253
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#165
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#269
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#169
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#273
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#173
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#277
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#153
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#257
def to_a(_iseq); end
end
@@ -18771,40 +19092,40 @@ end
# @@class_variable = 1
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#195
+# source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#299
class SyntaxTree::YARV::Legacy::SetClassVariable < ::SyntaxTree::YARV::Instruction
# @return [SetClassVariable] a new instance of SetClassVariable
#
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#198
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#302
def initialize(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#214
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#318
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#230
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#334
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#226
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#330
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#210
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#314
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#202
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#306
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#218
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#322
def length; end
# Returns the value of attribute name.
#
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#196
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#300
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#222
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#326
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#206
+ # source://syntax_tree//lib/syntax_tree/yarv/legacy.rb#310
def to_a(_iseq); end
end
@@ -20337,9 +20658,10 @@ end
# ### Summary
#
-# `opt_newarray_max` is a specialization that occurs when the `max` method
-# is called on an array literal. It pops the values of the array off the
-# stack and pushes on the result.
+# `opt_newarray_send` is a specialization that occurs when a dynamic array
+# literal is created and immediately sent the `min`, `max`, or `hash`
+# methods. It pops the values of the array off the stack and pushes on the
+# result of the method call.
#
# ### Usage
#
@@ -20347,89 +20669,45 @@ end
# [a, b, c].max
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3831
-class SyntaxTree::YARV::OptNewArrayMax < ::SyntaxTree::YARV::Instruction
- # @return [OptNewArrayMax] a new instance of OptNewArrayMax
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3832
+class SyntaxTree::YARV::OptNewArraySend < ::SyntaxTree::YARV::Instruction
+ # @return [OptNewArraySend] a new instance of OptNewArraySend
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3834
- def initialize(number); end
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3835
+ def initialize(number, method); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3850
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3855
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3866
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3872
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3846
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3851
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3838
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3840
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3854
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3860
def length; end
- # Returns the value of attribute number.
- #
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3832
- def number; end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3858
- def pops; end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3862
- def pushes; end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3842
- def to_a(_iseq); end
-end
-
-# ### Summary
-#
-# `opt_newarray_min` is a specialization that occurs when the `min` method
-# is called on an array literal. It pops the values of the array off the
-# stack and pushes on the result.
-#
-# ### Usage
-#
-# ~~~ruby
-# [a, b, c].min
-# ~~~
-#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3883
-class SyntaxTree::YARV::OptNewArrayMin < ::SyntaxTree::YARV::Instruction
- # @return [OptNewArrayMin] a new instance of OptNewArrayMin
+ # Returns the value of attribute method.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3886
- def initialize(number); end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3902
- def ==(other); end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3918
- def call(vm); end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3898
- def deconstruct_keys(_keys); end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3890
- def disasm(fmt); end
-
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3906
- def length; end
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3833
+ def method; end
# Returns the value of attribute number.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3884
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3833
def number; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3910
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3864
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3914
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3868
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3894
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3847
def to_a(_iseq); end
end
@@ -20446,43 +20724,43 @@ end
# "".nil?
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3936
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3890
class SyntaxTree::YARV::OptNilP < ::SyntaxTree::YARV::Instruction
# @return [OptNilP] a new instance of OptNilP
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3939
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3893
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3955
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3909
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3975
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3929
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3937
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3891
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3971
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3925
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3951
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3905
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3943
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3897
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3959
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3913
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3963
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3917
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3967
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3921
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3947
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3901
def to_a(_iseq); end
end
@@ -20497,43 +20775,43 @@ end
# !true
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3991
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3945
class SyntaxTree::YARV::OptNot < ::SyntaxTree::YARV::Instruction
# @return [OptNot] a new instance of OptNot
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3994
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3948
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4010
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3964
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4030
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3984
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3992
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3946
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4026
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3980
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4006
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3960
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3998
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3952
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4014
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3968
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4018
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3972
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4022
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3976
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4002
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#3956
def to_a(_iseq); end
end
@@ -20550,43 +20828,43 @@ end
# 2 | 3
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4048
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4002
class SyntaxTree::YARV::OptOr < ::SyntaxTree::YARV::Instruction
# @return [OptOr] a new instance of OptOr
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4051
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4005
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4067
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4021
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4087
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4041
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4049
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4003
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4083
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4037
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4063
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4017
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4055
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4009
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4071
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4025
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4075
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4029
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4079
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4033
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4059
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4013
def to_a(_iseq); end
end
@@ -20603,43 +20881,43 @@ end
# 2 + 3
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4105
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4059
class SyntaxTree::YARV::OptPlus < ::SyntaxTree::YARV::Instruction
# @return [OptPlus] a new instance of OptPlus
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4108
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4062
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4124
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4078
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4144
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4098
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4106
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4060
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4140
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4094
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4120
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4074
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4112
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4066
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4128
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4082
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4132
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4086
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4136
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4090
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4116
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4070
def to_a(_iseq); end
end
@@ -20655,43 +20933,43 @@ end
# /a/ =~ "a"
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4161
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4115
class SyntaxTree::YARV::OptRegExpMatch2 < ::SyntaxTree::YARV::Instruction
# @return [OptRegExpMatch2] a new instance of OptRegExpMatch2
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4164
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4118
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4180
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4134
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4200
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4154
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4162
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4116
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4196
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4150
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4176
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4130
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4168
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4122
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4184
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4138
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4188
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4142
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4192
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4146
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4172
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4126
def to_a(_iseq); end
end
@@ -20707,43 +20985,43 @@ end
# puts "Hello, world!"
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4217
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4171
class SyntaxTree::YARV::OptSendWithoutBlock < ::SyntaxTree::YARV::Instruction
# @return [OptSendWithoutBlock] a new instance of OptSendWithoutBlock
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4220
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4174
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4236
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4190
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4256
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4210
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4218
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4172
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4252
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4206
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4232
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4186
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4224
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4178
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4240
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4194
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4244
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4198
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4248
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4202
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4228
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4182
def to_a(_iseq); end
end
@@ -20760,43 +21038,43 @@ end
# "".size
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4274
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4228
class SyntaxTree::YARV::OptSize < ::SyntaxTree::YARV::Instruction
# @return [OptSize] a new instance of OptSize
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4277
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4231
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4293
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4247
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4313
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4267
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4275
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4229
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4309
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4263
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4289
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4243
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4281
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4235
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4297
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4251
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4301
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4255
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4305
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4259
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4285
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4239
def to_a(_iseq); end
end
@@ -20812,42 +21090,42 @@ end
# "hello".freeze
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4330
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4284
class SyntaxTree::YARV::OptStrFreeze < ::SyntaxTree::YARV::Instruction
# @return [OptStrFreeze] a new instance of OptStrFreeze
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4333
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4287
def initialize(object, calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4353
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4307
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4366
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4320
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4331
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4285
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4349
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4303
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4338
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4292
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4358
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4312
def length; end
# Returns the value of attribute object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4331
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4285
def object; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4362
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4316
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4345
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4299
def to_a(_iseq); end
end
@@ -20863,42 +21141,42 @@ end
# -"string"
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4383
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4337
class SyntaxTree::YARV::OptStrUMinus < ::SyntaxTree::YARV::Instruction
# @return [OptStrUMinus] a new instance of OptStrUMinus
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4386
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4340
def initialize(object, calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4406
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4360
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4419
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4373
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4384
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4338
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4402
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4356
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4391
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4345
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4411
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4365
def length; end
# Returns the value of attribute object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4384
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4338
def object; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4415
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4369
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4398
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4352
def to_a(_iseq); end
end
@@ -20915,43 +21193,43 @@ end
# "".succ
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4437
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4391
class SyntaxTree::YARV::OptSucc < ::SyntaxTree::YARV::Instruction
# @return [OptSucc] a new instance of OptSucc
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4440
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4394
def initialize(calldata); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4456
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4410
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4476
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4430
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4438
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4392
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4472
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4426
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4452
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4406
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4444
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4398
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4460
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4414
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4464
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4418
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4468
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4422
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4448
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4402
def to_a(_iseq); end
end
@@ -20965,29 +21243,29 @@ end
# a ||= 2
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4491
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4445
class SyntaxTree::YARV::Pop < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4504
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4458
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4512
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4466
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4500
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4454
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4492
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4446
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4508
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4462
def pops; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4516
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4470
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4496
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4450
def to_a(_iseq); end
end
@@ -21001,32 +21279,32 @@ end
# nil
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4531
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4485
class SyntaxTree::YARV::PutNil < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4544
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4498
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4556
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4510
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4552
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4506
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4540
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4494
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4532
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4486
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4548
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4502
def pushes; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4560
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4514
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4536
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4490
def to_a(_iseq); end
end
@@ -21040,42 +21318,42 @@ end
# 5
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4575
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4529
class SyntaxTree::YARV::PutObject < ::SyntaxTree::YARV::Instruction
# @return [PutObject] a new instance of PutObject
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4578
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4532
def initialize(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4594
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4548
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4606
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4560
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4590
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4544
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4582
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4536
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4598
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4552
def length; end
# Returns the value of attribute object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4576
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4530
def object; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4602
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4556
def pushes; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4610
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4564
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4586
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4540
def to_a(_iseq); end
end
@@ -21091,32 +21369,32 @@ end
# 0
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4627
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4581
class SyntaxTree::YARV::PutObjectInt2Fix0 < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4640
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4594
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4652
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4606
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4648
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4602
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4636
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4590
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4628
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4582
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4644
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4598
def pushes; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4656
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4610
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4632
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4586
def to_a(_iseq); end
end
@@ -21132,32 +21410,32 @@ end
# 1
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4673
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4627
class SyntaxTree::YARV::PutObjectInt2Fix1 < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4686
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4640
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4698
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4652
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4694
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4648
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4682
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4636
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4674
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4628
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4690
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4644
def pushes; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4702
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4656
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4678
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4632
def to_a(_iseq); end
end
@@ -21171,29 +21449,29 @@ end
# puts "Hello, world!"
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4717
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4671
class SyntaxTree::YARV::PutSelf < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4730
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4684
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4738
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4692
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4726
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4680
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4718
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4672
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4734
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4688
def pushes; end
# @return [Boolean]
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4742
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4696
def side_effects?; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4722
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4676
def to_a(_iseq); end
end
@@ -21209,47 +21487,47 @@ end
# alias foo bar
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4759
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4713
class SyntaxTree::YARV::PutSpecialObject < ::SyntaxTree::YARV::Instruction
# @return [PutSpecialObject] a new instance of PutSpecialObject
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4766
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4720
def initialize(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4782
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4736
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4794
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4748
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4778
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4732
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4770
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4724
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4786
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4740
def length; end
# Returns the value of attribute object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4764
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4718
def object; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4790
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4744
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4774
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4728
def to_a(_iseq); end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4761
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4715
SyntaxTree::YARV::PutSpecialObject::OBJECT_CBASE = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4762
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4716
SyntaxTree::YARV::PutSpecialObject::OBJECT_CONST_BASE = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4760
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4714
SyntaxTree::YARV::PutSpecialObject::OBJECT_VMCORE = T.let(T.unsafe(nil), Integer)
# ### Summary
@@ -21262,37 +21540,37 @@ SyntaxTree::YARV::PutSpecialObject::OBJECT_VMCORE = T.let(T.unsafe(nil), Integer
# "foo"
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4818
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4772
class SyntaxTree::YARV::PutString < ::SyntaxTree::YARV::Instruction
# @return [PutString] a new instance of PutString
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4821
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4775
def initialize(object); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4837
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4791
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4849
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4803
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4833
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4787
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4825
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4779
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4841
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4795
def length; end
# Returns the value of attribute object.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4819
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4773
def object; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4845
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4799
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4829
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4783
def to_a(_iseq); end
end
@@ -21583,45 +21861,45 @@ end
# "hello".tap { |i| p i }
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4867
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4821
class SyntaxTree::YARV::Send < ::SyntaxTree::YARV::Instruction
# @return [Send] a new instance of Send
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4870
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4824
def initialize(calldata, block_iseq); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4891
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4845
def ==(other); end
# Returns the value of attribute block_iseq.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4868
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4822
def block_iseq; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4909
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4863
def call(vm); end
# Returns the value of attribute calldata.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4868
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4822
def calldata; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4887
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4841
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4875
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4829
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4896
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4850
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4900
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4854
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4905
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4859
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4883
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4837
def to_a(_iseq); end
end
@@ -21640,42 +21918,42 @@ end
# end
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4951
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4905
class SyntaxTree::YARV::SetBlockParam < ::SyntaxTree::YARV::Instruction
# @return [SetBlockParam] a new instance of SetBlockParam
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4954
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4908
def initialize(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4973
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4927
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4986
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4940
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4969
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4923
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4959
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4913
def disasm(fmt); end
# Returns the value of attribute index.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4952
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4906
def index; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4978
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4932
def length; end
# Returns the value of attribute level.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4952
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4906
def level; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4982
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4936
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4963
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4917
def to_a(iseq); end
end
@@ -21692,42 +21970,42 @@ end
# @@class_variable = 1
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5004
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4958
class SyntaxTree::YARV::SetClassVariable < ::SyntaxTree::YARV::Instruction
# @return [SetClassVariable] a new instance of SetClassVariable
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5007
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4961
def initialize(name, cache); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5027
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4981
def ==(other); end
# Returns the value of attribute cache.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5005
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4959
def cache; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5040
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4994
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5023
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4977
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5012
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4966
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5032
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4986
def length; end
# Returns the value of attribute name.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5005
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4959
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5036
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4990
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5019
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#4973
def to_a(_iseq); end
end
@@ -21742,37 +22020,37 @@ end
# Constant = 1
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5058
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5012
class SyntaxTree::YARV::SetConstant < ::SyntaxTree::YARV::Instruction
# @return [SetConstant] a new instance of SetConstant
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5061
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5015
def initialize(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5077
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5031
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5089
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5043
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5073
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5027
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5065
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5019
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5081
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5035
def length; end
# Returns the value of attribute name.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5059
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5013
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5085
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5039
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5069
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5023
def to_a(_iseq); end
end
@@ -21787,37 +22065,37 @@ end
# $global = 5
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5106
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5060
class SyntaxTree::YARV::SetGlobal < ::SyntaxTree::YARV::Instruction
# @return [SetGlobal] a new instance of SetGlobal
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5109
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5063
def initialize(name); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5125
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5079
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5137
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5091
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5121
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5075
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5113
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5067
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5129
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5083
def length; end
# Returns the value of attribute name.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5107
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5061
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5133
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5087
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5117
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5071
def to_a(_iseq); end
end
@@ -21836,42 +22114,42 @@ end
# ~~~ruby
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5160
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5114
class SyntaxTree::YARV::SetInstanceVariable < ::SyntaxTree::YARV::Instruction
# @return [SetInstanceVariable] a new instance of SetInstanceVariable
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5163
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5117
def initialize(name, cache); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5183
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5137
def ==(other); end
# Returns the value of attribute cache.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5161
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5115
def cache; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5196
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5150
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5179
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5133
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5168
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5122
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5188
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5142
def length; end
# Returns the value of attribute name.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5161
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5115
def name; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5192
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5146
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5175
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5129
def to_a(_iseq); end
end
@@ -21889,42 +22167,42 @@ end
# tap { tap { value = 10 } }
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5216
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5170
class SyntaxTree::YARV::SetLocal < ::SyntaxTree::YARV::Instruction
# @return [SetLocal] a new instance of SetLocal
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5219
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5173
def initialize(index, level); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5238
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5192
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5250
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5204
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5234
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5188
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5224
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5178
def disasm(fmt); end
# Returns the value of attribute index.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5217
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5171
def index; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5242
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5196
def length; end
# Returns the value of attribute level.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5217
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5171
def level; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5246
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5200
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5228
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5182
def to_a(iseq); end
end
@@ -21941,40 +22219,40 @@ end
# value = 5
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5268
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5222
class SyntaxTree::YARV::SetLocalWC0 < ::SyntaxTree::YARV::Instruction
# @return [SetLocalWC0] a new instance of SetLocalWC0
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5271
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5225
def initialize(index); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5287
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5241
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5303
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5257
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5299
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5253
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5283
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5237
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5275
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5229
def disasm(fmt); end
# Returns the value of attribute index.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5269
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5223
def index; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5291
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5245
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5295
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5249
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5279
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5233
def to_a(iseq); end
end
@@ -21991,40 +22269,40 @@ end
# self.then { value = 10 }
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5321
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5275
class SyntaxTree::YARV::SetLocalWC1 < ::SyntaxTree::YARV::Instruction
# @return [SetLocalWC1] a new instance of SetLocalWC1
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5324
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5278
def initialize(index); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5340
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5294
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5356
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5310
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5352
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5306
def canonical; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5336
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5290
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5328
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5282
def disasm(fmt); end
# Returns the value of attribute index.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5322
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5276
def index; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5344
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5298
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5348
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5302
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5332
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5286
def to_a(iseq); end
end
@@ -22039,40 +22317,40 @@ end
# {}[:key] = 'val'
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5372
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5326
class SyntaxTree::YARV::SetN < ::SyntaxTree::YARV::Instruction
# @return [SetN] a new instance of SetN
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5375
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5329
def initialize(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5391
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5345
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5407
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5361
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5387
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5341
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5379
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5333
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5395
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5349
def length; end
# Returns the value of attribute number.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5373
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5327
def number; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5399
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5353
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5403
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5357
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5383
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5337
def to_a(_iseq); end
end
@@ -22088,37 +22366,37 @@ end
# baz if (foo == 1) .. (bar == 1)
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5424
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5378
class SyntaxTree::YARV::SetSpecial < ::SyntaxTree::YARV::Instruction
# @return [SetSpecial] a new instance of SetSpecial
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5427
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5381
def initialize(key); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5443
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5397
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5455
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5409
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5439
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5393
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5431
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5385
def disasm(fmt); end
# Returns the value of attribute key.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5425
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5379
def key; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5447
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5401
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5451
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5405
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5435
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5389
def to_a(_iseq); end
end
@@ -22134,40 +22412,40 @@ end
# x = *(5)
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5479
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5433
class SyntaxTree::YARV::SplatArray < ::SyntaxTree::YARV::Instruction
# @return [SplatArray] a new instance of SplatArray
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5482
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5436
def initialize(flag); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5498
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5452
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5514
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5468
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5494
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5448
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5486
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5440
def disasm(fmt); end
# Returns the value of attribute flag.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5480
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5434
def flag; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5502
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5456
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5506
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5460
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5510
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5464
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5490
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5444
def to_a(_iseq); end
end
@@ -22185,27 +22463,27 @@ end
# !!defined?([[]])
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5553
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5507
class SyntaxTree::YARV::Swap < ::SyntaxTree::YARV::Instruction
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5566
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5520
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5578
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5532
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5562
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5516
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5554
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5508
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5570
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5524
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5574
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5528
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5558
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5512
def to_a(_iseq); end
end
@@ -22221,79 +22499,79 @@ end
# [1, 2, 3].map { break 2 }
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5596
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5550
class SyntaxTree::YARV::Throw < ::SyntaxTree::YARV::Instruction
# @return [Throw] a new instance of Throw
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5612
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5566
def initialize(type); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5628
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5582
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5644
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5598
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5624
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5578
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5616
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5570
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5632
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5586
def length; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5636
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5590
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5640
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5594
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5620
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5574
def to_a(_iseq); end
# Returns the value of attribute type.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5610
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5564
def type; end
private
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5671
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5625
def error_backtrace(vm); end
end
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5599
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5553
SyntaxTree::YARV::Throw::RUBY_TAG_BREAK = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5605
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5559
SyntaxTree::YARV::Throw::RUBY_TAG_FATAL = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5600
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5554
SyntaxTree::YARV::Throw::RUBY_TAG_NEXT = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5597
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5551
SyntaxTree::YARV::Throw::RUBY_TAG_NONE = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5603
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5557
SyntaxTree::YARV::Throw::RUBY_TAG_RAISE = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5602
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5556
SyntaxTree::YARV::Throw::RUBY_TAG_REDO = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5601
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5555
SyntaxTree::YARV::Throw::RUBY_TAG_RETRY = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5598
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5552
SyntaxTree::YARV::Throw::RUBY_TAG_RETURN = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5604
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5558
SyntaxTree::YARV::Throw::RUBY_TAG_THROW = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5607
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5561
SyntaxTree::YARV::Throw::VM_THROW_NO_ESCAPE_FLAG = T.let(T.unsafe(nil), Integer)
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5608
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5562
SyntaxTree::YARV::Throw::VM_THROW_STATE_MASK = T.let(T.unsafe(nil), Integer)
# ### Summary
@@ -22307,42 +22585,42 @@ SyntaxTree::YARV::Throw::VM_THROW_STATE_MASK = T.let(T.unsafe(nil), Integer)
# /foo #{bar}/
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5746
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5700
class SyntaxTree::YARV::ToRegExp < ::SyntaxTree::YARV::Instruction
# @return [ToRegExp] a new instance of ToRegExp
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5749
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5703
def initialize(options, length); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5766
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5720
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5779
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5733
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5762
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5716
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5754
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5708
def disasm(fmt); end
# Returns the value of attribute length.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5747
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5701
def length; end
# Returns the value of attribute options.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5747
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5701
def options; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5771
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5725
def pops; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5775
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5729
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5758
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5712
def to_a(_iseq); end
end
@@ -22360,37 +22638,37 @@ end
# end
# ~~~
#
-# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5699
+# source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5653
class SyntaxTree::YARV::TopN < ::SyntaxTree::YARV::Instruction
# @return [TopN] a new instance of TopN
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5702
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5656
def initialize(number); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5718
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5672
def ==(other); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5730
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5684
def call(vm); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5714
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5668
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5706
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5660
def disasm(fmt); end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5722
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5676
def length; end
# Returns the value of attribute number.
#
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5700
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5654
def number; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5726
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5680
def pushes; end
- # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5710
+ # source://syntax_tree//lib/syntax_tree/yarv/instructions.rb#5664
def to_a(_iseq); end
end
@@ -22777,42 +23055,42 @@ end
#
# yield value
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12289
+# source://syntax_tree//lib/syntax_tree/node.rb#12273
class SyntaxTree::YieldNode < ::SyntaxTree::Node
# @return [YieldNode] a new instance of YieldNode
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12296
+ # source://syntax_tree//lib/syntax_tree/node.rb#12280
def initialize(arguments:, location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12350
+ # source://syntax_tree//lib/syntax_tree/node.rb#12334
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12302
+ # source://syntax_tree//lib/syntax_tree/node.rb#12286
def accept(visitor); end
# [nil | Args | Paren] the arguments passed to the yield
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12291
+ # source://syntax_tree//lib/syntax_tree/node.rb#12275
def arguments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12306
+ # source://syntax_tree//lib/syntax_tree/node.rb#12290
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12294
+ # source://syntax_tree//lib/syntax_tree/node.rb#12278
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12310
+ # source://syntax_tree//lib/syntax_tree/node.rb#12294
def copy(arguments: T.unsafe(nil), location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12306
+ # source://syntax_tree//lib/syntax_tree/node.rb#12290
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12323
+ # source://syntax_tree//lib/syntax_tree/node.rb#12307
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12327
+ # source://syntax_tree//lib/syntax_tree/node.rb#12311
def format(q); end
end
@@ -22820,36 +23098,36 @@ end
#
# super
#
-# source://syntax_tree//lib/syntax_tree/node.rb#12359
+# source://syntax_tree//lib/syntax_tree/node.rb#12343
class SyntaxTree::ZSuper < ::SyntaxTree::Node
# @return [ZSuper] a new instance of ZSuper
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12363
+ # source://syntax_tree//lib/syntax_tree/node.rb#12347
def initialize(location:); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12393
+ # source://syntax_tree//lib/syntax_tree/node.rb#12377
def ===(other); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12368
+ # source://syntax_tree//lib/syntax_tree/node.rb#12352
def accept(visitor); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12372
+ # source://syntax_tree//lib/syntax_tree/node.rb#12356
def child_nodes; end
# [Array[ Comment | EmbDoc ]] the comments attached to this node
#
- # source://syntax_tree//lib/syntax_tree/node.rb#12361
+ # source://syntax_tree//lib/syntax_tree/node.rb#12345
def comments; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12376
+ # source://syntax_tree//lib/syntax_tree/node.rb#12360
def copy(location: T.unsafe(nil)); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12372
+ # source://syntax_tree//lib/syntax_tree/node.rb#12356
def deconstruct; end
- # source://syntax_tree//lib/syntax_tree/node.rb#12385
+ # source://syntax_tree//lib/syntax_tree/node.rb#12369
def deconstruct_keys(_keys); end
- # source://syntax_tree//lib/syntax_tree/node.rb#12389
+ # source://syntax_tree//lib/syntax_tree/node.rb#12373
def format(q); end
end
diff --git a/sorbet/rbi/gems/tapioca@0.11.7.rbi b/sorbet/rbi/gems/tapioca@0.11.17.rbi
similarity index 85%
rename from sorbet/rbi/gems/tapioca@0.11.7.rbi
rename to sorbet/rbi/gems/tapioca@0.11.17.rbi
index f9ab392..4e6ad9d 100644
--- a/sorbet/rbi/gems/tapioca@0.11.7.rbi
+++ b/sorbet/rbi/gems/tapioca@0.11.17.rbi
@@ -1,4 +1,4 @@
-# typed: false
+# typed: true
# DO NOT EDIT MANUALLY
# This is an autogenerated file for types exported from the `tapioca` gem.
@@ -8,6 +8,25 @@ class Bundler::Dependency < ::Gem::Dependency
include ::Tapioca::BundlerExt::AutoRequireHook
end
+# source://tapioca//lib/tapioca/helpers/git_attributes.rb#4
+class GitAttributes
+ class << self
+ # source://tapioca//lib/tapioca/helpers/git_attributes.rb#9
+ sig { params(path: ::Pathname).void }
+ def create_generated_attribute_file(path); end
+
+ # source://tapioca//lib/tapioca/helpers/git_attributes.rb#16
+ sig { params(path: ::Pathname).void }
+ def create_vendored_attribute_file(path); end
+
+ private
+
+ # source://tapioca//lib/tapioca/helpers/git_attributes.rb#25
+ sig { params(path: ::Pathname, content: ::String).void }
+ def create_gitattributes_file(path, content); end
+ end
+end
+
# We need to do the alias-method-chain dance since Bootsnap does the same,
# and prepended modules and alias-method-chain don't play well together.
#
@@ -35,7 +54,7 @@ module RBI; end
# source://tapioca//lib/tapioca/rbi_ext/model.rb#5
class RBI::Tree < ::RBI::NodeWithComments
- # source://rbi/0.0.16/lib/rbi/model.rb#115
+ # source://rbi/0.1.6/lib/rbi/model.rb#119
sig do
params(
loc: T.nilable(::RBI::Loc),
@@ -45,19 +64,19 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def initialize(loc: T.unsafe(nil), comments: T.unsafe(nil), &block); end
- # source://rbi/0.0.16/lib/rbi/model.rb#122
+ # source://rbi/0.1.6/lib/rbi/model.rb#126
sig { params(node: ::RBI::Node).void }
def <<(node); end
- # source://rbi/0.0.16/lib/rbi/printer.rb#224
+ # source://rbi/0.1.6/lib/rbi/printer.rb#226
sig { override.params(v: ::RBI::Printer).void }
def accept_printer(v); end
- # source://rbi/0.0.16/lib/rbi/rewriters/add_sig_templates.rb#66
+ # source://rbi/0.1.6/lib/rbi/rewriters/add_sig_templates.rb#66
sig { params(with_todo_comment: T::Boolean).void }
def add_sig_templates!(with_todo_comment: T.unsafe(nil)); end
- # source://rbi/0.0.16/lib/rbi/rewriters/annotate.rb#48
+ # source://rbi/0.1.6/lib/rbi/rewriters/annotate.rb#49
sig { params(annotation: ::String, annotate_scopes: T::Boolean, annotate_properties: T::Boolean).void }
def annotate!(annotation, annotate_scopes: T.unsafe(nil), annotate_properties: T.unsafe(nil)); end
@@ -121,23 +140,23 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def create_type_variable(name, type:, variance: T.unsafe(nil), fixed: T.unsafe(nil), upper: T.unsafe(nil), lower: T.unsafe(nil)); end
- # source://rbi/0.0.16/lib/rbi/rewriters/deannotate.rb#40
+ # source://rbi/0.1.6/lib/rbi/rewriters/deannotate.rb#41
sig { params(annotation: ::String).void }
def deannotate!(annotation); end
- # source://rbi/0.0.16/lib/rbi/model.rb#128
+ # source://rbi/0.1.6/lib/rbi/model.rb#132
sig { returns(T::Boolean) }
def empty?; end
- # source://rbi/0.0.16/lib/rbi/rewriters/group_nodes.rb#38
+ # source://rbi/0.1.6/lib/rbi/rewriters/group_nodes.rb#38
sig { void }
def group_nodes!; end
- # source://rbi/0.0.16/lib/rbi/index.rb#64
+ # source://rbi/0.1.6/lib/rbi/index.rb#68
sig { returns(::RBI::Index) }
def index; end
- # source://rbi/0.0.16/lib/rbi/rewriters/merge_trees.rb#318
+ # source://rbi/0.1.6/lib/rbi/rewriters/merge_trees.rb#324
sig do
params(
other: ::RBI::Tree,
@@ -148,23 +167,23 @@ class RBI::Tree < ::RBI::NodeWithComments
end
def merge(other, left_name: T.unsafe(nil), right_name: T.unsafe(nil), keep: T.unsafe(nil)); end
- # source://rbi/0.0.16/lib/rbi/rewriters/nest_non_public_methods.rb#45
+ # source://rbi/0.1.6/lib/rbi/rewriters/nest_non_public_methods.rb#46
sig { void }
def nest_non_public_methods!; end
- # source://rbi/0.0.16/lib/rbi/rewriters/nest_singleton_methods.rb#35
+ # source://rbi/0.1.6/lib/rbi/rewriters/nest_singleton_methods.rb#36
sig { void }
def nest_singleton_methods!; end
- # source://rbi/0.0.16/lib/rbi/model.rb#106
+ # source://rbi/0.1.6/lib/rbi/model.rb#110
sig { returns(T::Array[::RBI::Node]) }
def nodes; end
- # source://rbi/0.0.16/lib/rbi/printer.rb#231
+ # source://rbi/0.1.6/lib/rbi/printer.rb#233
sig { override.returns(T::Boolean) }
def oneline?; end
- # source://rbi/0.0.16/lib/rbi/rewriters/sort_nodes.rb#107
+ # source://rbi/0.1.6/lib/rbi/rewriters/sort_nodes.rb#119
sig { void }
def sort_nodes!; end
@@ -185,7 +204,7 @@ class RBI::TypedParam < ::T::Struct
const :type, ::String
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -197,14 +216,14 @@ module T::Generic
# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#13
def [](*types); end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#53
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#47
def has_attached_class!(variance = T.unsafe(nil), &bounds_proc); end
# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#21
- def type_member(variance = T.unsafe(nil), fixed: T.unsafe(nil), lower: T.unsafe(nil), upper: T.unsafe(nil), &bounds_proc); end
+ def type_member(variance = T.unsafe(nil), &bounds_proc); end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#37
- def type_template(variance = T.unsafe(nil), fixed: T.unsafe(nil), lower: T.unsafe(nil), upper: T.unsafe(nil), &bounds_proc); end
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#34
+ def type_template(variance = T.unsafe(nil), &bounds_proc); end
end
# This module intercepts calls to generic type instantiations and type variable definitions.
@@ -219,14 +238,14 @@ module T::Generic::TypeStoragePatch
# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#13
def [](*types); end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#53
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#47
def has_attached_class!(variance = T.unsafe(nil), &bounds_proc); end
# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#21
- def type_member(variance = T.unsafe(nil), fixed: T.unsafe(nil), lower: T.unsafe(nil), upper: T.unsafe(nil), &bounds_proc); end
+ def type_member(variance = T.unsafe(nil), &bounds_proc); end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#37
- def type_template(variance = T.unsafe(nil), fixed: T.unsafe(nil), lower: T.unsafe(nil), upper: T.unsafe(nil), &bounds_proc); end
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#34
+ def type_template(variance = T.unsafe(nil), &bounds_proc); end
end
# source://tapioca//lib/tapioca/sorbet_ext/proc_bind_patch.rb#28
@@ -310,18 +329,18 @@ end
# source://tapioca//lib/tapioca/sorbet_ext/name_patch.rb#6
class T::Types::Simple < ::T::Types::Base
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#79
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#70
def name; end
end
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#74
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#65
module T::Types::Simple::GenericPatch
# This method intercepts calls to the `name` method for simple types, so that
# it can ask the name to the type if the type is generic, since, by this point,
# we've created a clone of that type with the `name` method returning the
# appropriate name for that specific concrete type.
#
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#79
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#70
def name; end
end
@@ -337,17 +356,17 @@ end
# source://tapioca//lib/tapioca/sorbet_ext/name_patch.rb#8
T::Types::Simple::NamePatch::NAME_METHOD = T.let(T.unsafe(nil), UnboundMethod)
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#99
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#87
module T::Utils::Private
class << self
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#101
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#89
def coerce_and_check_module_types(val, check_val, check_module_type); end
end
end
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#100
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#88
module T::Utils::Private::PrivateCoercePatch
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#101
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#89
def coerce_and_check_module_types(val, check_val, check_module_type); end
end
@@ -420,40 +439,42 @@ class Tapioca::Cli < ::Thor
include ::Tapioca::ConfigHelper
include ::Tapioca::EnvHelper
- # source://tapioca//lib/tapioca/cli.rb#346
+ # source://tapioca//lib/tapioca/cli.rb#355
def __print_version; end
- # source://tapioca//lib/tapioca/cli.rb#326
+ # source://tapioca//lib/tapioca/cli.rb#337
def annotations; end
- # source://tapioca//lib/tapioca/cli.rb#296
+ # source://tapioca//lib/tapioca/cli.rb#309
def check_shims; end
- # source://tapioca//lib/tapioca/cli.rb#41
+ # source://tapioca//lib/tapioca/cli.rb#46
def configure; end
- # source://tapioca//lib/tapioca/cli.rb#137
+ # source://tapioca//lib/tapioca/cli.rb#138
def dsl(*constant_or_paths); end
- # source://tapioca//lib/tapioca/cli.rb#247
+ # @raise [MalformattedArgumentError]
+ #
+ # source://tapioca//lib/tapioca/cli.rb#253
def gem(*gems); end
# source://tapioca//lib/tapioca/cli.rb#27
def init; end
- # source://tapioca//lib/tapioca/cli.rb#52
+ # source://tapioca//lib/tapioca/cli.rb#57
def require; end
- # source://tapioca//lib/tapioca/cli.rb#71
+ # source://tapioca//lib/tapioca/cli.rb#74
def todo; end
private
- # source://tapioca//lib/tapioca/cli.rb#360
+ # source://tapioca//lib/tapioca/cli.rb#369
def print_init_next_steps; end
class << self
- # source://tapioca//lib/tapioca/cli.rb#352
+ # source://tapioca//lib/tapioca/cli.rb#361
def exit_on_failure?; end
end
end
@@ -481,6 +502,239 @@ end
# source://tapioca//lib/tapioca/commands.rb#5
module Tapioca::Commands; end
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://tapioca//lib/tapioca/commands/abstract_dsl.rb#6
+class Tapioca::Commands::AbstractDsl < ::Tapioca::Commands::CommandWithoutTracker
+ include ::Tapioca::SorbetHelper
+ include ::Tapioca::RBIFilesHelper
+
+ abstract!
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#31
+ sig do
+ params(
+ requested_constants: T::Array[::String],
+ requested_paths: T::Array[::Pathname],
+ outpath: ::Pathname,
+ only: T::Array[::String],
+ exclude: T::Array[::String],
+ file_header: T::Boolean,
+ tapioca_path: ::String,
+ quiet: T::Boolean,
+ verbose: T::Boolean,
+ number_of_workers: T.nilable(::Integer),
+ auto_strictness: T::Boolean,
+ gem_dir: ::String,
+ rbi_formatter: ::Tapioca::RBIFormatter,
+ app_root: ::String,
+ halt_upon_load_error: T::Boolean
+ ).void
+ end
+ def initialize(requested_constants:, requested_paths:, outpath:, only:, exclude:, file_header:, tapioca_path:, quiet: T.unsafe(nil), verbose: T.unsafe(nil), number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), gem_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), app_root: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end
+
+ private
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#94
+ sig { returns(T::Array[::String]) }
+ def all_requested_constants; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#284
+ sig { params(cause: ::Symbol, files: T::Array[::String]).returns(::String) }
+ def build_error_for_files(cause, files); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#208
+ sig do
+ params(
+ constant_name: ::String,
+ rbi: ::RBI::File,
+ outpath: ::Pathname,
+ quiet: T::Boolean
+ ).returns(T.nilable(::Pathname))
+ end
+ def compile_dsl_rbi(constant_name, rbi, outpath: T.unsafe(nil), quiet: T.unsafe(nil)); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#146
+ sig { params(constant_names: T::Array[::String], ignore_missing: T::Boolean).returns(T::Array[::Module]) }
+ def constantize(constant_names, ignore_missing: T.unsafe(nil)); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#169
+ sig { params(compiler_names: T::Array[::String]).returns(T::Array[T.class_of(Tapioca::Dsl::Compiler)]) }
+ def constantize_compilers(compiler_names); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#344
+ sig { returns(T::Array[::String]) }
+ def constants_from_requested_paths; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#117
+ sig { returns(::Tapioca::Dsl::Pipeline) }
+ def create_pipeline; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#247
+ sig { params(constant_name: ::String).returns(::Pathname) }
+ def dsl_rbi_filename(constant_name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#132
+ sig { params(requested_constants: T::Array[::String], path: ::Pathname).returns(T::Set[::Pathname]) }
+ def existing_rbi_filenames(requested_constants, path: T.unsafe(nil)); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#339
+ sig { params(constant: ::String).returns(::String) }
+ def generate_command_for(constant); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#70
+ sig { params(outpath: ::Pathname, quiet: T::Boolean).returns(T::Set[::Pathname]) }
+ def generate_dsl_rbi_files(outpath, quiet:); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#107
+ sig { void }
+ def load_application; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#226
+ sig { params(dir: ::Pathname).void }
+ def perform_dsl_verification(dir); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#102
+ sig { returns(::Tapioca::Dsl::Pipeline) }
+ def pipeline; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#235
+ sig { params(files: T::Set[::Pathname]).void }
+ def purge_stale_dsl_rbi_files(files); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#334
+ sig { params(constant: ::String).returns(::String) }
+ def rbi_filename_for(constant); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#315
+ sig { params(path: ::Pathname).returns(T::Array[::Pathname]) }
+ def rbi_files_in(path); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#293
+ sig { params(diff: T::Hash[::String, ::Symbol], command: ::Symbol).void }
+ def report_diff_and_exit_if_out_of_date(diff, command); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#188
+ sig { params(name: ::String).returns(T.nilable(T.class_of(Tapioca::Dsl::Compiler))) }
+ def resolve(name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#322
+ sig { params(class_name: ::String).returns(::String) }
+ def underscore(class_name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_dsl.rb#252
+ sig { params(tmp_dir: ::Pathname).returns(T::Hash[::String, ::Symbol]) }
+ def verify_dsl_rbi(tmp_dir:); end
+end
+
+# @abstract It cannot be directly instantiated. Subclasses must implement the `abstract` methods below.
+#
+# source://tapioca//lib/tapioca/commands/abstract_gem.rb#6
+class Tapioca::Commands::AbstractGem < ::Tapioca::Commands::Command
+ include ::Tapioca::SorbetHelper
+ include ::Tapioca::RBIFilesHelper
+
+ abstract!
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#32
+ sig do
+ params(
+ gem_names: T::Array[::String],
+ exclude: T::Array[::String],
+ include_dependencies: T::Boolean,
+ prerequire: T.nilable(::String),
+ postrequire: ::String,
+ typed_overrides: T::Hash[::String, ::String],
+ outpath: ::Pathname,
+ file_header: T::Boolean,
+ include_doc: T::Boolean,
+ include_loc: T::Boolean,
+ include_exported_rbis: T::Boolean,
+ number_of_workers: T.nilable(::Integer),
+ auto_strictness: T::Boolean,
+ dsl_dir: ::String,
+ rbi_formatter: ::Tapioca::RBIFormatter,
+ halt_upon_load_error: T::Boolean
+ ).void
+ end
+ def initialize(gem_names:, exclude:, include_dependencies:, prerequire:, postrequire:, typed_overrides:, outpath:, file_header:, include_doc:, include_loc:, include_exported_rbis:, number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), dsl_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end
+
+ private
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#221
+ sig { returns(T::Array[::String]) }
+ def added_rbis; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#282
+ sig { params(cause: ::Symbol, files: T::Array[::String]).returns(::String) }
+ def build_error_for_files(cause, files); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#110
+ sig { params(gem: ::Tapioca::Gemfile::GemSpec).void }
+ def compile_gem_rbi(gem); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#216
+ sig { params(gem_name: ::String).returns(::Pathname) }
+ def existing_rbi(gem_name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#264
+ sig { returns(T::Hash[::String, ::String]) }
+ def existing_rbis; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#228
+ sig { params(gem_name: ::String).returns(::Pathname) }
+ def expected_rbi(gem_name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#270
+ sig { returns(T::Hash[::String, ::String]) }
+ def expected_rbis; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#98
+ sig do
+ params(
+ gem: ::Tapioca::Gemfile::GemSpec,
+ dependencies: T::Array[::Tapioca::Gemfile::GemSpec]
+ ).returns(T::Array[::Tapioca::Gemfile::GemSpec])
+ end
+ def gem_dependencies(gem, dependencies = T.unsafe(nil)); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#233
+ sig { params(gem_name: ::String).returns(T::Boolean) }
+ def gem_rbi_exists?(gem_name); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#277
+ sig { params(gem_name: ::String, version: ::String).returns(::Pathname) }
+ def gem_rbi_filename(gem_name, version); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#77
+ sig { params(gem_names: T::Array[::String]).returns(T::Array[::Tapioca::Gemfile::GemSpec]) }
+ def gems_to_generate(gem_names); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#287
+ sig { params(gem: ::Tapioca::Gemfile::GemSpec, file: ::RBI::File).void }
+ def merge_with_exported_rbi(gem, file); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#258
+ sig { params(old_filename: ::Pathname, new_filename: ::Pathname).void }
+ def move(old_filename, new_filename); end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#168
+ sig { void }
+ def perform_additions; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#141
+ sig { void }
+ def perform_removals; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#211
+ sig { returns(T::Array[::String]) }
+ def removed_rbis; end
+
+ # source://tapioca//lib/tapioca/commands/abstract_gem.rb#238
+ sig { params(diff: T::Hash[::String, ::Symbol], command: ::Symbol).void }
+ def report_diff_and_exit_if_out_of_date(diff, command); end
+end
+
# source://tapioca//lib/tapioca/commands/annotations.rb#6
class Tapioca::Commands::Annotations < ::Tapioca::Commands::CommandWithoutTracker
# source://tapioca//lib/tapioca/commands/annotations.rb#18
@@ -495,69 +749,69 @@ class Tapioca::Commands::Annotations < ::Tapioca::Commands::CommandWithoutTracke
end
def initialize(central_repo_root_uris:, auth: T.unsafe(nil), netrc_file: T.unsafe(nil), central_repo_index_path: T.unsafe(nil), typed_overrides: T.unsafe(nil)); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#36
- sig { override.void }
- def execute; end
-
private
- # source://tapioca//lib/tapioca/commands/annotations.rb#191
+ # source://tapioca//lib/tapioca/commands/annotations.rb#193
sig { params(name: ::String, content: ::String).returns(::String) }
def add_header(name, content); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#211
+ # source://tapioca//lib/tapioca/commands/annotations.rb#213
sig { params(name: ::String, content: ::String).returns(::String) }
def apply_typed_override(name, content); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#132
+ # source://tapioca//lib/tapioca/commands/annotations.rb#39
+ sig { override.void }
+ def execute; end
+
+ # source://tapioca//lib/tapioca/commands/annotations.rb#136
sig { params(repo_uris: T::Array[::String], gem_name: ::String).void }
def fetch_annotation(repo_uris, gem_name); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#109
+ # source://tapioca//lib/tapioca/commands/annotations.rb#113
sig { params(gem_names: T::Array[::String]).returns(T::Array[::String]) }
def fetch_annotations(gem_names); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#150
+ # source://tapioca//lib/tapioca/commands/annotations.rb#152
sig { params(repo_uri: ::String, path: ::String).returns(T.nilable(::String)) }
def fetch_file(repo_uri, path); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#167
+ # source://tapioca//lib/tapioca/commands/annotations.rb#169
sig { params(repo_uri: ::String, path: ::String).returns(T.nilable(::String)) }
def fetch_http_file(repo_uri, path); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#98
+ # source://tapioca//lib/tapioca/commands/annotations.rb#102
sig { params(repo_uri: ::String, repo_number: T.nilable(::Integer)).returns(T.nilable(Tapioca::RepoIndex)) }
def fetch_index(repo_uri, repo_number:); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#77
+ # source://tapioca//lib/tapioca/commands/annotations.rb#81
sig { returns(T::Hash[::String, Tapioca::RepoIndex]) }
def fetch_indexes; end
- # source://tapioca//lib/tapioca/commands/annotations.rb#159
+ # source://tapioca//lib/tapioca/commands/annotations.rb#161
sig { params(repo_uri: ::String, path: ::String).returns(T.nilable(::String)) }
def fetch_local_file(repo_uri, path); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#46
+ # source://tapioca//lib/tapioca/commands/annotations.rb#50
sig { returns(T::Array[::String]) }
def list_gemfile_gems; end
- # source://tapioca//lib/tapioca/commands/annotations.rb#223
+ # source://tapioca//lib/tapioca/commands/annotations.rb#225
sig { params(gem_name: ::String, contents: T::Array[::String]).returns(T.nilable(::String)) }
def merge_files(gem_name, contents); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#56
+ # source://tapioca//lib/tapioca/commands/annotations.rb#60
sig { params(project_gems: T::Array[::String]).void }
def remove_expired_annotations(project_gems); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#250
+ # source://tapioca//lib/tapioca/commands/annotations.rb#252
sig { returns(T::Hash[::String, T.nilable(::String)]) }
def repo_tokens; end
- # source://tapioca//lib/tapioca/commands/annotations.rb#278
+ # source://tapioca//lib/tapioca/commands/annotations.rb#280
sig { params(path: ::String, repo_uri: ::String, message: ::String).void }
def say_http_error(path, repo_uri, message:); end
- # source://tapioca//lib/tapioca/commands/annotations.rb#262
+ # source://tapioca//lib/tapioca/commands/annotations.rb#264
sig { params(repo_uri: ::String).returns(T.nilable(::String)) }
def token_for(repo_uri); end
end
@@ -581,7 +835,9 @@ class Tapioca::Commands::CheckShims < ::Tapioca::Commands::CommandWithoutTracker
end
def initialize(gem_rbi_dir:, dsl_rbi_dir:, annotations_rbi_dir:, shim_rbi_dir:, todo_rbi_file:, payload:, number_of_workers:); end
- # source://tapioca//lib/tapioca/commands/check_shims.rb#42
+ private
+
+ # source://tapioca//lib/tapioca/commands/check_shims.rb#44
sig { override.void }
def execute; end
end
@@ -603,19 +859,17 @@ class Tapioca::Commands::Command
sig { void }
def initialize; end
- # @abstract
- #
- # source://tapioca//lib/tapioca/commands/command.rb#25
- sig { abstract.void }
- def execute; end
-
- # source://thor/1.2.2/lib/thor/base.rb#139
+ # source://thor/1.3.0/lib/thor/base.rb#155
sig { returns(::Thor::Actions) }
def file_writer; end
+ # source://tapioca//lib/tapioca/commands/command.rb#25
+ sig(:final) { void }
+ def run; end
+
private
- # source://tapioca//lib/tapioca/commands/command.rb#46
+ # source://tapioca//lib/tapioca/commands/command.rb#53
sig do
params(
path: T.any(::Pathname, ::String),
@@ -627,11 +881,17 @@ class Tapioca::Commands::Command
end
def create_file(path, content, force: T.unsafe(nil), skip: T.unsafe(nil), verbose: T.unsafe(nil)); end
- # source://tapioca//lib/tapioca/commands/command.rb#30
+ # source://tapioca//lib/tapioca/commands/command.rb#37
sig { params(command: ::Symbol, args: ::String).returns(::String) }
def default_command(command, *args); end
- # source://tapioca//lib/tapioca/commands/command.rb#56
+ # @abstract
+ #
+ # source://tapioca//lib/tapioca/commands/command.rb#34
+ sig { abstract.void }
+ def execute; end
+
+ # source://tapioca//lib/tapioca/commands/command.rb#63
sig { params(path: T.any(::Pathname, ::String), verbose: T::Boolean).void }
def remove_file(path, verbose: T.unsafe(nil)); end
end
@@ -659,10 +919,6 @@ class Tapioca::Commands::Configure < ::Tapioca::Commands::CommandWithoutTracker
sig { params(sorbet_config: ::String, tapioca_config: ::String, default_postrequire: ::String).void }
def initialize(sorbet_config:, tapioca_config:, default_postrequire:); end
- # source://tapioca//lib/tapioca/commands/configure.rb#30
- sig { override.void }
- def execute; end
-
private
# source://tapioca//lib/tapioca/commands/configure.rb#79
@@ -681,6 +937,10 @@ class Tapioca::Commands::Configure < ::Tapioca::Commands::CommandWithoutTracker
sig { void }
def create_tapioca_config; end
+ # source://tapioca//lib/tapioca/commands/configure.rb#32
+ sig { override.void }
+ def execute; end
+
# source://tapioca//lib/tapioca/commands/configure.rb#92
sig { returns(::Bundler::Installer) }
def installer; end
@@ -690,224 +950,62 @@ class Tapioca::Commands::Configure < ::Tapioca::Commands::CommandWithoutTracker
def spec; end
end
-# source://tapioca//lib/tapioca/commands/dsl.rb#6
-class Tapioca::Commands::Dsl < ::Tapioca::Commands::CommandWithoutTracker
- include ::Tapioca::SorbetHelper
- include ::Tapioca::RBIFilesHelper
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#30
- sig do
- params(
- requested_constants: T::Array[::String],
- requested_paths: T::Array[::Pathname],
- outpath: ::Pathname,
- only: T::Array[::String],
- exclude: T::Array[::String],
- file_header: T::Boolean,
- tapioca_path: ::String,
- should_verify: T::Boolean,
- quiet: T::Boolean,
- verbose: T::Boolean,
- number_of_workers: T.nilable(::Integer),
- auto_strictness: T::Boolean,
- gem_dir: ::String,
- rbi_formatter: ::Tapioca::RBIFormatter,
- app_root: ::String,
- halt_upon_load_error: T::Boolean
- ).void
- end
- def initialize(requested_constants:, requested_paths:, outpath:, only:, exclude:, file_header:, tapioca_path:, should_verify: T.unsafe(nil), quiet: T.unsafe(nil), verbose: T.unsafe(nil), number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), gem_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), app_root: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end
+# source://tapioca//lib/tapioca/commands/dsl_compiler_list.rb#6
+class Tapioca::Commands::DslCompilerList < ::Tapioca::Commands::AbstractDsl
+ private
- # source://tapioca//lib/tapioca/commands/dsl.rb#97
+ # source://tapioca//lib/tapioca/commands/dsl_compiler_list.rb#10
sig { override.void }
def execute; end
+end
- # source://tapioca//lib/tapioca/commands/dsl.rb#69
- sig { void }
- def list_compilers; end
-
+# source://tapioca//lib/tapioca/commands/dsl_generate.rb#6
+class Tapioca::Commands::DslGenerate < ::Tapioca::Commands::AbstractDsl
private
- # source://tapioca//lib/tapioca/commands/dsl.rb#330
- sig { params(cause: ::Symbol, files: T::Array[::String]).returns(::String) }
- def build_error_for_files(cause, files); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#254
- sig do
- params(
- constant_name: ::String,
- rbi: ::RBI::File,
- outpath: ::Pathname,
- quiet: T::Boolean
- ).returns(T.nilable(::Pathname))
- end
- def compile_dsl_rbi(constant_name, rbi, outpath: T.unsafe(nil), quiet: T.unsafe(nil)); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#192
- sig { params(constant_names: T::Array[::String], ignore_missing: T::Boolean).returns(T::Array[::Module]) }
- def constantize(constant_names, ignore_missing: T.unsafe(nil)); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#215
- sig { params(compiler_names: T::Array[::String]).returns(T::Array[T.class_of(Tapioca::Dsl::Compiler)]) }
- def constantize_compilers(compiler_names); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#390
- sig { returns(T::Array[::String]) }
- def constants_from_requested_paths; end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#163
- sig { returns(::Tapioca::Dsl::Pipeline) }
- def create_pipeline; end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#293
- sig { params(constant_name: ::String).returns(::Pathname) }
- def dsl_rbi_filename(constant_name); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#178
- sig { params(requested_constants: T::Array[::String], path: ::Pathname).returns(T::Set[::Pathname]) }
- def existing_rbi_filenames(requested_constants, path: T.unsafe(nil)); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#385
- sig { params(constant: ::String).returns(::String) }
- def generate_command_for(constant); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#272
- sig { params(dir: ::Pathname).void }
- def perform_dsl_verification(dir); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#281
- sig { params(files: T::Set[::Pathname]).void }
- def purge_stale_dsl_rbi_files(files); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#380
- sig { params(constant: ::String).returns(::String) }
- def rbi_filename_for(constant); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#361
- sig { params(path: ::Pathname).returns(T::Array[::Pathname]) }
- def rbi_files_in(path); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#339
- sig { params(diff: T::Hash[::String, ::Symbol], command: ::Symbol).void }
- def report_diff_and_exit_if_out_of_date(diff, command); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#234
- sig { params(name: ::String).returns(T.nilable(T.class_of(Tapioca::Dsl::Compiler))) }
- def resolve(name); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#368
- sig { params(class_name: ::String).returns(::String) }
- def underscore(class_name); end
-
- # source://tapioca//lib/tapioca/commands/dsl.rb#298
- sig { params(tmp_dir: ::Pathname).returns(T::Hash[::String, ::Symbol]) }
- def verify_dsl_rbi(tmp_dir:); end
+ # source://tapioca//lib/tapioca/commands/dsl_generate.rb#10
+ sig { override.void }
+ def execute; end
end
-# source://tapioca//lib/tapioca/commands/gem.rb#6
-class Tapioca::Commands::Gem < ::Tapioca::Commands::Command
- include ::Tapioca::SorbetHelper
- include ::Tapioca::RBIFilesHelper
-
- # source://tapioca//lib/tapioca/commands/gem.rb#29
- sig do
- params(
- gem_names: T::Array[::String],
- exclude: T::Array[::String],
- prerequire: T.nilable(::String),
- postrequire: ::String,
- typed_overrides: T::Hash[::String, ::String],
- outpath: ::Pathname,
- file_header: T::Boolean,
- include_doc: T::Boolean,
- include_loc: T::Boolean,
- include_exported_rbis: T::Boolean,
- number_of_workers: T.nilable(::Integer),
- auto_strictness: T::Boolean,
- dsl_dir: ::String,
- rbi_formatter: ::Tapioca::RBIFormatter,
- halt_upon_load_error: T::Boolean
- ).void
- end
- def initialize(gem_names:, exclude:, prerequire:, postrequire:, typed_overrides:, outpath:, file_header:, include_doc:, include_loc:, include_exported_rbis:, number_of_workers: T.unsafe(nil), auto_strictness: T.unsafe(nil), dsl_dir: T.unsafe(nil), rbi_formatter: T.unsafe(nil), halt_upon_load_error: T.unsafe(nil)); end
+# source://tapioca//lib/tapioca/commands/dsl_verify.rb#6
+class Tapioca::Commands::DslVerify < ::Tapioca::Commands::AbstractDsl
+ private
- # source://tapioca//lib/tapioca/commands/gem.rb#70
+ # source://tapioca//lib/tapioca/commands/dsl_verify.rb#10
sig { override.void }
def execute; end
+end
- # source://tapioca//lib/tapioca/commands/gem.rb#109
- sig { params(should_verify: T::Boolean, exclude: T::Array[::String]).void }
- def sync(should_verify: T.unsafe(nil), exclude: T.unsafe(nil)); end
-
+# source://tapioca//lib/tapioca/commands/gem_generate.rb#6
+class Tapioca::Commands::GemGenerate < ::Tapioca::Commands::AbstractGem
private
- # source://tapioca//lib/tapioca/commands/gem.rb#288
- sig { returns(T::Array[::String]) }
- def added_rbis; end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#349
- sig { params(cause: ::Symbol, files: T::Array[::String]).returns(::String) }
- def build_error_for_files(cause, files); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#158
- sig { params(gem: ::Tapioca::Gemfile::GemSpec).void }
- def compile_gem_rbi(gem); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#283
- sig { params(gem_name: ::String).returns(::Pathname) }
- def existing_rbi(gem_name); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#331
- sig { returns(T::Hash[::String, ::String]) }
- def existing_rbis; end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#295
- sig { params(gem_name: ::String).returns(::Pathname) }
- def expected_rbi(gem_name); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#337
- sig { returns(T::Hash[::String, ::String]) }
- def expected_rbis; end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#300
- sig { params(gem_name: ::String).returns(T::Boolean) }
- def gem_rbi_exists?(gem_name); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#344
- sig { params(gem_name: ::String, version: ::String).returns(::Pathname) }
- def gem_rbi_filename(gem_name, version); end
+ # source://tapioca//lib/tapioca/commands/gem_generate.rb#10
+ sig { override.void }
+ def execute; end
+end
- # source://tapioca//lib/tapioca/commands/gem.rb#143
- sig { params(gem_names: T::Array[::String]).returns(T::Array[::Tapioca::Gemfile::GemSpec]) }
- def gems_to_generate(gem_names); end
+# source://tapioca//lib/tapioca/commands/gem_sync.rb#6
+class Tapioca::Commands::GemSync < ::Tapioca::Commands::AbstractGem
+ private
- # source://tapioca//lib/tapioca/commands/gem.rb#354
- sig { params(gem: ::Tapioca::Gemfile::GemSpec, file: ::RBI::File).void }
- def merge_with_exported_rbi(gem, file); end
+ # source://tapioca//lib/tapioca/commands/gem_sync.rb#10
+ sig { override.void }
+ def execute; end
+end
- # source://tapioca//lib/tapioca/commands/gem.rb#325
- sig { params(old_filename: ::Pathname, new_filename: ::Pathname).void }
- def move(old_filename, new_filename); end
+# source://tapioca//lib/tapioca/commands/gem_verify.rb#6
+class Tapioca::Commands::GemVerify < ::Tapioca::Commands::AbstractGem
+ private
- # source://tapioca//lib/tapioca/commands/gem.rb#235
- sig { void }
- def perform_additions; end
+ # source://tapioca//lib/tapioca/commands/gem_verify.rb#10
+ sig { override.void }
+ def execute; end
- # source://tapioca//lib/tapioca/commands/gem.rb#208
+ # source://tapioca//lib/tapioca/commands/gem_verify.rb#17
sig { void }
- def perform_removals; end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#189
- sig { params(exclude: T::Array[::String]).void }
- def perform_sync_verification(exclude: T.unsafe(nil)); end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#278
- sig { returns(T::Array[::String]) }
- def removed_rbis; end
-
- # source://tapioca//lib/tapioca/commands/gem.rb#305
- sig { params(diff: T::Hash[::String, ::Symbol], command: ::Symbol).void }
- def report_diff_and_exit_if_out_of_date(diff, command); end
+ def perform_sync_verification; end
end
# source://tapioca//lib/tapioca/commands/require.rb#6
@@ -916,7 +1014,9 @@ class Tapioca::Commands::Require < ::Tapioca::Commands::CommandWithoutTracker
sig { params(requires_path: ::String, sorbet_config_path: ::String).void }
def initialize(requires_path:, sorbet_config_path:); end
- # source://tapioca//lib/tapioca/commands/require.rb#21
+ private
+
+ # source://tapioca//lib/tapioca/commands/require.rb#23
sig { override.void }
def execute; end
end
@@ -925,25 +1025,32 @@ end
class Tapioca::Commands::Todo < ::Tapioca::Commands::CommandWithoutTracker
include ::Tapioca::SorbetHelper
- # source://tapioca//lib/tapioca/commands/todo.rb#15
+ # source://tapioca//lib/tapioca/commands/todo.rb#26
sig { params(todo_file: ::String, file_header: T::Boolean).void }
def initialize(todo_file:, file_header:); end
- # source://tapioca//lib/tapioca/commands/todo.rb#23
- sig { override.void }
- def execute; end
+ # source://tapioca//lib/tapioca/commands/todo.rb#34
+ sig { void }
+ def run_with_deprecation; end
private
- # source://tapioca//lib/tapioca/commands/todo.rb#49
+ # source://tapioca//lib/tapioca/commands/todo.rb#44
+ sig { override.void }
+ def execute; end
+
+ # source://tapioca//lib/tapioca/commands/todo.rb#68
sig { params(constants: T::Array[::String], command: ::String).returns(::RBI::File) }
def rbi(constants, command:); end
- # source://tapioca//lib/tapioca/commands/todo.rb#69
+ # source://tapioca//lib/tapioca/commands/todo.rb#88
sig { returns(T::Array[::String]) }
def unresolved_constants; end
end
+# source://tapioca//lib/tapioca/commands/todo.rb#9
+Tapioca::Commands::Todo::DEPRECATION_MESSAGE = T.let(T.unsafe(nil), String)
+
# source://tapioca//lib/tapioca/helpers/config_helper.rb#5
module Tapioca::ConfigHelper
requires_ancestor { Thor }
@@ -1014,7 +1121,7 @@ class Tapioca::ConfigHelper::ConfigError < ::T::Struct
const :message_parts, T::Array[::Tapioca::ConfigHelper::ConfigErrorMessagePart]
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1025,7 +1132,7 @@ class Tapioca::ConfigHelper::ConfigErrorMessagePart < ::T::Struct
const :colors, T::Array[::Symbol]
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
@@ -1082,17 +1189,17 @@ class Tapioca::Dsl::Compiler
ConstantType = type_member { { upper: Module } }
- # source://tapioca//lib/tapioca/dsl/compiler.rb#60
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#64
sig { params(pipeline: ::Tapioca::Dsl::Pipeline, root: ::RBI::Tree, constant: ConstantType).void }
def initialize(pipeline, root, constant); end
# NOTE: This should eventually accept an `Error` object or `Exception` rather than simply a `String`.
#
- # source://tapioca//lib/tapioca/dsl/compiler.rb#77
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#81
sig { params(error: ::String).void }
def add_error(error); end
- # source://tapioca//lib/tapioca/dsl/compiler.rb#68
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#72
sig { params(compiler_name: ::String).returns(T::Boolean) }
def compiler_enabled?(compiler_name); end
@@ -1102,7 +1209,7 @@ class Tapioca::Dsl::Compiler
# @abstract
#
- # source://tapioca//lib/tapioca/dsl/compiler.rb#73
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#77
sig { abstract.void }
def decorate; end
@@ -1112,21 +1219,21 @@ class Tapioca::Dsl::Compiler
private
- # source://tapioca//lib/tapioca/dsl/compiler.rb#126
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#130
sig { params(method_def: T.any(::Method, ::UnboundMethod)).returns(T::Array[::RBI::TypedParam]) }
def compile_method_parameters_to_rbi(method_def); end
- # source://tapioca//lib/tapioca/dsl/compiler.rb#162
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#166
sig { params(method_def: T.any(::Method, ::UnboundMethod)).returns(::String) }
def compile_method_return_type_to_rbi(method_def); end
- # source://tapioca//lib/tapioca/dsl/compiler.rb#116
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#120
sig { params(scope: ::RBI::Scope, method_def: T.any(::Method, ::UnboundMethod), class_method: T::Boolean).void }
def create_method_from_def(scope, method_def, class_method: T.unsafe(nil)); end
# Get the types of each parameter from a method signature
#
- # source://tapioca//lib/tapioca/dsl/compiler.rb#90
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#94
sig { params(method_def: T.any(::Method, ::UnboundMethod), signature: T.untyped).returns(T::Array[::String]) }
def parameters_types_from_signature(method_def, signature); end
@@ -1151,7 +1258,7 @@ class Tapioca::Dsl::Compiler
sig { returns(T::Enumerable[T::Class[T.anything]]) }
def all_classes; end
- # source://tapioca//lib/tapioca/dsl/compiler.rb#53
+ # source://tapioca//lib/tapioca/dsl/compiler.rb#55
sig { returns(T::Enumerable[::Module]) }
def all_modules; end
end
@@ -1228,15 +1335,15 @@ class Tapioca::Dsl::Pipeline
private
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#193
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#199
sig { void }
def abort_if_pending_migrations!; end
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#139
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#144
sig { params(constants: T::Set[::Module]).returns(T::Set[::Module]) }
def filter_anonymous_and_reloaded_constants(constants); end
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#122
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#124
sig do
params(
requested_compilers: T::Array[T.class_of(Tapioca::Dsl::Compiler)],
@@ -1245,7 +1352,7 @@ class Tapioca::Dsl::Pipeline
end
def gather_active_compilers(requested_compilers, excluded_compilers); end
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#130
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#132
sig do
params(
requested_constants: T::Array[::Module],
@@ -1254,11 +1361,11 @@ class Tapioca::Dsl::Pipeline
end
def gather_constants(requested_constants, requested_paths); end
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#167
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#173
sig { params(constant: ::Module).returns(T.nilable(::RBI::File)) }
def rbi_for_constant(constant); end
- # source://tapioca//lib/tapioca/dsl/pipeline.rb#186
+ # source://tapioca//lib/tapioca/dsl/pipeline.rb#192
sig { params(error: ::String).returns(T.noreturn) }
def report_error(error); end
end
@@ -1454,19 +1561,19 @@ class Tapioca::Gem::Listeners::Methods < ::Tapioca::Gem::Listeners::Base
end
def compile_method(tree, symbol_name, constant, method, visibility = T.unsafe(nil)); end
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#212
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#211
sig { override.params(event: ::Tapioca::Gem::NodeAdded).returns(T::Boolean) }
def ignore?(event); end
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#205
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#204
sig { params(constant: ::Module).returns(T.nilable(::UnboundMethod)) }
def initialize_method_for(constant); end
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#173
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#172
sig { params(mod: ::Module).returns(T::Hash[::Symbol, T::Array[::Symbol]]) }
def method_names_by_visibility(mod); end
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#197
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#196
sig { params(attached_class: T.nilable(::Module), method_name: ::Symbol).returns(T.nilable(T::Boolean)) }
def method_new_in_abstract_class?(attached_class, method_name); end
@@ -1480,7 +1587,7 @@ class Tapioca::Gem::Listeners::Methods < ::Tapioca::Gem::Listeners::Base
# It walks up the ancestor tree via the `super_method` method; if any of the super
# methods are owned by the constant, it means that the constant declares the method.
#
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#159
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#158
sig { params(method: ::UnboundMethod, constant: ::Module).returns(T::Boolean) }
def method_owned_by_constant?(method, constant); end
@@ -1488,7 +1595,7 @@ class Tapioca::Gem::Listeners::Methods < ::Tapioca::Gem::Listeners::Base
sig { override.params(event: ::Tapioca::Gem::ScopeNodeAdded).void }
def on_scope(event); end
- # source://tapioca//lib/tapioca/gem/listeners/methods.rb#182
+ # source://tapioca//lib/tapioca/gem/listeners/methods.rb#181
sig { params(constant: ::Module, method_name: ::String).returns(T::Boolean) }
def struct_method?(constant, method_name); end
end
@@ -1618,7 +1725,7 @@ class Tapioca::Gem::Listeners::SorbetSignatures < ::Tapioca::Gem::Listeners::Bas
sig { params(signature: T.untyped, parameters: T::Array[[::Symbol, ::String]]).returns(::RBI::Sig) }
def compile_signature(signature, parameters); end
- # source://tapioca//lib/tapioca/gem/listeners/sorbet_signatures.rb#78
+ # source://tapioca//lib/tapioca/gem/listeners/sorbet_signatures.rb#79
sig { override.params(event: ::Tapioca::Gem::NodeAdded).returns(T::Boolean) }
def ignore?(event); end
@@ -1796,7 +1903,7 @@ class Tapioca::Gem::Pipeline
sig { returns(::RBI::Tree) }
def compile; end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#110
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#119
sig { params(name: T.any(::String, ::Symbol)).returns(T::Boolean) }
def constant_in_gem?(name); end
@@ -1804,31 +1911,33 @@ class Tapioca::Gem::Pipeline
sig { returns(::Tapioca::Gemfile::GemSpec) }
def gem; end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#122
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#137
sig { params(method: ::UnboundMethod).returns(T::Boolean) }
def method_in_gem?(method); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#130
+ # Helpers
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#147
sig { params(constant: ::Module).returns(T.nilable(::String)) }
def name_of(constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#69
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#71
sig { params(symbol: ::String, constant: ::Module, node: ::RBI::Const).void }
def push_const(symbol, constant, node); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#59
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#61
sig { params(symbol: ::String, constant: ::BasicObject).void }
def push_constant(symbol, constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#64
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#66
sig { params(symbol: ::String, constant: ::Module).void }
def push_foreign_constant(symbol, constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#83
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#85
sig { params(symbol: ::String, constant: ::Module, node: ::RBI::Scope).void }
def push_foreign_scope(symbol, constant, node); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#97
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#99
sig do
params(
symbol: ::String,
@@ -1841,103 +1950,148 @@ class Tapioca::Gem::Pipeline
end
def push_method(symbol, constant, method, node, signature, parameters); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#76
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#78
sig { params(symbol: ::String, constant: ::Module, node: ::RBI::Scope).void }
def push_scope(symbol, constant, node); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#54
+ # Events handling
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#56
sig { params(symbol: ::String).void }
def push_symbol(symbol); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#102
+ # Constants and properties filtering
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#106
sig { params(symbol_name: ::String).returns(T::Boolean) }
def symbol_in_payload?(symbol_name); end
private
- # source://tapioca//lib/tapioca/gem/pipeline.rb#376
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#440
sig { params(name: ::String).void }
def add_to_alias_namespace(name); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#381
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#445
sig { params(name: ::String).returns(T::Boolean) }
def alias_namespaced?(name); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#225
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#244
sig { params(name: ::String, constant: ::Module).void }
def compile_alias(name, constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#211
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#230
sig { params(symbol: ::String, constant: ::BasicObject).void }
def compile_constant(symbol, constant); end
- # Compile
+ # Compiling
#
- # source://tapioca//lib/tapioca/gem/pipeline.rb#206
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#219
sig { params(symbol: ::String, constant: ::Module).void }
def compile_foreign_constant(symbol, constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#283
- sig { params(name: ::String, constant: ::Module, foreign_constant: T::Boolean).void }
- def compile_module(name, constant, foreign_constant: T.unsafe(nil)); end
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#298
+ sig { params(name: ::String, constant: ::Module).void }
+ def compile_module(name, constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#247
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#265
sig { params(name: ::String, value: ::BasicObject).void }
def compile_object(name, value); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#308
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#309
+ sig { params(name: ::String, constant: ::Module).returns(::RBI::Scope) }
+ def compile_scope(name, constant); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#323
sig { params(constant: T::Class[T.anything]).returns(T.nilable(::String)) }
def compile_superclass(constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#357
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#421
sig { params(constant: ::Module, strict: T::Boolean).returns(T::Boolean) }
def defined_in_gem?(constant, strict: T.unsafe(nil)); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#158
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#177
sig { params(event: ::Tapioca::Gem::Event).void }
def dispatch(event); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#398
+ # Helpers
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#464
sig { params(constant: T.all(::Module, ::T::Generic)).returns(::String) }
def generic_name_of(constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#369
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#433
sig { params(constant: ::Module).returns(T::Set[::String]) }
def get_file_candidates(constant); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#145
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#162
sig { params(gem: ::Tapioca::Gemfile::GemSpec).returns(T::Set[::String]) }
def load_bootstrap_symbols(gem); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#388
- sig { params(name: ::String).void }
- def mark_seen(name); end
-
- # source://tapioca//lib/tapioca/gem/pipeline.rb#414
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#480
sig { params(constant: ::Module, class_name: T.nilable(::String)).returns(T.nilable(::String)) }
def name_of_proxy_target(constant, class_name); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#153
+ # Events handling
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#172
sig { returns(::Tapioca::Gem::Event) }
def next_event; end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#181
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#200
sig { params(event: ::Tapioca::Gem::ConstantFound).void }
def on_constant(event); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#199
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#212
sig { params(event: ::Tapioca::Gem::NodeAdded).void }
def on_node(event); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#172
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#191
sig { params(event: ::Tapioca::Gem::SymbolFound).void }
def on_symbol(event); end
- # source://tapioca//lib/tapioca/gem/pipeline.rb#393
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#452
+ sig { params(name: ::String).void }
+ def seen!(name); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#457
sig { params(name: ::String).returns(T::Boolean) }
def seen?(name); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#391
+ sig { params(name: ::String, constant: ::Module).returns(T::Boolean) }
+ def skip_alias?(name, constant); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#379
+ sig { params(name: ::String, constant: T.anything).returns(T::Boolean) }
+ def skip_constant?(name, constant); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#408
+ sig { params(name: ::String, constant: ::Module).returns(T::Boolean) }
+ def skip_foreign_constant?(name, constant); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#413
+ sig { params(name: ::String, constant: ::Module).returns(T::Boolean) }
+ def skip_module?(name, constant); end
+
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#400
+ sig { params(name: ::String, constant: ::BasicObject).returns(T::Boolean) }
+ def skip_object?(name, constant); end
+
+ # Constants and properties filtering
+ #
+ # source://tapioca//lib/tapioca/gem/pipeline.rb#374
+ sig { params(name: ::String).returns(T::Boolean) }
+ def skip_symbol?(name); end
end
+# this looks something like:
+# "(eval at /path/to/file.rb:123)"
+# and we are just interested in the "/path/to/file.rb" part
+#
+# source://tapioca//lib/tapioca/gem/pipeline.rb#116
+Tapioca::Gem::Pipeline::EVAL_SOURCE_FILE_PATTERN = T.let(T.unsafe(nil), Regexp)
+
# source://tapioca//lib/tapioca/gem/pipeline.rb#11
Tapioca::Gem::Pipeline::IGNORED_SYMBOLS = T.let(T.unsafe(nil), Array)
@@ -2050,90 +2204,94 @@ end
class Tapioca::Gemfile::GemSpec
include ::Tapioca::GemHelper
- # source://tapioca//lib/tapioca/gemfile.rb#135
+ # source://tapioca//lib/tapioca/gemfile.rb#136
sig { params(spec: T.any(::Bundler::StubSpecification, ::Gem::Specification)).void }
def initialize(spec); end
- # source://tapioca//lib/tapioca/gemfile.rb#145
+ # source://tapioca//lib/tapioca/gemfile.rb#146
sig { params(other: ::BasicObject).returns(T::Boolean) }
def ==(other); end
- # source://tapioca//lib/tapioca/gemfile.rb#165
+ # source://tapioca//lib/tapioca/gemfile.rb#171
sig { params(path: ::String).returns(T::Boolean) }
def contains_path?(path); end
- # source://tapioca//lib/tapioca/gemfile.rb#184
+ # source://tapioca//lib/tapioca/gemfile.rb#161
+ sig { returns(T::Array[::Gem::Dependency]) }
+ def dependencies; end
+
+ # source://tapioca//lib/tapioca/gemfile.rb#190
sig { returns(T::Boolean) }
def export_rbi_files?; end
- # source://tapioca//lib/tapioca/gemfile.rb#179
+ # source://tapioca//lib/tapioca/gemfile.rb#185
sig { returns(T::Array[::String]) }
def exported_rbi_files; end
- # source://tapioca//lib/tapioca/gemfile.rb#189
+ # source://tapioca//lib/tapioca/gemfile.rb#195
sig { returns(::RBI::MergeTree) }
def exported_rbi_tree; end
- # source://tapioca//lib/tapioca/gemfile.rb#132
+ # source://tapioca//lib/tapioca/gemfile.rb#133
sig { returns(T::Array[::Pathname]) }
def files; end
- # source://tapioca//lib/tapioca/gemfile.rb#129
+ # source://tapioca//lib/tapioca/gemfile.rb#130
sig { returns(::String) }
def full_gem_path; end
- # source://tapioca//lib/tapioca/gemfile.rb#150
+ # source://tapioca//lib/tapioca/gemfile.rb#151
sig { params(gemfile_dir: ::String).returns(T::Boolean) }
def ignore?(gemfile_dir); end
- # source://tapioca//lib/tapioca/gemfile.rb#155
+ # source://tapioca//lib/tapioca/gemfile.rb#156
sig { returns(::String) }
def name; end
- # source://tapioca//lib/tapioca/gemfile.rb#174
+ # source://tapioca//lib/tapioca/gemfile.rb#180
sig { void }
def parse_yard_docs; end
- # source://tapioca//lib/tapioca/gemfile.rb#160
+ # source://tapioca//lib/tapioca/gemfile.rb#166
sig { returns(::String) }
def rbi_file_name; end
- # source://tapioca//lib/tapioca/gemfile.rb#201
+ # source://tapioca//lib/tapioca/gemfile.rb#207
sig { params(file: ::Pathname).returns(::Pathname) }
def relative_path_for(file); end
# @return [String]
#
- # source://tapioca//lib/tapioca/gemfile.rb#129
+ # source://tapioca//lib/tapioca/gemfile.rb#130
def version; end
private
- # source://tapioca//lib/tapioca/gemfile.rb#212
+ # source://tapioca//lib/tapioca/gemfile.rb#218
sig { returns(T::Array[::Pathname]) }
def collect_files; end
- # source://tapioca//lib/tapioca/gemfile.rb#227
+ # source://tapioca//lib/tapioca/gemfile.rb#233
sig { returns(T.nilable(T::Boolean)) }
def default_gem?; end
- # source://tapioca//lib/tapioca/gemfile.rb#285
+ # source://tapioca//lib/tapioca/gemfile.rb#292
sig { returns(T::Boolean) }
def gem_ignored?; end
- # source://tapioca//lib/tapioca/gemfile.rb#264
+ # source://tapioca//lib/tapioca/gemfile.rb#271
sig { params(path: ::String).returns(T::Boolean) }
def has_parent_gemspec?(path); end
- # source://tapioca//lib/tapioca/gemfile.rb#232
+ # source://tapioca//lib/tapioca/gemfile.rb#238
sig { returns(::Regexp) }
def require_paths_prefix_matcher; end
- # source://tapioca//lib/tapioca/gemfile.rb#243
+ # source://tapioca//lib/tapioca/gemfile.rb#250
sig { params(file: ::String).returns(::Pathname) }
def resolve_to_ruby_lib_dir(file); end
- # source://tapioca//lib/tapioca/gemfile.rb#257
+ # source://tapioca//lib/tapioca/gemfile.rb#264
sig { returns(::String) }
def version_string; end
@@ -2172,11 +2330,11 @@ class Tapioca::Loaders::Dsl < ::Tapioca::Loaders::Loader
protected
- # source://tapioca//lib/tapioca/loaders/dsl.rb#71
+ # source://tapioca//lib/tapioca/loaders/dsl.rb#81
sig { void }
def load_application; end
- # source://tapioca//lib/tapioca/loaders/dsl.rb#53
+ # source://tapioca//lib/tapioca/loaders/dsl.rb#63
sig { void }
def load_dsl_compilers; end
@@ -2263,6 +2421,17 @@ class Tapioca::Loaders::Loader
private
+ # Rails 7.2 renamed `eager_load_paths` to `all_eager_load_paths`, which maintains the same original functionality.
+ # The `eager_load_paths` method still exists, but doesn't return all paths anymore and causes Tapioca to miss some
+ # engine paths. The following commit is the change:
+ # https://github.com/rails/rails/commit/ebfca905db14020589c22e6937382e6f8f687664
+ #
+ # @param engine [T.class_of(Rails::Engine)]
+ # @return [Array]
+ #
+ # source://sorbet-runtime/0.5.11212/lib/types/private/methods/_methods.rb#252
+ def eager_load_paths(*args, **_arg1, &blk); end
+
# source://tapioca//lib/tapioca/loaders/loader.rb#198
sig { void }
def eager_load_rails_app; end
@@ -2826,6 +2995,10 @@ module Tapioca::Runtime::Reflection
sig { params(parent: ::Module, name: ::String).returns(T.nilable(::Module)) }
def child_module_for_parent_with_name(parent, name); end
+ # source://tapioca//lib/tapioca/runtime/reflection.rb#260
+ sig { params(name: ::String).returns(T::Boolean) }
+ def has_aliased_namespace?(name); end
+
# source://tapioca//lib/tapioca/runtime/reflection.rb#255
sig { params(method: ::UnboundMethod).returns(T::Boolean) }
def method_defined_by_forwardable_module?(method); end
@@ -3074,15 +3247,15 @@ Tapioca::SORBET_DIR = T.let(T.unsafe(nil), String)
# source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#5
module Tapioca::SorbetHelper
- # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#34
+ # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#32
sig { params(sorbet_args: ::String).returns(::Spoom::ExecResult) }
def sorbet(*sorbet_args); end
- # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#39
+ # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#37
sig { returns(::String) }
def sorbet_path; end
- # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#46
+ # source://tapioca//lib/tapioca/helpers/sorbet_helper.rb#44
sig { params(feature: ::Symbol, version: T.nilable(::Gem::Version)).returns(T::Boolean) }
def sorbet_supports?(feature, version: T.unsafe(nil)); end
end
@@ -3148,7 +3321,7 @@ module Tapioca::Static::SymbolLoader
sig { params(gem: ::Tapioca::Gemfile::GemSpec).returns(T::Set[::String]) }
def engine_symbols(gem); end
- # source://tapioca//lib/tapioca/static/symbol_loader.rb#40
+ # source://tapioca//lib/tapioca/static/symbol_loader.rb#48
sig { params(gem: ::Tapioca::Gemfile::GemSpec).returns(T::Set[::String]) }
def gem_symbols(gem); end
@@ -3156,7 +3329,7 @@ module Tapioca::Static::SymbolLoader
sig { returns(T::Set[::String]) }
def payload_symbols; end
- # source://tapioca//lib/tapioca/static/symbol_loader.rb#45
+ # source://tapioca//lib/tapioca/static/symbol_loader.rb#53
sig { params(paths: T::Array[::Pathname]).returns(T::Set[::String]) }
def symbols_from_paths(paths); end
@@ -3164,10 +3337,10 @@ module Tapioca::Static::SymbolLoader
# @return [Array]
#
- # source://sorbet-runtime/0.5.10900/lib/types/private/methods/_methods.rb#255
+ # source://sorbet-runtime/0.5.11212/lib/types/private/methods/_methods.rb#252
def engines(*args, **_arg1, &blk); end
- # source://tapioca//lib/tapioca/static/symbol_loader.rb#73
+ # source://tapioca//lib/tapioca/static/symbol_loader.rb#82
sig { params(input: ::String, table_type: ::String).returns(::String) }
def symbol_table_json_from(input, table_type: T.unsafe(nil)); end
end
@@ -3207,16 +3380,16 @@ Tapioca::TAPIOCA_CONFIG_FILE = T.let(T.unsafe(nil), String)
# source://tapioca//lib/tapioca.rb#34
Tapioca::TAPIOCA_DIR = T.let(T.unsafe(nil), String)
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#137
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#108
class Tapioca::TypeVariable < ::T::Types::TypeVariable
# @return [TypeVariable] a new instance of TypeVariable
#
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#138
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#109
def initialize(name, variance); end
# Returns the value of attribute name.
#
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#143
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#114
def name; end
end
@@ -3226,69 +3399,50 @@ end
# need to do any matching of constants to type variables to bind their names, Ruby will
# do that automatically for us and we get the `name` method for free from `Module`.
#
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#151
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#122
class Tapioca::TypeVariableModule < ::Module
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#177
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#146
sig do
params(
context: ::Module,
type: ::Tapioca::TypeVariableModule::Type,
variance: ::Symbol,
- fixed: T.untyped,
- lower: T.untyped,
- upper: T.untyped,
bounds_proc: T.nilable(T.proc.returns(T::Hash[::Symbol, T.untyped]))
).void
end
- def initialize(context, type, variance, fixed, lower, upper, bounds_proc); end
+ def initialize(context, type, variance, bounds_proc); end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#231
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#181
sig { returns(::Tapioca::TypeVariable) }
def coerce_to_type_variable; end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#211
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#161
sig { returns(T::Boolean) }
def fixed?; end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#192
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#155
sig { returns(T.nilable(::String)) }
def name; end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#216
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#166
sig { returns(::String) }
def serialize; end
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#163
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#136
sig { returns(::Tapioca::TypeVariableModule::Type) }
def type; end
private
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#265
+ # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#188
sig { returns(T::Hash[::Symbol, T.untyped]) }
def bounds; end
-
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#241
- sig do
- params(
- fixed: T.untyped,
- lower: T.untyped,
- upper: T.untyped
- ).returns(T.proc.returns(T::Hash[::Symbol, T.untyped]))
- end
- def build_bounds_proc(fixed, lower, upper); end
-
- # source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#255
- sig do
- type_parameters(:Result)
- .params(
- block: T.proc.returns(T.type_parameter(:Result))
- ).returns(T.type_parameter(:Result))
- end
- def with_bound_name_pre_3_0(&block); end
end
-# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#154
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#133
+Tapioca::TypeVariableModule::DEFAULT_BOUNDS_PROC = T.let(T.unsafe(nil), Proc)
+
+# source://tapioca//lib/tapioca/sorbet_ext/generic_name_patch.rb#125
class Tapioca::TypeVariableModule::Type < ::T::Enum
enums do
Member = new
@@ -3311,14 +3465,14 @@ class URI::Source < ::URI::File
sig { params(v: T.nilable(::String)).returns(T::Boolean) }
def check_host(v); end
- # source://uri/0.12.1/uri/generic.rb#243
+ # source://uri/0.13.0/uri/generic.rb#243
def gem_name; end
# source://tapioca//lib/tapioca/helpers/source_uri.rb#25
sig { returns(T.nilable(::String)) }
def gem_version; end
- # source://uri/0.12.1/uri/generic.rb#283
+ # source://uri/0.13.0/uri/generic.rb#283
def line_number; end
# source://tapioca//lib/tapioca/helpers/source_uri.rb#51
diff --git a/sorbet/rbi/gems/thor@1.2.2.rbi b/sorbet/rbi/gems/thor@1.3.0.rbi
similarity index 80%
rename from sorbet/rbi/gems/thor@1.2.2.rbi
rename to sorbet/rbi/gems/thor@1.3.0.rbi
index dcb11ee..9ed8f62 100644
--- a/sorbet/rbi/gems/thor@1.2.2.rbi
+++ b/sorbet/rbi/gems/thor@1.3.0.rbi
@@ -4,6 +4,30 @@
# This is an autogenerated file for types exported from the `thor` gem.
# Please instead update this file by running `bin/tapioca gem thor`.
+# source://thor//lib/thor/shell/lcs_diff.rb#1
+module LCSDiff
+ protected
+
+ # Overwrite show_diff to show diff with colors if Diff::LCS is
+ # available.
+ #
+ # source://thor//lib/thor/shell/lcs_diff.rb#6
+ def show_diff(destination, content); end
+
+ private
+
+ # Check if Diff::LCS is loaded. If it is, use it to create pretty output
+ # for diff.
+ #
+ # @return [Boolean]
+ #
+ # source://thor//lib/thor/shell/lcs_diff.rb#37
+ def diff_lcs_loaded?; end
+
+ # source://thor//lib/thor/shell/lcs_diff.rb#21
+ def output_diff_line(diff); end
+end
+
# source://thor//lib/thor/command.rb#1
class Thor
include ::Thor::Base
@@ -12,23 +36,63 @@ class Thor
extend ::Thor::Base::ClassMethods
extend ::Thor::Invocation::ClassMethods
- # source://thor//lib/thor.rb#505
+ # source://thor//lib/thor.rb#652
def help(command = T.unsafe(nil), subcommand = T.unsafe(nil)); end
class << self
+ # Adds and declares option group for required at least one of options in the
+ # block of arguments. You can declare options as the outside of the block.
+ #
+ # If :for is given as option, it allows you to change the options from
+ # a previous defined command.
+ #
+ # ==== Parameters
+ # Array[Thor::Option.name]
+ # options:: :for is applied for previous defined command.
+ #
+ # ==== Examples
+ #
+ # at_least_one do
+ # option :one
+ # option :two
+ # end
+ #
+ # Or
+ #
+ # option :one
+ # option :two
+ # at_least_one :one, :two
+ #
+ # If you do not give "--one" and "--two" AtLeastOneRequiredArgumentError
+ # will be raised.
+ #
+ # You can use at_least_one and exclusive at the same time.
+ #
+ # exclusive do
+ # at_least_one do
+ # option :one
+ # option :two
+ # end
+ # end
+ #
+ # Then it is required either only one of "--one" or "--two".
+ #
+ # source://thor//lib/thor.rb#246
+ def at_least_one(*args, &block); end
+
# Extend check unknown options to accept a hash of conditions.
#
# === Parameters
# options: A hash containing :only and/or :except keys
#
- # source://thor//lib/thor.rb#255
+ # source://thor//lib/thor.rb#350
def check_unknown_options!(options = T.unsafe(nil)); end
# Overwrite check_unknown_options? to take subcommands and options into account.
#
# @return [Boolean]
#
- # source://thor//lib/thor.rb#268
+ # source://thor//lib/thor.rb#363
def check_unknown_options?(config); end
# Prints help information for the given command.
@@ -37,7 +101,7 @@ class Thor
# shell
# command_name
#
- # source://thor//lib/thor.rb#172
+ # source://thor//lib/thor.rb#258
def command_help(shell, command_name); end
# Sets the default command when thor is executed without an explicit command to be called.
@@ -76,28 +140,64 @@ class Thor
# ==== Parameters
# Symbol ...:: A list of commands that should be affected.
#
- # source://thor//lib/thor.rb#339
+ # source://thor//lib/thor.rb#434
def disable_required_check!(*command_names); end
# @return [Boolean]
#
- # source://thor//lib/thor.rb#343
+ # source://thor//lib/thor.rb#438
def disable_required_check?(command); end
+ # Adds and declares option group for exclusive options in the
+ # block and arguments. You can declare options as the outside of the block.
+ #
+ # If :for is given as option, it allows you to change the options from
+ # a previous defined command.
+ #
+ # ==== Parameters
+ # Array[Thor::Option.name]
+ # options:: :for is applied for previous defined command.
+ #
+ # ==== Examples
+ #
+ # exclusive do
+ # option :one
+ # option :two
+ # end
+ #
+ # Or
+ #
+ # option :one
+ # option :two
+ # exclusive :one, :two
+ #
+ # If you give "--one" and "--two" at the same time ExclusiveArgumentsError
+ # will be raised.
+ #
+ # source://thor//lib/thor.rb#203
+ def exclusive(*args, &block); end
+
# Prints help information for this class.
#
# ==== Parameters
# shell
#
- # source://thor//lib/thor.rb#195
+ # source://thor//lib/thor.rb#288
def help(shell, subcommand = T.unsafe(nil)); end
# Defines the long description of the next command.
#
+ # Long description is by default indented, line-wrapped and repeated whitespace merged.
+ # In order to print long description verbatim, with indentation and spacing exactly
+ # as found in the code, use the +wrap+ option
+ #
+ # long_desc 'your very long description', wrap: false
+ #
# ==== Parameters
# long description
+ # options
#
- # source://thor//lib/thor.rb#71
+ # source://thor//lib/thor.rb#78
def long_desc(long_description, options = T.unsafe(nil)); end
# Maps an input to a command. If you define:
@@ -113,9 +213,78 @@ class Thor
# ==== Parameters
# Hash[String|Array => Symbol]:: Maps the string or the strings in the array to the given command.
#
- # source://thor//lib/thor.rb#93
+ # source://thor//lib/thor.rb#101
def map(mappings = T.unsafe(nil), **kw); end
+ # Adds and declares option group for required at least one of options in the
+ # block of arguments. You can declare options as the outside of the block.
+ #
+ # If :for is given as option, it allows you to change the options from
+ # a previous defined command.
+ #
+ # ==== Parameters
+ # Array[Thor::Option.name]
+ # options:: :for is applied for previous defined command.
+ #
+ # ==== Examples
+ #
+ # at_least_one do
+ # option :one
+ # option :two
+ # end
+ #
+ # Or
+ #
+ # option :one
+ # option :two
+ # at_least_one :one, :two
+ #
+ # If you do not give "--one" and "--two" AtLeastOneRequiredArgumentError
+ # will be raised.
+ #
+ # You can use at_least_one and exclusive at the same time.
+ #
+ # exclusive do
+ # at_least_one do
+ # option :one
+ # option :two
+ # end
+ # end
+ #
+ # Then it is required either only one of "--one" or "--two".
+ #
+ # source://thor//lib/thor.rb#246
+ def method_at_least_one(*args, &block); end
+
+ # Adds and declares option group for exclusive options in the
+ # block and arguments. You can declare options as the outside of the block.
+ #
+ # If :for is given as option, it allows you to change the options from
+ # a previous defined command.
+ #
+ # ==== Parameters
+ # Array[Thor::Option.name]
+ # options:: :for is applied for previous defined command.
+ #
+ # ==== Examples
+ #
+ # exclusive do
+ # option :one
+ # option :two
+ # end
+ #
+ # Or
+ #
+ # option :one
+ # option :two
+ # exclusive :one, :two
+ #
+ # If you give "--one" and "--two" at the same time ExclusiveArgumentsError
+ # will be raised.
+ #
+ # source://thor//lib/thor.rb#203
+ def method_exclusive(*args, &block); end
+
# Adds an option to the set of method options. If :for is given as option,
# it allows you to change the options from a previous defined command.
#
@@ -123,7 +292,7 @@ class Thor
# # magic
# end
#
- # method_option :foo => :bar, :for => :previous_command
+ # method_option :foo, :for => :previous_command
#
# def next_command
# # magic
@@ -142,7 +311,7 @@ class Thor
# :banner - String to show on usage notes.
# :hide - If you want to hide this option from the help.
#
- # source://thor//lib/thor.rb#155
+ # source://thor//lib/thor.rb#163
def method_option(name, options = T.unsafe(nil)); end
# Declares the options for the next command to be declared.
@@ -152,7 +321,7 @@ class Thor
# is the type of the option. Can be :string, :array, :hash, :boolean, :numeric
# or :required (string). If you give a value, the type of the value is used.
#
- # source://thor//lib/thor.rb#121
+ # source://thor//lib/thor.rb#129
def method_options(options = T.unsafe(nil)); end
# Adds an option to the set of method options. If :for is given as option,
@@ -162,7 +331,7 @@ class Thor
# # magic
# end
#
- # method_option :foo => :bar, :for => :previous_command
+ # method_option :foo, :for => :previous_command
#
# def next_command
# # magic
@@ -181,7 +350,7 @@ class Thor
# :banner - String to show on usage notes.
# :hide - If you want to hide this option from the help.
#
- # source://thor//lib/thor.rb#155
+ # source://thor//lib/thor.rb#163
def option(name, options = T.unsafe(nil)); end
# Declares the options for the next command to be declared.
@@ -191,7 +360,7 @@ class Thor
# is the type of the option. Can be :string, :array, :hash, :boolean, :numeric
# or :required (string). If you give a value, the type of the value is used.
#
- # source://thor//lib/thor.rb#121
+ # source://thor//lib/thor.rb#129
def options(options = T.unsafe(nil)); end
# Allows for custom "Command" package naming.
@@ -205,12 +374,12 @@ class Thor
# Returns commands ready to be printed.
#
- # source://thor//lib/thor.rb#214
+ # source://thor//lib/thor.rb#309
def printable_commands(all = T.unsafe(nil), subcommand = T.unsafe(nil)); end
# Returns commands ready to be printed.
#
- # source://thor//lib/thor.rb#214
+ # source://thor//lib/thor.rb#309
def printable_tasks(all = T.unsafe(nil), subcommand = T.unsafe(nil)); end
# Registers another Thor subclass as a command.
@@ -262,27 +431,27 @@ class Thor
# ==== Parameters
# Symbol ...:: A list of commands that should be affected.
#
- # source://thor//lib/thor.rb#325
+ # source://thor//lib/thor.rb#420
def stop_on_unknown_option!(*command_names); end
# @return [Boolean]
#
- # source://thor//lib/thor.rb#329
+ # source://thor//lib/thor.rb#424
def stop_on_unknown_option?(command); end
- # source://thor//lib/thor.rb#234
+ # source://thor//lib/thor.rb#329
def subcommand(subcommand, subcommand_class); end
- # source://thor//lib/thor.rb#230
+ # source://thor//lib/thor.rb#325
def subcommand_classes; end
- # source://thor//lib/thor.rb#225
+ # source://thor//lib/thor.rb#320
def subcommands; end
- # source://thor//lib/thor.rb#234
+ # source://thor//lib/thor.rb#329
def subtask(subcommand, subcommand_class); end
- # source://thor//lib/thor.rb#225
+ # source://thor//lib/thor.rb#320
def subtasks; end
# Prints help information for the given command.
@@ -291,7 +460,7 @@ class Thor
# shell
# command_name
#
- # source://thor//lib/thor.rb#172
+ # source://thor//lib/thor.rb#258
def task_help(shell, command_name); end
protected
@@ -301,50 +470,66 @@ class Thor
# the command that is going to be invoked and a boolean which indicates if
# the namespace should be displayed as arguments.
#
- # source://thor//lib/thor.rb#400
+ # source://thor//lib/thor.rb#535
def banner(command, namespace = T.unsafe(nil), subcommand = T.unsafe(nil)); end
- # source://thor//lib/thor.rb#406
+ # source://thor//lib/thor.rb#541
def baseclass; end
- # source://thor//lib/thor.rb#414
+ # source://thor//lib/thor.rb#549
def create_command(meth); end
- # source://thor//lib/thor.rb#414
+ # source://thor//lib/thor.rb#549
def create_task(meth); end
# help command has the required check disabled by default.
#
- # source://thor//lib/thor.rb#354
+ # source://thor//lib/thor.rb#467
def disable_required_check; end
# The method responsible for dispatching given the args.
#
# @yield [instance]
#
- # source://thor//lib/thor.rb#359
+ # source://thor//lib/thor.rb#494
def dispatch(meth, given_args, given_opts, config); end
- # source://thor//lib/thor.rb#410
+ # source://thor//lib/thor.rb#545
def dynamic_command_class; end
# this is the logic that takes the command name passed in by the user
# and determines whether it is an unambiguous substrings of a command or
# alias name.
#
- # source://thor//lib/thor.rb#476
+ # source://thor//lib/thor.rb#615
def find_command_possibilities(meth); end
# this is the logic that takes the command name passed in by the user
# and determines whether it is an unambiguous substrings of a command or
# alias name.
#
- # source://thor//lib/thor.rb#476
+ # source://thor//lib/thor.rb#615
def find_task_possibilities(meth); end
- # source://thor//lib/thor.rb#436
+ # source://thor//lib/thor.rb#575
def initialize_added; end
+ # Returns this class at least one of required options array set.
+ #
+ # ==== Returns
+ # Array[Array[Thor::Option.name]]
+ #
+ # source://thor//lib/thor.rb#458
+ def method_at_least_one_option_names; end
+
+ # Returns this class exclusive options array set.
+ #
+ # ==== Returns
+ # Array[Array[Thor::Option.name]]
+ #
+ # source://thor//lib/thor.rb#449
+ def method_exclusive_option_names; end
+
# receives a (possibly nil) command name and returns a name that is in
# the commands hash. In addition to normalizing aliases, this logic
# will determine if a shortened command is an unambiguous substring of
@@ -355,7 +540,7 @@ class Thor
#
# @raise [AmbiguousTaskError]
#
- # source://thor//lib/thor.rb#455
+ # source://thor//lib/thor.rb#594
def normalize_command_name(meth); end
# receives a (possibly nil) command name and returns a name that is in
@@ -368,26 +553,40 @@ class Thor
#
# @raise [AmbiguousTaskError]
#
- # source://thor//lib/thor.rb#455
+ # source://thor//lib/thor.rb#594
def normalize_task_name(meth); end
+ # source://thor//lib/thor.rb#482
+ def print_at_least_one_required_options(shell, command = T.unsafe(nil)); end
+
+ # source://thor//lib/thor.rb#471
+ def print_exclusive_options(shell, command = T.unsafe(nil)); end
+
# Retrieve the command name from given args.
#
- # source://thor//lib/thor.rb#442
+ # source://thor//lib/thor.rb#581
def retrieve_command_name(args); end
# Retrieve the command name from given args.
#
- # source://thor//lib/thor.rb#442
+ # source://thor//lib/thor.rb#581
def retrieve_task_name(args); end
- # source://thor//lib/thor.rb#349
+ # Sort the commands, lexicographically by default.
+ #
+ # Can be overridden in the subclass to change the display order of the
+ # commands.
+ #
+ # source://thor//lib/thor.rb#642
+ def sort_commands!(list); end
+
+ # source://thor//lib/thor.rb#462
def stop_on_unknown_option; end
- # source://thor//lib/thor.rb#491
+ # source://thor//lib/thor.rb#630
def subcommand_help(cmd); end
- # source://thor//lib/thor.rb#491
+ # source://thor//lib/thor.rb#630
def subtask_help(cmd); end
end
end
@@ -463,7 +662,7 @@ module Thor::Actions
# 'config.gem "rspec"'
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#195
+ # source://thor//lib/thor/actions/file_manipulation.rb#193
def append_file(path, *args, &block); end
# Append text to a file. Since it depends on insert_into_file, it's reversible.
@@ -481,7 +680,7 @@ module Thor::Actions
# 'config.gem "rspec"'
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#195
+ # source://thor//lib/thor/actions/file_manipulation.rb#193
def append_to_file(path, *args, &block); end
# Loads an external file and execute it in the instance binding.
@@ -522,7 +721,7 @@ module Thor::Actions
#
# chmod "script/server", 0755
#
- # source://thor//lib/thor/actions/file_manipulation.rb#148
+ # source://thor//lib/thor/actions/file_manipulation.rb#146
def chmod(path, mode, config = T.unsafe(nil)); end
# Comment all lines matching a given regex. It will leave the space
@@ -538,7 +737,7 @@ module Thor::Actions
#
# comment_lines 'config/initializers/session_store.rb', /cookie_store/
#
- # source://thor//lib/thor/actions/file_manipulation.rb#312
+ # source://thor//lib/thor/actions/file_manipulation.rb#310
def comment_lines(path, flag, *args); end
# ==== Examples
@@ -673,17 +872,20 @@ module Thor::Actions
# ==== Parameters
# source:: the address of the given content.
# destination:: the relative path to the destination root.
- # config:: give :verbose => false to not log the status.
+ # config:: give :verbose => false to not log the status, and
+ # :http_headers => to add headers to an http request.
#
# ==== Examples
#
# get "http://gist.github.com/103208", "doc/README"
#
+ # get "http://gist.github.com/103208", "doc/README", :http_headers => {"Content-Type" => "application/json"}
+ #
# get "http://gist.github.com/103208" do |content|
# content.split("\n").first
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#79
+ # source://thor//lib/thor/actions/file_manipulation.rb#82
def get(source, *args, &block); end
# Run a regular expression replacement on a file.
@@ -703,7 +905,7 @@ module Thor::Actions
# match << " no more. Use thor!"
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#265
+ # source://thor//lib/thor/actions/file_manipulation.rb#263
def gsub_file(path, flag, *args, &block); end
# Goes to the root and execute the given block.
@@ -728,7 +930,7 @@ module Thor::Actions
# " filter_parameter :password\n"
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#219
+ # source://thor//lib/thor/actions/file_manipulation.rb#217
def inject_into_class(path, klass, *args, &block); end
# source://thor//lib/thor/actions/inject_into_file.rb#26
@@ -751,7 +953,7 @@ module Thor::Actions
# " def help; 'help'; end\n"
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#242
+ # source://thor//lib/thor/actions/file_manipulation.rb#240
def inject_into_module(path, module_name, *args, &block); end
# source://thor//lib/thor/actions/inject_into_file.rb#26
@@ -803,7 +1005,7 @@ module Thor::Actions
# 'config.gem "rspec"'
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#173
+ # source://thor//lib/thor/actions/file_manipulation.rb#171
def prepend_file(path, *args, &block); end
# Prepend text to a file. Since it depends on insert_into_file, it's reversible.
@@ -821,7 +1023,7 @@ module Thor::Actions
# 'config.gem "rspec"'
# end
#
- # source://thor//lib/thor/actions/file_manipulation.rb#173
+ # source://thor//lib/thor/actions/file_manipulation.rb#171
def prepend_to_file(path, *args, &block); end
# Returns the given path relative to the absolute root (ie, root where
@@ -841,7 +1043,7 @@ module Thor::Actions
# remove_file 'README'
# remove_file 'app/controllers/application_controller.rb'
#
- # source://thor//lib/thor/actions/file_manipulation.rb#329
+ # source://thor//lib/thor/actions/file_manipulation.rb#327
def remove_dir(path, config = T.unsafe(nil)); end
# Removes a file at the given location.
@@ -855,7 +1057,7 @@ module Thor::Actions
# remove_file 'README'
# remove_file 'app/controllers/application_controller.rb'
#
- # source://thor//lib/thor/actions/file_manipulation.rb#329
+ # source://thor//lib/thor/actions/file_manipulation.rb#327
def remove_file(path, config = T.unsafe(nil)); end
# Executes a command returning the contents of the command.
@@ -871,7 +1073,7 @@ module Thor::Actions
# run('ln -s ~/edge rails')
# end
#
- # source://thor//lib/thor/actions.rb#249
+ # source://thor//lib/thor/actions.rb#248
def run(command, config = T.unsafe(nil)); end
# Executes a ruby script (taking into account WIN32 platform quirks).
@@ -880,7 +1082,7 @@ module Thor::Actions
# command:: the command to be executed.
# config:: give :verbose => false to not log the status.
#
- # source://thor//lib/thor/actions.rb#286
+ # source://thor//lib/thor/actions.rb#285
def run_ruby_script(command, config = T.unsafe(nil)); end
# Holds source paths in instance so they can be manipulated.
@@ -903,7 +1105,7 @@ module Thor::Actions
#
# template "doc/README"
#
- # source://thor//lib/thor/actions/file_manipulation.rb#115
+ # source://thor//lib/thor/actions/file_manipulation.rb#118
def template(source, *args, &block); end
# Run a thor command. A hash of options can be given and it's converted to
@@ -924,7 +1126,7 @@ module Thor::Actions
# thor :list, :all => true, :substring => 'rails'
# #=> thor list --all --substring=rails
#
- # source://thor//lib/thor/actions.rb#309
+ # source://thor//lib/thor/actions.rb#308
def thor(command, *args); end
# Uncomment all lines matching a given regex. It will leave the space
@@ -940,40 +1142,40 @@ module Thor::Actions
#
# uncomment_lines 'config/initializers/session_store.rb', /active_record/
#
- # source://thor//lib/thor/actions/file_manipulation.rb#293
+ # source://thor//lib/thor/actions/file_manipulation.rb#291
def uncomment_lines(path, flag, *args); end
protected
- # source://thor//lib/thor/actions.rb#330
+ # source://thor//lib/thor/actions.rb#329
def _cleanup_options_and_set(options, key); end
# Allow current root to be shared between invocations.
#
- # source://thor//lib/thor/actions.rb#326
+ # source://thor//lib/thor/actions.rb#325
def _shared_configuration; end
private
- # source://thor//lib/thor/actions/file_manipulation.rb#350
+ # source://thor//lib/thor/actions/file_manipulation.rb#348
def capture(*args); end
- # source://thor//lib/thor/actions/file_manipulation.rb#346
+ # source://thor//lib/thor/actions/file_manipulation.rb#344
def concat(string); end
# Returns the value of attribute output_buffer.
#
- # source://thor//lib/thor/actions/file_manipulation.rb#341
+ # source://thor//lib/thor/actions/file_manipulation.rb#339
def output_buffer; end
# Sets the attribute output_buffer
#
# @param value the value to set the attribute output_buffer to.
#
- # source://thor//lib/thor/actions/file_manipulation.rb#341
+ # source://thor//lib/thor/actions/file_manipulation.rb#339
def output_buffer=(_arg0); end
- # source://thor//lib/thor/actions/file_manipulation.rb#354
+ # source://thor//lib/thor/actions/file_manipulation.rb#352
def with_output_buffer(buf = T.unsafe(nil)); end
class << self
@@ -985,9 +1187,9 @@ end
# Thor::Actions#capture depends on what kind of buffer is used in ERB.
# Thus CapturableERB fixes ERB to use String buffer.
#
-# source://thor//lib/thor/actions/file_manipulation.rb#366
+# source://thor//lib/thor/actions/file_manipulation.rb#364
class Thor::Actions::CapturableERB < ::ERB
- # source://thor//lib/thor/actions/file_manipulation.rb#367
+ # source://thor//lib/thor/actions/file_manipulation.rb#365
def set_eoutvar(compiler, eoutvar = T.unsafe(nil)); end
end
@@ -1043,12 +1245,12 @@ class Thor::Actions::CreateFile < ::Thor::Actions::EmptyDirectory
# source://thor//lib/thor/actions/create_file.rb#45
def identical?; end
- # source://thor//lib/thor/actions/create_file.rb#59
+ # source://thor//lib/thor/actions/create_file.rb#60
def invoke!; end
# Holds the content to be added to the file.
#
- # source://thor//lib/thor/actions/create_file.rb#51
+ # source://thor//lib/thor/actions/create_file.rb#52
def render; end
protected
@@ -1057,19 +1259,19 @@ class Thor::Actions::CreateFile < ::Thor::Actions::EmptyDirectory
#
# @return [Boolean]
#
- # source://thor//lib/thor/actions/create_file.rb#99
+ # source://thor//lib/thor/actions/create_file.rb#100
def force_on_collision?; end
# If force is true, run the action, otherwise check if it's not being
# skipped. If both are false, show the file_collision menu, if the menu
# returns true, force it, otherwise skip.
#
- # source://thor//lib/thor/actions/create_file.rb#85
+ # source://thor//lib/thor/actions/create_file.rb#86
def force_or_skip_or_conflict(force, skip, &block); end
# Now on conflict we check if the file is identical or not.
#
- # source://thor//lib/thor/actions/create_file.rb#72
+ # source://thor//lib/thor/actions/create_file.rb#73
def on_conflict_behavior(&block); end
end
@@ -1261,17 +1463,25 @@ class Thor::Actions::InjectIntoFile < ::Thor::Actions::EmptyDirectory
# source://thor//lib/thor/actions/inject_into_file.rb#37
def replacement; end
- # source://thor//lib/thor/actions/inject_into_file.rb#72
+ # source://thor//lib/thor/actions/inject_into_file.rb#74
def revoke!; end
protected
+ # source://thor//lib/thor/actions/inject_into_file.rb#110
+ def content; end
+
# Adds the content to the file.
#
- # source://thor//lib/thor/actions/inject_into_file.rb#108
+ # source://thor//lib/thor/actions/inject_into_file.rb#120
def replace!(regexp, string, force); end
- # source://thor//lib/thor/actions/inject_into_file.rb#88
+ # @return [Boolean]
+ #
+ # source://thor//lib/thor/actions/inject_into_file.rb#114
+ def replacement_present?; end
+
+ # source://thor//lib/thor/actions/inject_into_file.rb#90
def say_status(behavior, warning: T.unsafe(nil), color: T.unsafe(nil)); end
end
@@ -1297,10 +1507,10 @@ end
# source://thor//lib/thor/actions/inject_into_file.rb#24
Thor::Actions::WARNINGS = T.let(T.unsafe(nil), Hash)
-# source://thor//lib/thor/error.rb#68
+# source://thor//lib/thor/error.rb#57
class Thor::AmbiguousCommandError < ::Thor::Error; end
-# source://thor//lib/thor/error.rb#70
+# source://thor//lib/thor/error.rb#59
Thor::AmbiguousTaskError = Thor::AmbiguousCommandError
# source://thor//lib/thor/parser/argument.rb#2
@@ -1331,6 +1541,9 @@ class Thor::Argument
# source://thor//lib/thor/parser/argument.rb#5
def enum; end
+ # source://thor//lib/thor/parser/argument.rb#55
+ def enum_to_s; end
+
# Returns the value of attribute name.
#
# source://thor//lib/thor/parser/argument.rb#5
@@ -1341,6 +1554,9 @@ class Thor::Argument
# source://thor//lib/thor/parser/argument.rb#5
def name; end
+ # source://thor//lib/thor/parser/argument.rb#27
+ def print_default; end
+
# Returns the value of attribute required.
#
# source://thor//lib/thor/parser/argument.rb#5
@@ -1348,12 +1564,12 @@ class Thor::Argument
# @return [Boolean]
#
- # source://thor//lib/thor/parser/argument.rb#31
+ # source://thor//lib/thor/parser/argument.rb#42
def required?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/argument.rb#35
+ # source://thor//lib/thor/parser/argument.rb#46
def show_default?; end
# Returns the value of attribute type.
@@ -1361,22 +1577,22 @@ class Thor::Argument
# source://thor//lib/thor/parser/argument.rb#5
def type; end
- # source://thor//lib/thor/parser/argument.rb#27
+ # source://thor//lib/thor/parser/argument.rb#38
def usage; end
protected
- # source://thor//lib/thor/parser/argument.rb#55
+ # source://thor//lib/thor/parser/argument.rb#74
def default_banner; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/argument.rb#51
+ # source://thor//lib/thor/parser/argument.rb#70
def valid_type?(type); end
# @raise [ArgumentError]
#
- # source://thor//lib/thor/parser/argument.rb#46
+ # source://thor//lib/thor/parser/argument.rb#65
def validate!; end
end
@@ -1392,10 +1608,10 @@ class Thor::Arguments
# source://thor//lib/thor/parser/arguments.rb#26
def initialize(arguments = T.unsafe(nil)); end
- # source://thor//lib/thor/parser/arguments.rb#44
+ # source://thor//lib/thor/parser/arguments.rb#40
def parse(args); end
- # source://thor//lib/thor/parser/arguments.rb#57
+ # source://thor//lib/thor/parser/arguments.rb#53
def remaining; end
private
@@ -1404,22 +1620,22 @@ class Thor::Arguments
#
# @raise [RequiredArgumentMissingError]
#
- # source://thor//lib/thor/parser/arguments.rb#170
+ # source://thor//lib/thor/parser/arguments.rb#186
def check_requirement!; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/arguments.rb#88
+ # source://thor//lib/thor/parser/arguments.rb#84
def current_is_value?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/arguments.rb#68
+ # source://thor//lib/thor/parser/arguments.rb#64
def last?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/arguments.rb#63
+ # source://thor//lib/thor/parser/arguments.rb#59
def no_or_skip?(arg); end
# Runs through the argument array getting all strings until no string is
@@ -1431,7 +1647,7 @@ class Thor::Arguments
#
# ["a", "b", "c"]
#
- # source://thor//lib/thor/parser/arguments.rb#122
+ # source://thor//lib/thor/parser/arguments.rb#118
def parse_array(name); end
# Runs through the argument array getting strings that contains ":" and
@@ -1443,14 +1659,14 @@ class Thor::Arguments
#
# { "name" => "string", "age" => "integer" }
#
- # source://thor//lib/thor/parser/arguments.rb#101
+ # source://thor//lib/thor/parser/arguments.rb#97
def parse_hash(name); end
# Check if the peek is numeric format and return a Float or Integer.
# Check if the peek is included in enum if enum is provided.
# Otherwise raises an error.
#
- # source://thor//lib/thor/parser/arguments.rb#133
+ # source://thor//lib/thor/parser/arguments.rb#139
def parse_numeric(name); end
# Parse string:
@@ -1458,18 +1674,23 @@ class Thor::Arguments
# for --no-string-arg, nil
# Check if the peek is included in enum if enum is provided. Otherwise raises an error.
#
- # source://thor//lib/thor/parser/arguments.rb#154
+ # source://thor//lib/thor/parser/arguments.rb#158
def parse_string(name); end
- # source://thor//lib/thor/parser/arguments.rb#72
+ # source://thor//lib/thor/parser/arguments.rb#68
def peek; end
- # source://thor//lib/thor/parser/arguments.rb#76
+ # source://thor//lib/thor/parser/arguments.rb#72
def shift; end
- # source://thor//lib/thor/parser/arguments.rb#80
+ # source://thor//lib/thor/parser/arguments.rb#76
def unshift(arg); end
+ # Raises an error if the switch is an enum and the values aren't included on it.
+ #
+ # source://thor//lib/thor/parser/arguments.rb#172
+ def validate_enum_value!(name, value, message); end
+
class << self
# source://thor//lib/thor/parser/arguments.rb#19
def parse(*args); end
@@ -1485,6 +1706,9 @@ end
# source://thor//lib/thor/parser/arguments.rb#3
Thor::Arguments::NUMERIC = T.let(T.unsafe(nil), Regexp)
+# source://thor//lib/thor/error.rb#104
+class Thor::AtLeastOneRequiredArgumentError < ::Thor::InvocationError; end
+
# source://thor//lib/thor/shell.rb#4
module Thor::Base
include ::Thor::Invocation
@@ -1549,13 +1773,13 @@ module Thor::Base
def parent_options=(_arg0); end
class << self
- # source://thor//lib/thor/base.rb#100
+ # source://thor//lib/thor/base.rb#116
def included(base); end
# Whenever a class inherits from Thor or Thor::Group, we should track the
# class and the file on Thor::Base. This is the method responsible for it.
#
- # source://thor//lib/thor/base.rb#128
+ # source://thor//lib/thor/base.rb#144
def register_klass_file(klass); end
# Returns the shell used in all Thor classes. If you are in a Unix platform
@@ -1576,7 +1800,7 @@ module Thor::Base
# ==== Returns
# Hash[path => Class]
#
- # source://thor//lib/thor/base.rb#121
+ # source://thor//lib/thor/base.rb#137
def subclass_files; end
# Returns the classes that inherits from Thor or Thor::Group.
@@ -1584,12 +1808,12 @@ module Thor::Base
# ==== Returns
# Array[Class]
#
- # source://thor//lib/thor/base.rb#112
+ # source://thor//lib/thor/base.rb#128
def subclasses; end
end
end
-# source://thor//lib/thor/base.rb#137
+# source://thor//lib/thor/base.rb#153
module Thor::Base::ClassMethods
# Returns the commands for this Thor class and all subclasses.
#
@@ -1597,7 +1821,7 @@ module Thor::Base::ClassMethods
# Hash:: An ordered hash with commands names as keys and Thor::Command
# objects as values.
#
- # source://thor//lib/thor/base.rb#383
+ # source://thor//lib/thor/base.rb#482
def all_commands; end
# Returns the commands for this Thor class and all subclasses.
@@ -1606,13 +1830,13 @@ module Thor::Base::ClassMethods
# Hash:: An ordered hash with commands names as keys and Thor::Command
# objects as values.
#
- # source://thor//lib/thor/base.rb#383
+ # source://thor//lib/thor/base.rb#482
def all_tasks; end
# If you want to use defaults that don't match the type of an option,
# either specify `check_default_type: false` or call `allow_incompatible_default_type!`
#
- # source://thor//lib/thor/base.rb#173
+ # source://thor//lib/thor/base.rb#189
def allow_incompatible_default_type!; end
# Adds an argument to the class and creates an attr_accessor for it.
@@ -1650,7 +1874,7 @@ module Thor::Base::ClassMethods
# ==== Errors
# ArgumentError:: Raised if you supply a required argument after a non required one.
#
- # source://thor//lib/thor/base.rb#245
+ # source://thor//lib/thor/base.rb#261
def argument(name, options = T.unsafe(nil)); end
# Returns this class arguments, looking up in the ancestors chain.
@@ -1658,42 +1882,116 @@ module Thor::Base::ClassMethods
# ==== Returns
# Array[Thor::Argument]
#
- # source://thor//lib/thor/base.rb#277
+ # source://thor//lib/thor/base.rb#293
def arguments; end
- # source://thor//lib/thor/base.rb#146
+ # source://thor//lib/thor/base.rb#162
def attr_accessor(*_arg0); end
- # source://thor//lib/thor/base.rb#138
+ # source://thor//lib/thor/base.rb#154
def attr_reader(*_arg0); end
- # source://thor//lib/thor/base.rb#142
+ # source://thor//lib/thor/base.rb#158
def attr_writer(*_arg0); end
- # source://thor//lib/thor/base.rb#177
+ # source://thor//lib/thor/base.rb#193
def check_default_type; end
# If you want to raise an error when the default value of an option does not match
# the type call check_default_type!
# This will be the default; for compatibility a deprecation warning is issued if necessary.
#
- # source://thor//lib/thor/base.rb#167
+ # source://thor//lib/thor/base.rb#183
def check_default_type!; end
- # source://thor//lib/thor/base.rb#156
+ # source://thor//lib/thor/base.rb#172
def check_unknown_options; end
# If you want to raise an error for unknown options, call check_unknown_options!
# This is disabled by default to allow dynamic invocations.
#
- # source://thor//lib/thor/base.rb#152
+ # source://thor//lib/thor/base.rb#168
def check_unknown_options!; end
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#160
+ # source://thor//lib/thor/base.rb#176
def check_unknown_options?(config); end
+ # Adds and declares option group for required at least one of options in the
+ # block and arguments. You can declare options as the outside of the block.
+ #
+ # ==== Examples
+ #
+ # class_at_least_one do
+ # class_option :one
+ # class_option :two
+ # end
+ #
+ # Or
+ #
+ # class_option :one
+ # class_option :two
+ # class_at_least_one :one, :two
+ #
+ # If you do not give "--one" and "--two" AtLeastOneRequiredArgumentError
+ # will be raised.
+ #
+ # You can use class_at_least_one and class_exclusive at the same time.
+ #
+ # class_exclusive do
+ # class_at_least_one do
+ # class_option :one
+ # class_option :two
+ # end
+ # end
+ #
+ # Then it is required either only one of "--one" or "--two".
+ #
+ # source://thor//lib/thor/base.rb#392
+ def class_at_least_one(*args, &block); end
+
+ # Returns this class at least one of required options array set, looking up in the ancestors chain.
+ #
+ # ==== Returns
+ # Array[Array[Thor::Option.name]]
+ #
+ # source://thor//lib/thor/base.rb#411
+ def class_at_least_one_option_names; end
+
+ # Adds and declares option group for exclusive options in the
+ # block and arguments. You can declare options as the outside of the block.
+ #
+ # ==== Parameters
+ # Array[Thor::Option.name]
+ #
+ # ==== Examples
+ #
+ # class_exclusive do
+ # class_option :one
+ # class_option :two
+ # end
+ #
+ # Or
+ #
+ # class_option :one
+ # class_option :two
+ # class_exclusive :one, :two
+ #
+ # If you give "--one" and "--two" at the same time ExclusiveArgumentsError
+ # will be raised.
+ #
+ # source://thor//lib/thor/base.rb#357
+ def class_exclusive(*args, &block); end
+
+ # Returns this class exclusive options array set, looking up in the ancestors chain.
+ #
+ # ==== Returns
+ # Array[Array[Thor::Option.name]]
+ #
+ # source://thor//lib/thor/base.rb#402
+ def class_exclusive_option_names; end
+
# Adds an option to the set of class options
#
# ==== Parameters
@@ -1710,7 +2008,7 @@ module Thor::Base::ClassMethods
# :banner:: -- String to show on usage notes.
# :hide:: -- If you want to hide this option from the help.
#
- # source://thor//lib/thor/base.rb#312
+ # source://thor//lib/thor/base.rb#328
def class_option(name, options = T.unsafe(nil)); end
# Adds a bunch of options to the set of class options.
@@ -1722,7 +2020,7 @@ module Thor::Base::ClassMethods
# ==== Parameters
# Hash[Symbol => Object]
#
- # source://thor//lib/thor/base.rb#290
+ # source://thor//lib/thor/base.rb#306
def class_options(options = T.unsafe(nil)); end
# Returns the commands for this Thor class.
@@ -1731,7 +2029,7 @@ module Thor::Base::ClassMethods
# Hash:: An ordered hash with commands names as keys and Thor::Command
# objects as values.
#
- # source://thor//lib/thor/base.rb#372
+ # source://thor//lib/thor/base.rb#471
def commands; end
# If true, option set will not suspend the execution of the command when
@@ -1739,14 +2037,14 @@ module Thor::Base::ClassMethods
#
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#191
+ # source://thor//lib/thor/base.rb#207
def disable_required_check?(command_name); end
# A flag that makes the process exit with status 1 if any error happens.
#
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#529
+ # source://thor//lib/thor/base.rb#628
def exit_on_failure?; end
# Defines the group. This is used when thor list is invoked so you can specify
@@ -1755,22 +2053,22 @@ module Thor::Base::ClassMethods
# ==== Parameters
# name
#
- # source://thor//lib/thor/base.rb#358
+ # source://thor//lib/thor/base.rb#457
def group(name = T.unsafe(nil)); end
# @raise [InvocationError]
#
- # source://thor//lib/thor/base.rb#519
+ # source://thor//lib/thor/base.rb#618
def handle_argument_error(command, error, args, arity); end
# @raise [UndefinedCommandError]
#
- # source://thor//lib/thor/base.rb#514
+ # source://thor//lib/thor/base.rb#613
def handle_no_command_error(command, has_namespace = T.unsafe(nil)); end
# @raise [UndefinedCommandError]
#
- # source://thor//lib/thor/base.rb#514
+ # source://thor//lib/thor/base.rb#613
def handle_no_task_error(command, has_namespace = T.unsafe(nil)); end
# Sets the namespace for the Thor or Thor::Group class. By default the
@@ -1795,7 +2093,7 @@ module Thor::Base::ClassMethods
#
# thor :my_command
#
- # source://thor//lib/thor/base.rb#467
+ # source://thor//lib/thor/base.rb#566
def namespace(name = T.unsafe(nil)); end
# All methods defined inside the given block are not added as commands.
@@ -1817,15 +2115,15 @@ module Thor::Base::ClassMethods
# remove_command :this_is_not_a_command
# end
#
- # source://thor//lib/thor/base.rb#431
+ # source://thor//lib/thor/base.rb#530
def no_commands(&block); end
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#441
+ # source://thor//lib/thor/base.rb#540
def no_commands?; end
- # source://thor//lib/thor/base.rb#437
+ # source://thor//lib/thor/base.rb#536
def no_commands_context; end
# All methods defined inside the given block are not added as commands.
@@ -1847,7 +2145,7 @@ module Thor::Base::ClassMethods
# remove_command :this_is_not_a_command
# end
#
- # source://thor//lib/thor/base.rb#431
+ # source://thor//lib/thor/base.rb#530
def no_tasks(&block); end
# Allows to use private methods from parent in child classes as commands.
@@ -1860,7 +2158,7 @@ module Thor::Base::ClassMethods
# public_command :foo
# public_command :foo, :bar, :baz
#
- # source://thor//lib/thor/base.rb#507
+ # source://thor//lib/thor/base.rb#606
def public_command(*names); end
# Allows to use private methods from parent in child classes as commands.
@@ -1873,7 +2171,7 @@ module Thor::Base::ClassMethods
# public_command :foo
# public_command :foo, :bar, :baz
#
- # source://thor//lib/thor/base.rb#507
+ # source://thor//lib/thor/base.rb#606
def public_task(*names); end
# Removes a previous defined argument. If :undefine is given, undefine
@@ -1887,7 +2185,7 @@ module Thor::Base::ClassMethods
# remove_argument :foo
# remove_argument :foo, :bar, :baz, :undefine => true
#
- # source://thor//lib/thor/base.rb#327
+ # source://thor//lib/thor/base.rb#426
def remove_argument(*names); end
# Removes a previous defined class option.
@@ -1900,7 +2198,7 @@ module Thor::Base::ClassMethods
# remove_class_option :foo
# remove_class_option :foo, :bar, :baz
#
- # source://thor//lib/thor/base.rb#346
+ # source://thor//lib/thor/base.rb#445
def remove_class_option(*names); end
# Removes a given command from this Thor class. This is usually done if you
@@ -1915,7 +2213,7 @@ module Thor::Base::ClassMethods
# options:: You can give :undefine => true if you want commands the method
# to be undefined from the class as well.
#
- # source://thor//lib/thor/base.rb#401
+ # source://thor//lib/thor/base.rb#500
def remove_command(*names); end
# Removes a given command from this Thor class. This is usually done if you
@@ -1930,7 +2228,7 @@ module Thor::Base::ClassMethods
# options:: You can give :undefine => true if you want commands the method
# to be undefined from the class as well.
#
- # source://thor//lib/thor/base.rb#401
+ # source://thor//lib/thor/base.rb#500
def remove_task(*names); end
# Parses the command and options from the given args, instantiate the class
@@ -1941,7 +2239,7 @@ module Thor::Base::ClassMethods
# script = MyScript.new(args, options, config)
# script.invoke(:command, first_arg, second_arg, third_arg)
#
- # source://thor//lib/thor/base.rb#483
+ # source://thor//lib/thor/base.rb#582
def start(given_args = T.unsafe(nil), config = T.unsafe(nil)); end
# If true, option parsing is suspended as soon as an unknown option or a
@@ -1950,22 +2248,22 @@ module Thor::Base::ClassMethods
#
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#185
+ # source://thor//lib/thor/base.rb#201
def stop_on_unknown_option?(command_name); end
- # source://thor//lib/thor/base.rb#202
+ # source://thor//lib/thor/base.rb#218
def strict_args_position; end
# If you want only strict string args (useful when cascading thor classes),
# call strict_args_position! This is disabled by default to allow dynamic
# invocations.
#
- # source://thor//lib/thor/base.rb#198
+ # source://thor//lib/thor/base.rb#214
def strict_args_position!; end
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#206
+ # source://thor//lib/thor/base.rb#222
def strict_args_position?(config); end
# Returns the commands for this Thor class.
@@ -1974,7 +2272,7 @@ module Thor::Base::ClassMethods
# Hash:: An ordered hash with commands names as keys and Thor::Command
# objects as values.
#
- # source://thor//lib/thor/base.rb#372
+ # source://thor//lib/thor/base.rb#471
def tasks; end
protected
@@ -1982,12 +2280,12 @@ module Thor::Base::ClassMethods
# SIGNATURE: Sets the baseclass. This is where the superclass lookup
# finishes.
#
- # source://thor//lib/thor/base.rb#678
+ # source://thor//lib/thor/base.rb#777
def baseclass; end
# The basename of the program invoking the thor class.
#
- # source://thor//lib/thor/base.rb#672
+ # source://thor//lib/thor/base.rb#771
def basename; end
# Build an option and adds it to the given scope.
@@ -1997,7 +2295,7 @@ module Thor::Base::ClassMethods
# options:: Described in both class_option and method_option.
# scope:: Options hash that is being built up
#
- # source://thor//lib/thor/base.rb#589
+ # source://thor//lib/thor/base.rb#688
def build_option(name, options, scope); end
# Receives a hash of options, parse them and add to the scope. This is a
@@ -2008,83 +2306,100 @@ module Thor::Base::ClassMethods
# ==== Parameters
# Hash[Symbol => Object]
#
- # source://thor//lib/thor/base.rb#600
+ # source://thor//lib/thor/base.rb#699
def build_options(options, scope); end
+ # Get target(method_options or class_options) options
+ # of before and after by block evaluation.
+ #
+ # source://thor//lib/thor/base.rb#808
+ def built_option_names(target, opt = T.unsafe(nil), &block); end
+
# Prints the class options per group. If an option does not belong to
# any group, it's printed as Class option.
#
- # source://thor//lib/thor/base.rb#539
+ # source://thor//lib/thor/base.rb#638
def class_options_help(shell, groups = T.unsafe(nil)); end
+ # Get command scope member by name.
+ #
+ # source://thor//lib/thor/base.rb#816
+ def command_scope_member(name, options = T.unsafe(nil)); end
+
# SIGNATURE: Creates a new command if valid_command? is true. This method is
# called when a new method is added to the class.
#
- # source://thor//lib/thor/base.rb#683
+ # source://thor//lib/thor/base.rb#782
def create_command(meth); end
# SIGNATURE: Creates a new command if valid_command? is true. This method is
# called when a new method is added to the class.
#
- # source://thor//lib/thor/base.rb#683
+ # source://thor//lib/thor/base.rb#782
def create_task(meth); end
# SIGNATURE: The hook invoked by start.
#
# @raise [NotImplementedError]
#
- # source://thor//lib/thor/base.rb#693
+ # source://thor//lib/thor/base.rb#792
def dispatch(command, given_args, given_opts, config); end
# Finds a command with the given name. If the command belongs to the current
# class, just return it, otherwise dup it and add the fresh copy to the
# current command hash.
#
- # source://thor//lib/thor/base.rb#609
+ # source://thor//lib/thor/base.rb#708
def find_and_refresh_command(name); end
# Finds a command with the given name. If the command belongs to the current
# class, just return it, otherwise dup it and add the fresh copy to the
# current command hash.
#
- # source://thor//lib/thor/base.rb#609
+ # source://thor//lib/thor/base.rb#708
def find_and_refresh_task(name); end
# Retrieves a value from superclass. If it reaches the baseclass,
# returns default.
#
- # source://thor//lib/thor/base.rb#650
+ # source://thor//lib/thor/base.rb#749
def from_superclass(method, default = T.unsafe(nil)); end
# Every time someone inherits from a Thor class, register the klass
# and file into baseclass.
#
- # source://thor//lib/thor/base.rb#622
+ # source://thor//lib/thor/base.rb#721
def inherited(klass); end
# SIGNATURE: Defines behavior when the initialize method is added to the
# class.
#
- # source://thor//lib/thor/base.rb#689
+ # source://thor//lib/thor/base.rb#788
def initialize_added; end
# Raises an error if the word given is a Thor reserved word.
#
# @return [Boolean]
#
- # source://thor//lib/thor/base.rb#578
+ # source://thor//lib/thor/base.rb#677
def is_thor_reserved_word?(word, type); end
# Fire this callback whenever a method is added. Added methods are
# tracked as commands by invoking the create_command method.
#
- # source://thor//lib/thor/base.rb#630
+ # source://thor//lib/thor/base.rb#729
def method_added(meth); end
# Receives a set of options and print them.
#
- # source://thor//lib/thor/base.rb#557
+ # source://thor//lib/thor/base.rb#656
def print_options(shell, options, group_name = T.unsafe(nil)); end
+
+ # Register a relation of options for target(method_option/class_option)
+ # by args and block.
+ #
+ # source://thor//lib/thor/base.rb#798
+ def register_options_relation_for(target, relation, *args, &block); end
end
# source://thor//lib/thor/command.rb#2
@@ -2092,68 +2407,74 @@ class Thor::Command < ::Struct
# @return [Command] a new instance of Command
#
# source://thor//lib/thor/command.rb#5
- def initialize(name, description, long_description, usage, options = T.unsafe(nil)); end
+ def initialize(name, description, long_description, wrap_long_description, usage, options = T.unsafe(nil), options_relation = T.unsafe(nil)); end
# Returns the formatted usage by injecting given required arguments
# and required options into the given usage.
#
- # source://thor//lib/thor/command.rb#41
+ # source://thor//lib/thor/command.rb#42
def formatted_usage(klass, namespace = T.unsafe(nil), subcommand = T.unsafe(nil)); end
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#14
+ # source://thor//lib/thor/command.rb#15
def hidden?; end
+ # source://thor//lib/thor/command.rb#70
+ def method_at_least_one_option_names; end
+
+ # source://thor//lib/thor/command.rb#66
+ def method_exclusive_option_names; end
+
# By default, a command invokes a method in the thor class. You can change this
# implementation to create custom commands.
#
- # source://thor//lib/thor/command.rb#20
+ # source://thor//lib/thor/command.rb#21
def run(instance, args = T.unsafe(nil)); end
protected
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#105
+ # source://thor//lib/thor/command.rb#114
def handle_argument_error?(instance, error, caller); end
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#112
+ # source://thor//lib/thor/command.rb#121
def handle_no_method_error?(instance, error, caller); end
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#95
+ # source://thor//lib/thor/command.rb#104
def local_method?(instance, name); end
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#78
+ # source://thor//lib/thor/command.rb#87
def not_debugging?(instance); end
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#91
+ # source://thor//lib/thor/command.rb#100
def private_method?(instance); end
# Given a target, checks if this class name is a public method.
#
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#87
+ # source://thor//lib/thor/command.rb#96
def public_method?(instance); end
# Add usage with required arguments
#
- # source://thor//lib/thor/command.rb#68
+ # source://thor//lib/thor/command.rb#77
def required_arguments_for(klass, usage); end
- # source://thor//lib/thor/command.rb#82
+ # source://thor//lib/thor/command.rb#91
def required_options; end
- # source://thor//lib/thor/command.rb#100
+ # source://thor//lib/thor/command.rb#109
def sans_backtrace(backtrace, caller); end
private
@@ -2200,35 +2521,38 @@ class Thor::CoreExt::HashWithIndifferentAccess < ::Hash
# @return [Boolean]
#
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#41
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#45
def key?(key); end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#49
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#53
def merge(other); end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#53
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#57
def merge!(other); end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#68
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#72
def replace(other_hash); end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#60
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#64
def reverse_merge(other); end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#64
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#68
def reverse_merge!(other_hash); end
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#41
+ def slice(*keys); end
+
# Convert to a Hash with String keys.
#
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#73
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#77
def to_hash; end
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#45
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#49
def values_at(*indices); end
protected
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#79
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#83
def convert_key(key); end
# Magic predicates. For instance:
@@ -2237,33 +2561,33 @@ class Thor::CoreExt::HashWithIndifferentAccess < ::Hash
# options.shebang # => "/usr/lib/local/ruby"
# options.test_framework?(:rspec) # => options[:test_framework] == :rspec
#
- # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#89
+ # source://thor//lib/thor/core_ext/hash_with_indifferent_access.rb#93
def method_missing(method, *args); end
end
-# source://thor//lib/thor/error.rb#14
+# source://thor//lib/thor/error.rb#3
module Thor::Correctable
- # source://thor//lib/thor/error.rb#19
+ # source://thor//lib/thor/error.rb#8
def corrections; end
- # source://thor//lib/thor/error.rb#15
+ # source://thor//lib/thor/error.rb#4
def to_s; end
end
# A dynamic command that handles method missing scenarios.
#
-# source://thor//lib/thor/command.rb#128
+# source://thor//lib/thor/command.rb#137
class Thor::DynamicCommand < ::Thor::Command
# @return [DynamicCommand] a new instance of DynamicCommand
#
- # source://thor//lib/thor/command.rb#129
+ # source://thor//lib/thor/command.rb#138
def initialize(name, options = T.unsafe(nil)); end
- # source://thor//lib/thor/command.rb#133
+ # source://thor//lib/thor/command.rb#142
def run(instance, args = T.unsafe(nil)); end
end
-# source://thor//lib/thor/command.rb#141
+# source://thor//lib/thor/command.rb#150
Thor::DynamicTask = Thor::DynamicCommand
# Thor::Error is raised when it's caused by wrong usage of thor classes. Those
@@ -2273,9 +2597,12 @@ Thor::DynamicTask = Thor::DynamicCommand
# overwrites a thor keyword, SHOULD NOT raise a Thor::Error. This way, we
# ensure that developer errors are shown with full backtrace.
#
-# source://thor//lib/thor/error.rb#31
+# source://thor//lib/thor/error.rb#20
class Thor::Error < ::StandardError; end
+# source://thor//lib/thor/error.rb#101
+class Thor::ExclusiveArgumentError < ::Thor::InvocationError; end
+
# Thor has a special class called Thor::Group. The main difference to Thor class
# is that it invokes all commands at once. It also include some methods that allows
# invocations to be done at the class method, which are not available to Thor
@@ -2449,15 +2776,15 @@ Thor::HELP_MAPPINGS = T.let(T.unsafe(nil), Array)
# A command that is hidden in help messages but still invocable.
#
-# source://thor//lib/thor/command.rb#120
+# source://thor//lib/thor/command.rb#129
class Thor::HiddenCommand < ::Thor::Command
# @return [Boolean]
#
- # source://thor//lib/thor/command.rb#121
+ # source://thor//lib/thor/command.rb#130
def hidden?; end
end
-# source://thor//lib/thor/command.rb#125
+# source://thor//lib/thor/command.rb#134
Thor::HiddenTask = Thor::HiddenCommand
# source://thor//lib/thor/invocation.rb#2
@@ -2611,7 +2938,7 @@ end
# Raised when a command was found, but not invoked properly.
#
-# source://thor//lib/thor/error.rb#73
+# source://thor//lib/thor/error.rb#62
class Thor::InvocationError < ::Thor::Error; end
# source://thor//lib/thor/line_editor/basic.rb#2
@@ -2724,7 +3051,7 @@ class Thor::LineEditor::Readline::PathCompletion
def text; end
end
-# source://thor//lib/thor/error.rb#109
+# source://thor//lib/thor/error.rb#98
class Thor::MalformattedArgumentError < ::Thor::InvocationError; end
# source://thor//lib/thor/nested_context.rb#2
@@ -2751,12 +3078,6 @@ class Thor::NestedContext
def push; end
end
-# source://thor//lib/thor/error.rb#8
-class Thor::NoKwargSpellChecker < ::DidYouMean::SpellChecker
- # source://thor//lib/thor/error.rb#9
- def initialize(dictionary); end
-end
-
# source://thor//lib/thor/parser/option.rb#2
class Thor::Option < ::Thor::Argument
# @return [Option] a new instance of Option
@@ -2772,10 +3093,10 @@ class Thor::Option < ::Thor::Argument
# source://thor//lib/thor/parser/option.rb#99
def aliases_for_usage; end
- # source://thor//lib/thor/parser/option.rb#109
+ # source://thor//lib/thor/parser/option.rb#118
def array?; end
- # source://thor//lib/thor/parser/option.rb#109
+ # source://thor//lib/thor/parser/option.rb#118
def boolean?; end
# Returns the value of attribute group.
@@ -2783,7 +3104,7 @@ class Thor::Option < ::Thor::Argument
# source://thor//lib/thor/parser/option.rb#3
def group; end
- # source://thor//lib/thor/parser/option.rb#109
+ # source://thor//lib/thor/parser/option.rb#118
def hash?; end
# Returns the value of attribute hide.
@@ -2799,7 +3120,7 @@ class Thor::Option < ::Thor::Argument
# source://thor//lib/thor/parser/option.rb#3
def lazy_default; end
- # source://thor//lib/thor/parser/option.rb#109
+ # source://thor//lib/thor/parser/option.rb#118
def numeric?; end
# Returns the value of attribute repeatable.
@@ -2807,7 +3128,12 @@ class Thor::Option < ::Thor::Argument
# source://thor//lib/thor/parser/option.rb#3
def repeatable; end
- # source://thor//lib/thor/parser/option.rb#109
+ # @return [Boolean]
+ #
+ # source://thor//lib/thor/parser/option.rb#107
+ def show_default?; end
+
+ # source://thor//lib/thor/parser/option.rb#118
def string?; end
# source://thor//lib/thor/parser/option.rb#75
@@ -2818,25 +3144,30 @@ class Thor::Option < ::Thor::Argument
protected
- # source://thor//lib/thor/parser/option.rb#159
+ # source://thor//lib/thor/parser/option.rb#168
def dasherize(str); end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/option.rb#151
+ # source://thor//lib/thor/parser/option.rb#160
def dasherized?; end
- # source://thor//lib/thor/parser/option.rb#155
+ # source://thor//lib/thor/parser/option.rb#164
def undasherize(str); end
# @raise [ArgumentError]
#
- # source://thor//lib/thor/parser/option.rb#117
+ # source://thor//lib/thor/parser/option.rb#126
def validate!; end
- # source://thor//lib/thor/parser/option.rb#122
+ # source://thor//lib/thor/parser/option.rb#131
def validate_default_type!; end
+ private
+
+ # source://thor//lib/thor/parser/option.rb#174
+ def normalize_aliases(aliases); end
+
class << self
# This parse quick options given as method_options. It makes several
# assumptions, but you can be more specific using the option method.
@@ -2883,31 +3214,37 @@ class Thor::Options < ::Thor::Arguments
# @return [Options] a new instance of Options
#
# source://thor//lib/thor/parser/options.rb#32
- def initialize(hash_options = T.unsafe(nil), defaults = T.unsafe(nil), stop_on_unknown = T.unsafe(nil), disable_required_check = T.unsafe(nil)); end
+ def initialize(hash_options = T.unsafe(nil), defaults = T.unsafe(nil), stop_on_unknown = T.unsafe(nil), disable_required_check = T.unsafe(nil), relations = T.unsafe(nil)); end
+
+ # source://thor//lib/thor/parser/options.rb#156
+ def check_at_least_one!; end
+
+ # source://thor//lib/thor/parser/options.rb#144
+ def check_exclusive!; end
# @raise [UnknownArgumentError]
#
- # source://thor//lib/thor/parser/options.rb#141
+ # source://thor//lib/thor/parser/options.rb#168
def check_unknown!; end
- # source://thor//lib/thor/parser/options.rb#88
+ # source://thor//lib/thor/parser/options.rb#89
def parse(args); end
- # source://thor//lib/thor/parser/options.rb#64
+ # source://thor//lib/thor/parser/options.rb#65
def peek; end
- # source://thor//lib/thor/parser/options.rb#60
+ # source://thor//lib/thor/parser/options.rb#61
def remaining; end
- # source://thor//lib/thor/parser/options.rb#78
+ # source://thor//lib/thor/parser/options.rb#79
def shift; end
- # source://thor//lib/thor/parser/options.rb#83
+ # source://thor//lib/thor/parser/options.rb#84
def unshift(arg, is_value: T.unsafe(nil)); end
protected
- # source://thor//lib/thor/parser/options.rb#151
+ # source://thor//lib/thor/parser/options.rb#189
def assign_result!(option, result); end
# Check if the current value in peek is a registered switch.
@@ -2917,45 +3254,50 @@ class Thor::Options < ::Thor::Arguments
#
# @return [Boolean]
#
- # source://thor//lib/thor/parser/options.rb#165
+ # source://thor//lib/thor/parser/options.rb#203
def current_is_switch?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/options.rb#177
+ # source://thor//lib/thor/parser/options.rb#215
def current_is_switch_formatted?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/options.rb#187
+ # source://thor//lib/thor/parser/options.rb#225
def current_is_value?; end
+ # Option names changes to swith name or human name
+ #
+ # source://thor//lib/thor/parser/options.rb#179
+ def names_to_switch_names(names = T.unsafe(nil)); end
+
# Check if the given argument is actually a shortcut.
#
- # source://thor//lib/thor/parser/options.rb#206
+ # source://thor//lib/thor/parser/options.rb#244
def normalize_switch(arg); end
# Parse boolean values which can be given as --foo=true, --foo or --no-foo.
#
- # source://thor//lib/thor/parser/options.rb#217
+ # source://thor//lib/thor/parser/options.rb#255
def parse_boolean(switch); end
# Parse the value at the peek analyzing if it requires an input or not.
#
- # source://thor//lib/thor/parser/options.rb#235
+ # source://thor//lib/thor/parser/options.rb#273
def parse_peek(switch, option); end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/options.rb#210
+ # source://thor//lib/thor/parser/options.rb#248
def parsing_options?; end
# @return [Boolean]
#
- # source://thor//lib/thor/parser/options.rb#192
+ # source://thor//lib/thor/parser/options.rb#230
def switch?(arg); end
- # source://thor//lib/thor/parser/options.rb#196
+ # source://thor//lib/thor/parser/options.rb#234
def switch_option(arg); end
class << self
@@ -3019,7 +3361,7 @@ module Thor::RakeCompat
end
end
-# source://thor//lib/thor/error.rb#106
+# source://thor//lib/thor/error.rb#95
class Thor::RequiredArgumentMissingError < ::Thor::InvocationError; end
# source://thor//lib/thor/util.rb#4
@@ -3108,13 +3450,13 @@ module Thor::Shell
def _shared_configuration; end
end
-# source://thor//lib/thor/shell/basic.rb#3
+# source://thor//lib/thor/shell/basic.rb#7
class Thor::Shell::Basic
# Initialize base, mute and padding to nil.
#
# @return [Basic] a new instance of Basic
#
- # source://thor//lib/thor/shell/basic.rb#11
+ # source://thor//lib/thor/shell/basic.rb#13
def initialize; end
# Asks something to the user and receives a response.
@@ -3147,19 +3489,19 @@ class Thor::Shell::Basic
#
# ask("Where should the file be saved?", :path => true)
#
- # source://thor//lib/thor/shell/basic.rb#78
+ # source://thor//lib/thor/shell/basic.rb#80
def ask(statement, *args); end
# Returns the value of attribute base.
#
- # source://thor//lib/thor/shell/basic.rb#6
+ # source://thor//lib/thor/shell/basic.rb#8
def base; end
# Sets the attribute base
#
# @param value the value to set the attribute base to.
#
- # source://thor//lib/thor/shell/basic.rb#6
+ # source://thor//lib/thor/shell/basic.rb#8
def base=(_arg0); end
# Called if something goes wrong during the execution. This is used by Thor
@@ -3167,7 +3509,7 @@ class Thor::Shell::Basic
# wrong, you can always raise an exception. If you raise a Thor::Error, it
# will be rescued and wrapped in the method below.
#
- # source://thor//lib/thor/shell/basic.rb#342
+ # source://thor//lib/thor/shell/basic.rb#251
def error(statement); end
# Deals with file collision and returns true if the file should be
@@ -3178,24 +3520,24 @@ class Thor::Shell::Basic
# destination:: the destination file to solve conflicts
# block:: an optional block that returns the value to be used in diff and merge
#
- # source://thor//lib/thor/shell/basic.rb#285
+ # source://thor//lib/thor/shell/basic.rb#207
def file_collision(destination); end
# Sets the output padding while executing a block and resets it.
#
- # source://thor//lib/thor/shell/basic.rb#41
+ # source://thor//lib/thor/shell/basic.rb#43
def indent(count = T.unsafe(nil)); end
# Mute everything that's inside given block
#
- # source://thor//lib/thor/shell/basic.rb#20
+ # source://thor//lib/thor/shell/basic.rb#22
def mute; end
# Check if base is muted
#
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#29
+ # source://thor//lib/thor/shell/basic.rb#31
def mute?; end
# Make a question the to user and returns true if the user replies "n" or
@@ -3203,17 +3545,17 @@ class Thor::Shell::Basic
#
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#154
+ # source://thor//lib/thor/shell/basic.rb#156
def no?(statement, color = T.unsafe(nil)); end
# Returns the value of attribute padding.
#
- # source://thor//lib/thor/shell/basic.rb#7
+ # source://thor//lib/thor/shell/basic.rb#9
def padding; end
# Sets the output padding, not allowing less than zero values.
#
- # source://thor//lib/thor/shell/basic.rb#35
+ # source://thor//lib/thor/shell/basic.rb#37
def padding=(value); end
# Prints values in columns
@@ -3221,7 +3563,7 @@ class Thor::Shell::Basic
# ==== Parameters
# Array[String, String, ...]
#
- # source://thor//lib/thor/shell/basic.rb#163
+ # source://thor//lib/thor/shell/basic.rb#165
def print_in_columns(array); end
# Prints a table.
@@ -3232,8 +3574,9 @@ class Thor::Shell::Basic
# ==== Options
# indent:: Indent the first column by indent value.
# colwidth:: Force the first column to colwidth spaces wide.
+ # borders:: Adds ascii borders.
#
- # source://thor//lib/thor/shell/basic.rb#185
+ # source://thor//lib/thor/shell/basic.rb#180
def print_table(array, options = T.unsafe(nil)); end
# Prints a long string, word-wrapping the text to the current width of the
@@ -3245,7 +3588,7 @@ class Thor::Shell::Basic
# ==== Options
# indent:: Indent each line of the printed paragraph by indent value.
#
- # source://thor//lib/thor/shell/basic.rb#247
+ # source://thor//lib/thor/shell/basic.rb#194
def print_wrapped(message, options = T.unsafe(nil)); end
# Say (print) something to the user. If the sentence ends with a whitespace
@@ -3255,7 +3598,7 @@ class Thor::Shell::Basic
# ==== Example
# say("I know you knew that.")
#
- # source://thor//lib/thor/shell/basic.rb#96
+ # source://thor//lib/thor/shell/basic.rb#98
def say(message = T.unsafe(nil), color = T.unsafe(nil), force_new_line = T.unsafe(nil)); end
# Say (print) an error to the user. If the sentence ends with a whitespace
@@ -3265,7 +3608,7 @@ class Thor::Shell::Basic
# ==== Example
# say_error("error: something went wrong")
#
- # source://thor//lib/thor/shell/basic.rb#113
+ # source://thor//lib/thor/shell/basic.rb#115
def say_error(message = T.unsafe(nil), color = T.unsafe(nil), force_new_line = T.unsafe(nil)); end
# Say a status with the given color and appends the message. Since this
@@ -3273,110 +3616,89 @@ class Thor::Shell::Basic
# in log_status, avoiding the message from being shown. If a Symbol is
# given in log_status, it's used as the color.
#
- # source://thor//lib/thor/shell/basic.rb#128
+ # source://thor//lib/thor/shell/basic.rb#130
def say_status(status, message, log_status = T.unsafe(nil)); end
# Apply color to the given string with optional bold. Disabled in the
# Thor::Shell::Basic class.
#
- # source://thor//lib/thor/shell/basic.rb#349
+ # source://thor//lib/thor/shell/basic.rb#258
def set_color(string, *_arg1); end
- # source://thor//lib/thor/shell/basic.rb#326
- def terminal_width; end
-
# Make a question the to user and returns true if the user replies "y" or
# "yes".
#
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#147
+ # source://thor//lib/thor/shell/basic.rb#149
def yes?(statement, color = T.unsafe(nil)); end
protected
- # source://thor//lib/thor/shell/basic.rb#486
+ # source://thor//lib/thor/shell/basic.rb#362
def answer_match(possibilities, answer, case_insensitive); end
- # source://thor//lib/thor/shell/basic.rb#443
- def as_unicode; end
-
- # source://thor//lib/thor/shell/basic.rb#473
+ # source://thor//lib/thor/shell/basic.rb#349
def ask_filtered(statement, color, options); end
- # source://thor//lib/thor/shell/basic.rb#456
+ # source://thor//lib/thor/shell/basic.rb#332
def ask_simply(statement, color, options); end
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#360
+ # source://thor//lib/thor/shell/basic.rb#269
def can_display_colors?; end
- # Calculate the dynamic width of the terminal
- #
- # source://thor//lib/thor/shell/basic.rb#415
- def dynamic_width; end
-
- # source://thor//lib/thor/shell/basic.rb#419
- def dynamic_width_stty; end
-
- # source://thor//lib/thor/shell/basic.rb#423
- def dynamic_width_tput; end
-
- # source://thor//lib/thor/shell/basic.rb#387
- def file_collision_help; end
+ # source://thor//lib/thor/shell/basic.rb#296
+ def file_collision_help(block_given); end
- # source://thor//lib/thor/shell/basic.rb#507
+ # source://thor//lib/thor/shell/basic.rb#383
def git_merge_tool; end
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#377
+ # source://thor//lib/thor/shell/basic.rb#286
def is?(value); end
- # source://thor//lib/thor/shell/basic.rb#364
+ # source://thor//lib/thor/shell/basic.rb#273
def lookup_color(color); end
- # source://thor//lib/thor/shell/basic.rb#494
+ # source://thor//lib/thor/shell/basic.rb#370
def merge(destination, content); end
- # source://thor//lib/thor/shell/basic.rb#503
+ # source://thor//lib/thor/shell/basic.rb#379
def merge_tool; end
- # source://thor//lib/thor/shell/basic.rb#355
+ # source://thor//lib/thor/shell/basic.rb#264
def prepare_message(message, *color); end
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#410
+ # source://thor//lib/thor/shell/basic.rb#324
def quiet?; end
- # source://thor//lib/thor/shell/basic.rb#399
+ # source://thor//lib/thor/shell/basic.rb#313
def show_diff(destination, content); end
- # source://thor//lib/thor/shell/basic.rb#373
+ # source://thor//lib/thor/shell/basic.rb#282
def stderr; end
- # source://thor//lib/thor/shell/basic.rb#369
+ # source://thor//lib/thor/shell/basic.rb#278
def stdout; end
- # source://thor//lib/thor/shell/basic.rb#431
- def truncate(string, width); end
-
# @return [Boolean]
#
- # source://thor//lib/thor/shell/basic.rb#427
+ # source://thor//lib/thor/shell/basic.rb#328
def unix?; end
end
-# source://thor//lib/thor/shell/basic.rb#4
-Thor::Shell::Basic::DEFAULT_TERMINAL_WIDTH = T.let(T.unsafe(nil), Integer)
-
# Inherit from Thor::Shell::Basic and add set_color behavior. Check
# Thor::Shell::Basic to see all available methods.
#
-# source://thor//lib/thor/shell/color.rb#8
+# source://thor//lib/thor/shell/color.rb#9
class Thor::Shell::Color < ::Thor::Shell::Basic
+ include ::LCSDiff
+
# Set color by using a string or one of the defined constants. If a third
# option is set to true, it also adds bold to the string. This is based
# on Highline implementation and it automatically appends CLEAR to the end
@@ -3409,139 +3731,145 @@ class Thor::Shell::Color < ::Thor::Shell::Basic
# :on_cyan
# :on_white
#
- # source://thor//lib/thor/shell/color.rb#79
+ # source://thor//lib/thor/shell/color.rb#82
def set_color(string, *colors); end
protected
# @return [Boolean]
#
- # source://thor//lib/thor/shell/color.rb#107
+ # source://thor//lib/thor/shell/color.rb#110
def are_colors_disabled?; end
# @return [Boolean]
#
- # source://thor//lib/thor/shell/color.rb#103
+ # source://thor//lib/thor/shell/color.rb#106
def are_colors_supported?; end
# @return [Boolean]
#
- # source://thor//lib/thor/shell/color.rb#99
+ # source://thor//lib/thor/shell/color.rb#102
def can_display_colors?; end
-
- # Check if Diff::LCS is loaded. If it is, use it to create pretty output
- # for diff.
- #
- # @return [Boolean]
- #
- # source://thor//lib/thor/shell/color.rb#144
- def diff_lcs_loaded?; end
-
- # source://thor//lib/thor/shell/color.rb#127
- def output_diff_line(diff); end
-
- # Overwrite show_diff to show diff with colors if Diff::LCS is
- # available.
- #
- # source://thor//lib/thor/shell/color.rb#114
- def show_diff(destination, content); end
end
# Set the terminal's foreground ANSI color to black.
#
-# source://thor//lib/thor/shell/color.rb#15
+# source://thor//lib/thor/shell/color.rb#18
Thor::Shell::Color::BLACK = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to blue.
#
-# source://thor//lib/thor/shell/color.rb#23
+# source://thor//lib/thor/shell/color.rb#26
Thor::Shell::Color::BLUE = T.let(T.unsafe(nil), String)
# The start of an ANSI bold sequence.
#
-# source://thor//lib/thor/shell/color.rb#12
+# source://thor//lib/thor/shell/color.rb#15
Thor::Shell::Color::BOLD = T.let(T.unsafe(nil), String)
# Embed in a String to clear all previous ANSI sequences.
#
-# source://thor//lib/thor/shell/color.rb#10
+# source://thor//lib/thor/shell/color.rb#13
Thor::Shell::Color::CLEAR = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to cyan.
#
-# source://thor//lib/thor/shell/color.rb#27
+# source://thor//lib/thor/shell/color.rb#30
Thor::Shell::Color::CYAN = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to green.
#
-# source://thor//lib/thor/shell/color.rb#19
+# source://thor//lib/thor/shell/color.rb#22
Thor::Shell::Color::GREEN = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to magenta.
#
-# source://thor//lib/thor/shell/color.rb#25
+# source://thor//lib/thor/shell/color.rb#28
Thor::Shell::Color::MAGENTA = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to black.
#
-# source://thor//lib/thor/shell/color.rb#32
+# source://thor//lib/thor/shell/color.rb#35
Thor::Shell::Color::ON_BLACK = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to blue.
#
-# source://thor//lib/thor/shell/color.rb#40
+# source://thor//lib/thor/shell/color.rb#43
Thor::Shell::Color::ON_BLUE = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to cyan.
#
-# source://thor//lib/thor/shell/color.rb#44
+# source://thor//lib/thor/shell/color.rb#47
Thor::Shell::Color::ON_CYAN = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to green.
#
-# source://thor//lib/thor/shell/color.rb#36
+# source://thor//lib/thor/shell/color.rb#39
Thor::Shell::Color::ON_GREEN = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to magenta.
#
-# source://thor//lib/thor/shell/color.rb#42
+# source://thor//lib/thor/shell/color.rb#45
Thor::Shell::Color::ON_MAGENTA = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to red.
#
-# source://thor//lib/thor/shell/color.rb#34
+# source://thor//lib/thor/shell/color.rb#37
Thor::Shell::Color::ON_RED = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to white.
#
-# source://thor//lib/thor/shell/color.rb#46
+# source://thor//lib/thor/shell/color.rb#49
Thor::Shell::Color::ON_WHITE = T.let(T.unsafe(nil), String)
# Set the terminal's background ANSI color to yellow.
#
-# source://thor//lib/thor/shell/color.rb#38
+# source://thor//lib/thor/shell/color.rb#41
Thor::Shell::Color::ON_YELLOW = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to red.
#
-# source://thor//lib/thor/shell/color.rb#17
+# source://thor//lib/thor/shell/color.rb#20
Thor::Shell::Color::RED = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to white.
#
-# source://thor//lib/thor/shell/color.rb#29
+# source://thor//lib/thor/shell/color.rb#32
Thor::Shell::Color::WHITE = T.let(T.unsafe(nil), String)
# Set the terminal's foreground ANSI color to yellow.
#
-# source://thor//lib/thor/shell/color.rb#21
+# source://thor//lib/thor/shell/color.rb#24
Thor::Shell::Color::YELLOW = T.let(T.unsafe(nil), String)
+# source://thor//lib/thor/shell/column_printer.rb#5
+class Thor::Shell::ColumnPrinter
+ # @return [ColumnPrinter] a new instance of ColumnPrinter
+ #
+ # source://thor//lib/thor/shell/column_printer.rb#8
+ def initialize(stdout, options = T.unsafe(nil)); end
+
+ # Returns the value of attribute options.
+ #
+ # source://thor//lib/thor/shell/column_printer.rb#6
+ def options; end
+
+ # source://thor//lib/thor/shell/column_printer.rb#14
+ def print(array); end
+
+ # Returns the value of attribute stdout.
+ #
+ # source://thor//lib/thor/shell/column_printer.rb#6
+ def stdout; end
+end
+
# Inherit from Thor::Shell::Basic and add set_color behavior. Check
# Thor::Shell::Basic to see all available methods.
#
-# source://thor//lib/thor/shell/html.rb#8
+# source://thor//lib/thor/shell/html.rb#9
class Thor::Shell::HTML < ::Thor::Shell::Basic
+ include ::LCSDiff
+
# Ask something to the user and receives a response.
#
# ==== Example
@@ -3551,7 +3879,7 @@ class Thor::Shell::HTML < ::Thor::Shell::Basic
#
# @raise [NotImplementedError]
#
- # source://thor//lib/thor/shell/html.rb#70
+ # source://thor//lib/thor/shell/html.rb#73
def ask(statement, color = T.unsafe(nil)); end
# Set color by using a string or one of the defined constants. If a third
@@ -3559,122 +3887,174 @@ class Thor::Shell::HTML < ::Thor::Shell::Basic
# on Highline implementation and it automatically appends CLEAR to the end
# of the returned String.
#
- # source://thor//lib/thor/shell/html.rb#51
+ # source://thor//lib/thor/shell/html.rb#54
def set_color(string, *colors); end
protected
# @return [Boolean]
#
- # source://thor//lib/thor/shell/html.rb#76
+ # source://thor//lib/thor/shell/html.rb#79
def can_display_colors?; end
-
- # Check if Diff::LCS is loaded. If it is, use it to create pretty output
- # for diff.
- #
- # @return [Boolean]
- #
- # source://thor//lib/thor/shell/html.rb#113
- def diff_lcs_loaded?; end
-
- # source://thor//lib/thor/shell/html.rb#96
- def output_diff_line(diff); end
-
- # Overwrite show_diff to show diff with colors if Diff::LCS is
- # available.
- #
- # source://thor//lib/thor/shell/html.rb#83
- def show_diff(destination, content); end
end
# Set the terminal's foreground HTML color to black.
#
-# source://thor//lib/thor/shell/html.rb#13
+# source://thor//lib/thor/shell/html.rb#16
Thor::Shell::HTML::BLACK = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to blue.
#
-# source://thor//lib/thor/shell/html.rb#21
+# source://thor//lib/thor/shell/html.rb#24
Thor::Shell::HTML::BLUE = T.let(T.unsafe(nil), String)
# The start of an HTML bold sequence.
#
-# source://thor//lib/thor/shell/html.rb#10
+# source://thor//lib/thor/shell/html.rb#13
Thor::Shell::HTML::BOLD = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to cyan.
#
-# source://thor//lib/thor/shell/html.rb#25
+# source://thor//lib/thor/shell/html.rb#28
Thor::Shell::HTML::CYAN = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to green.
#
-# source://thor//lib/thor/shell/html.rb#17
+# source://thor//lib/thor/shell/html.rb#20
Thor::Shell::HTML::GREEN = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to magenta.
#
-# source://thor//lib/thor/shell/html.rb#23
+# source://thor//lib/thor/shell/html.rb#26
Thor::Shell::HTML::MAGENTA = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to black.
#
-# source://thor//lib/thor/shell/html.rb#30
+# source://thor//lib/thor/shell/html.rb#33
Thor::Shell::HTML::ON_BLACK = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to blue.
#
-# source://thor//lib/thor/shell/html.rb#38
+# source://thor//lib/thor/shell/html.rb#41
Thor::Shell::HTML::ON_BLUE = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to cyan.
#
-# source://thor//lib/thor/shell/html.rb#42
+# source://thor//lib/thor/shell/html.rb#45
Thor::Shell::HTML::ON_CYAN = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to green.
#
-# source://thor//lib/thor/shell/html.rb#34
+# source://thor//lib/thor/shell/html.rb#37
Thor::Shell::HTML::ON_GREEN = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to magenta.
#
-# source://thor//lib/thor/shell/html.rb#40
+# source://thor//lib/thor/shell/html.rb#43
Thor::Shell::HTML::ON_MAGENTA = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to red.
#
-# source://thor//lib/thor/shell/html.rb#32
+# source://thor//lib/thor/shell/html.rb#35
Thor::Shell::HTML::ON_RED = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to white.
#
-# source://thor//lib/thor/shell/html.rb#44
+# source://thor//lib/thor/shell/html.rb#47
Thor::Shell::HTML::ON_WHITE = T.let(T.unsafe(nil), String)
# Set the terminal's background HTML color to yellow.
#
-# source://thor//lib/thor/shell/html.rb#36
+# source://thor//lib/thor/shell/html.rb#39
Thor::Shell::HTML::ON_YELLOW = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to red.
#
-# source://thor//lib/thor/shell/html.rb#15
+# source://thor//lib/thor/shell/html.rb#18
Thor::Shell::HTML::RED = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to white.
#
-# source://thor//lib/thor/shell/html.rb#27
+# source://thor//lib/thor/shell/html.rb#30
Thor::Shell::HTML::WHITE = T.let(T.unsafe(nil), String)
# Set the terminal's foreground HTML color to yellow.
#
-# source://thor//lib/thor/shell/html.rb#19
+# source://thor//lib/thor/shell/html.rb#22
Thor::Shell::HTML::YELLOW = T.let(T.unsafe(nil), String)
# source://thor//lib/thor/shell.rb#24
Thor::Shell::SHELL_DELEGATED_METHODS = T.let(T.unsafe(nil), Array)
+# source://thor//lib/thor/shell/table_printer.rb#6
+class Thor::Shell::TablePrinter < ::Thor::Shell::ColumnPrinter
+ # @return [TablePrinter] a new instance of TablePrinter
+ #
+ # source://thor//lib/thor/shell/table_printer.rb#9
+ def initialize(stdout, options = T.unsafe(nil)); end
+
+ # source://thor//lib/thor/shell/table_printer.rb#18
+ def print(array); end
+
+ private
+
+ # source://thor//lib/thor/shell/table_printer.rb#120
+ def as_unicode; end
+
+ # source://thor//lib/thor/shell/table_printer.rb#72
+ def format_cell(column, row_size, index); end
+
+ # source://thor//lib/thor/shell/table_printer.rb#115
+ def indentation; end
+
+ # source://thor//lib/thor/shell/table_printer.rb#47
+ def prepare(array); end
+
+ # source://thor//lib/thor/shell/table_printer.rb#96
+ def print_border_separator; end
+
+ # source://thor//lib/thor/shell/table_printer.rb#103
+ def truncate(string); end
+end
+
+# source://thor//lib/thor/shell/table_printer.rb#7
+Thor::Shell::TablePrinter::BORDER_SEPARATOR = T.let(T.unsafe(nil), Symbol)
+
+# source://thor//lib/thor/shell/terminal.rb#3
+module Thor::Shell::Terminal
+ class << self
+ # source://thor//lib/thor/shell/terminal.rb#9
+ def terminal_width; end
+
+ # @return [Boolean]
+ #
+ # source://thor//lib/thor/shell/terminal.rb#20
+ def unix?; end
+
+ private
+
+ # Calculate the dynamic width of the terminal
+ #
+ # source://thor//lib/thor/shell/terminal.rb#27
+ def dynamic_width; end
+
+ # source://thor//lib/thor/shell/terminal.rb#31
+ def dynamic_width_stty; end
+
+ # source://thor//lib/thor/shell/terminal.rb#35
+ def dynamic_width_tput; end
+ end
+end
+
+# source://thor//lib/thor/shell/terminal.rb#4
+Thor::Shell::Terminal::DEFAULT_TERMINAL_WIDTH = T.let(T.unsafe(nil), Integer)
+
+# source://thor//lib/thor/shell/wrapped_printer.rb#6
+class Thor::Shell::WrappedPrinter < ::Thor::Shell::ColumnPrinter
+ # source://thor//lib/thor/shell/wrapped_printer.rb#7
+ def print(message); end
+end
+
# source://thor//lib/thor/base.rb#23
Thor::TEMPLATE_EXTNAME = T.let(T.unsafe(nil), String)
@@ -3683,89 +4063,89 @@ Thor::TEMPLATE_EXTNAME = T.let(T.unsafe(nil), String)
# source://thor//lib/thor/base.rb#20
Thor::THOR_RESERVED_WORDS = T.let(T.unsafe(nil), Array)
-# source://thor//lib/thor/command.rb#117
+# source://thor//lib/thor/command.rb#126
Thor::Task = Thor::Command
# Raised when a command was not found.
#
-# source://thor//lib/thor/error.rb#35
+# source://thor//lib/thor/error.rb#24
class Thor::UndefinedCommandError < ::Thor::Error
include ::Thor::Correctable
# @return [UndefinedCommandError] a new instance of UndefinedCommandError
#
- # source://thor//lib/thor/error.rb#54
+ # source://thor//lib/thor/error.rb#43
def initialize(command, all_commands, namespace); end
# Returns the value of attribute all_commands.
#
- # source://thor//lib/thor/error.rb#52
+ # source://thor//lib/thor/error.rb#41
def all_commands; end
# Returns the value of attribute command.
#
- # source://thor//lib/thor/error.rb#52
+ # source://thor//lib/thor/error.rb#41
def command; end
end
-# source://thor//lib/thor/error.rb#36
+# source://thor//lib/thor/error.rb#25
class Thor::UndefinedCommandError::SpellChecker
# @return [SpellChecker] a new instance of SpellChecker
#
- # source://thor//lib/thor/error.rb#39
+ # source://thor//lib/thor/error.rb#28
def initialize(error); end
- # source://thor//lib/thor/error.rb#43
+ # source://thor//lib/thor/error.rb#32
def corrections; end
# Returns the value of attribute error.
#
- # source://thor//lib/thor/error.rb#37
+ # source://thor//lib/thor/error.rb#26
def error; end
- # source://thor//lib/thor/error.rb#47
+ # source://thor//lib/thor/error.rb#36
def spell_checker; end
end
-# source://thor//lib/thor/error.rb#66
+# source://thor//lib/thor/error.rb#55
Thor::UndefinedTaskError = Thor::UndefinedCommandError
-# source://thor//lib/thor/error.rb#76
+# source://thor//lib/thor/error.rb#65
class Thor::UnknownArgumentError < ::Thor::Error
include ::Thor::Correctable
# @return [UnknownArgumentError] a new instance of UnknownArgumentError
#
- # source://thor//lib/thor/error.rb#96
+ # source://thor//lib/thor/error.rb#85
def initialize(switches, unknown); end
# Returns the value of attribute switches.
#
- # source://thor//lib/thor/error.rb#94
+ # source://thor//lib/thor/error.rb#83
def switches; end
# Returns the value of attribute unknown.
#
- # source://thor//lib/thor/error.rb#94
+ # source://thor//lib/thor/error.rb#83
def unknown; end
end
-# source://thor//lib/thor/error.rb#77
+# source://thor//lib/thor/error.rb#66
class Thor::UnknownArgumentError::SpellChecker
# @return [SpellChecker] a new instance of SpellChecker
#
- # source://thor//lib/thor/error.rb#80
+ # source://thor//lib/thor/error.rb#69
def initialize(error); end
- # source://thor//lib/thor/error.rb#84
+ # source://thor//lib/thor/error.rb#73
def corrections; end
# Returns the value of attribute error.
#
- # source://thor//lib/thor/error.rb#78
+ # source://thor//lib/thor/error.rb#67
def error; end
- # source://thor//lib/thor/error.rb#89
+ # source://thor//lib/thor/error.rb#78
def spell_checker; end
end
@@ -3806,7 +4186,7 @@ module Thor::Util
# ==== Returns
# String
#
- # source://thor//lib/thor/util.rb#263
+ # source://thor//lib/thor/util.rb#264
def escape_globs(path); end
# Returns a string that has had any HTML characters escaped.
@@ -3821,7 +4201,7 @@ module Thor::Util
# ==== Returns
# String
#
- # source://thor//lib/thor/util.rb#279
+ # source://thor//lib/thor/util.rb#280
def escape_html(string); end
# Receives a namespace and search for it in the Thor::Base subclasses.
@@ -3884,13 +4264,13 @@ module Thor::Util
# Where to look for Thor files.
#
- # source://thor//lib/thor/util.rb#212
+ # source://thor//lib/thor/util.rb#213
def globs_for(path); end
# Receives a path and load the thor file in the path. The file is evaluated
# inside the sandbox to avoid namespacing conflicts.
#
- # source://thor//lib/thor/util.rb#152
+ # source://thor//lib/thor/util.rb#153
def load_thorfile(path, content = T.unsafe(nil), debug = T.unsafe(nil)); end
# Receives a constant and converts it to a Thor namespace. Since Thor
@@ -3925,7 +4305,7 @@ module Thor::Util
# Return the path to the ruby interpreter taking into account multiple
# installations and windows extensions.
#
- # source://thor//lib/thor/util.rb#220
+ # source://thor//lib/thor/util.rb#221
def ruby_command; end
# Receives a string and convert it to snake case. SnakeCase returns snake_case.
@@ -3946,7 +4326,7 @@ module Thor::Util
# Returns the root where thor files are located, depending on the OS.
#
- # source://thor//lib/thor/util.rb#191
+ # source://thor//lib/thor/util.rb#192
def thor_root; end
# Returns the files in the thor root. On Windows thor_root will be something
@@ -3956,10 +4336,10 @@ module Thor::Util
#
# If we don't #gsub the \ character, Dir.glob will fail.
#
- # source://thor//lib/thor/util.rb#202
+ # source://thor//lib/thor/util.rb#203
def thor_root_glob; end
- # source://thor//lib/thor/util.rb#167
+ # source://thor//lib/thor/util.rb#168
def user_home; end
end
end
diff --git a/sorbet/rbi/gems/unparser@0.6.8.rbi b/sorbet/rbi/gems/unparser@0.6.8.rbi
deleted file mode 100644
index a885094..0000000
--- a/sorbet/rbi/gems/unparser@0.6.8.rbi
+++ /dev/null
@@ -1,8 +0,0 @@
-# typed: true
-
-# DO NOT EDIT MANUALLY
-# This is an autogenerated file for types exported from the `unparser` gem.
-# Please instead update this file by running `bin/tapioca gem unparser`.
-
-# THIS IS AN EMPTY RBI FILE.
-# see https://github.com/Shopify/tapioca#manually-requiring-parts-of-a-gem
diff --git a/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi b/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi
index 57614f2..75a2e4c 100644
--- a/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi
+++ b/sorbet/rbi/gems/yard-sorbet@0.8.1.rbi
@@ -381,7 +381,7 @@ class YARDSorbet::TStructProp < ::T::Struct
const :types, T::Array[::String]
class << self
- # source://sorbet-runtime/0.5.10900/lib/types/struct.rb#13
+ # source://sorbet-runtime/0.5.11212/lib/types/struct.rb#13
def inherited(s); end
end
end
diff --git a/sorbet/rbi/gems/yard@0.9.34.rbi b/sorbet/rbi/gems/yard@0.9.34.rbi
index 3951091..5fae9e6 100644
--- a/sorbet/rbi/gems/yard@0.9.34.rbi
+++ b/sorbet/rbi/gems/yard@0.9.34.rbi
@@ -7635,7 +7635,7 @@ class YARD::Logger < ::Logger
# source://yard//lib/yard/logging.rb#201
def format_log(sev, _time, _prog, msg); end
- # source://logger/1.5.3/logger.rb#682
+ # source://logger/1.6.0/logger.rb#684
def print_no_newline(msg); end
class << self
@@ -9972,7 +9972,7 @@ end
# source://yard//lib/yard/parser/ruby/ast_node.rb#479
class YARD::Parser::Ruby::MethodDefinitionNode < ::YARD::Parser::Ruby::AstNode
- def block(*_arg0); end
+ def block(n = T.unsafe(nil)); end
# @return [Boolean]
#
diff --git a/sorbet/rbi/gems/zeitwerk@2.6.8.rbi b/sorbet/rbi/gems/zeitwerk@2.6.12.rbi
similarity index 89%
rename from sorbet/rbi/gems/zeitwerk@2.6.8.rbi
rename to sorbet/rbi/gems/zeitwerk@2.6.12.rbi
index e1e9224..1726776 100644
--- a/sorbet/rbi/gems/zeitwerk@2.6.8.rbi
+++ b/sorbet/rbi/gems/zeitwerk@2.6.12.rbi
@@ -173,7 +173,7 @@ module Zeitwerk::Internal
def internal(method_name); end
end
-# source://zeitwerk//lib/zeitwerk/loader.rb#6
+# source://zeitwerk//lib/zeitwerk/loader.rb#7
class Zeitwerk::Loader
include ::Zeitwerk::RealModName
include ::Zeitwerk::Loader::Callbacks
@@ -185,27 +185,32 @@ class Zeitwerk::Loader
# @return [Loader] a new instance of Loader
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#98
+ # source://zeitwerk//lib/zeitwerk/loader.rb#99
def initialize; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#42
+ # source://zeitwerk//lib/zeitwerk/loader.rb#43
def __autoloaded_dirs; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#32
+ # source://zeitwerk//lib/zeitwerk/loader.rb#33
def __autoloads; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#76
+ # source://zeitwerk//lib/zeitwerk/loader.rb#77
def __namespace_dirs; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#260
+ # source://zeitwerk//lib/zeitwerk/loader.rb#310
def __shadowed_file?(file); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#87
+ # source://zeitwerk//lib/zeitwerk/loader.rb#88
def __shadowed_files; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#58
+ # source://zeitwerk//lib/zeitwerk/loader.rb#59
def __to_unload; end
+ # @raise [Zeitwerk::Error]
+ #
+ # source://zeitwerk//lib/zeitwerk/loader.rb#234
+ def cpath_expected_at(path); end
+
# Unloads all loaded code, and calls setup again so that the loader is able
# to pick any changes in the file system.
#
@@ -214,12 +219,12 @@ class Zeitwerk::Loader
#
# @raise [Zeitwerk::Error]
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#221
+ # source://zeitwerk//lib/zeitwerk/loader.rb#223
def reload; end
# Sets autoloads in the root namespaces.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#117
+ # source://zeitwerk//lib/zeitwerk/loader.rb#119
def setup; end
# Removes loaded constants and configured autoloads.
@@ -233,7 +238,7 @@ class Zeitwerk::Loader
# means `unload` + `setup`. This one is available to be used together with
# `unregister`, which is undocumented too.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#143
+ # source://zeitwerk//lib/zeitwerk/loader.rb#145
def unload; end
# Says if the given constant path would be unloaded on reload. This
@@ -241,31 +246,31 @@ class Zeitwerk::Loader
#
# @return [Boolean]
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#235
+ # source://zeitwerk//lib/zeitwerk/loader.rb#285
def unloadable_cpath?(cpath); end
# Returns an array with the constant paths that would be unloaded on reload.
# This predicate returns an empty array if reloading is disabled.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#243
+ # source://zeitwerk//lib/zeitwerk/loader.rb#293
def unloadable_cpaths; end
# This is a dangerous method.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#251
+ # source://zeitwerk//lib/zeitwerk/loader.rb#301
def unregister; end
private
- # source://zeitwerk//lib/zeitwerk/loader.rb#425
+ # source://zeitwerk//lib/zeitwerk/loader.rb#456
def autoload_file(parent, cname, file); end
# @return [Boolean]
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#483
+ # source://zeitwerk//lib/zeitwerk/loader.rb#514
def autoload_path_set_by_me_for?(parent, cname); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#395
+ # source://zeitwerk//lib/zeitwerk/loader.rb#426
def autoload_subdir(parent, cname, subdir); end
# We keep track of autoloaded directories to remove them from the registry
@@ -274,7 +279,7 @@ class Zeitwerk::Loader
# Files are removed as they are autoloaded, but directories need to wait due
# to concurrency (see why in Zeitwerk::Loader::Callbacks#on_dir_autoloaded).
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#42
+ # source://zeitwerk//lib/zeitwerk/loader.rb#43
def autoloaded_dirs; end
# Maps absolute paths for which an autoload has been set ---and not
@@ -285,18 +290,24 @@ class Zeitwerk::Loader
# "/Users/fxn/blog/app/models/hotel/pricing.rb" => [Hotel, :Pricing]
# ...
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#32
+ # source://zeitwerk//lib/zeitwerk/loader.rb#33
def autoloads; end
- # Returns the value of attribute mutex.
+ # source://zeitwerk//lib/zeitwerk/loader.rb#493
+ def define_autoload(parent, cname, abspath); end
+
+ # source://zeitwerk//lib/zeitwerk/loader.rb#410
+ def define_autoloads_for_dir(dir, parent); end
+
+ # Returns the value of attribute dirs_autoload_monitor.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#91
- def mutex; end
+ # source://zeitwerk//lib/zeitwerk/loader.rb#96
+ def dirs_autoload_monitor; end
- # Returns the value of attribute mutex2.
+ # Returns the value of attribute mutex.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#95
- def mutex2; end
+ # source://zeitwerk//lib/zeitwerk/loader.rb#92
+ def mutex; end
# Maps namespace constant paths to their respective directories.
#
@@ -312,31 +323,25 @@ class Zeitwerk::Loader
# and that its children are spread over those directories. We'll visit them
# to set up the corresponding autoloads.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#76
+ # source://zeitwerk//lib/zeitwerk/loader.rb#77
def namespace_dirs; end
# `dir` is the directory that would have autovivified a namespace. `file` is
# the file where we've found the namespace is explicitly defined.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#451
+ # source://zeitwerk//lib/zeitwerk/loader.rb#482
def promote_namespace_from_implicit_to_explicit(dir:, file:, parent:, cname:); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#497
+ # source://zeitwerk//lib/zeitwerk/loader.rb#528
def raise_if_conflicting_directory(dir); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#492
+ # source://zeitwerk//lib/zeitwerk/loader.rb#523
def register_explicit_namespace(cpath); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#522
+ # source://zeitwerk//lib/zeitwerk/loader.rb#552
def run_on_unload_callbacks(cpath, value, abspath); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#462
- def set_autoload(parent, cname, abspath); end
-
- # source://zeitwerk//lib/zeitwerk/loader.rb#360
- def set_autoloads_in_dir(dir, parent); end
-
- # source://zeitwerk//lib/zeitwerk/loader.rb#260
+ # source://zeitwerk//lib/zeitwerk/loader.rb#310
def shadowed_file?(file); end
# A shadowed file is a file managed by this loader that is ignored when
@@ -346,7 +351,7 @@ class Zeitwerk::Loader
# has only scanned the top-level, `shadowed_files` does not have shadowed
# files that may exist deep in the project tree yet.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#87
+ # source://zeitwerk//lib/zeitwerk/loader.rb#88
def shadowed_files; end
# Stores metadata needed for unloading. Its entries look like this:
@@ -361,44 +366,44 @@ class Zeitwerk::Loader
# If reloading is enabled, this hash is filled as constants are autoloaded
# or eager loaded. Otherwise, the collection remains empty.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#58
+ # source://zeitwerk//lib/zeitwerk/loader.rb#59
def to_unload; end
- # source://zeitwerk//lib/zeitwerk/loader.rb#529
+ # source://zeitwerk//lib/zeitwerk/loader.rb#559
def unload_autoload(parent, cname); end
- # source://zeitwerk//lib/zeitwerk/loader.rb#535
+ # source://zeitwerk//lib/zeitwerk/loader.rb#565
def unload_cref(parent, cname); end
class << self
# Returns an array with the absolute paths of the root directories of all
# registered loaders. This is a read-only collection.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#354
+ # source://zeitwerk//lib/zeitwerk/loader.rb#404
def all_dirs; end
# Returns the value of attribute default_logger.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#270
+ # source://zeitwerk//lib/zeitwerk/loader.rb#320
def default_logger; end
# Sets the attribute default_logger
#
# @param value the value to set the attribute default_logger to.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#270
+ # source://zeitwerk//lib/zeitwerk/loader.rb#320
def default_logger=(_arg0); end
# Broadcasts `eager_load` to all loaders. Those that have not been setup
# are skipped.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#326
+ # source://zeitwerk//lib/zeitwerk/loader.rb#376
def eager_load_all; end
# Broadcasts `eager_load_namespace` to all loaders. Those that have not
# been setup are skipped.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#340
+ # source://zeitwerk//lib/zeitwerk/loader.rb#390
def eager_load_namespace(mod); end
# This is a shortcut for
@@ -416,7 +421,7 @@ class Zeitwerk::Loader
# This method returns a subclass of Zeitwerk::Loader, but the exact type
# is private, client code can only rely on the interface.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#288
+ # source://zeitwerk//lib/zeitwerk/loader.rb#338
def for_gem(warn_on_extra_files: T.unsafe(nil)); end
# This is a shortcut for
@@ -434,7 +439,7 @@ class Zeitwerk::Loader
# This method returns a subclass of Zeitwerk::Loader, but the exact type
# is private, client code can only rely on the interface.
#
- # source://zeitwerk//lib/zeitwerk/loader.rb#309
+ # source://zeitwerk//lib/zeitwerk/loader.rb#359
def for_gem_extension(namespace); end
end
end
@@ -442,21 +447,13 @@ end
# source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#3
module Zeitwerk::Loader::Callbacks
include ::Zeitwerk::RealModName
+ extend ::Zeitwerk::Internal
- # Invoked from our decorated Kernel#require when a managed directory is
- # autoloaded.
- #
- # @private
- #
- # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#34
- def on_dir_autoloaded(dir); end
+ # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#41
+ def __on_dir_autoloaded(dir); end
- # Invoked from our decorated Kernel#require when a managed file is autoloaded.
- #
- # @private
- #
# source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#10
- def on_file_autoloaded(file); end
+ def __on_file_autoloaded(file); end
# Invoked when a class or module is created or reopened, either from the
# tracer or from module autovivification. If the namespace has matching
@@ -464,12 +461,18 @@ module Zeitwerk::Loader::Callbacks
#
# @private
#
- # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#73
+ # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#81
def on_namespace_loaded(namespace); end
private
- # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#84
+ # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#41
+ def on_dir_autoloaded(dir); end
+
+ # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#10
+ def on_file_autoloaded(file); end
+
+ # source://zeitwerk//lib/zeitwerk/loader/callbacks.rb#92
def run_on_load_callbacks(cpath, value, abspath); end
end
@@ -742,7 +745,7 @@ module Zeitwerk::Loader::EagerLoad
# @raise [Zeitwerk::SetupRequired]
#
- # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#72
+ # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#74
def eager_load_namespace(mod); end
# Loads the given Ruby file.
@@ -754,7 +757,7 @@ module Zeitwerk::Loader::EagerLoad
#
# @raise [Zeitwerk::Error]
#
- # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#114
+ # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#116
def load_file(path); end
private
@@ -762,13 +765,13 @@ module Zeitwerk::Loader::EagerLoad
# The caller is responsible for making sure `namespace` is the namespace that
# corresponds to `dir`.
#
- # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#154
+ # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#160
def actual_eager_load_dir(dir, namespace, force: T.unsafe(nil)); end
# In order to invoke this method, the caller has to ensure `child` is a
# strict namespace descendant of `root_namespace`.
#
- # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#189
+ # source://zeitwerk//lib/zeitwerk/loader/eager_load.rb#195
def eager_load_child_namespace(child, child_name, root_dir, root_namespace); end
end
@@ -786,6 +789,11 @@ module Zeitwerk::Loader::Helpers
# source://zeitwerk//lib/zeitwerk/loader/helpers.rb#134
def cget(parent, cname); end
+ # @raise [Zeitwerk::NameError]
+ #
+ # source://zeitwerk//lib/zeitwerk/loader/helpers.rb#149
+ def cname_for(basename, abspath); end
+
# Symbol#name was introduced in Ruby 3.0. It returns always the same
# frozen object, so we may save a few string allocations.
#
@@ -830,7 +838,10 @@ module Zeitwerk::Loader::Helpers
def walk_up(abspath); end
end
-# source://zeitwerk//lib/zeitwerk/loader.rb#20
+# source://zeitwerk//lib/zeitwerk/loader/helpers.rb#144
+module Zeitwerk::Loader::Helpers::CNAME_VALIDATOR; end
+
+# source://zeitwerk//lib/zeitwerk/loader.rb#21
Zeitwerk::Loader::MUTEX = T.let(T.unsafe(nil), Thread::Mutex)
# source://zeitwerk//lib/zeitwerk/error.rb#13
diff --git a/sorbet/tapioca/config.yml b/sorbet/tapioca/config.yml
index 886ae58..306486f 100644
--- a/sorbet/tapioca/config.yml
+++ b/sorbet/tapioca/config.yml
@@ -1,13 +1,4 @@
gem:
- # Add your `gem` command parameters here:
- #
- # exclude:
- # - gem_name
- # doc: true
- # workers: 5
-dsl:
- # Add your `dsl` command parameters here:
- #
- # exclude:
- # - SomeGeneratorName
- # workers: 5
+ exclude:
+ - rdoc
+ workers: 5
diff --git a/test/test_data/failure.out b/test/test_data/failure.out
index 87c4364..5acb114 100644
--- a/test/test_data/failure.out
+++ b/test/test_data/failure.out
@@ -36,6 +36,6 @@ test/test_data/failure.rb:33: Method `upcase` does not exist on `Integer` https:
test/test_data/failure.rb:33: Replace with `phase`
33 | success.payload_or(1).upcase
^^^^^^
- https://github.com/sorbet/sorbet/tree/3f358c0278fe2cd5b1dd717d7e0acc7738224b84/rbi/core/integer.rbi#L921: Defined here
+ https://github.com/sorbet/sorbet/tree/6440c695688b98f9405bc080c119a2468a6b45ea/rbi/core/integer.rbi#L921: Defined here
921 | def phase(); end
^^^^^^^^^^^
diff --git a/test/test_data/success.out b/test/test_data/success.out
index 8f5358e..cc26980 100644
--- a/test/test_data/success.out
+++ b/test/test_data/success.out
@@ -36,6 +36,6 @@ test/test_data/success.rb:33: Method `upcase` does not exist on `Integer` compon
test/test_data/success.rb:33: Replace with `phase`
33 | success.payload_or(1).upcase
^^^^^^
- https://github.com/sorbet/sorbet/tree/3f358c0278fe2cd5b1dd717d7e0acc7738224b84/rbi/core/integer.rbi#L921: Defined here
+ https://github.com/sorbet/sorbet/tree/6440c695688b98f9405bc080c119a2468a6b45ea/rbi/core/integer.rbi#L921: Defined here
921 | def phase(); end
^^^^^^^^^^^